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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* Copyright (c) 2021 Kohei Yoshida
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitation the rights to use,
* copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following
* conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*
************************************************************************/
#include "test_global.hpp" // This must be the first header to be included.
#include "test_global_rtree.hpp"
using mdds::rtree;
using std::cout;
using std::endl;
void rtree_test_square_distance()
{
MDDS_TEST_FUNC_SCOPE;
using mdds::detail::rtree::calc_square_distance;
{
// 1 dimensional unsigned
using rt_type = rtree<uint16_t, std::string, tiny_trait_1d>;
using point_type = rt_type::point_type;
struct test_case
{
point_type p1;
point_type p2;
uint16_t expected;
};
std::vector<test_case> tcs = {
{{3}, {5}, 4},
{{9}, {2}, 49},
{{0}, {0}, 0},
};
for (const test_case& tc : tcs)
{
cout << "p1: " << tc.p1.to_string() << "; p2: " << tc.p2.to_string() << endl;
uint16_t dist = calc_square_distance<point_type>(tc.p1, tc.p2);
TEST_ASSERT(dist == tc.expected);
// Flip the value to make sure we still get the same result.
dist = calc_square_distance<point_type>(tc.p2, tc.p1);
TEST_ASSERT(dist == tc.expected);
}
}
{
// 2 dimensional unsigned
using rt_type = rtree<uint16_t, std::string, tiny_trait_2d>;
using point_type = rt_type::point_type;
struct test_case
{
point_type p1;
point_type p2;
uint16_t expected;
};
std::vector<test_case> tcs = {
{{0, 0}, {0, 0}, 0},
{{0, 0}, {1, 1}, 2},
{{0, 0}, {2, 2}, 8},
{{3, 0}, {0, 4}, 25},
};
for (const test_case& tc : tcs)
{
cout << "p1: " << tc.p1.to_string() << "; p2: " << tc.p2.to_string() << endl;
uint16_t dist = calc_square_distance<point_type>(tc.p1, tc.p2);
TEST_ASSERT(dist == tc.expected);
// Flip the value to make sure we still get the same result.
dist = calc_square_distance<point_type>(tc.p2, tc.p1);
TEST_ASSERT(dist == tc.expected);
}
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
