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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/vespalib/testkit/test_kit.h>
#include <vespa/vespalib/geo/zcurve.h>
#include <vector>
#include <cinttypes>
using Z = vespalib::geo::ZCurve;
bool inside(int x, int y, const Z::RangeVector &ranges) {
int64_t z = Z::encode(x, y);
for (auto range: ranges) {
if (z >= range.min() && z <= range.max()) {
return true;
}
}
fprintf(stderr, "FAILED: (%d, %d) -> (%" PRId64 ") not in:\n", x, y, z);
for (auto range: ranges) {
fprintf(stderr, " [%" PRId64 ", %" PRId64 "]\n", range.min(), range.max());
}
return false;
}
bool verify_ranges(int min_x, int min_y, int max_x, int max_y) {
Z::RangeVector ranges = Z::find_ranges(min_x, min_y, max_x, max_y);
for (int x = min_x; x <= max_x; ++x) {
for (int y = min_y; y <= max_y; ++y) {
if (!EXPECT_TRUE(inside(x, y, ranges))) {
return false;
}
}
}
return true;
}
TEST("require that returned ranges contains bounding box") {
std::vector<int> values({-13, -1, 0, 1, 13});
for (auto min_x: values) {
for (auto min_y: values) {
for (auto max_x: values) {
for (auto max_y: values) {
if (max_x >= min_x && max_y >= min_y) {
if (!EXPECT_TRUE(verify_ranges(min_x, min_y, max_x, max_y))) {
fprintf(stderr, "BOX: (%d, %d) -> (%d, %d)\n",
min_x, min_y, max_x, max_y);
}
}
}
}
}
}
}
TEST("require that silly bounding box does not explode") {
Z::RangeVector ranges = Z::find_ranges(-105, -7000000, 105, 7000000);
EXPECT_EQUAL(42u, ranges.size());
}
TEST_MAIN() { TEST_RUN_ALL(); }
|
