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-exception 6 // 7 //===----------------------------------------------------------------------===// 8 9 // UNSUPPORTED: c++98, c++03, c++11, c++14 10 // XFAIL: libc++ 11 12 // <functional> 13 14 // boyer_moore searcher 15 // template<class RandomAccessIterator1, 16 // class Hash = hash<typename iterator_traits<RandomAccessIterator1>::value_type>, 17 // class BinaryPredicate = equal_to<>> 18 // class boyer_moore_searcher { 19 // public: 20 // boyer_moore_searcher(RandomAccessIterator1 pat_first, RandomAccessIterator1 pat_last, 21 // Hash hf = Hash(), BinaryPredicate pred = BinaryPredicate()); 22 // 23 // template<class RandomAccessIterator2> 24 // pair<RandomAccessIterator2, RandomAccessIterator2> 25 // operator()(RandomAccessIterator2 first, RandomAccessIterator2 last) const; 26 // 27 // private: 28 // RandomAccessIterator1 pat_first_; // exposition only 29 // RandomAccessIterator1 pat_last_; // exposition only 30 // Hash hash_; // exposition only 31 // BinaryPredicate pred_; // exposition only 32 // }; 33 34 35 #include <algorithm> 36 #include <functional> 37 #include <cassert> 38 39 #include "test_macros.h" 40 #include "test_iterators.h" 41 42 struct count_equal 43 { 44 static unsigned count; 45 template <class T> 46 bool operator()(const T& x, const T& y) const 47 {++count; return x == y;} 48 }; 49 50 unsigned count_equal::count = 0; 51 52 template <typename Iter1, typename Iter2> 53 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { 54 std::boyer_moore_searcher<Iter2, 55 typename std::hash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>, count_equal> s{b2, e2}; 56 count_equal::count = 0; 57 assert(result == std::search(b1, e1, s)); 58 assert(count_equal::count <= max_count); 59 } 60 61 template <class Iter1, class Iter2> 62 void 63 test() 64 { 65 int ia[] = {0, 1, 2, 3, 4, 5}; 66 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 68 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); 69 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); 70 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); 71 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); 72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); 73 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia), 0); 74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa); 75 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa); 76 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); 77 do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1), (sa-1)*sa); 78 79 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1), sa); 80 81 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; 82 const unsigned sb = sizeof(ib)/sizeof(ib[0]); 83 int ic[] = {1}; 84 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); 85 int id[] = {1, 2}; 86 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); 87 int ie[] = {1, 2, 3}; 88 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); 89 int ig[] = {1, 2, 3, 4}; 90 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); 91 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; 92 const unsigned sh = sizeof(ih)/sizeof(ih[0]); 93 int ii[] = {1, 1, 2}; 94 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); 95 } 96 97 template <class Iter1, class Iter2> 98 void 99 test2() 100 { 101 char ia[] = {0, 1, 2, 3, 4, 5}; 102 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 103 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 104 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); 105 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); 106 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); 107 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); 108 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); 109 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia), 0); 110 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa); 111 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa); 112 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); 113 do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1), (sa-1)*sa); 114 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1), sa); 115 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; 116 const unsigned sb = sizeof(ib)/sizeof(ib[0]); 117 char ic[] = {1}; 118 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); 119 char id[] = {1, 2}; 120 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); 121 char ie[] = {1, 2, 3}; 122 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); 123 char ig[] = {1, 2, 3, 4}; 124 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); 125 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; 126 const unsigned sh = sizeof(ih)/sizeof(ih[0]); 127 char ii[] = {1, 1, 2}; 128 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); 129 } 130 131 int main(int, char**) { 132 test<random_access_iterator<const int*>, random_access_iterator<const int*> >(); 133 test2<random_access_iterator<const char*>, random_access_iterator<const char*> >(); 134 135 return 0; 136 } 137