#include <Map_Manager.h>
Inheritance diagram for ACE_Map_Const_Iterator< EXT_ID, INT_ID, ACE_LOCK >:


Public Methods | |
| ACE_Map_Const_Iterator (const ACE_Map_Manager< EXT_ID, INT_ID, ACE_LOCK > &mm, int pass_end=0) | |
| int | advance (void) |
| void | dump (void) const |
| Dump the state of an object. | |
| ACE_Map_Const_Iterator< EXT_ID, INT_ID, ACE_LOCK > & | operator++ (void) |
| Prefix advance. | |
| ACE_Map_Const_Iterator< EXT_ID, INT_ID, ACE_LOCK > | operator++ (int) |
| Postfix advance. | |
| ACE_Map_Const_Iterator< EXT_ID, INT_ID, ACE_LOCK > & | operator-- (void) |
| Prefix reverse. | |
| ACE_Map_Const_Iterator< EXT_ID, INT_ID, ACE_LOCK > | operator-- (int) |
| Postfix reverse. | |
Public Attributes | |
| ACE_ALLOC_HOOK_DECLARE | |
| Declare the dynamic allocation hooks. | |
This class does not perform any internal locking of the <ACE_Map_Manager> 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_Map_Manager>'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_Map_Const_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK >. |
1.2.18