template<class K, class T, class H = RWTHash<K>, class EQ = std::equal_to<K>, class A = std::allocator<K>>
class RWTValHashMultiMapIterator< K, T, H, EQ, A >
- Deprecated:
- As of SourcePro 12.5, use RWTValHashMultiMap::iterator to iterate over the elements in this collection.
RWTValHashMultiMapIterator provides an iterator interface to the C++ Standard Library-based collection represented by RWTValHashMultiMap. (An STL iterator interface is provided through RWTValHashMultiMap::iterator.)
Iteration over an RWTValHashMultiMap 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 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(). 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
- Persistence
- None
- Example
#include <rw/tvhmmap.h>
#include <rw/cstring.h>
#include <iostream>
#include <functional>
struct simple_hash
{
unsigned long
return (unsigned long)(n ? n * size_t (ref [0]) : 0);
}
};
int main() {
<RWCString, int, simple_hash, std::equal_to<RWCString> >
age;
<RWCString, int, simple_hash, std::equal_to<RWCString > >
itr(age);
age.insert(RWCString("John"), 30);
age.insert(RWCString("Steve"),17);
age.insert(RWCString("Mark"),24);
age.insert(RWCString("Steve"),24);
while(itr()) {
std::cout << itr.key()
<< "\'s age is "
<< itr.value()
<< std::endl;
}
return 0;
}
Program Output:
John's age is 30
Steve's age is 24
Steve's age is 17
Mark's age is 24
template<class K, class T, class H = RWTHash<K>, class EQ = std::equal_to<K>, class A = std::allocator<K>>
Advances self to the next element, dereferences the resulting iterator, and returns false if the iterator has advanced past the last item in the container; otherwise returns true.
template<class K, class T, class H = RWTHash<K>, class EQ = std::equal_to<K>, class A = std::allocator<K>>
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 multimap, self will now reference an undefined value and false is returned. Otherwise, returns true.
