RWTPtrHashMapIterator< K, T, H, EQ, A > Class Template Reference

Deprecated. Provides an iterator for RWTPtrHashMap. More...

#include <rw/tphdict.h>

Public Member Functions
	RWTPtrHashMapIterator (RWTPtrHashMap< K, T, H, EQ, A > &h)
RWTPtrHashMap< K, T, H, EQ, A > *	container () const
K *	key () const
K *	operator() ()
bool	operator++ ()
void	reset ()
void	reset (RWTPtrHashMap< K, T, H, EQ, A > &m)
T *	value () const

Friends
class	RWTPtrHashMapConstIterator< K, T, H, EQ, A >

Detailed Description

template<class K, class T, class H = RWTHash<K>, class EQ = std::equal_to<K>, class A = std::allocator<K*>>
class RWTPtrHashMapIterator< K, T, H, EQ, A >

Deprecated

As of SourcePro 12.5, use RWTPtrHashMap::iterator to iterate over the elements in this collection.

RWTPtrHashMapIterator provides an iterator interface to the C++ Standard Library-based collection represented by RWTPtrHashMap. (An STL iterator interface is provided through RWTPtrHashMap::iterator.)

Iteration over an RWTPtrHashMap is pseudo-random 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 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/tphdict.h>
RWTPtrHashMap<K, T, H, EQ, A> m;
RWTPtrHashMapIterator<K, T, H, EQ, A> itr(m);

Persistence

None

Example

#include <rw/cstring.h>
#include <rw/tphdict.h>
#include <iostream>
 
int main() {
  RWTPtrHashMap<RWCString, int, RWTHasher<RWCString>,
                std::equal_to<RWCString> >
      age(RWCString::hash);
 
  RWTPtrHashMapIterator<RWCString, int, RWTHasher<RWCString>,
                        std::equal_to<RWCString> >
      itr(age);
 
  age.insert(new RWCString("John"), new int(30));
  age.insert(new RWCString("Steve"), new int(17));
  age.insert(new RWCString("Mark"), new int(24));
 
  for (; ++itr;) {
    std::cout << *itr.key() << "\'s age is " << *itr.value()
              << std::endl;
  }
 
  age.clearAndDestroy();
  return 0;
}

Program Output (not necessarily in this order):

John's age is 30
Mark's age is 24
Steve's age is 17

Constructor & Destructor Documentation

RWTPtrHashMapIterator()

template<class K , class T , class H = RWTHash<K>, class EQ = std::equal_to<K>, class A = std::allocator<K*>>

RWTPtrHashMapIterator< K, T, H, EQ, A >::RWTPtrHashMapIterator ( RWTPtrHashMap< K, T, H, EQ, A > & h )

inline

Creates an iterator for the hashmap h. The iterator begins in an undefined state and must be advanced before the first element is accessible.

Member Function Documentation

container()

template<class K , class T , class H = RWTHash<K>, class EQ = std::equal_to<K>, class A = std::allocator<K*>>

RWTPtrHashMap< K, T, H, EQ, A > * RWTPtrHashMapIterator< K, T, H, EQ, A >::container ( ) const

inline

Returns a pointer to the collection being iterated over.

key()

template<class K , class T , class H = RWTHash<K>, class EQ = std::equal_to<K>, class A = std::allocator<K*>>

K * RWTPtrHashMapIterator< K, T, H, EQ, A >::key ( ) const

inline

Returns the key portion of the association pointed to by self. The return value is undefined if self is not referencing an association within the map.

operator()()

template<class K , class T , class H = RWTHash<K>, class EQ = std::equal_to<K>, class A = std::allocator<K*>>

K * RWTPtrHashMapIterator< K, T, H, EQ, A >::operator() ( )

inline

Advances self to the next element, dereferences the resulting iterator and returns its key. If the iterator has advanced past the last item in the hashmap, returns rwnil.

operator++()

template<class K , class T , class H = RWTHash<K>, class EQ = std::equal_to<K>, class A = std::allocator<K*>>

bool RWTPtrHashMapIterator< K, T, H, EQ, A >::operator++ ( )

inline

Advances 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 hashmap, self references an undefined value and the method returns a value equivalent to false. Otherwise, the method returns a value equivalent to true.

reset() [1/2]

template<class K , class T , class H = RWTHash<K>, class EQ = std::equal_to<K>, class A = std::allocator<K*>>

void RWTPtrHashMapIterator< K, T, H, EQ, A >::reset ( )

inline

Resets the iterator so that after being advanced it will reference the first element of the collection.

reset() [2/2]

template<class K , class T , class H = RWTHash<K>, class EQ = std::equal_to<K>, class A = std::allocator<K*>>

void RWTPtrHashMapIterator< K, T, H, EQ, A >::reset ( RWTPtrHashMap< K, T, H, EQ, A > & m )

inline

Resets the iterator so that after being advanced it will reference the first element of the collection m.

value()

template<class K , class T , class H = RWTHash<K>, class EQ = std::equal_to<K>, class A = std::allocator<K*>>

T * RWTPtrHashMapIterator< K, T, H, EQ, A >::value ( ) const

inline

Returns the value portion of the association pointed to by self. The return value is undefined if self is not referencing an association within the map.