pastk/organicmaps
1
Fork 0
forked from organicmaps/organicmaps
Code Pull requests Activity

[routing] delete check, that can be true

Browse source
This commit is contained in:
Mikhail Gorbushin 2019-05-15 22:03:07 +03:00 • committed by Vladimir Byko-Ianko
parent 1b83c08607
commit 4552fe7706
1 changed files with 2 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
routing/bicycle_directions.cpp
View file

@ -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)));
}