blob: 98cdd051ac7ade9c408886e3bd1b527fea114131 (
plain)
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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
|
/* Project FoundationEx
Destroyer Studios LLC
Copyright © 1997-2004. All Rights Reserved.
SUBSYSTEM: FoundationEx
FILE: Dictionary.inl
AUTHOR: John DiCamillo
OVERVIEW
========
Implementation of the Dictionary class
*/
#ifndef NDEBUG
#define DICT_CHECK(a, b) if ((a) == 0) throw b;
#else
#define DICT_CHECK(a, b)
#endif
const int CHAINS = 256;
// +-------------------------------------------------------------------+
template <class T> Dictionary<T>::Dictionary()
: items(0)
{ init(); }
template <class T> Dictionary<T>::~Dictionary()
{ clear(); }
// +-------------------------------------------------------------------+
template <class T>
void Dictionary<T>::init()
{
items = 0;
memset(table, 0, CHAINS*sizeof(PTR));
}
template <class T>
void Dictionary<T>::clear()
{
for (int i = 0; i < CHAINS; i++) {
DictionaryCell<T>* link = table[i];
while (link) {
DictionaryCell<T>* n = link->next;
delete link;
link = n;
}
}
init();
}
// +-------------------------------------------------------------------+
template <class T>
T& Dictionary<T>::operator[](const Text& key)
{
int idx = key.hash() % CHAINS;
DictionaryCell<T>* cell = table[idx];
if (cell == 0) { // empty chain
items++;
#ifdef MEM_DEBUG
cell = new(__FILE__,__LINE__) DictionaryCell<T>(key);
#else
cell = new DictionaryCell<T>(key);
#endif
table[idx] = cell;
return cell->value;
}
else { // search for key
while (cell->next && cell->key != key)
cell = cell->next;
if (cell->key != key) { // not found in chain
items++;
#ifdef MEM_DEBUG
cell->next = new(__FILE__,__LINE__) DictionaryCell<T>(key);
#else
cell->next = new DictionaryCell<T>(key);
#endif
return cell->next->value;
}
else { // found: return it!
return cell->value;
}
}
}
// +-------------------------------------------------------------------+
template <class T>
void Dictionary<T>::insert(const Text& key, const T& val)
{
T& value = operator[](key);
value = val;
}
// +-------------------------------------------------------------------+
template <class T>
void Dictionary<T>::remove(const Text& key)
{
int idx = key.hash() % CHAINS;
DictionaryCell<T>* cell = table[idx];
if (cell == 0) { // empty chain
return;
}
else { // search for key
while (cell->next && cell->key != key)
cell = cell->next;
if (cell->key != key) { // not found in chain
return;
}
else { // found: remove it!
if (table[idx] == cell) {
table[idx] = cell->next;
delete cell;
}
else {
DictionaryCell<T>* p = table[idx];
while (p->next != cell)
p = p->next;
p->next = cell->next;
delete cell;
}
}
}
}
// +-------------------------------------------------------------------+
template <class T>
int Dictionary<T>::contains(const Text& key) const
{
int idx = key.hash() % CHAINS;
DictionaryCell<T>* cell = table[idx];
if (cell != 0) {
while (cell->next && cell->key != key)
cell = cell->next;
if (cell->key == key)
return 1;
}
return 0;
}
// +-------------------------------------------------------------------+
template <class T>
T Dictionary<T>::find(const Text& key, T defval) const
{
int idx = key.hash() % CHAINS;
DictionaryCell<T>* cell = table[idx];
if (cell != 0) {
while (cell->next && cell->key != key)
cell = cell->next;
if (cell->key == key)
return cell->value;
}
return defval;
}
// +-------------------------------------------------------------------+
template <class T> DictionaryIter<T>::DictionaryIter(Dictionary<T>& d)
: dict(&d), chain(0), here(0)
{ }
template <class T> DictionaryIter<T>::~DictionaryIter()
{ }
// +-------------------------------------------------------------------+
template <class T>
void DictionaryIter<T>::reset()
{
chain = 0;
here = 0;
}
// +-------------------------------------------------------------------+
template <class T>
Text DictionaryIter<T>::key() const
{
return here->key;
}
template <class T>
T DictionaryIter<T>::value() const
{
return here->value;
}
// +-------------------------------------------------------------------+
template <class T>
int DictionaryIter<T>::operator++()
{
forth();
int more = chain < CHAINS;
return more;
}
// +-------------------------------------------------------------------+
template <class T>
void DictionaryIter<T>::forth()
{
if (here) {
here = here->next;
if (!here) // off the end of this chain
chain++;
}
if (!here) {
while (!dict->table[chain] && chain < CHAINS)
chain++;
if (chain < CHAINS)
here = dict->table[chain];
else
here = 0;
}
}
// +-------------------------------------------------------------------+
template <class T>
void DictionaryIter<T>::attach(Dictionary<T>& d)
{
dict = &d;
reset();
}
// +-------------------------------------------------------------------+
template <class T>
Dictionary<T>& DictionaryIter<T>::container()
{
return *dict;
}
|
