#include <Containers_T.h>
Inheritance diagram for ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >:


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 |
Public Attributes | |
| ACE_ALLOC_HOOK_DECLARE | |
| Declare the dynamic allocation hooks. | |
This implementation of an unordered set uses a fixed array.
|
||||||||||
|
|
|
||||||||||
|
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. |
|
||||||||||
|
STL-like iterator dereference operator: returns a reference to the node underneath the iterator. |
|
|||||
|
Declare the dynamic allocation hooks.
Reimplemented from ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >. |
1.3.9.1