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
|
/*
* tests/irs_tests.cpp
*
* Unit tests for TrieSpline (Augmented B+Tree) shard
*
* Copyright (C) 2023 Douglas Rumbaugh <drumbaugh@psu.edu>
* Dong Xie <dongx@psu.edu>
*
* All rights reserved. Published under the Modified BSD License.
*
*/
#include "shard/TrieSpline.h"
#include "testing.h"
#include <check.h>
using namespace de;
typedef TrieSpline<Rec> Shard;
START_TEST(t_mbuffer_init)
{
auto buffer = new MutableBuffer<Rec>(1024, true, 1024);
for (uint64_t i = 512; i > 0; i--) {
uint32_t v = i;
buffer->append({i,v, 1});
}
for (uint64_t i = 1; i <= 256; ++i) {
uint32_t v = i;
buffer->append({i, v, 1}, true);
}
for (uint64_t i = 257; i <= 512; ++i) {
uint32_t v = i + 1;
buffer->append({i, v, 1});
}
Shard* shard = new Shard(buffer);
ck_assert_uint_eq(shard->get_record_count(), 512);
delete buffer;
delete shard;
}
START_TEST(t_irs_init)
{
size_t n = 512;
auto mbuffer1 = create_test_mbuffer<Rec>(n);
auto mbuffer2 = create_test_mbuffer<Rec>(n);
auto mbuffer3 = create_test_mbuffer<Rec>(n);
auto shard1 = new Shard(mbuffer1);
auto shard2 = new Shard(mbuffer2);
auto shard3 = new Shard(mbuffer3);
Shard* shards[3] = {shard1, shard2, shard3};
auto shard4 = new Shard(shards, 3);
ck_assert_int_eq(shard4->get_record_count(), n * 3);
ck_assert_int_eq(shard4->get_tombstone_count(), 0);
size_t total_cnt = 0;
size_t shard1_idx = 0;
size_t shard2_idx = 0;
size_t shard3_idx = 0;
for (size_t i = 0; i < shard4->get_record_count(); ++i) {
auto rec1 = shard1->get_record_at(shard1_idx);
auto rec2 = shard2->get_record_at(shard2_idx);
auto rec3 = shard3->get_record_at(shard3_idx);
auto cur_rec = shard4->get_record_at(i);
if (shard1_idx < n && cur_rec->rec == rec1->rec) {
++shard1_idx;
} else if (shard2_idx < n && cur_rec->rec == rec2->rec) {
++shard2_idx;
} else if (shard3_idx < n && cur_rec->rec == rec3->rec) {
++shard3_idx;
} else {
assert(false);
}
}
delete mbuffer1;
delete mbuffer2;
delete mbuffer3;
delete shard1;
delete shard2;
delete shard3;
delete shard4;
}
START_TEST(t_point_lookup)
{
size_t n = 10000;
auto buffer = create_double_seq_mbuffer<Rec>(n, false);
auto shard = Shard(buffer);
for (size_t i=0; i<n; i++) {
Rec r;
auto rec = (buffer->get_data() + i);
r.key = rec->rec.key;
r.value = rec->rec.value;
auto result = shard.point_lookup(r);
ck_assert_ptr_nonnull(result);
ck_assert_int_eq(result->rec.key, r.key);
ck_assert_int_eq(result->rec.value, r.value);
}
delete buffer;
}
END_TEST
START_TEST(t_point_lookup_miss)
{
size_t n = 10000;
auto buffer = create_double_seq_mbuffer<Rec>(n, false);
auto isam = Shard(buffer);
for (size_t i=n + 100; i<2*n; i++) {
Rec r;
r.key = i;
r.value = i;
auto result = isam.point_lookup(r);
ck_assert_ptr_null(result);
}
delete buffer;
}
START_TEST(t_full_cancelation)
{
size_t n = 100;
auto buffer = create_double_seq_mbuffer<Rec>(n, false);
auto buffer_ts = create_double_seq_mbuffer<Rec>(n, true);
Shard* shard = new Shard(buffer);
Shard* shard_ts = new Shard(buffer_ts);
ck_assert_int_eq(shard->get_record_count(), n);
ck_assert_int_eq(shard->get_tombstone_count(), 0);
ck_assert_int_eq(shard_ts->get_record_count(), n);
ck_assert_int_eq(shard_ts->get_tombstone_count(), n);
Shard* shards[] = {shard, shard_ts};
Shard* merged = new Shard(shards, 2);
ck_assert_int_eq(merged->get_tombstone_count(), 0);
ck_assert_int_eq(merged->get_record_count(), 0);
delete buffer;
delete buffer_ts;
delete shard;
delete shard_ts;
delete merged;
}
END_TEST
Suite *unit_testing()
{
Suite *unit = suite_create("TrieSpline Shard Unit Testing");
TCase *create = tcase_create("de::TrieSpline constructor Testing");
tcase_add_test(create, t_mbuffer_init);
tcase_add_test(create, t_irs_init);
tcase_set_timeout(create, 100);
suite_add_tcase(unit, create);
TCase *tombstone = tcase_create("de:TrieSpline::tombstone cancellation Testing");
tcase_add_test(tombstone, t_full_cancelation);
suite_add_tcase(unit, tombstone);
TCase *lookup = tcase_create("de:TrieSpline:point_lookup Testing");
tcase_add_test(lookup, t_point_lookup);
tcase_add_test(lookup, t_point_lookup_miss);
suite_add_tcase(unit, lookup);
return unit;
}
int shard_unit_tests()
{
int failed = 0;
Suite *unit = unit_testing();
SRunner *unit_shardner = srunner_create(unit);
srunner_run_all(unit_shardner, CK_NORMAL);
failed = srunner_ntests_failed(unit_shardner);
srunner_free(unit_shardner);
return failed;
}
int main()
{
int unit_failed = shard_unit_tests();
return (unit_failed == 0) ? EXIT_SUCCESS : EXIT_FAILURE;
}
|