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

   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.
   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-do run { target c++20 } }
  19
  20 #include <algorithm>
  21 #include <vector>
  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::bidirectional_iterator_wrapper;
  28
  29 namespace ranges = std::ranges;
  30
  31 void
  32 test01()
  33 {
  34   int x[] = {1,2,3,4,5};
  35   for (int i = 0; i <= 5; i++)
  36     for (int j = 0; j <= 5; j++)
  37       {
  38         std::vector<int> v(x, x+i);
  39         v.insert(v.end(), x, x+j);
  40         ranges::sort(v);
  41
  42         test_range<int, bidirectional_iterator_wrapper> rz(v.data(), v.data()+i+j);
  43         auto result = ranges::inplace_merge(rz, ranges::next(ranges::begin(rz), i));
  44         VERIFY( result == rz.end() );
  45
  46         VERIFY( ranges::is_sorted(rz) );
  47       }
  48 }
  49
  50 void
  51 test02()
  52 {
  53   struct X { int i, j; };
  54   X x[] = { {1, 1}, {3, 4}, {5, 5}, {2, 2}, {2, 3} };
  55   auto comp = ranges::greater{};
  56   auto proj = [] (X a) { return -a.i; };
  57   ranges::inplace_merge(x, x+3, x+5, comp, proj);
  58   VERIFY( ranges::is_sorted(x, {}, &X::i) );
  59   VERIFY( ranges::is_sorted(x, {}, &X::j) );
  60 }
  61
  62
  63 int
  64 main()
  65 {
  66   test01();
  67   test02();
  68 }