]>
Commit | Line | Data |
---|---|---|
52066eae | 1 | // { dg-do run { target c++11 } } |
fe03b3df | 2 | |
7adcbafe | 3 | // Copyright (C) 2009-2022 Free Software Foundation, Inc. |
fe03b3df PC |
4 | // |
5 | // This file is part of the GNU ISO C++ Library. This library is free | |
6 | // software; you can redistribute it and/or modify it under the | |
7 | // terms of the GNU General Public License as published by the | |
8 | // Free Software Foundation; either version 3, or (at your option) | |
9 | // any later version. | |
10 | ||
11 | // This library is distributed in the hope that it will be useful, | |
12 | // but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | // GNU General Public License for more details. | |
15 | ||
16 | // You should have received a copy of the GNU General Public License along | |
17 | // with this library; see the file COPYING3. If not see | |
18 | // <http://www.gnu.org/licenses/>. | |
19 | ||
20 | // 25.3.1.2 [lib.stable.sort] | |
21 | ||
22 | #undef _GLIBCXX_CONCEPT_CHECKS | |
23 | ||
932f6f4a PC |
24 | // XXX FIXME: parallel-mode should deal correctly with moveable-only types |
25 | // per C++0x, at minimum smoothly fall back to serial. | |
26 | #undef _GLIBCXX_PARALLEL | |
27 | ||
fe03b3df PC |
28 | #include <algorithm> |
29 | #include <testsuite_hooks.h> | |
30 | #include <testsuite_iterators.h> | |
31 | #include <testsuite_rvalref.h> | |
32 | ||
33 | using __gnu_test::test_container; | |
34 | using __gnu_test::random_access_iterator_wrapper; | |
35 | using __gnu_test::rvalstruct; | |
36 | ||
37 | typedef test_container<rvalstruct, random_access_iterator_wrapper> Container; | |
38 | ||
39 | const int A[] = { 10, 20, 1, 11, 2, 12, 3, 13, 4, 14, 5, 15, 6, 16, 7, | |
40 | 17, 8, 18, 9, 19 }; | |
41 | const int N = sizeof(A) / sizeof(int); | |
42 | ||
43 | // 25.3.1.2 stable_sort() | |
44 | void | |
45 | test01() | |
46 | { | |
fe03b3df PC |
47 | rvalstruct s1[N]; |
48 | std::copy(A, A + N, s1); | |
49 | Container con(s1, s1 + N); | |
50 | std::stable_sort(con.begin(), con.end()); | |
51 | VERIFY( s1[0].valid ); | |
52 | for(int i = 1; i < N; ++i) | |
53 | VERIFY( s1[i].val>s1[i-1].val && s1[i].valid ); | |
54 | } | |
55 | ||
56 | int | |
57 | main() | |
58 | { | |
59 | test01(); | |
60 | return 0; | |
61 | } |