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
|
//===----------------------------------------------------------------------===//
//
// ÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊThe LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <algorithm>
// template<ForwardIterator Iter, class T>
// requires HasLess<T, Iter::value_type>
// && HasLess<Iter::value_type, T>
// bool
// binary_search(Iter first, Iter last, const T& value);
#include <algorithm>
#include <vector>
#include <cassert>
#include "../../../iterators.h"
template <class Iter, class T>
void
test(Iter first, Iter last, const T& value, bool x)
{
assert(std::binary_search(first, last, value) == x);
}
template <class Iter>
void
test()
{
const unsigned N = 1000;
const unsigned M = 10;
std::vector<int> v(N);
int x = 0;
for (int i = 0; i < v.size(); ++i)
{
v[i] = x;
if (++x == M)
x = 0;
}
std::sort(v.begin(), v.end());
for (x = 0; x < M; ++x)
test(Iter(v.data()), Iter(v.data()+v.size()), x, true);
test(Iter(v.data()), Iter(v.data()+v.size()), -1, false);
test(Iter(v.data()), Iter(v.data()+v.size()), M, false);
}
int main()
{
int d[] = {0, 2, 4, 6};
for (int* e = d; e <= d+4; ++e)
for (int x = -1; x <= 7; ++x)
test(d, e, x, (x % 2 == 0) && ((e-d)*2 > x));
test<forward_iterator<const int*> >();
test<bidirectional_iterator<const int*> >();
test<random_access_iterator<const int*> >();
test<const int*>();
}
|
