]>
Commit | Line | Data |
---|---|---|
99dee823 | 1 | // Copyright (C) 2020-2021 Free Software Foundation, Inc. |
bc464641 PP |
2 | // |
3 | // This file is part of the GNU ISO C++ Library. This library is free | |
4 | // software; you can redistribute it and/or modify it under the | |
5 | // terms of the GNU General Public License as published by the | |
6 | // Free Software Foundation; either version 3, or (at your option) | |
7 | // any later version. | |
8 | ||
9 | // This library is distributed in the hope that it will be useful, | |
10 | // but WITHOUT ANY WARRANTY; without even the implied warranty of | |
11 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
12 | // GNU General Public License for more details. | |
13 | ||
14 | // You should have received a copy of the GNU General Public License along | |
15 | // with this library; see the file COPYING3. If not see | |
16 | // <http://www.gnu.org/licenses/>. | |
17 | ||
18 | // { dg-options "-std=gnu++2a" } | |
19 | // { dg-do run { target c++2a } } | |
20 | ||
21 | #include <algorithm> | |
22 | #include <testsuite_hooks.h> | |
23 | #include <testsuite_iterators.h> | |
24 | ||
25 | using __gnu_test::test_container; | |
26 | using __gnu_test::test_range; | |
27 | using __gnu_test::input_iterator_wrapper; | |
28 | ||
29 | namespace ranges = std::ranges; | |
30 | ||
31 | struct X | |
32 | { | |
33 | int i, j; | |
34 | }; | |
35 | ||
36 | void | |
37 | test01() | |
38 | { | |
39 | VERIFY( ranges::min(1, 2) == 1); | |
40 | VERIFY( ranges::min(2, 1) == 1); | |
41 | VERIFY( ranges::min(1, 2, ranges::greater{}) == 2); | |
42 | VERIFY( ranges::min(1, 2, ranges::greater{}, std::negate<>{}) == 1); | |
43 | VERIFY( ranges::min(1, 2, {}, std::negate<>{}) == 2); | |
44 | VERIFY( ranges::min(X{1,2}, X{1,3}, {}, &X::i).j == 2 ); | |
45 | } | |
46 | ||
47 | void | |
48 | test02() | |
49 | { | |
50 | int x[] = {1,2,3,4}; | |
51 | do | |
52 | { | |
53 | test_range<int, input_iterator_wrapper> cx(x); | |
54 | VERIFY( ranges::min(cx) == 1 ); | |
55 | cx.bounds.first = x; | |
56 | VERIFY( ranges::min(cx, ranges::greater{}) == 4 ); | |
57 | cx.bounds.first = x; | |
58 | VERIFY( ranges::min(cx, {}, std::negate<>{}) == 4); | |
59 | cx.bounds.first = x; | |
60 | VERIFY( ranges::min(cx, ranges::greater{}, std::negate<>{}) == 1 ); | |
61 | } while (ranges::next_permutation(x).found); | |
62 | ||
63 | constexpr X y[] = {{5,0},{1,2},{1,3}}; | |
64 | static_assert(ranges::min(y, {}, &X::i).j == 2); | |
65 | } | |
66 | ||
67 | void | |
68 | test03() | |
69 | { | |
70 | VERIFY( ranges::min({2,3,1,4}) == 1 ); | |
71 | VERIFY( ranges::min({2,3,1,4}, ranges::greater{}) == 4 ); | |
72 | VERIFY( ranges::min({2,3,1,4}, {}, std::negate<>{}) == 4 ); | |
73 | VERIFY( ranges::min({2,3,1,4}, ranges::greater{}, std::negate<>{}) == 1 ); | |
74 | } | |
75 | ||
76 | int | |
77 | main() | |
78 | { | |
79 | test01(); | |
80 | test02(); | |
81 | test03(); | |
82 | } |