| class THashSetIter : public THashTableIterBase |
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.
RHashSet<T>
| 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 &) | |
| 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.
| const RHashSet< T > & aSet | The set to be iterated over. |
| const T * | Current | ( | ) | const [inline] |
Return the current position of the iterator.
A pointer to the set member corresponding to the current position of the iterator. NULL if the iterator has just been constructed or reset, or if it has previously reached the end of an iteration.
| const T * | Next | ( | ) | [inline] |
Steps the iterator to the next position.
A pointer to the set member corresponding to the next position of the iterator. NULL if the iterator has exhausted all the available set elements.
| void | RemoveCurrent | ( | ) | [inline] |
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().