template<class T, class H = RWTHash<T>, class EQ = std::equal_to<T>, class A = std::allocator<T>>
class RWTValHashSetConstIterator< T, H, EQ, A >
- Deprecated
- As of SourcePro 12.5, use RWTValHashSet::const_iterator to iterate over the elements in this collection.
RWTValHashSetConstIterator provides a const
iterator for RWTValHashSet. A const
iterator prohibits any changes to the underlying collection.
Iteration over an RWTValHashSet is pseudorandom and dependent on the capacity of the underlying hash table and the hash function being used.
The current item referenced by this iterator is undefined after construction or after a call to reset(). The iterator becomes valid after being advanced with either a pre-increment or an operator()().
For both operator++() and operator()(), iterating past the last element returns a value equivalent to boolean false
. Continued increments return a value equivalent to false
until reset() is called.
The value type must have operator==()
defined. This requirement is imposed by the C++ Standard Library.
- Synopsis
#include <rw/tvhset.h>
Deprecated. Provides a const iterator for RWTValHashSet.
Definition tvhset.h:1061
Maintains a collection of values stored according to a hash object.
Definition tvhset.h:143
- Persistence
- None
template<class T , class H = RWTHash<T>, class EQ = std::equal_to<T>, class A = std::allocator<T>>
Advances self to the next element. If the iterator has been reset or just created self references the first element. If, before iteration, self referenced the last value in the multiset, self references an undefined value and returns false
. Otherwise, it returns true
.