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
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
|
/**************************************************************************/
/* File: hashtabl.cpp */
/* Author: Joachim Schoeberl */
/* Date: 01. Jun. 95 */
/**************************************************************************/
/*
Abstract data type HASHTABLE
*/
#include <algorithm>
#include <mystdlib.h>
#include <myadt.hpp>
namespace netgen
{
//using namespace netgen;
void INDEX_4 :: Sort ()
{
if (i[0] > i[1]) Swap (i[0], i[1]);
if (i[2] > i[3]) Swap (i[2], i[3]);
if (i[0] > i[2]) Swap (i[0], i[2]);
if (i[1] > i[3]) Swap (i[1], i[3]);
if (i[1] > i[2]) Swap (i[1], i[2]);
}
void INDEX_4Q :: Sort ()
{
if (min2 (i[1], i[2]) < min2 (i[0], i[3]))
{ Swap (i[0], i[1]); Swap (i[2], i[3]);}
if (i[3] < i[0])
{ Swap (i[0], i[3]); Swap (i[1], i[2]);}
if (i[3] < i[1])
{ Swap (i[1], i[3]); }
}
ostream & operator<<(ostream & s, const INDEX_2 & i2)
{
return s << i2.I1() << ", " << i2.I2();
}
ostream & operator<<(ostream & s, const INDEX_3 & i3)
{
return s << i3.I1() << ", " << i3.I2() << ", " << i3.I3();
}
ostream & operator<<(ostream & s, const INDEX_4 & i4)
{
return s << i4.I1() << ", " << i4.I2() << ", " << i4.I3() << ", " << i4.I4();
}
ostream & operator<<(ostream & s, const INDEX_4Q & i4)
{
return s << i4.I1() << ", " << i4.I2() << ", " << i4.I3() << ", " << i4.I4();
}
int BASE_INDEX_HASHTABLE :: Position (int bnr, const INDEX & ind) const
{
for (int i = 1; i <= hash.EntrySize (bnr); i++)
if (hash.Get(bnr, i) == ind)
return i;
return 0;
}
/*
int BASE_INDEX_2_HASHTABLE :: Position (int bnr, const INDEX_2 & ind) const
{
int i;
for (i = 1; i <= hash.EntrySize (bnr); i++)
if (hash.Get(bnr, i) == ind)
return i;
return 0;
}
*/
void BASE_INDEX_2_HASHTABLE :: PrintStat (ostream & ost) const
{
int n = hash.Size();
int i;
int sumn = 0, sumnn = 0;
for (i = 1; i <= n; i++)
{
sumn += hash.EntrySize(i);
sumnn += sqr (hash.EntrySize(i));
}
ost << "Hashtable: " << endl
<< "size : " << n << endl
<< "elements per row : " << (double(sumn) / double(n)) << endl
<< "av. access time : "
<< (sumn ? (double (sumnn) / double(sumn)) : 0) << endl;
}
/*
int BASE_INDEX_3_HASHTABLE :: Position (int bnr, const INDEX_3 & ind) const
{
int i;
const INDEX_3 * pi = &hash.Get(bnr, 1);
int n = hash.EntrySize(bnr);
for (i = 1; i <= n; ++i, ++pi)
{
if (*pi == ind)
return i;
}
return 0;
}
*/
BASE_INDEX_CLOSED_HASHTABLE ::
BASE_INDEX_CLOSED_HASHTABLE (int size)
: hash(size)
{
// hash.SetName ("index-hashtable, hash");
invalid = -1;
for (int i = 1; i <= size; i++)
hash.Elem(i) = invalid;
}
void BASE_INDEX_CLOSED_HASHTABLE ::
BaseSetSize (int size)
{
hash.SetSize(size);
for (int i = 1; i <= size; i++)
hash.Elem(i) = invalid;
}
int BASE_INDEX_CLOSED_HASHTABLE ::
Position2 (const INDEX & ind) const
{
int i = HashValue(ind);
while (1)
{
i++;
if (i > hash.Size()) i = 1;
if (hash.Get(i) == ind) return i;
if (hash.Get(i) == invalid) return 0;
}
}
int BASE_INDEX_CLOSED_HASHTABLE ::
PositionCreate2 (const INDEX & ind, int & apos)
{
int i = HashValue(ind);
int startpos = i;
while (1)
{
i++;
if (i > hash.Size()) i = 1;
if (hash.Get(i) == ind)
{
apos = i;
return 0;
}
if (hash.Get(i) == invalid)
{
hash.Elem(i) = ind;
apos = i;
return 1;
}
if (i == startpos)
throw NgException ("Try to set new element in full closed hashtable");
}
}
int BASE_INDEX_CLOSED_HASHTABLE :: UsedElements () const
{
int n = hash.Size();
int cnt = 0;
for (int i = 1; i <= n; i++)
if (hash.Get(i) != invalid)
cnt++;
return cnt;
}
BASE_INDEX_2_CLOSED_HASHTABLE ::
BASE_INDEX_2_CLOSED_HASHTABLE (size_t size)
: hash(RoundUp2(size))
{
size = hash.Size();
mask = size-1;
// hash.SetName ("i2-hashtable, hash");
invalid = -1;
for (size_t i = 0; i < size; i++)
hash[i].I1() = invalid;
}
void BASE_INDEX_2_CLOSED_HASHTABLE ::
BaseSetSize (int size)
{
size = RoundUp2 (size);
mask = size-1;
hash.SetSize(size);
for (size_t i = 0; i < size; i++)
hash[i].I1() = invalid;
}
int BASE_INDEX_2_CLOSED_HASHTABLE ::
Position2 (const INDEX_2 & ind) const
{
int i = HashValue(ind);
while (1)
{
i++;
if (i > hash.Size()) i = 1;
if (hash.Get(i) == ind) return i;
if (hash.Get(i).I1() == invalid) return 0;
}
}
bool BASE_INDEX_2_CLOSED_HASHTABLE ::
PositionCreate2 (const INDEX_2 & ind, int & apos)
{
int i = HashValue(ind);
int startpos = i;
while (1)
{
/*
i++;
if (i > hash.Size()) i = 1;
*/
i = (i+1) % hash.Size();
if (hash[i] == ind)
{
apos = i;
return false;
}
if (hash[i].I1() == invalid)
{
hash[i] = ind;
apos = i;
return true;
}
if (i == startpos)
throw NgException ("Try to set new element in full closed hashtable");
}
}
int BASE_INDEX_2_CLOSED_HASHTABLE :: UsedElements () const
{
int n = hash.Size();
int cnt = 0;
for (int i = 1; i <= n; i++)
if (hash.Get(i).I1() != invalid)
cnt++;
return cnt;
}
BASE_INDEX_3_CLOSED_HASHTABLE ::
BASE_INDEX_3_CLOSED_HASHTABLE (size_t size)
: hash(RoundUp2(size))
{
// cout << "orig size = " << size
// << ", roundup size = " << hash.Size();
size = hash.Size();
mask = size-1;
// cout << "mask = " << mask << endl;
invalid = -1;
for (size_t i = 0; i < size; i++)
hash[i].I1() = invalid;
}
void BASE_INDEX_3_CLOSED_HASHTABLE ::
BaseSetSize (int size)
{
size = RoundUp2 (size);
mask = size-1;
hash.SetSize(size);
for (int i = 0; i < size; i++)
hash[i].I1() = invalid;
}
bool BASE_INDEX_3_CLOSED_HASHTABLE ::
PositionCreate2 (const INDEX_3 & ind, int & apos)
{
int i = HashValue(ind);
int startpos = i;
while (1)
{
/*
i++;
if (i >= hash.Size()) i = 0;
*/
i = (i+1) % hash.Size();
if (hash[i] == ind)
{
apos = i;
return false;
}
if (hash[i].I1() == invalid)
{
hash[i] = ind;
apos = i;
return true;
}
if (i == startpos)
throw NgException ("Try to set new element in full closed hashtable");
}
}
}
|
