ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID > Class Template Reference

Define an entry in the hash table. More...

#include <Hash_Multi_Map_Manager_T.h>

Collaboration diagram for ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID >:

Collaboration graph
[legend]

List of all members.

Public Types

typedef ACE_Unbounded_Set< INT_ID > VALUE_SET
typedef
ACE_Unbounded_Set_Iterator
< INT_ID > 
VALUE_SET_ITERATOR

Public Member Functions

 ACE_Hash_Multi_Map_Entry (const EXT_ID &ext_id, const ACE_Unbounded_Set< INT_ID > &int_id_set, ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID > *next=0, ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID > *prev=0)
 Constructor.
 ACE_Hash_Multi_Map_Entry (ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID > *next, ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID > *prev)
 Constructor.
 ~ACE_Hash_Multi_Map_Entry (void)
 Destructor.
EXT_ID & key (void)
 Key accessor.
ACE_Unbounded_Set< INT_ID > & item (void)
 Item accessor.
void dump (void) const
 Dump the state of an object.

Public Attributes

EXT_ID ext_id_
ACE_Unbounded_Set< INT_ID > int_id_set_
ACE_Hash_Multi_Map_Entry
< EXT_ID, INT_ID > * 
next_
 Pointer to the next item in the bucket of overflow nodes.
ACE_Hash_Multi_Map_Entry
< EXT_ID, INT_ID > * 
prev_
 Pointer to the prev item in the bucket of overflow nodes.

Friends

class ACE_Unbounded_Set< INT_ID >


Detailed Description

template<class EXT_ID, class INT_ID>
class ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID >

Define an entry in the hash table.

Member Typedef Documentation

template<class EXT_ID, class INT_ID>
typedef ACE_Unbounded_Set<INT_ID> ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID >::VALUE_SET

template<class EXT_ID, class INT_ID>
typedef ACE_Unbounded_Set_Iterator<INT_ID> ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID >::VALUE_SET_ITERATOR


Constructor & Destructor Documentation

template<class EXT_ID, class INT_ID>
ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID >::ACE_Hash_Multi_Map_Entry ( const EXT_ID &  ext_id,
const ACE_Unbounded_Set< INT_ID > &  int_id_set,
ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID > *  next = 0,
ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID > *  prev = 0 
) [inline]

Constructor.

template<class EXT_ID, class INT_ID>
ACE_BEGIN_VERSIONED_NAMESPACE_DECL ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID >::ACE_Hash_Multi_Map_Entry ( ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID > *  next,
ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID > *  prev 
) [inline]

Constructor.

template<class EXT_ID, class INT_ID>
ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID >::~ACE_Hash_Multi_Map_Entry ( void   )  [inline]

Destructor.


Member Function Documentation

template<class EXT_ID, class INT_ID>
EXT_ID & ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID >::key ( void   )  [inline]

Key accessor.

template<class EXT_ID, class INT_ID>
ACE_Unbounded_Set< INT_ID > & ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID >::item ( void   )  [inline]

Item accessor.

template<class EXT_ID, class INT_ID>
void ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID >::dump ( void   )  const [inline]

Dump the state of an object.


Friends And Related Function Documentation

template<class EXT_ID, class INT_ID>
friend class ACE_Unbounded_Set< INT_ID > [friend]


Member Data Documentation

template<class EXT_ID, class INT_ID>
EXT_ID ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID >::ext_id_

Key used to look up an entry.

Deprecated:
Use key()

template<class EXT_ID, class INT_ID>
ACE_Unbounded_Set<INT_ID> ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID >::int_id_set_

The contents of the entry itself.

Deprecated:
Use item()

template<class EXT_ID, class INT_ID>
ACE_Hash_Multi_Map_Entry<EXT_ID, INT_ID>* ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID >::next_

Pointer to the next item in the bucket of overflow nodes.

template<class EXT_ID, class INT_ID>
ACE_Hash_Multi_Map_Entry<EXT_ID, INT_ID>* ACE_Hash_Multi_Map_Entry< EXT_ID, INT_ID >::prev_

Pointer to the prev item in the bucket of overflow nodes.


The documentation for this class was generated from the following files:

Generated on Wed Apr 23 02:39:27 2008 for ACE by  doxygen 1.5.5