-
Notifications
You must be signed in to change notification settings - Fork 3
/
csa_int_test.cpp
256 lines (232 loc) · 7.8 KB
/
csa_int_test.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
#include "sdsl/suffix_arrays.hpp"
#include "gtest/gtest.h"
#include <cstdlib>
#include <vector>
#include <string>
#include <algorithm>
namespace
{
using namespace sdsl;
using namespace std;
typedef int_vector<>::size_type size_type;
tMSS test_case_file_map;
string test_file;
uint8_t num_bytes;
string temp_file;
string temp_dir;
bool in_memory;
template<class T>
class csa_int_test : public ::testing::Test { };
using testing::Types;
typedef Types< csa_wt<wt_int<>, 32, 32, sa_order_sa_sampling<>, isa_sampling<>, int_alphabet<> >,
csa_sada<enc_vector<>, 32, 32, sa_order_sa_sampling<>, isa_sampling<>, int_alphabet<> >,
csa_bitcompressed<int_alphabet<> >,
csa_wt<wt_int<rrr_vector<63> >, 8, 8, sa_order_sa_sampling<>, isa_sampling<>, int_alphabet<> >,
csa_wt<wt_int<>, 16, 16, text_order_sa_sampling<>, text_order_isa_sampling_support<>, int_alphabet<> >,
csa_sada<enc_vector<>, 32, 32, text_order_sa_sampling<>, isa_sampling<>, int_alphabet<> >
> Implementations;
TYPED_TEST_CASE(csa_int_test, Implementations);
TYPED_TEST(csa_int_test, create_and_store)
{
static_assert(sdsl::util::is_regular<TypeParam>::value, "Type is not regular");
TypeParam csa;
cache_config config(false, temp_dir, util::basename(test_file));
construct(csa, test_file, config, num_bytes);
test_case_file_map = config.file_map;
ASSERT_TRUE(store_to_file(csa, temp_file));
}
//! Test access methods
TYPED_TEST(csa_int_test, sigma)
{
TypeParam csa;
ASSERT_TRUE(load_from_file(csa, temp_file));
int_vector<> text;
load_vector_from_file(text, test_file, num_bytes);
text.resize(text.size()+1);
text[text.size()-1] = 0; // add 0-character at the end
size_type n = text.size();
ASSERT_EQ(n, csa.size());
std::set<uint64_t> occur;
size_type sigma = 0;
for (size_type j=0; j<n; ++j) {
if (occur.end() == occur.find(text[j])) {
occur.insert(text[j]);
++sigma;
}
}
ASSERT_EQ(sigma, csa.sigma);
}
//! Test suffix array access methods
TYPED_TEST(csa_int_test, sa_access)
{
TypeParam csa;
ASSERT_TRUE(load_from_file(csa, temp_file));
int_vector<> sa;
load_from_file(sa, test_case_file_map[conf::KEY_SA]);
size_type n = sa.size();
ASSERT_EQ(n, csa.size());
for (size_type j=0; j<n; ++j) {
ASSERT_EQ(sa[j], csa[j])<<" j="<<j;
}
}
//! Test inverse suffix access methods
TYPED_TEST(csa_int_test, isa_access)
{
TypeParam csa;
ASSERT_TRUE(load_from_file(csa, temp_file));
int_vector<> isa;
size_type n = 0;
{
int_vector<> sa;
load_from_file(sa, test_case_file_map[conf::KEY_SA]);
n = sa.size();
ASSERT_EQ(n, csa.size());
isa = sa;
for (size_type j=0; j<n; ++j) {
isa[sa[j]] = j; // calculate inverse suffix array
}
}
for (size_type j=0; j<n; ++j) {
ASSERT_EQ(isa[j], csa.isa[j])<<" j="<<j;
}
}
//! Test Burrows-Wheeler access methods
TYPED_TEST(csa_int_test, bwt_access)
{
if (test_case_file_map.end() != test_case_file_map.find(conf::KEY_BWT_INT)) {
TypeParam csa;
ASSERT_TRUE(load_from_file(csa, temp_file));
int_vector<> bwt;
load_from_file(bwt, test_case_file_map[conf::KEY_BWT_INT]);
size_type n = bwt.size();
ASSERT_EQ(n, csa.size());
for (size_type j=0; j<n; ++j) {
ASSERT_EQ(bwt[j], csa.bwt[j])<<" j="<<j;
}
}
}
TYPED_TEST(csa_int_test, f_access)
{
if (test_case_file_map.end() != test_case_file_map.find(conf::KEY_TEXT_INT)) {
TypeParam csa;
ASSERT_TRUE(load_from_file(csa, temp_file));
int_vector<> text;
load_from_file(text, test_case_file_map[conf::KEY_TEXT_INT]);
std::sort(begin(text),end(text));
size_type n = text.size();
ASSERT_EQ(n, csa.size());
for (size_type j=0; j<n; j+=200) {
ASSERT_EQ(text[j], csa.F[j])<<" j="<<j;
}
}
}
//! Test text access methods
TYPED_TEST(csa_int_test, text_access)
{
if (test_case_file_map.end() != test_case_file_map.find(conf::KEY_TEXT_INT)) {
TypeParam csa;
ASSERT_TRUE(load_from_file(csa, temp_file));
int_vector<> text;
load_from_file(text, test_case_file_map[conf::KEY_TEXT_INT]);
size_type n = text.size();
ASSERT_EQ(n, csa.size());
for (size_type j=0; j<n; ++j) {
ASSERT_EQ(text[j], csa.text[j])<<" j="<<j;
}
auto len = std::min(csa.size(),
std::max(csa.size()/10, (decltype(csa.size()))20));
auto ex_text = extract(csa, 0, len-1);
for (size_type j=0; j<len; ++j) {
ASSERT_EQ(text[j], ex_text[j])<<" j="<<j;
}
if (n > 0) {
auto c_out_of_range = (*std::max_element(text.begin(), text.end()))+1;
auto cnt = count(csa, {c_out_of_range});
ASSERT_EQ(0ULL, cnt) << " c_out_of_range="<<c_out_of_range<<" text="<<csa.text;
}
}
}
//! Test Psi access methods
TYPED_TEST(csa_int_test, psi_access)
{
if (test_case_file_map.end() != test_case_file_map.find(conf::KEY_PSI)) {
TypeParam csa;
ASSERT_TRUE(load_from_file(csa, temp_file));
int_vector<> psi;
load_from_file(psi, test_case_file_map[conf::KEY_PSI]);
size_type n = psi.size();
ASSERT_EQ(n, csa.size());
for (size_type j=0; j<n; ++j) {
ASSERT_EQ(psi[j], csa.psi[j])<<" j="<<j;
}
}
}
//! Test if Psi[LF[i]]=i
TYPED_TEST(csa_int_test, psi_lf_access)
{
TypeParam csa;
ASSERT_TRUE(load_from_file(csa, temp_file));
for (size_type j=0; j<csa.size(); ++j) {
size_type lf = csa.lf[j];
ASSERT_TRUE(lf < csa.size());
ASSERT_EQ(j, csa.psi[lf])<<" j="<<j;
}
}
//! Test access after swap
TYPED_TEST(csa_int_test, swap_test)
{
TypeParam csa1;
ASSERT_TRUE(load_from_file(csa1, temp_file));
TypeParam csa2;
csa1.swap(csa2);
int_vector<> sa;
load_from_file(sa, test_case_file_map[conf::KEY_SA]);
size_type n = sa.size();
ASSERT_EQ(n, csa2.size());
for (size_type j=0; j<n; ++j) {
ASSERT_EQ((typename TypeParam::value_type)sa[j], csa2[j]);
}
}
TYPED_TEST(csa_int_test, DeleteTest)
{
sdsl::remove(temp_file);
util::delete_all_files(test_case_file_map);
}
} // namespace
int main(int argc, char** argv)
{
::testing::InitGoogleTest(&argc, argv);
if (argc < 4) {
// LCOV_EXCL_START
cout << "Usage: " << argv[0] << " test_file num_bytes temp_file tmp_dir" << endl;
cout << " (1) Generates a CSA out of test_file; stores it in temp_file." << endl;
cout << " Temporary files (SA/BWT/TEXT) are stored in tmp_dir." << endl;
cout << " num_bytes specifies who many bytes make a symbol in the"<< endl;
cout << " input sequence" << endl;
cout << " If `in-memory` is specified, the in-memory construction is tested." << endl;
cout << " (2) Performs tests." << endl;
cout << " (3) Deletes temp_file." << endl;
return 1;
// LCOV_EXCL_STOP
}
test_file = argv[1];
num_bytes = atoi(argv[2]);
temp_file = argv[3];
temp_dir = argv[4];
in_memory = argc > 5;
if (in_memory) {
temp_dir = "@";
int_vector<> data;
load_vector_from_file(data, test_file, num_bytes);
test_file = ram_file_name(test_file);
switch (num_bytes) {
case 0: store_to_file(data, test_file); break;
case 1: store_to_plain_array<uint8_t>(data, test_file); break;
case 2: store_to_plain_array<uint16_t>(data, test_file); break;
case 3: store_to_plain_array<uint32_t>(data, test_file); break;
case 4: store_to_plain_array<uint64_t>(data, test_file); break;
}
temp_file = ram_file_name(temp_file);
}
return RUN_ALL_TESTS();
}