## NAME

ACE_Hash_Map_Entry - Define an entry in the hash table.

## SYNOPSIS

    #include <ace/Hash_Map_Manager_T.h>

    template<class EXT_ID, class INT_ID>
    class ACE_Hash_Map_Entry
    {
      public:
        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
            );
        ACE_Hash_Map_Entry (
            ACE_Hash_Map_Entry<EXT_ID, INT_ID> *next,
            ACE_Hash_Map_Entry<EXT_ID, INT_ID> *prev
            );
        ~ACE_Hash_Map_Entry (void);
        EXT_ID ext_id_;
        INT_ID int_id_;
        ACE_Hash_Map_Entry<EXT_ID, INT_ID> *next_;
        ACE_Hash_Map_Entry<EXT_ID, INT_ID> *prev_;
        void dump (void) const;
    };

## Initialization and termination methods.

    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 (void);

Destructor.

    EXT_ID ext_id_;

Key used to look up an entry.

    INT_ID int_id_;

The contents of the entry itself.

    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.

    void dump (void) const;

Dump the state of an object.

## AUTHOR

Doug Schmidt

## LIBRARY

ace