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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
// Copyright (C) 2020-2022 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::output_iterator_wrapper;
using __gnu_test::forward_iterator_wrapper;
namespace ranges = std::ranges;
struct X
{
int i;
friend constexpr bool
operator==(const X& a, const X& b)
{
return a.i == b.i;
}
};
void
test01()
{
auto is_negative_p = [] (int a) { return a < 0; };
auto is_two_p = [] (int a) { return a == 2; };
{
const X x[6] = { {2}, {2}, {6}, {8}, {2}, {11} };
X y[2];
X z[2] = { {6}, {8} };
auto [in, out] = ranges::remove_copy_if(x, x+5, y, is_two_p, &X::i);
VERIFY( in == x+5 && out == y+2 );
VERIFY( ranges::equal(y, z) );
}
{
const X x[6] = { {2}, {2}, {6}, {8}, {10}, {11} };
X y[5];
X z[5] = { {2}, {2}, {6}, {8}, {10} };
auto [in, out] = ranges::remove_copy_if(x, x+5, y, is_negative_p, &X::i);
VERIFY( in == x+5 && out == y+5 );
VERIFY( ranges::equal(x, x+5, y, y+5) && ranges::equal(y, z) );
}
{
X x[6] = { {2}, {2}, {6}, {8}, {10}, {11} };
X y[4];
X z[4] = { {6}, {8}, {10}, {11} };
test_container<X, forward_iterator_wrapper> cx(x), cy(y), cz(z);
auto [in, out] = ranges::remove_copy_if(cx, cy.begin(), is_two_p, &X::i);
VERIFY( in == cx.end() && out == cy.end() );
VERIFY( ranges::equal(cy, cz) );
}
{
X x[6] = { {2}, {2}, {6}, {8}, {10}, {11} };
X y[4];
const X z[4] = { {6}, {8}, {10}, {11} };
test_range<X, input_iterator_wrapper> cx(x);
test_range<X, output_iterator_wrapper> cy(y);
auto [in, out] = ranges::remove_copy_if(cx, cy.begin(), is_two_p, &X::i);
VERIFY( in == cx.end() && out == cy.end() );
VERIFY( ranges::equal(y, z) );
}
}
struct Y { int i; int j; };
constexpr bool
test02()
{
bool ok = true;
Y x[3] = { {3,2}, {2,4}, {3,6} };
Y y[1];
Y z[1] = { {2,4} };
auto [in, out]
= ranges::remove_copy_if(x, y, [] (int a) { return a%2 == 1; }, &Y::i);
ok &= in == x+3;
ok &= out == y+1;
ok &= ranges::equal(y, z, {}, &Y::i, &Y::i);
ok &= ranges::equal(y, z, {}, &Y::j, &Y::j);
return ok;
}
int
main()
{
test01();
static_assert(test02());
}
|
