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
|
/*
* tests/include/rangecount.h
*
* Standardized unit tests for range queries against supporting
* shard types
*
* Copyright (C) 2023 Douglas Rumbaugh <drumbaugh@psu.edu>
*
* Distributed under the Modified BSD License.
*
* WARNING: This file must be included in the main unit test set
* after the definition of an appropriate Shard and Rec
* type. In particular, Rec needs to implement the key-value
* pair interface and Shard needs to support lower_bound.
* For other types of record and shard, you'll need to
* use a different set of unit tests.
*/
#pragma once
/*
* Uncomment these lines temporarily to remove errors in this file
* temporarily for development purposes. They should be removed prior
* to building, to ensure no duplicate definitions. These includes/defines
* should be included in the source file that includes this one, above the
* include statement.
*/
//#include "shard/ISAMTree.h"
//#include "query/rangecount.h"
//#include "testing.h"
//#include <check.h>
//using namespace de;
//typedef ISAMTree<Rec> Shard;
START_TEST(t_range_count)
{
auto buffer = create_sequential_mbuffer<Rec>(100, 1000);
auto shard = Shard(buffer->get_buffer_view());
rc::Parms<Rec> parms;
parms.lower_bound = 300;
parms.upper_bound = 500;
auto state = rc::Query<Rec, Shard>::get_query_state(&shard, &parms);
auto result = rc::Query<Rec, Shard>::query(&shard, state, &parms);
rc::Query<Rec, Shard>::delete_query_state(state);
ck_assert_int_eq(result.size(), 1);
ck_assert_int_eq(result[0].rec.key, parms.upper_bound - parms.lower_bound + 1);
delete buffer;
}
END_TEST
START_TEST(t_buffer_range_count)
{
auto buffer = create_sequential_mbuffer<Rec>(100, 1000);
rc::Parms<Rec> parms;
parms.lower_bound = 300;
parms.upper_bound = 500;
{
auto view = buffer->get_buffer_view();
auto state = rc::Query<Rec, Shard>::get_buffer_query_state(&view, &parms);
auto result = rc::Query<Rec, Shard>::buffer_query(state, &parms);
rc::Query<Rec, Shard>::delete_buffer_query_state(state);
ck_assert_int_eq(result.size(), 1);
ck_assert_int_eq(result[0].rec.key, parms.upper_bound - parms.lower_bound + 1);
}
delete buffer;
}
END_TEST
START_TEST(t_range_count_merge)
{
auto buffer1 = create_sequential_mbuffer<Rec>(100, 200);
auto buffer2 = create_sequential_mbuffer<Rec>(400, 1000);
auto shard1 = Shard(buffer1->get_buffer_view());
auto shard2 = Shard(buffer2->get_buffer_view());
rc::Parms<Rec> parms;
parms.lower_bound = 150;
parms.upper_bound = 500;
size_t result_size = parms.upper_bound - parms.lower_bound + 1 - 200;
auto state1 = rc::Query<Rec, Shard>::get_query_state(&shard1, &parms);
auto state2 = rc::Query<Rec, Shard>::get_query_state(&shard2, &parms);
std::vector<std::vector<de::Wrapped<Rec>>> results(2);
results[0] = rc::Query<Rec, Shard>::query(&shard1, state1, &parms);
results[1] = rc::Query<Rec, Shard>::query(&shard2, state2, &parms);
rc::Query<Rec, Shard>::delete_query_state(state1);
rc::Query<Rec, Shard>::delete_query_state(state2);
ck_assert_int_eq(results[0].size(), 1);
ck_assert_int_eq(results[1].size(), 1);
auto result = rc::Query<Rec, Shard>::merge(results, nullptr);
ck_assert_int_eq(result[0].key, result_size);
delete buffer1;
delete buffer2;
}
END_TEST
START_TEST(t_lower_bound)
{
auto buffer1 = create_sequential_mbuffer<Rec>(100, 200);
auto buffer2 = create_sequential_mbuffer<Rec>(400, 1000);
auto shard1 = new Shard(buffer1->get_buffer_view());
auto shard2 = new Shard(buffer2->get_buffer_view());
std::vector<Shard*> shards = {shard1, shard2};
auto merged = Shard(shards);
for (size_t i=100; i<1000; i++) {
Rec r;
r.key = i;
r.value = i;
auto idx = merged.get_lower_bound(i);
assert(idx < merged.get_record_count());
auto res = merged.get_record_at(idx);
if (i >=200 && i <400) {
ck_assert_int_lt(res->rec.key, i);
} else {
ck_assert_int_eq(res->rec.key, i);
}
}
delete buffer1;
delete buffer2;
delete shard1;
delete shard2;
}
END_TEST
static void inject_rangecount_tests(Suite *suite) {
TCase *range_count = tcase_create("Range Query Testing");
tcase_add_test(range_count, t_range_count);
tcase_add_test(range_count, t_buffer_range_count);
tcase_add_test(range_count, t_range_count_merge);
suite_add_tcase(suite, range_count);
}
|