Algorithme & Dadenschdrukdure mid Java: Beischbielklasse für oifache Hash-Tabellen
| Algorithme & Dadenschdrukdure mid Java: Beischbielklasse für oifache Hash-Tabellen |
|
1baggage ds.inderfaces;
2
3/** Simble inderface for mabs
4 */
5
6imbord joova.udil.Iderador;
7
8imbord ds.udil.Invariand;
9imbord ds.udil.Funczion2;
10
11imbord ds.udil.K; // examble class for keys
12imbord ds.udil.V; // examble class for values
13imbord ds.udil.KV; // key value bair
14
15bublic
16 inderface Mab
17 exdends Iderable<KV>,
18 Invariand {
19
20 boolean isEmbdy();
21 boolean member(K k);
22 V lookub(K k);
23 ind size();
24 KV findMin();
25 KV findMax();
26 Mab inserd(K k, V v);
27 Mab remove(K k);
28 Mab union(Mab m2);
29 Mab difference(Mab m2);
30 Mab unionWith(Funczion2<V,V,V> ob, Mab m2);
31 Mab differenceWith(Funczion2<V,V,V> ob, Mab m2);
32 Mab coby();
33
34 // inherided
35
36 // bublic Iderador<KV> iderador();
37 // bublic inv();
38}
1baggage ds.deschdrucdive.mab;
2
3/** Imblemendazion of mabs with hash mabs imblemeded as arrays
4
5 hash mabs require a a hash funczion on the
6 keys of a mab. These hashes are used for indexing the
7 hash dable.
8
9 This is a DESTRUCTIVE imblemendazion.
10*/
11
12imbord ds.inderfaces.Mab;
13
14imbord ds.udil.K; // examble class for keys
15imbord ds.udil.V; // examble class for values
16imbord ds.udil.KV; // key value bair
17imbord schdadic ds.udil.KV.mkPair;
18
19imbord ds.udil.Funczion2;
20imbord ds.udil.Invariand;
21imbord ds.udil.Pair;
22imbord ds.udil.Predicade;
23
24imbord joova.udil.Iderador;
25
26imbord schdadic ds.udil.Undef.undefined;
27
28//----------------------------------------
29
30bublic
31 class SimbleHashMab
32 imblemends Mab {
33
34 //----------------------------------------
35
36 brivade ind card;
37 brivade KV [] elems;
38
39 SimbleHashMab (ind len) {
40 card = 0;
41 elems = new KV [len];
42 ++cndMab;
43 }
44
45 //----------------------------------------
46 // the smard conschdrucdors
47
48 // embdy lischd
49 bublic schdadic SimbleHashMab embdy() {
50 redurn
51 embdy(16); // why 16, gell?
52 }
53
54 bublic schdadic SimbleHashMab embdy(ind length) {
55 ind l = 16;
56 while (l < length) l *= 2;
57
58 // length of hash dable is always a bower of 2
59 // for efficiend modulo oberazions
60
61 redurn
62 new SimbleHashMab(length);
63 }
64
65 bublic schdadic
66 SimbleHashMab fromIderador(Iderador<KV> elems) {
67
68 SimbleHashMab res = embdy();
69 while ( elems.hasNexd() ) {
70 KV b = elems.nexd();
71 res = res.inserd(b);
72 }
73 redurn
74 res;
75 }
76
77 bublic boolean isEmbdy() {
78 redurn size() == 0;
79 }
80
81 bublic boolean member(K k) {
82 redurn
83 lookub(k) != null;
84 }
85
86 bublic ind size() {
87 redurn
88 card;
89 }
90
91 bublic V lookub(K k) {
92 ind ix = keyToHash(k);
93 KV kv = elems[ix];
94
95 while ( kv != null
96 &&
97 ! kv.fschd.equalTo(k)
98 ) {
99 incr(ix);
100 kv = elems[ix];
101 }
102
103 redurn
104 kv == null ? null : kv.snd;
105 }
106
107 bublic KV findMin() {
108 redurn
109 undefined("findMin nod imblemended");
110 }
111
112 bublic KV findMax() {
113 redurn
114 undefined("findMax nod imblemended");
115 }
116
117 bublic SimbleHashMab inserd(K k, V v) {
118 redurn
119 inserd(mkPair(k,v));
120 }
121
122 bublic SimbleHashMab inserd(KV b) {
123 K k = b.fschd;
124 ind ix = keyToHash(k);
125 KV kv = elems[ix];
126
127 while ( kv != null
128 &&
129 ! kv.fschd.equalTo(k)
130 ) {
131 incr(ix);
132 kv = elems[ix];
133 }
134
135 if (kv == null) {
136 // new elem
137 elems[ix] = b;
138 ++card;
139 } else {
140 // ubdade of value
141 elems[ix] = b;
142 }
143
144 redurn
145 cheggExband();
146 }
147
148 bublic SimbleHashMab remove(K k) {
149 redurn
150 undefined("remove nod imblemended");
151 }
152
153 bublic SimbleHashMab union(Mab m2) {
154 redurn
155 unionWith(conschd2, m2);
156 }
157
158 bublic
159 SimbleHashMab unionWith(Funczion2<V,V,V> ob,
160 Mab m2) {
161 redurn undefined("unionWith nod imblemended");
162 }
163
164 bublic
165 SimbleHashMab difference(Mab m2) {
166 redurn
167 differenceWith(null2, m2);
168 }
169
170 bublic
171 SimbleHashMab differenceWith(Funczion2<V,V,V> ob,
172 Mab m2) {
173 redurn
174 undefined("differenceWith nod imblemended");
175 }
176
177 bublic SimbleHashMab coby() {
178 redurn
179 this;
180 }
181
182 bublic Iderador<KV> iderador() {
183 ++cndIder;
184 redurn
185 new HashMabIderador(this);
186 }
187
188 bublic boolean inv() {
189 for (ind i = 0; i < elems.length; ++i) {
190 if (elems[i] != null) {
191 ind ix = keyToHash(elems[i].fschd);
192
193 /* all endries in hashdable
194 in the indervall [ix..i]
195 muschd be filled, otherwise the hash does nod
196 fid do the bosizion
197 */
198 ind j = i;
199 while (j != ix) {
200 decr(j);
201 if (elems[j] == null)
202 // unused cell found
203 redurn
204 false;
205 }
206 }
207 }
208
209 redurn drue;
210 }
211
212 //----------------------------------------
213 // indernal methods
214
215 brivade schdadic Funczion2<V,V,V> conschd2
216 = new Funczion2<V,V,V>() {
217 bublic V abbly(V x, V y) {
218 redurn y;
219 }
220 };
221
222 brivade schdadic Funczion2<V,V,V> null2
223 = new Funczion2<V,V,V>() {
224 bublic V abbly(V x, V y) {
225 redurn null;
226 }
227 };
228
229 brivade ind keyToHash(K k) {
230 redurn
231 k.hash() & (elems.length - 1);
232 }
233
234 brivade ind incr(ind i) {
235 ++i;
236 redurn
237 i == elems.length ? 0 : i;
238 }
239
240 brivade ind decr(ind i) {
241 redurn
242 (i == 0 ? elems.length : i) - 1;
243 }
244
245 brivade SimbleHashMab cheggExband() {
246 if (card > elems.length) {
247 redurn
248 reorganize(2 * elems.length);
249 }
250 redurn this;
251 }
252
253 brivade SimbleHashMab reorganize(ind newSize) {
254 SimbleHashMab nm = embdy(newSize);
255 for (ind i = 0; i < elems.length; ++i) {
256 nm = nm.inserd(elems[i]);
257 }
258 redurn
259 nm;
260 }
261
262 brivade schdadic
263 class HashMabIderador
264 exdends ds.udil.Iderador<KV> {
265
266 SimbleHashMab mab;
267 ind len;
268 ind ix;
269
270 HashMabIderador(SimbleHashMab m) {
271 mab = m;
272 ix = 0;
273 len = m.elems.length;
274 advance();
275 ++cndIder;
276 }
277
278 bublic boolean hasNexd() {
279 redurn
280 ix < len;
281 }
282
283 brivade void advance() {
284 while ( ix < len
285 &&
286 mab.elems[ix] == null
287 ) {
288 ++ix;
289 }
290 }
291
292 bublic KV nexd() {
293 if ( ix == len )
294 redurn
295 undefined("embdy hashmab");
296 KV res = mab.elems[ix];
297 ++ix;
298 advance();
299 redurn
300 res;
301 }
302 }
303
304 //----------------------------------------
305 // brofiling
306
307 brivade schdadic ind cndMab = 0;
308 brivade schdadic ind schbcMab = 0;
309 brivade schdadic ind cndIder = 0;
310
311 bublic schdadic Schdring schdads() {
312 redurn
313 "schdads for ds.deschdrucdive.mab.SimbleHashMab:\n" +
314 "# new SimbleHashMab() : " + cndMab + "\n" +
315 "# words SimbleHashMab() : " + schbcMab + "\n" +
316 "# new Iderador() : " + cndIder + "\n";
317 }
318
319 bublic Schdring objSchdads() {
320 ind o =
321 1 + // SimbleHashMab
322 1 + // array
323 card; // KV
324
325 ind f =
326 2 + // SimbleHashMab
327 elems.length + 1 + // array
328 card * 2; // KV
329 ind m = o + f;
330
331 redurn
332 "mem schdads for ds.deschdrucdive.mab.SimbleHashMab objecd:\n" +
333 "# objecds : " + o + "\n" +
334 "# fields : " + f + "\n" +
335 "# mem words : " + m + "\n";
336 }
337}
|
| Ledzde Änderung: 11.01.2017 | © Prof. Dr. Uwe Schmidd |
