-
Notifications
You must be signed in to change notification settings - Fork 1
/
sorttest.cpp
492 lines (446 loc) · 14 KB
/
sorttest.cpp
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
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
// filename: sorttest.cpp
// author: baobaobear
// create date: 2019-09-20
#ifdef _MSC_VER
#define _CRT_SECURE_NO_WARNINGS
#endif
#ifndef TEST_TYPE_SIMPLE
#define TEST_TYPE_SIMPLE 1 // 0 TestClass; 1 int; 2 double;
#define CONSOLE_OUTPUT 1
#else
#define CONSOLE_OUTPUT 0
#endif
#include "sortlib.hpp"
#include "sorttest.hpp"
#include <vector>
#include <map>
#include <functional>
#include <string>
#include <cstdio>
typedef int(*gen_data_func_t)(int n, int len);
typedef void(*arrar_function_t)(sort_element_t arr[], size_t n);
#ifdef BAO_SORT_LIB_STD11
#include <chrono>
typedef std::chrono::time_point<std::chrono::system_clock> time_point;
time_point get_time()
{
return std::chrono::system_clock::now();
}
int64_t get_time_diff(time_point from, time_point to)
{
return (int64_t)std::chrono::duration_cast<std::chrono::milliseconds>(to - from).count();
}
#else
typedef double time_point;
#ifdef _WIN32
#include <time.h>
#else
#include <sys/time.h>
#endif
time_point get_time()
{
#ifdef _WIN32
return clock();
#else
struct timeval tv;
gettimeofday(&tv, NULL);
return tv.tv_sec * 1000 + tv.tv_usec / 1000;
#endif
}
int32_t get_time_diff(time_point from, time_point to)
{
return (int32_t)(to - from);
}
#endif
struct algo_score
{
int score;
int index;
std::string name;
algo_score(int s = 0, int i = 0, std::string n = "")
: score(s), index(i), name(n)
{
}
bool operator<(const algo_score &s) const
{
return score < s.score;
}
};
static void data_shuffle_func(sort_element_t arr[], size_t n)
{
baobao::random_shuffle(arr, arr + n);
}
static void data_shuffle_shellsort(sort_element_t arr[], size_t n)
{
baobao::random_shuffle(arr, arr + n);
sort_element_t *beg = arr, *end = arr + n;
size_t incre = 1;
while (incre < (size_t)(end - beg) / 3)
incre = incre * 3 + 1; // A003462, Pratt, 1971, Knuth, 1973
for (; incre >= 10; incre /= 3)
{
sort_element_t *bound = beg + incre;
for (sort_element_t *i = bound; i < end; ++i)
{
sort_element_t *p = i;
sort_element_t val = *i;
for (; p >= bound && val < *(p - incre); p -= incre)
*p = *(p - incre);
*p = val;
}
}
}
static void data_shuffle_heapsort(sort_element_t arr[], size_t n)
{
baobao::random_shuffle(arr, arr + n);
std::make_heap(arr, arr + n, baobao::less_rev<sort_element_t>());
std::make_heap(arr, arr + n / 2, baobao::less_rev<sort_element_t>());
}
static int data_1(int n, int len)
{
(void)n;
(void)len;
return 1;
}
static int data_xor_1(int n, int len)
{
(void)len;
return n ^ 1;
}
static int data_rev_xor_1(int n, int len)
{
(void)len;
return (1000000000 - n) ^ 1;
}
static int data_n(int n, int len)
{
(void)len;
return n;
}
static int data_half_equal(int n, int len)
{
return (int)(n % (len / 2));
}
static int data_mod_32(int n, int len)
{
(void)len;
return n % 32;
}
static int data_xor_31(int n, int len)
{
(void)len;
return n ^ 31;
}
static void init_gen_data_fun_map(
std::map<int, gen_data_func_t> &gen_data_fun_map,
std::map<int, arrar_function_t> &gen_data_shuffle,
std::map<int, int>& split_size_map
)
{
gen_data_fun_map[1] = data_1;
gen_data_fun_map[2] = data_xor_1;
gen_data_fun_map[3] = data_rev_xor_1;
gen_data_fun_map[4] = data_n;
gen_data_shuffle[4] = data_shuffle_func;
gen_data_fun_map[5] = data_half_equal;
gen_data_shuffle[5] = data_shuffle_func;
gen_data_fun_map[6] = data_mod_32;
gen_data_shuffle[6] = data_shuffle_func;
gen_data_fun_map[7] = data_mod_32;
gen_data_fun_map[8] = data_xor_31;
gen_data_fun_map[9] = data_n;
gen_data_shuffle[9] = data_shuffle_shellsort;
gen_data_fun_map[10] = data_n;
gen_data_shuffle[10] = data_shuffle_heapsort;
gen_data_fun_map[11] = data_n;
gen_data_shuffle[11] = data_shuffle_func;
split_size_map[11] = 260;
}
void init_test_func_map(std::map<std::string, arrar_function_t> &test_func_map)
{
// Baobaobear's function
{
//test_func_map["bao_insert"] = baobao_warp::baobao_insert_sort;
test_func_map["bao_heap"] = baobao_warp::baobao_heap_sort;
test_func_map["bao_shell"] = baobao_warp::baobao_shell_sort;
test_func_map["bao_merge"] = baobao_warp::baobao_merge_sort;
test_func_map["bao_mer_buf"] = baobao_warp::baobao_merge_sort_buffer;
test_func_map["bao_mer_in"] = baobao_warp::baobao_merge_sort_in_place;
test_func_map["bao_qsort"] = baobao_warp::baobao_quick_sort;
test_func_map["bao_indir"] = baobao_warp::baobao_indirect_qsort;
test_func_map["bao_tim"] = baobao_warp::baobao_tim_sort;
test_func_map["bao_tim_buf"] = baobao_warp::baobao_tim_sort_buffer;
#if TEST_TYPE_SIMPLE < 2
test_func_map["bao_radix_in"] = baobao_warp::baobao_radix_sort_in_place;
#endif
}
// https://github.com/Mrrl/GrailSort
{
//test_func_map["grail_in"] = baobao_warp::grail_sort_in_place;
//test_func_map["grail_buf"] = baobao_warp::grail_sort_buf;
test_func_map["grail_sort"] = baobao_warp::grail_sort_dynbuf;
}
// https://github.com/BonzaiThePenguin/WikiSort
{
test_func_map["wiki_sort"] = baobao_warp::wiki_sort;
}
// std function
{
#ifdef BAOBAO_UNIX_STDLIB_SORT
test_func_map["unix_heap"] = stdsort::c_heap_sort;
test_func_map["unix_merge"] = stdsort::c_merge_sort;
#endif
test_func_map["std::heap"] = stdsort::std_heap_sort;
test_func_map["std::stable"] = stdsort::std_stable_sort;
test_func_map["std_qsort"] = stdsort::c_quick_sort;
test_func_map["std::sort"] = stdsort::std_sort;
}
}
int main(void)
{
time_point t;
std::map<int, gen_data_func_t> gen_data_fun_map;
std::map<int, arrar_function_t> gen_data_shuffle;
std::map<std::string, arrar_function_t> test_func_map;
std::map<int, int> split_size_map;
const size_t out_bound_check_size = 128;
const int out_bound_check_head_value = 0xf0f0f0f;
const int out_bound_check_tail_value = -0xf0f0f0f;
init_gen_data_fun_map(gen_data_fun_map, gen_data_shuffle, split_size_map);
init_test_func_map(test_func_map);
int base_size = 1000;
if (TEST_TYPE_SIMPLE)
{
base_size += base_size / 2;
}
int arr_size = base_size * base_size * 2;
std::vector<sort_element_t> arr(arr_size + out_bound_check_size * 2);
baobao::util::rand_seed((uint32_t)time(NULL));
#if CONSOLE_OUTPUT == 1
printf("Begin %d\n", arr_size);
printf(" -|");
for (std::map<std::string, arrar_function_t>::iterator it = test_func_map.begin();
it != test_func_map.end();
++it)
{
printf("%12s|", it->first.c_str());
}
puts("");
printf("-:|");
for (std::map<std::string, arrar_function_t>::iterator it = test_func_map.begin();
it != test_func_map.end();
++it)
{
printf("%12s|", "-----------:");
}
puts("");
#endif
std::map<std::string, std::map<int, int> > result_map;
std::map<std::string, int > unstable_map;
for (std::map<int, gen_data_func_t>::iterator it_test = gen_data_fun_map.begin();
it_test != gen_data_fun_map.end();
++it_test)
{
if (CONSOLE_OUTPUT)
printf("%2d|", it_test->first);
for (size_t i = 0; i < out_bound_check_size; ++i)
{
arr[i] = out_bound_check_head_value;
arr[arr.size() - out_bound_check_size + i] = out_bound_check_tail_value;
}
for (int i = 0; i < (int)arr_size; ++i)
{
arr[i + out_bound_check_size] = it_test->second(i, arr_size);
}
if (gen_data_shuffle.find(it_test->first) != gen_data_shuffle.end())
{
gen_data_shuffle[it_test->first](&*(arr.begin() + out_bound_check_size), arr_size);
}
#if TEST_TYPE_SIMPLE == 0
for (int i = 0; i < (int)arr_size; ++i)
{
arr[i + out_bound_check_size].index = i;
}
#endif
for (std::map<std::string, arrar_function_t>::iterator it = test_func_map.begin();
it != test_func_map.end();
++it)
{
std::vector<sort_element_t> arr_c = arr;
int res_ms = 0;
bool correct = true;
if (split_size_map.find(it_test->first) != split_size_map.end())
{
int split_cnt = split_size_map[it_test->first];
int last_size = arr_size - split_cnt;
std::vector<sort_element_t> arr_c2 = arr;
t = get_time();
for (int i = 0; i < last_size; i += split_cnt)
{
it->second(&*arr_c.begin() + out_bound_check_size + i, split_cnt);
}
for (int i = 0; i < last_size; i += split_cnt)
{
it->second(&*arr_c2.begin() + out_bound_check_size + i, split_cnt);
}
res_ms = (int)get_time_diff(t, get_time());
//for (size_t i = 0; i < arr_size; i++) // avoid optimize arr_c2
//{
// if (arr_c[i] < arr_c2[i] || arr_c2[i] < arr_c[i])
// {
// correct = false;
// }
//}
}
else
{
t = get_time();
it->second(&*(arr_c.begin() + out_bound_check_size), arr_size);
res_ms = (int)get_time_diff(t, get_time());
}
if (CONSOLE_OUTPUT)
printf("%12d|", (int)res_ms);
if (split_size_map.find(it_test->first) == split_size_map.end())
{
for (size_t i = 0; i < out_bound_check_size; ++i)
{
if (!(arr[i] == out_bound_check_head_value))
{
correct = false;
break;
}
if (!(arr[arr.size() - out_bound_check_size + i] == out_bound_check_tail_value))
{
correct = false;
break;
}
}
if (correct)
{
if (!baobao::check_sorted(arr_c.begin() + out_bound_check_size, arr_c.end() - out_bound_check_size, std::less<sort_element_t>()))
{
correct = false;
}
#if TEST_TYPE_SIMPLE == 0
else
{
if (!baobao::check_sorted_stable(arr_c.begin() + out_bound_check_size, arr_c.end() - out_bound_check_size, std::less<sort_element_t>()))
{
unstable_map[it->first] = 1;
}
}
#endif
}
}
if (correct)
{
result_map[it->first][it_test->first] = res_ms;
}
else
{
result_map[it->first][it_test->first] = -1;
}
fflush(stdout);
}
if (CONSOLE_OUTPUT)
printf("\n");
}
std::vector<std::string> index_name;
std::vector<algo_score> final_score;
for (std::map<std::string, arrar_function_t>::iterator it_test = test_func_map.begin();
it_test != test_func_map.end();
++it_test)
{
index_name.push_back(it_test->first);
final_score.push_back(algo_score(0, (int)index_name.size() - 1, it_test->first));
for (std::map<int, gen_data_func_t>::iterator it = gen_data_fun_map.begin();
it != gen_data_fun_map.end();
++it)
{
int v = result_map[it_test->first][it->first];
if (v >= 0)
{
final_score.back().score += v;
}
else if (v == -1)
{
final_score.back().score += 1000 * 1000;
}
}
}
#if TEST_TYPE_SIMPLE == 0
printf("\n%-12s||\n------------|---\n", "stable test");
for (std::map<std::string, arrar_function_t>::iterator it_test = test_func_map.begin();
it_test != test_func_map.end();
++it_test)
{
printf("%-12s|%s\n", it_test->first.c_str(), (unstable_map.find(it_test->first) != unstable_map.end() ? "no" : "yes"));
}
#endif
char test_title[16] = "";
if (TEST_TYPE_SIMPLE == 0)
{
sprintf(test_title, "TestClass %d", TEST_CLASS_SIZE);
}
else if (TEST_TYPE_SIMPLE == 1)
{
sprintf(test_title, "int");
}
else if (TEST_TYPE_SIMPLE == 2)
{
sprintf(test_title, "double");
}
else
{
}
printf("\n%-12s|", test_title);
for (std::map<int, gen_data_func_t>::iterator it = gen_data_fun_map.begin();
it != gen_data_fun_map.end();
++it)
{
printf(" %-3d|", it->first);
}
puts(" Avg |");
printf("------------|");
for (std::map<int, gen_data_func_t>::iterator it = gen_data_fun_map.begin();
it != gen_data_fun_map.end();
++it)
{
printf("%5s|", "----:");
}
puts("----:|");
std::sort(final_score.begin(), final_score.end());
for (std::vector<algo_score>::iterator it_test = final_score.begin();
it_test != final_score.end();
++it_test)
{
std::string name = it_test->name;
printf("%-12s|", name.c_str());
for (std::map<int, gen_data_func_t>::iterator it = gen_data_fun_map.begin();
it != gen_data_fun_map.end();
++it)
{
int v = result_map[name][it->first];
if (v >= 0)
{
printf("%5d|", v);
}
else if (v == -1)
{
printf("%5s|", "Wrong");
}
else if (v == -2)
{
printf("%5s|", "Error");
}
else if (v == -3)
{
printf("%5s|", "Time");
}
}
printf("%5d|\n", (int)(it_test->score / gen_data_fun_map.size()));
}
printf("\n%d END\n", arr_size);
fflush(stdout);
return 0;
}