Method Get

libs/search/postcode_points.cpp:63–98

}

void PostcodePoints::Get(UniString const & postcode, bool recursive, vector<m2::PointD> & points) const
{
  if (!m_root || !m_points || !m_trieSubReader || !m_pointsSubReader || postcode.empty())
    return;

  auto postcodeIt = postcode.begin();
  auto trieIt = m_root->Clone();

  while (postcodeIt != postcode.end())
  {
    auto it = find_if(trieIt->m_edges.begin(), trieIt->m_edges.end(), [&](auto const & edge)
    { return StartsWith(postcodeIt, postcode.end(), edge.m_label.begin(), edge.m_label.end()); });
    if (it == trieIt->m_edges.end())
      return;

    postcodeIt += it->m_label.size();
    trieIt = trieIt->GoToEdge(distance(trieIt->m_edges.begin(), it));
  }

  if (postcodeIt != postcode.end())
    return;

  vector<uint32_t> indexes;
  trieIt->m_values.ForEach([&indexes](auto const & v)
  { indexes.push_back(base::asserted_cast<uint32_t>(v.m_featureId)); });

  if (recursive)
  {
    trie::ForEachRef(*trieIt, [&indexes](auto const & /* s */, auto const & v)
    { indexes.push_back(base::asserted_cast<uint32_t>(v.m_featureId)); }, UniString{});
  }

  points.resize(indexes.size());
  for (size_t i = 0; i < indexes.size(); ++i)
    CHECK(m_points->Get(indexes[i], points[i]), ());
}

void PostcodePoints::Get(UniString const & postcode, vector<m2::PointD> & points) const
{