#include <Hash_Map_Manager_T.h>
Collaboration diagram for ACE_Hash_Map_Bucket_Iterator:

Public Methods | |
| ACE_Hash_Map_Bucket_Iterator (ACE_Hash_Map_Manager_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > &mm, const EXT_ID &ext_id, int tail=0) | |
| ACE_Hash_Map_Bucket_Iterator< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > & | operator++ (void) |
| Prefix advance. More... | |
| ACE_Hash_Map_Bucket_Iterator< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > | operator++ (int) |
| Postfix advance. More... | |
| ACE_Hash_Map_Bucket_Iterator< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > & | operator-- (void) |
| Prefix reverse. More... | |
| ACE_Hash_Map_Bucket_Iterator< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > | operator-- (int) |
| Postfix reverse. More... | |
| ACE_Hash_Map_Entry< EXT_ID, INT_ID > & | operator * (void) const |
| Returns a reference to the interal element <this> is pointing to. More... | |
| ACE_Hash_Map_Manager_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > & | map (void) |
| Returns reference the Hash_Map_Manager_Ex that is being iterated over. More... | |
| int | operator== (const ACE_Hash_Map_Bucket_Iterator< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > &) const |
| Check if two iterators point to the same position. More... | |
| int | operator!= (const ACE_Hash_Map_Bucket_Iterator< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > &) const |
Protected Methods | |
| int | forward_i (void) |
| 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. More... | |
| int | reverse_i (void) |
| 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. More... | |
Protected Attributes | |
| ACE_Hash_Map_Manager_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > * | map_man_ |
| Map we are iterating over. More... | |
| ssize_t | index_ |
| Keeps track of how far we've advanced in the table. More... | |
| ACE_Hash_Map_Entry< EXT_ID, INT_ID > * | next_ |
| Keeps track of how far we've advanced in a linked list in each table slot. More... | |
This class does not perform any internal locking of the <ACE_Hash_Map_Manager_Ex> 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_Hash_Map_Manager_Ex>'s internal lock, which is accessible via its <mutex> method. Note that this iterator cannot be created by calling a method on the map, since this would require
|
||||||||||||||||||||
|
|
|
||||||||||
|
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.
|
|
||||||||||
|
Returns reference the Hash_Map_Manager_Ex that is being iterated over.
|
|
||||||||||
|
Returns a reference to the interal element <this> is pointing to.
|
|
||||||||||
|
|
|
||||||||||
|
Postfix advance.
|
|
||||||||||
|
Prefix advance.
|
|
||||||||||
|
Postfix reverse.
|
|
||||||||||
|
Prefix reverse.
|
|
||||||||||
|
Check if two iterators point to the same position.
|
|
||||||||||
|
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.
|
|
|||||
|
Keeps track of how far we've advanced in the table.
|
|
|||||
|
Map we are iterating over.
|
|
|||||
|
Keeps track of how far we've advanced in a linked list in each table slot.
|
1.2.13.1 written by Dimitri van Heesch,
© 1997-2001