Main Page | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | File Members | Related Pages | Search for 

ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK > Class Template Reference

Forward iterator for the ACE_Map_Manager. More...

#include <Map_Manager.h>

Inheritance diagram for ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK >:

Inheritance graph
[legend]
Collaboration diagram for ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK >:

Collaboration graph
[legend]
List of all members.

Public Member Functions

 ACE_Map_Iterator (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_Iterator< EXT_ID,
INT_ID, ACE_LOCK > & 		operator++ (void)
 Prefix advance.

ACE_Map_Iterator< EXT_ID,
INT_ID, ACE_LOCK > 		operator++ (int)
 Postfix advance.

ACE_Map_Iterator< EXT_ID,
INT_ID, ACE_LOCK > & 		operator-- (void)
 Prefix reverse.

ACE_Map_Iterator< EXT_ID,
INT_ID, ACE_LOCK > 		operator-- (int)
 Postfix reverse.


Public Attributes

 ACE_ALLOC_HOOK_DECLARE
 Declare the dynamic allocation hooks.

Detailed Description

template<class EXT_ID, class INT_ID, class ACE_LOCK>
class ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK >

Forward iterator for the ACE_Map_Manager.

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 574 of file Map_Manager.h.

Constructor & Destructor Documentation

template<class EXT_ID, class INT_ID, class ACE_LOCK>
ACE_INLINE ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK >::ACE_Map_Iterator (  ACE_Map_Manager< EXT_ID, INT_ID, ACE_LOCK > &  mm,
int  pass_end = 0
) 
 

Definition at line 488 of file Map_Manager.inl.

References ACE_Map_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK >::done(). 

00490   : ACE_Map_Iterator_Base<EXT_ID, INT_ID, ACE_LOCK> (mm)
00491 {
00492   if (!pass_end)
00493     {
00494 
00495 #if defined (ACE_HAS_LAZY_MAP_MANAGER)
00496 
00497       // Start here.
00498       this->next_ = this->map_man_->occupied_list_.next ();
00499 
00500       while (1)
00501         {
00502           // Stop if we reach the end.
00503           if (this->done ())
00504             break;
00505 
00506           // Break if we find a non-free slot.
00507           if (!this->map_man_->search_structure_[this->next_].free_)
00508             {
00509               break;
00510             }
00511 
00512           // Go to the next item in the list.
00513           this->next_ = this->map_man_->search_structure_[this->next_].next ();
00514         }
00515 
00516 #else
00517 
00518       this->next_ = this->map_man_->occupied_list_.next ();
00519 
00520 #endif /* ACE_HAS_LAZY_MAP_MANAGER */
00521 
00522     }
00523 }

Member Function Documentation

template<class EXT_ID, class INT_ID, class ACE_LOCK>
ACE_INLINE int ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK >::advance (  void   ) 
 

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 526 of file Map_Manager.inl.

References ACE_Map_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK >::forward_i().

Referenced by ACE_Based_Pointer_Repository::find(), and ACE_Based_Pointer_Repository::unbind(). 

00527 {
00528   return this->forward_i ();
00529 }

template<class EXT_ID, class INT_ID, class ACE_LOCK>
void ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK >::dump (  void   )  const
 

Dump the state of an object.

Definition at line 676 of file Map_Manager.cpp.

References ACE_Map_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK >::dump_i(). 

00677 {
00678 #if defined (ACE_HAS_DUMP)
00679   this->dump_i ();
00680 #endif /* ACE_HAS_DUMP */
00681 }

template<class EXT_ID, class INT_ID, class ACE_LOCK>
ACE_INLINE ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK > ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK >::operator++ (  int   ) 
 

Postfix advance.

Definition at line 541 of file Map_Manager.inl. 

00542 {
00543   ACE_Map_Iterator<EXT_ID, INT_ID, ACE_LOCK> retv (*this);
00544   ++*this;
00545   return retv;
00546 }

template<class EXT_ID, class INT_ID, class ACE_LOCK>
ACE_INLINE ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK > & ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK >::operator++ (  void   ) 
 

Prefix advance.

Definition at line 533 of file Map_Manager.inl.

References ACE_Map_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK >::forward_i(). 

00534 {
00535   this->forward_i ();
00536   return *this;
00537 }

template<class EXT_ID, class INT_ID, class ACE_LOCK>
ACE_INLINE ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK > ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK >::operator-- (  int   ) 
 

Postfix reverse.

Definition at line 558 of file Map_Manager.inl. 

00559 {
00560   ACE_Map_Iterator<EXT_ID, INT_ID, ACE_LOCK> retv (*this);
00561   --*this;
00562   return retv;
00563 }

template<class EXT_ID, class INT_ID, class ACE_LOCK>
ACE_INLINE ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK > & ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK >::operator-- (  void   ) 
 

Prefix reverse.

Definition at line 550 of file Map_Manager.inl.

References ACE_Map_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK >::reverse_i(). 

00551 {
00552   this->reverse_i ();
00553   return *this;
00554 }

Member Data Documentation

template<class EXT_ID, class INT_ID, class ACE_LOCK>
ACE_Map_Iterator< EXT_ID, INT_ID, ACE_LOCK >::ACE_ALLOC_HOOK_DECLARE
 

Declare the dynamic allocation hooks.

Reimplemented from ACE_Map_Iterator_Base< EXT_ID, INT_ID, ACE_LOCK >.

Definition at line 605 of file Map_Manager.h.

The documentation for this class was generated from the following files:
Generated on Thu Nov 9 11:24:28 2006 for ACE by doxygen 1.3.6