Description
template<class V = Nothing, class E = Nothing, class VKey = GraphVertexNoKey<V>, class EKey = GraphEdgeNoKey<E>, class Alloc = DefaultAllocator>
class Sawyer::Container::Graph< V, E, VKey, EKey, Alloc >::ConstEdgeValueIterator
Bidirectional edge value iterator.
Iterates over the edge values in a list, returning the user-defined value (type EdgeValue) when dereferenced. Edge iterators are stable across insert and erase operations. The difference between EdgeValueIterator and ConstEdgeValueIterator is that the latter returns const references when dereferenced.
#include <Graph.h>
Inheritance diagram for Sawyer::Container::Graph< V, E, VKey, EKey, Alloc >::ConstEdgeValueIterator:
Collaboration diagram for Sawyer::Container::Graph< V, E, VKey, EKey, Alloc >::ConstEdgeValueIterator:
Public Member Functions | |
| ConstEdgeValueIterator (const ConstEdgeValueIterator &other) | |
| ConstEdgeValueIterator (const EdgeValueIterator &other) | |
| ConstEdgeValueIterator (const EdgeIterator &other) | |
| ConstEdgeValueIterator (const ConstEdgeIterator &other) | |
| const EdgeValue & | operator* () const |
| const EdgeValue * | operator-> () const |
 Public Member Functions inherited from Sawyer::Container::Graph< V, E, VKey, EKey, Alloc >::EdgeBaseIterator< ConstEdgeValueIterator, const EdgeValue, const Edge, EdgeList::ConstNodeIterator, const VirtualList< Edge > > | |
| ConstEdgeValueIterator & | operator= (const ConstEdgeValueIterator &other) |
| Assignment. | |
| bool | isEmpty () const |
| True if iterator doesn't point to anything. | |
| ConstEdgeValueIterator & | operator++ () |
| Increment. More... | |
| ConstEdgeValueIterator | operator++ (int) |
| Increment. More... | |
| ConstEdgeValueIterator & | operator-- () |
| Decrement. More... | |
| ConstEdgeValueIterator | operator-- (int) |
| Decrement. More... | |
| bool | operator== (const OtherIter &other) const |
| Equality predicate. More... | |
| bool | operator!= (const OtherIter &other) const |
| Equality predicate. More... | |
Public Attributes | |
| const typedef EdgeValue & | Reference |
| const typedef EdgeValue * | Pointer |
Additional Inherited Members | |
| Public Types inherited from Sawyer::Container::Graph< V, E, VKey, EKey, Alloc >::EdgeBaseIterator< ConstEdgeValueIterator, const EdgeValue, const Edge, EdgeList::ConstNodeIterator, const VirtualList< Edge > > | |
| using | iterator_category = std::bidirectional_iterator_tag |
| using | value_type = const EdgeValue |
| using | difference_type = std::ptrdiff_t |
| using | pointer = const EdgeValue * |
| using | reference = const EdgeValue & |
| Protected Member Functions inherited from Sawyer::Container::Graph< V, E, VKey, EKey, Alloc >::EdgeBaseIterator< ConstEdgeValueIterator, const EdgeValue, const Edge, EdgeList::ConstNodeIterator, const VirtualList< Edge > > | |
| EdgeBaseIterator (const EdgeBaseIterator &other) | |
| EdgeBaseIterator (const EdgeList::ConstNodeIterator &iter) | |
| EdgeBaseIterator (EdgePhase phase, const VirtualList< Edge > *vlist) | |
| EdgeBaseIterator (EdgePhase phase, const BaseIter2 &iter, const VirtualList< Edge > *vlist) | |
| const Edge & | dereference () const |
The documentation for this class was generated from the following file:
