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
|
//===----------------------------------------------------------------------===//
//
// 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>
// ForwardIterator
// search_n(ForwardIterator first, ForwardIterator last, Size count,
// const T& value);
#include <algorithm>
#include <cassert>
#include "test_iterators.h"
#include "user_defined_integral.hpp"
template <class Iter>
void
test()
{
int ia[] = {0, 1, 2, 3, 4, 5};
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia));
assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0));
assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(ia+sa));
assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0) == Iter(ia+sa));
assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3) == Iter(ia));
assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3) == Iter(ia+3));
assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3) == Iter(ia+sa));
assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3) == Iter(ia+sa));
assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5) == Iter(ia));
assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 5) == Iter(ia+5));
assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 5) == Iter(ia+sa));
assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 5) == Iter(ia+sa));
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) == Iter(ib));
assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0) == Iter(ib+0));
assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0) == Iter(ib+0));
assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 0) == Iter(ib+sb));
assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 0) == Iter(ib+sb));
assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 1) == Iter(ib));
assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 1) == Iter(ib+2));
assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 1) == Iter(ib+2));
assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 1) == Iter(ib+sb));
assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 1) == Iter(ib+sb));
assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 2) == Iter(ib));
assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 2) == Iter(ib+4));
assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 2) == Iter(ib+4));
assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 2) == Iter(ib+sb));
assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 2) == Iter(ib+sb));
int ic[] = {0, 0, 0};
const unsigned sc = sizeof(ic)/sizeof(ic[0]);
assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0) == Iter(ic));
assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0) == Iter(ic));
assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0) == Iter(ic));
assert(std::search_n(Iter(ic), Iter(ic+sc), 3, 0) == Iter(ic));
assert(std::search_n(Iter(ic), Iter(ic+sc), 4, 0) == Iter(ic+sc));
// Check that we properly convert the size argument to an integral.
std::search_n(Iter(ic), Iter(ic+sc), UserDefinedIntegral<unsigned>(0), 0);
}
int main()
{
test<forward_iterator<const int*> >();
test<bidirectional_iterator<const int*> >();
test<random_access_iterator<const int*> >();
}
|
