Tools.h++ Class Reference

const EQ& eq = EQ());
Construct an rw_hashmultimap<K,V,Hash,EQ> with sz slots, using h as the hash object,
and eq as the equality comparator, containing a copy of each pair referenced by the range
starting with first and bounded by bound.
Public Destructor
~rw_hashmultimap<K,V,Hash,EQ>();
The destructor releases the memory used by the container's implementation.
Public Operators
rw_hashmultimap<K,V,Hash,EQ>&
operator=(const rw_hashmultimap<K,V,Hash,EQ>& rhs);
Sets self to have the same capacity, Hash and EQ as rhs, removes all self's current
contents, and replaces them with copies of the elements in rhs.
bool
operator==(const rw_hashmultimap<K,V,Hash,EQ> & rhs) const;
Returns true if self and rhs have the same number of elements, and for each value_type in
self, there is exactly one corresponding value_type in rhs that has a first part for which
the EQ object in self returns true, and a second part for which operator==() returns true.
The need to test both parts, and ensure that the matches are one-to-one means that this
operator may be significantly slower than the method equal_by_keys() described below.
Accessors
iterator
begin();
The iterator returned references the first item in self. If self is empty, the iterator is equal
to end(). Note that because items are stored in pseudo-random order, this iterator might
reference any item that has been stored in self.
const_iterator
begin() const;
The iterator returned references the first item in self. If self is empty, the iterator is equal
to end(). Note that because items are stored in pseudo-random order, this iterator might
reference any item that has been stored in self.
iterator
end();
The iterator returned marks the location "off the end" of self. It may not be dereferenced.