142 lines · cpp
1//===----------------------------------------------------------------------===//2//3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.4// See https://llvm.org/LICENSE.txt for license information.5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception6//7//===----------------------------------------------------------------------===//8 9// UNSUPPORTED: c++03, c++11, c++1410 11// <functional>12 13// boyer_moore searcher14// template<class RandomAccessIterator1,15// class Hash = hash<typename iterator_traits<RandomAccessIterator1>::value_type>,16// class BinaryPredicate = equal_to<>>17// class boyer_moore_searcher {18// public:19// boyer_moore_searcher(RandomAccessIterator1 pat_first, RandomAccessIterator1 pat_last,20// Hash hf = Hash(), BinaryPredicate pred = BinaryPredicate());21//22// template<class RandomAccessIterator2>23// pair<RandomAccessIterator2, RandomAccessIterator2>24// operator()(RandomAccessIterator2 first, RandomAccessIterator2 last) const;25//26// private:27// RandomAccessIterator1 pat_first_; // exposition only28// RandomAccessIterator1 pat_last_; // exposition only29// Hash hash_; // exposition only30// BinaryPredicate pred_; // exposition only31// };32 33 34#include <algorithm>35#include <cassert>36#include <functional>37#include <string>38 39#include "test_macros.h"40#include "test_iterators.h"41 42template <typename Iter1, typename Iter2>43void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) {44 std::boyer_moore_searcher<Iter2> s{b2, e2};45 assert(result == std::search(b1, e1, s));46}47 48template <class Iter1, class Iter2>49void50test()51{52 int ia[] = {0, 1, 2, 3, 4, 5};53 const unsigned sa = sizeof(ia)/sizeof(ia[0]);54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia));55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia));56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1));57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia));58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2));59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2));60 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia));61 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1));62 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3));63 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia));64 do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1));65 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1));66 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};67 const unsigned sb = sizeof(ib)/sizeof(ib[0]);68 int ic[] = {1};69 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1));70 int id[] = {1, 2};71 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1));72 int ie[] = {1, 2, 3};73 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4));74 int ig[] = {1, 2, 3, 4};75 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));76 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};77 const unsigned sh = sizeof(ih)/sizeof(ih[0]);78 int ii[] = {1, 1, 2};79 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));80 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0};81 const unsigned sj = sizeof(ij)/sizeof(ij[0]);82 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0};83 const unsigned sk = sizeof(ik)/sizeof(ik[0]);84 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6));85}86 87template <class Iter1, class Iter2>88void89test2()90{91 char ia[] = {0, 1, 2, 3, 4, 5};92 const unsigned sa = sizeof(ia)/sizeof(ia[0]);93 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia));94 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia));95 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1));96 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia));97 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2));98 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2));99 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia));100 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1));101 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3));102 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia));103 do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1));104 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1));105 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};106 const unsigned sb = sizeof(ib)/sizeof(ib[0]);107 char ic[] = {1};108 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1));109 char id[] = {1, 2};110 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1));111 char ie[] = {1, 2, 3};112 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4));113 char ig[] = {1, 2, 3, 4};114 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));115 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};116 const unsigned sh = sizeof(ih)/sizeof(ih[0]);117 char ii[] = {1, 1, 2};118 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));119 char ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0};120 const unsigned sj = sizeof(ij)/sizeof(ij[0]);121 char ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0};122 const unsigned sk = sizeof(ik)/sizeof(ik[0]);123 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6));124}125 126void test_custom_pred() {127 std::string long_string(1024, '0');128 std::boyer_moore_searcher searcher(std::begin(long_string), std::end(long_string));129 const char str[] = "1234";130 auto ret = searcher(std::begin(str), std::end(str));131 assert(ret.first == std::end(str));132 assert(ret.second == std::end(str));133}134 135int main(int, char**) {136 test<random_access_iterator<const int*>, random_access_iterator<const int*> >();137 test2<random_access_iterator<const char*>, random_access_iterator<const char*> >();138 test_custom_pred();139 140 return 0;141}142