1 //===----------------------------------------------------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is dual licensed under the MIT and the University of Illinois Open 6 // Source Licenses. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 10 // <algorithm> 11 12 // template<ForwardIterator Iter1, ForwardIterator Iter2> 13 // requires HasEqualTo<Iter1::value_type, Iter2::value_type> 14 // Iter1 15 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2); 16 // 17 // template<class ForwardIterator, class Searcher> 18 // ForwardIterator search(ForwardIterator first, ForwardIterator last, 19 // const Searcher& searcher); // C++17 20 21 #include <algorithm> 22 #include <cassert> 23 24 #include "test_iterators.h" 25 26 int searcher_called = 0; 27 28 struct MySearcher { 29 template <typename Iterator> 30 std::pair<Iterator, Iterator> 31 operator() (Iterator b, Iterator e) const 32 { 33 ++searcher_called; 34 return std::make_pair(b, e); 35 } 36 }; 37 38 template <class Iter1, class Iter2> 39 void 40 test() 41 { 42 int ia[] = {0, 1, 2, 3, 4, 5}; 43 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 44 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia)); 45 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1)) == Iter1(ia)); 46 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2)) == Iter1(ia+1)); 47 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2)) == Iter1(ia)); 48 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2)); 49 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2)); 50 assert(std::search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia)); 51 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa)) == Iter1(ia+sa-1)); 52 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa)) == Iter1(ia+sa-3)); 53 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa)) == Iter1(ia)); 54 assert(std::search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa)) == Iter1(ia+sa-1)); 55 assert(std::search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa)) == Iter1(ia+1)); 56 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; 57 const unsigned sb = sizeof(ib)/sizeof(ib[0]); 58 int ic[] = {1}; 59 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1)) == Iter1(ib+1)); 60 int id[] = {1, 2}; 61 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2)) == Iter1(ib+1)); 62 int ie[] = {1, 2, 3}; 63 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3)) == Iter1(ib+4)); 64 int ig[] = {1, 2, 3, 4}; 65 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4)) == Iter1(ib+8)); 66 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; 67 const unsigned sh = sizeof(ih)/sizeof(ih[0]); 68 int ii[] = {1, 1, 2}; 69 assert(std::search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3)) == Iter1(ih+3)); 70 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; 71 const unsigned sj = sizeof(ij)/sizeof(ij[0]); 72 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; 73 const unsigned sk = sizeof(ik)/sizeof(ik[0]); 74 assert(std::search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk)) == Iter1(ij+6)); 75 } 76 77 int main() 78 { 79 test<forward_iterator<const int*>, forward_iterator<const int*> >(); 80 test<forward_iterator<const int*>, bidirectional_iterator<const int*> >(); 81 test<forward_iterator<const int*>, random_access_iterator<const int*> >(); 82 test<bidirectional_iterator<const int*>, forward_iterator<const int*> >(); 83 test<bidirectional_iterator<const int*>, bidirectional_iterator<const int*> >(); 84 test<bidirectional_iterator<const int*>, random_access_iterator<const int*> >(); 85 test<random_access_iterator<const int*>, forward_iterator<const int*> >(); 86 test<random_access_iterator<const int*>, bidirectional_iterator<const int*> >(); 87 test<random_access_iterator<const int*>, random_access_iterator<const int*> >(); 88 89 #if TEST_STD_VERS > 14 90 { 91 typedef int * RI; 92 static_assert((std::is_same<RI, decltype(std::search(RI(), RI(), MySearcher()))>::value), "" ); 93 94 RI it(nullptr); 95 assert(it == std::search(it, it, MySearcher())); 96 assert(searcher_called == 1); 97 } 98 #endif 99 100 } 101