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
|
// { dg-do run { target c++11 } }
// 2008-09-16 Chris Fairles <chris.fairles@gmail.com>
// Copyright (C) 2008-2017 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/>.
#include <algorithm>
#include <functional>
#include <testsuite_hooks.h>
void test01()
{
std::pair<int, int> z = std::minmax({1, 2, 3});
std::pair<int, int> w = std::minmax({4, 3, 5, 4});
std::pair<int, int> y = std::minmax({4, 5, 3, 7, 3});
VERIFY( z.first == 1 );
VERIFY( z.second == 3 );
VERIFY( w.first == 3 );
VERIFY( w.second == 5 );
VERIFY( y.first == 3 );
VERIFY( y.second == 7 );
std::pair<int, int> zc =
std::minmax({1, 2, 3}, std::greater<int>());
std::pair<int, int> wc =
std::minmax({4, 3, 5, 4}, std::greater<int>());
std::pair<int, int> yc =
std::minmax({4, 5, 3, 7, 3}, std::greater<int>());
VERIFY( zc.first == 3 );
VERIFY( zc.second == 1 );
VERIFY( wc.first == 5 );
VERIFY( wc.second == 3 );
VERIFY( yc.first == 7 );
VERIFY( yc.second == 3 );
}
int main()
{
test01();
return 0;
}
|
