Tools.h++ Class Reference

asSortedCollection() or asBinaryTree() methods will build a very unbalanced tree.
virtual RWspace
binaryStoreSize() const;
Redefined from class RWCollectable.
virtual void
clear() = 0;
Removes all objects from the collection. Does not delete the objects themselves.
virtual void
clearAndDestroy();
Removes all objects from the collection and deletes them. Takes into account duplicate
objects within a collection and only deletes them once. However, it does not take into
account objects shared between different collections. Either do not use this function if
you will be sharing objects between separate collections, or put all collections that could
be sharing objects into one single "super-collection" and call clearAndDestroy() on that.
virtual int
compareTo(const RWCollectable* a) const;
Inherited from class RWCollectable.
virtual RWBoolean
contains(const RWCollectable* target) const;
Returns TRUE if the collection contains an item where the virtual function find() returns
non-nil.
virtual size_t
entries() const = 0;
Returns the total number of items in the collection.
virtual RWCollectable*
find(const RWCollectable* target) const = 0;
Returns a pointer to the first item in the collection which "matches" the object pointed to
by target or nil if no item was found. For most collections, an item "matches" the target if
either isEqual() or compareTo() find equivalence, whichever is appropriate for the actual
collection type. However, the "identity collections" (i.e., RWIdentitySet and
RWIdentityDictionary) look for an item with the same address (i.e., "is identical to").
virtual unsigned
hash() const;
Inherited from class RWCollectable.
virtual RWCollectable*
insert(RWCollectable* e) = 0;