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