1 // { dg-do run { target c++11 } }
3 // Copyright (C) 2011-2019 Free Software Foundation, Inc.
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)
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.
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/>.
20 // 25.3.1 algorithms, sort
22 #undef _GLIBCXX_CONCEPT_CHECKS
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
29 #include <testsuite_hooks.h>
30 #include <testsuite_iterators.h>
31 #include <testsuite_rvalref.h>
33 using __gnu_test::test_container
;
34 using __gnu_test::random_access_iterator_wrapper
;
36 typedef __gnu_test::rvalstruct_compare_by_value V
;
37 typedef test_container
<V
, random_access_iterator_wrapper
> Container
;
42 V s1
[] = { 10, 20, 1, 11, 2, 12, 3, 13, 4, 14, 5, 15, 6, 16, 7,
44 const int N
= sizeof(s1
) / sizeof(V
);
45 Container
con(s1
, s1
+ N
);
46 std::sort(con
.begin(), con
.end());
48 for(int i
= 1; i
< N
; ++i
)
49 VERIFY( s1
[i
].val
> s1
[i
- 1].val
&& s1
[i
].ok
);
55 V s1
[] = { 10, 20, 1, 11, 2, 12, 3, 13, 4, 14, 5, 15, 6, 16, 7,
57 const int N
= sizeof(s1
) / sizeof(V
);
58 Container
con(s1
, s1
+ N
);
59 std::sort(con
.begin(), con
.end(), __gnu_test::order
);
61 for(int i
= 1; i
< N
; ++i
)
62 VERIFY( s1
[i
].val
> s1
[i
- 1].val
&& s1
[i
].ok
);
68 std::sort(vvs
, vvs
+ 2);
69 VERIFY( vvs
[0].ok
&& vvs
[0].val
== 0 );
70 VERIFY( vvs
[1].ok
&& vvs
[1].val
== 2 );