drifty/comaps
1
0
Fork 0
mirror of https://codeberg.org/comaps/comaps synced 2025-12-23 06:33:42 +00:00
Code Issues Packages Projects Releases Wiki Activity

ADL for AlmostEqual* and use math:: instead of base:: (#9634)

Browse Source 
* ADL for AlmostEqual* and use math:: instead of base::

Signed-off-by: Alexander Borsuk <me@alex.bio>
This commit is contained in:
Alexander Borsuk
2025-07-07 20:49:00 +02:00
committed by Konstantin Pastbin
parent 82133c5743
commit 30718e106e
175 changed files with 542 additions and 559 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
routing/routing_tests/index_graph_tools.cpp
View File

@@ -88,7 +88,7 @@ void NoUTurnRestrictionTest::TestRouteGeom(Segment const & start, Segment const
{
static auto constexpr kEps = 1e-3;
auto const point = m_graph->GetWorldGraph().GetPoint(routingResult.m_path[i], true /* forward */);
if (!base::AlmostEqualAbs(mercator::FromLatLon(point), expectedRouteGeom[i], kEps))
if (!AlmostEqualAbs(mercator::FromLatLon(point), expectedRouteGeom[i], kEps))
{
TEST(false, ("Coords missmated at index:", i, "expected:", expectedRouteGeom[i],
"received:", point));
@@ -528,7 +528,7 @@ void TestRouteGeometry(IndexGraphStarter & starter,
for (size_t i = 0; i < geom.size(); ++i)
{
static double constexpr kEps = 1e-8;
if (!base::AlmostEqualAbs(geom[i], expectedRouteGeom[i], kEps))
if (!AlmostEqualAbs(geom[i], expectedRouteGeom[i], kEps))
{
for (size_t j = 0; j < geom.size(); ++j)
LOG(LINFO, (j, "=>", geom[j], "vs", expectedRouteGeom[j]));
@@ -588,7 +588,7 @@ void TestRestrictions(double expectedLength,
}
static auto constexpr kEps = 1e-3;
TEST(base::AlmostEqualAbs(expectedLength, length, kEps),
TEST(AlmostEqualAbs(expectedLength, length, kEps),
("Length expected:", expectedLength, "has:", length));
}
@@ -604,7 +604,7 @@ void TestTopologyGraph(TestIndexGraphTopology const & graph, TestIndexGraphTopol
if (!pathFound)
return;
TEST(base::AlmostEqualAbs(pathWeight, expectedWeight, kEpsilon),
TEST(AlmostEqualAbs(pathWeight, expectedWeight, kEpsilon),
(pathWeight, expectedWeight, pathEdges));
TEST_EQUAL(pathEdges, expectedEdges, ());
}