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