-
Notifications
You must be signed in to change notification settings - Fork 138
/
array.t
464 lines (401 loc) · 6.36 KB
/
array.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
#! perl -w
# Copyright: 2001-2004 The Perl Foundation. All Rights Reserved.
# $Id$
=head1 NAME
t/pmc/array.t - Array PMC
=head1 SYNOPSIS
% perl -Ilib t/pmc/array.t
=head1 DESCRIPTION
Tests C<Array> PMC. Checks size, sets various elements, including
out-of-bounds test. Checks INT and PMC keys.
=cut
use Parrot::Test tests => 13;
use Test::More;
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
output_is(<<'CODE', <<'OUTPUT', "Setting array size");
new P0,.Array
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,2
set I0,P0
eq I0,2,OK_3
print "not "
OK_3: print "ok 3\n"
new P1, .Integer
set P1, 3
set P0,P1
set I0,P0
eq I0,3,OK_4
print "not "
OK_4: print "ok 4\n"
end
CODE
ok 1
ok 2
ok 3
ok 4
OUTPUT
output_is(<<'CODE', <<'OUTPUT', "Setting first element");
new P0, .Array
set P0, 1
set P0[0],-7
set I0,P0[0]
eq I0,-7,OK_1
print "not "
OK_1: print "ok 1\n"
set P0[0],3.7
set N0,P0[0]
eq N0,3.7,OK_2
print "not "
OK_2: print "ok 2\n"
set P0[0],"Buckaroo"
set S0,P0[0]
eq S0,"Buckaroo",OK_3
print "not "
OK_3: print "ok 3\n"
end
CODE
ok 1
ok 2
ok 3
OUTPUT
output_is(<<'CODE', <<'OUTPUT', "Setting second element");
new P0, .Array
set P0, 2
set P0[1], -7
set I0, P0[1]
eq I0,-7,OK_1
print "not "
OK_1: print "ok 1\n"
set P0[1], 3.7
set N0, P0[1]
eq N0,3.7,OK_2
print "not "
OK_2: print "ok 2\n"
set P0[1],"Buckaroo"
set S0, P0[1]
eq S0,"Buckaroo",OK_3
print "not "
OK_3: print "ok 3\n"
end
CODE
ok 1
ok 2
ok 3
OUTPUT
output_like(<<'CODE', <<'OUTPUT', "Setting out-of-bounds elements");
new P0, .Array
set P0, 1
set P0[1], -7
end
CODE
/^Array index out of bounds!
current instr/
OUTPUT
output_like(<<'CODE', <<'OUTPUT', "Getting out-of-bounds elements");
new P0, .Array
set P0, 1
set I0, P0[1]
end
CODE
/^Array index out of bounds!
current instr/
OUTPUT
output_is(<<'CODE', <<OUTPUT, "defined");
new P0, .Array
defined I0, P0
print I0
print "\n"
defined I0, P1
print I0
print "\n"
set P0, 5
set P0[0], 1
defined I0, P0[0]
print I0
print "\n"
defined I0, P0[1]
print I0
print "\n"
defined I0, P0[100]
print I0
print "\n"
new P1, .Undef
set P0[2], P1
defined I0, P0[2]
print I0
print "\n"
new P2, .Key
set P2, 3
set P0[3], 4
defined I0, P0[P2]
print I0
print "\n"
set P2, 4
defined I0, P0[P2]
print I0
print "\n"
end
CODE
1
0
1
0
0
0
1
0
OUTPUT
output_is(<<'CODE', <<OUTPUT, "exists");
new P0, .Array
set P0, 5
set P0[0], 1
exists I0, P0[0]
print I0
print "\n"
exists I0, P0[1]
print I0
print "\n"
exists I0, P0[100]
print I0
print "\n"
new P1, .Undef
set P0[2], P1
exists I0, P0[2]
print I0
print "\n"
new P2, .Key
set P2, 3
set P0[3], 4
exists I0, P0[P2]
print I0
print "\n"
set P2, 4
exists I0, P0[P2]
print I0
print "\n"
end
CODE
1
0
0
1
1
0
OUTPUT
output_is(<<"CODE", <<'OUTPUT', "Set via PMC keys, access via INTs");
@{[ $fp_equality_macro ]}
new P0, .Array
set P0, 4
new P1, .Key
set P1, 0
set P0[P1], 25
set P1, 1
set P0[P1], 2.5
set P1, 2
set P0[P1], "Squeek"
set P1, 3
new P2, .Hash
set P2["a"], "apple"
set P0[P1], P2
set I0, P0[0]
eq I0, 25, OK1
print "not "
OK1: print "ok 1\\n"
set N0, P0[1]
.fp_eq(N0, 2.5, OK2)
print "not "
OK2: print "ok 2\\n"
set S0, P0[2]
eq S0, "Squeek", OK3
print "not "
OK3: print "ok 3\\n"
set P3, P0[3]
set S1, P3["a"]
eq S1, "apple", OK4
print "not "
OK4: print "ok 4\\n"
end
CODE
ok 1
ok 2
ok 3
ok 4
OUTPUT
output_is(<<"CODE", <<'OUTPUT', "Set via INTs, access via PMC Keys");
@{[ $fp_equality_macro ]}
new P0, .Array
set P0, 1024
set P0[25], 125
set P0[128], -9.9
set P0[513], "qwertyuiopasdfghjklzxcvbnm"
new P1, .Integer
set P1, 123456
set P0[1023], P1
new P2, .Key
set P2, 25
set I0, P0[P2]
eq I0, 125, OK1
print "not "
OK1: print "ok 1\\n"
set P2, 128
set N0, P0[P2]
.fp_eq(N0, -9.9, OK2)
print "not "
OK2: print "ok 2\\n"
set P2, 513
set S0, P0[P2]
eq S0, "qwertyuiopasdfghjklzxcvbnm", OK3
print "not "
OK3: print "ok 3\\n"
set P2, 1023
set P3, P0[P2]
set I1, P3
eq I1, 123456, OK4
print "not "
OK4: print "ok 4\\n"
end
CODE
ok 1
ok 2
ok 3
ok 4
OUTPUT
output_is(<<'CODE', <<OUT, "multikeyed access I arg");
new P0, .Array
set P0, 1
new P1, .Array
set P1, 1
set P0[0], P1
set P0[0;0], 20
set P2, P0[0]
typeof S0, P2
print S0
print "\n"
set I2, P0[0;0]
print I2
set I3, 0
set I2, P0[I3;0]
print I2
set I2, P0[0;I3]
print I2
set I2, P0[I3;I3]
print I2
print "\n"
end
CODE
Array
20202020
OUT
output_is(<<'CODE', <<OUT, "multikeyed access P arg");
new P0, .Array
set P0, 1
new P1, .Array
set P1, 1
new P3, .Integer
set P3, 20
set P0[0], P1
set P0[0;0], P3
set P2, P0[0]
typeof S0, P2
print S0
print "\n"
set I2, P0[0;0]
print I2
set I3, 0
set I2, P0[I3;0]
print I2
set I2, P0[0;I3]
print I2
set I2, P0[I3;I3]
print I2
print "\n"
end
CODE
Array
20202020
OUT
output_is(<<'CODE', <<OUT, "delete");
new P0, .Array
set P0, 3
set P0[0], 10
set P0[1], 20
set P0[2], 30
delete P0[1]
set I0, P0
print I0
set I0, P0[0]
print I0
set I0, P0[1]
print I0
print "\n"
end
CODE
21030
OUT
pir_output_is(<< 'CODE', << 'OUTPUT', "check whether interface is done");
.sub _main
.local pmc pmc1
pmc1 = new Array
.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
1;