Const iterator for the ACE_Map_Manager.
More...
#include <Map_Manager.h>
|
| ACE_Map_Const_Iterator_Base (const 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. More...
|
|
ACE_Map_Entry< EXT_ID, INT_ID > & | operator* (void) const |
| Returns a reference to the interal element this is pointing to. More...
|
|
const ACE_Map_Manager< EXT_ID, INT_ID, ACE_LOCK > & | map (void) const |
|
bool | operator== (const ACE_Map_Const_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK > &) const |
| Check if two iterators point to the same position. More...
|
|
bool | operator!= (const ACE_Map_Const_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK > &) const |
|
Const iterator for the ACE_Map_Manager.
This class factors out common code from its templatized subclasses.
◆ ACE_Map_Const_Iterator_Base()
ACE_Map_Const_Iterator_Base::ACE_Map_Const_Iterator_Base |
( |
const ACE_Map_Manager< EXT_ID, INT_ID, ACE_LOCK > & |
mm | ) |
|
|
inline |
Constructor. If head != 0, the iterator constructed is positioned at the head of the map, it is positioned at the end otherwise.
◆ done()
int ACE_Map_Const_Iterator_Base::done |
( |
void |
| ) |
const |
|
inline |
Returns 1 when all items have been seen, else 0.
◆ dump_i()
void ACE_Map_Const_Iterator_Base::dump_i |
( |
void |
| ) |
const |
|
protected |
Dump the state of an object.
◆ forward_i()
int ACE_Map_Const_Iterator_Base::forward_i |
( |
void |
| ) |
|
|
inlineprotected |
Move forward by one element in the set. Returns 0 when there's no more item in the set after the current items, else 1.
◆ map()
const ACE_Map_Manager< EXT_ID, INT_ID, ACE_LOCK > & ACE_Map_Const_Iterator_Base::map |
( |
void |
| ) |
const |
|
inline |
Returns reference the Map_Manager that is being iterated over.
◆ next()
int ACE_Map_Const_Iterator_Base::next |
( |
ACE_Map_Entry< EXT_ID, INT_ID > *& |
next_entry | ) |
const |
|
inline |
Pass back the next <entry> that hasn't been seen in the Set. Returns 0 when all items have been seen, else 1.
◆ operator!=()
◆ operator*()
ACE_Map_Entry< EXT_ID, INT_ID > & ACE_Map_Const_Iterator_Base::operator* |
( |
void |
| ) |
const |
|
inline |
Returns a reference to the interal element this
is pointing to.
◆ operator==()
Check if two iterators point to the same position.
◆ reverse_i()
int ACE_Map_Const_Iterator_Base::reverse_i |
( |
void |
| ) |
|
|
inlineprotected |
Move backware by one element in the set. Returns 0 when there's no more item in the set before the current item, else 1.
◆ ACE_ALLOC_HOOK_DECLARE
ACE_Map_Const_Iterator_Base::ACE_ALLOC_HOOK_DECLARE |
Declare the dynamic allocation hooks.
◆ map_man_
const ACE_Map_Manager<EXT_ID, INT_ID, ACE_LOCK>* ACE_Map_Const_Iterator_Base::map_man_ |
|
protected |
Map we are iterating over.
◆ next_
ACE_UINT32 ACE_Map_Const_Iterator_Base::next_ |
|
protected |
Keeps track of how far we've advanced...
The documentation for this class was generated from the following files: