Open-Harbor/osrm-backend
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 3 Wiki Activity

Fix broken DP

Browse Source
This commit is contained in:
Patrick Niklaus 2014-10-27 22:43:25 +01:00
parent 3fe2b587cb
commit 27caab69ec
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Algorithms/DouglasPeucker.cpp
View File

@ -151,7 +151,7 @@ void DouglasPeucker::Run(RandomAccessIt begin, RandomAccessIt end, const unsigne
const GeometryRange pair = recursion_stack.top(); const GeometryRange pair = recursion_stack.top();
recursion_stack.pop(); recursion_stack.pop();
// sanity checks // sanity checks
BOOST_ASSERT_MSG(pair.first->necessary, "left border mus be necessary"); BOOST_ASSERT_MSG(pair.first->necessary, "left border must be necessary");
BOOST_ASSERT_MSG(pair.second->necessary, "right border must be necessary"); BOOST_ASSERT_MSG(pair.second->necessary, "right border must be necessary");
BOOST_ASSERT_MSG(std::distance(pair.second, end) > 0, "right border outside of geometry"); BOOST_ASSERT_MSG(std::distance(pair.second, end) > 0, "right border outside of geometry");
BOOST_ASSERT_MSG(std::distance(pair.first, pair.second) >= 0, "left border on the wrong side"); BOOST_ASSERT_MSG(std::distance(pair.first, pair.second) >= 0, "left border on the wrong side");
@ -181,7 +181,7 @@ void DouglasPeucker::Run(RandomAccessIt begin, RandomAccessIt end, const unsigne
{ {
recursion_stack.emplace(pair.first, farthest_entry_it); recursion_stack.emplace(pair.first, farthest_entry_it);
} }
if (1 < std::distance(pair.second, farthest_entry_it)) if (1 < std::distance(farthest_entry_it, pair.second))
{ {
recursion_stack.emplace(farthest_entry_it, pair.second); recursion_stack.emplace(farthest_entry_it, pair.second);
} }