libstdc++-v3/testsuite/25_algorithms/set_intersection/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::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 void
  34 test01()
  35 {
  36   int x[] = {4,2,1,1,0};
  37   int y[] = {3,2,1};
  38   int z[2];
  39   test_range<int, input_iterator_wrapper> rx(x), ry(y);
  40   test_range<int, output_iterator_wrapper> rz(z);
  41   auto [in1,in2,out]
  42     = ranges::set_intersection(rx, ry, rz.begin(), ranges::greater{});
  43   VERIFY( in1.ptr == x+5 );
  44   VERIFY( in2.ptr == y+3 );
  45   VERIFY( out.ptr == z+2 );
  46   VERIFY( ranges::equal(z, (int[]){2,1}) );
  47 }
  48
  49 void
  50 test02()
  51 {
  52   int x[] = {3,2,1,1,0};
  53   int y[] = {3,2,1,0};
  54   int z[4];
  55   test_container<int, forward_iterator_wrapper> rx(x), ry(y);
  56   test_container<int, forward_iterator_wrapper> rz(z);
  57   auto [in1,in2,out]
  58     = ranges::set_intersection(rx.begin(), rx.end(),
  59                                ry.begin(), ry.end(),
  60                                rz.begin(),
  61                                {},
  62                                std::negate<>{},
  63                                std::negate<>{});
  64   VERIFY( in1.ptr == x+5 );
  65   VERIFY( in2.ptr == y+4 );
  66   VERIFY( out.ptr == z+4 );
  67   VERIFY( ranges::equal(z, (int[]){3,2,1,0}) );
  68 }
  69
  70 constexpr bool
  71 test03()
  72 {
  73   bool ok = true;
  74   int x[1] = {0};
  75   int y[1] = {1};
  76   int z[1];
  77   ok &= ranges::set_intersection(x, x, y, y+1, z).out == z;
  78   ok &= ranges::set_intersection(x, x+1, y, y, z).out == z;
  79   return ok;
  80 }
  81
  82 int
  83 main()
  84 {
  85   test01();
  86   test02();
  87   static_assert(test03());
  88 }