1 // { dg-do run { target c++11 } }
3 // Copyright (C) 2005-2020 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.3 [lib.partial.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
;
43 int intarray
[] = {6, 5, 4, 3, 2, 1, 0};
45 std::copy(intarray
, intarray
+ 7, array
);
46 Container
con(array
, array
+ 7);
47 partial_sort(con
.begin(), con
.it(3), con
.end());
48 VERIFY( array
[0].val
== 0 && array
[1].val
== 1 && array
[2].val
== 2 );
49 for(int i
= 0; i
< 7; ++i
)
50 VERIFY( array
[i
].valid
);
56 int intarray
[] = {0, 6, 1, 5, 2, 4, 3};
58 std::copy(intarray
, intarray
+ 7, array
);
59 Container
con(array
,array
+ 7);
60 partial_sort(con
.begin(), con
.it(3), con
.end());
61 VERIFY( array
[0].val
== 0 && array
[1].val
== 1 && array
[2].val
== 2 );
62 for(int i
= 0; i
< 7; ++i
)
63 VERIFY( array
[i
].valid
);
66 bool are_less(const rvalstruct
& lhs
, const rvalstruct
& rhs
)
72 int intarray
[] = {0, 6, 1, 5, 2, 4, 3};
74 std::copy(intarray
, intarray
+ 7, array
);
75 Container
con(array
,array
+ 7);
76 partial_sort(con
.begin(), con
.it(3), con
.end(), are_less
);
77 VERIFY( array
[0].val
== 0 && array
[1].val
== 1 && array
[2].val
== 2 );
78 for(int i
= 0; i
< 7; ++i
)
79 VERIFY( array
[i
].valid
);