Function ConvertRestrictionsOnlyToNo

libs/routing/restriction_loader.cpp:116–151

\brief We store |Only| restriction in mwm, like Only, featureId_1, ... , featureId_N We convert such restriction to |No| following way: For each M, greater than 1, and M first features: featureId_1, ... , featureId_(M - 1), featureId_M, ... We create restrictionNo from features: featureId_1, ... , featureId_(M - 1), featureId_K where featureId_K - has common joint with featureId_(M - 1) and feat

/// featureId_1, ... , featureId_(M - 1), featureId_K
/// where featureId_K - has common joint with featureId_(M - 1) and featureId_M.
void ConvertRestrictionsOnlyToNo(IndexGraph const & graph, RestrictionVec const & restrictionsOnly,
                                 RestrictionVec & restrictionsNo)
{
  for (std::vector<uint32_t> const & restriction : restrictionsOnly)
  {
    CHECK_GREATER_OR_EQUAL(restriction.size(), 2, ());

    if (!IsRestrictionFromRoads(graph, restriction))
      continue;

    for (size_t i = 1; i < restriction.size(); ++i)
    {
      auto const curFeatureId = restriction[i];
      auto const prevFeatureId = restriction[i - 1];

      // Looking for a joint of an intersection of prev and cur features.
      Joint::Id const common = GetCommonEndJoint(graph.GetRoad(curFeatureId), graph.GetRoad(prevFeatureId));

      if (common == Joint::kInvalidId)
        break;

      std::vector<uint32_t> commonFeatures;
      commonFeatures.resize(i + 1);
      std::copy(restriction.begin(), restriction.begin() + i, commonFeatures.begin());

      graph.ForEachPoint(common, [&](RoadPoint const & rp)
      {
        if (rp.GetFeatureId() != curFeatureId)
        {
          commonFeatures.back() = rp.GetFeatureId();
          restrictionsNo.emplace_back(commonFeatures);
        }
      });
    }
  }
}

void ConvertRestrictionsOnlyUTurnToNo(IndexGraph & graph, std::vector<RestrictionUTurn> const & restrictionsOnlyUTurn,
                                      RestrictionVec & restrictionsNo)