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 struct count_equal
42 {
43 static unsigned count;
44 template <class T>
operator ()count_equal45 bool operator()(const T& x, const T& y) const
46 {++count; return x == y;}
47 };
48
49 unsigned count_equal::count = 0;
50
51 template <typename Iter1, typename Iter2>
do_search(Iter1 b1,Iter1 e1,Iter2 b2,Iter2 e2,Iter1 result,unsigned max_count)52 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) {
53 std::boyer_moore_horspool_searcher<Iter2,
54 typename std::hash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>, count_equal> s{b2, e2};
55 count_equal::count = 0;
56 assert(result == std::search(b1, e1, s));
57 assert(count_equal::count <= max_count);
58 }
59
60 template <class Iter1, class Iter2>
61 void
test()62 test()
63 {
64 int ia[] = {0, 1, 2, 3, 4, 5};
65 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa);
68 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa);
69 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0);
70 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa);
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), Iter2(ia+2), Iter2(ia+3), Iter1(ia), 0);
73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa);
74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa);
75 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa);
76 do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1), (sa-1)*sa);
77 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1), sa);
78 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};
79 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
80 int ic[] = {1};
81 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
82 int id[] = {1, 2};
83 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
84 int ie[] = {1, 2, 3};
85 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3);
86 int ig[] = {1, 2, 3, 4};
87 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
88 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};
89 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
90 int ii[] = {1, 1, 2};
91 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
92 }
93
94 template <class Iter1, class Iter2>
95 void
test2()96 test2()
97 {
98 char ia[] = {0, 1, 2, 3, 4, 5};
99 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
100 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
101 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa);
102 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa);
103 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0);
104 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa);
105 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa);
106 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia), 0);
107 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa);
108 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa);
109 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa);
110 do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1), (sa-1)*sa);
111 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1), sa);
112 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};
113 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
114 char ic[] = {1};
115 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
116 char id[] = {1, 2};
117 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
118 char ie[] = {1, 2, 3};
119 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3);
120 char ig[] = {1, 2, 3, 4};
121 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
122 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};
123 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
124 char ii[] = {1, 1, 2};
125 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
126 }
127
main()128 int main() {
129 test<random_access_iterator<const int*>, random_access_iterator<const int*> >();
130 test2<random_access_iterator<const char*>, random_access_iterator<const char*> >();
131 }
132