/
reduce.t
369 lines (323 loc) · 13.6 KB
/
reduce.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
use v6;
use Test;
=begin pod
=head1 DESCRIPTION
This test tests the C<[...]> reduce metaoperator.
Reference:
L<"http://groups.google.de/group/perl.perl6.language/msg/bd9eb275d5da2eda">
=end pod
# L<S03/"Reduction operators">
# [...] reduce metaoperator
{
my @array = <5 -3 7 0 1 -9>;
my $sum = 5 + -3 + 7 + 0 + 1 + -9; # laziness :)
is(([+] @array), $sum, "[+] works");
is(([*] 1,2,3), (1*2*3), "[*] works");
is(([-] 1,2,3), (1-2-3), "[-] works");
is(([/] 12,4,3), (12/4/3), "[/] works");
is(([div] 12,4,3), (12 div 4 div 3), "[div] works");
is(([**] 2,2,3), (2**2**3), "[**] works");
is(([%] 13,7,4), (13%7%4), "[%] works");
is(([mod] 13,7,4), (13 mod 7 mod 4), "[mod] works");
is((~ [\+] @array), "5 2 9 9 10 1", "[\\+] works");
is((~ [\-] 1, 2, 3), "1 -1 -4", "[\\-] works");
}
{
is ([~] <a b c d>), "abcd", "[~] works";
is (~ [\~] <a b c d>), "a ab abc abcd", "[\\~] works";
}
{
ok ([<] 1, 2, 3, 4), "[<] works (1)";
nok ([<] 1, 3, 2, 4), "[<] works (2)";
ok ([>] 4, 3, 2, 1), "[>] works (1)";
nok ([>] 4, 2, 3, 1), "[>] works (2)";
ok ([==] 4, 4, 4), "[==] works (1)";
nok ([==] 4, 5, 4), "[==] works (2)";
#?niecza 2 skip 'this is parsed as ![=], not good'
ok ([!=] 4, 5, 6), "[!=] works (1)";
nok ([!=] 4, 4, 4), "[!=] works (2)";
}
{
ok (! [eq] <a a b a>), '[eq] basic sanity (positive)';
ok ( [eq] <a a a a>), '[eq] basic sanity (negative)';
ok ( [ne] <a b c a>), '[ne] basic sanity (positive)';
ok (! [ne] <a a b c>), '[ne] basic sanity (negative)';
ok ( [lt] <a b c e>), '[lt] basic sanity (positive)';
ok (! [lt] <a a c e>), '[lt] basic sanity (negative)';
}
#?rakudo skip "=:= NYI"
#?niecza skip "reduce/binding interaction issues"
{
my ($x, $y);
ok ( [=:=] $x, $x, $x), '[=:=] basic sanity 1';
ok (not [=:=] $x, $y, $x), '[=:=] basic sanity 2';
ok ( [!=:=] $x, $y, $x), '[!=:=] basic sanity (positive)';
ok (not [!=:=] $y, $y, $x), '[!=:=] basic sanity (negative)';
$y := $x;
ok ( [=:=] $y, $x, $y), '[=:=] after binding';
}
#?niecza skip "=== on value types NYI"
{
my $a = [1, 2];
my $b = [1, 2];
ok ([===] 1, 1, 1, 1), '[===] with literals';
ok ([===] $a, $a, $a), '[===] with vars (positive)';
nok ([===] $a, $a, [1, 2]), '[===] with vars (negative)';
#?rakudo 2 skip '[!===]'
ok ([!===] $a, $b, $a), '[!===] basic sanity (positive)';
nok ([!===] $a, $b, $b), '[!===] basic sanity (negative)';
}
{
is ~ ([\<] 1, 2, 3, 4).map({+$_}), "1 1 1 1", "[\\<] works (1)";
is ~ ([\<] 1, 3, 2, 4).map({+$_}), "1 1 0 0", "[\\<] works (2)";
is ~ ([\>] 4, 3, 2, 1).map({+$_}), "1 1 1 1", "[\\>] works (1)";
is ~ ([\>] 4, 2, 3, 1).map({+$_}), "1 1 0 0", "[\\>] works (2)";
is ~ ([\==] 4, 4, 4).map({+$_}), "1 1 1", "[\\==] works (1)";
is ~ ([\==] 4, 5, 4).map({+$_}), "1 0 0", "[\\==] works (2)";
#?niecza 2 skip 'this is parsed as ![=], not good'
is ~ ([\!=] 4, 5, 6).map({+$_}), "1 1 1", "[\\!=] works (1)";
is ~ ([\!=] 4, 5, 5).map({+$_}), "1 1 0", "[\\!=] works (2)";
is (~ [\**] 1, 2, 3), "3 8 1", "[\\**] (right assoc) works (1)";
is (~ [\**] 3, 2, 0), "0 1 3", "[\\**] (right assoc) works (2)";
}
# RT #76110
{
is ~([\+] [\+] 1 xx 5), '1 3 6 10 15', 'two nested [\+]';
#?niecza skip 'unary [] does not context yet'
is ([+] [1, 2, 3, 4]), 4, '[+] does not flatten []-arrays';
}
#?niecza skip '[macro]'
{
my @array = (Mu, Mu, 3, Mu, 5);
is ([//] @array), 3, "[//] works";
is ([orelse] @array), 3, "[orelse] works";
}
#?niecza skip '[macro]'
{
my @array = (Mu, Mu, 0, 3, Mu, 5);
is ([||] @array), 3, "[||] works";
is ([or] @array), 3, "[or] works";
# Mu as well as [//] should work too, but testing it like
# this would presumably emit warnings when we have them.
is (~ [\||] 0, 0, 3, 4, 5), "0 0 3 3 3", "[\\||] works";
}
#?niecza skip '[macro]'
{
my @array = (Mu, Mu, 0, 3, Mu, 5);
my @array1 = (2, 3, 4);
nok ([&&] @array), "[&&] works with 1 false";
is ([&&] @array1), 4, "[&&] works";
nok ([and] @array), "[and] works with 1 false";
is ([and] @array1), 4, "[and] works";
}
# not currently legal without an infix subscript operator
# {
# my $hash = {a => {b => {c => {d => 42, e => 23}}}};
# is try { [.{}] $hash, <a b c d> }, 42, '[.{}] works';
# }
#
# {
# my $hash = {a => {b => 42}};
# is ([.{}] $hash, <a b>), 42, '[.{}] works two levels deep';
# }
#
# {
# my $arr = [[[1,2,3],[4,5,6]],[[7,8,9],[10,11,12]]];
# is ([.[]] $arr, 1, 0, 2), 9, '[.[]] works';
# }
{
# 18:45 < autrijus> hm, I found a way to easily do linked list consing in Perl6
# 18:45 < autrijus> [=>] 1..10;
my $list = [=>] 1,2,3;
is $list.key, 1, "[=>] works (1)";
is (try {$list.value.key}), 2, "[=>] works (2)";
is (try {$list.value.value}), 3, "[=>] works (3)";
}
#?niecza skip 'huh?'
{
my @array = <5 -3 7 0 1 -9>;
# according to http://irclog.perlgeek.de/perl6/2008-09-10#i_560910
# [,] returns a scalar (holding an Array)
my $count = 0;
$count++ for [,] @array;
#?rakudo todo 'item context'
is $count, 1, '[,] returns a single Array';
ok ([,] @array) ~~ Positional, '[,] returns something Positional';
}
# Following two tests taken verbatim from former t/operators/reduce.t
#?niecza 2 skip 'These are hyperop tests!'
lives_ok({my @foo = [1..3] >>+<< [1..3] >>+<< [1..3]},'Sanity Check');
#?rakudo todo 'reduced hyper op'
lives_ok({my @foo = [>>+<<] ([1..3],[1..3],[1..3])},'Parse [>>+<<]');
# Check that user defined infix ops work with [...], too.
#?pugs todo 'bug'
{
sub infix:<more_than_plus>($a, $b) { $a + $b + 1 }
is (try { [more_than_plus] 1, 2, 3 }), 8, "[...] reduce metaop works on user defined ops";
}
# {
# my $arr = [ 42, [ 23 ] ];
# $arr[1][1] = $arr;
#
# is try { [.[]] $arr, 1, 1, 1, 1, 1, 0 }, 23, '[.[]] works with infinite data structures';
# }
#
# {
# my $hash = {a => {b => 42}};
# $hash<a><c> = $hash;
#
# is try { [.{}] $hash, <a c a c a b> }, 42, '[.{}] works with infinite data structures';
# }
# L<S03/"Reduction operators"/"Among the builtin operators, [+]() returns 0 and [*]() returns 1">
#?niecza skip '[*] identity'
is( ([*]()), 1, "[*]() returns 1");
is( ([+]()), 0, "[+]() returns 0");
is( ([*] 41), 41, "[*] 41 returns 41");
is( ([*] 42), 42, "[*] 42 returns 42");
is( ~([\*] 42), "42", "[\*] 42 returns (42)");
is( ([~] 'towel'), 'towel', "[~] 'towel' returns 'towel'");
is( ([~] 'washcloth'), 'washcloth', "[~] 'washcloth' returns 'washcloth'");
is( ([\~] 'towel'), 'towel', "[\~] 'towel' returns 'towel'");
#?niecza skip 'Iterable'
ok( ([\~] 'towel') ~~ Iterable, "[\~] 'towel' returns something Iterable");
is( ([<] 42), Bool::True, "[<] 42 returns true");
is( ~([\<] 42), ~True, "[\<] 42 returns '1'");
#?niecza skip 'Iterable'
ok( ([\<] 42) ~~ Iterable, "[\<] 42 returns something Iterable");
is( ([\*] 1..*).[^10].join(', '), '1, 2, 6, 24, 120, 720, 5040, 40320, 362880, 3628800',
'triangle reduce is lazy');
#?niecza skip 'Str cmp Inf'
is( ([\R~] 'a'..*).[^8].join(', '), 'a, ba, cba, dcba, edcba, fedcba, gfedcba, hgfedcba',
'triangle reduce is lazy');
# RT #65164 implement [^^]
#?niecza skip '^^'
#?rakudo skip '[^^]'
{
is ([^^] 0, 42), 42, '[^^] works (one of two true)';
is ([^^] 42, 0), 42, '[^^] works (one of two true)';
ok ! ([^^] 1, 42), '[^^] works (two true)';
ok ! ([^^] 0, 0), '[^^] works (two false)';
ok ! ([^^] 0, 0, 0), '[^^] works (three false)';
#?rakudo 2 todo '[^^]'
ok ! ([^^] 5, 9, 17), '[^^] works (three true)';
is ([^^] 5, 9, 0), (5 ^^ 9 ^^ 0), '[^^] mix 1';
is ([^^] 5, 0, 17), (5 ^^ 0 ^^ 17), '[^^] mix 2';
is ([^^] 0, 9, 17), (0 ^^ 9 ^^ 17), '[^^] mix 3';
is ([^^] 5, 0, 0), (5 ^^ 0 ^^ 0), '[^^] mix 4';
is ([^^] 0, 9, 0), (0 ^^ 9 ^^ 0), '[^^] mix 5';
is ([^^] 0, 0, 17), (0 ^^ 0 ^^ 17), '[^^] mix 6';
nok ([^^] ()), 'reduce empty list ok';
# test False / undefined things
my $msg1 = 'reduce [^^] false variable test';
my $msg2 = 'infix ^^ false variable test';
for (0, '0', '', Bool::False, Any, Mu, Nil) -> $undef {
ok ( [^^] $undef, $undef, $undef, 5 ), "|{$undef.perl}| $msg1 \#1";
nok ( [^^] 1, 2, $undef, 3, $undef ), "|{$undef.perl}| $msg1 \#2";
nok ( [^^] $undef, $undef, 1, 5 ), "|{$undef.perl}| $msg1 \#3";
nok ( [^^] 1, $undef, $undef, 5 ), "|{$undef.perl}| $msg1 \#4";
ok ( [^^] $undef, $undef, 2, $undef ), "|{$undef.perl}| $msg1 \#5";
nok ( [^^] $undef, $undef, $undef ), "|{$undef.perl}| $msg1 \#6";
nok ( [^^] $undef, $undef ), "|{$undef.perl}| $msg1 \#7";
ok ( [^^] $undef, 1 ), "|{$undef.perl}| $msg1 \#8";
ok ( [^^] 1, $undef ), "|{$undef.perl}| $msg1 \#9";
nok ( [^^] $undef ), "|{$undef.perl}| $msg1 \#10";
ok ( $undef ^^ $undef ^^ $undef ^^ 5 ), "|{$undef.perl}| $msg2 \#1";
nok ( 1 ^^ 2 ^^ $undef ^^ 3 ^^ $undef ), "|{$undef.perl}| $msg2 \#2";
nok ( $undef ^^ $undef ^^ 1 ^^ 5 ), "|{$undef.perl}| $msg2 \#3";
nok ( 1 ^^ $undef ^^ $undef ^^ 5 ), "|{$undef.perl}| $msg2 \#4";
ok ( $undef ^^ $undef ^^ 2 ^^ $undef ), "|{$undef.perl}| $msg2 \#5";
nok ( $undef ^^ $undef ^^ $undef ), "|{$undef.perl}| $msg2 \#6";
nok ( $undef ^^ $undef ), "|{$undef.perl}| $msg2 \#7";
ok ( $undef ^^ 1 ), "|{$undef.perl}| $msg2 \#8";
ok ( 1 ^^ $undef ), "|{$undef.perl}| $msg2 \#9";
}
# test numericy true things
$msg1 = 'reduce [^^] true numbery variable test';
$msg2 = 'infix ^^ true numbery variable test';
for (1, -147, pi, Bool::True) -> $def {
nok ( [^^] 0, 0, $def, 3, $def ), "|{$def.perl}| $msg1 \#1";
nok ( [^^] $def, $def, 0 ), "|{$def.perl}| $msg1 \#2";
nok ( [^^] 1, $def, Any, 5 ), "|{$def.perl}| $msg1 \#3";
ok ( [^^] $def, 0, 0, 0 ) == $def, "|{$def.perl}| $msg1 \#4";
ok ( [^^] Any, Any, Any, $def ) == $def, "|{$def.perl}| $msg1 \#5";
nok ( [^^] $def, $def ), "|{$def.perl}| $msg1 \#6";
ok ( [^^] $def, 0 ) == $def, "|{$def.perl}| $msg1 \#7";
ok ( [^^] 0, $def ) == $def, "|{$def.perl}| $msg1 \#8";
ok ( [^^] $def ), "|{$def.perl}| $msg1 \#9";
nok ( 0 ^^ 0 ^^ $def ^^ 3 ^^ $def ), "|{$def.perl}| $msg2 \#1";
nok ( $def ^^ $def ^^ 0 ), "|{$def.perl}| $msg2 \#2";
nok ( 1 ^^ $def ^^ Any ^^ 5 ), "|{$def.perl}| $msg2 \#3";
ok ( $def ^^ 0 ^^ 0 ^^ 0 ) == $def, "|{$def.perl}| $msg2 \#4";
ok ( Any ^^ Any ^^ Any ^^ $def ) == $def,"|{$def.perl}| $msg2 \#5";
nok ( $def ^^ $def ), "|{$def.perl}| $msg2 \#6";
ok ( $def ^^ 0 ) == $def, "|{$def.perl}| $msg2 \#7";
ok ( 0 ^^ $def ) == $def, "|{$def.perl}| $msg2 \#8";
}
# test stringy true things
$msg1 = 'reduce [^^] true string variable test';
$msg2 = 'infix ^^ true string variable test';
for ('no', 'Bob', '10', 'False') -> $def {
nok ( [^^] $def, $def, $def, 'string' ), "|{$def.perl}| $msg1 \#1";
nok ( [^^] '', '', $def, 'str', $def ), "|{$def.perl}| $msg1 \#2";
nok ( [^^] $def, $def,'' ), "|{$def.perl}| $msg1 \#3";
nok ( [^^] 1, $def, Any, 5 ), "|{$def.perl}| $msg1 \#4";
ok ( [^^] $def, '', '', '' ) eq $def, "|{$def.perl}| $msg1 \#5";
ok ( [^^] Any, Any, Any, $def ) eq $def, "|{$def.perl}| $msg1 \#6";
nok ( [^^] $def, $def ), "|{$def.perl}| $msg1 \#7";
ok ( [^^] $def, '' ) eq $def, "|{$def.perl}| $msg1 \#8";
ok ( [^^] '', $def ) eq $def, "|{$def.perl}| $msg1 \#9";
ok ( [^^] $def ) eq $def, "|{$def.perl}| $msg1 \#10";
nok ( $def ^^ $def ^^ $def ^^ 'string' ), "|{$def.perl}| $msg2 \#1";
nok ( '' ^^ '' ^^ $def ^^ 'str' ^^ $def ),"|{$def.perl}| $msg2 \#2";
nok ( $def ^^ $def ^^'' ), "|{$def.perl}| $msg2 \#3";
nok ( 1 ^^ $def ^^ Any ^^ 5 ), "|{$def.perl}| $msg2 \#4";
ok ( $def ^^ '' ^^ '' ^^ '' ) eq $def, "|{$def.perl}| $msg2 \#5";
ok ( Any ^^ Any ^^ Any ^^ $def ) eq $def,"|{$def.perl}| $msg2 \#6";
nok ( $def ^^ $def ), "|{$def.perl}| $msg2 \#7";
ok ( $def ^^ '' ) eq $def, "|{$def.perl}| $msg2 \#8";
ok ( '' ^^ $def ) eq $def, "|{$def.perl}| $msg2 \#9";
}
is (join ', ', [\^^] False, 0, 5, '', False, 16, 0, Any, "hello", False),
(join ', ', False, 0, 5, 5, 5, False, False, False, False, False),
'[\^^]';
is (join ', ', [\xor] 'xyzzy', Int, 0.0, '', False, 'plugh', 4, 2, 'xyzzy'),
(join ', ', 'xyzzy', 'xyzzy', 'xyzzy', 'xyzzy', 'xyzzy', False, False, False, False),
'[\xor]';
}
# RT 57976 implement orelse
#?niecza skip 'huh? these are macros'
#?rakudo skip 'orelse'
{
is (join ', ', [\//] Any, 0, 1),
(join ', ', 'Any()', 0, 0),
'[\orelse]';
is (join ', ', [\orelse] Any, 0, 1),
(join ', ', 'Any()', 0, 0),
'[\orelse]';
}
# RT #75234
# rakudo had a problem where once-used meta operators weren't installed
# in a sufficiently global location, so using a meta operator in class once
# makes it unusable further on
#?niecza skip 'gather for'
{
class A {
method m { return [~] gather for ^3 {take 'a'} }
}
class B {
method n { return [~] gather for ^4 {take 'b'}}
}
is A.new.m, 'aaa', '[~] works in first class';
is B.new.n, 'bbbb', '[~] works in second class';
is ([~] 1, 2, 5), '125', '[~] works outside class';
}
#?rakudo todo 'RT 82210'
ok [+](1..10) + 0 == ([+] 1..10) + 0,
'a listop with immediate () is a function call (RT 82210)';
# RT #99942
{
sub rt99942 { [+] @_ };
is rt99942(1, 42), 43, 'RT #99942'
}
done;
# vim: ft=perl6