Tools.h++ Class Reference

typedef T*const& const_reference;
Public Constructors
RWTPtrSet<T,C>(const container_comp& comp = container_comp());
Constructs an empty set.
RWTPtrSet<T,C>(const RWTPtrSet<T,C>& rws);
Copy constructor.
RWTPtrSet<T,C>(const container_type& s);
Creates a pointer based set by copying all elements from s.
RWTPtrSet<T,C>(T* const* first,T* const* last,const container_comp& comp =
container_comp());
Constructs a set by copying elements from the array of T*s pointed to by first, up to, but not including,
the element pointed to by last.
Public Member Operators
RWTPtrSet<T,C>&
operator=(const container_type& s);
RWTPtrSet<T,C>&
operator=(const RWTPtrSet<T,C>& s);
Clears all elements of self and replaces them by copying all elements of s.
bool
operator<(const RWTPtrSet<T,C>& s);
Returns true if self compares lexicographically less than s, otherwise returns false. Items in each
collection are dereferenced before being compared. Assumes that type T has well-defined less-than
semantics.
bool
operator==(const RWTPtrSet<T,C>& s);
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. Elements are dereferenced before being compared.
Public Member Functions
void
apply(void (*fn)(const T*,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