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
|
//===----------------------------------------------------------------------===//
//
// 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<ForwardIterator Iter>
// requires LessThanComparable<Iter::value_type>
// pair<Iter, Iter>
// minmax_element(Iter first, Iter last);
#include <algorithm>
#include <cassert>
#include "test_iterators.h"
template <class Iter>
void
test(Iter first, Iter last)
{
std::pair<Iter, Iter> p = std::minmax_element(first, last);
if (first != last)
{
for (Iter j = first; j != last; ++j)
{
assert(!(*j < *p.first));
assert(!(*p.second < *j));
}
}
else
{
assert(p.first == last);
assert(p.second == last);
}
}
template <class Iter>
void
test(unsigned N)
{
int* a = new int[N];
for (int i = 0; i < N; ++i)
a[i] = i;
std::random_shuffle(a, a+N);
test(Iter(a), Iter(a+N));
delete [] a;
}
template <class Iter>
void
test()
{
test<Iter>(0);
test<Iter>(1);
test<Iter>(2);
test<Iter>(3);
test<Iter>(10);
test<Iter>(1000);
{
const unsigned N = 100;
int* a = new int[N];
for (int i = 0; i < N; ++i)
a[i] = 5;
std::random_shuffle(a, a+N);
std::pair<Iter, Iter> p = std::minmax_element(Iter(a), Iter(a+N));
assert(base(p.first) == a);
assert(base(p.second) == a+N-1);
delete [] a;
}
}
int main()
{
test<forward_iterator<const int*> >();
test<bidirectional_iterator<const int*> >();
test<random_access_iterator<const int*> >();
test<const int*>();
}
|
