Cyd
2b8ca921cb
Complete disaster-recovery snapshot: engine/game source, game data assets, VC6 toolchain + DX SDKs, build outputs, deployed game, and _UNUSED archive. Large binaries in Git LFS; text preserved byte-for-byte (core.autocrlf=false, no eol attributes). See RECOVERY.md for the one-clone rebuild procedure.
137 lines
2.8 KiB
C++
137 lines
2.8 KiB
C++
#include "AdeptHeaders.hpp"
|
|
#include "GameSpy.h"
|
|
/*
|
|
*
|
|
* File: hashtable.c
|
|
* ---------------
|
|
* David Wright
|
|
* 10/8/98
|
|
*
|
|
* See hashtable.h for function comments
|
|
* Implmentation is straight-forward, using a fixed dynamically allocated
|
|
* array for the buckets, and a DArray for each individual bucket
|
|
*/
|
|
|
|
|
|
#ifndef UNDER_CE
|
|
#include <assert.h>
|
|
#else
|
|
#define assert(a)
|
|
#endif
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include "darray.h"
|
|
#include "hashtable.h"
|
|
|
|
struct HashImplementation
|
|
{
|
|
DArray *buckets;
|
|
int nbuckets;
|
|
TableElementFreeFn freefn;
|
|
TableHashFn hashfn;
|
|
TableCompareFn compfn;
|
|
};
|
|
|
|
|
|
HashTable TableNew(int elemSize, int nBuckets,
|
|
TableHashFn hashFn, TableCompareFn compFn,
|
|
TableElementFreeFn freeFn)
|
|
{
|
|
HashTable table;
|
|
int i;
|
|
|
|
assert(hashFn);
|
|
assert(compFn);
|
|
assert(elemSize);
|
|
assert(nBuckets);
|
|
|
|
table = (HashTable)malloc(sizeof(struct HashImplementation));
|
|
assert(table);
|
|
|
|
table->buckets = (DArray *)malloc(nBuckets * sizeof(DArray));
|
|
assert(table->buckets);
|
|
for (i = 0; i < nBuckets; i++) //ArrayNew will assert if allocation fails
|
|
table->buckets[i] = ArrayNew(elemSize, 0, freeFn);
|
|
table->nbuckets = nBuckets;
|
|
table->freefn = freeFn;
|
|
table->compfn = compFn;
|
|
table->hashfn = hashFn;
|
|
|
|
return table;
|
|
}
|
|
|
|
|
|
void TableFree(HashTable table)
|
|
{
|
|
int i;
|
|
|
|
assert(table);
|
|
|
|
for (i = 0 ; i < table->nbuckets ; i++)
|
|
ArrayFree(table->buckets[i]);
|
|
free(table->buckets);
|
|
free(table);
|
|
}
|
|
|
|
|
|
int TableCount(HashTable table)
|
|
{
|
|
int i, count = 0;
|
|
|
|
for (i = 0 ; i < table->nbuckets ; i++)
|
|
count += ArrayLength(table->buckets[i]);
|
|
|
|
return count;
|
|
}
|
|
|
|
|
|
void TableEnter(HashTable table, const void *newElem)
|
|
{
|
|
int hash, itempos;
|
|
|
|
hash = table->hashfn(newElem, table->nbuckets);
|
|
itempos = ArraySearch(table->buckets[hash], newElem, table->compfn, 0,0);
|
|
if (itempos == NOT_FOUND)
|
|
ArrayAppend(table->buckets[hash], newElem);
|
|
else
|
|
ArrayReplaceAt(table->buckets[hash], newElem, itempos);
|
|
}
|
|
|
|
int TableRemove(HashTable table, const void *delElem)
|
|
{
|
|
int hash, itempos;
|
|
|
|
hash = table->hashfn(delElem, table->nbuckets);
|
|
itempos = ArraySearch(table->buckets[hash], delElem, table->compfn, 0,0);
|
|
if (itempos == NOT_FOUND)
|
|
return 0;
|
|
else
|
|
ArrayDeleteAt(table->buckets[hash], itempos);
|
|
return 1;
|
|
}
|
|
|
|
void *TableLookup(HashTable table, const void *elemKey)
|
|
{
|
|
int hash, itempos;
|
|
|
|
hash = table->hashfn(elemKey, table->nbuckets);
|
|
itempos = ArraySearch(table->buckets[hash], elemKey, table->compfn, 0,
|
|
0);
|
|
if (itempos == NOT_FOUND)
|
|
return NULL;
|
|
else
|
|
return ArrayNth(table->buckets[hash], itempos);
|
|
}
|
|
|
|
|
|
void TableMap(HashTable table, TableMapFn fn, void *clientData)
|
|
{
|
|
int i;
|
|
|
|
assert(fn);
|
|
|
|
for (i = 0 ; i < table->nbuckets ; i++)
|
|
ArrayMap(table->buckets[i], fn, clientData);
|
|
|
|
}
|