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
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 <experimental/algorithm>
36 #include <experimental/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::experimental::boyer_moore_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::experimental::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
78 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1), sa);
79
80 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};
81 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
82 int ic[] = {1};
83 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
84 int id[] = {1, 2};
85 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
86 int ie[] = {1, 2, 3};
87 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3);
88 int ig[] = {1, 2, 3, 4};
89 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
90 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};
91 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
92 int ii[] = {1, 1, 2};
93 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
94 }
95
96 template <class Iter1, class Iter2>
97 void
test2()98 test2()
99 {
100 char ia[] = {0, 1, 2, 3, 4, 5};
101 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
102 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
103 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa);
104 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa);
105 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0);
106 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa);
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), Iter2(ia+2), Iter2(ia+3), Iter1(ia), 0);
109 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa);
110 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa);
111 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa);
112 do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1), (sa-1)*sa);
113 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1), sa);
114 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};
115 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
116 char ic[] = {1};
117 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
118 char id[] = {1, 2};
119 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
120 char ie[] = {1, 2, 3};
121 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3);
122 char ig[] = {1, 2, 3, 4};
123 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
124 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};
125 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
126 char ii[] = {1, 1, 2};
127 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
128 }
129
main()130 int main() {
131 test<random_access_iterator<const int*>, random_access_iterator<const int*> >();
132 test2<random_access_iterator<const char*>, random_access_iterator<const char*> >();
133 }
134