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