Description
template<class K, class T, class H = boost::hash<K>, class C = std::equal_to<K>, class A = std::allocator<std::pair<const K, T> >>
class Sawyer::Container::HashMap< K, T, H, C, A >::NodeIterator
class Sawyer::Container::HashMap< K, T, H, C, A >::NodeIterator
Forward 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.
#include <Sawyer/HashMap.h>
Inheritance diagram for Sawyer::Container::HashMap< K, T, H, C, A >::NodeIterator:
Collaboration diagram for Sawyer::Container::HashMap< K, T, H, C, A >::NodeIterator:
Public Member Functions | |
| NodeIterator (const NodeIterator &other) | |
| Node & | operator* () const |
| Node * | operator-> () const |
Constructor & Destructor Documentation
◆ NodeIterator() [1/2]
template<class K , class T , class H = boost::hash<K>, class C = std::equal_to<K>, class A = std::allocator<std::pair<const K, T> >>
|
inline |
◆ NodeIterator() [2/2]
template<class K , class T , class H = boost::hash<K>, class C = std::equal_to<K>, class A = std::allocator<std::pair<const K, T> >>
|
inline |
Member Function Documentation
◆ operator*()
template<class K , class T , class H = boost::hash<K>, class C = std::equal_to<K>, class A = std::allocator<std::pair<const K, T> >>
|
inline |
◆ operator->()
template<class K , class T , class H = boost::hash<K>, class C = std::equal_to<K>, class A = std::allocator<std::pair<const K, T> >>
|
inline |
The documentation for this class was generated from the following file:
