libstdc++-v3/testsuite/25_algorithms/stable_partition/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::bidirectional_iterator_wrapper;
  28
  29 namespace ranges = std::ranges;
  30
  31 void
  32 test01()
  33 {
  34     {
  35       int x[] = {1,2,3,4,5,6,7,8,9,10};
  36       test_container<int, bidirectional_iterator_wrapper> cx(x);
  37       auto pred = [] (int a) { return a%2==0; };
  38       auto range = ranges::stable_partition(cx, pred);
  39       VERIFY( ranges::all_of(cx.begin(), range.begin(), pred) );
  40       VERIFY( ranges::none_of(range, pred) );
  41     }
  42
  43     {
  44       int x[] = {1,2,3,4,5,6,7,8,9,10,11};
  45       test_range<int, bidirectional_iterator_wrapper> cx(x);
  46       auto pred = [] (int a) { return a%2==0; };
  47       auto range = ranges::stable_partition(cx, pred);
  48       VERIFY( ranges::all_of(cx.begin(), range.begin(), pred) );
  49       VERIFY( ranges::none_of(range, pred) );
  50     }
  51 }
  52
  53 void
  54 test02()
  55 {
  56   for (int k = 1; k <= 10; k++)
  57     {
  58       int x[] = {1,2,3,4,5,6,7,8,9,10};
  59       auto pred = [&] (int a) { return a >= k; };
  60       auto proj = [] (int a) { return a-1; };
  61       auto range = ranges::stable_partition(x, x+10, pred, proj);
  62       VERIFY( ranges::all_of(x, range.begin(), pred, proj) );
  63       VERIFY( ranges::none_of(range, pred, proj) );
  64
  65       int y[] = {0,1,2,3,4,5,6,7,8,9};
  66       ranges::rotate(y, y+k);
  67       VERIFY( ranges::equal(x, y, {}, proj) );
  68     }
  69 }
  70
  71 int
  72 main()
  73 {
  74   test01();
  75   test02();
  76 }