Tools.h++ Class Reference

Table Of Contents
Moves the iterator to the next item with the address e and returns it. Returns nil if no
match is found, in which case the position of the iterator will be undefined.
type*
insertAfterPoint(type* a);
Adds item a after the current iterator position and return the item. The position of the
iterator is left unchanged.
type*
key() const;
Returns the item at the current iterator position.
type*
remove();
Removes and returns the item at the current cursor position. Afterwards, the iterator will
be positioned at the previous item in the list. In a singly-linked list, this function is an
inefficient operation because the entire list must be traversed, looking for the link before
the link to be removed.
type*
removeNext(yourTester t, const type* d);
Moves the iterator to the next item for which the function pointed to by t finds a "match"
with d and removes and returns it. Returns nil if no match is found, in which case the
position of the iterator will be undefined.
type*
removeNextReference(const type* e);
Moves the iterator to the next item with the address e and removes and returns it. Returns
nil if no match is found, in which case the position of the iterator will be undefined.
void
reset();
Resets the iterator to its initial state.
void
toFirst();
Moves the iterator to the start of the list.
void
toLast();
Moves the iterator to the end of the list.