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
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
|
//
// Filename : ViewMapIterators.h
// Author(s) : Stephane Grabli
// Purpose : Iterators used to iterate over the various elements
// of the ViewMap
// Date of creation : 01/07/2003
//
///////////////////////////////////////////////////////////////////////////////
//
// Copyright (C) : Please refer to the COPYRIGHT file distributed
// with this source distribution.
//
// This program is free software; 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 2
// of the License, or (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
//
///////////////////////////////////////////////////////////////////////////////
#ifndef VIEWMAPITERATORS_H
# define VIEWMAPITERATORS_H
#include "ViewMap.h"
#include "../system/Iterator.h" //soc
/**********************************/
/* */
/* */
/* ViewMap */
/* */
/* */
/**********************************/
/**********************************/
/* */
/* */
/* ViewVertex */
/* */
/* */
/**********************************/
namespace ViewVertexInternal{
/*! Class representing an iterator over oriented ViewEdges
* around a ViewVertex. This iterator allows a CCW iteration
* (in the image plane).
* An instance of an orientedViewEdgeIterator can only
* be obtained from a ViewVertex by calling edgesBegin() or edgesEnd().
*/
class orientedViewEdgeIterator : Iterator
{
public:
friend class ViewVertex;
friend class TVertex;
friend class NonTVertex;
friend class ViewEdge;
// FIXME
typedef ::TVertex::edge_pointers_container edge_pointers_container;
typedef ::NonTVertex::edges_container edges_container;
protected:
Nature::VertexNature _Nature; // the nature of the underlying vertex
// T vertex attributes
edge_pointers_container::iterator _tbegin;
edge_pointers_container::iterator _tend;
edge_pointers_container::iterator _tvertex_iter;
// Non TVertex attributes
edges_container::iterator _begin;
edges_container::iterator _end;
edges_container::iterator _nontvertex_iter;
public:
/*! Default constructor */
inline orientedViewEdgeIterator() {}
inline orientedViewEdgeIterator(Nature::VertexNature iNature)
{_Nature = iNature;}
/*! Copy constructor */
orientedViewEdgeIterator(const orientedViewEdgeIterator& iBrother)
{
_Nature = iBrother._Nature;
if(_Nature & Nature::T_VERTEX)
{
_tbegin = iBrother._tbegin;
_tend = iBrother._tend;
_tvertex_iter = iBrother._tvertex_iter;
}
else
{
_begin = iBrother._begin;
_end = iBrother._end;
_nontvertex_iter = iBrother._nontvertex_iter;
}
}
virtual ~orientedViewEdgeIterator() {}
public:
inline orientedViewEdgeIterator(edge_pointers_container::iterator begin,
edge_pointers_container::iterator end,
edge_pointers_container::iterator iter)
{
_Nature = Nature::T_VERTEX;
_tbegin = begin;
_tend = end;
_tvertex_iter = iter;
}
inline orientedViewEdgeIterator(edges_container::iterator begin,
edges_container::iterator end,
edges_container::iterator iter)
{
_Nature = Nature::NON_T_VERTEX;
_begin = begin;
_end = end;
_nontvertex_iter = iter;
}
public:
/*! Tells whether the ViewEdge pointed
* by this iterator is the first one of the
* iteration list or not.
*/
virtual bool isBegin() const
{
if(_Nature & Nature::T_VERTEX)
return (_tvertex_iter == _tbegin);
else
return (_nontvertex_iter == _begin);
}
/*! Tells whether the ViewEdge pointed
* by this iterator is after the last one of the
* iteration list or not.
*/
virtual bool isEnd() const
{
if(_Nature & Nature::T_VERTEX)
return (_tvertex_iter == _tend);
else
return (_nontvertex_iter == _end);
}
// operators
/*! Increments.In the scripting language, call
* "increment()".
*/
virtual orientedViewEdgeIterator& operator++() // operator corresponding to ++i
{
increment();
return *this;
}
/*! Increments.In the scripting language, call
* "increment()".
*/
virtual orientedViewEdgeIterator operator++(int) // opérateur correspondant à i++
{ // c.a.d qui renvoie la valeur *puis* incrémente.
orientedViewEdgeIterator tmp = *this; // C'est pour cela qu'on stocke la valeur
increment(); // dans un temporaire.
return tmp;
}
// comparibility
/*! operator != */
virtual bool operator!=(const orientedViewEdgeIterator& b) const
{
if(_Nature & Nature::T_VERTEX)
return (_tvertex_iter != b._tvertex_iter);
else
return (_nontvertex_iter != b._nontvertex_iter);
}
/*! operator == */
virtual bool operator==(const orientedViewEdgeIterator& b) const
{return !(*this != b);}
// dereferencing
/*! Returns a reference to the pointed orientedViewEdge.
* In the scripting language, you must call
* "getObject()"instead.
*/
virtual ::ViewVertex::directedViewEdge& operator*() const
{
if(_Nature & Nature::T_VERTEX)
//return _tvertex_iter;
return **_tvertex_iter;
else
return (*_nontvertex_iter);
}
/*! Returns a pointer to the pointed orientedViewEdge.
* Can't be called in the scripting language.
*/
virtual ::ViewVertex::directedViewEdge* operator->() const { return &(operator*());}
public:
/*! increments.*/
virtual inline void increment()
{
if(_Nature & Nature::T_VERTEX)
{
::ViewVertex::directedViewEdge tmp = (**_tvertex_iter);
++_tvertex_iter;
if(_tvertex_iter != _tend){
// FIXME : pquoi deja ?
::ViewVertex::directedViewEdge tmp2 = (**_tvertex_iter);
if(tmp2.first == tmp.first)
++_tvertex_iter;
}
}
else
++_nontvertex_iter;
}
};
}
/**********************************/
/* */
/* */
/* ViewEdge */
/* */
/* */
/**********************************/
namespace ViewEdgeInternal {
//
// SVertexIterator
//
/////////////////////////////////////////////////
class SVertexIterator : public Interface0DIteratorNested
{
public:
SVertexIterator() {
_vertex = NULL;
_begin = NULL;
_previous_edge = NULL;
_next_edge = NULL;
_t = 0;
}
SVertexIterator(const SVertexIterator& vi) {
_vertex = vi._vertex;
_begin = vi._begin;
_previous_edge = vi._previous_edge;
_next_edge = vi._next_edge;
_t = vi._t;
}
SVertexIterator(SVertex* v, SVertex* begin, FEdge* prev, FEdge* next, float t) {
_vertex = v;
_begin = begin;
_previous_edge = prev;
_next_edge = next;
_t = t;
}
SVertexIterator& operator=(const SVertexIterator& vi) {
_vertex = vi._vertex;
_begin = vi._begin;
_previous_edge = vi._previous_edge;
_next_edge = vi._next_edge;
_t = vi._t;
return *this;
}
virtual ~SVertexIterator() {}
virtual string getExactTypeName() const {
return "SVertexIterator";
}
virtual SVertex& operator*() {
return *_vertex;
}
virtual SVertex* operator->() {
return &(operator*());
}
virtual SVertexIterator& operator++() {
increment();
return *this;
}
virtual SVertexIterator operator++(int) {
SVertexIterator ret(*this);
increment();
return ret;
}
virtual SVertexIterator& operator--() {
decrement();
return *this;
}
virtual SVertexIterator operator--(int) {
SVertexIterator ret(*this);
decrement();
return ret;
}
virtual void increment(){
if (!_next_edge) {
_vertex = 0;
return;
}
_t += (float)_next_edge->getLength2D();
_vertex = _next_edge->vertexB();
_previous_edge = _next_edge;
_next_edge = _next_edge->nextEdge();
}
virtual void decrement(){
if (!_previous_edge) {
_vertex = 0;
return;
}
if((!_next_edge) && (!_vertex)){
_vertex = _previous_edge->vertexB();
return;
}
_t -= (float)_previous_edge->getLength2D();
_vertex = _previous_edge->vertexA();
_next_edge = _previous_edge;
_previous_edge = _previous_edge->previousEdge();
}
virtual bool isBegin() const {
return _vertex == _begin;
}
virtual bool isEnd() const {
return (!_vertex) || (_vertex == _begin && _previous_edge);
}
virtual float t() const {
return _t;
}
virtual float u() const {
return _t/(float)_next_edge->viewedge()->getLength2D();
}
virtual bool operator==(const Interface0DIteratorNested& it) const {
const SVertexIterator* it_exact = dynamic_cast<const SVertexIterator*>(&it);
if (!it_exact)
return false;
return (_vertex == it_exact->_vertex);
}
virtual SVertexIterator* copy() const {
return new SVertexIterator(*this);
}
private:
SVertex* _vertex;
SVertex* _begin;
FEdge* _previous_edge;
FEdge* _next_edge;
float _t; // curvilinear abscissa
};
//
// ViewEdgeIterator (base class)
//
///////////////////////////////////////////////////////////
/*! Base class for iterators over ViewEdges of the ViewMap Graph.
* Basically the "increment()" operator of this class should
* be able to take the decision of "where" (on which ViewEdge) to go
* when pointing on a given ViewEdge.
* ::Caution::: the dereferencing operator returns a *pointer* to
* the pointed ViewEdge.
*/
class ViewEdgeIterator : Iterator
{
public:
/*! Builds a ViewEdgeIterator from a starting ViewEdge and its orientation.
* \param begin
* The ViewEdge from where to start the iteration.
* \param orientation
* If true, we'll look for the next ViewEdge among the
* ViewEdges that surround the ending ViewVertex of begin.
* If false, we'll search over the ViewEdges surrounding
* the ending ViewVertex of begin.
*/
ViewEdgeIterator(ViewEdge* begin = 0, bool orientation = true) {
_orientation = orientation;
_edge = begin;
_begin = begin;
}
/*! Copy constructor */
ViewEdgeIterator(const ViewEdgeIterator& it) {
_orientation = it._orientation;
_edge = it._edge;
_begin = it._begin;
}
virtual ~ViewEdgeIterator() {}
/*! Returns the string "ViewEdgeIterator" */
virtual string getExactTypeName() const {
return "ViewEdgeIterator";
}
/*! Returns the current pointed ViewEdge. */
ViewEdge* getCurrentEdge() {
return _edge;
}
/*! Sets the current pointed ViewEdge. */
void setCurrentEdge(ViewEdge* edge) {
_edge = edge;
}
/*! Returns the first ViewEdge used for the iteration. */
ViewEdge* getBegin() {
return _begin;
}
/*! Sets the first ViewEdge used for the iteration. */
void setBegin(ViewEdge* begin) {
_begin = begin;
}
/*! Gets the orientation of the pointed ViewEdge in the iteration. */
bool getOrientation() const {
return _orientation;
}
/*! Sets the orientation of the pointed ViewEdge in the iteration. */
void setOrientation(bool orientation) {
_orientation = orientation;
}
/*! Changes the current orientation. */
void changeOrientation() {
_orientation = !_orientation;
}
/*! Returns a *pointer* to the pointed ViewEdge. */
virtual ViewEdge* operator*() {
return _edge;
}
virtual ViewEdge* operator->() {
return operator*();
}
/*! Increments. In the scripting language, call
* "increment()".
*/
virtual ViewEdgeIterator& operator++() {
increment();
return *this;
}
/*! Increments. In the scripting language, call
* "increment()".
*/
virtual ViewEdgeIterator operator++(int) {
ViewEdgeIterator tmp(*this);
increment();
return tmp;
}
/*! increments. */
virtual void increment() {
cerr << "Warning: method increment() not implemented" << endl;
}
/*! Decrements. In the scripting language, call
* "decrement()".
*/
virtual ViewEdgeIterator& operator--() {
decrement();
return *this;
}
/*! Decrements. In the scripting language, call
* "decrement()".
*/
virtual ViewEdgeIterator operator--(int) {
ViewEdgeIterator tmp(*this);
decrement();
return tmp;
}
/*! decrements. */
virtual void decrement(){
cerr << "Warning: method decrement() not implemented" << endl;
}
/*! Returns true if the pointed ViewEdge is the
* first one used for the iteration.
*/
virtual bool isBegin() const {
return _edge == _begin;
}
/*! Returns true if the pointed ViewEdge* equals 0.
*/
virtual bool isEnd() const {
return !_edge;
}
/*! operator == */
virtual bool operator==(ViewEdgeIterator& it) const {
return _edge == it._edge;
}
/*! operator != */
virtual bool operator!=(ViewEdgeIterator& it) const {
return !(*this == it);
}
protected:
bool _orientation;
ViewEdge* _edge;
ViewEdge* _begin;
};
} // end of namespace ViewEdgeInternal
#endif // VIEWMAPITERATORS_H
|