1 //===----------------------------------------------------------------------===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8
9 // UNSUPPORTED: c++03, c++11
10 // ADDITIONAL_COMPILE_FLAGS: -D_LIBCPP_NO_EXPERIMENTAL_DEPRECATION_WARNING_SEARCHERS
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 #include <string>
39
40 #include "test_macros.h"
41 #include "test_iterators.h"
42
43 template <typename Iter1, typename Iter2>
do_search(Iter1 b1,Iter1 e1,Iter2 b2,Iter2 e2,Iter1 result)44 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) {
45 std::experimental::boyer_moore_searcher<Iter2> s{b2, e2};
46 assert(result == std::experimental::search(b1, e1, s));
47 }
48
49 template <class Iter1, class Iter2>
50 void
test()51 test()
52 {
53 int ia[] = {0, 1, 2, 3, 4, 5};
54 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia));
56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia));
57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1));
58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia));
59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2));
60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2));
61 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia));
62 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1));
63 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3));
64 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia));
65 do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1));
66 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1));
67 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};
68 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
69 int ic[] = {1};
70 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1));
71 int id[] = {1, 2};
72 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1));
73 int ie[] = {1, 2, 3};
74 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4));
75 int ig[] = {1, 2, 3, 4};
76 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
77 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};
78 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
79 int ii[] = {1, 1, 2};
80 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
81 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0};
82 const unsigned sj = sizeof(ij)/sizeof(ij[0]);
83 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0};
84 const unsigned sk = sizeof(ik)/sizeof(ik[0]);
85 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6));
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));
95 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia));
96 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1));
97 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia));
98 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2));
99 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2));
100 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia));
101 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1));
102 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3));
103 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia));
104 do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1));
105 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1));
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));
110 char id[] = {1, 2};
111 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1));
112 char ie[] = {1, 2, 3};
113 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4));
114 char ig[] = {1, 2, 3, 4};
115 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
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));
120 char ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0};
121 const unsigned sj = sizeof(ij)/sizeof(ij[0]);
122 char ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0};
123 const unsigned sk = sizeof(ik)/sizeof(ik[0]);
124 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6));
125 }
126
127 template <class Iter1, class Iter2>
test_large_str()128 void test_large_str() {
129 std::vector<signed char> data(257, 'a');
130 data[254] = 'b';
131 data[255] = 'b';
132 data[256] = 'b';
133 const signed char find[] = {'b', 'b', 'b'};
134 do_search(Iter1(data.data()), Iter1(data.data() + data.size()),
135 Iter2(find), Iter2(find + 3),
136 Iter1(data.data() + 254));
137 }
138
test_custom_pred()139 void test_custom_pred() {
140 std::string long_string(1024, '0');
141 auto searcher = std::experimental::make_boyer_moore_searcher(std::begin(long_string), std::end(long_string));
142 const char str[] = "1234";
143 auto ret = searcher(std::begin(str), std::end(str));
144 assert(ret.first == std::end(str));
145 assert(ret.second == std::end(str));
146 }
147
main(int,char **)148 int main(int, char**) {
149 test<random_access_iterator<const int*>, random_access_iterator<const int*> >();
150 test2<random_access_iterator<const char*>, random_access_iterator<const char*> >();
151 test_large_str<random_access_iterator<const signed char*>, random_access_iterator<const signed char*>>();
152 test_custom_pred();
153
154 return 0;
155 }
156