Iterate over the hash table. More...
#include <hash_table.h>
Collaboration diagram for JASS::hash_table< KEY, ELEMENT, BITS >::iterator:
Public Member Functions | |
| iterator (const hash_table &over, size_t current) | |
| Constructor. More... | |
| const std::pair< const KEY &, const ELEMENT & > | operator* () const |
| Return a reference to the object at the current location. More... | |
| bool | operator!= (const iterator &other) const |
| Compare two iterator objects for non-equality. More... | |
| iterator & | operator++ () |
| Increment this iterator. | |
Private Attributes | |
| const hash_table< KEY, ELEMENT, BITS > & | iterand |
| The hash table being iterated over. | |
| size_t | location |
| Current node in the hash table. | |
| binary_tree< KEY, ELEMENT >::iterator | tree_iterator |
| Iterator over the binary tree at the current hash table node. | |
| binary_tree< KEY, ELEMENT >::iterator | tree_iterator_end |
| When to end iterating over the binary tree at the current hash table node. | |
Detailed Description
template<typename KEY, typename ELEMENT, size_t BITS = 24>
class JASS::hash_table< KEY, ELEMENT, BITS >::iterator
Iterate over the hash table.
Constructor & Destructor Documentation
◆ iterator()
template<typename KEY, typename ELEMENT, size_t BITS = 24>
|
inline |
Constructor.
- Parameters
-
over [in] The hash table to iterate over. current [in] The node to start at.
Member Function Documentation
◆ operator!=()
template<typename KEY, typename ELEMENT, size_t BITS = 24>
|
inline |
Compare two iterator objects for non-equality.
- Parameters
-
other [in] The iterator object to compare to.
- Returns
- true if they differ, else false.
◆ operator*()
template<typename KEY, typename ELEMENT, size_t BITS = 24>
|
inline |
Return a reference to the object at the current location.
- Returns
- The current object.
The documentation for this class was generated from the following file:
- source/hash_table.h
