This document describes iterators within the context of doubly linked lists.
Iterators provide an easy way of cycling through the elements of a doubly
linked list, using the post increment operator++ and the
post decrement operator--. They avoid the need to access
the inner detail of link objects and list headers.
An iterator is an instance of the templated class TDblQueIter<class
T>. The class provides the behaviour for moving through the elements
of a specific list. An iterator maintains a pointer to the current element
in the list. The current element can be any element in the list.