#include <Hash_Map_Manager_T.h>
Inheritance diagram for ACE_Hash_Map_Reverse_Iterator_Ex


Public Methods | |
| ACE_Hash_Map_Reverse_Iterator_Ex (ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &mm, int head = 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. | |
| void | dump (void) const |
| Dump the state of an object. | |
| ACE_Hash_Map_Reverse_Iterator_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>& | operator++ (void) |
| Prefix reverse. | |
| ACE_Hash_Map_Reverse_Iterator_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> | operator++ (int) |
| Postfix reverse. | |
| ACE_Hash_Map_Reverse_Iterator_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>& | operator-- (void) |
| Prefix advance. | |
| ACE_Hash_Map_Reverse_Iterator_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> | operator-- (int) |
| Postfix advance. | |
Public Attributes | |
| ACE_ALLOC_HOOK_DECLARE | |
| Declare the dynamic allocation hooks. | |
This class does not perform any internal locking of the 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 or on the '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 reverse.
|
|
||||
|
Prefix reverse.
|
|
||||
|
Postfix advance.
|
|
||||
|
Prefix advance.
|
|
|||
|
Declare the dynamic allocation hooks.
Reimplemented from ACE_Hash_Map_Iterator_Base_Ex. |
1.2.3 written by Dimitri van Heesch,
© 1997-2000