Repo created

generator/ways_merger.hpp

@@ -0,0 +1,79 @@
+#pragma once
+
+#include "generator/intermediate_data.hpp"
+#include "generator/intermediate_elements.hpp"
+
+#include "geometry/point2d.hpp"
+
+#include <map>
+#include <memory>
+#include <vector>
+
+namespace generator
+{
+class AreaWayMerger
+{
+  using PointSeq = std::vector<m2::PointD>;
+  using WayMap = std::multimap<uint64_t, std::shared_ptr<WayElement>>;
+  using WayMapIterator = WayMap::iterator;
+
+public:
+  explicit AreaWayMerger(std::shared_ptr<cache::IntermediateDataReaderInterface> const & cache);
+
+  void AddWay(uint64_t id);
+
+  template <class ToDo>
+  void ForEachArea(bool collectID, ToDo && toDo)
+  {
+    while (!m_map.empty())
+    {
+      // start
+      WayMapIterator i = m_map.begin();
+      uint64_t id = i->first;
+
+      std::vector<uint64_t> ids;
+      PointSeq points;
+
+      do
+      {
+        // process way points
+        std::shared_ptr<WayElement> e = i->second;
+        if (collectID)
+          ids.push_back(e->m_wayOsmId);
+
+        e->ForEachPointOrdered(id, [this, &points](uint64_t id)
+        {
+          m2::PointD pt;
+          if (m_cache->GetNode(id, pt.y, pt.x))
+            points.push_back(pt);
+        });
+
+        m_map.erase(i);
+
+        // next 'id' to process
+        id = e->GetOtherEndPoint(id);
+        std::pair<WayMapIterator, WayMapIterator> r = m_map.equal_range(id);
+
+        // finally erase element 'e' and find next way in chain
+        i = r.second;
+        while (r.first != r.second)
+          if (r.first->second == e)
+            m_map.erase(r.first++);
+          else
+            i = r.first++;
+
+        if (i == r.second)
+          break;
+      }
+      while (true);
+
+      if (points.size() > 2 && points.front() == points.back())
+        toDo(std::move(points), std::move(ids));
+    }
+  }
+
+private:
+  std::shared_ptr<cache::IntermediateDataReaderInterface> m_cache;
+  WayMap m_map;
+};
+}  // namespace generator