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