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 // <algorithm> 10 11 // template<ForwardIterator Iter1, ForwardIterator Iter2> 12 // requires HasEqualTo<Iter1::value_type, Iter2::value_type> 13 // constexpr Iter1 // constexpr after C++17 14 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2); 15 // 16 // template<class ForwardIterator, class Searcher> 17 // ForwardIterator search(ForwardIterator first, ForwardIterator last, 18 // const Searcher& searcher); // C++17 19 20 #include <algorithm> 21 #include <cassert> 22 23 #include "test_macros.h" 24 #include "test_iterators.h" 25 26 struct MySearcherC { 27 template <typename Iterator> 28 std::pair<Iterator, Iterator> 29 TEST_CONSTEXPR operator() (Iterator b, Iterator e) const 30 { 31 return std::make_pair(b, e); 32 } 33 }; 34 35 #if TEST_STD_VER > 17 36 TEST_CONSTEXPR bool test_constexpr() { 37 int ia[] = {0, 1, 2, 3}; 38 int ib[] = {0, 1, 5, 3}; 39 int ic[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; 40 return (std::search(std::begin(ic), std::end(ic), std::begin(ia), std::end(ia)) == ic+3) 41 && (std::search(std::begin(ic), std::end(ic), std::begin(ib), std::end(ib)) == std::end(ic)) 42 && (std::search(std::begin(ic), std::end(ic), MySearcherC()) == std::begin(ic)) 43 ; 44 } 45 #endif 46 47 int searcher_called = 0; 48 49 struct MySearcher { 50 template <typename Iterator> 51 std::pair<Iterator, Iterator> 52 operator() (Iterator b, Iterator e) const 53 { 54 ++searcher_called; 55 return std::make_pair(b, e); 56 } 57 }; 58 59 template <class Iter1, class Iter2> 60 void 61 test() 62 { 63 int ia[] = {0, 1, 2, 3, 4, 5}; 64 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 65 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia)); 66 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1)) == Iter1(ia)); 67 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2)) == Iter1(ia+1)); 68 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2)) == Iter1(ia)); 69 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2)); 70 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2)); 71 assert(std::search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia)); 72 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa)) == Iter1(ia+sa-1)); 73 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa)) == Iter1(ia+sa-3)); 74 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa)) == Iter1(ia)); 75 assert(std::search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa)) == Iter1(ia+sa-1)); 76 assert(std::search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa)) == Iter1(ia+1)); 77 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; 78 const unsigned sb = sizeof(ib)/sizeof(ib[0]); 79 int ic[] = {1}; 80 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1)) == Iter1(ib+1)); 81 int id[] = {1, 2}; 82 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2)) == Iter1(ib+1)); 83 int ie[] = {1, 2, 3}; 84 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3)) == Iter1(ib+4)); 85 int ig[] = {1, 2, 3, 4}; 86 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4)) == Iter1(ib+8)); 87 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; 88 const unsigned sh = sizeof(ih)/sizeof(ih[0]); 89 int ii[] = {1, 1, 2}; 90 assert(std::search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3)) == Iter1(ih+3)); 91 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; 92 const unsigned sj = sizeof(ij)/sizeof(ij[0]); 93 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; 94 const unsigned sk = sizeof(ik)/sizeof(ik[0]); 95 assert(std::search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk)) == Iter1(ij+6)); 96 } 97 98 int main() 99 { 100 test<forward_iterator<const int*>, forward_iterator<const int*> >(); 101 test<forward_iterator<const int*>, bidirectional_iterator<const int*> >(); 102 test<forward_iterator<const int*>, random_access_iterator<const int*> >(); 103 test<bidirectional_iterator<const int*>, forward_iterator<const int*> >(); 104 test<bidirectional_iterator<const int*>, bidirectional_iterator<const int*> >(); 105 test<bidirectional_iterator<const int*>, random_access_iterator<const int*> >(); 106 test<random_access_iterator<const int*>, forward_iterator<const int*> >(); 107 test<random_access_iterator<const int*>, bidirectional_iterator<const int*> >(); 108 test<random_access_iterator<const int*>, random_access_iterator<const int*> >(); 109 110 #if TEST_STD_VER > 14 111 { 112 typedef int * RI; 113 static_assert((std::is_same<RI, decltype(std::search(RI(), RI(), MySearcher()))>::value), "" ); 114 115 RI it(nullptr); 116 assert(it == std::search(it, it, MySearcher())); 117 assert(searcher_called == 1); 118 } 119 #endif 120 121 #if TEST_STD_VER > 17 122 static_assert(test_constexpr()); 123 #endif 124 } 125