]>
git.ipfire.org Git - thirdparty/gcc.git/blob - libstdc++-v3/testsuite/25_algorithms/find/constrained.cc
1 // Copyright (C) 2020-2021 Free Software Foundation, Inc.
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)
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.
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/>.
18 // { dg-options "-std=gnu++2a" }
19 // { dg-do run { target c++2a } }
22 #include <testsuite_hooks.h>
23 #include <testsuite_iterators.h>
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
;
30 namespace ranges
= std::ranges
;
37 X x
[] = { {2}, {2}, {6}, {8}, {10}, {11} };
38 auto res
= ranges::find(x
, x
+6, 8, &X::i
);
40 res
= ranges::find(x
, x
+6, 2, &X::i
);
42 res
= ranges::find(x
, x
+6, 9, &X::i
);
45 test_container
<X
, forward_iterator_wrapper
> c(x
);
46 auto res2
= ranges::find(c
, 8, &X::i
);
47 VERIFY( res2
!= ranges::end(c
) && res2
->i
== 8 );
48 res2
= ranges::find(c
, 9, &X::i
);
49 VERIFY( res2
== ranges::end(c
) );
51 test_range
<X
, input_iterator_wrapper
> r(x
);
52 auto res3
= ranges::find(r
, 8, &X::i
);
53 VERIFY( res3
!= ranges::end(r
) && res3
->i
== 8 );
56 res3
= ranges::find(r
, 9, &X::i
);
57 VERIFY( res3
== ranges::end(r
) );
60 struct Y
{ int i
; int j
; };
65 static constexpr Y y
[] = { {1,2}, {2,4}, {3,6} };
66 static_assert(ranges::find(y
, 4, &Y::j
) == y
+1);
67 static_assert(ranges::find(y
, 5, &Y::j
) == y
+3);