ACE  6.0.6
Public Types | Public Member Functions | Public Attributes | Protected Member Functions | Protected Attributes
ACE_Hash_Map_Iterator_Base_Ex Class Reference

Base iterator for the ACE_Hash_Map_Manager_Ex. More...

#include <Hash_Map_Manager_T.h>

Collaboration diagram for ACE_Hash_Map_Iterator_Base_Ex:
Collaboration graph
[legend]

List of all members.

Public Types

typedef
ACE_Hash_Map_Manager_Ex
< EXT_ID, INT_ID, HASH_KEY,
COMPARE_KEYS, ACE_LOCK > 
container_type
typedef container_type::value_type value_type
typedef container_type::reference reference
typedef container_type::pointer pointer
typedef
container_type::difference_type 
difference_type

Public Member Functions

 ACE_Hash_Map_Iterator_Base_Ex (ACE_Hash_Map_Manager_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > &mm, bool head)
 Contructor.
 ACE_Hash_Map_Iterator_Base_Ex (ACE_Hash_Map_Manager_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > &mm, ACE_Hash_Map_Entry< EXT_ID, INT_ID > *entry, size_t index)
 Contructor.
int next (ACE_Hash_Map_Entry< EXT_ID, INT_ID > *&next_entry) const
int done (void) const
 Returns 1 when all items have been seen, else 0.
ACE_Hash_Map_Entry< EXT_ID,
INT_ID > & 
operator* (void) const
 Returns a reference to the interal element this is pointing to.
ACE_Hash_Map_Entry< EXT_ID,
INT_ID > * 
operator-> (void) const
 Returns a pointer to the interal element this is pointing to.
ACE_Hash_Map_Manager_Ex
< EXT_ID, INT_ID, HASH_KEY,
COMPARE_KEYS, ACE_LOCK > & 
map (void)
bool operator== (const ACE_Hash_Map_Iterator_Base_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > &) const
 Check if two iterators point to the same position.
bool operator!= (const ACE_Hash_Map_Iterator_Base_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > &) const

Public Attributes

 ACE_ALLOC_HOOK_DECLARE
 Declare the dynamic allocation hooks.

Protected Member Functions

int forward_i (void)
int reverse_i (void)
void dump_i (void) const
 Dump the state of an object.

Protected Attributes

ACE_Hash_Map_Manager_Ex
< EXT_ID, INT_ID, HASH_KEY,
COMPARE_KEYS, ACE_LOCK > * 
map_man_
 Map we are iterating over.
ssize_t index_
 Keeps track of how far we've advanced in the table.
ACE_Hash_Map_Entry< EXT_ID,
INT_ID > * 
next_

Detailed Description

Base iterator for the ACE_Hash_Map_Manager_Ex.

This class factors out common code from its templatized subclasses.


Member Typedef Documentation

typedef ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> ACE_Hash_Map_Iterator_Base_Ex::container_type

Constructor & Destructor Documentation

ACE_Hash_Map_Iterator_Base_Ex::ACE_Hash_Map_Iterator_Base_Ex ( ACE_Hash_Map_Manager_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > &  mm,
bool  head 
)

Contructor.

If head != false, the iterator constructed is positioned at the head of the map. It is positioned at the end otherwise.

ACE_Hash_Map_Iterator_Base_Ex::ACE_Hash_Map_Iterator_Base_Ex ( ACE_Hash_Map_Manager_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > &  mm,
ACE_Hash_Map_Entry< EXT_ID, INT_ID > *  entry,
size_t  index 
)

Contructor.

This constructor positions the iterator to the given entry.


Member Function Documentation

int ACE_Hash_Map_Iterator_Base_Ex::done ( void  ) const

Returns 1 when all items have been seen, else 0.

void ACE_Hash_Map_Iterator_Base_Ex::dump_i ( void  ) const [protected]

Dump the state of an object.

int ACE_Hash_Map_Iterator_Base_Ex::forward_i ( void  ) [protected]

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.

ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>& ACE_Hash_Map_Iterator_Base_Ex::map ( void  )

Returns reference the Hash_Map_Manager_Ex that is being iterated over.

int ACE_Hash_Map_Iterator_Base_Ex::next ( ACE_Hash_Map_Entry< EXT_ID, INT_ID > *&  next_entry) const

Pass back the next <entry> that hasn't been seen in the Set. Returns 0 when all items have been seen, else 1.

bool ACE_Hash_Map_Iterator_Base_Ex::operator!= ( const ACE_Hash_Map_Iterator_Base_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > &  ) const
ACE_Hash_Map_Entry<EXT_ID, INT_ID>& ACE_Hash_Map_Iterator_Base_Ex::operator* ( void  ) const

Returns a reference to the interal element this is pointing to.

ACE_Hash_Map_Entry<EXT_ID, INT_ID>* ACE_Hash_Map_Iterator_Base_Ex::operator-> ( void  ) const

Returns a pointer to the interal element this is pointing to.

bool ACE_Hash_Map_Iterator_Base_Ex::operator== ( const ACE_Hash_Map_Iterator_Base_Ex< EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK > &  ) const

Check if two iterators point to the same position.

int ACE_Hash_Map_Iterator_Base_Ex::reverse_i ( void  ) [protected]

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.


Member Data Documentation

Declare the dynamic allocation hooks.

Reimplemented in ACE_Hash_Map_Reverse_Iterator_Ex, and ACE_Hash_Map_Iterator_Ex.

Keeps track of how far we've advanced in the table.

ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>* ACE_Hash_Map_Iterator_Base_Ex::map_man_ [protected]

Map we are iterating over.

Keeps track of how far we've advanced in a linked list in each table slot.


The documentation for this class was generated from the following file:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines