-
Notifications
You must be signed in to change notification settings - Fork 138
/
orderedhash.pmc
635 lines (492 loc) · 15.3 KB
/
orderedhash.pmc
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
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
/*
Copyright (C) 2001-2003, The Perl Foundation.
$Id$
=head1 NAME
src/pmc/orderedhash.pmc - Ordered Hash
=head1 DESCRIPTION
C<OrderedHash> extends C<Hash> to provide the interfaces of
C<array> and C<hash>. To achieve the functionality of an ordered
hash there are a few restrictions though: C<delete_keyed> never removes
items, they are just nulled.
Please note that if values are set via integer idx, these indices
have to be in strict order. Using C<push_xx> simplifies this task.
This creates a key "\1idx" for C<idx> and is therefore not fully transparent.
There are 2 iterator interfaces:
=over 4
=item * retrieve values (in creation order)
Please note that after a C<delete_keyed> operation, iterating over
values doesn't work any more, you'll get an error 'No such key'.
=item * retrieve keys (in creation order)
=back
See F<t/pmc/orderedhash.t>.
=head2 Methods
=over 4
=cut
*/
#include "parrot/parrot.h"
#include "pmc_hash.h"
pmclass OrderedHash extends Hash need_ext does array does hash {
/*
=item C<PMC *get_pmc_keyed(PMC *key)>
=item C<PMC *get_pmc_keyed_int(INTVAL key)>
=item C<PMC *get_pmc_keyed_str(STRING *key)>
=cut
*/
PMC* get_pmc_keyed_int(INTVAL idx) {
Hash *h = PMC_struct_val(SELF);
INTVAL n;
HashBucket *b;
n = h->entries;
if (idx < 0)
idx += n;
if (idx < 0 || idx >= n) {
real_exception(INTERP, NULL, KEY_NOT_FOUND,
"OrderedHash: index out of bounds!");
}
b = h->bs + idx;
if (b->key)
return (PMC*) b->value;
real_exception(INTERP, NULL, KEY_NOT_FOUND,
"OrderedHash: No such key");
return PMCNULL;
}
PMC* get_pmc_keyed(PMC* key) {
PMC *item, *next;
switch (PObj_get_FLAGS(key) & KEY_type_FLAGS) {
case KEY_hash_iterator_FLAGS:
return SUPER(key);
case KEY_integer_FLAG:
item = SELF.get_pmc_keyed_int(key_integer(INTERP, key));
next = key_next(INTERP, key);
if (!next)
return item;
return VTABLE_get_pmc_keyed(INTERP, item, next);
default:
return SUPER(key);
}
}
/*
=item C<STRING *get_string_keyed(PMC *key)>
=item C<STRING *get_string_keyed_int(INTVAL key)>
=item C<STRING *get_string_keyed_str(STRING *key)>
=cut
*/
STRING* get_string_keyed_int(INTVAL idx) {
Hash *h = PMC_struct_val(SELF);
INTVAL n;
HashBucket *b;
n = h->entries;
if (idx < 0)
idx += n;
if (idx < 0 || idx >= n) {
real_exception(INTERP, NULL, KEY_NOT_FOUND,
"OrderedHash: index out of bounds!");
}
b = h->bs + idx;
if (b->key)
return VTABLE_get_string(INTERP, (PMC*) b->value);
real_exception(INTERP, NULL, KEY_NOT_FOUND,
"OrderedHash: No such key");
return NULL;
}
STRING* get_string_keyed(PMC* key) {
PMC *item, *next;
switch (PObj_get_FLAGS(key) & KEY_type_FLAGS) {
case KEY_hash_iterator_FLAGS:
return SUPER(key);
case KEY_integer_FLAG:
item = SELF.get_pmc_keyed_int(key_integer(INTERP, key));
next = key_next(INTERP, key);
if (!next)
return VTABLE_get_string(INTERP, item);
return VTABLE_get_string_keyed(INTERP, item, next);
default:
return SUPER(key);
}
}
/*
=item C<INTVAL get_integer_keyed(PMC *key)>
=item C<INTVAL get_integer_keyed_str(STRING *key)>
=item C<INTVAL get_integer_keyed_int(INTVAL key)>
Returns the integer value associated with C<key>.
=cut
*/
INTVAL get_integer_keyed_int(INTVAL idx) {
Hash *h = PMC_struct_val(SELF);
INTVAL n;
HashBucket *b;
n = h->entries;
if (idx < 0)
idx += n;
if (idx < 0 || idx >= n) {
real_exception(INTERP, NULL, OUT_OF_BOUNDS,
"OrderedHash: index out of bounds!");
}
b = h->bs + idx;
if (b->key)
return VTABLE_get_integer(INTERP, (PMC*) b->value);
real_exception(INTERP, NULL, KEY_NOT_FOUND,
"OrderedHash: No such key");
return 0;
}
INTVAL get_integer_keyed(PMC* key) {
PMC *item, *next;
switch (PObj_get_FLAGS(key) & KEY_type_FLAGS) {
case KEY_hash_iterator_FLAGS:
return SUPER(key);
case KEY_integer_FLAG:
item = SELF.get_pmc_keyed_int(key_integer(INTERP, key));
next = key_next(INTERP, key);
if (!next)
return VTABLE_get_integer(INTERP, item);
return VTABLE_get_integer_keyed(INTERP, item, next);
default:
return SUPER(key);
}
}
/*
=item C<FLOATVAL get_number_keyed(PMC *key)>
=item C<FLOATVAL get_number_keyed_int(INTVAL key)>
=item C<FLOATVAL get_number_keyed_str(STRING* key)>
Returns the floating-point value for the element at C<key>.
=cut
*/
FLOATVAL get_number_keyed_int(INTVAL idx) {
Hash *h = PMC_struct_val(SELF);
INTVAL n;
HashBucket *b;
n = h->entries;
if (idx < 0)
idx += n;
if (idx < 0 || idx >= n) {
real_exception(INTERP, NULL, OUT_OF_BOUNDS,
"OrderedHash: index out of bounds!");
}
b = h->bs + idx;
if (b->key)
return VTABLE_get_number(INTERP, (PMC*) b->value);
real_exception(INTERP, NULL, KEY_NOT_FOUND,
"OrderedHash: No such key");
return 0.0;
}
FLOATVAL get_number_keyed(PMC* key) {
PMC *item, *next;
switch (PObj_get_FLAGS(key) & KEY_type_FLAGS) {
case KEY_hash_iterator_FLAGS:
return SUPER(key);
case KEY_integer_FLAG:
item = SELF.get_pmc_keyed_int(key_integer(INTERP, key));
next = key_next(INTERP, key);
if (!next)
return VTABLE_get_number(INTERP, item);
return VTABLE_get_number_keyed(INTERP, item, next);
default:
return SUPER(key);
}
}
/*
=item C<void set_pmc_keyed_int(INTVAL idx, PMC *val)>
=item C<void set_integer_keyed_int(INTVAL key, INTVAL value)>
=item C<void set_number_keyed_int(INTVAL key, FLOATVAL value)>
=item C<void set_string_keyed_int(INTVAL key, STRING *value)>
Sets the PMC value of the element at index C<key> to C<val>.
The created key = "\1idx".
=cut
*/
void set_pmc_keyed_int(INTVAL idx, PMC* val) {
STRING *key, *fmt;
Hash *h = PMC_struct_val(SELF);
INTVAL n;
HashBucket *b;
n = h->entries;
if (idx < -n)
idx = -idx - n - 1;
else if (idx < 0)
idx += n;
fmt = CONST_STRING(INTERP, "\1%d");
if (idx >= n) {
/* TODO warn or fill if there are holes */
key = Parrot_sprintf_s(INTERP, fmt, idx);
DYNSELF.set_pmc_keyed_str(key, val);
}
else {
b = h->bs + idx;
if (!b->key) {
b->key = Parrot_sprintf_s(INTERP, fmt, idx);
}
b->value = val;
}
}
void set_integer_keyed_int(INTVAL idx, INTVAL value) {
PMC *v = pmc_new(INTERP, Parrot_get_ctx_HLL_type(INTERP,
enum_class_Integer));
VTABLE_set_integer_native(INTERP, v, value);
SELF.set_pmc_keyed_int(idx, v);
}
void set_number_keyed_int(INTVAL idx, FLOATVAL value) {
PMC *v = pmc_new(INTERP, Parrot_get_ctx_HLL_type(INTERP,
enum_class_Float));
VTABLE_set_number_native(INTERP, v, value);
SELF.set_pmc_keyed_int(idx, v);
}
void set_string_keyed_int(INTVAL idx, STRING* value) {
PMC *v = pmc_new(INTERP, Parrot_get_ctx_HLL_type(INTERP,
enum_class_String));
VTABLE_set_string_native(INTERP, v, value);
SELF.set_pmc_keyed_int(idx, v);
}
/*
=item C<void push_float(FLOATVAL value)>
=item C<void push_integer(INTVAL value)>
=item C<void push_pmc(PMC* value)>
=item C<void push_string(STRING* value)>
=cut
*/
void push_pmc(PMC* value) {
INTVAL n = DYNSELF.elements();
SELF.set_pmc_keyed_int(n, value);
}
void push_float(FLOATVAL value) {
INTVAL n = DYNSELF.elements();
SELF.set_number_keyed_int(n, value);
}
void push_integer(INTVAL value) {
INTVAL n = DYNSELF.elements();
SELF.set_integer_keyed_int(n, value);
}
void push_string(STRING* value) {
INTVAL n = DYNSELF.elements();
SELF.set_string_keyed_int(n, value);
}
/*
=item C<INTVAL exists_keyed(PMC *key)>
=item C<INTVAL exists_keyed_str(STRING *key)>
=item C<INTVAL exists_keyed_int(INTVAL key)>
=cut
*/
INTVAL exists_keyed_int(INTVAL idx) {
Hash *h = PMC_struct_val(SELF);
INTVAL n;
HashBucket *b;
n = h->entries;
if (idx < 0)
idx += n;
if (idx < 0 || idx >= n) {
return 0;
}
b = h->bs + idx;
if (b->key)
return 1;
return 0;
}
INTVAL exists_keyed(PMC* key) {
PMC *item, *next;
if (PObj_get_FLAGS(key) & KEY_integer_FLAG) {
Hash *h = PMC_struct_val(SELF);
INTVAL n, idx;
HashBucket *b;
idx = key_integer(INTERP, key);
n = h->entries;
if (idx < 0)
idx += n;
if (idx < 0 || idx >= n) {
return 0;
}
b = h->bs + idx;
if (!b->key)
return 0;
item = b->value;
next = key_next(INTERP, key);
if (!next)
return 1;
return VTABLE_exists_keyed(INTERP, item, next);
}
else {
return SUPER(key);
}
}
INTVAL exists_keyed_str(STRING* key) {
Hash *h = PMC_struct_val(SELF);
HashBucket *b;
b = parrot_hash_get_bucket(INTERP, h, key);
if (b && b->key)
return 1;
return 0;
}
/*
=item C<INTVAL defined_keyed(PMC *key)>
=item C<INTVAL defined_keyed_str(STRING *key)>
=item C<INTVAL defined_keyed_int(INTVAL key)>
=cut
*/
INTVAL defined_keyed(PMC *key) {
PMC *item, *next;
if (PObj_get_FLAGS(key) & KEY_integer_FLAG) {
Hash *h = PMC_struct_val(SELF);
INTVAL n, idx;
HashBucket *b;
idx = key_integer(INTERP, key);
n = h->entries;
if (idx < 0)
idx += n;
if (idx < 0 || idx >= n) {
/* XXX non-existant is undefined - is this correct */
return 0;
}
b = h->bs + idx;
if (!b->key)
return 0;
item = b->value;
next = key_next(INTERP, key);
if (!next)
return VTABLE_defined(INTERP, item);
return VTABLE_defined_keyed(INTERP, item, next);
}
return SUPER(key);
}
INTVAL defined_keyed_int(INTVAL idx) {
Hash *h = PMC_struct_val(SELF);
INTVAL n;
HashBucket *b;
n = h->entries;
if (idx < 0)
idx += n;
if (idx < 0 || idx >= n) {
return 0;
}
b = h->bs + idx;
if (b->key)
return VTABLE_defined(INTERP, (PMC*)b->value);
return 0;
}
/*
=item C<void delete_keyed(PMC *key)>
=item C<void delete_keyed_str(STRING *key)>
=item C<void delete_keyed_int(INTVAL key)>
Deletes the key C<*key> from the hash.
=cut
*/
void delete_keyed(PMC* key) {
PMC *item, *next;
next = key_next(INTERP, key);
if (PObj_get_FLAGS(key) & KEY_integer_FLAG) {
if (next) {
item = SELF.get_pmc_keyed_int(key_integer(INTERP, key));
VTABLE_delete_keyed(INTERP, item, next);
return;
}
SELF.delete_keyed_int(key_integer(INTERP, key));
}
else {
if (next) {
item = DYNSELF.get_pmc_keyed_str(key_string(INTERP, key));
VTABLE_delete_keyed(INTERP, item, next);
return;
}
SELF.delete_keyed_str(key_string(INTERP, key));
}
}
void delete_keyed_int(INTVAL idx) {
Hash *h = PMC_struct_val(SELF);
INTVAL n;
HashBucket *b;
n = h->entries;
if (idx < 0)
idx += n;
if (idx < 0 || idx >= n) {
return;
}
b = h->bs + idx;
if (b)
b->key = NULL;
}
void delete_keyed_str(STRING* key) {
Hash *h = PMC_struct_val(SELF);
HashBucket *b;
b = parrot_hash_get_bucket(INTERP, h, key);
if (b)
b->key = NULL;
}
/*
=item C<PMC* clone()>
Create a clone of the OrderedHash. Non-existent keys are compacted.
Accessing the clone via integers has different indices, if items
were deleted
=cut
*/
PMC* clone() {
PMC *dest;
Hash *hash = PMC_struct_val(SELF), *h_dest;
UINTVAL i;
HashBucket *b;
void *key;
void *valtmp;
dest = pmc_new_noinit(INTERP, SELF->vtable->base_type);
parrot_new_pmc_hash_x(INTERP, dest, hash->entry_type,
hash->key_type, hash->compare, hash->hash_val);
h_dest = PMC_struct_val(dest);
for (i = 0; i <= hash->mask; i++) {
b = hash->bs + i;
key = b->key;
if (!key)
continue;
valtmp = VTABLE_clone(INTERP, (PMC*)b->value);
parrot_hash_put(INTERP, h_dest, key, valtmp);
}
return dest;
}
/*
=item C<void visit(visit_info *info)>
Used during archiving to visit the elements in the hash.
=item C<void freeze(visit_info *info)>
Used to archive the hash.
=item C<void thaw(visit_info *info)>
Used to unarchive the hash.
Freeze/thaw are inherited from hash, onyl thaw.visit is special, as
we have to preserver key/value order.
=cut
*/
void visit(visit_info *info) {
UINTVAL i;
HashBucket *b;
void *key;
IMAGE_IO *io = info->image_io;
Hash *hash = (Hash *)PMC_struct_val(SELF);
info->container = SELF;
switch (info->what) {
case VISIT_THAW_NORMAL:
case VISIT_THAW_CONSTANTS:
SUPER(info);
break;
case VISIT_FREEZE_NORMAL:
case VISIT_FREEZE_AT_DESTRUCT:
for (i = 0; i <= hash->mask; i++) {
b = hash->bs + i;
key = b->key;
if (!key)
continue;
io->vtable->push_string(interp, io, key);
(info->visit_pmc_now)(interp, b->value, info);
}
break;
default:
real_exception(interp, NULL, E_Exception,
"unhandled visit action (%d)",
info->what);
}
}
}
/*
=back
=head1 SEE ALSO
F<docs/pdds/pdd08_keys.pod>.
=head1 HISTORY
Initial rev by leo 2003-08-21.
=cut
*/
/*
* Local variables:
* c-file-style: "parrot"
* End:
* vim: expandtab shiftwidth=4:
*/