#include <Unbounded_Set.h>
Public Member Functions | |
| ACE_Unbounded_Set_Iterator (ACE_Unbounded_Set< T > &s, int end=0) | |
| 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. | |
| void | dump (void) const |
| Dump the state of an object. | |
| ACE_Unbounded_Set_Iterator< T > | operator++ (int) |
| Postfix advance. | |
| ACE_Unbounded_Set_Iterator< T > & | operator++ (void) |
| Prefix advance. | |
| T & | operator * (void) |
| Returns a reference to the internal element <this> is pointing to. | |
| bool | operator== (const ACE_Unbounded_Set_Iterator< T > &) const |
| Check if two iterators point to the same position. | |
| bool | operator!= (const ACE_Unbounded_Set_Iterator< T > &) const |
Public Attributes | |
| ACE_ALLOC_HOOK_DECLARE | |
| Declare the dynamic allocation hooks. | |
Private Attributes | |
| ACE_Node< T > * | current_ |
| Pointer to the current node in the iteration. | |
| ACE_Unbounded_Set< T > * | set_ |
| Pointer to the set we're iterating over. | |
|
||||||||||||||||
|
|
|
||||||||||
|
Move forward by one element in the set. Returns 0 when all the items in the set have been seen, else 1. |
|
||||||||||
|
Returns 1 when all items have been seen, else 0.
|
|
||||||||||
|
Dump the state of an object.
|
|
||||||||||
|
Move to the first element in the set. Returns 0 if the set is empty, else 1. |
|
||||||||||
|
Pass back the <next_item> that hasn't been seen in the Set. Returns 0 when all items have been seen, else 1. |
|
||||||||||
|
Returns a reference to the internal element <this> is pointing to.
|
|
||||||||||
|
|
|
||||||||||
|
Prefix advance.
|
|
||||||||||
|
Postfix advance.
|
|
||||||||||
|
Check if two iterators point to the same position.
|
|
|||||
|
Declare the dynamic allocation hooks.
|
|
|||||
|
Pointer to the current node in the iteration.
|
|
|||||
|
Pointer to the set we're iterating over.
|
1.3.9.1