Description
template<class K, class V>
class Sawyer::Container::GraphIteratorMap< K, V >::NodeIterator
Bidirectional iterator over key/value nodes.
Dereferencing this iterator will return a 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 146 of file GraphIteratorMap.h.
#include <GraphIteratorMap.h>
Inheritance diagram for Sawyer::Container::GraphIteratorMap< K, V >::NodeIterator:
Collaboration diagram for Sawyer::Container::GraphIteratorMap< K, V >::NodeIterator:
Public Member Functions | |
| NodeIterator (const NodeIterator &other) | |
| Copy constructor. | |
| Node & | operator* () const |
| Dereference iterator to return a storage node. | |
| Node * | operator-> () const |
| Pointer to storage node. | |
The documentation for this class was generated from the following file:
