BOOL HashTable_Remove(wHashTable* table, void* key)
{
UINT32 hashValue;
BOOL status = TRUE;
wKeyValuePair* pair = NULL;
wKeyValuePair* previousPair = NULL;
if (table->synchronized)
EnterCriticalSection(&table->lock);
hashValue = table->hash(key) % table->numOfBuckets;
pair = table->bucketArray[hashValue];
while (pair && !table->keyCompare(key, pair->key))
{
previousPair = pair;
pair = pair->next;
}
if (!pair)
{
status = FALSE;
}
else
{
if (table->keyFree)
table->keyFree(pair->key);
if (table->valueFree)
table->valueFree(pair->value);
if (previousPair)
previousPair->next = pair->next;
else
table->bucketArray[hashValue] = pair->next;
free(pair);
table->numOfElements--;
if (table->lowerRehashThreshold > 0.0)
{
float elementToBucketRatio = (float) table->numOfElements / (float) table->numOfBuckets;
if (elementToBucketRatio < table->lowerRehashThreshold)
HashTable_Rehash(table, 0);
}
}
if (table->synchronized)
LeaveCriticalSection(&table->lock);
return status;
}
BOOL HashTable_Remove(wHashTable* table, void* key)
{
BOOL status = TRUE;
long hashValue = table->hashFunction(key) % table->numOfBuckets;
wKeyValuePair* pair = table->bucketArray[hashValue];
wKeyValuePair* previousPair = NULL;
if (table->synchronized)
EnterCriticalSection(&table->lock);
while (pair && table->keycmp(key, pair->key) != 0)
{
previousPair = pair;
pair = pair->next;
}
if (!pair)
{
status = FALSE;
}
else
{
if (table->keyDeallocator)
table->keyDeallocator((void*) pair->key);
if (table->valueDeallocator)
table->valueDeallocator(pair->value);
if (previousPair)
previousPair->next = pair->next;
else
table->bucketArray[hashValue] = pair->next;
free(pair);
table->numOfElements--;
if (table->lowerRehashThreshold > 0.0)
{
float elementToBucketRatio = (float) table->numOfElements / (float) table->numOfBuckets;
if (elementToBucketRatio < table->lowerRehashThreshold)
HashTable_Rehash(table, 0);
}
}
if (table->synchronized)
LeaveCriticalSection(&table->lock);
return status;
}
void HashTable_Clear(wHashTable* table)
{
int index;
wKeyValuePair* pair;
wKeyValuePair* nextPair;
if (table->synchronized)
EnterCriticalSection(&table->lock);
for (index = 0; index < table->numOfBuckets; index++)
{
pair = table->bucketArray[index];
while (pair)
{
nextPair = pair->next;
if (table->pfnKeyValueFree)
table->pfnKeyValueFree(table->context, pair->key, pair->value);
if (table->keyDeallocator)
table->keyDeallocator((void*) pair->key);
if (table->valueDeallocator)
table->valueDeallocator(pair->value);
free(pair);
pair = nextPair;
}
table->bucketArray[index] = NULL;
}
table->numOfElements = 0;
HashTable_Rehash(table, 5);
if (table->synchronized)
LeaveCriticalSection(&table->lock);
}
int HashTable_Add(wHashTable* table, void* key, void* value)
{
int status = 0;
UINT32 hashValue;
wKeyValuePair* pair;
wKeyValuePair* newPair;
if (!key || !value)
return -1;
if (table->keyClone)
{
key = table->keyClone(key);
if (!key)
return -1;
}
if (table->valueClone)
{
value = table->valueClone(value);
if (!value)
return -1;
}
if (table->synchronized)
EnterCriticalSection(&table->lock);
hashValue = table->hash(key) % table->numOfBuckets;
pair = table->bucketArray[hashValue];
while (pair && !table->keyCompare(key, pair->key))
pair = pair->next;
if (pair)
{
if (pair->key != key)
{
if (table->keyFree)
table->keyFree(pair->key);
pair->key = key;
}
if (pair->value != value)
{
if (table->valueFree)
table->valueFree(pair->value);
pair->value = value;
}
}
else
{
newPair = (wKeyValuePair*) malloc(sizeof(wKeyValuePair));
if (!newPair)
{
status = -1;
}
else
{
newPair->key = key;
newPair->value = value;
newPair->next = table->bucketArray[hashValue];
table->bucketArray[hashValue] = newPair;
table->numOfElements++;
if (table->upperRehashThreshold > table->idealRatio)
{
float elementToBucketRatio = (float) table->numOfElements / (float) table->numOfBuckets;
if (elementToBucketRatio > table->upperRehashThreshold)
HashTable_Rehash(table, 0);
}
}
}
if (table->synchronized)
LeaveCriticalSection(&table->lock);
return status;
}
int HashTable_Add(wHashTable* table, void* key, void* value)
{
int status = 0;
long hashValue;
wKeyValuePair* pair;
wKeyValuePair* newPair;
if (!key || !value)
return -1;
if (table->synchronized)
EnterCriticalSection(&table->lock);
hashValue = table->hashFunction(key) % table->numOfBuckets;
pair = table->bucketArray[hashValue];
while (pair != NULL && table->keycmp(key, pair->key) != 0)
pair = pair->next;
if (pair)
{
if (pair->key != key)
{
if (table->keyDeallocator)
table->keyDeallocator((void*) pair->key);
pair->key = key;
}
if (pair->value != value)
{
if (table->valueDeallocator)
table->valueDeallocator(pair->value);
pair->value = value;
}
}
else
{
newPair = (wKeyValuePair*) malloc(sizeof(wKeyValuePair));
if (!newPair)
{
status = -1;
}
else
{
newPair->key = key;
newPair->value = value;
newPair->next = table->bucketArray[hashValue];
table->bucketArray[hashValue] = newPair;
table->numOfElements++;
if (table->upperRehashThreshold > table->idealRatio)
{
float elementToBucketRatio = (float) table->numOfElements / (float) table->numOfBuckets;
if (elementToBucketRatio > table->upperRehashThreshold)
HashTable_Rehash(table, 0);
}
}
}
if (table->synchronized)
LeaveCriticalSection(&table->lock);
return status;
}
