libstdc++-v3/testsuite/25_algorithms/find_if_not/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::forward_iterator_wrapper;
  29
  30 namespace ranges = std::ranges;
  31
  32 struct X { int i; };
  33
  34 void
  35 test01()
  36 {
  37   X x[] = { {2}, {2}, {6}, {8}, {10}, {11} };
  38   auto res = ranges::find_if_not(x, x+6, [] (X& v) { return v.i != 8; });
  39   VERIFY( res == x+3 );
  40   res = ranges::find_if_not(x, x+6, [] (X& v) { return v.i % 2 == 1; });
  41   VERIFY( res == x+0 );
  42   res = ranges::find_if_not(x, x+6, [] (X& v) { return v.i != 9; });
  43   VERIFY( res == x+6 );
  44
  45   test_container<X, forward_iterator_wrapper> c(x);
  46   auto res2 = ranges::find_if_not(c, [] (int i) { return i <= 7; }, &X::i);
  47   VERIFY( res2 != ranges::end(c) && res2->i == 8 );
  48   res2 = ranges::find_if_not(c, [] (int i) { return i <= 11; }, &X::i);
  49   VERIFY( res2 == ranges::end(c) );
  50
  51   test_range<X, input_iterator_wrapper> r(x);
  52   auto res3 = ranges::find_if_not(r, [] (int i) { return i <= 10; }, &X::i);
  53   VERIFY( res3 != ranges::end(r) && res3->i == 11 );
  54
  55   r.bounds.first = x;
  56   res3 = ranges::find_if_not(r, [] (int i) { return i != 9; }, &X::i);
  57   VERIFY( res3 == ranges::end(r) );
  58 }
  59
  60 struct Y { int i; int j; };
  61
  62 void
  63 test02()
  64 {
  65   static constexpr Y y[] = { {1,2}, {2,4}, {3,6} };
  66   static_assert(ranges::find_if_not(y, [] (int i) { return i <= 3; }, &Y::j)
  67                 == y+1);
  68   static_assert(ranges::find_if_not(y, [] (int i) { return i != 5; }, &Y::j)
  69                 == y+3);
  70 }
  71
  72 int
  73 main()
  74 {
  75   test01();
  76   test02();
  77 }