Base iterator for the ACE_Hash_Multi_Map_Manager
.
More...
#include <Hash_Multi_Map_Manager_T.h>
|
| ACE_Hash_Multi_Map_Iterator_Base (ACE_Hash_Multi_Map_Manager< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > &mm, int head) |
|
int | next (ACE_Hash_Multi_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_Hash_Multi_Map_Entry< EXT_ID, INT_ID > & | operator* (void) const |
| Returns a reference to the interal element this object is pointing to. More...
|
|
ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID > * | operator-> (void) const |
| Returns a pointer to the interal element this object is pointing to. More...
|
|
ACE_Hash_Multi_Map_Manager< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > & | map (void) |
|
bool | operator== (const ACE_Hash_Multi_Map_Iterator_Base< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > &) const |
| Check if two iterators point to the same position. More...
|
|
bool | operator!= (const ACE_Hash_Multi_Map_Iterator_Base< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > &) const |
|
Base iterator for the ACE_Hash_Multi_Map_Manager
.
This class factors out common code from its templatized subclasses.
◆ ACE_Hash_Multi_Map_Iterator_Base()
ACE_Hash_Multi_Map_Iterator_Base::ACE_Hash_Multi_Map_Iterator_Base |
( |
ACE_Hash_Multi_Map_Manager< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > & |
mm, |
|
|
int |
head |
|
) |
| |
|
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_Hash_Multi_Map_Iterator_Base::done |
( |
void |
| ) |
const |
|
inline |
Returns 1 when all items have been seen, else 0.
◆ dump_i()
void ACE_Hash_Multi_Map_Iterator_Base::dump_i |
( |
void |
| ) |
const |
|
protected |
Dump the state of an object.
◆ forward_i()
int ACE_Hash_Multi_Map_Iterator_Base::forward_i |
( |
void |
| ) |
|
|
protected |
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()
Returns reference the Hash_Multi_Map_Manager
that is being iterated over.
◆ next()
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*()
Returns a reference to the interal element this object is pointing to.
◆ operator->()
Returns a pointer to the interal element this object is pointing to.
◆ operator==()
Check if two iterators point to the same position.
◆ reverse_i()
int ACE_Hash_Multi_Map_Iterator_Base::reverse_i |
( |
void |
| ) |
|
|
protected |
Move backward 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_Hash_Multi_Map_Iterator_Base::ACE_ALLOC_HOOK_DECLARE |
Declare the dynamic allocation hooks.
◆ index_
ssize_t ACE_Hash_Multi_Map_Iterator_Base::index_ |
|
protected |
Keeps track of how far we've advanced in the table.
◆ map_man_
Map we are iterating over.
◆ next_
Keeps track of how far we've advanced in a linked list in each table slot.
The documentation for this class was generated from the following files: