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
|
#include "testing/testing.hpp"
#include "coding/coding_tests/test_polylines.hpp"
#include "coding/point_coding.hpp"
#include "geometry/mercator.hpp"
#include "base/logging.hpp"
#include <cmath>
using namespace std;
namespace
{
double const kEps = kMwmPointAccuracy;
uint8_t const kCoordBits = kPointCoordBits;
uint32_t const kBig = uint32_t{1} << 30;
void CheckEqualPoints(m2::PointD const & p1, m2::PointD const & p2)
{
TEST(p1.EqualDxDy(p2, kEps), (p1, p2));
TEST_GREATER_OR_EQUAL(p1.x, -180.0, ());
TEST_GREATER_OR_EQUAL(p1.y, -180.0, ());
TEST_LESS_OR_EQUAL(p1.x, 180.0, ());
TEST_LESS_OR_EQUAL(p1.y, 180.0, ());
TEST_GREATER_OR_EQUAL(p2.x, -180.0, ());
TEST_GREATER_OR_EQUAL(p2.y, -180.0, ());
TEST_LESS_OR_EQUAL(p2.x, 180.0, ());
TEST_LESS_OR_EQUAL(p2.y, 180.0, ());
}
} // namespace
UNIT_TEST(PointDToPointU_Epsilons)
{
m2::PointD const arrPt[] = {{-180, -180}, {-180, 180}, {180, 180}, {180, -180}};
m2::PointD const arrD[] = {{1, 1}, {1, -1}, {-1, -1}, {-1, 1}};
size_t const count = ARRAY_SIZE(arrPt);
double eps = 1.0;
while (true)
{
size_t i = 0;
for (; i < count; ++i)
{
m2::PointU p0 = PointDToPointU(arrPt[i].x, arrPt[i].y, kCoordBits);
m2::PointU p1 = PointDToPointU(arrPt[i].x + arrD[i].x * eps,
arrPt[i].y + arrD[i].y * eps,
kCoordBits);
if (p0 != p1)
break;
}
if (i == count)
break;
eps *= 0.1;
}
LOG(LINFO, ("Epsilon (relative error) =", eps));
for (size_t i = 0; i < count; ++i)
{
m2::PointU const p1 = PointDToPointU(arrPt[i].x, arrPt[i].y, kCoordBits);
m2::PointU const p2(p1.x + arrD[i].x, p1.y + arrD[i].y);
m2::PointD const p3 = PointUToPointD(p2, kCoordBits);
LOG(LINFO, ("Dx =", p3.x - arrPt[i].x, "Dy =", p3.y - arrPt[i].y));
}
}
UNIT_TEST(PointToInt64Obsolete_Smoke)
{
m2::PointD const arr[] = {{1.25, 1.3}, {180, 90}, {-180, -90}, {0, 0}};
for (size_t i = 0; i < ARRAY_SIZE(arr); ++i)
CheckEqualPoints(arr[i],
Int64ToPointObsolete(PointToInt64Obsolete(arr[i], kCoordBits), kCoordBits));
}
UNIT_TEST(PointToInt64Obsolete_Grid)
{
int const delta = 5;
for (int ix = -180; ix <= 180; ix += delta)
{
for (int iy = -180; iy <= 180; iy += delta)
{
m2::PointD const pt(ix, iy);
int64_t const id = PointToInt64Obsolete(pt, kCoordBits);
m2::PointD const pt1 = Int64ToPointObsolete(id, kCoordBits);
CheckEqualPoints(pt, pt1);
int64_t const id1 = PointToInt64Obsolete(pt1, kCoordBits);
TEST_EQUAL(id, id1, (pt, pt1));
}
}
}
UNIT_TEST(PointToInt64Obsolete_Bounds)
{
double const arrEps[] = {-1.0E-2, -1.0E-3, -1.0E-4, 0, 1.0E-4, 1.0E-3, 1.0E-2};
m2::PointD const arrPt[] = {{0, 0}, {-180, -180}, {-180, 180}, {180, 180}, {180, -180},
{-90, -90}, {-90, 90}, {90, 90}, {90, -90}};
for (size_t iP = 0; iP < ARRAY_SIZE(arrPt); ++iP)
{
for (size_t iX = 0; iX < ARRAY_SIZE(arrEps); ++iX)
{
for (size_t iY = 0; iY < ARRAY_SIZE(arrEps); ++iY)
{
m2::PointD const pt(arrPt[iP].x + arrEps[iX], arrPt[iP].y + arrEps[iY]);
m2::PointD const pt1 =
Int64ToPointObsolete(PointToInt64Obsolete(pt, kCoordBits), kCoordBits);
TEST(fabs(pt.x - pt1.x) <= (fabs(arrEps[iX]) + kEps) &&
fabs(pt.y - pt1.y) <= (fabs(arrEps[iY]) + kEps),
(pt, pt1));
}
}
}
}
UNIT_TEST(PointUToUint64Obsolete_0)
{
TEST_EQUAL(0, PointUToUint64Obsolete(m2::PointU(0, 0)), ());
TEST_EQUAL(m2::PointU(0, 0), Uint64ToPointUObsolete(0), ());
}
UNIT_TEST(PointUToUint64Obsolete_Interlaced)
{
TEST_EQUAL(0xAAAAAAAAAAAAAAAAULL, PointUToUint64Obsolete(m2::PointU(0, 0xFFFFFFFF)), ());
TEST_EQUAL(0x5555555555555555ULL, PointUToUint64Obsolete(m2::PointU(0xFFFFFFFF, 0)), ());
TEST_EQUAL(0xAAAAAAAAAAAAAAA8ULL, PointUToUint64Obsolete(m2::PointU(0, 0xFFFFFFFE)), ());
TEST_EQUAL(0x5555555555555554ULL, PointUToUint64Obsolete(m2::PointU(0xFFFFFFFE, 0)), ());
}
UNIT_TEST(PointUToUint64Obsolete_1bit)
{
TEST_EQUAL(2, PointUToUint64Obsolete(m2::PointU(0, 1)), ());
TEST_EQUAL(m2::PointU(0, 1), Uint64ToPointUObsolete(2), ());
TEST_EQUAL(1, PointUToUint64Obsolete(m2::PointU(1, 0)), ());
TEST_EQUAL(m2::PointU(1, 0), Uint64ToPointUObsolete(1), ());
TEST_EQUAL(3ULL << 60, PointUToUint64Obsolete(m2::PointU(kBig, kBig)), ());
TEST_EQUAL((1ULL << 60) - 1, PointUToUint64Obsolete(m2::PointU(kBig - 1, kBig - 1)), ());
}
UNIT_TEST(PointToInt64Obsolete_DataSet1)
{
using namespace geometry_coding_tests;
for (size_t i = 0; i < ARRAY_SIZE(arr1); ++i)
{
m2::PointD const pt(arr1[i].x, arr1[i].y);
int64_t const id = PointToInt64Obsolete(pt, kCoordBits);
m2::PointD const pt1 = Int64ToPointObsolete(id, kCoordBits);
CheckEqualPoints(pt, pt1);
int64_t const id1 = PointToInt64Obsolete(pt1, kCoordBits);
TEST_EQUAL(id, id1, (pt, pt1));
}
}
|
