libstdc++-v3/testsuite/25_algorithms/minmax/constrained.cc

   1 // Copyright (C) 2020-2021 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.
   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 template<typename T1, typename T2>
  32 constexpr bool
  33 operator==(const ranges::minmax_result<T1>& lhs,
  34            const ranges::minmax_result<T2>& rhs)
  35 {
  36   return (lhs.min == rhs.min
  37           && rhs.max == rhs.max);
  38 }
  39
  40
  41 struct X
  42 {
  43   int i, j;
  44 };
  45
  46 using res_t = ranges::minmax_result<int>;
  47
  48 void
  49 test01()
  50 {
  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 );
  58 }
  59
  60 void
  61 test02()
  62 {
  63   int x[] = {1,2,3,4};
  64   do
  65     {
  66       test_range<int, input_iterator_wrapper> cx(x);
  67       VERIFY( ranges::minmax(cx) == res_t(1,4) );
  68       cx.bounds.first = x;
  69       VERIFY( ranges::minmax(cx, ranges::greater{}) == res_t(4,1) );
  70       cx.bounds.first = x;
  71       VERIFY( ranges::minmax(cx, {}, std::negate<>{}) == res_t(4,1));
  72       cx.bounds.first = x;
  73       VERIFY( ranges::minmax(cx, ranges::greater{}, std::negate<>{})
  74               == res_t(1,4) );
  75     } while (ranges::next_permutation(x).found);
  76
  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);
  80 }
  81
  82 void
  83 test03()
  84 {
  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<>{})
  89           == res_t(1,4) );
  90 }
  91
  92 int
  93 main()
  94 {
  95   test01();
  96   test02();
  97   test03();
  98 }