-
Notifications
You must be signed in to change notification settings - Fork 138
/
resizablebooleanarray.t
889 lines (722 loc) · 16.8 KB
/
resizablebooleanarray.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
#!./parrot
# Copyright (C) 2001-2007, Parrot Foundation.
=head1 NAME
t/pmc/resizablebooleanarray.t - testing the ResizableBooleanArray PMC
=head1 SYNOPSIS
% prove t/pmc/resizablebooleanarray.t
=head1 DESCRIPTION
Tests C<ResizableBooleanArray> PMC. Checks size, sets various elements, including
out-of-bounds test. Checks INT and PMC keys.
=cut
.include 'except_types.pasm'
.include 'fp_equality.pasm'
.sub main :main
.include 'test_more.pir'
plan(68)
setting_array_size()
setting_first_element()
setting_second_element()
setting_negatively_indexed_element()
getting_negatively_indexed_element()
setting_oob_element()
getting_oob_element()
set_via_pmc_keys_access_via_ints()
set_via_int_access_via_key_pmc()
interface_check()
push_integer()
push_and_pop()
pop_bounds_check()
shift_and_unshift()
shift_bounds_check()
aerobics()
direct_access()
sparse_access()
check_for_zeroedness()
pop_into_sparse()
clone_empty()
clone_tests()
alternate_clone_tests()
get_iter_test()
.end
.sub setting_array_size
new $P0, ['ResizableBooleanArray']
is($P0, 0, "new ResizableBooleanArray is empty")
$P0 = 1
is($P0, 1, "int assignment to RBA works")
$P0 = 5
is($P0, 5, "another int assignment to RBA works")
$P0 = 50
is($P0, 50, "yet another int assignment to RBA works")
$P0 = 7
is($P0, 7, "shrinking via int assignment to RBA works")
new $P1, ['ExceptionHandler']
set_label $P1, caught
$P1.'handle_types'(.EXCEPTION_OUT_OF_BOUNDS)
push_eh $P1
$P0 = -1
ok(0, "no exception caught for setting negative size")
.return()
caught:
ok(1, "caught exception on setting negative size")
.end
.sub setting_first_element
new $P0, ['ResizableBooleanArray']
$P0 = 1
$P0[0] = -7
$I0 = $P0[0]
is($I0, 1, "negative int -> boolean conversion is ok")
$P0[0] = 3.7
$N0 = $P0[0]
is($N0, 1.0, "float -> boolean conversion is ok")
$P0[0] = 17
$I0 = $P0[0]
is($I0, 1, "positive int -> boolean conversion is ok")
.end
.sub setting_second_element
new $P0, ['ResizableBooleanArray']
$P0 = 2
$P0[1] = -7
$I0 = $P0[1]
is($I0, 1, "negative int -> boolean conversion is ok")
$P0[1] = 3.7
$N0 = $P0[1]
is($N0, 1.0, "float -> boolean conversion is ok")
$P0[1] = 17
$I0 = $P0[1]
is($I0, 1, "positive int -> boolean conversion is ok")
.end
.sub setting_negatively_indexed_element
new $P0, ['ResizableBooleanArray']
new $P1, ['ExceptionHandler']
set_label $P1, caught
$P1.'handle_types'(.EXCEPTION_OUT_OF_BOUNDS)
push_eh $P1
set $P0[-1], 1
pop_eh
ok(0, "no exception caught for negative index access")
goto end
caught:
ok(1, "caught exception on negative index access")
end:
.end
.sub getting_negatively_indexed_element
new $P0, ['ResizableBooleanArray']
set $P0, 1
set $I0, $P0[-1]
is($I0, 0, "negative index retrieval is 0")
new $P1, ['ExceptionHandler']
set_label $P1, caught
$P1.'handle_types'(.EXCEPTION_OUT_OF_BOUNDS)
push_eh $P1
set $I0, $P0[-2]
ok(0, "no exception caught for negative index out of range access")
.return()
caught:
pop_eh
ok(1, "caught exception on negative index out of range access")
.end
.sub setting_oob_element
new $P0, ['ResizableBooleanArray']
set $P0[1], -7
set $I0, $P0[1]
is($I0, 1, "negative oob assignment is fine")
$P0[2] = 3.7
$N0 = $P0[2]
is($N0, 1.0, "float -> boolean conversion w/ oob assignment is ok")
$P0[3] = 17
$I0 = $P0[3]
is($I0, 1, "positive int -> boolean conversion w/ oob assignment is ok")
.end
.sub getting_oob_element
new $P0, ['ResizableBooleanArray']
set $P0, 1
set $I0, $P0[1]
ok(1, "setting/getting an oob element worked")
.end
.sub set_via_pmc_keys_access_via_ints
new $P0, ['ResizableBooleanArray']
new $P1, ['Key']
set $P1, 0
set $P0[$P1], 25
set $P1, 1
set $P0[$P1], 2.5
set $P1, 2
set $P0[$P1], "17"
set $I0, $P0[0]
is($I0, 1, "key set, int get worked")
set $N0, $P0[1]
is($N0, 1.0, "key set, num get worked")
set $S0, $P0[2]
is($S0, "1", "key set, string get worked")
.end
.sub set_via_int_access_via_key_pmc
new $P0, ['ResizableBooleanArray']
set $P0, 1
set $P0[25], 125
set $P0[128], 10.2
set $P0[513], "17"
new $P1, ['Integer']
set $P1, 123456
set $P0[1023], $P1
new $P2, ['Key']
set $P2, 25
set $I0, $P0[$P2]
is($I0, 1, "int set, key get worked")
set $P2, 128
set $N0, $P0[$P2]
is($N0, 1.0, "int set, key get worked")
set $P2, 513
set $S0, $P0[$P2]
is($S0, "1", "int set key get worked")
set $P2, 1023
set $P3, $P0[$P2]
is($P3, 1, "int set, key get worked")
.end
.sub interface_check
.local pmc pmc1
pmc1 = new ['ResizableBooleanArray']
.local int bool1
does bool1, pmc1, "scalar"
is(bool1, 0, "RBA doesn't do 'scalar'")
does bool1, pmc1, "array"
is(bool1, 1, "RBA does 'array'")
does bool1, pmc1, "no_interface"
is(bool1, 0, "RBA doesn't do 'no_interface'")
.end
.sub push_integer
.local pmc pmc1
.local string last
.local int elements
pmc1 = new ['ResizableBooleanArray']
pmc1[9999] = 0
push pmc1, 10001
elements = pmc1
is(elements, 10001, "element count looks good")
last = pmc1[10000]
is(last, 1, "last element has the right value")
.end
.sub push_and_pop
.local int i, i_elem
.local pmc pmc_arr
.local int elements
i = 1
pmc_arr = new ['ResizableBooleanArray']
is(pmc_arr, 0, "new RBA doesn't have any elements")
push pmc_arr, i
is(pmc_arr, 1, "RBA with 1 element says it has 1 element")
push pmc_arr, 0
is(pmc_arr, 2, "RBA with 2 elements says it has 2 elements")
i_elem = pop pmc_arr
is(i_elem, 0, "pop popped the right value")
is(pmc_arr, 1, "RBA has 1 element, as expected")
i_elem = pop pmc_arr
is(i_elem, 1, "pop popped the right value again")
is(pmc_arr, 0, "RBA is now empty, expectedly")
pmc_arr = 62
push pmc_arr, 0
push pmc_arr, 1
push pmc_arr, 0
push pmc_arr, 1
i_elem = pop pmc_arr
i_elem = pop pmc_arr
i_elem = pop pmc_arr
is(i_elem, 1, "pop popped the right thing again")
is(pmc_arr, 63, "RBA has expected size")
.end
.sub pop_bounds_check
$P0 = new ['ResizableBooleanArray']
$P1 = new ['ExceptionHandler']
set_label $P1, caught
$P1.'handle_types'(.EXCEPTION_OUT_OF_BOUNDS)
push_eh $P1
pop $I0, $P0
pop_eh
ok(0, "failed to catch an oob exception")
goto end
caught:
ok(1, "caught an oob exception")
end:
.end
.sub shift_and_unshift
.local int i, i_elem
.local pmc pmc_arr
.local int elements
i = 1
pmc_arr = new ['ResizableBooleanArray']
# No elements are set
is(pmc_arr, "", "stringification looks ok")
# Set two of the first three elements
pmc_arr[0] = 1
pmc_arr[2] = 1
is(pmc_arr, "101", "stringification w/ 3 elems is good")
# Unshift a "1" element on
unshift pmc_arr, i
is(pmc_arr, "1101", "still ok")
# Unshift a "0" element on
unshift pmc_arr, 0
is(pmc_arr, "01101", "still ok")
# Shift an element off
i_elem = shift pmc_arr
is(i_elem, 0, "shift shifted a 0")
is(pmc_arr, "1101", "stringification ok")
# Shift an element off
i_elem = shift pmc_arr
is(i_elem, 1, "shift shifted a 1")
is(pmc_arr, "101", "stringification ok")
# Resize the array
pmc_arr = 25
is(pmc_arr, "1010000000000000000000000", "long stringification is correct")
# Unshift 4 elements on
unshift pmc_arr, 1
unshift pmc_arr, 1
unshift pmc_arr, 0
unshift pmc_arr, 1
is(pmc_arr, "10111010000000000000000000000", "longer stringification is ok")
# Shift 3 elements off
i_elem = shift pmc_arr
i_elem = shift pmc_arr
i_elem = shift pmc_arr
is(i_elem, 1, "shift shifted the right thing")
is(pmc_arr, "11010000000000000000000000", "stringification is still ok")
# Set same size array is currently
pmc_arr = 26
is(pmc_arr, "11010000000000000000000000", "noop size change did nothing")
# Set 101th element
pmc_arr[100] = 1
is(pmc_arr, 101, "setting pmc_arr[100] changed size to 101")
# Shift off 99 elements
.local int counter
counter = 98
shift_loop:
i_elem = shift pmc_arr
dec counter
if counter > 0 goto shift_loop
is(i_elem, 0, "all peachy")
is(pmc_arr, "001", "all's well that ends well")
.end
.sub shift_bounds_check
$P0 = new ['ResizableBooleanArray']
$P1 = new ['ExceptionHandler']
set_label $P1, caught
$P1.'handle_types'(.EXCEPTION_OUT_OF_BOUNDS)
push_eh $P1
shift $I0, $P0
ok(0, "no OOB exception thrown")
goto end
caught:
ok(1, "OOB exception thrown and caught")
end:
.end
.sub aerobics
.local pmc jmpstack
jmpstack = new 'ResizableIntegerArray'
new $P0, ['ResizableBooleanArray']
set $I10, 10000
set $I1, 0
set $I0, 0
buildup:
ge $I0, $I10, postBuildUp
mod $I4, $I1, 2
push $P0, $I4
add $I1, 1 # Push $P0, mod $I1++, 2
mod $I4, $I1, 2
push $P0, $I4
add $I1, 1 # Push $P0, mod $I1++, 2
mod $I4, $I1, 2
push $P0, $I4
add $I1, 1 # Push $P0, mod $I1++, 2
pop $I2, $P0
mul $I3, $I0, 3
add $I3, 2
mod $I3, 2
ne $I2, $I3, errFirstPop # fail if pop != mod $I0 * 3 + 2, 2
pop $I2, $P0
mul $I3, $I0, 3
add $I3, 1
mod $I3, 2
ne $I2, $I3, errSecondPop # fail if pop != mod $I0 * 3 + 1, 2
set $I2, $P0
add $I3, $I0, 1
ne $I2, $I3, errBuildLen # fail if length != $I0 + 1
add $I0, 1
branch buildup
postBuildUp:
set $I0, 0
checkBuildUpLeft:
ge $I0, $I10, postCheckBuildUpLeft
set $I2, $P0[$I0]
mul $I3, $I0, 3
mod $I3, 2
ne $I2, $I3, errLeftGet
add $I0, 1
branch checkBuildUpLeft
postCheckBuildUpLeft:
mul $I0, $I10, -1
checkBuildUpRight:
ge $I0, 0, postCheckBuildUpRight
set $I2, $P0[$I0]
add $I3, $I0, $I10
mul $I3, 3
mod $I3, 2
ne $I2, $I3, errRightGet
add $I0, 1
branch checkBuildUpRight
postCheckBuildUpRight:
set $I0, $I10
tearDown:
le $I0, 0, postTearDown
pop $I2, $P0
sub $I3, $I0, 1
mod $I3, 2
ne $I2, $I3, errTearDown
sub $I0, 1
branch tearDown
postTearDown:
ok(1, "aerobics completed successfully")
.return()
errFirstPop:
print "FAILED: first pop\n"
local_branch jmpstack, info
.return()
errSecondPop:
print "FAILED: second pop\n"
local_branch jmpstack, info
.return()
errBuildLen:
print "FAILED: buildup length\n"
local_branch jmpstack, info
.return()
errLeftGet:
print "FAILED: left get\n"
local_branch jmpstack, info
.return()
errRightGet:
print "FAILED: right get\n"
local_branch jmpstack, info
.return()
errTearDown:
print "FAILED: tear down cap\n"
local_branch jmpstack, info
.return()
info:
ok(0, "aerobics goof:")
print "#Found: "
print $I2
print "\n#Wanted: "
print $I3
print "\n"
local_return jmpstack
.end
.sub direct_access
new $P0, ['ResizableBooleanArray']
set $I10, 550000
set $I0, 1
lp1:
add $I1, $I0, 5
mod $I2, $I1, 2
set $P0[$I0], $I2
add $I3, $I1, $I0
mod $I2, $I3, 2
push $P0, $I2
shl $I0, $I0, 1
inc $I0
le $I0, $I10, lp1
set $I0, 1
lp2:
add $I1, $I0, 5
mod $I5, $I1, 2
# check at $I0
set $I2, $P0[$I0]
ne $I2, $I5, err
add $I4, $I0, 1
# and pushed value at $I0+1
set $I4, $P0[$I4]
add $I3, $I1, $I0
mod $I5, $I3, 2
ne $I5, $I4, err
shl $I0, $I0, 1
inc $I0
le $I0, $I10, lp2
ok(1, "direct access check passed")
.return()
err:
print "not ok "
print $I0
print " "
print $I1
print " "
print $I2
print " "
print $I3
print " "
print $I4
print " "
print $I5
print " "
print $I6
print " "
print $I7
print "\n"
.end
.sub sparse_access
new $P0, ['ResizableBooleanArray']
set $I10, 110000
set $I0, 1
lp1:
add $I1, $I0, 5
mod $I9, $I1, 2
set $P0[$I0], $I9
add $I3, $I1, $I0
mod $I9, $I3, 2
push $P0, $I9
shl $I0, $I0, 1
inc $I0
le $I0, $I10, lp1
set $I0, 1
lp2:
add $I1, $I0, 5
mod $I9, $I1, 2
# check at $I0
set $I2, $P0[$I0]
ne $I2, $I9, err
add $I4, $I0, 1
# and pushed value at $I0+1
set $I4, $P0[$I4]
add $I3, $I1, $I0
mod $I9, $I3, 2
ne $I9, $I4, err
shl $I0, $I0, 1
inc $I0
le $I0, $I10, lp2
ok(1, "sparse access tests ok")
# now repeat and fill some holes
set $I0, 777
lp3:
add $I1, $I0, 5
mod $I9, $I1, 2
set $P0[$I0], $I9
add $I0, $I0, 666
le $I0, $I10, lp3
set $I0, 777
lp4:
add $I1, $I0, 5
mod $I9, $I1, 2
# check at $I0
set $I2, $P0[$I0]
ne $I2, $I9, err
add $I0, $I0, 666
le $I0, $I10, lp4
ok(1, "sparse access tests still ok")
.return()
err:
print "not ok "
print $I0
print " "
print $I1
print " "
print $I2
print " "
print $I3
print " "
print $I4
print "\n"
.end
.sub check_for_zeroedness
new $P0, ['ResizableBooleanArray']
set $I0, 0
lp1:
push $P0, 0
inc $I0
lt $I0, 100, lp1
set $I2, 10000
set $P0, $I2
lp2:
set $I1, $P0[$I0]
ne $I1, 0, err
inc $I0
lt $I0, $I2, lp2
ok(1, "zeroedness tests passed")
.return()
err:
ok(0, "zeroedness tests failed")
print "#Found non-zero value "
print $I1
print " at "
say $I0
.end
.sub pop_into_sparse
new $P0, ['ResizableBooleanArray']
set $I10, 100
set $I0, 0
# push some values at start
loop1:
mod $I5, $I0, 2
push $P0, $I5
inc $I0
lt $I0, $I10, loop1
# create sparse
set $I0, 100000
set $I1, 1000
mod $I5, $I1, 2
#set $P0[$I0], $I1
set $P0[$I0], $I5
inc $I1
loop2:
# push some values after hole
mod $I5, $I1, 2
push $P0, $I5
inc $I1
le $I1, 1100, loop2
dec $I1
set $I3, $P0
lp3:
set $I4, $P0
ne $I3, $I4, err1
pop $I2, $P0
dec $I3
mod $I5, $I1, 2
ne $I2, $I5, err2
gt $I3, $I0, cont1
lt $I3, $I10, cont1
set $I1, 0
gt $I3, $I10, lp3
set $I1, $I10
cont1:
dec $I1
eq $I1, 0, ok
branch lp3
ok:
ok(1, "pop into sparse tests passed")
.return()
err1: set $S0, "len"
branch err
err2:
set $S0, "val"
err:
ok(0, "pop into sparse tests failed")
print "#nok "
print $S0
print " "
print $I0
print " "
print $I1
print " "
print $I2
print " "
print $I3
print " "
print $I4
print " "
print $I5
.end
.sub clone_empty
.local pmc rba1, rba2
.local int i
rba1 = new ['ResizableBooleanArray']
rba2 = clone rba1
i = elements rba2
is(i, 0, "clone empty passed")
.end
.sub clone_tests
.local pmc rba1, rba2
.local int i, failed
failed = 0
rba1 = new ['ResizableBooleanArray']
rba1[0] = 1
rba1[5000] = 1
rba2 = clone rba1
i = rba1[5000]
if i == 1 goto ok_0
failed = 1
ok_0:
i = pop rba1
if i == 1 goto ok_1
failed = 2
ok_1:
i = rba1
if i == 5000 goto ok_2
failed = 3
ok_2:
i = pop rba2
if i == 1 goto ok_3
failed = 4
ok_3:
i = rba2
if i == 5000 goto ok_4
failed = 5
ok_4:
i = rba2[5000] #should be undefined, i.e. 0
if i == 0 goto ok_5
failed = 6
ok_5:
i = pop rba2 #same as previous
if i == 0 goto ok_6
failed = 7
$S0 = rba2
say $S0
ok_6:
is(failed, 0, "all clone tests passed")
.end
.sub alternate_clone_tests
.local pmc rba1, rba2
.local int i, failed
failed = 0
rba1 = new ['ResizableBooleanArray']
rba1[0] = 1
rba1[4] = 1
rba1[5004] = 1
i = shift rba1
i = shift rba1
i = shift rba1
i = shift rba1
rba2 = clone rba1
i = rba1[5000]
if i == 1 goto ok_0
failed = 1
ok_0:
i = pop rba1
if i == 1 goto ok_1
failed = 2
ok_1:
i = rba1
if i == 5000 goto ok_2
failed = 3
ok_2:
i = pop rba2
if i == 1 goto ok_3
failed = 4
ok_3:
i = rba2
if i == 5000 goto ok_4
failed = 5
ok_4:
i = rba2[5000] #should be undefined, i.e. 0
if i == 0 goto ok_5
failed = 6
ok_5:
i = pop rba2 #same as previous
if i == 0 goto ok_6
failed = 7
ok_6:
is(failed, 0, "all alternate clone tests passed")
.end
.sub get_iter_test
$P0 = new ['ResizableBooleanArray']
$P0 = 3
$P0[0] = 1
$P0[1] = 0
$P0[2] = 1
$P1 = iter $P0
loop:
unless $P1 goto loop_end
$S2 = shift $P1
$S0 = concat $S0, $S2
goto loop
loop_end:
is($S0, "101", "get_iter works")
.end
# Local Variables:
# mode: pir
# fill-column: 100
# End:
# vim: expandtab shiftwidth=4 ft=pir: