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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
|
// Range v3 library
//
// Copyright Eric Niebler 2014-present
//
// Use, modification and distribution is subject to the
// Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
// Project home: https://github.com/ericniebler/range-v3
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#include <memory>
#include <random>
#include <vector>
#include <algorithm>
#include <range/v3/core.hpp>
#include <range/v3/algorithm/stable_sort.hpp>
#include "../simple_test.hpp"
#include "../test_utils.hpp"
#include "../test_iterators.hpp"
RANGES_DIAGNOSTIC_IGNORE_GLOBAL_CONSTRUCTORS
RANGES_DIAGNOSTIC_IGNORE_SIGN_CONVERSION
namespace
{
std::mt19937 gen;
#if !defined(__clang__) || !defined(_MSVC_STL_VERSION) // Avoid #890
struct indirect_less
{
template<class P>
bool operator()(const P& x, const P& y)
{return *x < *y;}
};
#endif // Avoid #890
template<class RI>
void
test_sort_helper(RI f, RI l)
{
using value_type = ranges::iter_value_t<RI>;
auto stable_sort = make_testable_1<false>(ranges::stable_sort);
if (f != l)
{
auto len = l - f;
value_type* save(new value_type[len]);
do
{
std::copy(f, l, save);
stable_sort(save, save+len).check([&](int *res)
{
CHECK(res == save+len);
CHECK(std::is_sorted(save, save+len));
std::copy(f, l, save);
});
stable_sort(save, save+len, std::greater<int>{}).check([&](int *res)
{
CHECK(res == save+len);
CHECK(std::is_sorted(save, save+len, std::greater<int>{}));
std::copy(f, l, save);
});
} while (std::next_permutation(f, l));
delete [] save;
}
}
template<class RI>
void
test_sort_driver_driver(RI f, RI l, int start, RI real_last)
{
for (RI i = l; i > f + start;)
{
*--i = start;
if (f == i)
{
test_sort_helper(f, real_last);
}
if (start > 0)
test_sort_driver_driver(f, i, start-1, real_last);
}
}
template<class RI>
void
test_sort_driver(RI f, RI l, int start)
{
test_sort_driver_driver(f, l, start, l);
}
template<int sa>
void
test_sort_()
{
int ia[sa];
for (int i = 0; i < sa; ++i)
{
test_sort_driver(ia, ia+sa, i);
}
}
void
test_larger_sorts(int N, int M)
{
RANGES_ENSURE(N > 0);
RANGES_ENSURE(M > 0);
// create array length N filled with M different numbers
int* array = new int[N];
int x = 0;
for (int i = 0; i < N; ++i)
{
array[i] = x;
if (++x == M)
x = 0;
}
// test saw tooth pattern
CHECK(ranges::stable_sort(array, array+N) == array+N);
CHECK(std::is_sorted(array, array+N));
// test random pattern
std::shuffle(array, array+N, gen);
CHECK(ranges::stable_sort(array, array+N) == array+N);
CHECK(std::is_sorted(array, array+N));
// test sorted pattern
CHECK(ranges::stable_sort(array, array+N) == array+N);
CHECK(std::is_sorted(array, array+N));
// test reverse sorted pattern
std::reverse(array, array+N);
CHECK(ranges::stable_sort(array, array+N) == array+N);
CHECK(std::is_sorted(array, array+N));
// test swap ranges 2 pattern
std::swap_ranges(array, array+N/2, array+N/2);
CHECK(ranges::stable_sort(array, array+N) == array+N);
CHECK(std::is_sorted(array, array+N));
// test reverse swap ranges 2 pattern
std::reverse(array, array+N);
std::swap_ranges(array, array+N/2, array+N/2);
CHECK(ranges::stable_sort(array, array+N) == array+N);
CHECK(std::is_sorted(array, array+N));
delete [] array;
}
void
test_larger_sorts(unsigned N)
{
test_larger_sorts(N, 1);
test_larger_sorts(N, 2);
test_larger_sorts(N, 3);
test_larger_sorts(N, N/2-1);
test_larger_sorts(N, N/2);
test_larger_sorts(N, N/2+1);
test_larger_sorts(N, N-2);
test_larger_sorts(N, N-1);
test_larger_sorts(N, N);
}
struct S
{
int i, j;
};
}
int main()
{
// test null range
int d = 0;
int * r = ranges::stable_sort(&d, &d);
CHECK(r == &d);
// exhaustively test all possibilities up to length 8
test_sort_<1>();
test_sort_<2>();
test_sort_<3>();
test_sort_<4>();
test_sort_<5>();
test_sort_<6>();
test_sort_<7>();
test_sort_<8>();
test_larger_sorts(15);
test_larger_sorts(16);
test_larger_sorts(17);
test_larger_sorts(256);
test_larger_sorts(257);
test_larger_sorts(499);
test_larger_sorts(500);
test_larger_sorts(997);
test_larger_sorts(1000);
test_larger_sorts(1009);
#if !defined(__clang__) || !defined(_MSVC_STL_VERSION) // Avoid #890
// Check move-only types
{
std::vector<std::unique_ptr<int> > v(1000);
for(int i = 0; (std::size_t)i < v.size(); ++i)
v[i].reset(new int((int)v.size() - i - 1));
ranges::stable_sort(v, indirect_less());
for(int i = 0; (std::size_t)i < v.size(); ++i)
CHECK(*v[i] == i);
}
// Check projections
{
std::vector<S> v(1000, S{});
for(int i = 0; (std::size_t)i < v.size(); ++i)
{
v[i].i = (int)v.size() - i - 1;
v[i].j = i;
}
ranges::stable_sort(v, std::less<int>{}, &S::i);
for(int i = 0; (std::size_t)i < v.size(); ++i)
{
CHECK(v[i].i == i);
CHECK((std::size_t)v[i].j == v.size() - i - 1);
}
}
// Check rvalue container
{
std::vector<S> v(1000, S{});
for(int i = 0; (std::size_t)i < v.size(); ++i)
{
v[i].i = (int)v.size() - i - 1;
v[i].j = i;
}
CHECK(::is_dangling(ranges::stable_sort(std::move(v), std::less<int>{}, &S::i)));
for(int i = 0; (std::size_t)i < v.size(); ++i)
{
CHECK(v[i].i == i);
CHECK((std::size_t)v[i].j == v.size() - i - 1);
}
}
// Check rvalue forwarding range
{
std::vector<S> v(1000, S{});
for(int i = 0; (std::size_t)i < v.size(); ++i)
{
v[i].i = (int)v.size() - i - 1;
v[i].j = i;
}
CHECK(ranges::stable_sort(ranges::views::all(v), std::less<int>{}, &S::i) == v.end());
for(int i = 0; (std::size_t)i < v.size(); ++i)
{
CHECK(v[i].i == i);
CHECK((std::size_t)v[i].j == v.size() - i - 1);
}
}
#endif // Avoid #890
return ::test_result();
}
|
