Tools.h++ Class Reference

Table Of Contents
There was 1 second place winner.
Related Classes
Class RWTPtrHashMultiMap<K,T,H,EQ> offers the same interface to a pointer-based
collection that accepts multiple keys that compare equal to each other.
Class rw_hashmap<K*,T*,rw_deref_hash<H,K>,rw_deref_compare<C,K> > is the
C++-standard library style collection that serves as the underlying implementation for this
collection.
Public Typedefs
typedef rw_deref_hash<H,K> container_hash;
typedef rw_deref_compare<EQ,K> container_eq;
typedef rw_hashmap<K*,T*,container_hash,container_eq >
container_type;
typedef container_type::size_type size_type;
typedef container_type::difference_type difference_type;
typedef container_type::iterator iterator;
typedef container_type::const_iterator const_iterator;
typedef pair <K* const, T*> value_type;
typedef pair <K* const, T*>& reference;
typedef const pair <K* const, T*>& const_reference;
typedef K* value_type_key;
typedef T* value_type_data;
typedef K*& reference_key;
typedef T*& reference_data;
typedef const K*const& const_reference_key;
typedef const T*const& const_reference_data;
Public Constructors
RWTPtrHashMap<K,T,H,EQ>();
Constructs an empty map.
RWTPtrHashMap<K,T,H,EQ>(const RWTPtrHashMap<K,T,H,EQ>& rwm);
Copy constructor.
RWTPtrHashMap<K,T,H,EQ>
(const container_type & m);
Constructs a pointer based hash map by copying all elements from m.
RWTPtrHashMap<K,T,H,EQ>
(const H& h, size_type sz = RWDEFAULT_CAPACITY);