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 template <typename Iter1, typename Iter2>
do_search(Iter1 b1,Iter1 e1,Iter2 b2,Iter2 e2,Iter1 result)28 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) {
29 assert(result == std::experimental::search(b1, e1,
30 std::experimental::make_default_searcher(b2, e2)));
31 }
32
33 template <class Iter1, class Iter2>
34 void
test()35 test()
36 {
37 int ia[] = {0, 1, 2, 3, 4, 5};
38 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
39 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia));
40 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia));
41 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1));
42 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia));
43 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2));
44 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2));
45 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia));
46 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1));
47 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3));
48 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia));
49 do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1));
50 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1));
51 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};
52 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
53 int ic[] = {1};
54 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1));
55 int id[] = {1, 2};
56 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1));
57 int ie[] = {1, 2, 3};
58 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4));
59 int ig[] = {1, 2, 3, 4};
60 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
61 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};
62 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
63 int ii[] = {1, 1, 2};
64 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
65 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0};
66 const unsigned sj = sizeof(ij)/sizeof(ij[0]);
67 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0};
68 const unsigned sk = sizeof(ik)/sizeof(ik[0]);
69 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6));
70 }
71
main(int,char **)72 int main(int, char**) {
73 test<forward_iterator<const int*>, forward_iterator<const int*> >();
74 test<forward_iterator<const int*>, bidirectional_iterator<const int*> >();
75 test<forward_iterator<const int*>, random_access_iterator<const int*> >();
76 test<bidirectional_iterator<const int*>, forward_iterator<const int*> >();
77 test<bidirectional_iterator<const int*>, bidirectional_iterator<const int*> >();
78 test<bidirectional_iterator<const int*>, random_access_iterator<const int*> >();
79 test<random_access_iterator<const int*>, forward_iterator<const int*> >();
80 test<random_access_iterator<const int*>, bidirectional_iterator<const int*> >();
81 test<random_access_iterator<const int*>, random_access_iterator<const int*> >();
82
83 return 0;
84 }
85