ACE
6.1.4
|
Reverse Iterator for the ACE_Map_Manager. More...
#include <Map_Manager.h>
Public Member Functions | |
ACE_Map_Reverse_Iterator (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_Reverse_Iterator < EXT_ID, INT_ID, ACE_LOCK > & | operator++ (void) |
Prefix reverse. | |
ACE_Map_Reverse_Iterator < EXT_ID, INT_ID, ACE_LOCK > | operator++ (int) |
Postfix reverse. | |
ACE_Map_Reverse_Iterator < EXT_ID, INT_ID, ACE_LOCK > & | operator-- (void) |
Prefix advance. | |
ACE_Map_Reverse_Iterator < EXT_ID, INT_ID, ACE_LOCK > | operator-- (int) |
Postfix advance. | |
![]() | |
ACE_Map_Iterator_Base (ACE_Map_Manager< EXT_ID, INT_ID, ACE_LOCK > &mm) | |
int | next (ACE_Map_Entry< EXT_ID, INT_ID > *&next_entry) const |
int | done (void) const |
Returns 1 when all items have been seen, else 0. | |
ACE_Map_Entry< EXT_ID, INT_ID > & | operator* (void) const |
Returns a reference to the interal element this is pointing to. | |
ACE_Map_Manager< EXT_ID, INT_ID, ACE_LOCK > & | map (void) |
bool | operator== (const ACE_Map_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK > &) const |
Check if two iterators point to the same position. | |
bool | operator!= (const ACE_Map_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK > &) const |
Public Attributes | |
ACE_ALLOC_HOOK_DECLARE | |
Declare the dynamic allocation hooks. | |
![]() | |
ACE_ALLOC_HOOK_DECLARE | |
Declare the dynamic allocation hooks. | |
Additional Inherited Members | |
![]() | |
int | forward_i (void) |
int | reverse_i (void) |
void | dump_i (void) const |
Dump the state of an object. | |
![]() | |
ACE_Map_Manager< EXT_ID, INT_ID, ACE_LOCK > * | map_man_ |
Map we are iterating over. | |
ACE_UINT32 | next_ |
Keeps track of how far we've advanced... | |
Reverse Iterator for the ACE_Map_Manager.
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.
|
inline |
|
inline |
Move forward by one element in the set. Returns 0 when all the items in the set have been seen, else 1.
void ACE_Map_Reverse_Iterator< EXT_ID, INT_ID, ACE_LOCK >::dump | ( | void | ) | const |
Dump the state of an object.
|
inline |
Prefix reverse.
|
inline |
Postfix reverse.
|
inline |
Prefix advance.
|
inline |
Postfix advance.
ACE_Map_Reverse_Iterator< EXT_ID, INT_ID, ACE_LOCK >::ACE_ALLOC_HOOK_DECLARE |
Declare the dynamic allocation hooks.