1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
|
#include <DWC/gamespy/nonport.h>
#include <DWC/gamespy/hashtable.h>
HashTable *TableNew(u32 p1, s32 p2, HashFunction hf, CompareFunction cmp, DtorFunction dtor)
{
return TableNew2(p1, p2, 4, hf, cmp, dtor);
}
HashTable *TableNew2(u32 p1, s32 size, s32 p3, HashFunction hf, CompareFunction cmp, DtorFunction dtor)
{
HashTable *table = gsimalloc(sizeof(HashTable));
table->chains = gsimalloc(size * sizeof(DArray *));
for (s32 i = 0; i < size; i++) {
table->chains[i] = ArrayNew(p1, p3, dtor);
}
table->size = size;
table->dtor = dtor;
table->compar = cmp;
table->hashFunc = hf;
return table;
}
void TableFree(HashTable *table)
{
if (table) {
for (s32 i = 0; i < table->size; i++) {
ArrayFree(table->chains[i]);
}
gsifree(table->chains);
gsifree(table);
}
}
s32 TableCount(HashTable *table)
{
s32 i, totalSize = 0;
if (!table)
return 0;
for (i = 0; i < table->size; i++) {
totalSize += ArrayLength(table->chains[i]);
}
return totalSize;
}
void TableEnter(HashTable *table, void *elem)
{
if (table) {
s32 i = table->hashFunc(elem, table->size);
s32 result = ArraySearch(table->chains[i], elem, table->compar, 0, 0);
if (result == -1) {
ArrayAppend(table->chains[i], elem);
} else {
ArrayReplaceAt(table->chains[i], elem, result);
}
}
}
BOOL TableRemove(HashTable *table, void *elem)
{
if (!table)
return FALSE;
s32 i = table->hashFunc(elem, table->size);
s32 result = ArraySearch(table->chains[i], elem, table->compar, 0, 0);
if (result == -1) {
return FALSE;
} else {
ArrayDeleteAt(table->chains[i], result);
return TRUE;
}
}
void *TableLookup(HashTable *table, void *elem)
{
if (!table)
return NULL;
s32 i = table->hashFunc(elem, table->size);
s32 result = ArraySearch(table->chains[i], elem, table->compar, 0, 0);
if (result == -1) {
return NULL;
} else {
return ArrayNth(table->chains[i], result);
}
}
void TableMapSafe(HashTable *table, MapFunction p2, s32 p3)
{
for (s32 i = 0; i < table->size; i++) {
ArrayMapBackwards(table->chains[i], p2, p3);
}
}
void *TableMapSafe2(HashTable *table, MapFunction p2, s32 p3)
{
s32 i;
void *result;
for (i = 0; i < table->size; i++) {
if ((result = ArrayMapBackwards2(table->chains[i], p2, p3)) != NULL) {
return result;
}
}
return NULL;
}
|
