d: Merge dmd, druntime c7902293d7, phobos 03aeafd20
[gcc.git] / libstdc++-v3 / testsuite / 25_algorithms / max_element / constrained.cc
blobeb13836656a829a5ccbc138171e7878505aec448
1 // Copyright (C) 2020-2025 Free Software Foundation, Inc.
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.
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-do run { target c++20 } }
20 #include <algorithm>
21 #include <functional>
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::forward_iterator_wrapper;
29 namespace ranges = std::ranges;
31 struct X
33 int i, j;
36 void
37 test01()
39 int x[] = {1,2,3,4};
42 test_range<int, forward_iterator_wrapper> cx(x);
43 VERIFY( *ranges::max_element(cx) == 4 );
44 VERIFY( *ranges::max_element(cx, ranges::greater{}) == 1 );
45 VERIFY( *ranges::max_element(cx, {}, std::negate<>{}) == 1);
46 VERIFY( *ranges::max_element(cx, ranges::greater{}, std::negate<>{}) == 4 );
47 } while (ranges::next_permutation(x).found);
49 test_container<int, forward_iterator_wrapper> cx(x);
50 VERIFY( ranges::max_element(cx.begin(), cx.begin()) == cx.begin() );
52 constexpr X y[] = {{0,5},{1,2},{1,3}};
53 static_assert(ranges::max_element(y, y+3, {}, &X::i)->j == 2);
56 int
57 main()
59 test01();