A double-linked list container class iterator.
More...
#include <Containers_T.h>
template<class T>
class ACE_DLList_Reverse_Iterator< T >
A double-linked list container class iterator.
This implementation uses ACE_Double_Linked_List_Iterator to perform the logic behind this container class. It delegates all of its calls to ACE_Double_Linked_List_Iterator.
◆ ACE_DLList_Reverse_Iterator()
◆ advance()
Move forward by one element in the list. Returns 0 when all the items in the list have been seen, else 1.
◆ dump()
◆ next() [1/2]
Pass back the {next_item} that hasn't been seen in the list. Returns 0 when all items have been seen, else 1.
◆ next() [2/2]
◆ remove()
Removes the current item (i.e., {next}) from the list. Note that DLList iterators do not support {advance_and_remove} directly (defined in its base class) and you will need to release the element returned by it.
◆ reset()
Retasks the iterator to iterate over a new Double_Linked_List. This allows clients to reuse an iterator without incurring the constructor overhead. If you do use this, be aware that if there are more than one reference to this iterator, the other "clients" may be very bothered when their iterator changes. @ Here be dragons. Comments?
◆ ACE_DLList< T >
◆ ACE_DLList_Node
◆ list_
The documentation for this class was generated from the following files:
