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 // template<class ForwardIterator, class BinaryPredicate = equal_to<>>
15 // default_searcher<ForwardIterator, BinaryPredicate>
16 // make_default_searcher(ForwardIterator pat_first, ForwardIterator pat_last,
17 // BinaryPredicate pred = BinaryPredicate());
18
19
20 #include <experimental/algorithm>
21 #include <experimental/functional>
22 #include <cassert>
23
24 #include "test_macros.h"
25 #include "test_iterators.h"
26
27 struct count_equal
28 {
29 static unsigned count;
30 template <class T>
operator ()count_equal31 bool operator()(const T& x, const T& y)
32 {++count; return x == y;}
33 };
34
35 unsigned count_equal::count = 0;
36
37 template <typename Iter1, typename Iter2>
do_search(Iter1 b1,Iter1 e1,Iter2 b2,Iter2 e2,Iter1 result,unsigned max_count)38 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) {
39 count_equal::count = 0;
40 assert(result == std::experimental::search(b1, e1,
41 std::experimental::make_default_searcher(b2, e2)));
42 assert(count_equal::count <= max_count);
43 }
44
45 template <class Iter1, class Iter2>
46 void
test()47 test()
48 {
49 int ia[] = {0, 1, 2, 3, 4, 5};
50 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
51 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
52 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa);
53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa);
54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0);
55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa);
56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa);
57 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia), 0);
58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa);
59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa);
60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa);
61 do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1), (sa-1)*sa);
62 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1), sa);
63 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};
64 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
65 int ic[] = {1};
66 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
67 int id[] = {1, 2};
68 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
69 int ie[] = {1, 2, 3};
70 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3);
71 int ig[] = {1, 2, 3, 4};
72 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
73 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};
74 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
75 int ii[] = {1, 1, 2};
76 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
77 }
78
main(int,char **)79 int main(int, char**) {
80 test<forward_iterator<const int*>, forward_iterator<const int*> >();
81 test<forward_iterator<const int*>, bidirectional_iterator<const int*> >();
82 test<forward_iterator<const int*>, random_access_iterator<const int*> >();
83 test<bidirectional_iterator<const int*>, forward_iterator<const int*> >();
84 test<bidirectional_iterator<const int*>, bidirectional_iterator<const int*> >();
85 test<bidirectional_iterator<const int*>, random_access_iterator<const int*> >();
86 test<random_access_iterator<const int*>, forward_iterator<const int*> >();
87 test<random_access_iterator<const int*>, bidirectional_iterator<const int*> >();
88 test<random_access_iterator<const int*>, random_access_iterator<const int*> >();
89
90 return 0;
91 }
92