Tools.h++ Class Reference

Constructs an empty map with comparator comp.
RWTPtrMultiMap<K,T,C>(const container_type& m);
Constructs a multimap by copying all element from m.
RWTPtrMultiMap<K,T,C>(const RWTPtrMultiMap<K,T,C>& rwm);
Copy constructor.
RWTPtrMultiMap<K,T,C>(value_type* first,value_type* last,
const container_comp& comp = container_comp());
Constructs a multimap by copying elements from the array of pairs pointed to by first, up to,
but not including, the pair pointed to by last.
Public Member Operators
RWTPtrMultiMap<K,T,C>&
operator=(const container_type& m);
RWTPtrMultiMap<K,T,C>&
operator=(const RWTPtrMultiMap<K,T,C>& m);
Destroys all associations in self and replaces them by copying all associations from m.
bool
operator<(const RWTPtrMultiMap<K,T,C>& m);
Returns true if self compares lexicographically less than m, otherwise returns false. Keys in
each collection are dereferenced before being compared. Assumes that type K has
well-defined less-than semantics.
bool
operator==(const RWTPtrMultiMap<K,T,C>& m);
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 keys that compare equal to each other. Keys are dereferenced before being
compared.
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);
Client data may be passed through parameter d.