ROSE 0.11.145.147
|
Bidirectional vertex value iterator.
Iterates over the vertex values in a list, returning the user-defined value (type VertexValue) when dereferenced. Vertex iterators are stable across insert and erase operations. The difference between VertexValueIterator and ConstVertexValueIterator is that the latter returns const references when dereferenced.
#include <Sawyer/Graph.h>
Public Types | |
typedef const VertexValue & | Reference |
typedef const VertexValue * | Pointer |
Public Types inherited from Sawyer::Container::Graph< V, E, VKey, EKey, Alloc >::VertexBaseIterator< ConstVertexValueIterator, const VertexValue, const Vertex, VertexList::ConstNodeIterator > | |
using | iterator_category = std::bidirectional_iterator_tag |
using | value_type = const VertexValue |
using | difference_type = std::ptrdiff_t |
using | pointer = const VertexValue * |
using | reference = const VertexValue & |
Additional Inherited Members | |
Protected Member Functions inherited from Sawyer::Container::Graph< V, E, VKey, EKey, Alloc >::VertexBaseIterator< ConstVertexValueIterator, const VertexValue, const Vertex, VertexList::ConstNodeIterator > | |
VertexBaseIterator (const VertexBaseIterator &other) | |
VertexBaseIterator (const VertexList::ConstNodeIterator &base) | |
const Vertex & | dereference () const |
typedef const VertexValue& Sawyer::Container::Graph< V, E, VKey, EKey, Alloc >::ConstVertexValueIterator::Reference |
typedef const VertexValue* Sawyer::Container::Graph< V, E, VKey, EKey, Alloc >::ConstVertexValueIterator::Pointer |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |