1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
|
// { dg-do run { target c++11 } }
// Copyright (C) 2005-2024 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
// 25.3.1.3 [lib.partial.sort]
#undef _GLIBCXX_CONCEPT_CHECKS
// XXX FIXME: parallel-mode should deal correctly with moveable-only types
// per C++0x, at minimum smoothly fall back to serial.
#undef _GLIBCXX_PARALLEL
#include <algorithm>
#include <testsuite_hooks.h>
#include <testsuite_iterators.h>
#include <testsuite_rvalref.h>
using __gnu_test::test_container;
using __gnu_test::random_access_iterator_wrapper;
using __gnu_test::rvalstruct;
using std::partial_sort;
typedef test_container<rvalstruct, random_access_iterator_wrapper> Container;
void
test1()
{
int intarray[] = {6, 5, 4, 3, 2, 1, 0};
rvalstruct array[7];
std::copy(intarray, intarray + 7, array);
Container con(array, array + 7);
partial_sort(con.begin(), con.it(3), con.end());
VERIFY( array[0].val == 0 && array[1].val == 1 && array[2].val == 2 );
for(int i = 0; i < 7; ++i)
VERIFY( array[i].valid );
}
void
test2()
{
int intarray[] = {0, 6, 1, 5, 2, 4, 3};
rvalstruct array[7];
std::copy(intarray, intarray + 7, array);
Container con(array,array + 7);
partial_sort(con.begin(), con.it(3), con.end());
VERIFY( array[0].val == 0 && array[1].val == 1 && array[2].val == 2 );
for(int i = 0; i < 7; ++i)
VERIFY( array[i].valid );
}
bool are_less(const rvalstruct& lhs, const rvalstruct& rhs)
{ return lhs < rhs; }
void
test3()
{
int intarray[] = {0, 6, 1, 5, 2, 4, 3};
rvalstruct array[7];
std::copy(intarray, intarray + 7, array);
Container con(array,array + 7);
partial_sort(con.begin(), con.it(3), con.end(), are_less);
VERIFY( array[0].val == 0 && array[1].val == 1 && array[2].val == 2 );
for(int i = 0; i < 7; ++i)
VERIFY( array[i].valid );
}
int
main()
{
test1();
test2();
test3();
return 0;
}
|
