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