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
|
// 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;
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_even_p = [] (int a) { return a%2 == 0; };
auto is_negative_p = [] (int a) { return a < 0; };
auto is_two_p = [] (int a) { return a == 2; };
{
X x[6] = { {1}, {2}, {6}, {8}, {10}, {11} };
X y[6] = { {1}, {9}, {9}, {9}, {9}, {11} };
auto res = ranges::replace_if(x, x+5, is_even_p, X{9}, &X::i);
VERIFY( res == x+5 );
VERIFY( ranges::equal(x, y) );
}
{
X x[6] = { {2}, {2}, {6}, {8}, {10}, {11} };
X y[6] = { {2}, {2}, {6}, {8}, {10}, {11} };
auto res = ranges::replace_if(x, x+5, is_negative_p, X{9}, &X::i);
VERIFY( res == x+5 );
VERIFY( ranges::equal(x, y) );
}
{
X x[6] = { {2}, {2}, {6}, {8}, {10}, {11} };
X y[6] = { {7}, {7}, {6}, {8}, {10}, {11} };
test_container<X, forward_iterator_wrapper> cx(x), cy(y);
auto res = ranges::replace_if(cx, is_two_p, X{7}, &X::i);
VERIFY( res == cx.end() );
VERIFY( ranges::equal(cx, cy) );
}
{
int x[6] = { {2}, {2}, {6}, {8}, {10}, {2} };
int y[6] = { {7}, {7}, {6}, {8}, {10}, {7} };
test_range<int, input_iterator_wrapper> rx(x), ry(y);
auto res = ranges::replace_if(rx, is_two_p, 7);
VERIFY( res == rx.end() );
rx.bounds.first = x;
ry.bounds.first = y;
VERIFY( ranges::equal(rx, ry) );
}
}
struct Y { int i; int j; };
constexpr bool
test02()
{
bool ok = true;
Y x[] = { {3,2}, {2,4}, {3,6} };
Y y[] = { {4,5}, {2,4}, {4,5} };
auto res = ranges::replace_if(x, [] (int a) { return a%2 == 1; },
Y{4,5}, &Y::i);
ok &= res == x+3;
ok &= ranges::equal(x, y, {}, &Y::i, &Y::i);
ok &= ranges::equal(x, y, {}, &Y::j, &Y::j);
return ok;
}
int
main()
{
test01();
static_assert(test02());
}
|
