PtrHashMap Class Reference

#include <LibState.h>

Classes
struct	Node
struct	NodeBase

Public Member Functions
	PtrHashMap (size_t _buckerCount)
	~PtrHashMap ()
const void *&	operator[] (const void *_key)
Node *	find (const void *_key) const
void	erase (Node *_node)
size_t	count () const

Protected Member Functions
size_t	bucketIndex (const void *_key) const

Protected Attributes
NodeBase *	__buckets
size_t	__bucketCount
size_t	__nodeCount

Detailed Description

Definition at line 136 of file LibState.h.

Constructor & Destructor Documentation

PtrHashMap()

PtrHashMap::PtrHashMap

(

size_t

_buckerCount

)

Definition at line 326 of file LibState.cpp.

{
    __nodeCount = 0;
    __bucketCount = DCLGetNextPrimNumber(_nbucket);
    __buckets = (NodeBase*)malloc(sizeof(NodeBase) * __bucketCount);
    for(size_t i = 0; i < __bucketCount; i++) {
        NodeBase* node = &(__buckets[i]);
        node->prev = node->next = node;
    }
}

~PtrHashMap()

PtrHashMap::~PtrHashMap

(

)

Definition at line 337 of file LibState.cpp.

{
    for(size_t i = 0; i < __bucketCount; i++) {
        NodeBase* temp = NULL;
        NodeBase* masterNode = &(__buckets[i]);
        NodeBase* node = masterNode->next;
        while(node != masterNode) {
            temp = node;
            node = node->next;
            free(temp);
        }
    }
    free(__buckets);
}

Member Function Documentation

bucketIndex()

size_t PtrHashMap::bucketIndex ( const void * _key ) const

inlineprotected

Definition at line 174 of file LibState.h.

{
    return (size_t)_key % __bucketCount;
}

count()

size_t PtrHashMap::count ( ) const

inline

Definition at line 179 of file LibState.h.

{
    return __nodeCount;
}

erase()

void PtrHashMap::erase

(

Node *

_node

)

Definition at line 386 of file LibState.cpp.

{
    __DCL_ASSERT_N(_node != NULL);
 
    _node->prev->next = _node->next;
    _node->next->prev = _node->prev;
 
    free(_node);
    __nodeCount--;
}

find()

PtrHashMap::Node * PtrHashMap::find

(

const void *

_key

)

const

Definition at line 372 of file LibState.cpp.

{
    NodeBase* masterNode = __buckets + bucketIndex(_key);
    NodeBase* node = masterNode->next;
//  int i = 1;
    while(node != masterNode) {
        if (((Node*)node)->key == _key)
            return (Node*)node;
        node = node->next;
//      printf("collision: %d\n", i++);
    }
    return NULL;
}

operator[]()

const void *& PtrHashMap::operator[]

(

const void *

_key

)

Definition at line 352 of file LibState.cpp.

{
    NodeBase* masterNode = __buckets + bucketIndex(_key);
    NodeBase* node = masterNode->next;
    while(node != masterNode) {
        if (((Node*)node)->key == _key)
            return ((Node*)node)->value;
        node = node->next;
    }
 
    Node* newNode = (Node*)malloc(sizeof(Node));
    newNode->prev = masterNode;
    newNode->next = masterNode->next;
    newNode->next->prev = newNode;
    masterNode->next = newNode;
    __nodeCount++;
    newNode->key = _key;
    return newNode->value;
}

Member Data Documentation

__bucketCount

size_t PtrHashMap::__bucketCount

protected

Definition at line 170 of file LibState.h.

__buckets

NodeBase* PtrHashMap::__buckets

protected

Definition at line 169 of file LibState.h.

__nodeCount

size_t PtrHashMap::__nodeCount

protected

Definition at line 171 of file LibState.h.

---

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

• LibState.h
• LibState.cpp