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