-
Notifications
You must be signed in to change notification settings - Fork 138
/
resizablebooleanarray.t
942 lines (818 loc) · 15.6 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
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
#! perl
# Copyright (C) 2001-2005, The Perl Foundation.
# $Id$
use strict;
use warnings;
use lib qw( . lib ../lib ../../lib );
use Test::More;
use Parrot::Test tests => 20;
=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
my $fp_equality_macro = <<'ENDOFMACRO';
.macro fp_eq ( J, K, L )
save N0
save N1
save N2
set N0, .J
set N1, .K
sub N2, N1,N0
abs N2, N2
gt N2, 0.000001, .$FPEQNOK
restore N2
restore N1
restore N0
branch .L
.local $FPEQNOK:
restore N2
restore N1
restore N0
.endm
.macro fp_ne( J,K,L)
save N0
save N1
save N2
set N0, .J
set N1, .K
sub N2, N1,N0
abs N2, N2
lt N2, 0.000001, .$FPNENOK
restore N2
restore N1
restore N0
branch .L
.local $FPNENOK:
restore N2
restore N1
restore N0
.endm
ENDOFMACRO
pasm_output_is( <<'CODE', <<'OUTPUT', "Setting array size" );
new P0, .ResizableBooleanArray
set I0,P0
eq I0,0,OK_1
print "not "
OK_1: print "ok 1\n"
set P0,1
set I0,P0
eq I0,1,OK_2
print "not "
OK_2: print "ok 2\n"
set P0,5
set I0,P0
eq I0,5,OK_3
print "not "
OK_3: print "ok 3\n"
set P0,50
set I0,P0
eq I0,50,OK_4
print "not "
OK_4: print "ok 4\n"
set P0,7
set I0,P0
eq I0,7,OK_5
print "not "
OK_5: print "ok 5\n"
end
CODE
ok 1
ok 2
ok 3
ok 4
ok 5
OUTPUT
pasm_output_is( <<'CODE', <<'OUTPUT', "Setting first element" );
new P0, .ResizableBooleanArray
set P0, 1
set P0[0],-7
set I0,P0[0]
eq I0,1,OK_1
print "not "
OK_1: print "ok 1\n"
set P0[0],3.7
set N0,P0[0]
eq N0,1.0,OK_2
print "not "
OK_2: print "ok 2\n"
set P0[0],"17"
set S0,P0[0]
eq S0,"1",OK_3
print "not "
OK_3: print "ok 3\n"
end
CODE
ok 1
ok 2
ok 3
OUTPUT
pasm_output_is( <<'CODE', <<'OUTPUT', "Setting second element" );
new P0, .ResizableBooleanArray
set P0, 2
set P0[1], -7
set I0, P0[1]
eq I0,1,OK_1
print "not "
OK_1: print "ok 1\n"
set P0[1], 3.7
set N0, P0[1]
eq N0,1.0,OK_2
print "not "
OK_2: print "ok 2\n"
set P0[1],"17"
set S0, P0[1]
eq S0,"1",OK_3
print "not "
OK_3: print "ok 3\n"
end
CODE
ok 1
ok 2
ok 3
OUTPUT
# TODO: Rewrite these properly when we have exceptions
pasm_output_is( <<'CODE', <<'OUTPUT', "Setting out-of-bounds elements" );
new P0, .ResizableBooleanArray
set P0[1], -7
set I0, P0[1]
eq I0,1,OK_1
print "not "
OK_1: print "ok 1\n"
set P0[0], 3.7
set N0, P0[0]
eq N0,1.0,OK_2
print "not "
OK_2: print "ok 2\n"
set P0[5],"17"
set S0, P0[5]
eq S0,"1",OK_3
print "not "
OK_3: print "ok 3\n"
end
CODE
ok 1
ok 2
ok 3
OUTPUT
pasm_output_is( <<'CODE', <<'OUTPUT', "Getting out-of-bounds elements" );
new P0, .ResizableBooleanArray
set P0, 1
set I0, P0[1]
print "ok 1\n"
end
CODE
ok 1
OUTPUT
pasm_output_is( <<"CODE", <<'OUTPUT', "Set via PMC keys, access via INTs" );
@{[ $fp_equality_macro ]}
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]
eq I0, 1, OK1
print "not "
OK1: print "ok 1\\n"
set N0, P0[1]
.fp_eq(N0, 1.0, OK2)
print "not "
OK2: print "ok 2\\n"
set S0, P0[2]
eq S0, "1", OK3
print "not "
OK3: print "ok 3\\n"
end
CODE
ok 1
ok 2
ok 3
OUTPUT
pasm_output_is( <<"CODE", <<'OUTPUT', "Set via INTs, access via PMC Keys" );
@{[ $fp_equality_macro ]}
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]
eq I0, 1, OK1
print "not "
OK1: print "ok 1\\n"
set P2, 128
set N0, P0[P2]
.fp_eq(N0, 1.0, OK2)
print "not "
OK2: print "ok 2\\n"
set P2, 513
set S0, P0[P2]
eq S0, "1", OK3
print "not "
OK3: print "ok 3\\n"
set P2, 1023
set P3, P0[P2]
set I1, P3
eq I1, 1, OK4
print "not "
OK4: print "ok 4\\n"
end
CODE
ok 1
ok 2
ok 3
ok 4
OUTPUT
pir_output_is( << 'CODE', << 'OUTPUT', "check whether interface is done" );
.sub _main
.local pmc pmc1
pmc1 = new ResizableBooleanArray
.local int bool1
does bool1, pmc1, "scalar"
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
0
OUTPUT
pir_output_is( << 'CODE', << 'OUTPUT', "push integer" );
.sub _main
.local pmc pmc1
pmc1 = new ResizableBooleanArray
pmc1[9999] = 0
push pmc1, 10001
.local int elements
elements = pmc1
print elements
print "\n"
.local string last
last = pmc1[10000]
print last
print "\n"
end
.end
CODE
10001
1
OUTPUT
pasm_output_is( <<'CODE', <<'OUTPUT', "creation" );
new P0, .ResizableBooleanArray
set I0, P0
print "Created ResizableBooleanArray with "
print I0
print " elements to start with.\n"
end
CODE
Created ResizableBooleanArray with 0 elements to start with.
OUTPUT
pir_output_is( << 'CODE', << 'OUTPUT', "push and pop" );
.sub test :main
.local int i, i_elem
.local pmc pmc_arr
.local int elements
i = 1
pmc_arr = new ResizableBooleanArray
print_num_elements( pmc_arr )
push pmc_arr, i
print i
print_num_elements( pmc_arr )
push pmc_arr, 0
print 0
print_num_elements( pmc_arr )
print_num_elements( pmc_arr )
i_elem= pop pmc_arr
print i_elem
print_num_elements( pmc_arr )
i_elem= pop pmc_arr
print i_elem
print_num_elements( pmc_arr )
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
print i_elem
print_num_elements(pmc_arr)
.end
.sub print_num_elements
.param pmc pmc_arr
.local int elements
elements= pmc_arr
print '['
print elements
print "]\n"
.return()
.end
CODE
[0]
1[1]
0[2]
[2]
0[1]
1[0]
1[63]
OUTPUT
pir_output_like( << 'CODE', << 'OUTPUT', "pop bounds checking" );
.sub 'test' :main
P0 = new .ResizableBooleanArray
pop I0, P0
.end
CODE
/ResizableBooleanArray: Can't pop from an empty array!.*/
OUTPUT
#'
pir_output_is( << 'CODE', << 'OUTPUT', "unshift and shift" );
.sub test :main
.local int i, i_elem
.local pmc pmc_arr
.local int elements
i= 1
pmc_arr = new ResizableBooleanArray
# No elements are set
print_num_elements( pmc_arr )
# Set two of the first three elements
pmc_arr[0] = 1
pmc_arr[2] = 1
print_num_elements( pmc_arr )
# Unshift a "1" element on
unshift pmc_arr, i
print i
print_num_elements( pmc_arr )
# Unshift a "0" element on
unshift pmc_arr, 0
print 0
print_num_elements( pmc_arr )
# Shift an element off
i_elem= shift pmc_arr
print i_elem
print_num_elements( pmc_arr )
# Shift an element off
i_elem= shift pmc_arr
print i_elem
print_num_elements( pmc_arr )
# Resize the array
pmc_arr = 62
print_num_elements(pmc_arr)
# Unshift 4 elements on
unshift pmc_arr, 1
unshift pmc_arr, 1
unshift pmc_arr, 0
unshift pmc_arr, 1
print_num_elements(pmc_arr)
# Shift 3 elements off
i_elem = shift pmc_arr
i_elem = shift pmc_arr
i_elem = shift pmc_arr
print i_elem
print_num_elements(pmc_arr)
# Set same size array is currently
pmc_arr = 63
print_num_elements(pmc_arr)
# Set 101th element
pmc_arr[100] = 1
print_num_elements(pmc_arr)
# Shift off 99 elements
.local int counter
counter = 98
shift_loop:
i_elem = shift pmc_arr
dec counter
if counter > 0 goto shift_loop
print i_elem
print_num_elements(pmc_arr)
.end
.sub print_num_elements
.param pmc pmc_arr
.local int elements
elements= pmc_arr
print '['
print elements
print "]\n"
$I0 = pmc_arr[0]
print $I0
print ', '
$I0 = pmc_arr[1]
print $I0
print ', '
$I0 = pmc_arr[2]
print $I0
print "\n"
.return()
.end
CODE
[0]
0, 0, 0
[3]
1, 0, 1
1[4]
1, 1, 0
0[5]
0, 1, 1
0[4]
1, 1, 0
1[3]
1, 0, 1
[62]
1, 0, 1
[66]
1, 0, 1
1[63]
1, 1, 0
[63]
1, 1, 0
[101]
1, 1, 0
0[3]
0, 0, 1
OUTPUT
pir_output_like( << 'CODE', << 'OUTPUT', "shift bounds checking" );
.sub 'test' :main
P0 = new .ResizableBooleanArray
shift I0, P0
.end
CODE
/ResizableBooleanArray: Can't shift from an empty array!.*/
OUTPUT
#'
pasm_output_is( <<'CODE', <<'OUTPUT', "aerobics" );
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:
print "I need a shower.\n"
end
errFirstPop:
print "FAILED: first pop\n"
bsr info
end
errSecondPop:
print "FAILED: second pop\n"
bsr info
end
errBuildLen:
print "FAILED: buildup length\n"
bsr info
end
errLeftGet:
print "FAILED: left get\n"
bsr info
end
errRightGet:
print "FAILED: right get\n"
bsr info
end
errTearDown:
print "FAILED: tear down cap\n"
bsr info
end
info:
print "Found: "
print I2
print "\nWanted: "
print I3
print "\n"
ret
CODE
I need a shower.
OUTPUT
pasm_output_is( <<'CODE', <<'OUTPUT', "direct access 2" );
#new P0, .IntList
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
print "ok\n"
end
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
CODE
ok
OUTPUT
pasm_output_is( <<'CODE', <<'OUTPUT', "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
print "ok 1\n"
# 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
print "ok 2\n"
end
err:
print "not ok "
print I0
print " "
print I1
print " "
print I2
print " "
print I3
print " "
print I4
print "\n"
end
CODE
ok 1
ok 2
OUTPUT
pasm_output_is( <<'CODE', <<'OUTPUT', "check for zeroedness" );
new P0, .ResizableBooleanArray
set I0, 0
lp1:
push P0, 0
inc I0
lt I0, 100, lp1
set I2, 10000
#set I0, 100
set P0, I2
lp2:
set I1, P0[I0]
ne I1, 0, err
inc I0
lt I0, I2, lp2
print "ok\n"
end
err:
print "Found non-zero value "
print I1
print " at "
print I0
print "\n"
end
CODE
ok
OUTPUT
pasm_output_is( <<'CODE', <<'OUTPUT', "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:
print "ok\n"
end
err1: set S0, "len"
branch err
err2:
set S0, "val"
err:
print "nok "
print S0
print " "
print I0
print " "
print I1
print " "
print I2
print " "
print I3
print " "
print I4
print " "
print I5
end
CODE
ok
OUTPUT
TODO: {
local $TODO = "this is broken";
pasm_output_is( <<'CODE', <<'OUTPUT', "clone" );
new P0, .ResizableBooleanArray
set P0[0], 1
set P0[5000], 1
clone P1, P0
set I0, P0[5000]
eq I0, 1, ok_1
print "nok 1 "
ok_1:
pop I0, P0
eq I0, 1, ok_2
print "nok 2 "
ok_2:
set I0, P0
eq I0, 5000, ok_3
print "nok 3 "
ok_3:
set I0, P1
eq I0, 5000, ok_4
print "nok 4 "
ok_4:
set I0, P1[5000]
eq I0, 1, ok_5
print "nok 5 "
ok_5:
pop I0, P1
eq I0, 1, ok_6
print "nok 6 "
end
ok_6:
print "ok\n"
end
CODE
ok
OUTPUT
} # TODO
# Local Variables:
# mode: cperl
# cperl-indent-level: 4
# fill-column: 100
# End:
# vim: expandtab shiftwidth=4: