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

   1 // Copyright (C) 2020-2024 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 using __gnu_test::bidirectional_iterator_wrapper;
  29
  30 namespace ranges = std::ranges;
  31
  32 struct X { int i; };
  33
  34 void
  35 test01()
  36 {
  37   X x[] = { {10}, {11}, {2}, {6}, {8}, {10}, {11} };
  38   X y[] = { {10}, {11} };
  39   {
  40
  41     test_container<X, forward_iterator_wrapper> c(x);
  42     auto res = ranges::find_end(c, y, {}, &X::i, &X::i);
  43     VERIFY( std::get<0>(res)->i == 10 && std::get<1>(res) == ranges::end(c) );
  44     res = ranges::find_end(c, c, {}, &X::i, &X::i);
  45     VERIFY( std::get<0>(res) == ranges::begin(c)
  46             && std::get<1>(res) == ranges::end(c) );
  47   }
  48
  49   {
  50     test_range<X, forward_iterator_wrapper> r(x);
  51     auto res = ranges::find_end(r, y, {}, &X::i, &X::i);
  52     VERIFY( std::get<0>(res)->i == 10 && std::get<1>(res) == ranges::end(r) );
  53     res = ranges::find_end(r, r, {}, &X::i, &X::i);
  54     VERIFY( std::get<0>(res) == ranges::begin(r)
  55             && std::get<1>(res) == ranges::end(r) );
  56   }
  57
  58   {
  59     test_range<X, bidirectional_iterator_wrapper> r(x);
  60     auto res = ranges::find_end(r, y, {}, &X::i, &X::i);
  61     VERIFY( std::get<0>(res)->i == 10 && std::get<1>(res) == ranges::end(r) );
  62     res = ranges::find_end(r, r, {}, &X::i, &X::i);
  63     VERIFY( std::get<0>(res) == ranges::begin(r)
  64             && std::get<1>(res) == ranges::end(r) );
  65   }
  66 }
  67
  68 void
  69 test02()
  70 {
  71   static constexpr X x[] = { {2}, {2}, {6}, {8}, {10}, {6}, {8}, {11} };
  72   static constexpr X y[] = { {6}, {8} };
  73   static constexpr int z[] = { 2, 8 };
  74   static constexpr int w[] = { 2 };
  75
  76   static_assert(std::get<0>(ranges::find_end(x, y, {}, &X::i, &X::i)) == x+5);
  77   static_assert(std::get<1>(ranges::find_end(x, y, {}, &X::i, &X::i)) == x+7);
  78
  79   static_assert(std::get<0>(ranges::find_end(x, z, {}, &X::i)) == x+8);
  80   static_assert(std::get<1>(ranges::find_end(x, z, {}, &X::i)) == x+8);
  81
  82   static_assert(std::get<0>(ranges::find_end(x, w, {}, &X::i)) == x+1);
  83   static_assert(std::get<1>(ranges::find_end(x, w, {}, &X::i)) == x+2);
  84
  85   static_assert(std::get<0>(ranges::find_end(x, x+6, w, w, {}, &X::i)) == x+6);
  86   static_assert(std::get<1>(ranges::find_end(x, x+6, w, w, {}, &X::i)) == x+6);
  87
  88   static_assert(std::get<0>(ranges::find_end(x, x, w, w+1, {}, &X::i)) == x+0);
  89   static_assert(std::get<1>(ranges::find_end(x, x, w, w+1, {}, &X::i)) == x+0);
  90 }
  91
  92 int
  93 main()
  94 {
  95   test01();
  96   test02();
  97 }