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