ACE
6.1.6
|
Iterates through a const unordered set. More...
#include <Containers_T.h>
Public Member Functions | |
ACE_Fixed_Set_Const_Iterator (const ACE_Fixed_Set< T, ACE_SIZE > &s) | |
int | next (const T *&next_item) |
void | dump (void) const |
Dump the state of an object. | |
const T & | operator* (void) const |
![]() | |
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. |
Public Attributes | |
ACE_ALLOC_HOOK_DECLARE | |
Declare the dynamic allocation hooks. | |
![]() |
Additional Inherited Members | |
![]() | |
ACE_Fixed_Set_Iterator_Base (ACE_Fixed_Set< T, ACE_SIZE > &s) | |
void | dump_i (void) const |
Dump the state of an object. | |
int | next_i (T *&next_item) |
![]() | |
ACE_Fixed_Set< T, ACE_SIZE > & | s_ |
Set we are iterating over. | |
ssize_t | next_ |
How far we've advanced over the set. | |
size_t | iterated_items_ |
The number of non free items that the iterator had pointed at. |
Iterates through a const unordered set.
This implementation of an unordered set uses a fixed array.
ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >::ACE_Fixed_Set_Const_Iterator | ( | const ACE_Fixed_Set< T, ACE_SIZE > & | s | ) |
void ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >::dump | ( | void | ) | const |
Dump the state of an object.
int ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >::next | ( | const 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.
const T & ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >::operator* | ( | void | ) | const |
STL-like iterator dereference operator: returns a reference to the node underneath the iterator.
ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >::ACE_ALLOC_HOOK_DECLARE |
Declare the dynamic allocation hooks.
Reimplemented from ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >.