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 // UNSUPPORTED: c++98, c++03, c++11 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_iterators.h" 25 26 struct count_equal 27 { 28 static unsigned count; 29 template <class T> 30 bool operator()(const T& x, const T& y) 31 {++count; return x == y;} 32 }; 33 34 unsigned count_equal::count = 0; 35 36 template <typename Iter1, typename Iter2> 37 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { 38 count_equal::count = 0; 39 assert(result == std::experimental::search(b1, e1, 40 std::experimental::make_default_searcher(b2, e2))); 41 assert(count_equal::count <= max_count); 42 } 43 44 template <class Iter1, class Iter2> 45 void 46 test() 47 { 48 int ia[] = {0, 1, 2, 3, 4, 5}; 49 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 50 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 51 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); 52 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); 53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); 55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); 56 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia), 0); 57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa); 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa); 59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); 60 do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1), (sa-1)*sa); 61 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1), sa); 62 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; 63 const unsigned sb = sizeof(ib)/sizeof(ib[0]); 64 int ic[] = {1}; 65 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); 66 int id[] = {1, 2}; 67 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); 68 int ie[] = {1, 2, 3}; 69 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); 70 int ig[] = {1, 2, 3, 4}; 71 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); 72 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; 73 const unsigned sh = sizeof(ih)/sizeof(ih[0]); 74 int ii[] = {1, 1, 2}; 75 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); 76 } 77 78 int main() { 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
