Generating restriction, implementaion implementation using them at runtime§:wq, applying them on index graph and tests on it.

1 files changed, 53 insertions, 0 deletions

diff --git a/routing/road_index.cpp b/routing/road_index.cpp
index e6668e8a0d..fbea8cba5f 100644
--- a/routing/road_index.cpp
+++ b/routing/road_index.cpp
@@ -18,6 +18,59 @@ void RoadIndex::Import(vector<Joint> const & joints)
   }
 }
 
+bool RoadIndex::GetAdjacentFtPoints(uint32_t featureIdFrom, uint32_t featureIdTo, RoadPoint & from,
+                                    RoadPoint & to, Joint::Id & jointId) const
+{
+  auto const fromIt = m_roads.find(featureIdFrom);
+  if (fromIt == m_roads.cend())
+    return false;
+
+  auto const toIt = m_roads.find(featureIdTo);
+  if (toIt == m_roads.cend())
+    return false;
+
+  RoadJointIds const & roadJointIdsFrom = fromIt->second;
+  RoadJointIds const & roadJointIdsTo = toIt->second;
+  if (roadJointIdsFrom.GetSize() == 0 || roadJointIdsTo.GetSize() == 0)
+    return false; // No sence in restrictions on features without joints.
+
+  // Note. It's important to check other variant besides a restriction from last segment
+  // of featureIdFrom to first segment of featureIdTo since two way features can have
+  // reverse point order.
+  if (roadJointIdsFrom.Back() == roadJointIdsTo.Front())
+  {
+    from = RoadPoint(featureIdFrom, roadJointIdsFrom.GetSize() - 1);
+    to = RoadPoint(featureIdTo, 0);
+    jointId = roadJointIdsFrom.Back();
+    return true;
+  }
+
+  if (roadJointIdsFrom.Front() == roadJointIdsTo.Back())
+  {
+    from = RoadPoint(featureIdFrom, 0);
+    to = RoadPoint(featureIdTo, roadJointIdsTo.GetSize() - 1);
+    jointId = roadJointIdsFrom.Front();
+    return true;
+  }
+
+  if (roadJointIdsFrom.Back() == roadJointIdsTo.Back())
+  {
+    from = RoadPoint(featureIdFrom, roadJointIdsFrom.GetSize() - 1);
+    to = RoadPoint(featureIdTo, roadJointIdsTo.GetSize() - 1);
+    jointId = roadJointIdsFrom.Back();
+    return true;
+  }
+
+  if (roadJointIdsFrom.Front() == roadJointIdsTo.Front())
+  {
+    from = RoadPoint(featureIdFrom, 0);
+    to = RoadPoint(featureIdTo, 0);
+    jointId = roadJointIdsFrom.Front();
+    return true;
+  }
+  return false; // |featureIdFrom| and |featureIdTo| are not adjacent.
+}
+
 pair<Joint::Id, uint32_t> RoadIndex::FindNeighbor(RoadPoint rp, bool forward) const
 {
   auto const it = m_roads.find(rp.GetFeatureId());