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
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
|
// Copyright (c) 1997 INRIA Sophia-Antipolis (France).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org).
// You can redistribute it and/or modify it under the terms of the GNU
// General Public License as published by the Free Software Foundation,
// either version 3 of the License, or (at your option) any later version.
//
// 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/next/Triangulation_2/include/CGAL/Triangulation_ds_iterators_2.h $
// $Id: Triangulation_ds_iterators_2.h 67117 2012-01-13 18:14:48Z lrineau $
//
//
// Author(s) : Mariette Yvinec
#ifndef CGAL_TRIANGULATION_DS_ITERATORS_2_H
#define CGAL_TRIANGULATION_DS_ITERATORS_2_H
#include <iterator>
#include <CGAL/triangulation_assertions.h>
//#include <CGAL/Triangulation_iterator_adaptator.h>
namespace CGAL {
template <class Tds>
class Triangulation_ds_edge_iterator_2
{
public:
typedef typename Tds::Edge Edge;
typedef typename Tds::Face_iterator Face_iterator;
typedef typename Tds::Face_handle Face_handle;
typedef Edge value_type;
typedef Edge* pointer;
typedef Edge& reference;
typedef std::size_t size_type;
typedef std::ptrdiff_t difference_type;
typedef std::bidirectional_iterator_tag iterator_category;
typedef Triangulation_ds_edge_iterator_2<Tds> Edge_iterator;
private:
const Tds* _tds;
Face_iterator pos;
mutable Edge edge;
public:
Triangulation_ds_edge_iterator_2() {}
Triangulation_ds_edge_iterator_2(const Tds * tds);
Triangulation_ds_edge_iterator_2(const Tds* tds, int );
bool operator==(const Edge_iterator& fi) const ;
bool operator!=(const Edge_iterator& fi) const {return !(*this== fi);}
Edge_iterator& operator++();
Edge_iterator& operator--();
Edge_iterator operator++(int);
Edge_iterator operator--(int);
Edge* operator->() const;
Edge& operator*() const ;
private:
void increment();
void decrement();
bool associated_edge();
};
// Edge iterator implementation
template<class Tds>
Triangulation_ds_edge_iterator_2<Tds> ::
Triangulation_ds_edge_iterator_2(const Tds * tds)
: _tds(tds)
{
edge.second = 0;
if (_tds->dimension()<= 0) {
pos = _tds->faces().end(); // there is no edge
return;
}
pos = _tds->faces().begin();
if (_tds->dimension() == 1) edge.second = 2;
while ( pos != _tds->faces().end()
&& !associated_edge() ) increment();
}
template<class Tds>
Triangulation_ds_edge_iterator_2<Tds> ::
Triangulation_ds_edge_iterator_2(const Tds * tds, int )
: _tds(tds)
{
pos = tds->faces().end();
edge.second = 0;
if (_tds->dimension() == 1) {edge.second = 2;}
}
template<class Tds>
inline
bool
Triangulation_ds_edge_iterator_2<Tds> ::
operator==(const Edge_iterator& fi) const
{
return _tds == fi._tds && pos == fi.pos && edge.second == fi.edge.second;
}
template<class Tds>
inline
void
Triangulation_ds_edge_iterator_2<Tds> ::
increment()
{
CGAL_triangulation_precondition(_tds->dimension() >= 1);
if (_tds->dimension() == 1) ++pos;
else if (edge.second == 2) {edge.second = 0; ++pos;}
else edge.second += 1;
return;
}
template<class Tds>
inline
void
Triangulation_ds_edge_iterator_2<Tds> ::
decrement()
{
CGAL_triangulation_precondition(_tds->dimension() >= 1);
if (_tds->dimension() == 1) --pos;
else if (edge.second == 0) { edge.second = 2; --pos;}
else edge.second -= 1;
return;
}
template<class Tds>
inline
bool
Triangulation_ds_edge_iterator_2<Tds> ::
associated_edge()
{
if (_tds->dimension() == 1) {return true;}
return Face_handle(pos) < pos->neighbor(edge.second);
}
template<class Tds>
inline
Triangulation_ds_edge_iterator_2<Tds>&
Triangulation_ds_edge_iterator_2<Tds> ::
operator++()
{
//CGAL_triangulation_precondition(pos != Iterator_base() &&
// pos != _tds->faces().end());
do increment();
while( pos != _tds->faces().end() && !associated_edge());
return *this;
}
template<class Tds>
inline
Triangulation_ds_edge_iterator_2<Tds>&
Triangulation_ds_edge_iterator_2<Tds> ::
operator--()
{
// CGAL_triangulation_precondition(pos != Iterator_base()
// && *this != Edge_iterator(_tds));
do decrement();
while ( !associated_edge() && *this != Edge_iterator(_tds) );
return *this;
}
template<class Tds>
inline
Triangulation_ds_edge_iterator_2<Tds>
Triangulation_ds_edge_iterator_2<Tds> ::
operator++(int)
{
Edge_iterator tmp(*this);
++(*this);
return tmp;
}
template<class Tds>
inline
Triangulation_ds_edge_iterator_2<Tds>
Triangulation_ds_edge_iterator_2<Tds> ::
operator--(int)
{
Edge_iterator tmp(*this);
--(*this);
return tmp;
}
template<class Tds>
inline
typename Triangulation_ds_edge_iterator_2<Tds>::Edge*
Triangulation_ds_edge_iterator_2<Tds> ::
operator->() const
{
edge.first = pos;
return &edge;
}
template<class Tds>
inline
typename Triangulation_ds_edge_iterator_2<Tds>::Edge&
Triangulation_ds_edge_iterator_2<Tds> ::
operator*() const
{
edge.first = pos;
return edge;
}
} //namespace CGAL
#endif //CGAL_TRIANGULATION_DS_ITERATORS_2_H
|
