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 searcher 16 // template<class RandomAccessIterator1, 17 // class Hash = hash<typename iterator_traits<RandomAccessIterator1>::value_type>, 18 // class BinaryPredicate = equal_to<>> 19 // class boyer_moore_searcher { 20 // public: 21 // boyer_moore_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 36 #include <algorithm> 37 #include <functional> 38 #include <cassert> 39 40 #include "test_iterators.h" 41 42 template <typename Iter1, typename Iter2> 43 void 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 48 template <class Iter1, class Iter2> 49 void 50 test() 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 87 template <class Iter1, class Iter2> 88 void 89 test2() 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 126 int main() { 127 test<random_access_iterator<const int*>, random_access_iterator<const int*> >(); 128 test2<random_access_iterator<const char*>, random_access_iterator<const char*> >(); 129 } 130
