diff options
author | Mikhail Gorbushin <m.gorbushin@corp.mail.ru> | 2019-05-15 22:03:07 +0300 |
---|---|---|
committer | Vladimir Byko-Ianko <bykoianko@gmail.com> | 2019-05-29 14:32:05 +0300 |
commit | 4552fe770631efbfc824454702508ae7b52e1f3c (patch) | |
tree | 16ff8ba0e0b639ed3f354379cf68b007ded094d9 /routing | |
parent | 1b83c08607ac18d95da23db0a5217171aa986ed0 (diff) |
[routing] delete check, that can be true
Diffstat (limited to 'routing')
-rw-r--r-- | routing/bicycle_directions.cpp | 10 |
1 files changed, 2 insertions, 8 deletions
diff --git a/routing/bicycle_directions.cpp b/routing/bicycle_directions.cpp index b07a4d2064..f1c97302f4 100644 --- a/routing/bicycle_directions.cpp +++ b/routing/bicycle_directions.cpp @@ -354,8 +354,8 @@ void BicycleDirectionsEngine::FillPathSegmentsAndAdjacentEdgesMap( continue; } - CHECK_EQUAL(prevJunctions.size(), static_cast<size_t>( - abs(static_cast<int32_t>(inSegId - startSegId)) + 1), ()); + CHECK_EQUAL(prevJunctions.size(), + static_cast<size_t>(abs(static_cast<int32_t>(inSegId - startSegId)) + 1), ()); prevJunctions.push_back(currJunction); @@ -379,12 +379,6 @@ void BicycleDirectionsEngine::FillPathSegmentsAndAdjacentEdgesMap( if (!segmentRange.IsEmpty()) { auto const it = m_adjacentEdges.find(segmentRange); - // A route may be built through intermediate points. So it may contain the same |segmentRange| - // several times. But in that case |adjacentEdges| corresponding to |segmentRange| - // should be the same. - ASSERT(it == m_adjacentEdges.cend() || it->second.IsAlmostEqual(adjacentEdges), - ("segmentRange:", segmentRange, "corresponds to adjacent edges which aren't equal.")); - m_adjacentEdges.insert(it, make_pair(segmentRange, move(adjacentEdges))); } |