-
Notifications
You must be signed in to change notification settings - Fork 138
/
orderedhash.t
662 lines (579 loc) · 10.3 KB
/
orderedhash.t
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
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
#! perl
# Copyright (C) 2001-2006, Parrot Foundation.
# $Id$
use strict;
use warnings;
use lib qw( . lib ../lib ../../lib );
use Test::More;
use Parrot::Test tests => 23;
=head1 NAME
t/pmc/orderedhash.t - Ordered Hash
=head1 SYNOPSIS
% prove t/pmc/orderedhash.t
=head1 DESCRIPTION
Tests the C<OrderedHash> PMC.
=cut
pasm_output_is( <<'CODE', <<OUT, "init" );
new P0, ['OrderedHash']
print "ok 1\n"
set I0, P0
eq I0, 0, ok2
print "not "
ok2:print "ok 2\n"
end
CODE
ok 1
ok 2
OUT
pasm_output_is( <<'CODE', <<OUT, "set keys, get idx" );
new P0, ['OrderedHash']
new P1, ['String']
set P1, "ok 1\n"
set P0["x"], P1
new P1, ['String']
set P1, "ok 2\n"
set P0["a"], P1
new P1, ['String']
set P1, "ok 3\n"
set P0["j"], P1
set I0, P0
eq I0, 3, ok
print "not "
ok: print "ok\n"
set P3, P0[0]
print P3
set P3, P0[1]
print P3
set P3, P0[2]
print P3
set P3, P0["j"]
print P3
set P3, P0["x"]
print P3
set P3, P0["a"]
print P3
end
CODE
ok
ok 1
ok 2
ok 3
ok 3
ok 1
ok 2
OUT
pasm_output_is( <<'CODE', <<OUT, "iterate" );
.include "iterator.pasm"
new P0, ['OrderedHash']
new P1, ['String']
set P1, "ok 1\n"
set P0["x"], P1
new P1, ['String']
set P1, "ok 2\n"
set P0["a"], P1
new P1, ['String']
set P1, "ok 3\n"
set P0["j"], P1
iter P2, P0
set P2, .ITERATE_FROM_START
iter_loop:
unless P2, end_iter
shift P3, P2
set P4, P0[P3]
print P4
branch iter_loop
end_iter:
set P2, .ITERATE_FROM_END
iter_loop2:
unless P2, end_iter2
pop P3, P2
set P4, P0[P3]
print P4
branch iter_loop2
end_iter2:
end
CODE
ok 1
ok 2
ok 3
ok 3
ok 2
ok 1
OUT
pasm_output_is( <<'CODE', <<OUT, "idx only" );
new P0, ['OrderedHash']
new P1, ['String']
set P1, "ok 1\n"
set P0[0], P1
new P1, ['String']
set P1, "ok 2\n"
set P0[1], P1
set P2, P0[0]
print P2
set P2, P0[1]
print P2
end
CODE
ok 1
ok 2
OUT
pasm_output_is( <<'CODE', <<OUT, "set keys, get idx - cloned" );
new P10, ['OrderedHash']
new P1, ['String']
set P1, "ok 1\n"
set P10["x"], P1
new P1, ['String']
set P1, "ok 2\n"
set P10["a"], P1
new P1, ['String']
set P1, "ok 3\n"
set P10["j"], P1
clone P0, P10
set I0, P0
eq I0, 3, ok
print "not "
ok: print "ok\n"
set P3, P0[0]
print P3
set P3, P0[1]
print P3
set P3, P0[2]
print P3
set P3, P0["j"]
print P3
set P3, P0["x"]
print P3
set P3, P0["a"]
print P3
set P3, P0[-1]
print P3
set P3, P0[-2]
print P3
set P3, P0[-3]
print P3
end
CODE
ok
ok 1
ok 2
ok 3
ok 3
ok 1
ok 2
ok 3
ok 2
ok 1
OUT
pasm_output_is( <<'CODE', <<OUT, "exists_keyed" );
new P0, ['OrderedHash']
new P1, ['Integer']
set P0["key"], P1
exists I0, P0["key"]
print I0
exists I0, P0[0]
print I0
exists I0, P0["nokey"]
print I0
exists I0, P0[1]
print I0
new P1, ['Key']
set P1, 0
exists I0, P0[P1]
print I0
set P1, 1
exists I0, P0[P1]
print I0
print "\n"
end
CODE
110010
OUT
pasm_output_is( <<'CODE', <<OUT, "defined_keyed" );
new P0, ['OrderedHash']
new P1, ['Undef']
set P0["key"], P1
defined I0, P0["key"]
print I0
defined I0, P0[0]
print I0
defined I0, P0["nokey"]
print I0
defined I0, P0[1]
print I0
new P2, ['Key']
set P2, 0
defined I0, P0[P2]
print I0
set P2, 1
defined I0, P0[P2]
print I0
set P1, 0
defined I0, P0["key"]
print I0
defined I0, P0[0]
print I0
new P3, ['Key']
set P3, 0
defined I0, P0[P3]
print I0
set P3, 1
defined I0, P0[P3]
print I0
print "\n"
end
CODE
0000001110
OUT
pasm_output_is( <<'CODE', <<OUT, "delete" );
.include "iterator.pasm"
new P0, ['OrderedHash']
new P1, ['String']
set P1, "ok 1\n"
set P0["x"], P1
new P1, ['String']
set P1, "ok 2\n"
set P0["a"], P1
new P1, ['String']
set P1, "ok 3\n"
set P0["j"], P1
delete P0["a"]
iter P2, P0
set P2, .ITERATE_FROM_START_KEYS
iter_loop:
unless P2, end_iter
shift S3, P2
set P3, P2[S3]
print P3
branch iter_loop
end_iter:
delete P0[0]
set P2, .ITERATE_FROM_START_KEYS
iter_loop2:
unless P2, end_iter2
shift S3, P2
set P3, P2[S3]
print P3
branch iter_loop2
end_iter2:
end
CODE
ok 1
ok 3
ok 3
OUT
pasm_output_is( <<'CODE', <<'OUTPUT', "delete with int keys" );
new P0, ['OrderedHash']
set P0["abc"], "Foo"
set P0["def"], 12.6
set P0["ghi"], 5
new P1, ['Key']
set P1, 1
delete P0[P1]
exists I0, P0["abc"]
print I0
exists I0, P0["def"]
print I0
exists I0, P0["ghi"]
print I0
print "\n"
end
CODE
101
OUTPUT
pasm_output_like( <<'CODE', '/[axj]/', "iterate over keys" );
.include "iterator.pasm"
new P0, ['OrderedHash']
new P1, ['String']
set P1, "ok 1\n"
set P0["x"], P1
new P1, ['String']
set P1, "ok 2\n"
set P0["a"], P1
new P1, ['String']
set P1, "ok 3\n"
set P0["j"], P1
iter P2, P0
set P2, .ITERATE_FROM_START_KEYS
iter_loop:
unless P2, end_iter
shift S3, P2
print S3
branch iter_loop
end_iter:
end
CODE
pasm_output_like( <<'CODE', <<'OUT', "iterate over keys, get value" );
.include "iterator.pasm"
new P0, ['OrderedHash']
new P1, ['String']
set P1, "ok 1\n"
set P0["x"], P1
new P1, ['String']
set P1, "ok 2\n"
set P0["a"], P1
new P1, ['String']
set P1, "ok 3\n"
set P0["j"], P1
iter P2, P0
set P2, .ITERATE_FROM_START_KEYS
iter_loop:
unless P2, end_iter
shift S3, P2
set P3, P2[S3]
print P3
branch iter_loop
end_iter:
end
CODE
/ok \d
ok \d
ok \d/
OUT
pir_output_is( << 'CODE', << 'OUTPUT', "OrderedHash in PIR with PMC value" );
.sub _main
.local pmc hash1
hash1 = new ['OrderedHash']
.local pmc val_in
val_in = new ['String']
val_in = "U"
hash1["X"] = val_in
.local pmc val_out
val_out = hash1['X']
print val_out
print "\n"
end
.end
CODE
U
OUTPUT
pir_output_is( << 'CODE', << 'OUTPUT', "OrderedHash set_integer_keyed" );
.sub _main
.local pmc hash1
hash1 = new ['OrderedHash']
hash1["X"] = 14
.local pmc val_out
val_out = hash1['X']
print val_out
print "\n"
end
.end
CODE
14
OUTPUT
pir_output_is( << 'CODE', << 'OUTPUT', "OrderedHash set_string_keyed" );
.sub _main
.local pmc hash1
hash1 = new ['OrderedHash']
.local string val1
val1 = 'U'
set hash1["X"], val1
.local pmc val_out
val_out = hash1['X']
print val_out
print "\n"
end
.end
CODE
U
OUTPUT
pir_output_is( << 'CODE', << 'OUTPUT', "OrderedHash set_string_keyed" );
.sub _main
.local pmc hash1
hash1 = new ['OrderedHash']
hash1["X"] = '14'
.local pmc val_out
val_out = hash1['X']
print val_out
print "\n"
end
.end
CODE
14
OUTPUT
# actually Parrot_OrderedHash_set_string_keyed is used, why ?
pir_output_is( << 'CODE', << 'OUTPUT', "OrderedHash set_string_keyed_str" );
.sub _main
.local pmc hash1
hash1 = new ['OrderedHash']
.local string key1
key1 = 'X'
hash1[key1] = '15'
.local pmc val_out
val_out = hash1[key1]
print val_out
print "\n"
end
.end
CODE
15
OUTPUT
pir_output_is( << 'CODE', << 'OUTPUT', "OrderedHash set_number_keyed" );
.sub _main
.local pmc hash1
hash1 = new ['OrderedHash']
.local string key1
key1 = 'X'
hash1[key1] = -16.16
.local pmc val_out
val_out = hash1[key1]
print val_out
print "\n"
end
.end
CODE
-16.16
OUTPUT
pir_output_is( << 'CODE', << 'OUTPUT', "OrderedHash get_integer" );
.sub _main
.local pmc hash1
hash1 = new ['OrderedHash']
.local int hash_size
hash_size = hash1
print hash_size
print "\n"
hash1['X'] = 'U'
hash_size = hash1
print hash_size
print "\n"
hash1['Y'] = 'V'
hash_size = hash1
print hash_size
print "\n"
hash1['size'] = hash_size
hash_size = hash1
print hash_size
print "\n"
end
.end
CODE
0
1
2
3
OUTPUT
pasm_output_is( <<'CODE', <<'OUTPUT', "delete and access remaining" );
new P0, ['OrderedHash']
new P1, ['String']
set P1, "A"
set P0["a"], P1
new P1, ['String']
set P1, "B"
set P0["b"], P1
set P3, P0["b"]
print 'P0["b"]: '
print P3
print "\n"
delete P0["a"]
set P4, P0["b"]
print 'P0["b"]: '
print P4
print "\n"
end
CODE
P0["b"]: B
P0["b"]: B
OUTPUT
pir_output_is( << 'CODE', << 'OUTPUT', "check whether interface is done" );
.sub _main
.local pmc pmc1
pmc1 = new ['OrderedHash']
.local int bool1
does bool1, pmc1, "scalar"
print bool1
print "\n"
does bool1, pmc1, "hash"
print bool1
print "\n"
does bool1, pmc1, "array"
print bool1
print "\n"
does bool1, pmc1, "no_interface"
print bool1
print "\n"
end
.end
CODE
0
1
1
0
OUTPUT
pasm_output_is( <<'CODE', <<'OUTPUT', "get_integer_keyed" );
new P0, ['OrderedHash']
set P0["Foo"], 10
set P0["Bar"], 20
set I0, P0["Bar"]
print I0
print "\n"
set I1, P0["Foo"]
print I1
print "\n"
set I2, P0[0]
print I2
print "\n"
set I3, P0[1]
print I3
print "\n"
end
CODE
20
10
10
20
OUTPUT
pasm_output_is( <<'CODE', <<'OUTPUT', "get_number_keyed" );
new P0, ['OrderedHash']
set N0, 12.3
set N1, 45.1
set P0["Foo"], N0
set P0["ooF"], N1
set N2, P0["ooF"]
eq N1, N2, OK1
print "not "
OK1: print "ok 1\n"
set N3, P0["Foo"]
eq N0, N3, OK2
print "not "
OK2: print "ok 2\n"
set N4, P0[0]
eq N4, N0, OK3
print "not "
OK3: print "ok 3\n"
set N5, P0[1]
eq N5, N1, OK4
print "not "
OK4: print "ok 4\n"
end
CODE
ok 1
ok 2
ok 3
ok 4
OUTPUT
pasm_output_is( <<'CODE', <<'OUTPUT', "freeze/thaw 1" );
new P0, ['OrderedHash']
set P0["a"], "Foo\n"
set P0["b"], "Bar\n"
freeze S0, P0
thaw P1, S0
set P2, P1["a"]
print P2
set P2, P1[0]
print P2
set P2, P1["b"]
print P2
set P2, P1[1]
print P2
end
CODE
Foo
Foo
Bar
Bar
OUTPUT
# Local Variables:
# mode: cperl
# cperl-indent-level: 4
# fill-column: 100
# End:
# vim: expandtab shiftwidth=4: