Tools.h++ Manual

22-64 104011 Tandem Computers Incorporated
22
size_t index(T* a) const;
Performs a binary search, returning the index of the first object that is equal to
the object pointed to by a , or RW_NPOS if there is no such object. Equality is
measured by the class-defined equality operator for type T .
void insert(T* a);
Performs a binary search, inserting the object pointed to by a after all items
that compare less than or equal to it, but before all items that do not. "Less
Than" is measured by the class-defined '<' operator for type T . The collection
will be resized automatically if this causes the number of items to exceed the
capacity.
RWBoolean isEmpty() const;
Returns TRUE if there are no items in the collection, FALSE otherwise.
T* last() const;
Returns a pointer to the last item in the collection. If there are no items in the
collection then an exception of type TOOL_INDEX will occur.
size_t length() const;
Returns the number of items currently in the collection.
size_t occurrencesOf(T* a) const;
Performs a binary search, returning the number of items that are equal to the
object pointed to by a . Equality is measured by the class-defined equality
operator for type T .
T* remove(T* a);
Performs a binary search, removing the first object which is equal to the object
pointed to by a and returns a pointer to it, or nil if no such object could be
found. Equality is measured by the class-defined equality operator for type T .
size_t removeAll(T* a);
Performs a binary search, removing all objects which are equal to the object
pointed to by a . Returns the number of objects removed. Equality is measured
by the class-defined equality operator for type T .
T* removeAt(size_t i);
Removes the object at index i and returns a pointer to it. An exception of type
TOOL_INDEX will be thrown if i is not a valid index. Valid indices are from
zero to the number of items in the list less one.