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