Tools.h++ Class Reference

begin() const;
Returns an iterator positioned at the first pair in self.
void
clear();
Clears the collection by removing all items from self. Each key and its associated item
will have its destructor called.
bool
contains(const K& key) const;
Returns true if there exists a key j in self that compares equal to key, otherwise returns
false.
bool
contains(bool (*fn)(const_reference,void*), void* d) const;
Returns true if there exists an association a in self such that the expression ((*fn)(a,d)) is
true, otherwise returns false. fn points to a user-defined tester function which must have
prototype:
bool yourTester(const_reference a, void* d);
Client data may be passed through parameter d.
iterator
end();
const_iterator
end() const;
Returns an iterator positioned "just past" the last association in self.
size_type
entries() const;
Returns the number of associations in self.
bool
find(const K& key, Key& r) const;
If there exists a key j in self that compares equal to key, assigns j to r and returns true.
Otherwise, returns false and leaves the value of r unchanged.
bool
find(bool (*fn)(const_reference,void*), void* d,
pair<K,T>& r) const;
If there exists an association a in self such that the expression ((*fn)(a,d)) is true, assigns
a to r and returns true. Otherwise, returns false and leaves the value of k unchanged. fn
points to a user-defined tester function which must have prototype:
bool yourTester(const_reference a, void* d);