Tools.h++ Class Reference

Creates an empty hashed map which uses the hash object h and has an initial capacity of
sz.
RWTValHashMap<K,T,H,EQ>(const RWTValHashMap<K,T,H,EQ>& rwm);
Copy constructor.
RWTValHashMap<K,T,H,EQ>(const value_type* first,
const value_type* last);
Constructs a map by copying elements from the array of value_type pairs pointed to by
first, up to, but not including, the pair pointed to by last.
Public Member Operators
RWTValHashMap<K,T,H,EQ>&
operator=(const RWTValHashMap<K,T,H,EQ>& m);
RWTValHashMap<K,T,H,EQ>&
operator=(const rw_hashmap<K,T,H,EQ>& m);
Destroys all elements of self and replaces them by copying all associations from m.
bool
operator==(const RWTValHashMap<K,T,H,EQ>& m) const;
bool
operator==(const rw_hashmap<K,T,H,EQ>& m) const;
Returns true if self compares equal to m, otherwise returns false. Two collections are
equal if both have the same number of entries, and iterating through both collections
produces, in turn, individual pairs that compare equal to each other.
T&
operator[](const K& key);
Looks up key and returns a reference to its associated item. If the key is not in the
dictionary, then it will be added with an associated item provided by the default
constructor for type T.
Public Member Functions
void
apply(void (*fn)(const K&, T&, void*),void* d);
void
apply(void (*fn)(const K&,const T&,void*),void* d) const;
Applies the user-defined function pointed to by fn to every association in the collection.
This function must have one of the prototypes:
void yourfun(const K& key, T& a, void* d);
void yourfun(const K& key, const T& a,void* d);