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

   1 // Copyright (C) 2020-2024 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 // std::stable_partition is not freestanding.
  21 // { dg-require-effective-target hosted }
  22
  23 #include <algorithm>
  24 #include <testsuite_hooks.h>
  25 #include <testsuite_iterators.h>
  26
  27 using __gnu_test::test_container;
  28 using __gnu_test::test_range;
  29 using __gnu_test::bidirectional_iterator_wrapper;
  30
  31 namespace ranges = std::ranges;
  32
  33 void
  34 test01()
  35 {
  36     {
  37       int x[] = {1,2,3,4,5,6,7,8,9,10};
  38       test_container<int, bidirectional_iterator_wrapper> cx(x);
  39       auto pred = [] (int a) { return a%2==0; };
  40       auto range = ranges::stable_partition(cx, pred);
  41       VERIFY( ranges::all_of(cx.begin(), range.begin(), pred) );
  42       VERIFY( ranges::none_of(range, pred) );
  43     }
  44
  45     {
  46       int x[] = {1,2,3,4,5,6,7,8,9,10,11};
  47       test_range<int, bidirectional_iterator_wrapper> cx(x);
  48       auto pred = [] (int a) { return a%2==0; };
  49       auto range = ranges::stable_partition(cx, pred);
  50       VERIFY( ranges::all_of(cx.begin(), range.begin(), pred) );
  51       VERIFY( ranges::none_of(range, pred) );
  52     }
  53 }
  54
  55 void
  56 test02()
  57 {
  58   for (int k = 1; k <= 10; k++)
  59     {
  60       int x[] = {1,2,3,4,5,6,7,8,9,10};
  61       auto pred = [&] (int a) { return a >= k; };
  62       auto proj = [] (int a) { return a-1; };
  63       auto range = ranges::stable_partition(x, x+10, pred, proj);
  64       VERIFY( ranges::all_of(x, range.begin(), pred, proj) );
  65       VERIFY( ranges::none_of(range, pred, proj) );
  66
  67       int y[] = {0,1,2,3,4,5,6,7,8,9};
  68       ranges::rotate(y, y+k);
  69       VERIFY( ranges::equal(x, y, {}, proj) );
  70     }
  71 }
  72
  73 int
  74 main()
  75 {
  76   test01();
  77   test02();
  78 }