Tools.h++ Manual

104011 Tandem Computers Incorporated 21-173
21
RWBoolean atLast() const;
Returns TRUE if the iterator is at the end of the list, otherwise FALSE ;
virtual RWCollectable* findNext(const RWCollectable*
target);
Redefined from class RWIterator . Moves iterator to the next item which
isEqual to the item pointed to by target and returns it. If no item is found,
returns nil and the position of the iterator will be undefined.
RWCollectable* findNextReference(const
RWCollectable* e);
Moves iterator to the next item which is identical to the item pointed to by e
(that is, that has address e ) and returns it. If no item is found, returns nil and
the position of the iterator will be undefined.
RWCollectable* insertAfterPoint(RWCollectable*
a);
Insert item a after the current cursor position and return the item. The cursor's
position will be unchanged.
virtual RWCollectable* key() const;
Redefined from class RWIterator . Returns the item at the current iterator
position.
RWCollectable* remove();
Removes and returns the item at the current cursor position. Afterwards, the
iterator will be positioned at the previous item in the list.
Note – This function is not very efficient in a singly-linked list.
RWCollectable* removeNext(const RWCollectable*
target);
Moves iterator to the next item in the list which isEqual to the item pointed to
by target , removes it from the list and returns it. Afterwards, the iterator will
be positioned at the previous item in the list. If no item is found, returns nil
and the position of the iterator will be undefined.
RWCollectable* removeNextReference(const
RWCollectable* e);
Moves iterator to the next item in the list which is identical to the item pointed