#include <UtlHashMapIterator.h>
UtlHashMapIterator allows developers to iterate (walks through) the objects in a UtlHashMap.
- See also
- UtlIterator
-
UtlHashMap
Return the key for the next element.
- Returns
- The next element key or NULL if no more elements are available.
Implements UtlIterator.
Reset the list by moving the iterator cursor to the location before the first element.
Implements UtlIterator.
Gets the key of the current element
This method is undefined if the next element has not been called (e.g. immediately after construction or after calling reset()). If the current element has been removed from the hash (either through the remove method on the iterator or directly on the UtlHashMap), this method returns NULL. The remaining values in the iteration sequence are not affected (the next call to () will return the next key).
Gets the value of the current element
This method is undefined if the next element has not been called (e.g. immediately after construction or after calling reset()). If the current element has been removed from the hash (either through the remove method on the iterator or directly on the UtlHashMap), this method returns NULL. The remaining values in the iteration sequence are not affected (the next call to () will return the next key).
void removing |
( |
const UtlPair * |
key | ) |
|
|
protectedvirtual |
removing is called by the UtlHashMap when an element is about to be removed from the container. The iterator must ensure that the element for the removed node is not returned by any subsequent call.