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