#include <Array_Base.h>
Collaboration diagram for ACE_Array_Iterator:
Public Methods | |
ACE_Array_Iterator (ACE_Array_Base< T > &) | |
int | next (T *&next_item) |
Pass back the <next_item> that hasn't been seen in the Array. Returns 0 when all items have been seen, else 1. More... | |
int | advance (void) |
Move forward by one element in the Array. Returns 0 when all the items in the Array have been seen, else 1. More... | |
int | done (void) const |
Returns 1 when all items have been seen, else 0. More... | |
void | dump (void) const |
Dump the state of an object. More... | |
Public Attributes | |
ACE_ALLOC_HOOK_DECLARE | |
Declare the dynamic allocation hooks. More... | |
Private Attributes | |
size_t | current_ |
Pointer to the current item in the iteration. More... | |
ACE_Array_Base< T > & | array_ |
Pointer to the Array we're iterating over. More... |
This iterator is safe in the face of array element deletions. But it is NOT safe if the array is resized (via the ACE_Array assignment operator) during iteration. That would be very odd, and dangerous.
|
|
|
Move forward by one element in the Array. Returns 0 when all the items in the Array have been seen, else 1.
|
|
Returns 1 when all items have been seen, else 0.
|
|
Dump the state of an object.
|
|
Pass back the <next_item> that hasn't been seen in the Array. Returns 0 when all items have been seen, else 1.
|
|
Declare the dynamic allocation hooks.
|
|
Pointer to the Array we're iterating over.
|
|
Pointer to the current item in the iteration.
|