Tools.h++ Class Reference

RWTPtrHashSet<T,H,EQ>
(const H& h,size_type sz = RWDEFAULT_CAPACITY);
Creates an empty hashed set which uses the hash object h and has an initial hash table
capacity of sz.
RWTValHashSet<T,H,EQ>(const T* first,const T* last,
size_type sz = 1024,const H& h = H(),const EQ& eq = EQ());
Constructs a set by copying elements from the array of Ts pointed to by first, up to, but not
including, the element pointed to by last. The underlying hash table representation will
have sz buckets, will use h for its hashing function and will use eq to determine equality
between elements
Public Member Operators
RWTValHashSet<T,H,EQ>&
operator=(const RWTValHashSet<T,H,EQ>& s);
RWTValHashSet<T,H,EQ>&
operator=(const rw_hashset<T,H,EQ>& s);
Destroys all elements of self and replaces them by copying all elements of s.
bool
operator==(const RWTValHashSet<T,H,EQ>& s) const;
bool
operator==(const rw_hashset<T,H,EQ>& s) const;
Returns true if self compares equal to s, otherwise returns false. Two collections are equal
if both have the same number of entries, and iterating through both collections produces,
in turn, individual elements that compare equal to each other.
Public Member Functions
void
apply(void (*fn)(const_reference,void*), void* d) const;
Applies the user-defined function pointed to by fn to every item in the collection. This
function must have prototype:
void yourfun(const T& a, void* d);
Client data may be passed through parameter d.
iterator
begin();
const_iterator
begin() const;
Returns an iterator positioned at the first element of self.