#include <Containers_T.h>
Inheritance diagram for ACE_Double_Linked_List_Iterator_Base< T >:
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_ |
Definition at line 558 of file Containers_T.h.
|
Constructor.
Definition at line 345 of file Containers_T.cpp.
|
|
Copy constructor.
Definition at line 352 of file Containers_T.cpp.
|
|
Advance to the next element in the list. Return the address of the next element if there are more, 0 otherwise. Definition at line 419 of file Containers_T.cpp. References ACE_Double_Linked_List_Iterator_Base< T >::not_done(). Referenced by ACE_Double_Linked_List_Iterator< T >::advance(), ACE_Double_Linked_List_Iterator< T >::advance_and_remove(), ACE_Double_Linked_List_Iterator< T >::operator++(), and ACE_Double_Linked_List_Reverse_Iterator< T >::operator--().
|
|
Retreat to the previous element in the list. Return the address of the previous element if there are more, 0 otherwise. Definition at line 431 of file Containers_T.cpp. References ACE_Double_Linked_List_Iterator_Base< T >::not_done(). Referenced by ACE_Double_Linked_List_Reverse_Iterator< T >::advance(), ACE_Double_Linked_List_Reverse_Iterator< T >::advance_and_remove(), ACE_Double_Linked_List_Reverse_Iterator< T >::operator++(), and ACE_Double_Linked_List_Iterator< T >::operator--().
|
|
|
Dump the state of an object.
Definition at line 443 of file Containers_T.cpp. References ACE_BEGIN_DUMP, ACE_DEBUG, ACE_END_DUMP, ACE_LIB_TEXT, and LM_DEBUG. Referenced by ACE_Double_Linked_List_Reverse_Iterator< T >::dump(), and ACE_Double_Linked_List_Iterator< T >::dump().
|
|
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. References ACE_Double_Linked_List_Iterator_Base< T >::dllist_. Referenced by ACE_Double_Linked_List_Iterator< T >::first().
|
|
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. References ACE_Double_Linked_List_Iterator_Base< T >::dllist_. Referenced by ACE_Double_Linked_List_Reverse_Iterator< T >::first().
|
|
Reimplemented in ACE_DLList_Iterator< T >, and ACE_DLList_Reverse_Iterator< T >. Definition at line 361 of file Containers_T.cpp. References ACE_Double_Linked_List_Iterator_Base< T >::not_done(). Referenced by ACE_Double_Linked_List_Reverse_Iterator< T >::advance_and_remove(), and ACE_Double_Linked_List_Iterator< T >::advance_and_remove().
00362 { 00363 return this->not_done (); 00364 } |
|
|
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. References ACE_Double_Linked_List_Iterator_Base< T >::dllist_. Referenced by ACE_Double_Linked_List_Iterator_Base< T >::do_advance(), ACE_Double_Linked_List_Iterator_Base< T >::do_retreat(), ACE_Double_Linked_List_Iterator_Base< T >::done(), ACE_Double_Linked_List_Iterator_Base< T >::next(), and ACE_Double_Linked_List_Iterator_Base< T >::operator *().
|
|
STL-like iterator dereference operator: returns a reference to the node underneath the iterator. Definition at line 381 of file Containers_T.cpp. References ACE_Double_Linked_List_Iterator_Base< T >::not_done().
00382 { 00383 return *(this->not_done ()); 00384 } |
|
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 >, and ACE_Double_Linked_List_Reverse_Iterator< T >. Definition at line 389 of file Containers_T.cpp. References ACE_Double_Linked_List_Iterator_Base< T >::dllist_.
|
|
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 591 of file Containers_T.h. |
|
Remember where we are.
Definition at line 637 of file Containers_T.h. |
|