1 // Copyright (C) 2001 Free Software Foundation, Inc.
3 // This file is part of the GNU ISO C++ Library. This library is free
4 // software; you can redistribute it and/or modify it under the
5 // terms of the GNU General Public License as published by the
6 // Free Software Foundation; either version 2, or (at your option)
9 // This library is distributed in the hope that it will be useful,
10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 // GNU General Public License for more details.
14 // You should have received a copy of the GNU General Public License along
15 // with this library; see the file COPYING. If not, write to the Free
16 // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
19 // 25.3.1 algorithms, sort()
22 #include <testsuite_hooks.h>
24 bool test
__attribute__((unused
)) = true;
26 const int A
[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20};
27 const int B
[] = {10, 20, 1, 11, 2, 12, 3, 13, 4, 14, 5, 15, 6, 16, 7, 17, 8, 18, 9, 19};
28 const int C
[] = {20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
29 const int N
= sizeof(A
) / sizeof(int);
30 const int logN
= 3; // ln(N) rounded up
33 // comparison predicate for stable_sort: order by rightmost digit
37 operator()(const int x
, const int y
)
38 { return x
% 10 < y
% 10; }
41 // This functor has the equivalent functionality of std::geater<>,
42 // but there is no dependency on <functional> and it also tracks the
43 // number of invocations since creation.
47 static int count() { return itsCount
; }
48 static void reset() { itsCount
= 0; }
51 operator()(const int& x
, const int& y
)
69 std::copy(B
, B
+ N
, s1
);
70 VERIFY(std::equal(s1
, s1
+ N
, B
));
72 std::sort(s1
, s1
+ N
);
73 VERIFY(std::equal(s1
, s1
+ N
, A
));
77 std::sort(s1
, s1
+ N
, gt
);
78 VERIFY(std::equal(s1
, s1
+ N
, C
));
81 // 25.3.1.2 stable_sort()
86 std::copy(A
, A
+ N
, s1
);
87 VERIFY(std::equal(s1
, s1
+ N
, A
));
89 std::stable_sort(s1
, s1
+ N
, CompLast());
90 VERIFY(std::equal(s1
, s1
+ N
, B
));
92 std::stable_sort(s1
, s1
+ N
);
93 VERIFY(std::equal(s1
, s1
+ N
, A
));
97 std::stable_sort(s1
, s1
+ N
, gt
);
98 VERIFY(std::equal(s1
, s1
+ N
, C
));
99 VERIFY(gt
.count() <= N
* logN
* logN
);
102 // 25.3.1.3 partial_sort()
107 std::copy(B
, B
+ N
, s1
);
108 VERIFY(std::equal(s1
, s1
+ N
, B
));
110 std::partial_sort(s1
, s1
+ P
, s1
+ N
);
111 VERIFY(std::equal(s1
, s1
+ P
, A
));
115 std::partial_sort(s1
, s1
+ P
, s1
+ N
, gt
);
116 VERIFY(std::equal(s1
, s1
+ P
, C
));
119 // 25.3.1.4 partial_sort_copy()
123 using std::partial_sort_copy
;
126 std::copy(B
, B
+ N
, s1
);
127 VERIFY(std::equal(s1
, s1
+ N
, B
));
131 partial_sort_copy(s1
, s1
+ N
, s2
, s2
+ P
);
132 VERIFY(std::equal(s2
, s2
+ P
, A
));
136 partial_sort_copy(s1
, s1
+ N
, s2
, s2
+ P
, gt
);
137 VERIFY(std::equal(s2
, s2
+ P
, C
));
139 VERIFY(std::equal(s2
, partial_sort_copy(s1
, s1
+ N
, s2
, s2
+ 2*N
), A
));
142 // 25.3.2 nth_element()
146 using std::nth_element
;
149 std::copy(B
, B
+ N
, s1
);
150 VERIFY(std::equal(s1
, s1
+ N
, B
));
152 int* pn
= s1
+ (N
/ 2) - 1;
153 nth_element(s1
, pn
, s1
+ N
);
154 for (const int* i
= pn
; i
< s1
+ N
; ++i
) VERIFY(!(*i
< *pn
));
157 nth_element(s1
, pn
, s1
+ N
, pred
);
158 for (const int* i
= pn
; i
< s1
+ N
; ++i
) VERIFY(!pred(*i
, *pn
));