From bf25034a27125187cb41321a7bf8c51c53c82c58 Mon Sep 17 00:00:00 2001
From: Mikhail Gorbushin <m.gorbushin@corp.mail.ru>
Date: Mon, 25 Mar 2019 15:29:17 +0300
Subject: [PATCH] [routing] review fixes

---
 generator/routing_index_generator.cpp | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/generator/routing_index_generator.cpp b/generator/routing_index_generator.cpp
index cc6c111e85..3d57630bef 100644
--- a/generator/routing_index_generator.cpp
+++ b/generator/routing_index_generator.cpp
@@ -173,13 +173,13 @@ public:
     return m_graph.GetPoint(s, forward);
   }
 
-  void GetEdgesList(Segment const & from, bool isOutgoing, std::vector<SegmentEdge> & edges)
+  void GetEdgesList(Segment const & from, bool isOutgoing, vector<SegmentEdge> & edges)
   {
     m_graph.GetEdgeList(from, isOutgoing, edges);
   }
 
   void GetEdgeList(Segment const & segment, bool isOutgoing,
-                   std::vector<JointEdge> & edges, std::vector<RouteWeight> & parentWeights) const
+                   vector<JointEdge> & edges, vector<RouteWeight> & parentWeights) const
   {
     return m_graph.GetEdgeList(segment, isOutgoing, edges, parentWeights);
   }
@@ -470,7 +470,7 @@ void FillWeights(string const & path, string const & mwmFile, string const & cou
     IndexGraphWrapper indexGraphWrapper(graph, enter);
     DijkstraWrapperJoints wrapper(indexGraphWrapper, enter);
     AStarAlgorithm<DijkstraWrapperJoints>::Context context;
-    std::unordered_map<uint32_t, std::vector<JointSegment>> visitedVertexes;
+    unordered_map<uint32_t, vector<JointSegment>> visitedVertexes;
     astar.PropagateWave(wrapper, wrapper.GetGraph().GetStartJoint(),
                         [&](JointSegment const & vertex)
                         {