ACE
6.3.3
|
Implements a common base class for iterators for a unordered set. More...
#include <Containers_T.h>
Public Member Functions | |
int | next (T *&next_item) |
int | advance (void) |
int | first (void) |
int | done (void) const |
Returns 1 when all items have been seen, else 0. More... | |
Public Attributes | |
ACE_ALLOC_HOOK_DECLARE | |
Declare the dynamic allocation hooks. More... | |
Protected Member Functions | |
ACE_Fixed_Set_Iterator_Base (ACE_Fixed_Set< T, ACE_SIZE > &s) | |
void | dump_i (void) const |
Dump the state of an object. More... | |
int | next_i (T *&next_item) |
Protected Attributes | |
ACE_Fixed_Set< T, ACE_SIZE > & | s_ |
Set we are iterating over. More... | |
ssize_t | next_ |
How far we've advanced over the set. More... | |
size_t | iterated_items_ |
The number of non free items that the iterator had pointed at. More... | |
Implements a common base class for iterators for a unordered set.
|
protected |
int ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >::advance | ( | void | ) |
Move forward by one element in the set. Returns 0 when all the items in the set have been seen, else 1.
int ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >::done | ( | void | ) | const |
Returns 1 when all items have been seen, else 0.
|
protected |
Dump the state of an object.
int ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >::first | ( | void | ) |
Move to the first element in the set. Returns 0 if the set is empty, else 1.
int ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >::next | ( | T *& | next_item | ) |
Pass back the {next_item} that hasn't been seen in the Set. Returns 0 when all items have been seen, else 1.
|
protected |
Pass back the {next_item} that hasn't been seen in the Set. Returns 0 when all items have been seen, else 1.
ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >::ACE_ALLOC_HOOK_DECLARE |
Declare the dynamic allocation hooks.
|
protected |
The number of non free items that the iterator had pointed at.
|
protected |
How far we've advanced over the set.
|
protected |
Set we are iterating over.