Method Process

generator/final_processor_complex.cpp:64–142

}

void ComplexFinalProcessor::Process()
{
  LOG(LINFO, ("Processing complex features..."));

  if (!m_buildingPartsFilename.empty())
    m_buildingToParts = std::make_unique<BuildingToBuildingPartsMap>(m_buildingPartsFilename);

  std::mutex mutex;
  std::vector<HierarchyEntry> allLines;
  ForEachMwmTmp(m_mwmTmpPath, [&](auto const & name, auto const & path)
  {
    // https://wiki.openstreetmap.org/wiki/Simple_3D_buildings
    // An object with tag 'building:part' is a part of a relation with outline 'building' or
    // is contained in an object with tag 'building'. We will split data and work with
    // these cases separately. First of all let's remove objects with tag building:part is
    // contained in relations. We will add them back after data processing.
    ankerl::unordered_dense::map<base::GeoObjectId, FeatureBuilder> relationBuildingParts;

    auto fbs = ReadAllDatRawFormat<serialization_policy::MaxAccuracy>(path);

    if (m_buildingToParts)
      relationBuildingParts = RemoveRelationBuildingParts(fbs);

    // This case is second. We build a hierarchy using the geometry of objects and their nesting.
    auto trees = hierarchy::BuildHierarchy(std::move(fbs), m_getMainType, m_filter);

    // We remove tree roots with tag 'building:part'.
    base::EraseIf(trees, [](auto const & node)
    {
      static auto const & buildingPartChecker = ftypes::IsBuildingPartChecker::Instance();
      return buildingPartChecker(node->GetData().GetTypes());
    });

    // We want to transform
    // building
    //        |_building-part
    //                       |_building-part
    // to
    // building
    //        |_building-part
    //        |_building-part
    hierarchy::FlattenBuildingParts(trees);
    // In the end we add objects, which were saved by the collector.
    if (m_buildingToParts)
    {
      hierarchy::AddChildrenTo(trees, [&](auto const & compositeId)
      {
        auto const & ids = m_buildingToParts->GetBuildingPartsByOutlineId(compositeId);
        std::vector<hierarchy::HierarchyPlace> places;
        places.reserve(ids.size());
        for (auto const & id : ids)
        {
          if (relationBuildingParts.count(id) == 0)
            continue;

          places.emplace_back(hierarchy::HierarchyPlace(relationBuildingParts[id]));
        }
        return places;