ROSE
0.11.82.0
|
Bidirectional vertex node iterator.
Iterates over the vertex nodes in a list, returning the Vertex when dereferenced. Vertex iterators are stable across insert and erase operations. The difference between VertexIterator and ConstVertexIterator is that the latter returns const references when dereferenced. A VertexIterator can be impliciatly converted to a ConstVertexIterator, VertexValueIterator, or ConstVertexValueIterator.
#include <util/Sawyer/Graph.h>
Public Types | |
typedef Vertex & | Reference |
typedef Vertex * | Pointer |
Public Member Functions | |
VertexIterator (const VertexIterator &other) | |
Vertex & | operator* () const |
Vertex * | operator-> () const |
![]() | |
VertexIterator & | operator= (const VertexIterator &other) |
Assignment. More... | |
bool | isEmpty () const |
True if iterator doesn't point to anything. More... | |
VertexIterator & | operator++ () |
Increment. More... | |
VertexIterator | operator++ (int) |
Increment. More... | |
VertexIterator & | operator-- () |
Decrement. More... | |
VertexIterator | operator-- (int) |
Decrement. More... | |
bool | operator== (const OtherIter &other) const |
Equality predicate. More... | |
bool | operator!= (const OtherIter &other) const |
Equality predicate. More... | |
Additional Inherited Members | |
![]() | |
VertexBaseIterator (const VertexBaseIterator &other) | |
VertexBaseIterator (const VertexList::NodeIterator &base) | |
Vertex & | dereference () const |