1 //===----------------------------------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // UNSUPPORTED: c++98, c++03, c++11
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());
20 #include <experimental/algorithm>
21 #include <experimental/functional>
24 #include "test_iterators.h"
26 template <typename Iter1, typename Iter2>
27 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) {
28 assert(result == std::experimental::search(b1, e1,
29 std::experimental::make_default_searcher(b2, e2)));
32 template <class Iter1, class Iter2>
36 int ia[] = {0, 1, 2, 3, 4, 5};
37 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
38 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia));
39 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia));
40 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1));
41 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia));
42 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2));
43 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2));
44 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia));
45 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1));
46 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3));
47 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia));
48 do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1));
49 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1));
50 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};
51 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
53 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1));
55 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1));
57 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4));
58 int ig[] = {1, 2, 3, 4};
59 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
60 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};
61 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
63 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
64 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0};
65 const unsigned sj = sizeof(ij)/sizeof(ij[0]);
66 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0};
67 const unsigned sk = sizeof(ik)/sizeof(ik[0]);
68 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6));
72 test<forward_iterator<const int*>, forward_iterator<const int*> >();
73 test<forward_iterator<const int*>, bidirectional_iterator<const int*> >();
74 test<forward_iterator<const int*>, random_access_iterator<const int*> >();
75 test<bidirectional_iterator<const int*>, forward_iterator<const int*> >();
76 test<bidirectional_iterator<const int*>, bidirectional_iterator<const int*> >();
77 test<bidirectional_iterator<const int*>, random_access_iterator<const int*> >();
78 test<random_access_iterator<const int*>, forward_iterator<const int*> >();
79 test<random_access_iterator<const int*>, bidirectional_iterator<const int*> >();
80 test<random_access_iterator<const int*>, random_access_iterator<const int*> >();