Forward iterator for the ACE_Map_Manager. More...
#include <Map_Manager.h>
Inheritance diagram for ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK >:
Collaboration diagram for ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK >:
Public Member Functions | |
| ACE_Map_Iterator (ACE_Map_Manager< EXT_ID, INT_ID, ACE_LOCK > &mm, int pass_end=0) | |
| int | advance () |
| void | dump () const |
| Dump the state of an object. | |
| ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK > & | operator++ () |
| Prefix advance. | |
| ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK > | operator++ (int) |
| Postfix advance. | |
| ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK > & | operator-- () |
| Prefix reverse. | |
| ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK > | operator-- (int) |
| Postfix reverse. | |
 Public Member Functions inherited from ACE_Map_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK > | |
| 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 () const |
| Returns 1 when all items have been seen, else 0. | |
| ACE_Map_Entry< EXT_ID, INT_ID > & | operator* () const |
Returns a reference to the interal element this is pointing to. | |
| ACE_Map_Manager< EXT_ID, INT_ID, ACE_LOCK > & | map () |
| 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. | |
| Public Attributes inherited from ACE_Map_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK > | |
| ACE_ALLOC_HOOK_DECLARE | |
| Declare the dynamic allocation hooks. | |
Additional Inherited Members | |
| Protected Member Functions inherited from ACE_Map_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK > | |
| int | forward_i () |
| int | reverse_i () |
| void | dump_i () const |
| Dump the state of an object. | |
| Protected Attributes inherited from ACE_Map_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK > | |
| 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... | |
Detailed Description
template<class EXT_ID, class INT_ID, class ACE_LOCK>
class ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK >
class ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK >
Forward 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.
Constructor & Destructor Documentation
◆ ACE_Map_Iterator()
|
inline |
Member Function Documentation
◆ advance()
|
inline |
Move forward by one element in the set. Returns 0 when all the items in the set have been seen, else 1.
◆ dump()
| void ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK >::dump | ( | ) | const |
Dump the state of an object.
◆ operator++() [1/2]
|
inline |
Prefix advance.
◆ operator++() [2/2]
|
inline |
Postfix advance.
◆ operator--() [1/2]
|
inline |
Prefix reverse.
◆ operator--() [2/2]
|
inline |
Postfix reverse.
Member Data Documentation
◆ ACE_ALLOC_HOOK_DECLARE
| ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK >::ACE_ALLOC_HOOK_DECLARE |
Declare the dynamic allocation hooks.
The documentation for this class was generated from the following files:
