1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
|
// Copyright (C) 2020-2023 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
// { dg-options "-std=gnu++2a" }
// { dg-do run { target c++2a } }
#include <algorithm>
#include <testsuite_hooks.h>
#include <testsuite_iterators.h>
using __gnu_test::test_container;
using __gnu_test::test_range;
using __gnu_test::input_iterator_wrapper;
using __gnu_test::forward_iterator_wrapper;
using __gnu_test::bidirectional_iterator_wrapper;
namespace ranges = std::ranges;
struct X { int i; };
void
test01()
{
X x[] = { {10}, {11}, {2}, {6}, {8}, {10}, {11} };
X y[] = { {10}, {11} };
{
test_container<X, forward_iterator_wrapper> c(x);
auto res = ranges::find_end(c, y, {}, &X::i, &X::i);
VERIFY( std::get<0>(res)->i == 10 && std::get<1>(res) == ranges::end(c) );
res = ranges::find_end(c, c, {}, &X::i, &X::i);
VERIFY( std::get<0>(res) == ranges::begin(c)
&& std::get<1>(res) == ranges::end(c) );
}
{
test_range<X, forward_iterator_wrapper> r(x);
auto res = ranges::find_end(r, y, {}, &X::i, &X::i);
VERIFY( std::get<0>(res)->i == 10 && std::get<1>(res) == ranges::end(r) );
res = ranges::find_end(r, r, {}, &X::i, &X::i);
VERIFY( std::get<0>(res) == ranges::begin(r)
&& std::get<1>(res) == ranges::end(r) );
}
{
test_range<X, bidirectional_iterator_wrapper> r(x);
auto res = ranges::find_end(r, y, {}, &X::i, &X::i);
VERIFY( std::get<0>(res)->i == 10 && std::get<1>(res) == ranges::end(r) );
res = ranges::find_end(r, r, {}, &X::i, &X::i);
VERIFY( std::get<0>(res) == ranges::begin(r)
&& std::get<1>(res) == ranges::end(r) );
}
}
void
test02()
{
static constexpr X x[] = { {2}, {2}, {6}, {8}, {10}, {6}, {8}, {11} };
static constexpr X y[] = { {6}, {8} };
static constexpr int z[] = { 2, 8 };
static constexpr int w[] = { 2 };
static_assert(std::get<0>(ranges::find_end(x, y, {}, &X::i, &X::i)) == x+5);
static_assert(std::get<1>(ranges::find_end(x, y, {}, &X::i, &X::i)) == x+7);
static_assert(std::get<0>(ranges::find_end(x, z, {}, &X::i)) == x+8);
static_assert(std::get<1>(ranges::find_end(x, z, {}, &X::i)) == x+8);
static_assert(std::get<0>(ranges::find_end(x, w, {}, &X::i)) == x+1);
static_assert(std::get<1>(ranges::find_end(x, w, {}, &X::i)) == x+2);
static_assert(std::get<0>(ranges::find_end(x, x+6, w, w, {}, &X::i)) == x+6);
static_assert(std::get<1>(ranges::find_end(x, x+6, w, w, {}, &X::i)) == x+6);
static_assert(std::get<0>(ranges::find_end(x, x, w, w+1, {}, &X::i)) == x+0);
static_assert(std::get<1>(ranges::find_end(x, x, w, w+1, {}, &X::i)) == x+0);
}
int
main()
{
test01();
test02();
}
|
