Go to the documentation of this file.
18 #ifndef __LIBSTD_HASHITERATOR_H
19 #define __LIBSTD_HASHITERATOR_H
Efficient key -> value lookups.
List< K > m_keys
List of keys to iterate.
virtual T & next()
Fetch the next item.
virtual bool remove()
Remove the current item from the underlying Container.
virtual void reset()
Reset the iterator.
Size hash(const String &key, Size mod)
Compute a hash using the FNV algorithm.
virtual const K & key()
Get the current key.
HashIterator(HashTable< K, V > &hash)
Class constructor.
virtual bool remove()
Remove the current item from the List.
Iterate through a HashTable.
virtual bool hasNext() const
Check if there is more to iterate.
virtual V & next()
Fetch the next item.
virtual void operator++(int num)
Increment operator.
Abstracts an iteration process.
virtual ~HashIterator()
Destructor.
virtual const V & current() const
Get the current value (read-only).
virtual const T & current() const
Get current item in the List.
virtual bool hasCurrent() const
Check if there is a current item on the List.
HashTable< K, V > & m_hash
Points to the HashTable to iterate.
virtual bool hasNext() const
Check if there is more on the List to iterate.
virtual void reset()
Reset the iterator.
virtual bool hasCurrent() const
Check if there is a current item.
virtual V & current()
Get the current value.
ListIterator< K > m_iter
Iterator of keys.