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
|
// 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_VIEWS_DETAIL_POINTS_VIEW_HPP
#define BOOST_GEOMETRY_VIEWS_DETAIL_POINTS_VIEW_HPP
#include <boost/range.hpp>
#include <boost/iterator.hpp>
#include <boost/iterator/iterator_facade.hpp>
#include <boost/iterator/iterator_categories.hpp>
#include <boost/geometry/core/exception.hpp>
namespace boost { namespace geometry
{
namespace detail
{
// Adapts pointer, on points, to a Boost.Range
template <typename Point, int MaxSize>
class points_view
{
// Iterates over a series of points (indicated by pointer
// to have it lightweight). Probably there is already an
// equivalent of this within Boost. If so, TODO: use that one.
// This used to be "box_iterator" and "segment_iterator".
struct points_iterator
: public boost::iterator_facade
<
points_iterator,
Point const,
boost::random_access_traversal_tag
>
{
// Constructor: Begin iterator
inline points_iterator(Point const* p)
: m_points(p)
, m_index(0)
{}
// Constructor: End iterator
inline points_iterator(Point const* p, bool)
: m_points(p)
, m_index(MaxSize)
{}
// Constructor: default (for Range Concept checking).
inline points_iterator()
: m_points(NULL)
, m_index(MaxSize)
{}
typedef std::ptrdiff_t difference_type;
private:
friend class boost::iterator_core_access;
inline Point const& dereference() const
{
if (m_index >= 0 && m_index < MaxSize)
{
return m_points[m_index];
}
// If it index larger (or smaller) return first point
// (assuming initialized)
return m_points[0];
}
inline bool equal(points_iterator const& other) const
{
return other.m_index == this->m_index;
}
inline void increment()
{
m_index++;
}
inline void decrement()
{
m_index--;
}
inline difference_type distance_to(points_iterator const& other) const
{
return other.m_index - this->m_index;
}
inline void advance(difference_type n)
{
m_index += n;
}
Point const* m_points;
int m_index;
};
public :
typedef points_iterator const_iterator;
typedef points_iterator iterator; // must be defined
const_iterator begin() const { return const_iterator(m_points); }
const_iterator end() const { return const_iterator(m_points, true); }
// It may NOT be used non-const, so commented:
//iterator begin() { return m_begin; }
//iterator end() { return m_end; }
protected :
template <typename CopyPolicy>
explicit points_view(CopyPolicy const& copy)
{
copy.apply(m_points);
}
private :
// Copy points here - box might define them otherwise
Point m_points[MaxSize];
};
}
}} // namespace boost::geometry
#endif // BOOST_GEOMETRY_VIEWS_DETAIL_POINTS_VIEW_HPP
|
