#include <Malloc_T.h>
Inheritance diagram for ACE_Malloc_FIFO_Iterator_T:


Public Types | |
| typedef ACE_TYPENAME ACE_CB::ACE_Name_Node | NAME_NODE |
| typedef ACE_TYPENAME ACE_CB::ACE_Malloc_Header | MALLOC_HEADER |
Public Methods | |
| ACE_Malloc_FIFO_Iterator_T (ACE_Malloc_T< ACE_MEM_POOL_2, ACE_LOCK, ACE_CB > &malloc, const char *name=0) | |
| If <name> = 0 it will iterate through everything else only through those entries whose <name> match. More... | |
| ~ACE_Malloc_FIFO_Iterator_T (void) | |
| Destructor. More... | |
| int | done (void) const |
| Returns 1 when all items have been seen, else 0. More... | |
| int | next (void *&next_entry) |
| Pass back the next <entry> in the set that hasn't yet been visited. Returns 0 when all items have been seen, else 1. More... | |
| int | next (void *&next_entry, const char *&name) |
| Pass back the next <entry> (and the <name> associated with it) in the set that hasn't yet been visited. More... | |
| 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. More... | |
| int | start (void) |
| Go to the starting element that was inserted first. Returns 0 when there is no item in the set, else 1. More... | |
| void | dump (void) const |
| Dump the state of an object. More... | |
Public Attributes | |
| ACE_ALLOC_HOOK_DECLARE | |
| Declare the dynamic allocation hooks. More... | |
Private Attributes | |
| ACE_Malloc_T< ACE_MEM_POOL_2, ACE_LOCK, ACE_CB > & | malloc_ |
| Malloc we are iterating over. More... | |
| NAME_NODE * | curr_ |
| Keeps track of how far we've advanced... More... | |
| ACE_Read_Guard< ACE_LOCK > | guard_ |
| Lock Malloc for the lifetime of the iterator. More... | |
| const char * | name_ |
| Name that we are searching for. More... | |
Does not support deletions while iteration is occurring.
|
|||||
|
|
|
|||||
|
|
|
||||||||||||||||
|
If <name> = 0 it will iterate through everything else only through those entries whose <name> match.
|
|
||||||||||
|
Destructor.
|
|
||||||||||
|
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.
|
|
||||||||||||||||
|
Pass back the next <entry> (and the <name> associated with it) in the set that hasn't yet been visited. Returns 0 when all items have been seen, else 1. |
|
||||||||||
|
Pass back the next <entry> in the set that hasn't yet been visited. Returns 0 when all items have been seen, else 1.
|
|
||||||||||
|
Go to the starting element that was inserted first. Returns 0 when there is no item in the set, else 1.
|
|
|||||
|
Declare the dynamic allocation hooks.
|
|
|||||
|
Keeps track of how far we've advanced...
|
|
|||||
|
Lock Malloc for the lifetime of the iterator.
|
|
|||||
|
Malloc we are iterating over.
|
|
|||||
|
Name that we are searching for.
|
1.2.13.1 written by Dimitri van Heesch,
© 1997-2001