Tools.h++ Class Reference

Construct an rw_hashset<T,Hash,EQ> with sz slots, using h as the hash object, and eq
as the equality comparator, containing a copy of each item referenced by the range
starting with first and bounded by bound. If there are items in the range which test EQ,
then only the first such item will be inserted into self.
Public Destructor
~rw_hashset<T,Hash,EQ>();
The destructor releases the memory used by the container's implementation.
Public Operators
rw_hashset<T,Hash,EQ>&
operator=(const rw_hashset<T,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_hashset<T,Hash,EQ> & rhs) const;
Returns true if self and rhs have the same number of elements, and for each item in self
there is an item in rhs which tests EQ.
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.
const_iterator
end() const;
The iterator returned marks the location "off the end" of self. It may not be dereferenced.