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
|
#include "sdsl/sorted_int_stack.hpp"
#include "sdsl/util.hpp"
#include "gtest/gtest.h"
#include <string>
#include <random>
namespace
{
std::string temp_dir;
// The fixture for testing class sorted_int_stack.
class sorted_stack_test : public ::testing::Test
{
protected:
sorted_stack_test() {}
virtual ~sorted_stack_test() {}
virtual void SetUp() {}
virtual void TearDown() {}
};
void compare_stacks(std::stack<uint64_t>& exp, sdsl::sorted_int_stack& sis)
{
ASSERT_EQ(exp.size(), sis.size());
std::stack<uint64_t> tmp;
while (!exp.empty()) {
ASSERT_EQ(exp.top(), sis.top());
tmp.push(exp.top());
exp.pop();
sis.pop();
}
ASSERT_EQ(exp.size(), sis.size());
// Restore stacks
while (!tmp.empty()) {
exp.push(tmp.top());
sis.push(tmp.top());
tmp.pop();
}
}
//! Test Constructors
TEST_F(sorted_stack_test, constructors)
{
static_assert(std::is_copy_constructible<sdsl::sorted_int_stack>::value, "Type is not copy constructible");
static_assert(std::is_move_constructible<sdsl::sorted_int_stack>::value, "Type is not move constructible");
static_assert(std::is_copy_assignable<sdsl::sorted_int_stack>::value, "Type is not copy assignable");
static_assert(std::is_move_assignable<sdsl::sorted_int_stack>::value, "Type is not move assignable");
std::stack<uint64_t> exp;
sdsl::sorted_int_stack sis1(100000+10);
{
std::mt19937_64 rng;
std::uniform_int_distribution<uint64_t> distribution(0, 10);
auto dice = bind(distribution, rng);
for (uint64_t k=0; k<100000; ++k) {
uint64_t value = k+dice();
if (exp.empty() or exp.top() < value) {
exp.push(value);
sis1.push(value);
}
}
}
// Copy-constructor
sdsl::sorted_int_stack sis2(sis1);
compare_stacks(exp, sis2);
// Move-constructor
sdsl::sorted_int_stack sis3(std::move(sis2));
compare_stacks(exp, sis3);
// ASSERT_EQ((uint64_t)0, sis2.size());
// Copy-Assign
sdsl::sorted_int_stack sis4(0);
sis4 = sis3;
compare_stacks(exp, sis4);
// Move-Assign
sdsl::sorted_int_stack sis5(0);
sis5 = std::move(sis4);
compare_stacks(exp, sis5);
// ASSERT_EQ((uint64_t)0, sis4.size());
}
//! Test Operations push, top and pop
TEST_F(sorted_stack_test, push_top_and_pop)
{
for (uint64_t i=0; i<20; ++i) {
std::mt19937_64 rng(i);
std::uniform_int_distribution<uint64_t> distribution(0, i*i);
auto dice = bind(distribution, rng);
std::stack<uint64_t> exp;
sdsl::sorted_int_stack sis(900000+i*i);
ASSERT_TRUE(sis.empty());
for (uint64_t k=0; k<1000000; ++k) {
ASSERT_EQ(exp.size(), sis.size());
uint64_t value = k+dice();
if (exp.empty()) {
exp.push(value);
sis.push(value);
} else {
ASSERT_EQ(exp.top(), sis.top());
if (exp.top() >= value) {
exp.pop();
sis.pop();
} else {
exp.push(value);
sis.push(value);
}
}
}
}
}
//! Test Serialize and Load
TEST_F(sorted_stack_test, serialize_and_load)
{
std::string file_name = temp_dir+"/sorted_int_stack";
std::stack<uint64_t> exp;
{
std::mt19937_64 rng;
std::uniform_int_distribution<uint64_t> distribution(0, 10);
auto dice = bind(distribution, rng);
sdsl::sorted_int_stack sis(1000000+10);
for (uint64_t k=0; k<1000000; ++k) {
uint64_t value = k+dice();
if (exp.empty() or exp.top() < value) {
exp.push(value);
sis.push(value);
}
}
sdsl::store_to_file(sis, file_name);
}
{
sdsl::sorted_int_stack sis(0);
sdsl::load_from_file(sis, file_name);
compare_stacks(exp, sis);
}
sdsl::remove(file_name);
}
#if SDSL_HAS_CEREAL
template <typename in_archive_t, typename out_archive_t>
void do_serialisation(sdsl::sorted_int_stack const & l, std::string const & temp_file)
{
{
std::ofstream os{temp_file, std::ios::binary};
out_archive_t oarchive{os};
oarchive(l);
}
{
sdsl::sorted_int_stack in_l(1000000+10);
std::ifstream is{temp_file, std::ios::binary};
in_archive_t iarchive{is};
iarchive(in_l);
EXPECT_EQ(l, in_l);
}
}
TEST_F(sorted_stack_test, cereal)
{
if (temp_dir != "@/")
{
std::string file_name = temp_dir+"/sorted_int_stack";
sdsl::sorted_int_stack sis(1000000+10);
std::stack<uint64_t> exp;
{
std::mt19937_64 rng;
std::uniform_int_distribution<uint64_t> distribution(0, 10);
auto dice = bind(distribution, rng);
for (uint64_t k=0; k<1000000; ++k) {
uint64_t value = k+dice();
if (exp.empty() or exp.top() < value) {
exp.push(value);
sis.push(value);
}
}
sdsl::store_to_file(sis, file_name);
}
do_serialisation<cereal::BinaryInputArchive, cereal::BinaryOutputArchive> (sis, file_name);
do_serialisation<cereal::PortableBinaryInputArchive, cereal::PortableBinaryOutputArchive>(sis, file_name);
do_serialisation<cereal::JSONInputArchive, cereal::JSONOutputArchive> (sis, file_name);
do_serialisation<cereal::XMLInputArchive, cereal::XMLOutputArchive> (sis, file_name);
sdsl::remove(file_name);
}
}
#endif // SDSL_HAS_CEREAL
} // namespace
int main(int argc, char** argv)
{
::testing::InitGoogleTest(&argc, argv);
if (argc < 2) {
// LCOV_EXCL_START
std::cout << "Usage: " << argv[0] << " tmp_dir" << std::endl;
return 1;
// LCOV_EXCL_STOP
}
temp_dir = argv[1];
return RUN_ALL_TESTS();
}
|
