PtrHashMap Class Reference

#include <LibState.h>

Classes
struct	Node
struct	NodeBase

Public Member Functions
	PtrHashMap (size_t nBuckets)
	~PtrHashMap ()
const void *&	operator[] (const void *key)
Node *	find (const void *key) const
void	erase (Node *pNode)
size_t	count () const

Protected Member Functions
size_t	bucketNumber (const void *key) const

Protected Attributes
NodeBase *	m_buckets
size_t	m_nBuckets
int	m_nCount

Detailed Description

Definition at line 137 of file LibState.h.

Constructor & Destructor Documentation

PtrHashMap()

PtrHashMap::PtrHashMap

(

size_t

nBuckets

)

Definition at line 328 of file LibState.cpp.

{
    nBuckets = DCLGetNextPrimNumber(nBuckets);
 
    size_t nBytes = sizeof(NodeBase) * nBuckets;
    m_buckets = (NodeBase*)malloc(nBytes);
    for(size_t i = 0; i < nBuckets; i++) {
        NodeBase* pNode = &(m_buckets[i]);
        pNode->pPrev = pNode->pNext = pNode;
    }
    m_nBuckets = nBuckets;
    m_nCount = 0;
}

~PtrHashMap()

PtrHashMap::~PtrHashMap

(

)

Definition at line 342 of file LibState.cpp.

{
    for(size_t i = 0; i < m_nBuckets; i++) {
        NodeBase* pTempNode = NULL;
        NodeBase* pMasterNode = &(m_buckets[i]);
        NodeBase* pNode = pMasterNode->pNext;
        while(pNode != pMasterNode) {
            pTempNode = pNode;
            pNode = pNode->pNext;
            free(pTempNode);
        }
    }
    free(m_buckets);
}

Member Function Documentation

bucketNumber()

size_t PtrHashMap::bucketNumber ( const void * key ) const

inlineprotected

Definition at line 175 of file LibState.h.

{
    return (size_t)key % m_nBuckets;
}

count()

size_t PtrHashMap::count ( ) const

inline

Definition at line 180 of file LibState.h.

{
    return m_nCount;
}

erase()

void PtrHashMap::erase

(

Node *

pNode

)

Definition at line 394 of file LibState.cpp.

{
    __DCL_ASSERT_N(pNode != NULL);
 
    pNode->pPrev->pNext = pNode->pNext;
    pNode->pNext->pPrev = pNode->pPrev;
    
    free(pNode);
    m_nCount--;
}

find()

PtrHashMap::Node * PtrHashMap::find

(

const void *

key

)

const

Definition at line 378 of file LibState.cpp.

{
    size_t nBucket = bucketNumber(key);
    NodeBase* pMasterNode = &(m_buckets[nBucket]);
    NodeBase* pNode = pMasterNode->pNext;
//  int i = 1;
    while(pNode != pMasterNode) {
        if (((Node*)pNode)->key == key)
            return (Node*)pNode;
        pNode = pNode->pNext;
//      printf("collision: %d\n", i++);
 
    }
    return NULL;
}

operator[]()

const void *& PtrHashMap::operator[]

(

const void *

key

)

Definition at line 357 of file LibState.cpp.

{
    size_t nBucket = bucketNumber(key);
    NodeBase* pMasterNode = &(m_buckets[nBucket]);
    NodeBase* pNode = pMasterNode->pNext;
    while(pNode != pMasterNode) {
        if (((Node*)pNode)->key == key)
            return ((Node*)pNode)->value;
        pNode = pNode->pNext;
    }
 
    Node* pNewNode = (Node*)malloc(sizeof(Node));
    pNewNode->pPrev = pMasterNode;
    pNewNode->pNext = pMasterNode->pNext;
    pNewNode->pNext->pPrev = pNewNode;
    pMasterNode->pNext = pNewNode;
    m_nCount++;
    pNewNode->key = key;
    return pNewNode->value;
}

Member Data Documentation

m_buckets

NodeBase* PtrHashMap::m_buckets

protected

Definition at line 170 of file LibState.h.

m_nBuckets

size_t PtrHashMap::m_nBuckets

protected

Definition at line 171 of file LibState.h.

m_nCount

int PtrHashMap::m_nCount

protected

Definition at line 172 of file LibState.h.

---

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

• LibState.h
• LibState.cpp