ACE_Hash_Map_Entry< EXT_ID, INT_ID > Class Template Reference

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

#include <Hash_Map_Manager_T.h>

Public Member Functions
	ACE_Hash_Map_Entry (const EXT_ID &ext_id, const INT_ID &int_id, ACE_Hash_Map_Entry< EXT_ID, INT_ID > *next=0, ACE_Hash_Map_Entry< EXT_ID, INT_ID > *prev=0)
	Constructor.
	ACE_Hash_Map_Entry (ACE_Hash_Map_Entry< EXT_ID, INT_ID > *next, ACE_Hash_Map_Entry< EXT_ID, INT_ID > *prev)
	Constructor.
	~ACE_Hash_Map_Entry ()
	Destructor.
EXT_ID &	key ()
	Key accessor.
const EXT_ID &	key () const
	Read-only key accessor.
INT_ID &	item ()
	Item accessor.
const INT_ID &	item () const
	Read-only item accessor.
void	dump () const
	Dump the state of an object.

Public Attributes
EXT_ID	ext_id_
INT_ID	int_id_
ACE_Hash_Map_Entry< EXT_ID, INT_ID > *	next_
	Pointer to the next item in the bucket of overflow nodes.
ACE_Hash_Map_Entry< EXT_ID, INT_ID > *	prev_
	Pointer to the prev item in the bucket of overflow nodes.

Detailed Description

template<class EXT_ID, class INT_ID>
class ACE_Hash_Map_Entry< EXT_ID, INT_ID >

Define an entry in the hash table.

Constructor & Destructor Documentation

ACE_Hash_Map_Entry() [1/2]

template<class EXT_ID , class INT_ID >

ACE_Hash_Map_Entry< EXT_ID, INT_ID >::ACE_Hash_Map_Entry	(	const EXT_ID &	ext_id,
		const INT_ID &	int_id,
		ACE_Hash_Map_Entry< EXT_ID, INT_ID > *	next = 0,
		ACE_Hash_Map_Entry< EXT_ID, INT_ID > *	prev = 0 )

Constructor.

ACE_Hash_Map_Entry() [2/2]

template<class EXT_ID , class INT_ID >

class INT_ID ACE_Hash_Map_Entry< EXT_ID, INT_ID >::ACE_Hash_Map_Entry	(	ACE_Hash_Map_Entry< EXT_ID, INT_ID > *	next,
		ACE_Hash_Map_Entry< EXT_ID, INT_ID > *	prev )

Constructor.

~ACE_Hash_Map_Entry()

template<class EXT_ID , class INT_ID >

ACE_Hash_Map_Entry< EXT_ID, INT_ID >::~ACE_Hash_Map_Entry

(

)

Destructor.

Member Function Documentation

dump()

template<class EXT_ID , class INT_ID >

void ACE_Hash_Map_Entry< EXT_ID, INT_ID >::dump

(

)

const

Dump the state of an object.

item() [1/2]

template<class EXT_ID , class INT_ID >

INT_ID & ACE_Hash_Map_Entry< EXT_ID, INT_ID >::item

(

)

Item accessor.

item() [2/2]

template<class EXT_ID , class INT_ID >

const INT_ID & ACE_Hash_Map_Entry< EXT_ID, INT_ID >::item

(

)

const

Read-only item accessor.

key() [1/2]

template<class EXT_ID , class INT_ID >

EXT_ID & ACE_Hash_Map_Entry< EXT_ID, INT_ID >::key

(

)

Key accessor.

key() [2/2]

template<class EXT_ID , class INT_ID >

const EXT_ID & ACE_Hash_Map_Entry< EXT_ID, INT_ID >::key

(

)

const

Read-only key accessor.

Member Data Documentation

ext_id_

template<class EXT_ID , class INT_ID >

EXT_ID ACE_Hash_Map_Entry< EXT_ID, INT_ID >::ext_id_

Key used to look up an entry.

Deprecated

Use key()

int_id_

template<class EXT_ID , class INT_ID >

INT_ID ACE_Hash_Map_Entry< EXT_ID, INT_ID >::int_id_

The contents of the entry itself.

Deprecated

Use item()

next_

template<class EXT_ID , class INT_ID >

ACE_Hash_Map_Entry<EXT_ID, INT_ID>* ACE_Hash_Map_Entry< EXT_ID, INT_ID >::next_

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

prev_

template<class EXT_ID , class INT_ID >

ACE_Hash_Map_Entry<EXT_ID, INT_ID>* ACE_Hash_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:

• Hash_Map_Manager_T.h
• Hash_Map_Manager_T.cpp