1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
// 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.
// 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
|
