libstdc++-v3/testsuite/25_algorithms/find_first_of/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   int y[] = { 2, 7, 8, 9 };
  38   X w[] = { {2}, {7}, {8}, {9} };
  39
  40   auto res = ranges::find_first_of(x, x+6, y+1, y+4, {}, &X::i);
  41   VERIFY( res == x+3 );
  42   res = ranges::find_first_of(x, x+6, w, w+4, {}, &X::i, &X::i);
  43   VERIFY( res == x+0 );
  44   res = ranges::find_first_of(x, x+6, y+3, y+4, {}, &X::i);
  45   VERIFY( res == x+6 );
  46
  47   test_container<X, forward_iterator_wrapper> c(x);
  48   test_container<int, forward_iterator_wrapper> d1(y+1, y+4);
  49   auto res2 = ranges::find_first_of(c, d1, {}, &X::i);
  50   VERIFY( res2 != ranges::end(c) && res2->i == 8 );
  51
  52   test_container<X, forward_iterator_wrapper> d2(w+3, w+4);
  53   res2 = ranges::find_first_of(c, d2, {}, &X::i, &X::i);
  54   VERIFY( res2 == ranges::end(c) );
  55
  56   test_range<X, input_iterator_wrapper> r(x);
  57   test_range<int, forward_iterator_wrapper> s1(y+1, y+4);
  58   auto res3 = ranges::find_first_of(r, s1, {}, &X::i);
  59   VERIFY( res3 != ranges::end(r) && res3->i == 8 );
  60
  61   test_range<X, forward_iterator_wrapper> s2(w+3, w+4);
  62   r.bounds.first = x;
  63   res3 = ranges::find_first_of(r, s2, {}, &X::i, &X::i);
  64   VERIFY( res3 == ranges::end(r) );
  65 }
  66
  67 struct Y { int i; int j; };
  68
  69 void
  70 test02()
  71 {
  72   static constexpr Y y[] = { {1,2}, {2,4}, {3,6} };
  73   static_assert(ranges::find_first_of(y, y, {}, &Y::j, &Y::i) == y);
  74   static_assert(ranges::find_first_of(y, y, {}, &Y::i, &Y::j) == y+1);
  75 }
  76
  77 int
  78 main()
  79 {
  80   test01();
  81   test02();
  82 }