#include <Containers_T.h>
Inheritance diagram for ACE_Fixed_Set_Iterator< T, ACE_SIZE >:
Public Member Functions | |
ACE_Fixed_Set_Iterator (ACE_Fixed_Set< T, ACE_SIZE > &s) | |
int | next (T *&next_item) |
void | dump (void) const |
Dump the state of an object. | |
int | remove (T *&item) |
T & | operator * (void) |
Public Attributes | |
ACE_ALLOC_HOOK_DECLARE | |
Declare the dynamic allocation hooks. |
This implementation of an unordered set uses a fixed array. Allows deletions while iteration is occurring.
|
|
|
Dump the state of an object.
|
|
Pass back the <next_item> that hasn't been seen in the Set. Returns 0 when all items have been seen, else 1. Reimplemented from ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >. |
|
STL-like iterator dereference operator: returns a reference to the node underneath the iterator. |
|
Remove the item where the itearetor is located at. Returns 1 if it removes a item, else 0. Pass back the removed <item>. |
|
Declare the dynamic allocation hooks.
Reimplemented from ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >. |