handle segregated roads (merge for turn analysis)
This commit is contained in:
committed by
Patrick Niklaus
parent
f713408d46
commit
6f9d8a691d
@@ -79,10 +79,7 @@ std::vector<RouteStep> assembleSteps(const DataFacadeT &facade,
|
||||
std::vector<RouteStep> steps;
|
||||
steps.reserve(number_of_segments);
|
||||
|
||||
// TODO do computation based on distance and choose better next vertex
|
||||
BOOST_ASSERT(leg_geometry.locations.size() >= 4); // source, phantom, closest positions on way
|
||||
|
||||
auto segment_index = 0;
|
||||
std::size_t segment_index = 0;
|
||||
if (leg_data.size() > 0)
|
||||
{
|
||||
|
||||
|
||||
@@ -50,6 +50,7 @@ struct NodeBasedEdgeData
|
||||
|
||||
bool IsCompatibleTo(const NodeBasedEdgeData &other) const
|
||||
{
|
||||
//TODO roundabout/startpoint/access_restricted should all be part of this??
|
||||
return (reversed == other.reversed) && (name_id == other.name_id) &&
|
||||
(travel_mode == other.travel_mode && road_classification == other.road_classification);
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user