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<class ForwardIterator, class Size, class T, class BinaryPredicate>
13//   ForwardIterator
14//   search_n(ForwardIterator first, ForwardIterator last, Size count,
15//            const T& value, BinaryPredicate pred);
16
17#include <algorithm>
18#include <cassert>
19
20#include "test_iterators.h"
21
22struct count_equal
23{
24    static unsigned count;
25    template <class T>
26    bool operator()(const T& x, const T& y)
27        {++count; return x == y;}
28};
29
30unsigned count_equal::count = 0;
31
32template <class Iter>
33void
34test()
35{
36    int ia[] = {0, 1, 2, 3, 4, 5};
37    const unsigned sa = sizeof(ia)/sizeof(ia[0]);
38    count_equal::count = 0;
39    assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia));
40    assert(count_equal::count <= sa);
41    count_equal::count = 0;
42    assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0));
43    assert(count_equal::count <= sa);
44    count_equal::count = 0;
45    assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(ia+sa));
46    assert(count_equal::count <= sa);
47    count_equal::count = 0;
48    assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0, count_equal()) == Iter(ia+sa));
49    assert(count_equal::count <= sa);
50    count_equal::count = 0;
51    assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3, count_equal()) == Iter(ia));
52    assert(count_equal::count <= sa);
53    count_equal::count = 0;
54    assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3, count_equal()) == Iter(ia+3));
55    assert(count_equal::count <= sa);
56    count_equal::count = 0;
57    assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3, count_equal()) == Iter(ia+sa));
58    assert(count_equal::count <= sa);
59    count_equal::count = 0;
60    assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3, count_equal()) == Iter(ia+sa));
61    assert(count_equal::count <= sa);
62    count_equal::count = 0;
63    assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5, count_equal()) == Iter(ia));
64    assert(count_equal::count <= sa);
65    count_equal::count = 0;
66    assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 5, count_equal()) == Iter(ia+5));
67    assert(count_equal::count <= sa);
68    count_equal::count = 0;
69    assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 5, count_equal()) == Iter(ia+sa));
70    assert(count_equal::count <= sa);
71    count_equal::count = 0;
72    assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 5, count_equal()) == Iter(ia+sa));
73    assert(count_equal::count <= sa);
74    count_equal::count = 0;
75
76    int ib[] = {0, 0, 1, 1, 2, 2};
77    const unsigned sb = sizeof(ib)/sizeof(ib[0]);
78    assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0, count_equal()) == Iter(ib));
79    assert(count_equal::count <= sb);
80    count_equal::count = 0;
81    assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0, count_equal()) == Iter(ib+0));
82    assert(count_equal::count <= sb);
83    count_equal::count = 0;
84    assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0, count_equal()) == Iter(ib+0));
85    assert(count_equal::count <= sb);
86    count_equal::count = 0;
87    assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 0, count_equal()) == Iter(ib+sb));
88    assert(count_equal::count <= sb);
89    count_equal::count = 0;
90    assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 0, count_equal()) == Iter(ib+sb));
91    assert(count_equal::count <= sb);
92    count_equal::count = 0;
93    assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 1, count_equal()) == Iter(ib));
94    assert(count_equal::count <= sb);
95    count_equal::count = 0;
96    assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 1, count_equal()) == Iter(ib+2));
97    assert(count_equal::count <= sb);
98    count_equal::count = 0;
99    assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 1, count_equal()) == Iter(ib+2));
100    assert(count_equal::count <= sb);
101    count_equal::count = 0;
102    assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 1, count_equal()) == Iter(ib+sb));
103    assert(count_equal::count <= sb);
104    count_equal::count = 0;
105    assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 1, count_equal()) == Iter(ib+sb));
106    assert(count_equal::count <= sb);
107    count_equal::count = 0;
108    assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 2, count_equal()) == Iter(ib));
109    assert(count_equal::count <= sb);
110    count_equal::count = 0;
111    assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 2, count_equal()) == Iter(ib+4));
112    assert(count_equal::count <= sb);
113    count_equal::count = 0;
114    assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 2, count_equal()) == Iter(ib+4));
115    assert(count_equal::count <= sb);
116    count_equal::count = 0;
117    assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 2, count_equal()) == Iter(ib+sb));
118    assert(count_equal::count <= sb);
119    count_equal::count = 0;
120    assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 2, count_equal()) == Iter(ib+sb));
121    assert(count_equal::count <= sb);
122    count_equal::count = 0;
123
124    int ic[] = {0, 0, 0};
125    const unsigned sc = sizeof(ic)/sizeof(ic[0]);
126    assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0, count_equal()) == Iter(ic));
127    assert(count_equal::count <= sc);
128    count_equal::count = 0;
129    assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0, count_equal()) == Iter(ic));
130    assert(count_equal::count <= sc);
131    count_equal::count = 0;
132    assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0, count_equal()) == Iter(ic));
133    assert(count_equal::count <= sc);
134    count_equal::count = 0;
135    assert(std::search_n(Iter(ic), Iter(ic+sc), 3, 0, count_equal()) == Iter(ic));
136    assert(count_equal::count <= sc);
137    count_equal::count = 0;
138    assert(std::search_n(Iter(ic), Iter(ic+sc), 4, 0, count_equal()) == Iter(ic+sc));
139    assert(count_equal::count <= sc);
140    count_equal::count = 0;
141}
142
143int main()
144{
145    test<forward_iterator<const int*> >();
146    test<bidirectional_iterator<const int*> >();
147    test<random_access_iterator<const int*> >();
148}
149