#include <Hash_Map_Manager_T.h>
Inheritance diagram for ACE_Hash_Map_Reverse_Iterator_Ex:


Public Methods | |
| ACE_Hash_Map_Reverse_Iterator_Ex (ACE_Hash_Map_Manager_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > &mm, int head=0) | |
| int | advance (void) |
| Move forward by one element in the set. Returns 0 when all the items in the set have been seen, else 1. More... | |
| void | dump (void) const |
| Dump the state of an object. More... | |
| ACE_Hash_Map_Reverse_Iterator_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > & | operator++ (void) |
| Prefix reverse. More... | |
| ACE_Hash_Map_Reverse_Iterator_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > | operator++ (int) |
| Postfix reverse. More... | |
| ACE_Hash_Map_Reverse_Iterator_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > & | operator-- (void) |
| Prefix advance. More... | |
| ACE_Hash_Map_Reverse_Iterator_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > | operator-- (int) |
| Postfix advance. More... | |
Public Attributes | |
| ACE_ALLOC_HOOK_DECLARE | |
| Declare the dynamic allocation hooks. 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.
Definition at line 774 of file Hash_Map_Manager_T.h.
|
||||||||||||||||
|
Definition at line 801 of file Hash_Map_Manager_T.i. References ACE_TRACE, and ACE_Hash_Map_Iterator_Base_Ex::reverse_i.
00802 : ACE_Hash_Map_Iterator_Base_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> (mm, head) 00803 { 00804 ACE_TRACE ("ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>::ACE_Hash_Map_Reverse_Iterator_Ex"); 00805 if (head == 0) 00806 this->reverse_i (); 00807 } |
|
||||||||||
|
Move forward by one element in the set. Returns 0 when all the items in the set have been seen, else 1.
Definition at line 810 of file Hash_Map_Manager_T.i. References ACE_TRACE, and ACE_Hash_Map_Iterator_Base_Ex::reverse_i.
|
|
||||||||||
|
Dump the state of an object.
Definition at line 793 of file Hash_Map_Manager_T.i. References ACE_TRACE, and ACE_Hash_Map_Iterator_Base_Ex::dump_i.
|
|
||||||||||
|
Postfix reverse.
Definition at line 828 of file Hash_Map_Manager_T.i. References ACE_TRACE, and ACE_Hash_Map_Iterator_Base_Ex::reverse_i.
00829 {
00830 ACE_TRACE ("ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>::operator++ (int)");
00831
00832 ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> retv (*this);
00833 this->reverse_i ();
00834 return retv;
00835 }
|
|
||||||||||
|
Prefix reverse.
Definition at line 818 of file Hash_Map_Manager_T.i. References ACE_TRACE, and ACE_Hash_Map_Iterator_Base_Ex::reverse_i.
|
|
||||||||||
|
Postfix advance.
Definition at line 849 of file Hash_Map_Manager_T.i. References ACE_TRACE, and ACE_Hash_Map_Iterator_Base_Ex::forward_i.
00850 {
00851 ACE_TRACE ("ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>::operator-- (int)");
00852
00853 ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> retv (*this);
00854 this->forward_i ();
00855 return retv;
00856 }
|
|
||||||||||
|
Prefix advance.
Definition at line 839 of file Hash_Map_Manager_T.i. References ACE_TRACE, and ACE_Hash_Map_Iterator_Base_Ex::forward_i.
|
|
|||||
|
Declare the dynamic allocation hooks.
Reimplemented from ACE_Hash_Map_Iterator_Base_Ex. Definition at line 804 of file Hash_Map_Manager_T.h. |
1.2.14 written by Dimitri van Heesch,
© 1997-2002