Method LoadStreet

libs/search/street_vicinity_loader.cpp:63–95

}

void StreetVicinityLoader::LoadStreet(uint32_t featureId, Street & street, bool ignoreEditedStatus)
{
  auto feature = m_context->GetFeature(featureId, ignoreEditedStatus);
  if (!feature || !IsStreet(*feature))
    return;

  /// @todo Can be optimized here. Do not aggregate rect, but aggregate covering intervals for each segment, instead.
  auto const sumRect = [&street, this](m2::PointD const & pt)
  { street.m_rect.Add(mercator::RectByCenterXYAndSizeInMeters(pt, m_offsetMeters)); };

  if (feature->GetGeomType() == feature::GeomType::Area)
  {
    feature->ForEachTriangle([&sumRect](m2::PointD const & p1, m2::PointD const & p2, m2::PointD const & p3)
    {
      sumRect(p1);
      sumRect(p2);
      sumRect(p3);
    }, FeatureType::BEST_GEOMETRY);
  }
  else
    feature->ForEachPoint(sumRect, FeatureType::BEST_GEOMETRY);
  ASSERT(street.m_rect.IsValid(), ());

  covering::CoveringGetter coveringGetter(street.m_rect, covering::ViewportWithLowLevels);
  auto const & intervals = coveringGetter.Get<RectId::DEPTH_LEVELS>(m_scale);
  m_context->ForEachIndex(intervals, m_scale, [this, &street, featureId](uint32_t id)
  {
    if (m_context->GetStreet(id) == featureId)
      street.m_features.push_back(id);
  });

  // street.m_calculator = std::make_unique<ProjectionOnStreetCalculator>(points);
}
}  // namespace search