#include <Map_Manager.h>
Inheritance diagram for ACE_Map_Reverse_Iterator:


Public Methods | |
| ACE_Map_Reverse_Iterator (ACE_Map_Manager< EXT_ID, INT_ID, ACE_LOCK > &mm, int pass_end=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_Map_Reverse_Iterator< EXT_ID, INT_ID, ACE_LOCK > & | operator++ (void) |
| Prefix reverse. More... | |
| ACE_Map_Reverse_Iterator< EXT_ID, INT_ID, ACE_LOCK > | operator++ (int) |
| Postfix reverse. More... | |
| ACE_Map_Reverse_Iterator< EXT_ID, INT_ID, ACE_LOCK > & | operator-- (void) |
| Prefix advance. More... | |
| ACE_Map_Reverse_Iterator< EXT_ID, INT_ID, 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_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.
Definition at line 664 of file Map_Manager.h.
|
||||||||||||||||
|
Definition at line 638 of file Map_Manager.i. References ACE_Map_Iterator_Base::done, ACE_Map_Iterator_Base::map_man_, and ACE_Map_Iterator_Base::next_.
00640 : ACE_Map_Iterator_Base<EXT_ID, INT_ID, ACE_LOCK> (mm) 00641 { 00642 if (!pass_end) 00643 { 00644 00645 #if defined (ACE_HAS_LAZY_MAP_MANAGER) 00646 00647 // Start here. 00648 this->next_ = this->map_man_->occupied_list_.prev (); 00649 00650 while (1) 00651 { 00652 // Stop if we reach the end. 00653 if (this->done ()) 00654 break; 00655 00656 // Break if we find a non-free slot. 00657 if (!this->map_man_->search_structure_[this->next_].free_) 00658 { 00659 break; 00660 } 00661 00662 // Go to the prev item in the list. 00663 this->next_ = this->map_man_->search_structure_[this->next_].prev (); 00664 } 00665 00666 #else 00667 00668 this->next_ = this->map_man_->occupied_list_.prev (); 00669 00670 #endif /* ACE_HAS_LAZY_MAP_MANAGER */ 00671 00672 } 00673 } |
|
||||||||||
|
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 676 of file Map_Manager.i. References ACE_Map_Iterator_Base::reverse_i.
00677 {
00678 return this->reverse_i ();
00679 }
|
|
||||||||||
|
Dump the state of an object.
Definition at line 687 of file Map_Manager.cpp. References ACE_Map_Iterator_Base::dump_i.
00688 {
00689 this->dump_i ();
00690 }
|
|
||||||||||
|
Postfix reverse.
Definition at line 691 of file Map_Manager.i. References ACE_Map_Iterator_Base::reverse_i.
00692 {
00693 ACE_Map_Reverse_Iterator<EXT_ID, INT_ID, ACE_LOCK> retv (*this);
00694 this->reverse_i ();
00695 return retv;
00696 }
|
|
||||||||||
|
Prefix reverse.
Definition at line 683 of file Map_Manager.i. References ACE_Map_Iterator_Base::reverse_i.
00684 {
00685 this->reverse_i ();
00686 return *this;
00687 }
|
|
||||||||||
|
Postfix advance.
Definition at line 708 of file Map_Manager.i. References ACE_Map_Iterator_Base::forward_i.
00709 {
00710 ACE_Map_Reverse_Iterator<EXT_ID, INT_ID, ACE_LOCK> retv (*this);
00711 this->forward_i ();
00712 return retv;
00713 }
|
|
||||||||||
|
Prefix advance.
Definition at line 700 of file Map_Manager.i. References ACE_Map_Iterator_Base::forward_i.
00701 {
00702 this->forward_i ();
00703 return *this;
00704 }
|
|
|||||
|
Declare the dynamic allocation hooks.
Reimplemented from ACE_Map_Iterator_Base. Definition at line 695 of file Map_Manager.h. |
1.2.14 written by Dimitri van Heesch,
© 1997-2002