Iterator on the graph's vertices. More...
#include <graph.hpp>
Public Types | |
typedef const vertex_type | value_type |
typedef const vertex_type & | reference |
typedef const vertex_type *const | pointer |
typedef ptrdiff_t | difference_type |
typedef std::bidirectional_iterator_tag | iterator_category |
Public Member Functions | |
graph_vertex_iterator () | |
Constructor of the graph_vertex_iterator class. | |
graph_vertex_iterator & | operator++ () |
Preincrement. | |
graph_vertex_iterator | operator++ (int) |
Postincrement. | |
graph_vertex_iterator & | operator-- () |
Predecrement. | |
graph_vertex_iterator | operator-- (int) |
Postdecrement. | |
reference | operator* () const |
Dereference. | |
pointer | operator-> () const |
Reference. | |
bool | operator== (const graph_vertex_iterator &it) const |
Equality. | |
bool | operator!= (const graph_vertex_iterator &it) const |
Difference. | |
Private Member Functions | |
graph_vertex_iterator (typename graph_content::const_iterator it) | |
Constructor with an iterator on graph class data. | |
Private Attributes | |
graph_content::const_iterator | m_iterator |
Iterator on the list of vertex. | |
Friends | |
class | graph< vertex_type, edge_type, vertex_compare > |
Iterator on the graph's vertices.
Definition at line 104 of file graph.hpp.
typedef ptrdiff_t claw::graph< S, A, Comp >::graph_vertex_iterator::difference_type |
typedef std::bidirectional_iterator_tag claw::graph< S, A, Comp >::graph_vertex_iterator::iterator_category |
typedef const vertex_type* const claw::graph< S, A, Comp >::graph_vertex_iterator::pointer |
typedef const vertex_type& claw::graph< S, A, Comp >::graph_vertex_iterator::reference |
typedef const vertex_type claw::graph< S, A, Comp >::graph_vertex_iterator::value_type |
claw::graph< S, A, Comp >::graph_vertex_iterator::graph_vertex_iterator | ( | ) | [inline] |
Constructor of the graph_vertex_iterator class.
claw::graph< S, A, Comp >::graph_vertex_iterator::graph_vertex_iterator | ( | typename graph_content::const_iterator | it | ) | [inline, explicit, private] |
Constructor with an iterator on graph class data.
it | Iterator where scan starts. |
Definition at line 198 of file graph.tpp.
00199 : m_iterator(it) 00200 { 00201 00202 } // graph_vertex_iterator() [constructor on an iterator]
bool claw::graph< S, A, Comp >::graph_vertex_iterator::operator!= | ( | const graph_vertex_iterator & | it | ) | const [inline] |
Difference.
it | Iterator to compare to. |
Definition at line 186 of file graph.tpp.
00187 { 00188 return m_iterator != it.m_iterator; 00189 } // operator!=()
claw::graph< S, A, Comp >::graph_vertex_iterator::reference claw::graph< S, A, Comp >::graph_vertex_iterator::operator* | ( | ) | const [inline] |
Dereference.
Definition at line 148 of file graph.tpp.
References claw::graph< S, A, Comp >::graph_vertex_iterator::m_iterator.
00149 { 00150 return m_iterator->first; 00151 } // operator*()
claw::graph< S, A, Comp >::graph_vertex_iterator claw::graph< S, A, Comp >::graph_vertex_iterator::operator++ | ( | int | ) | [inline] |
Postincrement.
Definition at line 107 of file graph.tpp.
References claw::graph< S, A, Comp >::graph_vertex_iterator::m_iterator.
00108 { 00109 graph_vertex_iterator it_tmp(*this); 00110 m_iterator++; 00111 return *this; 00112 } // operator++() [postincrement]
claw::graph< S, A, Comp >::graph_vertex_iterator & claw::graph< S, A, Comp >::graph_vertex_iterator::operator++ | ( | ) | [inline] |
Preincrement.
Definition at line 94 of file graph.tpp.
References claw::graph< S, A, Comp >::graph_vertex_iterator::m_iterator.
00095 { 00096 ++m_iterator; 00097 return *this; 00098 } // operator++() [preincrement]
claw::graph< S, A, Comp >::graph_vertex_iterator claw::graph< S, A, Comp >::graph_vertex_iterator::operator-- | ( | int | ) | [inline] |
Postdecrement.
Definition at line 134 of file graph.tpp.
References claw::graph< S, A, Comp >::graph_vertex_iterator::m_iterator.
00135 { 00136 graph_vertex_iterator it_tmp(*this); 00137 m_iterator--; 00138 return it_tmp; 00139 } // operator--() [postdecrement]
claw::graph< S, A, Comp >::graph_vertex_iterator & claw::graph< S, A, Comp >::graph_vertex_iterator::operator-- | ( | ) | [inline] |
Predecrement.
Definition at line 121 of file graph.tpp.
References claw::graph< S, A, Comp >::graph_vertex_iterator::m_iterator.
00122 { 00123 --m_iterator; 00124 return *this; 00125 } // operator--() [predecrement]
claw::graph< S, A, Comp >::graph_vertex_iterator::pointer claw::graph< S, A, Comp >::graph_vertex_iterator::operator-> | ( | ) | const [inline] |
Reference.
Definition at line 160 of file graph.tpp.
References claw::graph< S, A, Comp >::graph_vertex_iterator::m_iterator.
00161 { 00162 return &(m_iterator->first); 00163 } // operator->()
bool claw::graph< S, A, Comp >::graph_vertex_iterator::operator== | ( | const graph_vertex_iterator & | it | ) | const [inline] |
Equality.
it | Iterator to compare to. |
Definition at line 173 of file graph.tpp.
00174 { 00175 return m_iterator == it.m_iterator; 00176 } // operator==()
friend class graph< vertex_type, edge_type, vertex_compare > [friend] |
graph_content::const_iterator claw::graph< S, A, Comp >::graph_vertex_iterator::m_iterator [private] |
Iterator on the list of vertex.
Definition at line 134 of file graph.hpp.
Referenced by claw::graph< S, A, Comp >::graph_vertex_iterator::operator*(), claw::graph< S, A, Comp >::graph_vertex_iterator::operator++(), claw::graph< S, A, Comp >::graph_vertex_iterator::operator--(), and claw::graph< S, A, Comp >::graph_vertex_iterator::operator->().