Tools.h++ Class Reference

size_type
size() const;
Returns the number of items currently held in self.
Mutators
void
clear();
A synonym for erase(begin(),end());
size_type
erase(const key_type& key);
If there is an item EQ to key, it is removed, and 1 is returned. Otherwise, 0 is returned.
iterator
erase(iterator iter);
Removes the element referenced by iter and returns an iterator referencing the "next"
element. If iter does not reference an item in self, the result is undefined.
iterator
erase(iterator first, iterator bound);
Removes each element in the range which begins with first and is bounded by bound.
Returns an iterator referencing bound. If first does not reference an item in self (and if
first and bound are not equal), the effect is undefined.
pair<iterator,bool>
insert(const value_type& val);
If there is no item in self EQ to val then inserts val, returning a pair with an iterator
referencing the new element and true. Otherwise, returns a pair with an iterator
referencing the matching value_type and false.
size_type
insert(iterator ignore, const value_type& val);
If there is no item in self EQ to val then inserts val, returning 1. Otherwise, does nothing
and returns 0. Note that the first argument is provided only for conformance with the
ANSI associative container specification, and is ignored by the method, since hash table
look up can be done in constant time.
size_type
insert(const value_type* first, const value_type* bound);
For each element in the range beginning with first and bounded by bound, if there is no
item in self EQ to that element, the element is copied into self, or if there is such an
element, it is skipped. Returns the number of elements inserted.
size_type