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
|
// Copyright (C) 2005-2015 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
// 25.3.7 [lib.alg.min.max]
#include <algorithm>
#include <testsuite_hooks.h>
#include <testsuite_iterators.h>
using __gnu_test::test_container;
using __gnu_test::forward_iterator_wrapper;
using std::min_element;
typedef test_container<int, forward_iterator_wrapper> Container;
void
test1()
{
// Note: The standard is unclear on what should happen in this case.
// This seems the only really sensible behaviour, and what is done.
int array[] = {0};
Container con(array, array);
VERIFY(min_element(con.begin(), con.end()).ptr == array);
}
void
test2()
{
int array[] = {0};
Container con(array, array + 1);
VERIFY(min_element(con.begin(), con.end()).ptr == array);
}
void
test3()
{
int array[] = {0, 3};
Container con(array, array + 2);
VERIFY(min_element(con.begin(), con.end()).ptr == array);
}
void
test4()
{
int array[] = {6, 3, 0, 2, 6, 4, 0};
Container con(array, array + 7);
VERIFY(min_element(con.begin(), con.end()).ptr == array + 2);
}
int main()
{
test1();
test2();
test3();
test4();
}
|
