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 // default searcher
14 // template<class _ForwardIterator, class _BinaryPredicate = equal_to<>>
15 // class default_searcher {
16 // public:
17 // default_searcher(_ForwardIterator __f, _ForwardIterator __l,
18 // _BinaryPredicate __p = _BinaryPredicate())
19 // : __first_(__f), __last_(__l), __pred_(__p) {}
20 //
21 // template <typename _ForwardIterator2>
22 // pair<_ForwardIterator2, _ForwardIterator2>
23 // operator () (_ForwardIterator2 __f, _ForwardIterator2 __l) const {
24 // return std::search(__f, __l, __first_, __last_, __pred_);
25 // }
26 //
27 // private:
28 // _ForwardIterator __first_;
29 // _ForwardIterator __last_;
30 // _BinaryPredicate __pred_;
31 // };
32
33
34 #include <algorithm>
35 #include <functional>
36 #include <cassert>
37
38 #include "test_macros.h"
39 #include "test_iterators.h"
40
41 template <typename Iter1, typename Iter2>
42 TEST_CONSTEXPR_CXX20
do_search(Iter1 b1,Iter1 e1,Iter2 b2,Iter2 e2,Iter1 result)43 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) {
44 std::default_searcher<Iter2> s{b2, e2};
45 assert(result == std::search(b1, e1, s));
46 }
47
48 template <class Iter1, class Iter2>
49 TEST_CONSTEXPR_CXX20
test()50 bool test()
51 {
52 int ia[] = {0, 1, 2, 3, 4, 5};
53 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia));
55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia));
56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1));
57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia));
58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2));
59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2));
60 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia));
61 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1));
62 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3));
63 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia));
64 do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1));
65 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1));
66 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};
67 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
68 int ic[] = {1};
69 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1));
70 int id[] = {1, 2};
71 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1));
72 int ie[] = {1, 2, 3};
73 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4));
74 int ig[] = {1, 2, 3, 4};
75 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
76 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};
77 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
78 int ii[] = {1, 1, 2};
79 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
80 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0};
81 const unsigned sj = sizeof(ij)/sizeof(ij[0]);
82 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0};
83 const unsigned sk = sizeof(ik)/sizeof(ik[0]);
84 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6));
85
86 return true;
87 }
88
main(int,char **)89 int main(int, char**) {
90 test<forward_iterator<const int*>, forward_iterator<const int*> >();
91 test<forward_iterator<const int*>, bidirectional_iterator<const int*> >();
92 test<forward_iterator<const int*>, random_access_iterator<const int*> >();
93 test<bidirectional_iterator<const int*>, forward_iterator<const int*> >();
94 test<bidirectional_iterator<const int*>, bidirectional_iterator<const int*> >();
95 test<bidirectional_iterator<const int*>, random_access_iterator<const int*> >();
96 test<random_access_iterator<const int*>, forward_iterator<const int*> >();
97 test<random_access_iterator<const int*>, bidirectional_iterator<const int*> >();
98 test<random_access_iterator<const int*>, random_access_iterator<const int*> >();
99
100 #if TEST_STD_VER >= 20
101 static_assert(test<forward_iterator<const int*>, forward_iterator<const int*>>());
102 static_assert(test<forward_iterator<const int*>, bidirectional_iterator<const int*>>());
103 static_assert(test<forward_iterator<const int*>, random_access_iterator<const int*>>());
104 static_assert(test<bidirectional_iterator<const int*>, forward_iterator<const int*>>());
105 static_assert(test<bidirectional_iterator<const int*>, bidirectional_iterator<const int*>>());
106 static_assert(test<bidirectional_iterator<const int*>, random_access_iterator<const int*>>());
107 static_assert(test<random_access_iterator<const int*>, forward_iterator<const int*>>());
108 static_assert(test<random_access_iterator<const int*>, bidirectional_iterator<const int*>>());
109 static_assert(test<random_access_iterator<const int*>, random_access_iterator<const int*>>());
110 #endif
111
112 return 0;
113 }
114