A double-linked list container class iterator. More...
#include <Containers_T.h>
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_ |
Friends | |
class | ACE_DLList< T > |
class | ACE_DLList_Node |
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.
Definition at line 1199 of file Containers_T.h.
ACE_DLList_Reverse_Iterator< T >::ACE_DLList_Reverse_Iterator | ( | ACE_DLList< T > & | l | ) | [inline] |
Definition at line 433 of file Containers_T.inl.
: ACE_Double_Linked_List_Reverse_Iterator <ACE_DLList_Node> ((ACE_DLList_Base &)l), list_ (&l) { }
int ACE_DLList_Reverse_Iterator< T >::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< T >.
Definition at line 447 of file Containers_T.inl.
void ACE_DLList_Reverse_Iterator< T >::dump | ( | void | ) | const [inline] |
Delegates to ACE_Double_Linked_List_Iterator.
Reimplemented from ACE_Double_Linked_List_Reverse_Iterator< T >.
Definition at line 472 of file Containers_T.inl.
{ #if defined (ACE_HAS_DUMP) ACE_Double_Linked_List_Reverse_Iterator <ACE_DLList_Node>::dump (); #endif /* ACE_HAS_DUMP */ }
T * ACE_DLList_Reverse_Iterator< T >::next | ( | void | ) | const [inline] |
Reimplemented from ACE_Double_Linked_List_Iterator_Base< T >.
Definition at line 464 of file Containers_T.inl.
{ ACE_DLList_Node *temp = ACE_Double_Linked_List_Reverse_Iterator <ACE_DLList_Node>::next (); return (T *) (temp ? temp->item_ : 0); }
int ACE_DLList_Reverse_Iterator< T >::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.
Definition at line 453 of file Containers_T.inl.
{ ACE_DLList_Node *temp = ACE_Double_Linked_List_Reverse_Iterator <ACE_DLList_Node>::next (); if (temp == 0) return 0; ptr = (T *) temp->item_; return 1; }
int ACE_DLList_Reverse_Iterator< T >::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.
Definition at line 425 of file Containers_T.inl.
{ ACE_DLList_Node *temp = ACE_Double_Linked_List_Reverse_Iterator <ACE_DLList_Node>::next (); this->ACE_Double_Linked_List_Reverse_Iterator <ACE_DLList_Node>::advance (); return list_->remove (temp); }
void ACE_DLList_Reverse_Iterator< T >::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?
Definition at line 440 of file Containers_T.inl.
{ list_ = &l; this->ACE_Double_Linked_List_Reverse_Iterator <ACE_DLList_Node>::reset ((ACE_DLList_Base &)l); }
friend class ACE_DLList< T > [friend] |
Definition at line 1202 of file Containers_T.h.
friend class ACE_DLList_Node [friend] |
Definition at line 1203 of file Containers_T.h.
ACE_DLList<T>* ACE_DLList_Reverse_Iterator< T >::list_ [private] |
Definition at line 1243 of file Containers_T.h.