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

   1 // Copyright (C) 2020-2022 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 using __gnu_test::output_iterator_wrapper;
  29 using __gnu_test::forward_iterator_wrapper;
  30
  31 namespace ranges = std::ranges;
  32
  33 struct X
  34 {
  35   int i;
  36
  37   friend constexpr bool
  38   operator==(const X& a, const X& b)
  39   {
  40     return a.i == b.i;
  41   }
  42 };
  43
  44 void
  45 test01()
  46 {
  47   auto is_negative_p = [] (int a) { return a < 0; };
  48   auto is_two_p = [] (int a) { return a == 2; };
  49
  50     {
  51       const X x[6] = { {2}, {2}, {6}, {8}, {2}, {11} };
  52       X y[2];
  53       X z[2] = { {6}, {8} };
  54       auto [in, out] = ranges::remove_copy_if(x, x+5, y, is_two_p, &X::i);
  55       VERIFY( in == x+5 && out == y+2 );
  56       VERIFY( ranges::equal(y, z) );
  57     }
  58
  59     {
  60       const X x[6] = { {2}, {2}, {6}, {8}, {10}, {11} };
  61       X y[5];
  62       X z[5] = { {2}, {2}, {6}, {8}, {10} };
  63       auto [in, out] = ranges::remove_copy_if(x, x+5, y, is_negative_p, &X::i);
  64       VERIFY( in == x+5 && out == y+5 );
  65       VERIFY( ranges::equal(x, x+5, y, y+5) && ranges::equal(y, z) );
  66     }
  67
  68     {
  69       X x[6] = { {2}, {2}, {6}, {8}, {10}, {11} };
  70       X y[4];
  71       X z[4] = { {6}, {8}, {10}, {11} };
  72       test_container<X, forward_iterator_wrapper> cx(x), cy(y), cz(z);
  73       auto [in, out] = ranges::remove_copy_if(cx, cy.begin(), is_two_p, &X::i);
  74       VERIFY( in == cx.end() && out == cy.end() );
  75       VERIFY( ranges::equal(cy, cz) );
  76     }
  77
  78     {
  79       X x[6] = { {2}, {2}, {6}, {8}, {10}, {11} };
  80       X y[4];
  81       const X z[4] = { {6}, {8}, {10}, {11} };
  82       test_range<X, input_iterator_wrapper> cx(x);
  83       test_range<X, output_iterator_wrapper> cy(y);
  84       auto [in, out] = ranges::remove_copy_if(cx, cy.begin(), is_two_p, &X::i);
  85       VERIFY( in == cx.end() && out == cy.end() );
  86       VERIFY( ranges::equal(y, z) );
  87     }
  88 }
  89
  90 struct Y { int i; int j; };
  91
  92 constexpr bool
  93 test02()
  94 {
  95   bool ok = true;
  96   Y x[3] = { {3,2}, {2,4}, {3,6} };
  97   Y y[1];
  98   Y z[1] = { {2,4} };
  99   auto [in, out]
 100     = ranges::remove_copy_if(x, y, [] (int a) { return a%2 == 1; }, &Y::i);
 101   ok &= in == x+3;
 102   ok &= out == y+1;
 103   ok &= ranges::equal(y, z, {}, &Y::i, &Y::i);
 104   ok &= ranges::equal(y, z, {}, &Y::j, &Y::j);
 105   return ok;
 106 }
 107
 108 int
 109 main()
 110 {
 111   test01();
 112   static_assert(test02());
 113 }