qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize > Class Template Reference

#include <rtpkeyhashtable.h>

Collaboration diagram for qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >:

Classes
class	HashElement

Public Member Functions
	RTPKeyHashTable ()
	~RTPKeyHashTable ()
void	GotoFirstElement ()
void	GotoLastElement ()
bool	HasCurrentElement ()
int	DeleteCurrentElement ()
Element &	GetCurrentElement ()
Key &	GetCurrentKey ()
int	GotoElement (const Key &k)
bool	HasElement (const Key &k)
void	GotoNextElement ()
void	GotoPreviousElement ()
void	Clear ()
int	AddElement (const Key &k, const Element &elem)
int	DeleteElement (const Key &k)

Private Attributes
HashElement *	table [hashsize]
HashElement *	firsthashelem
HashElement *	lasthashelem
HashElement *	curhashelem

Detailed Description

template<class Key, class Element, class GetIndex, int hashsize>
class qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >

Definition at line 48 of file rtpkeyhashtable.h.

Constructor & Destructor Documentation

RTPKeyHashTable()

template<class Key , class Element , class GetIndex , int hashsize>

qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >::RTPKeyHashTable ( )

inline

Definition at line 128 of file rtpkeyhashtable.h.

{
    for (int i = 0; i < hashsize; i++)
        table[i] = 0;
    firsthashelem = 0;
    lasthashelem = 0;
}

~RTPKeyHashTable()

template<class Key, class Element, class GetIndex, int hashsize>

qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >::~RTPKeyHashTable ( )

inline

Definition at line 52 of file rtpkeyhashtable.h.

    {
        Clear();
    }

Member Function Documentation

AddElement()

template<class Key, class Element, class GetIndex , int hashsize>

int qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >::AddElement ( const Key &  k, const Element &  elem  )

inline

Definition at line 275 of file rtpkeyhashtable.h.

Referenced by qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::GetCurrentKey().

{
    int index;
    bool found;
    HashElement *e, *newelem;

    index = GetIndex::GetIndex(k);
    if (index >= hashsize)
        return ERR_RTP_KEYHASHTABLE_FUNCTIONRETURNEDINVALIDHASHINDEX;

    e = table[index];
    found = false;
    while (!found && e != 0)
    {
        if (e->GetKey() == k)
            found = true;
        else
            e = e->hashnext;
    }
    if (found)
        return ERR_RTP_KEYHASHTABLE_KEYALREADYEXISTS;

    // Okay, the key doesn't exist, so we can add the new element in the hash table

    newelem = new HashElement(k, elem, index);

    e = table[index];
    table[index] = newelem;
    newelem->hashnext = e;
    if (e != 0)
        e->hashprev = newelem;

    // Now, we still got to add it to the linked list

    if (firsthashelem == 0)
    {
        firsthashelem = newelem;
        lasthashelem = newelem;
    }
    else // there already are some elements in the list
    {
        lasthashelem->listnext = newelem;
        newelem->listprev = lasthashelem;
        lasthashelem = newelem;
    }
    return 0;
}

Here is the caller graph for this function:

Clear()

template<class Key , class Element , class GetIndex , int hashsize>

void qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >::Clear ( )

inline

Definition at line 256 of file rtpkeyhashtable.h.

Referenced by qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::GetCurrentKey(), and qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::~RTPKeyHashTable().

{
    HashElement *tmp1, *tmp2;

    for (int i = 0; i < hashsize; i++)
        table[i] = 0;

    tmp1 = firsthashelem;
    while (tmp1 != 0)
    {
        tmp2 = tmp1->listnext;
        delete tmp1;
        tmp1 = tmp2;
    }
    firsthashelem = 0;
    lasthashelem = 0;
}

Here is the caller graph for this function:

DeleteCurrentElement()

template<class Key , class Element , class GetIndex , int hashsize>

int qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >::DeleteCurrentElement ( )

inline

Definition at line 137 of file rtpkeyhashtable.h.

Referenced by qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::DeleteElement(), and qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::HasCurrentElement().

{
    if (curhashelem)
    {
        HashElement *tmp1, *tmp2;
        int index;

        // First, relink elements in current hash bucket

        index = curhashelem->GetHashIndex();
        tmp1 = curhashelem->hashprev;
        tmp2 = curhashelem->hashnext;
        if (tmp1 == 0) // no previous element in hash bucket
        {
            table[index] = tmp2;
            if (tmp2 != 0)
                tmp2->hashprev = 0;
        }
        else // there is a previous element in the hash bucket
        {
            tmp1->hashnext = tmp2;
            if (tmp2 != 0)
                tmp2->hashprev = tmp1;
        }

        // Relink elements in list

        tmp1 = curhashelem->listprev;
        tmp2 = curhashelem->listnext;
        if (tmp1 == 0) // curhashelem is first in list
        {
            firsthashelem = tmp2;
            if (tmp2 != 0)
                tmp2->listprev = 0;
            else
                // curhashelem is also last in list
                lasthashelem = 0;
        }
        else
        {
            tmp1->listnext = tmp2;
            if (tmp2 != 0)
                tmp2->listprev = tmp1;
            else
                // curhashelem is last in list
                lasthashelem = tmp1;
        }

        // finally, with everything being relinked, we can delete curhashelem
        delete curhashelem;
        curhashelem = tmp2; // Set to next element in list
    }
    else
        return ERR_RTP_KEYHASHTABLE_NOCURRENTELEMENT;
    return 0;
}

Here is the caller graph for this function:

DeleteElement()

template<class Key, class Element , class GetIndex , int hashsize>

int qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >::DeleteElement ( const Key &  k )

inline

Definition at line 324 of file rtpkeyhashtable.h.

Referenced by qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::GetCurrentKey().

{
    int status;

    status = GotoElement(k);
    if (status < 0)
        return status;
    return DeleteCurrentElement();
}

Here is the caller graph for this function:

GetCurrentElement()

template<class Key, class Element, class GetIndex, int hashsize>

Element& qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >::GetCurrentElement ( )

inline

Definition at line 70 of file rtpkeyhashtable.h.

    {
        return curhashelem->GetElement();
    }

GetCurrentKey()

template<class Key, class Element, class GetIndex, int hashsize>

Key& qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >::GetCurrentKey ( )

inline

Definition at line 74 of file rtpkeyhashtable.h.

    {
        return curhashelem->GetKey();
    }

GotoElement()

template<class Key, class Element , class GetIndex , int hashsize>

int qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >::GotoElement ( const Key &  k )

inline

Definition at line 195 of file rtpkeyhashtable.h.

Referenced by qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::DeleteElement(), and qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::GetCurrentKey().

{
    int index;
    bool found;

    index = GetIndex::GetIndex(k);
    if (index >= hashsize)
        return ERR_RTP_KEYHASHTABLE_FUNCTIONRETURNEDINVALIDHASHINDEX;

    curhashelem = table[index];
    found = false;
    while (!found && curhashelem != 0)
    {
        if (curhashelem->GetKey() == k)
            found = true;
        else
            curhashelem = curhashelem->hashnext;
    }
    if (!found)
        return ERR_RTP_KEYHASHTABLE_KEYNOTFOUND;
    return 0;
}

Here is the caller graph for this function:

GotoFirstElement()

template<class Key, class Element, class GetIndex, int hashsize>

void qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >::GotoFirstElement ( )

inline

Definition at line 57 of file rtpkeyhashtable.h.

    {
        curhashelem = firsthashelem;
    }

GotoLastElement()

template<class Key, class Element, class GetIndex, int hashsize>

void qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >::GotoLastElement ( )

inline

Definition at line 61 of file rtpkeyhashtable.h.

    {
        curhashelem = lasthashelem;
    }

GotoNextElement()

template<class Key , class Element , class GetIndex , int hashsize>

void qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >::GotoNextElement ( )

inline

Definition at line 242 of file rtpkeyhashtable.h.

Referenced by qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::GetCurrentKey().

{
    if (curhashelem)
        curhashelem = curhashelem->listnext;
}

Here is the caller graph for this function:

GotoPreviousElement()

template<class Key , class Element , class GetIndex , int hashsize>

void qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >::GotoPreviousElement ( )

inline

Definition at line 249 of file rtpkeyhashtable.h.

Referenced by qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::GetCurrentKey().

{
    if (curhashelem)
        curhashelem = curhashelem->listprev;
}

Here is the caller graph for this function:

HasCurrentElement()

template<class Key, class Element, class GetIndex, int hashsize>

bool qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >::HasCurrentElement ( )

inline

Definition at line 65 of file rtpkeyhashtable.h.

    {
        return (curhashelem == 0) ? false : true;
    }

HasElement()

template<class Key, class Element , class GetIndex , int hashsize>

bool qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >::HasElement ( const Key &  k )

inline

Definition at line 219 of file rtpkeyhashtable.h.

Referenced by qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::GetCurrentKey().

{
    int index;
    bool found;
    HashElement *tmp;

    index = GetIndex::GetIndex(k);
    if (index >= hashsize)
        return false;

    tmp = table[index];
    found = false;
    while (!found && tmp != 0)
    {
        if (tmp->GetKey() == k)
            found = true;
        else
            tmp = tmp->hashnext;
    }
    return found;
}

Here is the caller graph for this function:

Member Data Documentation

curhashelem

template<class Key, class Element, class GetIndex, int hashsize>

HashElement* qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >::curhashelem

private

Definition at line 124 of file rtpkeyhashtable.h.

Referenced by qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::DeleteCurrentElement(), qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::GetCurrentElement(), qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::GetCurrentKey(), qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::GotoElement(), qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::GotoFirstElement(), qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::GotoLastElement(), qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::GotoNextElement(), qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::GotoPreviousElement(), and qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::HasCurrentElement().

firsthashelem

template<class Key, class Element, class GetIndex, int hashsize>

HashElement* qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >::firsthashelem

private

Definition at line 123 of file rtpkeyhashtable.h.

Referenced by qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::AddElement(), qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::Clear(), qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::DeleteCurrentElement(), qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::GotoFirstElement(), and qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::RTPKeyHashTable().

lasthashelem

template<class Key, class Element, class GetIndex, int hashsize>

HashElement * qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >::lasthashelem

private

Definition at line 123 of file rtpkeyhashtable.h.

Referenced by qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::AddElement(), qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::Clear(), qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::DeleteCurrentElement(), qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::GotoLastElement(), and qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::RTPKeyHashTable().

table

template<class Key, class Element, class GetIndex, int hashsize>

HashElement* qrtplib::RTPKeyHashTable< Key, Element, GetIndex, hashsize >::table[hashsize]

private

Definition at line 122 of file rtpkeyhashtable.h.

Referenced by qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::AddElement(), qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::Clear(), qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::DeleteCurrentElement(), qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::GotoElement(), qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::HasElement(), and qrtplib::RTPKeyHashTable< const uint32_t, qrtplib::RTPInternalSourceData *, qrtplib::RTPSources_GetHashIndex, RTPSOURCES_HASHSIZE >::RTPKeyHashTable().

---

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

• qrtplib/rtpkeyhashtable.h