template<class T, class H = RWTHash<T>, class EQ = std::equal_to<T>, class A = std::allocator<T*>>
class RWTPtrHashMultiSetConstIterator< T, H, EQ, A >
- Deprecated:
- As of SourcePro 12.5, use RWTPtrHashMultiSet::const_iterator to iterate over the elements in this collection.
RWTPtrHashMultiSetConstIterator provides a const
iterator interface to the C++ Standard Library-based collection represented by RWTPtrHashMultiSet. This iterator prohibits changes to the collection that is being iterated through.
Iteration over an RWTPtrHashMultiSet is pseudo-random 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 which are defined to be equivalent by the equivalence object, EQ
, will remain adjacent.
The current item referenced by this iterator is undefined after construction or after a call to reset() operation. 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/tphasht.h>
template <class T, class H, class EQ,
class A=std::allocator<T*> >
- Persistence
- None
template<class T , class H = RWTHash<T>, class EQ = std::equal_to<T>, class A = std::allocator<T*>>
Advanced self to the next element. If the iterator has been reset or just created, self references the first element. If used when self references the last association in the multi-set, self references an undefined value and the method returns a value equivalent to false
. Otherwise, the method returns a value equivalent to true
.