#include <Hash_Map_Manager_T.h>
Inheritance diagram for ACE_Hash_Map_Const_Iterator_Ex:
Public Methods | |
ACE_Hash_Map_Const_Iterator_Ex (const ACE_Hash_Map_Manager_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > &mm, int tail=0) | |
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... | |
void | dump (void) const |
Dump the state of an object. More... | |
ACE_Hash_Map_Const_Iterator_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > & | operator++ (void) |
Prefix advance. More... | |
ACE_Hash_Map_Const_Iterator_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > | operator++ (int) |
Postfix advance. More... | |
ACE_Hash_Map_Const_Iterator_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > & | operator-- (void) |
Prefix reverse. More... | |
ACE_Hash_Map_Const_Iterator_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > | operator-- (int) |
Postfix reverse. More... | |
Public Attributes | |
ACE_ALLOC_HOOK_DECLARE | |
Declare the dynamic allocation hooks. More... |
This class does not perform any internal locking of the <ACE_Hash_Map_Manager_Ex> it is iterating upon since locking is inherently inefficient and/or error-prone within an STL-style iterator. If you require locking, you can explicitly use an <ACE_Guard> or <ACE_Read_Guard> on the <ACE_Hash_Map_Manager_Ex>'s internal lock, which is accessible via its <mutex> method.
|
|
|
Move forward by one element in the set. Returns 0 when all the items in the set have been seen, else 1.
|
|
Dump the state of an object.
|
|
Postfix advance.
|
|
Prefix advance.
|
|
Postfix reverse.
|
|
Prefix reverse.
|
|
Declare the dynamic allocation hooks.
Reimplemented from ACE_Hash_Map_Const_Iterator_Base_Ex. |