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 // <functional>
10
11 // UNSUPPORTED: c++03, c++11
12 // ADDITIONAL_COMPILE_FLAGS: -D_LIBCPP_NO_EXPERIMENTAL_DEPRECATION_WARNING_SEARCHERS
13
14 // default searcher
15 // template<class _ForwardIterator, class _BinaryPredicate = equal_to<>>
16 // class default_searcher {
17 // public:
18 // default_searcher(_ForwardIterator __f, _ForwardIterator __l,
19 // _BinaryPredicate __p = _BinaryPredicate())
20 // : __first_(__f), __last_(__l), __pred_(__p) {}
21 //
22 // template <typename _ForwardIterator2>
23 // pair<_ForwardIterator2, _ForwardIterator2>
24 // operator () (_ForwardIterator2 __f, _ForwardIterator2 __l) const {
25 // return std::search(__f, __l, __first_, __last_, __pred_);
26 // }
27 //
28 // private:
29 // _ForwardIterator __first_;
30 // _ForwardIterator __last_;
31 // _BinaryPredicate __pred_;
32 // };
33
34
35 #include <experimental/algorithm>
36 #include <experimental/functional>
37 #include <cassert>
38
39 #include "test_macros.h"
40 #include "test_iterators.h"
41
42 struct count_equal
43 {
44 static unsigned count;
45 template <class T>
operator ()count_equal46 bool operator()(const T& x, const T& y) const
47 {++count; return x == y;}
48 };
49
50 unsigned count_equal::count = 0;
51
52 template <typename Iter1, typename Iter2>
do_search(Iter1 b1,Iter1 e1,Iter2 b2,Iter2 e2,Iter1 result,unsigned max_count)53 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) {
54 std::experimental::default_searcher<Iter2, 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 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1), sa);
78 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};
79 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
80 int ic[] = {1};
81 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
82 int id[] = {1, 2};
83 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
84 int ie[] = {1, 2, 3};
85 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3);
86 int ig[] = {1, 2, 3, 4};
87 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
88 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};
89 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
90 int ii[] = {1, 1, 2};
91 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
92 }
93
main(int,char **)94 int main(int, char**) {
95 test<forward_iterator<const int*>, forward_iterator<const int*> >();
96 test<forward_iterator<const int*>, bidirectional_iterator<const int*> >();
97 test<forward_iterator<const int*>, random_access_iterator<const int*> >();
98 test<bidirectional_iterator<const int*>, forward_iterator<const int*> >();
99 test<bidirectional_iterator<const int*>, bidirectional_iterator<const int*> >();
100 test<bidirectional_iterator<const int*>, random_access_iterator<const int*> >();
101 test<random_access_iterator<const int*>, forward_iterator<const int*> >();
102 test<random_access_iterator<const int*>, bidirectional_iterator<const int*> >();
103 test<random_access_iterator<const int*>, random_access_iterator<const int*> >();
104
105 return 0;
106 }
107