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