git-clang-format

1 files changed, 8 insertions, 7 deletions

diff --git a/pedestrian_routing_tests/pedestrian_routing_tests.cpp b/pedestrian_routing_tests/pedestrian_routing_tests.cpp
index 1921f03bf1..d7733240f7 100644
--- a/pedestrian_routing_tests/pedestrian_routing_tests.cpp
+++ b/pedestrian_routing_tests/pedestrian_routing_tests.cpp
@@ -94,9 +94,9 @@ unique_ptr<routing::IRouter> CreatePedestrianAStarTestRouter(Index & index, stor
   auto UKGetter = [&](m2::PointD const & pt) { return cig.GetRegionCountryId(pt); };
   unique_ptr<routing::IVehicleModelFactory> vehicleModelFactory(new SimplifiedPedestrianModelFactory());
   unique_ptr<routing::IRoutingAlgorithm> algorithm(new routing::AStarRoutingAlgorithm());
-  unique_ptr<routing::IRouter> router(new routing::RoadGraphRouter("test-astar-pedestrian", index, UKGetter,
-                                                                   true /* onewayAsBidirectional */,
-                                                                   move(vehicleModelFactory), move(algorithm), nullptr));
+  unique_ptr<routing::IRouter> router(new routing::RoadGraphRouter(
+      "test-astar-pedestrian", index, UKGetter, true /* onewayAsBidirectional */,
+      move(vehicleModelFactory), move(algorithm), nullptr));
   return router;
 }
 
@@ -105,9 +105,9 @@ unique_ptr<routing::IRouter> CreatePedestrianAStarBidirectionalTestRouter(Index
   auto UKGetter = [&](m2::PointD const & pt) { return cig.GetRegionCountryId(pt); };
   unique_ptr<routing::IVehicleModelFactory> vehicleModelFactory(new SimplifiedPedestrianModelFactory());
   unique_ptr<routing::IRoutingAlgorithm> algorithm(new routing::AStarBidirectionalRoutingAlgorithm());
-  unique_ptr<routing::IRouter> router(new routing::RoadGraphRouter("test-astar-bidirectional-pedestrian", index, UKGetter,
-                                                                   true /* onewayAsBidirectional */,
-                                                                   move(vehicleModelFactory), move(algorithm), nullptr));
+  unique_ptr<routing::IRouter> router(new routing::RoadGraphRouter(
+      "test-astar-bidirectional-pedestrian", index, UKGetter, true /* onewayAsBidirectional */,
+      move(vehicleModelFactory), move(algorithm), nullptr));
   return router;
 }
 
@@ -124,7 +124,8 @@ m2::PointD GetPointOnEdge(routing::Edge & e, double posAlong)
 void GetNearestPedestrianEdges(Index & index, m2::PointD const & pt, vector<pair<routing::Edge, m2::PointD>> & edges)
 {
   unique_ptr<routing::IVehicleModelFactory> vehicleModelFactory(new SimplifiedPedestrianModelFactory());
-  routing::FeaturesRoadGraph roadGraph(index, true /* onewayAsBidirectional */, move(vehicleModelFactory));
+  routing::FeaturesRoadGraph roadGraph(index, true /* onewayAsBidirectional */,
+                                       move(vehicleModelFactory));
 
   roadGraph.FindClosestEdges(pt, 1 /*count*/, edges);
 }