ACE
6.1.8
|
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. More... | |
![]() | |
ACE_Double_Linked_List_Reverse_Iterator (ACE_Double_Linked_List< T > &) | |
void | reset (ACE_Double_Linked_List< T > &) |
int | first (void) |
int | advance (void) |
T * | advance_and_remove (bool dont_remove) |
ACE_Double_Linked_List_Reverse_Iterator < T > & | operator++ (void) |
Prefix advance. More... | |
ACE_Double_Linked_List_Reverse_Iterator < T > | operator++ (int) |
Postfix advance. More... | |
ACE_Double_Linked_List_Reverse_Iterator < T > & | operator-- (void) |
Prefix reverse. More... | |
ACE_Double_Linked_List_Reverse_Iterator < T > | operator-- (int) |
Postfix reverse. More... | |
void | dump (void) const |
Dump the state of an object. More... | |
![]() | |
int | next (T *&) const |
T * | next (void) const |
int | done (void) const |
Returns 1 when all items have been seen, else 0. More... | |
T & | operator* (void) const |
void | reset (ACE_Double_Linked_List< T > &) |
Private Attributes | |
ACE_DLList< T > * | list_ |
Friends | |
class | ACE_DLList< T > |
class | ACE_DLList_Node |
Additional Inherited Members | |
![]() | |
ACE_ALLOC_HOOK_DECLARE | |
Declare the dynamic allocation hooks. More... | |
![]() | |
ACE_Double_Linked_List_Iterator_Base (const ACE_Double_Linked_List< T > &) | |
Constructor. More... | |
ACE_Double_Linked_List_Iterator_Base (const ACE_Double_Linked_List_Iterator_Base< T > &iter) | |
Copy constructor. More... | |
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. More... | |
![]() | |
T * | current_ |
Remember where we are. More... | |
const ACE_Double_Linked_List< T > * | dllist_ |
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.
|
inline |
|
inline |
Move forward by one element in the list. Returns 0 when all the items in the list have been seen, else 1.
|
inline |
Delegates to ACE_Double_Linked_List_Iterator.
|
inline |
Pass back the {next_item} that hasn't been seen in the list. Returns 0 when all items have been seen, else 1.
|
inline |
|
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.
|
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?
|
friend |
|
friend |
|
private |