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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
|
// Copyright (c) 2005 Tel-Aviv University (Israel).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you may redistribute it under
// the terms of the Q Public License version 1.0.
// See the file LICENSE.QPL distributed with CGAL.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/CGAL-3.5-branch/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Polygon_2_curve_iterator.h $
// $Id: Polygon_2_curve_iterator.h 28831 2006-02-27 14:28:18Z baruchzu $
//
//
// Author(s) : Baruch Zukerman <baruchzu@post.tau.ac.il>
#ifndef CGAL_CGAL_POLYGON_2_CURVE_ITERATOR_H
#define CGAL_CGAL_POLYGON_2_CURVE_ITERATOR_H
#include <iterator>
CGAL_BEGIN_NAMESPACE
template <class Xcurve>
class Polygon_2_curve_ptr
{
public:
typedef Xcurve X_monotnoe_curve_2;
Polygon_2_curve_ptr(X_monotnoe_curve_2 const &c) :m_curve(c){}
X_monotnoe_curve_2* operator->() {return &m_curve;}
private:
X_monotnoe_curve_2 m_curve;
};
template <class X_monotone_curve_2_, class Polygon_>
class Polygon_2_curve_iterator
{
public:
typedef Polygon_2_curve_iterator< X_monotone_curve_2_, Polygon_ > Self;
typedef X_monotone_curve_2_ X_monotone_curve_2;
typedef typename Polygon_::Container Container;
typedef typename Container::iterator Container_iterator;
typedef typename std::iterator_traits<Container_iterator>::iterator_category
iterator_category;
typedef X_monotone_curve_2 value_type;
typedef X_monotone_curve_2* pointer;
typedef X_monotone_curve_2& reference;
typedef Polygon_ Polygon;
typedef typename Polygon::Edge_const_iterator Edge_const_iterator;
typedef typename Edge_const_iterator::difference_type difference_type;
private:
const Polygon* m_pgn; // needed for dereferencing the last edge
Edge_const_iterator m_curr_edge; // points to the current edge iterator
public:
Polygon_2_curve_iterator< X_monotone_curve_2_, Polygon_ >(){}
Polygon_2_curve_iterator< X_monotone_curve_2_, Polygon_ >
(const Polygon* pgn, Edge_const_iterator ci) : m_pgn(pgn),
m_curr_edge(ci) {}
bool operator==(const Self& x) const
{
return (m_curr_edge == x.m_curr_edge);
}
bool operator!=(const Self& x) const
{
return !(m_curr_edge == x.m_curr_edge);
}
X_monotone_curve_2 operator*()
{
return X_monotone_curve_2(*m_curr_edge);
}
Polygon_2_curve_ptr<X_monotone_curve_2> operator->()
{
return Polygon_2_curve_ptr<X_monotone_curve_2>(operator*());
}
Self& operator++()
{
++m_curr_edge;
return *this;
}
Self operator++(int)
{
Self tmp = *this;
++*this;
return tmp;
}
Self& operator--()
{
--m_curr_edge;
return *this;
}
Self operator--(int) {
Self tmp = *this;
--*this;
return tmp;
}
// random access iterator requirements
Self& operator+=(difference_type n)
{
m_curr_edge += n;
return *this;
}
Self operator+(difference_type n)
{
return Self(m_pgn, m_curr_edge + n);
}
Self& operator-=(difference_type n)
{
return (*this) -= n;
}
Self operator-(difference_type n)
{
return Self(m_pgn, m_curr_edge - n);
}
difference_type operator-(const Self& a) const
{
return (const_cast<Edge_const_iterator&>(m_curr_edge) - a.m_curr_edge);
}
X_monotone_curve_2 operator[](int n)
{
return *Self(m_pgn, m_curr_edge+n);
}
bool operator<(const Self& a)
{
return m_curr_edge < a.m_curr_edge;
}
bool operator>(const Self& a)
{
return m_curr_edge > a.m_curr_edge;
}
bool operator<=(const Self& a)
{
return m_curr_edge <= a.m_curr_edge;
}
bool operator>=(const Self& a)
{
return m_curr_edge >= a.m_curr_edge;
}
};
template <class X_monotone_curve_2_, class Polygon_>
typename Polygon_2_curve_iterator<X_monotone_curve_2_,Polygon_>::difference_type
distance_type(const Polygon_2_curve_iterator<X_monotone_curve_2_,Polygon_>&)
{
return Polygon_2_curve_iterator<X_monotone_curve_2_,Polygon_>::difference_type();
}
template <class X_monotone_curve_2_, class Polygon_>
X_monotone_curve_2_*
value_type(const Polygon_2_curve_iterator<X_monotone_curve_2_,Polygon_>&)
{
return (X_monotone_curve_2_*)(0);
}
CGAL_END_NAMESPACE
#endif
|
