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 Iter, class T>
13 // requires HasLess<T, Iter::value_type>
14 // && HasLess<Iter::value_type, T>
15 // pair<Iter, Iter>
16 // equal_range(Iter first, Iter last, const T& value);
17
18 #include <algorithm>
19 #include <vector>
20 #include <cassert>
21
22 #include "test_iterators.h"
23
24 template <class Iter, class T>
25 void
test(Iter first,Iter last,const T & value)26 test(Iter first, Iter last, const T& value)
27 {
28 std::pair<Iter, Iter> i = std::equal_range(first, last, value);
29 for (Iter j = first; j != i.first; ++j)
30 assert(*j < value);
31 for (Iter j = i.first; j != last; ++j)
32 assert(!(*j < value));
33 for (Iter j = first; j != i.second; ++j)
34 assert(!(value < *j));
35 for (Iter j = i.second; j != last; ++j)
36 assert(value < *j);
37 }
38
39 template <class Iter>
40 void
test()41 test()
42 {
43 const unsigned N = 1000;
44 const unsigned M = 10;
45 std::vector<int> v(N);
46 int x = 0;
47 for (int i = 0; i < v.size(); ++i)
48 {
49 v[i] = x;
50 if (++x == M)
51 x = 0;
52 }
53 std::sort(v.begin(), v.end());
54 for (x = 0; x <= M; ++x)
55 test(Iter(v.data()), Iter(v.data()+v.size()), x);
56 }
57
main()58 int main()
59 {
60 int d[] = {0, 1, 2, 3};
61 for (int* e = d; e <= d+4; ++e)
62 for (int x = -1; x <= 4; ++x)
63 test(d, e, x);
64
65 test<forward_iterator<const int*> >();
66 test<bidirectional_iterator<const int*> >();
67 test<random_access_iterator<const int*> >();
68 test<const int*>();
69 }
70