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
|
// 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 } }
// std::stable_partition is not freestanding.
// { dg-require-effective-target hosted }
#include <algorithm>
#include <testsuite_hooks.h>
#include <testsuite_iterators.h>
using __gnu_test::test_container;
using __gnu_test::test_range;
using __gnu_test::bidirectional_iterator_wrapper;
namespace ranges = std::ranges;
void
test01()
{
{
int x[] = {1,2,3,4,5,6,7,8,9,10};
test_container<int, bidirectional_iterator_wrapper> cx(x);
auto pred = [] (int a) { return a%2==0; };
auto range = ranges::stable_partition(cx, pred);
VERIFY( ranges::all_of(cx.begin(), range.begin(), pred) );
VERIFY( ranges::none_of(range, pred) );
}
{
int x[] = {1,2,3,4,5,6,7,8,9,10,11};
test_range<int, bidirectional_iterator_wrapper> cx(x);
auto pred = [] (int a) { return a%2==0; };
auto range = ranges::stable_partition(cx, pred);
VERIFY( ranges::all_of(cx.begin(), range.begin(), pred) );
VERIFY( ranges::none_of(range, pred) );
}
}
void
test02()
{
for (int k = 1; k <= 10; k++)
{
int x[] = {1,2,3,4,5,6,7,8,9,10};
auto pred = [&] (int a) { return a >= k; };
auto proj = [] (int a) { return a-1; };
auto range = ranges::stable_partition(x, x+10, pred, proj);
VERIFY( ranges::all_of(x, range.begin(), pred, proj) );
VERIFY( ranges::none_of(range, pred, proj) );
int y[] = {0,1,2,3,4,5,6,7,8,9};
ranges::rotate(y, y+k);
VERIFY( ranges::equal(x, y, {}, proj) );
}
}
int
main()
{
test01();
test02();
}
|
