Description
template<class K, class V>
class Sawyer::Container::GraphIteratorMap< K, V >::ConstNodeIterator
Bidirectional iterator over constant key/value nodes.
Dereferencing this iterator will return a const Node from which both the key and the value can be obtained. Node iterators are implicitly convertible to both key and value iterators.
Definition at line 173 of file GraphIteratorMap.h.
#include <GraphIteratorMap.h>
Inheritance diagram for Sawyer::Container::GraphIteratorMap< K, V >::ConstNodeIterator:
Collaboration diagram for Sawyer::Container::GraphIteratorMap< K, V >::ConstNodeIterator:
Public Member Functions | |
| ConstNodeIterator (const ConstNodeIterator &other) | |
| Copy constructor. | |
| ConstNodeIterator (const NodeIterator &other) | |
| Copy constructor. | |
| const Node & | operator* () const |
| Dereference iterator to return a storage node. | |
| const Node * | operator-> () const |
| Returns a pointer to a storage node. | |
The documentation for this class was generated from the following file:
