ACE  6.0.6
Public Member Functions | Private Attributes | Friends
ACE_DLList_Reverse_Iterator Class Reference

A double-linked list container class iterator. More...

#include <Containers_T.h>

Inheritance diagram for ACE_DLList_Reverse_Iterator:
Inheritance graph
Collaboration diagram for ACE_DLList_Reverse_Iterator:
Collaboration graph

List of all members.

Public Member Functions

 ACE_DLList_Reverse_Iterator (ACE_DLList< T > &l)
void reset (ACE_DLList< T > &l)
int advance (void)
int next (T *&)
T * next (void) const
int remove (void)
void dump (void) const
 Delegates to ACE_Double_Linked_List_Iterator.

Private Attributes

ACE_DLList< T > * list_


class ACE_DLList< T >
class ACE_DLList_Node

Detailed Description

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.

Constructor & Destructor Documentation

ACE_DLList_Reverse_Iterator::ACE_DLList_Reverse_Iterator ( ACE_DLList< T > &  l) [inline]

Member Function Documentation

int ACE_DLList_Reverse_Iterator::advance ( void  ) [inline]

Move forward by one element in the list. Returns 0 when all the items in the list have been seen, else 1.

Reimplemented from ACE_Double_Linked_List_Reverse_Iterator< ACE_DLList_Node >.

void ACE_DLList_Reverse_Iterator::dump ( void  ) const [inline]
int ACE_DLList_Reverse_Iterator::next ( T *&  ptr) [inline]

Pass back the {next_item} that hasn't been seen in the list. Returns 0 when all items have been seen, else 1.

T * ACE_DLList_Reverse_Iterator::next ( void  ) const [inline]
int ACE_DLList_Reverse_Iterator::remove ( void  ) [inline]

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.

void ACE_DLList_Reverse_Iterator::reset ( ACE_DLList< T > &  l) [inline]

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?

Friends And Related Function Documentation

friend class ACE_DLList< T > [friend]
friend class ACE_DLList_Node [friend]

Member Data Documentation

The documentation for this class was generated from the following files:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines