Method Match

generator/address_enricher.cpp:204–358

}

AddressEnricher::FoundT AddressEnricher::Match(Entry & e) const
{
  // Calc query rect with the threshold.
  m2::RectD rect;
  for (auto const & p : e.m_points)
    rect.Add(p);
  m2::RectD const inflation = mercator::RectByCenterXYAndSizeInMeters(rect.Center(), kDistanceThresholdM);
  rect.Inflate(inflation.SizeX(), inflation.SizeY());

  // Tiger usually has short (St) names, while OSM has full (Street) names.
  auto const streetKey = search::GetNormalizedStreetName(e.m_street);

  // Get HN range for the entry.
  auto const range = e.GetHNRange();
  CHECK(range != Entry::kInvalidRange, ());
  CHECK(range.first <= range.second, (range));

  // Prepare distance calculator for the entry.
  std::vector<m2::ParametrizedSegment<m2::PointD>> eSegs;
  eSegs.reserve(e.m_points.size() - 1);
  for (size_t i = 1; i < e.m_points.size(); ++i)
    eSegs.emplace_back(e.m_points[i - 1], e.m_points[i]);

  /// @todo Check nodes distance for now. Should make more honest algo.
  auto const isClose = [&e, &eSegs](feature::FeatureBuilder const & fb)
  {
    bool res = false;

    fb.ForEachPoint([&](m2::PointD const & p)
    {
      if (res)
        return;

      auto const ll = mercator::ToLatLon(p);
      auto const check = [&ll](m2::PointD const & p)
      { return ms::DistanceOnEarth(ll, mercator::ToLatLon(p)) < kDistanceThresholdM; };

      if (!eSegs.empty())
      {
        for (auto const & seg : eSegs)
          if (check(seg.ClosestPointTo(p)))
          {
            res = true;
            return;
          }
      }
      else
        res = check(e.m_points.front());
    });

    return res;
  };

  FoundT res;

  m_srcTree.ForEachInRect(rect, [&](feature::FeatureBuilder const & fb)
  {
    auto const osmID = fb.GetMostGenericOsmId();