]>
git.ipfire.org Git - thirdparty/gcc.git/blob - libstdc++-v3/testsuite/25_algorithms/minmax/constrained.cc
1 // Copyright (C) 2020-2021 Free Software Foundation, Inc.
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)
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.
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/>.
18 // { dg-options "-std=gnu++2a" }
19 // { dg-do run { target c++2a } }
22 #include <testsuite_hooks.h>
23 #include <testsuite_iterators.h>
25 using __gnu_test::test_container
;
26 using __gnu_test::test_range
;
27 using __gnu_test::input_iterator_wrapper
;
29 namespace ranges
= std::ranges
;
31 template<typename T1
, typename T2
>
33 operator==(const ranges::minmax_result
<T1
>& lhs
,
34 const ranges::minmax_result
<T2
>& rhs
)
36 return (lhs
.min
== rhs
.min
37 && rhs
.max
== rhs
.max
);
46 using res_t
= ranges::minmax_result
<int>;
51 VERIFY( ranges::minmax(1, 2) == res_t(1,2) );
52 VERIFY( ranges::minmax(2, 1) == res_t(1,2) );
53 VERIFY( ranges::minmax(1, 2, ranges::greater
{}) == res_t(2,1) );
54 VERIFY( ranges::minmax(1, 2, ranges::greater
{}, std::negate
<>{}) == res_t(1,2) );
55 VERIFY( ranges::minmax(1, 2, {}, std::negate
<>{}) == res_t(2,1) );
56 VERIFY( ranges::minmax(X
{1,2}, X
{1,3}, {}, &X::i
).min
.j
== 2 );
57 VERIFY( ranges::minmax(X
{1,2}, X
{1,3}, {}, &X::i
).max
.j
== 3 );
66 test_range
<int, input_iterator_wrapper
> cx(x
);
67 VERIFY( ranges::minmax(cx
) == res_t(1,4) );
69 VERIFY( ranges::minmax(cx
, ranges::greater
{}) == res_t(4,1) );
71 VERIFY( ranges::minmax(cx
, {}, std::negate
<>{}) == res_t(4,1));
73 VERIFY( ranges::minmax(cx
, ranges::greater
{}, std::negate
<>{})
75 } while (ranges::next_permutation(x
).found
);
77 constexpr X y
[] = {{1,5},{1,2},{1,3}};
78 static_assert(ranges::minmax(y
, {}, &X::i
).min
.j
== 5);
79 static_assert(ranges::minmax(y
, {}, &X::i
).max
.j
== 3);
85 VERIFY( ranges::minmax({2,3,1,4}) == res_t(1,4) );
86 VERIFY( ranges::minmax({2,3,1,4}, ranges::greater
{}) == res_t(4,1) );
87 VERIFY( ranges::minmax({2,3,1,4}, {}, std::negate
<>{}) == res_t(4,1) );
88 VERIFY( ranges::minmax({2,3,1,4}, ranges::greater
{}, std::negate
<>{})