#include <Containers_T.h>
Collaboration diagram for ACE_Bounded_Set_Iterator:

Public Methods | |
| ACE_Bounded_Set_Iterator (ACE_Bounded_Set<T> &s) | |
| int | 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. | |
| int | 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 | first (void) |
| Move to the first element in the set. Returns 0 if the set is empty, else 1. | |
| int | done (void) const |
| Returns 1 when all items have been seen, else 0. | |
| void | dump (void) const |
| Dump the state of an object. | |
Public Attributes | |
| ACE_ALLOC_HOOK_DECLARE | |
| Declare the dynamic allocation hooks. | |
Private Attributes | |
| ACE_Bounded_Set<T>& | s_ |
| Set we are iterating over. | |
| ssize_t | next_ |
| How far we've advanced over the set. | |
This implementation of an unordered set uses a Bounded array. Allows deletions while iteration is occurring.
|
||||
|
|
|
||||
|
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.
|
|
|||
|
Declare the dynamic allocation hooks.
|
|
|||
|
How far we've advanced over the set.
|
|
|||
|
Set we are iterating over.
|
1.2.3 written by Dimitri van Heesch,
© 1997-2000