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
|
//----------------------------------------------------------------------------
/// @file test_flat_stable_sort.cpp
/// @brief test program of the flat_stable_sort algorithm
///
/// @author Copyright (c) 2017 Francisco José Tapia (fjtapia@gmail.com )\n
/// Distributed under the Boost Software License, Version 1.0.\n
/// ( See accompanying file LICENSE_1_0.txt or copy at
/// http://www.boost.org/LICENSE_1_0.txt )
/// @version 0.1
///
/// @remarks
//-----------------------------------------------------------------------------
#include <algorithm>
#include <iostream>
#include <random>
#include <vector>
#include <boost/sort/flat_stable_sort/flat_stable_sort.hpp>
#include <boost/test/included/test_exec_monitor.hpp>
#include <boost/test/test_tools.hpp>
using namespace boost::sort;
void test1 ( );
void test2 ( );
void test3 ( );
//---------------- stability test -----------------------------------
struct xk
{
unsigned tail : 4;
unsigned num : 28;
xk ( uint32_t n =0 , uint32_t t =0): tail (t), num(n){};
bool operator< (xk A) const { return (num < A.num); };
};
void test1 ( )
{
typedef typename std::vector< xk >::iterator iter_t;
typedef std::less< xk > compare_t;
std::mt19937_64 my_rand (0);
const uint32_t NMAX = 100000;
std::vector< xk > V1, V2;
V1.reserve (NMAX);
for (uint32_t i = 0; i < 8; ++i) {
for (uint32_t k = 0; k < NMAX; ++k) {
uint32_t NM = my_rand ( );
xk G;
G.num = NM >> 3;
G.tail = i;
V1.push_back (G);
};
};
//check sort 0 elements
flat_stable_sort< iter_t, compare_t > (V1.begin ( ), V1.begin ( ), compare_t ( ));
V2 = V1;
flat_stable_sort< iter_t, compare_t > (V1.begin ( ), V1.end ( ), compare_t ( ));
std::stable_sort (V2.begin ( ), V2.end ( ));
BOOST_CHECK (V1.size ( ) == V2.size ( ));
for (uint32_t i = 0; i < V1.size ( ); ++i) {
BOOST_CHECK (V1[ i ].num == V2[ i ].num &&
V1[ i ].tail == V2[ i ].tail);
};
};
void test2 (void)
{
typedef std::less< uint64_t > compare_t;
const uint32_t NElem = 100000;
std::vector< uint64_t > V1,V2;
std::mt19937_64 my_rand (0);
compare_t comp;
// ------------------------ random elements -------------------------------
for (uint32_t i = 0; i < NElem; ++i) V1.push_back (my_rand ( ) % NElem);
V2 = V1;
flat_stable_sort (V1.begin ( ), V1.end ( ), comp);
std::stable_sort (V2.begin ( ), V2.end ( ), comp);
for (unsigned i = 0; i < NElem; i++) {
BOOST_CHECK (V2[ i ] == V1[ i ]);
};
// --------------------------- sorted elements ----------------------------
V1.clear ( );
for (uint32_t i = 0; i < NElem; ++i) V1.push_back (i);
flat_stable_sort (V1.begin ( ), V1.end ( ), comp);
for (unsigned i = 1; i < NElem; i++) {
BOOST_CHECK (V1[ i - 1 ] <= V1[ i ]);
};
//-------------------------- reverse sorted elements ----------------------
V1.clear ( );
for (uint32_t i = 0; i < NElem; ++i) V1.push_back (NElem - i);
flat_stable_sort (V1.begin ( ), V1.end ( ), comp);
for (unsigned i = 1; i < NElem; i++) {
BOOST_CHECK (V1[ i - 1 ] <= V1[ i ]);
};
//---------------------------- equal elements ----------------------------
V1.clear ( );
for (uint32_t i = 0; i < NElem; ++i) V1.push_back (1000);
flat_stable_sort (V1.begin ( ), V1.end ( ), comp);
for (unsigned i = 1; i < NElem; i++) {
BOOST_CHECK (V1[ i - 1 ] == V1[ i ]);
};
};
void test3 (void)
{
typedef typename std::vector<xk>::iterator iter_t;
typedef std::less<xk> compare_t;
std::mt19937 my_rand (0);
std::vector<xk> V ;
const uint32_t NELEM = 100000;
V.reserve(NELEM * 10);
for (uint32_t k =0 ; k < 10 ; ++k)
{ for ( uint32_t i =0 ; i < NELEM ; ++i)
{ V.emplace_back(i , k);
};
iter_t first = V.begin() + (k * NELEM);
iter_t last = first + NELEM ;
std::shuffle( first, last, my_rand);
};
flat_stable_sort( V.begin() , V.end(), compare_t());
for ( uint32_t i =0 ; i < ( NELEM * 10); ++i)
{ BOOST_CHECK ( V[i].num == (i / 10) && V[i].tail == (i %10) );
};
}
int test_main (int, char *[])
{
test1 ( );
test2 ( );
test3 ( );
return 0;
};
|
