template<class T, class H = RWTHash<T>, class EQ = std::equal_to<T>, class A = std::allocator<T>>
class RWTValHashMultiSetConstIterator< T, H, EQ, A >
- Deprecated
- As of SourcePro 12.5, use RWTValHashMultiSet::const_iterator to iterate over the elements in this collection.
RWTValHashMultiSetConstIterator provides a const
iterator interface to the C++ Standard Library-based collection represented by RWTValHashMultiSet. A const
iterator prohibits any changes to the underlying collection.
Iteration over an RWTValHashMultiSet is pseudorandom and dependent on the capacity of the underlying hash table and the hash function being used. The only usable relationship between consecutive elements is that elements defined to be equivalent by the equivalence object, EQ
, will be adjacent.
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 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/tvhasht.h>
Deprecated. Provides a const iterator for RWTValHashMultiSet.
Definition tvhasht.h:1044
Maintains a collection of values stored according to a hash object, and with multiple equivalent valu...
Definition tvhasht.h:129
- 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 now references the first element. If, before iteration, self referenced the last value in the multiset, self now references an undefined value and returns false
, otherwise, returns true
.