drifty/comaps
1
0
Fork 0
mirror of https://codeberg.org/comaps/comaps synced 2025-12-19 21:13:35 +00:00
Code Issues Packages Projects Releases Wiki Activity

Format all C++ and Java code via clang-format

Browse Source 
Signed-off-by: Konstantin Pastbin <konstantin.pastbin@gmail.com>
This commit is contained in:
Konstantin Pastbin
2025-08-17 14:32:37 +07:00
parent 9f0290c0ec
commit bfffa1fff4
2169 changed files with 56441 additions and 64188 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
libs/routing/routing_tests/nearest_edge_finder_tests.cpp
View File

@@ -2,8 +2,8 @@
#include "routing/routing_tests/road_graph_builder.hpp"
#include "routing/road_graph.hpp"
#include "routing/nearest_edge_finder.hpp"
#include "routing/road_graph.hpp"
#include "routing_common/maxspeed_conversion.hpp"
@@ -27,8 +27,7 @@ void TestNearestOnMock1(m2::PointD const & point, size_t const candidatesCount,
for (size_t i = 0; i < graph->GetRoadCount(); ++i)
{
FeatureID const featureId = MakeTestFeatureID(base::checked_cast<uint32_t>(i));
auto const & roadInfo =
graph->GetRoadInfo(featureId, {true /* forward */, false /* in city */, Maxspeed()});
auto const & roadInfo = graph->GetRoadInfo(featureId, {true /* forward */, false /* in city */, Maxspeed()});
finder.AddInformationSource(IRoadGraph::FullRoadInfo(featureId, roadInfo));
}
@@ -72,4 +71,4 @@ UNIT_TEST(MiddleSegmentTest_Mock1Graph)
geometry::MakePointWithAltitudeForTesting(m2::PointD(12.5, 0)))};
TestNearestOnMock1(m2::PointD(12.5, 2.5), 2, expected);
}
} // namespace nearest_edge_finder_tests
} // namespace nearest_edge_finder_tests