-
Notifications
You must be signed in to change notification settings - Fork 138
/
hash.t
1269 lines (1031 loc) · 28.1 KB
/
hash.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
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#! parrot
# Copyright (C) 2001-2008, Parrot Foundation.
# $Id$
=head1 NAME
t/pmc/hash.t - Test the Hash PMC
=head1 SYNOPSIS
% prove t/pmc/hash.t
=head1 DESCRIPTION
Tests the C<Hash> PMC. Checks key access with various types of
normal and potentially hazardous keys. Does a bit of stress testing as
well.
=cut
.sub main :main
.include 'test_more.pir'
.include 'except_types.pasm'
plan(146)
initial_hash_tests()
more_than_one_hash()
null_key()
hash_keys_with_nulls_in_them()
nearly_the_same_hash_keys()
the_same_hash_keys()
key_that_hashes_to_zero()
size_of_the_hash()
stress_test_loop_set_check()
stress_test_lots_of_keys()
stress_test_loop_set_loop_check()
testing_two_hash_indices_with_integers_at_a_time()
testing_two_hash_indices_with_numbers_at_a_time()
testing_two_hash_indices_with_strings_at_a_time()
setting_and_getting_scalar_pmcs()
setting_scalar_pmcs_and_getting_scalar_values()
getting_values_from_undefined_keys()
setting_and_getting_non_scalar_pmcs()
testing_clone()
clone_doesnt_crash_on_deleted_keys()
clone_preserves_order()
freeze_thaw_preserves_order()
compound_keys()
getting_pmcs_from_compound_keys()
getting_pmcs_from_string_int_compound_keys()
if_hash()
unless_hash()
defined_hash()
exists_hash_key()
delete_hash_key()
cloning_keys()
cloning_pmc_vals()
delete_and_free_list()
exists_with_constant_string_key()
hash_in_pir()
setting_with_compound_keys()
mutating_the_lookup_string()
check_whether_interface_is_done()
iter_over_hash()
broken_delete()
unicode_keys_register_rt_39249()
unicode_keys_literal_rt_39249()
.end
.sub initial_hash_tests
new $P0, 'Hash'
set $P0["foo"], -7
set $P0["bar"], 3.5
set $P0["baz"], "value"
set $I0, $P0["foo"]
set $N0, $P0["bar"]
set $S0, $P0["baz"]
is( $I0, -7, 'lookup Int in hash' )
is( $N0, 3.500000, 'lookup Num in hash' )
is( $S0, "value", 'lookup Str in hash' )
set $S1, "oof"
set $S2, "rab"
set $S3, "zab"
set $P0[$S1], 7
set $P0[$S2], -3.5
set $P0[$S3], "VALUE"
set $I0, $P0[$S1]
set $N0, $P0[$S2]
set $S0, $P0[$S3]
is( $I0, 7, 'lookup Int in hash via Str' )
is( $N0, -3.500000, 'lookup Num in hash via Str' )
is( $S0, "VALUE", 'lookup Str in hash via Str' )
.end
.sub more_than_one_hash
new $P0, ['Hash']
set $S0, "key"
set $P0[$S0], 1
new $P1, ['Hash']
set $S1, "another_key"
set $P1[$S1], 2
set $I0, $P0[$S0]
set $I1, $P1[$S1]
is( $I0, 1, 'two hashes: lookup Int from hash via Str' )
is( $I1, 2, 'two hashes: lookup Int from hash via Str in second' )
.end
.sub null_key
# See RT #59542
new $P0, ['Hash']
$P0['yum'] = 5
null $S0
$I0 = 0
$P2 = new ['ExceptionHandler']
$P2.'handle_types'(.EXCEPTION_UNEXPECTED_NULL)
set_addr $P2, null_ex_eh
push_eh $P2
$P1 = $P0[$S0]
goto check
null_ex_eh:
$I0 = 1
check:
pop_eh
is( $I0, 1, 'using null string as key throws' )
.end
.sub hash_keys_with_nulls_in_them
new $P0, ['Hash']
set $S0, "parp\0me"
set $S1, "parp\0you"
set $P0[$S0], 1 # $P0{parp\0me} = 1
set $P0[$S1], 2 # $P0{parp\0you} = 2
set $I0, $P0[$S0]
set $I1, $P0[$S1]
is( $I0, 1, 'hash key with null 1' )
is( $I1, 2, 'hash key will null 2' )
.end
.sub nearly_the_same_hash_keys
new $P0, ['Hash']
set $S0, "a\0"
set $S1, "\0a"
set $P0[$S0], 1
set $P0[$S1], 2
set $I0, $P0[$S0]
set $I1, $P0[$S1]
is( $I0, 1, 'hash key with null' )
is( $I1, 2, 'almost identical hash key with null' )
.end
.sub the_same_hash_keys
new $P0, ['Hash']
set $S0, "Happy"
set $S1, "Happy"
set $P0[$S0], 1
set $I0, $P0[$S0]
is( $I0, 1, 'lookup by $S0' )
set $P0[$S1], 2
set $I1, $P0[$S1]
is( $I1, 2, 'set and lookup by $S1 (identical to $S0)' )
.end
# NB Next test depends on "key2" hashing to zero, which it does with
# the current algorithm; if the algorithm changes, change the test!
# XXX - really?
.sub key_that_hashes_to_zero
new $P0, ['Hash']
set $S0, "key2"
set $P0[$S0], 1
set $I0, $P0[$S0]
is( $I0, 1, 'key that hashes to zero XXX' )
.end
.sub size_of_the_hash
new $P0, ['Hash']
set $P0["0"], 1
set $I0, $P0
is( $I0, 1, 'hash size of 1' )
set $P0["1"], 1
set $I0, $P0
is( $I0, 2, 'hash size of 2' )
set $P0["0"], 1
set $I0, $P0
is( $I0, 2, 'hash size of 2' )
.end
.sub stress_test_loop_set_check
new $P0, 'Hash'
set $I0, 200
set $S0, "mikey"
set $P0[$S0], "base"
concat $S1, $S0, "s"
set $P0[$S1], "bases"
set $S2, $I0
concat $S1, $S0, $S2
set $P0[$S1], "start"
set $S3, $P0["mikey"]
is( $S3, 'base', 'setup: lookup mikey' )
set $S3, $P0["mikeys"]
is( $S3, 'bases', 'setup: lookup mikeys' )
set $S3, $P0["mikey200"]
is( $S3, 'start', 'setup: lookup mikey200' )
LOOP:
eq $I0, 0, DONE
sub $I0, $I0, 1
set $S2, $I0
concat $S1, $S0, $S2
concat $S4, $S0, $S2
eq $S1, $S4, L1
## this should be fail(), but it is not implemented yet
ok( 0, 'concat mismatch' )
L1:
set $P0[$S1], $I0
set $I1, $P0[$S1]
eq $I0, $I1, L2
## this should be fail(), but it is not implemented yet
ok( 0, 'lookup mismatch' )
L2:
branch LOOP
DONE:
set $I0, $P0["mikey199"]
is( $I0, 199, 'lookup: mikey199' )
set $I0, $P0["mikey117"]
is( $I0, 117, 'lookup: mikey117' )
set $I0, $P0["mikey1"]
is( $I0, 1, 'lookup: mikey1' )
set $I0, $P0["mikey23"]
is( $I0, 23, 'lookup: miky23' )
set $I0, $P0["mikey832"]
is( $I0, 0, 'lookup: mikey832 (never set)' )
.end
## stuff them in, and check periodically that we can pull selected ones out.
## *_multiple_keys are used by stress_test_lots_of_keys
.sub set_multiple_keys
.param pmc hash
.param int key_index
.param int step
.param int count
again:
if count <= 0 goto ret
$S0 = key_index
$S1 = concat "key", $S0
$S2 = concat "value", $S0
hash[$S1] = $S2
key_index = key_index + step
count = count - 1
goto again
ret:
.end
.sub delete_multiple_keys
.param pmc hash
.param int key_index
.param int step
.param int count
again:
if count <= 0 goto ret
$S0 = key_index
$S1 = concat "key", $S0
delete hash[$S1]
key_index = key_index + step
count = count - 1
goto again
ret:
.end
.sub check_key
.param pmc hash
.param int index
$S10 = index
$S0 = concat "key", $S10
$S1 = concat "value", $S10
$S2 = hash[$S0]
$S3 = concat "correct value for key ", $S10
is( $S2, $S1, $S3 )
.end
.sub stress_test_lots_of_keys
new $P30, 'Hash'
$I29 = 1
$I30 = 1000
$I31 = 1000
# round 1
set_multiple_keys($P30, $I29, $I30, $I31)
check_key( $P30, 1 )
check_key( $P30, 1001 )
check_key( $P30, 2001 )
# round 2
$I21 = 100000
set_multiple_keys($P30, $I21, $I30, $I31)
check_key( $P30, 1 )
check_key( $P30, 1001 )
check_key( $P30, 2001 )
check_key( $P30, 100000 )
check_key( $P30, 101000 )
check_key( $P30, 102000 )
# round 3
$I22 = 50000
set_multiple_keys($P30, $I22, $I29, $I22)
check_key( $P30, 1 )
check_key( $P30, 1001 )
check_key( $P30, 2001 )
check_key( $P30, 500000 )
check_key( $P30, 510000 )
check_key( $P30, 520000 )
# round 4
delete_multiple_keys($P30, $I22, $I29, $I22)
check_key( $P30, 1001 )
check_key( $P30, 2001 )
$I50 = exists $P30['key50000']
$I51 = exists $P30['key51000']
$I52 = exists $P30['key52000']
is( $I50, 0, 'key50000 does not exist after delete' )
is( $I51, 0, 'key51000 does not exist after delete' )
is( $I52, 0, 'key52000 does not exist after delete' )
.end
# Check all values after setting all of them
.sub stress_test_loop_set_loop_check
new $P0, 'Hash'
set $I0, 200
set $S0, "mikey"
SETLOOP:
eq $I0, 0, DONE
sub $I0, $I0, 1
set $S2, $I0
concat $S1, $S0, $S2
set $P0[$S1], $I0
branch SETLOOP
set $I0, 200
GETLOOP:
eq $I0, 0, DONE
sub $I0, $I0, 1
set $S2, $I0
concat $S1, $S0, $S2
set $I1, $P0[$S1]
eq $I0, $I1, L2
is( $I0, $I1, 'lookup mismatch in stress test loop' )
.return()
L2:
branch GETLOOP
DONE:
ok( 1, 'stress test: loop set with loop check' )
.end
.sub testing_two_hash_indices_with_integers_at_a_time
new $P0, ['Hash']
set $P0["foo"],37
set $P0["bar"],-15
set $I0,$P0["foo"]
is( $I0, 37, 'lookup int in foo' )
set $I0,$P0["bar"]
is( $I0, -15, 'lookup int in bar' )
set $S1,"foo"
set $I0,$P0[$S1]
is( $I0,37, 'lookup int in foo via var' )
set $S1,"bar"
set $I0,$P0[$S1]
is( $I0,-15, 'lookup int in bar via var' )
.end
.sub testing_two_hash_indices_with_numbers_at_a_time
new $P0, ['Hash']
set $P0["foo"],37.100000
set $P0["bar"],-15.100000
set $N0,$P0["foo"]
is( $N0,37.100000, 'lookup num in foo' )
set $N0,$P0["bar"]
is( $N0,-15.100000, 'lookup num in bar' )
set $S1,"foo"
set $N0,$P0[$S1]
is( $N0,37.100000, 'lookup num in foo via var' )
set $S1,"bar"
set $N0,$P0[$S1]
is( $N0,-15.100000, 'lookup num in bar via var' )
.end
.sub testing_two_hash_indices_with_strings_at_a_time
new $P0, ['Hash']
set $P0["foo"],"baz"
set $P0["bar"],"qux"
set $S0,$P0["foo"]
is( $S0,"baz", 'lookup str in foo' )
set $S0,$P0["bar"]
is( $S0,"qux", 'lookup str in bar' )
set $S1,"foo"
set $S0,$P0[$S1]
is( $S0,"baz", 'lookup str in foo via var' )
set $S1,"bar"
set $S0,$P0[$S1]
is( $S0,"qux", 'lookup str in bar via var' )
.end
# So far, we have only used INTVALs, FLOATVALs and STRINGs as values
# and/or keys. Now we try PMCs.
.sub setting_and_getting_scalar_pmcs
new $P0, ['Hash']
new $P1, ['Integer']
new $P2, ['Integer']
set $S0, "non-PMC key"
set $P1, 10
set $P0[$S0], $P1
set $P2, $P0[$S0]
is( $P2, $P1, 'lookup PMC Integer' )
set $P1, -1234.000000
set $P0[$S0], $P1
set $P2, $P0[$S0]
is( $P2, $P1, 'lookup num after PMC Integer in slot' )
set $P1, "abcdefghijklmnopq"
set $P0[$S0], $P1
set $P2, $P0[$S0]
is( $P2, $P1, 'lookup string' )
new $P1, ['Undef']
set $P0[$S0], $P1
set $P2, $P0[$S0]
typeof $S1, $P2
is( $S1, "Undef", 'lookup Undef PMC' )
.end
.sub setting_scalar_pmcs_and_getting_scalar_values
new $P0, ['Hash']
new $P1, ['Integer']
set $S0, "A rather large key"
set $I0, 10
set $P1, $I0
set $P0[$S0], $P1
set $I1, $P0[$S0]
is( $I1, $I0, 'lookup PMC and get scalar Int' )
set $N0, -1234.000000
set $P1, $N0
set $P0[$S0], $P1
set $N1, $P0[$S0]
is( $N1, $N0, 'lookup PMC and get scalar Num' )
set $S1, "abcdefghijklmnopq"
set $P1, $S1
set $P0[$S0], $P1
set $S2, $P0[$S0]
is( $S2, $S1, 'lookup PMC and get scalar Str' )
.end
.sub getting_values_from_undefined_keys
new $P2, ['Hash']
set $I0, $P2["qwerty"]
set $N0, $P2["asdfgh"]
set $S0, $P2["zxcvbn"]
set $P0, $P2["123456"]
is( $I0, 0, 'undefined key returns Int 0' )
is( $N0, 0.0, 'undefined key returns Num 0.0' )
is( $S0, "", 'undefined key returns Str ""' )
$I1 = 1
if_null $P0, P0_is_null
$I1 = 0
P0_is_null:
ok( $I1, 'undefined key returns null PMC' )
.end
.sub setting_and_getting_non_scalar_pmcs
new $P0, ['Hash']
new $P1, ['ResizablePMCArray']
new $P2, ['ResizablePMCArray']
set $P1[4],"string"
set $P0["one"],$P1
set $P2,$P0["one"]
set $S0,$P2[4]
is( $S0, 'string', 'set and get non-scalar PMCs' )
.end
.sub testing_clone
new $P0, ['Hash']
set $S0, "a"
set $P0[$S0], $S0
new $P2, ['ResizablePMCArray']
set $P2, 2
set $P0["b"], $P2
# $P0 = { a => "a", b => [undef, undef] }
clone $P1, $P0
set $P0["c"], 4
set $P3, $P0["b"]
set $P3, 3
set $P0["b"], $P3
set $P1["a"], "A"
# $P0 = { a => "a", b => [undef, undef, undef], c => 4 }
# $P1 = { a => "A", b => [undef, undef] }
set $S0, $P0["a"]
is( $S0, "a", 'original hash lookup pre-clone value' )
set $P5, $P0["b"]
set $I0, $P5
is( $I0, 3, 'original hash lookup post-clone value' )
set $I0, $P0["c"]
is( $I0, 4, 'original hash lookup post-clone value in new slot' )
set $S0, $P1["a"]
is( $S0, "A", 'cloned hash lookup post-clone value' )
set $P5, $P1["b"]
set $I0, $P5
is( $I0, 2, 'cloned hash lookup pre-clone complex value' )
# XXX: this should return undef or something, but it dies instead.
# set $P3, $P0["c"]
# unless $P3, ok6
# print "not "
# ok6:
# print "ok 6\n"
.end
.sub clone_doesnt_crash_on_deleted_keys
.local pmc hash1, hash2
.local string key1, key2
hash1 = new 'Hash'
key1 = 'foo'
key2 = 'bar'
hash1[key1] = 1
hash1[key2] = 2
delete hash1[key1]
hash2 = clone hash1
ok( 1, "clone doesn't crash on deleted keys" )
.end
# TT #116
# This test failure depends on the value if the hash seed, which is randomized.
# To try to ensure that the test fails reliably if there's a regression, it's
# run 3 times with different hash keys.
.sub clone_preserves_order
.local pmc h, cloned
.local string s1, s2
.local int all_ok
all_ok = 1
h = new ['Hash']
h['a'] = 1
h['b'] = 2
h['c'] = 3
h['d'] = 4
h['e'] = 5
h['f'] = 6
h['g'] = 7
h['h'] = 8
h['i'] = 9
h['j'] = 10
h['k'] = 11
h['l'] = 12
cloned = clone h
#If the bug is present, the order of elements in the get_repr string will
#be different.
s1 = get_repr h
s2 = get_repr cloned
if s1 != s2 goto fail
h = new ['Hash']
h['aa'] = 1
h['bb'] = 2
h['cc'] = 3
h['dd'] = 4
h['ee'] = 5
h['ff'] = 6
h['gg'] = 7
h['hh'] = 8
h['ii'] = 9
h['jj'] = 10
h['kk'] = 11
h['ll'] = 12
cloned = clone h
s1 = get_repr h
s2 = get_repr cloned
if s1 != s2 goto fail
h = new ['Hash']
h['one'] = 1
h['two'] = 2
h['three'] = 3
h['four'] = 4
h['five'] = 5
h['six'] = 6
h['seven'] = 7
h['eight'] = 8
h['nine'] = 9
h['ten'] = 10
h['eleven'] = 11
h['twelve'] = 12
cloned = clone h
s1 = get_repr h
s2 = get_repr cloned
if s1 != s2 goto fail
goto end
fail:
all_ok = 0
end:
ok(all_ok, "clone preserves hash internal order")
.end
.sub freeze_thaw_preserves_order
.local pmc h, cloned
.local string s1, s2
.local int all_ok
all_ok = 1
h = new ['Hash']
h['a'] = 1
h['b'] = 2
h['c'] = 3
h['d'] = 4
h['e'] = 5
h['f'] = 6
h['g'] = 7
h['h'] = 8
h['i'] = 9
h['j'] = 10
h['k'] = 11
h['l'] = 12
$S0 = freeze h
cloned = thaw $S0
s1 = get_repr h
s2 = get_repr cloned
if s1 != s2 goto fail
h = new ['Hash']
h['aa'] = 1
h['bb'] = 2
h['cc'] = 3
h['dd'] = 4
h['ee'] = 5
h['ff'] = 6
h['gg'] = 7
h['hh'] = 8
h['ii'] = 9
h['jj'] = 10
h['kk'] = 11
h['ll'] = 12
$S0 = freeze h
cloned = thaw $S0
s1 = get_repr h
s2 = get_repr cloned
if s1 != s2 goto fail
h = new ['Hash']
h['one'] = 1
h['two'] = 2
h['three'] = 3
h['four'] = 4
h['five'] = 5
h['six'] = 6
h['seven'] = 7
h['eight'] = 8
h['nine'] = 9
h['ten'] = 10
h['eleven'] = 11
h['twelve'] = 12
$S0 = freeze h
cloned = thaw $S0
s1 = get_repr h
s2 = get_repr cloned
if s1 != s2 goto fail
goto end
fail:
all_ok = 0
end:
ok(all_ok, "freeze/thaw preserves hash internal order")
.end
.sub compound_keys
new $P0, ['Hash']
new $P1, ['Hash']
new $P2, ['ResizablePMCArray']
set $P1["b"], "ab"
set $P0["a"], $P1
set $S0, $P0["a";"b"]
is( $S0, "ab", 'Str from compound key' )
set $P2[20], 77
set $P1["n"], $P2
set $I0, $P0["a";"n";20]
is( $I0, 77, 'Int from compound key^2' )
set $S0, "a"
set $S1, "n"
set $I0, 20
set $I0, $P0[$S0;$S1;$I0]
is( $I0, 77, 'Int from indirect compound key^2' )
set $P0["c"], $P2
set $P2[33], $P1
set $S0, $P0["c";33;"b"]
is( $S0, "ab", 'Str from indirect/direct compound key^2' )
set $S0, "c"
set $I1, 33
set $S2, "b"
set $S0, $P0[$S0;$I1;$S2]
is( $S0, "ab", 'Str from indirect compound key^2' )
set $P1["b"], 47.11
set $N0, $P0["c";$I1;$S2]
is( $N0, 47.11, 'Num from indirect compound key^2' )
.end
.sub getting_pmcs_from_compound_keys
new $P0, ['Hash']
new $P1, ['Hash']
new $P2, ['Integer']
set $P2, 12
set $P1["b"], $P2
set $P0["a"], $P1
set $P3, $P0["a";"b"]
set $S0, $P3
is( $S0, "12", "lookup PMC from compound key" )
.end
# 12
.sub getting_pmcs_from_string_int_compound_keys
new $P0, ['Hash']
new $P1, ['Hash']
new $P2, ['Integer']
set $P2, 4
set $P1[9], $P2
set $I0, $P1[9]
is( $I0, 4, 'lookup Int PMC from hash' )
set $P0["a"], $P1
set $I0, $P0["a";9]
is( $I0, 4, 'lookup Inc PMC from compound hash' )
.end
# A hash is only false if it has size 0
.sub if_hash
new $P0, ['Hash']
## Could just use Test::More tests directly, but then we are really
## checking casting to Int then testing value (I think)
## ie. ok( $P0, '...' )
$I1 = 0
if $P0, L1
$I1 = 1
L1:
ok( $I1, 'Empty hash is false' )
set $P0["key"], "value"
$I1 = 1
if $P0, L2
$I1 = 0
L2:
ok( $I1, 'Hash with one slot is true' )
set $P0["key"], ""
$I1 = 1
if $P0, L3
$I1 = 0
L3:
ok( $I1, 'Hash with one value ("") is true' )
new $P1, ['Undef']
set $P0["key"], $P1
$I1 = 1
if $P0, L4
$I1 = 0
L4:
ok( $P0, 'Hash with one value (Undef PMC) is true' )
.end
.sub unless_hash
new $P0, ['Hash']
$I0 = 1
unless $P0, L1
$I0 = 0
L1:
ok( $I0, 'Empty hash is false in unless' )
$I0 = 0
set $P0["key"], "value"
unless $P0, L2
$I0 = 1
L2:
ok( $I0, 'Hash with one value is true' )
$I0 = 0
set $P0["key"], "\0"
unless $P0, L3
$I0 = 1
L3:
ok( $I0, 'Hash with one value ("\0") is true' )
$I0 = 0
new $P1, ['Undef']
set $P0["key"], $P1
unless $P0, L4
$I0 = 1
L4:
ok( $I0, 'Hash with one value (Undef PMC) is true' )
.end
.sub defined_hash
new $P0, ['Hash']
defined $I0, $P0
ok( $I0, 'Empty has is defined' )
## nok() had not been (correctly) implemented when this test was written
defined $I0, $P1
$I0 = not $I0
ok( $I0, 'Unassigned var is undefined' )
set $P0["a"], 1
defined $I0, $P0["a"]
ok( $I0, 'Int in hash value is defined' )
defined $I0, $P0["b"]
$I0 = not $I0
ok( $I0, 'Unassigned hash slot is undefined' )
new $P1, ['Undef']
set $P0["c"], $P1
defined $I0, $P0["c"]
$I0 = not $I0
ok( $I0, 'Undef PMC in hash slot is undefined' )
.end
.sub exists_hash_key
new $P0, ['Hash']
set $P0["a"], 1
exists $I0, $P0["a"]
ok( $I0, 'assigned hash key exists' )
exists $I0, $P0["b"]
$I0 = not $I0
ok( $I0, 'unassigned hash key does not exist' )
new $P1, ['Undef']
set $P0["c"], $P1
exists $I0, $P0["c"]
ok( $I0, 'hash key assigned Undef PMC exists' )
.end
.sub delete_hash_key
new $P0, ['Hash']
set $P0["a"], 1
exists $I0, $P0["a"]
ok( $I0, 'assigned hash key exists' )
delete $P0["a"]
exists $I0, $P0["a"]
$I0 = not $I0
ok( $I0, 'delete hash key does not exist' )
.end
.sub cloning_keys
new $P10, ['Hash']
new $P1, ['Key']
set $P1, "Bar"
set $P10[$P1], "Food"
clone $P2, $P1
set $S0, $P10[$P2]
is( $S0, "Food", 'cloned key looks up same value' )
set $S1, "Baa"
set $P10[$S1], "Sheep"
clone $S2, $S1
set $S0, $P10[$S2]
is( $S0, "Sheep", 'cloned key again look up same value' )
.end
.sub cloning_pmc_vals
new $P10, ['Hash']
new $P1, ['Undef']
set $P1, "value"
set $P10["str"], $P1
new $P1, ['Undef']
set $P1, 42
set $P10["int"], $P1
clone $P2, $P10
set $P0, $P2["int"]
is( $P0, 42, 'cloned hash contained pre-clone set int' )
set $P0, $P2["str"]
is( $P0, 'value', 'cloned hash contains pre-clone set str' )
.end
.sub delete_and_free_list
set $I2, 10
set $I1, 1
new $P0, ['FixedPMCArray']
set $P0, 1
new $P1, ['Hash']
outer:
set $P0[0], $I1
sprintf $S0, "ok %vd\n", $P0
set $P1[$S0], $S0
## set $P1[key]=1 then delete it 100 times
set $I0, 100
lp: