-
Notifications
You must be signed in to change notification settings - Fork 0
/
SATree_test.cpp
216 lines (192 loc) · 6.06 KB
/
SATree_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
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#include "Reader.h"
#include "SATree.h"
enum TestCaseStatus
{
PASS,
FAIL
};
struct TestCaseResult
{
std::string name;
TestCaseStatus status;
std::string err;
void display()
{
if (status == TestCaseStatus::PASS)
std::cout << "TestCase \"" << name << "\": PASSED" << std::endl;
else
std::cout << "TestCase \"" << name << "\": FAILED with " << err << std::endl;
}
};
TestCaseResult test_case3(const std::string & name)
{
Points input{{0, {-3, -3}}, {1, {-3, -4}}, {2, {-5, -3}}, {3, {-4, -4}}, {4, {-1, -1}}};
SATree tree(input);
auto res = tree.range_search({-1, {-6, -2}}, 2.0);
Point expected{2, {-5, -3}};
if (res && res.value() == expected)
{
return {name, TestCaseStatus::PASS, ""};
}
else if (!res)
return {name, TestCaseStatus::FAIL, "returned null"};
else
{
std::string err = "Expected: " + expected.to_string() + "; Got: " + res->to_string();
return {name, TestCaseStatus::FAIL, err};
}
}
TestCaseResult test_case4(const std::string & name)
{
Points input{{0, {-3, -3}}, {1, {-3, -4}}, {2, {-5, -3}}, {3, {-4, -4}}, {4, {-1, -1}}};
SATree tree(input);
auto res = tree.range_search({-1, {-6, -2}}, 1.0);
Point expected{2, {-5, -3}};
if (!res)
{
return {name, TestCaseStatus::PASS, ""};
}
else
{
std::string err = "Expected: " + expected.to_string() + "; Got: " + res->to_string();
return {name, TestCaseStatus::FAIL, err};
}
}
TestCaseResult test_case5(const std::string & name)
{
Points input{{0, {1, 1}}, {1, {3, 3}}, {2, {5, 3}}, {3, {3, 4}}, {4, {6, 4}},
{5, {-3, -3}}, {6, {-3, -4}}, {7, {-5, -3}}, {8, {-4, -4}}, {9, {-1, -1}}};
SATree tree(input);
auto res = tree.nearest_neighbour_search({-1, {-4, -5}}, 2);
kNNResult expected{{{6, {-3, -4}}, (float)std::sqrt(2.0)}, {{8, {-4, -4}}, 1.0}};
if (res.size() != 2)
{
std::string err = "Expected size: 2; Got: " + std::to_string(res.size());
return {name, TestCaseStatus::FAIL, err};
}
if (res != expected)
{
std::string err = "Expected: [";
for (auto i : expected)
err += i.to_string();
err += "]; Got: [";
for (auto i : res)
err += i.to_string();
err += "]";
return {name, TestCaseStatus::FAIL, err};
}
return {name, TestCaseStatus::PASS, ""};
}
TestCaseResult test_case6(const std::string & name)
{
Points input{{0, {1, 1}}, {1, {3, 3}}, {2, {5, 3}}, {3, {3, 4}}, {4, {6, 4}},
{5, {-3, -3}}, {6, {-3, -4}}, {7, {-5, -3}}, {8, {-4, -4}}, {9, {-1, -1}}};
SATree tree(input);
if (!tree.nearest_neighbour_search({-1, {-4, -5}}, 0).empty())
{
std::string err = "Expected empty result";
return {name, TestCaseStatus::FAIL, err};
}
return {name, TestCaseStatus::PASS, ""};
}
TestCaseResult test_case7(const std::string & name)
{
Points input{{0, {1, 1, 1}}, {1, {3, 3, 3}}, {2, {5, 3, 2}}, {3, {3, 4, 1}}, {4, {6, 4, 2}}};
SATree tree(input);
auto res = tree.nearest_neighbour_search({-1, {1, 1, 0}}, 1);
kNNResult expected{{{-1, {1, 1, 1}}, 1.0}};
if (res.size() != 1)
return {name, TestCaseStatus::FAIL, "Result does not have 1 element"};
if (res != expected)
{
std::string err = "Expected: [";
for (auto i : expected)
err += i.to_string();
err += "]; Got: [";
for (auto i : res)
err += i.to_string();
err += "]";
return {name, TestCaseStatus::FAIL, err};
}
return {name, TestCaseStatus::PASS, ""};
}
TestCaseResult e2e_test_case(const std::string & name, SATree & tree, Point query, std::set<int> gt)
{
auto res = tree.nearest_neighbour_search(query, 100);
if (res.empty())
{
std::string err = "Query result empty";
return {name, TestCaseStatus::FAIL, err};
}
else if (res.size() != 100)
{
std::string err = "Query result size expected 100 got" + std::to_string(res.size());
return {name, TestCaseStatus::FAIL, err};
}
for (auto r : res)
{
if (gt.find(r.p.node_id) == gt.end())
{
std::string err = "Point " + r.p.to_string() + " is not a ground truth";
return {name, TestCaseStatus::FAIL, err};
}
}
return {name, TestCaseStatus::PASS, ""};
}
void e2e_driver(const std::string & name)
{
// Read base vectors
char bvecs_filename[] = "dataset/siftsmall/siftsmall_base.fvecs";
FVecsReader reader{bvecs_filename};
Points base_vecs;
int counter{0};
while (!reader.eof())
{
float * v = reader.readvec();
std::vector<float> vf(v, v + reader.dimension());
base_vecs.push_back(Point{counter, vf});
counter++;
}
reader.close();
// Build SATree
SATree tree(base_vecs);
char qvecs_filename[] = "dataset/siftsmall/siftsmall_query.fvecs";
reader.open(qvecs_filename);
Points qvecs;
while (!reader.eof())
{
float * v = reader.readvec();
std::vector<float> vf(v, v + reader.dimension());
qvecs.push_back(Point{-1, vf});
}
char ivecs_filename[] = "dataset/siftsmall/siftsmall_groundtruth.ivecs";
IVecsReader ivreader{ivecs_filename};
std::vector<std::set<int>> gts;
while (!ivreader.eof())
{
int * v = ivreader.readvec();
std::set<int> vf(v, v + ivreader.dimension());
gts.push_back(vf);
}
// For each query vector,
for (int i = 0; i < qvecs.size(); i++)
{
auto t_name = name + " {" + std::to_string(i) + "}";
e2e_test_case(t_name, tree, qvecs[i], gts[i]).display();
}
}
int main(int argc, char ** argv)
{
test_case3("Range search").display();
test_case4("Range search null").display();
test_case5("kNN Search").display();
test_case6("kNN Search empty").display();
test_case7("kNN 3-dimensions").display();
e2e_driver("TexMex E2E");
return 0;
}