Main Page | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | File Members | Related Pages | Search for 

ACE_DLList_Reverse_Iterator< T > Class Template Reference

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

#include <Containers_T.h>

Inheritance diagram for ACE_DLList_Reverse_Iterator< T >:

Inheritance graph
[legend]
Collaboration diagram for ACE_DLList_Reverse_Iterator< T >:

Collaboration graph
[legend]
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_

Friends

class ACE_DLList< T >
class ACE_DLList_Node

Detailed Description

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.

Definition at line 1152 of file Containers_T.h.

Constructor & Destructor Documentation

template<class T>
ACE_INLINE ACE_DLList_Reverse_Iterator< T >::ACE_DLList_Reverse_Iterator (  ACE_DLList< T > &  l  ) 
 

Definition at line 433 of file Containers_T.inl.

References ACE_DLList_Base. 

00434   : ACE_Double_Linked_List_Reverse_Iterator <ACE_DLList_Node> ((ACE_DLList_Base &)l),
00435     list_ (&l)
00436 {
00437 }

Member Function Documentation

template<class T>
ACE_INLINE int ACE_DLList_Reverse_Iterator< T >::advance (  void   ) 
 

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. 

00448 {
00449   return ACE_Double_Linked_List_Reverse_Iterator <ACE_DLList_Node>::advance ();
00450 }

template<class T>
ACE_INLINE void ACE_DLList_Reverse_Iterator< T >::dump (  void   )  const
 

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. 

00473 {
00474 #if defined (ACE_HAS_DUMP)
00475   ACE_Double_Linked_List_Reverse_Iterator <ACE_DLList_Node>::dump ();
00476 #endif /* ACE_HAS_DUMP */
00477 }

template<class T>
ACE_INLINE T * ACE_DLList_Reverse_Iterator< T >::next (  void   )  const
 

Deprecated:
Delegates to ACE_Double_Linked_List_Iterator.

Reimplemented from ACE_Double_Linked_List_Iterator_Base< T >.

Definition at line 464 of file Containers_T.inl.

References ACE_DLList_Node::item_. 

00465 {
00466   ACE_DLList_Node *temp = ACE_Double_Linked_List_Reverse_Iterator <ACE_DLList_Node>::next ();
00467   return (T *) (temp ? temp->item_ : 0);
00468 }

template<class T>
ACE_INLINE int ACE_DLList_Reverse_Iterator< T >::next (  T *&   ) 
 

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.

References ACE_DLList_Node::item_. 

00454 {
00455   ACE_DLList_Node *temp =
00456     ACE_Double_Linked_List_Reverse_Iterator <ACE_DLList_Node>::next ();
00457   if (temp == 0)
00458     return 0;
00459   ptr = (T *) temp->item_;
00460   return 1;
00461 }

template<class T>
ACE_INLINE int ACE_DLList_Reverse_Iterator< T >::remove (  void   ) 
 

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. 

00426 {
00427   ACE_DLList_Node *temp = ACE_Double_Linked_List_Reverse_Iterator <ACE_DLList_Node>::next ();
00428   this->ACE_Double_Linked_List_Reverse_Iterator <ACE_DLList_Node>::advance ();
00429   return list_->remove (temp);
00430 }

template<class T>
ACE_INLINE void ACE_DLList_Reverse_Iterator< T >::reset (  ACE_DLList< T > &  l  ) 
 

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.

References ACE_DLList_Base. 

00441 {
00442   list_ = &l;
00443   this->ACE_Double_Linked_List_Reverse_Iterator <ACE_DLList_Node>::reset ((ACE_DLList_Base &)l);
00444 }

Friends And Related Function Documentation

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

Definition at line 1155 of file Containers_T.h.

template<class T>
friend class ACE_DLList_Node [friend]
 

Definition at line 1156 of file Containers_T.h.

Member Data Documentation

template<class T>
ACE_DLList<T>* ACE_DLList_Reverse_Iterator< T >::list_ [private]
 

Definition at line 1196 of file Containers_T.h.

The documentation for this class was generated from the following files:
Generated on Thu Nov 9 11:21:46 2006 for ACE by doxygen 1.3.6