| // Boost.Geometry (aka GGL, Generic Geometry Library) |
| |
| // Copyright (c) 2007-2011 Barend Gehrels, Amsterdam, the Netherlands. |
| // Copyright (c) 2008-2011 Bruno Lalande, Paris, France. |
| // Copyright (c) 2009-2011 Mateusz Loskot, London, UK. |
| |
| // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library |
| // (geolib/GGL), copyright (c) 1995-2010 Geodan, 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_UNIQUE_HPP |
| #define BOOST_GEOMETRY_ALGORITHMS_UNIQUE_HPP |
| |
| #include <algorithm> |
| |
| #include <boost/range.hpp> |
| #include <boost/typeof/typeof.hpp> |
| |
| #include <boost/geometry/core/interior_rings.hpp> |
| #include <boost/geometry/core/mutable_range.hpp> |
| #include <boost/geometry/geometries/concepts/check.hpp> |
| #include <boost/geometry/policies/compare.hpp> |
| |
| |
| namespace boost { namespace geometry |
| { |
| |
| |
| #ifndef DOXYGEN_NO_DETAIL |
| namespace detail { namespace unique |
| { |
| |
| |
| template <typename Range, typename ComparePolicy> |
| struct range_unique |
| { |
| static inline void apply(Range& range, ComparePolicy const& policy) |
| { |
| typename boost::range_iterator<Range>::type it |
| = std::unique |
| ( |
| boost::begin(range), |
| boost::end(range), |
| policy |
| ); |
| |
| traits::resize<Range>::apply(range, it - boost::begin(range)); |
| } |
| }; |
| |
| |
| template <typename Polygon, typename ComparePolicy> |
| struct polygon_unique |
| { |
| static inline void apply(Polygon& polygon, ComparePolicy const& policy) |
| { |
| typedef typename geometry::ring_type<Polygon>::type ring_type; |
| |
| typedef range_unique<ring_type, ComparePolicy> per_range; |
| per_range::apply(exterior_ring(polygon), policy); |
| |
| typename interior_return_type<Polygon>::type rings |
| = interior_rings(polygon); |
| for (BOOST_AUTO_TPL(it, boost::begin(rings)); it != boost::end(rings); ++it) |
| { |
| per_range::apply(*it, policy); |
| } |
| } |
| }; |
| |
| |
| |
| }} // namespace detail::unique |
| #endif // DOXYGEN_NO_DETAIL |
| |
| |
| |
| #ifndef DOXYGEN_NO_DISPATCH |
| namespace dispatch |
| { |
| |
| |
| template |
| < |
| typename Tag, |
| typename Geometry, |
| typename ComparePolicy |
| > |
| struct unique |
| { |
| static inline void apply(Geometry&, ComparePolicy const& ) |
| {} |
| }; |
| |
| |
| template <typename Ring, typename ComparePolicy> |
| struct unique<ring_tag, Ring, ComparePolicy> |
| : detail::unique::range_unique<Ring, ComparePolicy> |
| {}; |
| |
| |
| template <typename LineString, typename ComparePolicy> |
| struct unique<linestring_tag, LineString, ComparePolicy> |
| : detail::unique::range_unique<LineString, ComparePolicy> |
| {}; |
| |
| |
| template <typename Polygon, typename ComparePolicy> |
| struct unique<polygon_tag, Polygon, ComparePolicy> |
| : detail::unique::polygon_unique<Polygon, ComparePolicy> |
| {}; |
| |
| |
| } // namespace dispatch |
| #endif |
| |
| |
| /*! |
| \brief \brief_calc{minimal set} |
| \ingroup unique |
| \details \details_calc{unique,minimal set (where duplicate consecutive points are removed)}. |
| \tparam Geometry \tparam_geometry |
| \param geometry \param_geometry which will be made unique |
| |
| \qbk{[include reference/algorithms/unique.qbk]} |
| */ |
| template <typename Geometry> |
| inline void unique(Geometry& geometry) |
| { |
| concept::check<Geometry>(); |
| |
| // Default strategy is the default point-comparison policy |
| typedef geometry::equal_to |
| < |
| typename geometry::point_type<Geometry>::type |
| > policy; |
| |
| |
| dispatch::unique |
| < |
| typename tag<Geometry>::type, |
| Geometry, |
| policy |
| >::apply(geometry, policy()); |
| } |
| |
| }} // namespace boost::geometry |
| |
| |
| #endif // BOOST_GEOMETRY_ALGORITHMS_UNIQUE_HPP |