template<class T, class H = RWTHash<T>, class EQ = std::equal_to<T>, class A = std::allocator<T*>>
class RWTPtrHashSetIterator< T, H, EQ, A >
- Deprecated
- As of SourcePro 12.5, use RWTPtrHashSet::iterator to iterate over the elements in this collection.
RWTPtrHashSetIterator provides an iterator interface to the C++ Standard Library-based collection represented by RWTPtrHashSet. (An STL iterator interface is provided through RWTPtrHashSet::iterator.)
Iteration over an RWTPtrHashSet 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 will return a value equivalent to boolean false
. Continued increments will 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/tphset.h>
A hash-based container for pointer types.
Definition tphset.h:143
- Persistence
- None
- Example
#include <rw/cstring.h>
#include <rw/tphset.h>
#include <iostream>
int main() {
std::equal_to<RWCString> >
std::equal_to<RWCString> >
itr(age);
for (; ++itr;) {
std::cout << *itr.key() << std::endl;
}
age.clearAndDestroy();
return 0;
}
Offers powerful and convenient facilities for manipulating strings.
Definition stdcstring.h:826
static unsigned hash(const RWCString &str)
Definition stdcstring.h:4413
Deprecated. Provides an iterator for RWTPtrHashSet.
Definition tphset.h:968
Program Output (not necessarily in this order):
template<class T , class H = RWTHash<T>, class EQ = std::equal_to<T>, class A = std::allocator<T*>>
Advances self to the next element, dereferences the resulting iterator and returns its value. If the iterator has advanced past the last item in the container, rwnil will be returned.
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 will now reference the first element. If, before iteration, self referenced the last association in the multi-map, self will now point to an undefined value and a value equivalent to false
will be returned. Otherwise, a value equivalent to true
is returned.