Implements a common base class for iterators for a double linked list ADT. More...
#include <Containers_T.h>
Public Member Functions | |
int | next (T *&) const |
T * | next (void) const |
int | done (void) const |
Returns 1 when all items have been seen, else 0. | |
T & | operator* (void) const |
void | reset (ACE_Double_Linked_List< T > &) |
Public Attributes | |
ACE_ALLOC_HOOK_DECLARE | |
Declare the dynamic allocation hooks. | |
Protected Member Functions | |
ACE_Double_Linked_List_Iterator_Base (const ACE_Double_Linked_List< T > &) | |
Constructor. | |
ACE_Double_Linked_List_Iterator_Base (const ACE_Double_Linked_List_Iterator_Base< T > &iter) | |
Copy constructor. | |
int | go_head (void) |
int | go_tail (void) |
T * | not_done (void) const |
T * | do_advance (void) |
T * | do_retreat (void) |
void | dump_i (void) const |
Dump the state of an object. | |
Protected Attributes | |
T * | current_ |
Remember where we are. | |
const ACE_Double_Linked_List< T > * | dllist_ |
Implements a common base class for iterators for a double linked list ADT.
Definition at line 556 of file Containers_T.h.
ACE_Double_Linked_List_Iterator_Base< T >::ACE_Double_Linked_List_Iterator_Base | ( | const ACE_Double_Linked_List< T > & | dll | ) | [protected] |
Constructor.
Definition at line 345 of file Containers_T.cpp.
ACE_Double_Linked_List_Iterator_Base< T >::ACE_Double_Linked_List_Iterator_Base | ( | const ACE_Double_Linked_List_Iterator_Base< T > & | iter | ) | [protected] |
T * ACE_Double_Linked_List_Iterator_Base< T >::do_advance | ( | void | ) | [protected] |
T * ACE_Double_Linked_List_Iterator_Base< T >::do_retreat | ( | void | ) | [protected] |
int ACE_Double_Linked_List_Iterator_Base< T >::done | ( | void | ) | const |
Returns 1 when all items have been seen, else 0.
Definition at line 375 of file Containers_T.cpp.
{ return this->not_done () ? 0 : 1; }
void ACE_Double_Linked_List_Iterator_Base< T >::dump_i | ( | void | ) | const [protected] |
Dump the state of an object.
Definition at line 443 of file Containers_T.cpp.
{ ACE_DEBUG ((LM_DEBUG, ACE_BEGIN_DUMP, this)); ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("current_ = %x"), this->current_)); ACE_DEBUG ((LM_DEBUG, ACE_END_DUMP)); }
int ACE_Double_Linked_List_Iterator_Base< T >::go_head | ( | void | ) | [protected] |
Move to the first element of the list. Returns 0 if the list is empty, else 1.
Definition at line 396 of file Containers_T.cpp.
int ACE_Double_Linked_List_Iterator_Base< T >::go_tail | ( | void | ) | [protected] |
Move to the last element of the list. Returns 0 if the list is empty, else 1.
Definition at line 403 of file Containers_T.cpp.
T * ACE_Double_Linked_List_Iterator_Base< T >::next | ( | void | ) | const |
Reimplemented in ACE_DLList_Iterator< T >, and ACE_DLList_Reverse_Iterator< T >.
Definition at line 361 of file Containers_T.cpp.
{ return this->not_done (); }
int ACE_Double_Linked_List_Iterator_Base< T >::next | ( | T *& | ptr | ) | const |
Passes back the {entry} under the iterator. Returns 0 if the iteration has completed, otherwise 1
Definition at line 367 of file Containers_T.cpp.
{ ptr = this->not_done (); return ptr ? 1 : 0; }
T * ACE_Double_Linked_List_Iterator_Base< T >::not_done | ( | void | ) | const [protected] |
Check if we reach the end of the list. Can also be used to get the *current* element in the list. Return the address of the current item if there are still elements left , 0 if we run out of element.
Definition at line 410 of file Containers_T.cpp.
T & ACE_Double_Linked_List_Iterator_Base< T >::operator* | ( | void | ) | const |
STL-like iterator dereference operator: returns a reference to the node underneath the iterator.
Definition at line 381 of file Containers_T.cpp.
{ return *(this->not_done ()); }
void ACE_Double_Linked_List_Iterator_Base< T >::reset | ( | ACE_Double_Linked_List< T > & | dll | ) |
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?
Reimplemented in ACE_Double_Linked_List_Iterator< T >, ACE_Double_Linked_List_Reverse_Iterator< T >, ACE_Double_Linked_List_Iterator< ACE_DLList_Node >, and ACE_Double_Linked_List_Reverse_Iterator< ACE_DLList_Node >.
Definition at line 389 of file Containers_T.cpp.
ACE_Double_Linked_List_Iterator_Base< T >::ACE_ALLOC_HOOK_DECLARE |
Declare the dynamic allocation hooks.
Reimplemented in ACE_Double_Linked_List_Iterator< T >, ACE_Double_Linked_List_Reverse_Iterator< T >, ACE_Double_Linked_List_Iterator< ACE_DLList_Node >, and ACE_Double_Linked_List_Reverse_Iterator< ACE_DLList_Node >.
Definition at line 589 of file Containers_T.h.
T* ACE_Double_Linked_List_Iterator_Base< T >::current_ [protected] |
Remember where we are.
Definition at line 635 of file Containers_T.h.
const ACE_Double_Linked_List<T>* ACE_Double_Linked_List_Iterator_Base< T >::dllist_ [protected] |
Definition at line 637 of file Containers_T.h.