#include <Map_Manager.h>
Inheritance diagram for ACE_Map_Const_Iterator< EXT_ID, INT_ID, ACE_LOCK >:
Public Member Functions | |
ACE_Map_Const_Iterator (const ACE_Map_Manager< EXT_ID, INT_ID, ACE_LOCK > &mm, int pass_end=0) | |
int | advance (void) |
void | dump (void) const |
Dump the state of an object. | |
ACE_Map_Const_Iterator< EXT_ID, INT_ID, ACE_LOCK > & | operator++ (void) |
Prefix advance. | |
ACE_Map_Const_Iterator< EXT_ID, INT_ID, ACE_LOCK > | operator++ (int) |
Postfix advance. | |
ACE_Map_Const_Iterator< EXT_ID, INT_ID, ACE_LOCK > & | operator-- (void) |
Prefix reverse. | |
ACE_Map_Const_Iterator< EXT_ID, INT_ID, ACE_LOCK > | operator-- (int) |
Postfix reverse. | |
Public Attributes | |
ACE_ALLOC_HOOK_DECLARE | |
Declare the dynamic allocation hooks. |
This class does not perform any internal locking of the 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 's internal lock, which is accessible via its method.
Definition at line 621 of file Map_Manager.h.
|
Definition at line 566 of file Map_Manager.inl. References ACE_Map_Const_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK >::done().
00568 : ACE_Map_Const_Iterator_Base<EXT_ID, INT_ID, ACE_LOCK> (mm) 00569 { 00570 if (!pass_end) 00571 { 00572 00573 #if defined (ACE_HAS_LAZY_MAP_MANAGER) 00574 00575 // Start here. 00576 this->next_ = this->map_man_->occupied_list_.next (); 00577 00578 while (1) 00579 { 00580 // Stop if we reach the end. 00581 if (this->done ()) 00582 break; 00583 00584 // Break if we find a non-free slot. 00585 if (!this->map_man_->search_structure_[this->next_].free_) 00586 { 00587 break; 00588 } 00589 00590 // Go to the next item in the list. 00591 this->next_ = this->map_man_->search_structure_[this->next_].next (); 00592 } 00593 00594 #else 00595 00596 this->next_ = this->map_man_->occupied_list_.next (); 00597 00598 #endif /* ACE_HAS_LAZY_MAP_MANAGER */ 00599 00600 } 00601 } |
|
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 604 of file Map_Manager.inl. References ACE_Map_Const_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK >::forward_i().
00605 { 00606 return this->forward_i (); 00607 } |
|
Dump the state of an object.
Definition at line 684 of file Map_Manager.cpp. References ACE_Map_Const_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK >::dump_i().
00685 { 00686 #if defined (ACE_HAS_DUMP) 00687 this->dump_i (); 00688 #endif /* ACE_HAS_DUMP */ 00689 } |
|
Postfix advance.
Definition at line 619 of file Map_Manager.inl.
00620 { 00621 ACE_Map_Const_Iterator<EXT_ID, INT_ID, ACE_LOCK> retv (*this); 00622 ++*this; 00623 return retv; 00624 } |
|
Prefix advance.
Definition at line 611 of file Map_Manager.inl. References ACE_Map_Const_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK >::forward_i().
00612 { 00613 this->forward_i (); 00614 return *this; 00615 } |
|
Postfix reverse.
Definition at line 636 of file Map_Manager.inl.
00637 { 00638 ACE_Map_Const_Iterator<EXT_ID, INT_ID, ACE_LOCK> retv (*this); 00639 --*this; 00640 return retv; 00641 } |
|
Prefix reverse.
Definition at line 628 of file Map_Manager.inl. References ACE_Map_Const_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK >::reverse_i().
00629 { 00630 this->reverse_i (); 00631 return *this; 00632 } |
|
Declare the dynamic allocation hooks.
Reimplemented from ACE_Map_Const_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK >. Definition at line 652 of file Map_Manager.h. |