Description
template<class V = Nothing, class E = Nothing, class VKey = GraphVertexNoKey<V>, class EKey = GraphEdgeNoKey<E>, class Alloc = DefaultAllocator>
template<class Derived, class Value, class Node, class BaseIter, class VList>
class Sawyer::Container::Graph< V, E, VKey, EKey, Alloc >::EdgeBaseIterator< Derived, Value, Node, BaseIter, VList >
Base class for edge iterators.
This isn't normally used directly by users except for its public methods inherited by subclasses.
#include <util/Sawyer/Graph.h>
Inheritance diagram for Sawyer::Container::Graph< V, E, VKey, EKey, Alloc >::EdgeBaseIterator< Derived, Value, Node, BaseIter, VList >:
Collaboration diagram for Sawyer::Container::Graph< V, E, VKey, EKey, Alloc >::EdgeBaseIterator< Derived, Value, Node, BaseIter, VList >:
Public Member Functions | |
| Derived & | operator= (const Derived &other) |
| Assignment. More... | |
| bool | isEmpty () const |
| True if iterator doesn't point to anything. More... | |
| Derived & | operator++ () |
| Increment. More... | |
| Derived | operator++ (int) |
| Increment. More... | |
| Derived & | operator-- () |
| Decrement. More... | |
| Derived | operator-- (int) |
| Decrement. More... | |
| template<class OtherIter > | |
| bool | operator== (const OtherIter &other) const |
| Equality predicate. More... | |
| template<class OtherIter > | |
| bool | operator!= (const OtherIter &other) const |
| Equality predicate. More... | |
Protected Member Functions | |
| EdgeBaseIterator (const EdgeBaseIterator &other) | |
| EdgeBaseIterator (const BaseIter &iter) | |
| EdgeBaseIterator (EdgePhase phase, VList *vlist) | |
| template<class BaseIter2 > | |
| EdgeBaseIterator (EdgePhase phase, const BaseIter2 &iter, VList *vlist) | |
| Node & | dereference () const |
Member Function Documentation
template<class V = Nothing, class E = Nothing, class VKey = GraphVertexNoKey<V>, class EKey = GraphEdgeNoKey<E>, class Alloc = DefaultAllocator>
template<class Derived, class Value, class Node, class BaseIter, class VList>
|
inline |
template<class V = Nothing, class E = Nothing, class VKey = GraphVertexNoKey<V>, class EKey = GraphEdgeNoKey<E>, class Alloc = DefaultAllocator>
template<class Derived, class Value, class Node, class BaseIter, class VList>
|
inline |
template<class V = Nothing, class E = Nothing, class VKey = GraphVertexNoKey<V>, class EKey = GraphEdgeNoKey<E>, class Alloc = DefaultAllocator>
template<class Derived, class Value, class Node, class BaseIter, class VList>
|
inline |
template<class V = Nothing, class E = Nothing, class VKey = GraphVertexNoKey<V>, class EKey = GraphEdgeNoKey<E>, class Alloc = DefaultAllocator>
template<class Derived, class Value, class Node, class BaseIter, class VList>
|
inline |
template<class V = Nothing, class E = Nothing, class VKey = GraphVertexNoKey<V>, class EKey = GraphEdgeNoKey<E>, class Alloc = DefaultAllocator>
template<class Derived, class Value, class Node, class BaseIter, class VList>
|
inline |
template<class V = Nothing, class E = Nothing, class VKey = GraphVertexNoKey<V>, class EKey = GraphEdgeNoKey<E>, class Alloc = DefaultAllocator>
template<class Derived, class Value, class Node, class BaseIter, class VList>
template<class OtherIter >
|
inline |
Equality predicate.
Two iterators are equal if they point to the same node of an edge list, and unequal otherwise. End iterators point to a virtual node one past the end of the list and are unique to each list or sublist. One minor exception to this rule is that end iterators for the in-edge list and out-edge list of the same vertex are considered to be equal.
template<class V = Nothing, class E = Nothing, class VKey = GraphVertexNoKey<V>, class EKey = GraphEdgeNoKey<E>, class Alloc = DefaultAllocator>
template<class Derived, class Value, class Node, class BaseIter, class VList>
template<class OtherIter >
|
inline |
Equality predicate.
Two iterators are equal if they point to the same node of an edge list, and unequal otherwise. End iterators point to a virtual node one past the end of the list and are unique to each list or sublist. One minor exception to this rule is that end iterators for the in-edge list and out-edge list of the same vertex are considered to be equal.
template<class V = Nothing, class E = Nothing, class VKey = GraphVertexNoKey<V>, class EKey = GraphEdgeNoKey<E>, class Alloc = DefaultAllocator>
template<class Derived, class Value, class Node, class BaseIter, class VList>
|
inline |
The documentation for this class was generated from the following file:
