1 files changed, 100 insertions, 0 deletions
diff --git a/boost/geometry/algorithms/detail/overlay/aggregate_operations.hpp b/boost/geometry/algorithms/detail/overlay/aggregate_operations.hpp
new file mode 100644
index 0000000000..df62a1f2f6
--- /dev/null
+++ b/boost/geometry/algorithms/detail/overlay/aggregate_operations.hpp
@@ -0,0 +1,100 @@
+// Boost.Geometry (aka GGL, Generic Geometry Library)
+
+// Copyright (c) 2016 Barend Gehrels, Amsterdam, the Netherlands.
+
+// Use, modification and distribution is subject to the Boost Software License,
+// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+#ifndef BOOST_GEOMETRY_ALGORITHMS_DETAIL_OVERLAY_AGGREGATE_OPERATIONS_HPP
+#define BOOST_GEOMETRY_ALGORITHMS_DETAIL_OVERLAY_AGGREGATE_OPERATIONS_HPP
+
+#include <set>
+
+#include <boost/geometry/algorithms/detail/overlay/sort_by_side.hpp>
+
+namespace boost { namespace geometry
+{
+
+#ifndef DOXYGEN_NO_DETAIL
+namespace detail { namespace overlay { namespace sort_by_side
+{
+
+struct ring_with_direction
+{
+    ring_identifier ring_id;
+    direction_type direction;
+    bool only_turn_on_ring;
+
+
+    inline bool operator<(ring_with_direction const& other) const
+    {
+        return this->ring_id != other.ring_id
+                ? this->ring_id < other.ring_id
+                : this->direction < other.direction;
+    }
+
+    ring_with_direction()
+        : direction(dir_unknown)
+        , only_turn_on_ring(false)
+    {}
+};
+
+struct rank_with_rings
+{
+    std::size_t rank;
+    std::set<ring_with_direction> rings;
+
+    rank_with_rings()
+        : rank(0)
+    {
+    }
+
+    inline bool all_to() const
+    {
+        for (std::set<ring_with_direction>::const_iterator it = rings.begin();
+             it != rings.end(); ++it)
+        {
+            if (it->direction == sort_by_side::dir_from)
+            {
+                return false;
+            }
+        }
+        return true;
+    }
+};
+
+template <typename Sbs>
+inline void aggregate_operations(Sbs const& sbs, std::vector<rank_with_rings>& aggregation)
+{
+    aggregation.clear();
+    for (std::size_t i = 0; i < sbs.m_ranked_points.size(); i++)
+    {
+        typename Sbs::rp const& ranked_point = sbs.m_ranked_points[i];
+
+        if (aggregation.empty() || aggregation.back().rank != ranked_point.rank)
+        {
+            rank_with_rings current;
+            current.rank = ranked_point.rank;
+            aggregation.push_back(current);
+        }
+
+        ring_with_direction rwd;
+        segment_identifier const& sid = ranked_point.seg_id;
+        rwd.ring_id = ring_identifier(sid.source_index, sid.multi_index, sid.ring_index);
+        rwd.direction = ranked_point.direction;
+        rwd.only_turn_on_ring = ranked_point.only_turn_on_ring;
+
+
+        aggregation.back().rings.insert(rwd);
+    }
+}
+
+
+}}} // namespace detail::overlay::sort_by_side
+#endif //DOXYGEN_NO_DETAIL
+
+
+}} // namespace boost::geometry
+
+#endif // BOOST_GEOMETRY_ALGORITHMS_DETAIL_OVERLAY_AGGREGATE_OPERATIONS_HPP