Method Save

generator/road_access_generator.cpp:424–475

@see correspondent ReadRoadAccess.

/// @see correspondent ReadRoadAccess.
void RoadAccessCollector::Save()
{
  auto fileName = GetFilename();

  LOG(LINFO, ("Saving road access values to", fileName));
  FileWriter writer(fileName);

  for (auto & p : m_tagProcessors)
  {
    p.m_wayToAccess.Serialize(writer);
    p.m_wayToAccessConditional.Serialize(writer);
  }

  generator::SizeWriter<uint64_t> sizeWriter;
  uint64_t count = 0;
  sizeWriter.Reserve(writer);

  m_roads.ForEachWayWithIndex([&](uint64_t wayID, std::vector<uint64_t> const & nodes, size_t idx)
  {
    for (auto & p : m_tagProcessors)
    {
      for (uint32_t nodeIdx = 0; nodeIdx < nodes.size(); ++nodeIdx)
      {
        uint64_t const nodeID = nodes[nodeIdx];
        auto const * entry = p.m_barriersWithAccessTag.Find(nodeID);
        if (entry == nullptr)
        {
          entry = p.m_barriersWithoutAccessTag.Find(nodeID);
          if (entry == nullptr)
            continue;

          if (p.IsIgnoreBarriers(idx))
          {
            // Dump only bicycle profile with the most wide barriers set to ignore.
            if (p.m_vehicleType == VehicleType::Bicycle)
              LOG(LDEBUG, ("Node barrier without access:", nodeID));
            continue;
          }
        }

        ++count;
        // Write vehicle type for each entry to avoid multiple roads iterating.
        WriteToSink(writer, static_cast<uint8_t>(p.m_vehicleType));
        entry->Write(writer, wayID, nodeIdx);
      }
    }
  }, m_cache);

  sizeWriter.Write(writer, count);

  LOG(LINFO, ("Finished saving road access values"));
}

void RoadAccessCollector::MergeInto(RoadAccessCollector & collector) const
{