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 #include <algorithm>
18 #include <cassert>
19
20 #include "test_iterators.h"
21
22 template <class Iter1, class Iter2>
23 void
test()24 test()
25 {
26 int ia[] = {0, 1, 2, 3, 4, 5};
27 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
28 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia));
29 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1)) == Iter1(ia));
30 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2)) == Iter1(ia+1));
31 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2)) == Iter1(ia));
32 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2));
33 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2));
34 assert(std::search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia));
35 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa)) == Iter1(ia+sa-1));
36 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa)) == Iter1(ia+sa-3));
37 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa)) == Iter1(ia));
38 assert(std::search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa)) == Iter1(ia+sa-1));
39 assert(std::search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa)) == Iter1(ia+1));
40 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};
41 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
42 int ic[] = {1};
43 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1)) == Iter1(ib+1));
44 int id[] = {1, 2};
45 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2)) == Iter1(ib+1));
46 int ie[] = {1, 2, 3};
47 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3)) == Iter1(ib+4));
48 int ig[] = {1, 2, 3, 4};
49 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4)) == Iter1(ib+8));
50 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};
51 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
52 int ii[] = {1, 1, 2};
53 assert(std::search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3)) == Iter1(ih+3));
54 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0};
55 const unsigned sj = sizeof(ij)/sizeof(ij[0]);
56 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0};
57 const unsigned sk = sizeof(ik)/sizeof(ik[0]);
58 assert(std::search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk)) == Iter1(ij+6));
59 }
60
main()61 int main()
62 {
63 test<forward_iterator<const int*>, forward_iterator<const int*> >();
64 test<forward_iterator<const int*>, bidirectional_iterator<const int*> >();
65 test<forward_iterator<const int*>, random_access_iterator<const int*> >();
66 test<bidirectional_iterator<const int*>, forward_iterator<const int*> >();
67 test<bidirectional_iterator<const int*>, bidirectional_iterator<const int*> >();
68 test<bidirectional_iterator<const int*>, random_access_iterator<const int*> >();
69 test<random_access_iterator<const int*>, forward_iterator<const int*> >();
70 test<random_access_iterator<const int*>, bidirectional_iterator<const int*> >();
71 test<random_access_iterator<const int*>, random_access_iterator<const int*> >();
72 }
73