/usr/include/boost/geometry/algorithms
Edit: /usr/include/boost/geometry/algorithms/unique.hpp (4682B)
// Boost.Geometry (aka GGL, Generic Geometry Library)
// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2014 Adam Wulkiewicz, Lodz, Poland.
// 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
#include
#include
#include
#include
#include
#include
#include
#include
namespace boost { namespace geometry
{
#ifndef DOXYGEN_NO_DETAIL
namespace detail { namespace unique
{
struct range_unique
{
template
static inline void apply(Range& range, ComparePolicy const& policy)
{
typename boost::range_iterator::type it
= std::unique
(
boost::begin(range),
boost::end(range),
policy
);
traits::resize::apply(range, it - boost::begin(range));
}
};
struct polygon_unique
{
template
static inline void apply(Polygon& polygon, ComparePolicy const& policy)
{
range_unique::apply(exterior_ring(polygon), policy);
typename interior_return_type::type
rings = interior_rings(polygon);
for (typename detail::interior_iterator::type
it = boost::begin(rings); it != boost::end(rings); ++it)
{
range_unique::apply(*it, policy);
}
}
};
template
struct multi_unique
{
template
static inline void apply(MultiGeometry& multi, ComparePolicy const& compare)
{
for (typename boost::range_iterator::type
it = boost::begin(multi);
it != boost::end(multi);
++it)
{
Policy::apply(*it, compare);
}
}
};
}} // namespace detail::unique
#endif // DOXYGEN_NO_DETAIL
#ifndef DOXYGEN_NO_DISPATCH
namespace dispatch
{
template
<
typename Geometry,
typename Tag = typename tag::type
>
struct unique
{
template
static inline void apply(Geometry&, ComparePolicy const& )
{}
};
template
struct unique
: detail::unique::range_unique
{};
template
struct unique
: detail::unique::range_unique
{};
template
struct unique
: detail::unique::polygon_unique
{};
// For points, unique is not applicable and does nothing
// (Note that it is not "spatially unique" but that it removes duplicate coordinates,
// like std::unique does). Spatially unique is "dissolve" which can (or will be)
// possible for multi-points as well, removing points at the same location.
template
struct unique
: detail::unique::multi_unique
{};
template
struct unique
: detail::unique::multi_unique
{};
} // 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
inline void unique(Geometry& geometry)
{
concepts::check();
// Default strategy is the default point-comparison policy
typedef geometry::equal_to
<
typename geometry::point_type::type
> policy;
dispatch::unique::apply(geometry, policy());
}
}} // namespace boost::geometry
#endif // BOOST_GEOMETRY_ALGORITHMS_UNIQUE_HPP