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
|
/*
* Skeleton_blockers_blockers_iterators.h
*
* Created on: Aug 25, 2014
* Author: dsalinas
*/
#ifndef GUDHI_SKELETON_BLOCKERS_BLOCKERS_ITERATORS_H_
#define GUDHI_SKELETON_BLOCKERS_BLOCKERS_ITERATORS_H_
#include "boost/iterator/iterator_facade.hpp"
namespace Gudhi{
namespace skbl {
/**
* @brief Iterator through the blockers of a vertex.
*/
// ReturnType = const Simplex_handle* or Simplex_handle*
// MapIteratorType = BlockerMapConstIterator or BlockerMapIterator
template<typename MapIteratorType, typename ReturnType>
class Blocker_iterator_internal : public boost::iterator_facade<
Blocker_iterator_internal<MapIteratorType,ReturnType>,
ReturnType,
boost::forward_traversal_tag,
ReturnType
>{
private:
MapIteratorType current_position;
MapIteratorType end_of_map;
public:
Blocker_iterator_internal():current_position(){}
Blocker_iterator_internal(MapIteratorType position,MapIteratorType end_of_map_ ):
current_position(position), end_of_map(end_of_map_)
{ }
bool equal(const Blocker_iterator_internal& other) const{
return current_position == other.current_position;
}
void increment(){
goto_next_blocker();
}
ReturnType dereference() const {
return(current_position->second);
}
private:
/**
* Let the current pair be (v,sigma) where v is a vertex and sigma is a blocker.
* If v is not the first vertex of sigma then we already have seen sigma as a blocker
* and we look for the next one.
*/
void goto_next_blocker(){
do {
++current_position;
} while (!(current_position == end_of_map) && !first_time_blocker_is_seen());
}
bool first_time_blocker_is_seen() const{
return current_position->first == current_position->second->first_vertex();
}
};
/**
* @brief Iterator through the blockers of a vertex
*/
// ReturnType = const Simplex_handle* or Simplex_handle*
// MapIteratorType = BlockerMapConstIterator or BlockerMapIterator
template<typename MapIteratorType, typename ReturnType>
class Blocker_iterator_around_vertex_internal : public boost::iterator_facade<
Blocker_iterator_around_vertex_internal<MapIteratorType,ReturnType>,
ReturnType,
boost::forward_traversal_tag,
ReturnType
>{
private:
MapIteratorType current_position_;
public:
Blocker_iterator_around_vertex_internal():current_position_(){}
Blocker_iterator_around_vertex_internal(MapIteratorType position):
current_position_(position)
{}
Blocker_iterator_around_vertex_internal& operator=(Blocker_iterator_around_vertex_internal other){
this->current_position_ = other.current_position_;
return *this;
}
bool equal(const Blocker_iterator_around_vertex_internal& other) const{
return current_position_ == other.current_position_;
}
void increment(){
current_position_++;
}
ReturnType dereference() const{
return(current_position_->second);
}
MapIteratorType current_position(){
return this->current_position_;
}
};
}
} // namespace GUDHI
#endif /* GUDHI_SKELETON_BLOCKERS_BLOCKERS_ITERATORS_H_ */
|
