drifty/comaps
1
0
Fork 0
mirror of https://codeberg.org/comaps/comaps synced 2025-12-19 13:03:36 +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

5
libs/routing/routing_integration_tests/road_graph_tests.cpp
View File

@@ -10,9 +10,9 @@
#include "indexer/feature_altitude.hpp"
#include "indexer/mwm_set.hpp"
#include "routing_common/car_model.hpp"
#include "routing/features_road_graph.hpp"
#include "routing/road_graph.hpp"
#include "routing_common/car_model.hpp"
#include "routing/routing_integration_tests/routing_test_tools.hpp"
@@ -46,8 +46,7 @@ UNIT_TEST(FakeEdgesCombinatorialExplosion)
geometry::PointWithAltitude const j(m2::PointD(mercator::FromLatLon(50.73208, -1.21279)),
geometry::kDefaultAltitudeMeters);
std::vector<std::pair<routing::Edge, geometry::PointWithAltitude>> sourceVicinity;
graph.FindClosestEdges(mercator::RectByCenterXYAndSizeInMeters(
j.GetPoint(), FeaturesRoadGraph::kClosestEdgesRadiusM),
graph.FindClosestEdges(mercator::RectByCenterXYAndSizeInMeters(j.GetPoint(), FeaturesRoadGraph::kClosestEdgesRadiusM),
20 /* count */, sourceVicinity);
// In case of the combinatorial explosion mentioned above all the memory was consumed for
// FeaturesRoadGraph::m_fakeIngoingEdges and FeaturesRoadGraph::m_fakeOutgoingEdges fields.