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, c++14
10
11// <functional>
12
13// boyer_moore_horspool searcher
14// template<class RandomAccessIterator1,
15// class Hash = hash<typename iterator_traits<RandomAccessIterator1>::value_type>,
16// class BinaryPredicate = equal_to<>>
17// class boyer_moore_horspool_searcher {
18// public:
19// boyer_moore_horspool_searcher(RandomAccessIterator1 pat_first, RandomAccessIterator1 pat_last,
20// Hash hf = Hash(), BinaryPredicate pred = BinaryPredicate());
21//
22// template<class RandomAccessIterator2>
23// pair<RandomAccessIterator2, RandomAccessIterator2>
24// operator()(RandomAccessIterator2 first, RandomAccessIterator2 last) const;
25//
26// private:
27// RandomAccessIterator1 pat_first_; // exposition only
28// RandomAccessIterator1 pat_last_; // exposition only
29// Hash hash_; // exposition only
30// BinaryPredicate pred_; // exposition only
31// };
32
33#include <algorithm>
34#include <functional>
35#include <cassert>
36
37#include "test_macros.h"
38#include "test_iterators.h"
39
40struct count_equal
41{
42 static unsigned count;
43 template <class T>
44 bool operator()(const T& x, const T& y) const
45 {++count; return x == y;}
46};
47
48unsigned count_equal::count = 0;
49
50template <typename Iter1, typename Iter2>
51void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) {
52 std::boyer_moore_horspool_searcher<Iter2,
53 typename std::hash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>, count_equal> s{b2, e2};
54 count_equal::count = 0;
55 assert(result == std::search(b1, e1, s));
56 assert(count_equal::count <= max_count);
57}
58
59template <class Iter1, class Iter2>
60void
61test()
62{
63 int ia[] = {0, 1, 2, 3, 4, 5};
64 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
65 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa);
67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa);
68 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0);
69 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa);
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), Iter2(ia+2), Iter2(ia+3), Iter1(ia), 0);
72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa);
73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa);
74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa);
75 do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1), (sa-1)*sa);
76 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1), sa);
77 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};
78 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
79 int ic[] = {1};
80 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
81 int id[] = {1, 2};
82 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
83 int ie[] = {1, 2, 3};
84 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3);
85 int ig[] = {1, 2, 3, 4};
86 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
87 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};
88 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
89 int ii[] = {1, 1, 2};
90 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
91}
92
93template <class Iter1, class Iter2>
94void
95test2()
96{
97 char ia[] = {0, 1, 2, 3, 4, 5};
98 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
99 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
100 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa);
101 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa);
102 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0);
103 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa);
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), Iter2(ia+2), Iter2(ia+3), Iter1(ia), 0);
106 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa);
107 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa);
108 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa);
109 do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1), (sa-1)*sa);
110 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1), sa);
111 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};
112 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
113 char ic[] = {1};
114 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
115 char id[] = {1, 2};
116 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
117 char ie[] = {1, 2, 3};
118 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3);
119 char ig[] = {1, 2, 3, 4};
120 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
121 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};
122 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
123 char ii[] = {1, 1, 2};
124 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
125}
126
127int main(int, char**) {
128 test<random_access_iterator<const int*>, random_access_iterator<const int*> >();
129 test2<random_access_iterator<const char*>, random_access_iterator<const char*> >();
130
131 return 0;
132}
133

source code of libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/pred.pass.cpp