1 // { dg-options "-std=gnu++11" }
3 // Copyright (C) 2005-2015 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
;
35 using __gnu_test::rvalstruct
;
36 using std::partial_sort
;
38 typedef test_container
<rvalstruct
, random_access_iterator_wrapper
> Container
;
40 const int A
[] = {10, 20, 1, 11, 2, 12, 3, 13, 4, 14, 5, 15, 6, 16, 7,
42 const int N
= sizeof(A
) / sizeof(int);
48 bool test
__attribute__((unused
)) = true;
51 std::copy(A
, A
+ N
, s1
);
52 Container
con(s1
, s1
+ N
);
53 std::sort(con
.begin(), con
.end());
54 VERIFY( s1
[0].valid
);
55 for(int i
= 1; i
< N
; ++i
)
56 VERIFY( s1
[i
].val
>s1
[i
-1].val
&& s1
[i
].valid
);
59 bool order(const rvalstruct
& lhs
, const rvalstruct
& rhs
)
66 bool test
__attribute__((unused
)) = true;
69 std::copy(A
, A
+ N
, s1
);
70 Container
con(s1
, s1
+ N
);
71 std::sort(con
.begin(), con
.end(), order
);
72 VERIFY( s1
[0].valid
);
73 for(int i
= 1; i
< N
; ++i
)
74 VERIFY( s1
[i
].val
>s1
[i
-1].val
&& s1
[i
].valid
);