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 >:

[legend]Collaboration diagram for ACE_DLList_Reverse_Iterator< T >:

[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 1150 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.

  : ACE_Double_Linked_List_Reverse_Iterator <ACE_DLList_Node> ((ACE_DLList_Base &)l),
    list_ (&l)
{
}

---

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.

References ACE_Double_Linked_List_Reverse_Iterator< ACE_DLList_Node >::advance().

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

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.

References ACE_Double_Linked_List_Reverse_Iterator< ACE_DLList_Node >::dump().

{
#if defined (ACE_HAS_DUMP)
  ACE_Double_Linked_List_Reverse_Iterator <ACE_DLList_Node>::dump ();
#endif /* ACE_HAS_DUMP */
}

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_, and ACE_Double_Linked_List_Iterator_Base< T >::next().

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

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_, and ACE_Double_Linked_List_Iterator_Base< T >::next().

{
  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;
}

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.

References ACE_Double_Linked_List_Reverse_Iterator< ACE_DLList_Node >::advance(), ACE_DLList_Reverse_Iterator< T >::list_, and ACE_Double_Linked_List_Iterator_Base< T >::next().

{
  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);
}

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_Reverse_Iterator< T >::list_, and ACE_Double_Linked_List_Reverse_Iterator< ACE_DLList_Node >::reset().

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

---

Friends And Related Function Documentation

template<class T>

friend class ACE_DLList< T > [friend]

Definition at line 1153 of file Containers_T.h.

template<class T>

friend class ACE_DLList_Node [friend]

Definition at line 1154 of file Containers_T.h.

---

Member Data Documentation

template<class T>

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

Definition at line 1194 of file Containers_T.h.

Referenced by ACE_DLList_Reverse_Iterator< T >::remove(), and ACE_DLList_Reverse_Iterator< T >::reset().

---

The documentation for this class was generated from the following files:

• Containers_T.h
• Containers_T.inl

---