libstdc++-v3/testsuite/25_algorithms/find_first_of/constrained.cc

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