#include <e32hashtab.h>
class THashSetIter : public THashTableIterBase |
Public Member Functions | |
---|---|
THashSetIter(const RHashSet< T > &) | |
const T * | Current() |
const T * | Next() |
void | RemoveCurrent() |
void | Reset() |
Inherited Functions | |
---|---|
THashTableIterBase::Current(TInt)const | |
THashTableIterBase::Next(TInt) | |
THashTableIterBase::THashTableIterBase(const RHashTableBase &) |
A templated class which allows iteration over the elements of a RHashSet<T> class.
The set being iterated over may not be modified while an iteration is in progress or the iteration operations may malfunction or panic.
See also: RHashSet<T>
THashSetIter | ( | const RHashSet< T > & | aSet | ) | [inline] |
Construct an iterator over the specified set. The iterator starts at conceptual position one before the beginning of the list being iterated.
Parameters | |
---|---|
aSet | The set to be iterated over. |
const T * | Current | ( | ) | const [inline] |
Return the current position of the iterator.
const T * | Next | ( | ) | [inline] |
Steps the iterator to the next position.
void | RemoveCurrent | ( | ) | [inline] |
Reimplemented from THashTableIterBase::RemoveCurrent()
Removes the element at the current iterator position from the hash table. If the iterator does not currently point to a valid element, no action is taken. Note that the iterator position is not altered so it no longer points to a valid element following the Remove(). It is illegal to call Current() on the iterator after calling Remove() - the only legal operations are Reset() and Next().
void | Reset | ( | ) | [inline] |
Reimplemented from THashTableIterBase::Reset()
Reset the iterator to its initial state.