]>
Commit | Line | Data |
---|---|---|
83ffe9cd | 1 | // Copyright (C) 2020-2023 Free Software Foundation, Inc. |
bc464641 PP |
2 | // |
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) | |
7 | // any later version. | |
8 | ||
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. | |
13 | ||
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/>. | |
17 | ||
18 | // { dg-options "-std=gnu++2a" } | |
19 | // { dg-do run { target c++2a } } | |
20 | ||
7cc9022f AA |
21 | // std::stable_partition is not freestanding. |
22 | // { dg-require-effective-target hosted } | |
23 | ||
bc464641 PP |
24 | #include <algorithm> |
25 | #include <testsuite_hooks.h> | |
26 | #include <testsuite_iterators.h> | |
27 | ||
28 | using __gnu_test::test_container; | |
29 | using __gnu_test::test_range; | |
30 | using __gnu_test::bidirectional_iterator_wrapper; | |
31 | ||
32 | namespace ranges = std::ranges; | |
33 | ||
34 | void | |
35 | test01() | |
36 | { | |
37 | { | |
38 | int x[] = {1,2,3,4,5,6,7,8,9,10}; | |
39 | test_container<int, bidirectional_iterator_wrapper> cx(x); | |
40 | auto pred = [] (int a) { return a%2==0; }; | |
41 | auto range = ranges::stable_partition(cx, pred); | |
42 | VERIFY( ranges::all_of(cx.begin(), range.begin(), pred) ); | |
43 | VERIFY( ranges::none_of(range, pred) ); | |
44 | } | |
45 | ||
46 | { | |
47 | int x[] = {1,2,3,4,5,6,7,8,9,10,11}; | |
48 | test_range<int, bidirectional_iterator_wrapper> cx(x); | |
49 | auto pred = [] (int a) { return a%2==0; }; | |
50 | auto range = ranges::stable_partition(cx, pred); | |
51 | VERIFY( ranges::all_of(cx.begin(), range.begin(), pred) ); | |
52 | VERIFY( ranges::none_of(range, pred) ); | |
53 | } | |
54 | } | |
55 | ||
56 | void | |
57 | test02() | |
58 | { | |
59 | for (int k = 1; k <= 10; k++) | |
60 | { | |
61 | int x[] = {1,2,3,4,5,6,7,8,9,10}; | |
62 | auto pred = [&] (int a) { return a >= k; }; | |
63 | auto proj = [] (int a) { return a-1; }; | |
64 | auto range = ranges::stable_partition(x, x+10, pred, proj); | |
65 | VERIFY( ranges::all_of(x, range.begin(), pred, proj) ); | |
66 | VERIFY( ranges::none_of(range, pred, proj) ); | |
67 | ||
68 | int y[] = {0,1,2,3,4,5,6,7,8,9}; | |
69 | ranges::rotate(y, y+k); | |
70 | VERIFY( ranges::equal(x, y, {}, proj) ); | |
71 | } | |
72 | } | |
73 | ||
74 | int | |
75 | main() | |
76 | { | |
77 | test01(); | |
78 | test02(); | |
79 | } |