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
|
/*
* tests/vptree_tests.cpp
*
* Unit tests for VPTree (knn queries)
*
* Copyright (C) 2023 Douglas Rumbaugh <drumbaugh@psu.edu>
*
* All rights reserved. Published under the Modified BSD License.
*
*/
#include "shard/VPTree.h"
#include "testing.h"
#include <check.h>
using namespace de;
typedef VPTree<PRec> Shard;
START_TEST(t_mbuffer_init)
{
size_t n= 24;
auto buffer = new MutableBuffer<PRec>(n, n);
for (int64_t i=0; i<n; i++) {
buffer->append({i, i});
}
Shard* shard = new Shard(buffer);
ck_assert_uint_eq(shard->get_record_count(), n);
delete buffer;
delete shard;
}
START_TEST(t_wss_init)
{
size_t n = 512;
auto mbuffer1 = create_2d_mbuffer(n);
auto mbuffer2 = create_2d_mbuffer(n);
auto mbuffer3 = create_2d_mbuffer(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);
delete mbuffer1;
delete mbuffer2;
delete mbuffer3;
delete shard1;
delete shard2;
delete shard3;
delete shard4;
}
START_TEST(t_point_lookup)
{
size_t n = 16;
auto buffer = create_2d_sequential_mbuffer(n);
auto wss = Shard(buffer);
for (size_t i=0; i<n; i++) {
PRec r;
auto rec = (buffer->get_data() + i);
r.x = rec->rec.x;
r.y = rec->rec.y;
auto result = wss.point_lookup(r);
ck_assert_ptr_nonnull(result);
ck_assert_int_eq(result->rec.x, r.x);
ck_assert_int_eq(result->rec.y, r.y);
}
delete buffer;
}
END_TEST
START_TEST(t_point_lookup_miss)
{
size_t n = 10000;
auto buffer = create_2d_sequential_mbuffer(n);
auto wss = Shard(buffer);
for (size_t i=n + 100; i<2*n; i++) {
PRec r;
r.x = i;
r.y = i;
auto result = wss.point_lookup(r);
ck_assert_ptr_null(result);
}
delete buffer;
}
Suite *unit_testing()
{
Suite *unit = suite_create("VPTree Shard Unit Testing");
TCase *create = tcase_create("de::VPTree constructor Testing");
tcase_add_test(create, t_mbuffer_init);
tcase_add_test(create, t_wss_init);
tcase_set_timeout(create, 100);
suite_add_tcase(unit, create);
TCase *lookup = tcase_create("de:VPTree:point_lookup Testing");
tcase_add_test(lookup, t_point_lookup);
//tcase_add_test(lookup, t_point_lookup_miss);
suite_add_tcase(unit, lookup);
/*
TCase *sampling = tcase_create("de:VPTree::VPTreeQuery Testing");
tcase_add_test(sampling, t_wss_query);
tcase_add_test(sampling, t_wss_query_merge);
tcase_add_test(sampling, t_wss_buffer_query_rejection);
tcase_add_test(sampling, t_wss_buffer_query_scan);
suite_add_tcase(unit, sampling);
*/
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;
}
|