Elements are accessed in order, from first to last. Advances the iterator one position. Advances the iterator n positions. Advances the iterator one position. Returns a pointer to the collection over which this iterator is iterating.
Equality is measured by the class-defined equality operator for type T .
Returns the value at the iterator's current position. The results are undefined if the iterator is no longer valid. Removes the value from the iterator's associated collection at the current position of the iterator. Afterwards, if successful, the iterator will be positioned at the element immediately before the removed element. This function is relatively inefficient for a singly-linked list.