Tools.h++ Class Reference

Insert a copy of each item in the range beginning at first and bounded by bound into self at
a place just prior to the place referenced by loc. Returns an iterator referencing the last
newly inserted element. (Note: ++(list.insert(loc,first,bound))==loc; )
iterator
insert(iterator loc, const T* first, const T* bound);
Insert a copy of each item in the range beginning at first and bounded by bound into self at
a place just prior to the place referenced by loc. Returns an iterator referencing the last
newly inserted element. (Note: ++(list.insert(loc,first,bound))==loc; )
void
pop_front();
Erases the first element of self. If self is empty, the effect is undefined.
void
push_back(const T& item);
Inserts item as the last element of the list.
void
push_front(const T& item);
Inserts item as the first element of the list.
void
reverse();
Reverses the order of the nodes containing the elements in self.
void
sort();
Sorts self according to T::operator<(T) or equivalent. Runs in time proportional to N
log(N) where N is the number of elements.This is method does not copy or destroy any of
the items exchanged during the sort, but adjusts the order of the links in the list.
void
swap(rw_slist<T>& other);
Exchanges the contents of self with other retaining the ordering of each. This is method
does not copy or destroy any of the items exchanged, but re-links the lists.
void
unique();
Removes from self all but the first element from each equal range. A precondition is that
any duplicate elements are adjacent.