-
Notifications
You must be signed in to change notification settings - Fork 135
/
misc.t
499 lines (384 loc) · 15.2 KB
/
misc.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
use v6;
use Test;
plan 142;
=begin pod
Misc. Junction tests
=end pod
# RT #64184
{
isa-ok any(6,7), Junction;
is any(6,7).WHAT.gist, Junction.gist, 'junction.WHAT works';
}
# avoid auto-threading on ok()
#?DOES 1
sub jok(Mu $condition, $msg?) { ok ?($condition), $msg };
# L<S03/Junctive operators>
# L<S09/Junctions>
{
# initialize them all to empty strings
my $a = '';
my $b = '';
my $c = '';
# make sure they all match to an empty string
jok('' eq ($a & $b & $c), 'junction of ($a & $b & $c) matches an empty string');
jok('' eq all($a, $b, $c), 'junction of all($a, $b, $c) matches an empty string');
# give $a a value
$a = 'a';
# make sure that at least one of them matches 'a'
jok('a' eq ($b | $c | $a), 'junction of ($b | $c | $a) matches at least one "a"');
jok('a' eq any($b, $c, $a), 'junction of any($b, $c, $a) matches at least one "a"');
jok('' eq ($b | $c | $a), 'junction of ($b | $c | $a) matches at least one empty string');
jok('' eq any($b, $c, $a), 'junction of any($b, $c, $a) matches at least one empty string');
# make sure that ~only~ one of them matches 'a'
jok('a' eq ($b ^ $c ^ $a), 'junction of ($b ^ $c ^ $a) matches at ~only~ one "a"');
jok('a' eq one($b, $c, $a), 'junction of one($b, $c, $a) matches at ~only~ one "a"');
# give $b a value
$b = 'a';
# now this will fail
jok('a' ne ($b ^ $c ^ $a), 'junction of ($b ^ $c ^ $a) matches at more than one "a"');
# change $b and give $c a value
$b = 'b';
$c = 'c';
jok('a' eq ($b ^ $c ^ $a), 'junction of ($b ^ $c ^ $a) matches at ~only~ one "a"');
jok('b' eq ($a ^ $b ^ $c), 'junction of ($a ^ $b ^ $c) matches at ~only~ one "b"');
jok('c' eq ($c ^ $a ^ $b), 'junction of ($c ^ $a ^ $b) matches at ~only~ one "c"');
jok('a' eq ($b | $c | $a), 'junction of ($b | $c | $a) matches at least one "a"');
jok('b' eq ($a | $b | $c), 'junction of ($a | $b | $c) matches at least one "b"');
jok('c' eq ($c | $a | $b), 'junction of ($c | $a | $b) matches at least one "c"');
# test junction to junction
jok(('a' | 'b' | 'c') eq ($a & $b & $c), 'junction ("a" | "b" | "c") matches junction ($a & $b & $c)');
jok(('a' & 'b' & 'c') eq ($a | $b | $c), 'junction ("a" & "b" & "c") matches junction ($a | $b | $c)');
# mix around variables and literals
jok(($a & 'b' & 'c') eq ('a' | $b | $c), 'junction ($a & "b" & "c") matches junction ("a" | $b | $c)');
jok(($a & 'b' & $c) eq ('a' | $b | 'c'), 'junction ($a & "b" & $c) matches junction ("a" | $b | "c")');
}
# same tests, but with junctions as variables
{
# initialize them all to empty strings
my $a = '';
my $b = '';
my $c = '';
my Mu $all_of_them = $a & $b & $c;
jok('' eq $all_of_them, 'junction variable of ($a & $b & $c) matches and empty string');
$a = 'a';
my Mu $any_of_them = $b | $c | $a;
jok('a' eq $any_of_them, 'junction variable of ($b | $c | $a) matches at least one "a"');
jok('' eq $any_of_them, 'junction variable of ($b | $c | $a) matches at least one empty string');
my Mu $one_of_them = $b ^ $c ^ $a;
jok('a' eq $one_of_them, 'junction variable of ($b ^ $c ^ $a) matches at ~only~ one "a"');
$b = 'a';
{
my Mu $one_of_them = $b ^ $c ^ $a;
jok('a' ne $one_of_them, 'junction variable of ($b ^ $c ^ $a) matches at more than one "a"');
}
$b = 'b';
$c = 'c';
{
my Mu $one_of_them = $b ^ $c ^ $a;
jok('a' eq $one_of_them, 'junction of ($b ^ $c ^ $a) matches at ~only~ one "a"');
jok('b' eq $one_of_them, 'junction of ($a ^ $b ^ $c) matches at ~only~ one "b"');
jok('c' eq $one_of_them, 'junction of ($c ^ $a ^ $b) matches at ~only~ one "c"');
}
{
my Mu $any_of_them = $b | $c | $a;
jok('a' eq $any_of_them, 'junction of ($b | $c | $a) matches at least one "a"');
jok('b' eq $any_of_them, 'junction of ($a | $b | $c) matches at least one "b"');
jok('c' eq $any_of_them, 'junction of ($c | $a | $b) matches at least one "c"');
}
}
{
my Mu $j = 1 | 2;
$j = 5;
is($j, 5, 'reassignment of junction variable');
}
{
my Mu $j;
my Mu $k;
$j = 1|2;
is(WHAT($j).gist, '(Junction)', 'basic junction type reference test');
$k=$j;
is(WHAT($k).gist, '(Junction)', 'assignment preserves reference');
}
=begin description
Tests junction examples from Synopsis 03
j() is used to convert a junction to canonical string form, currently
just using .perl until a better approach presents itself.
=end description
# L<S03/Junctive operators>
# Canonical stringification of a junction
sub j (Mu $j) { return $j.perl }
{
# L<S03/Junctive operators/They thread through operations>
my Mu $got;
my Mu $want;
$got = ((1|2|3)+4);
$want = (5|6|7);
is( j($got), j($want), 'thread + returning junctive result');
$got = ((1|2) + (3&4));
$want = ((4|5) & (5|6));
is( j($got), j($want), 'thread + returning junctive combination of results');
# L<S03/Junctive operators/This opens doors for constructions like>
# unless $roll == any(1..6) { print "Invalid roll" }
my $roll;
my $note;
$roll = 3; $note = '';
unless $roll == any(1..6) { $note = "Invalid roll"; };
is($note, "", 'any() junction threading ==');
$roll = 7; $note = '';
unless $roll == any(1..6) { $note = "Invalid roll"; };
is($note, "Invalid roll", 'any() junction threading ==');
# if $roll == 1|2|3 { print "Low roll" }
$roll = 4; $note = '';
if $roll == 1|2|3 { $note = "Low roll" }
is($note, "", '| junction threading ==');
$roll = 2; $note = '';
if $roll == 1|2|3 { $note = "Low roll" }
is($note, "Low roll", '| junction threading ==');
}
{
# L<S03/Junctive operators/Junctions work through subscripting>
my $got;
my @foo;
$got = ''; @foo = ();
$got ~= 'y' if try { @foo[any(1,2,3)] };
is($got, '', "junctions work through subscripting, 0 matches");
$got = ''; @foo = (0,1);
$got ~= 'y' if try { @foo[any(1,2,3)] };
is($got, 'y', "junctions work through subscripting, 1 match");
$got = ''; @foo = (1,1,1);
$got ~= 'y' if try { @foo[any(1,2,3)] };
is($got, 'y', "junctions work through subscripting, 3 matches");
# L<S03/Junctive operators/Junctions are specifically unordered>
# Compiler *can* reorder and parallelize but *may not* so don't test
# for all(@foo) {...};
# Not sure what is expected
#my %got = ('1' => 1); # Hashes are unordered too
#@foo = (2,3,4);
#for all(@foo) { %got{$_} = 1; };
#is( %got.keys.sort.join(','), '1,2,3,4',
# 'for all(...) { ...} as parallelizable');
}
=begin description
These are implemented but still awaiting clarification on p6l.
On Fri, 2005-02-11 at 10:46 +1100, Damian Conway wrote:
> Subject: Re: Fwd: Junctive puzzles.
>
> Junctions have an associated boolean predicate that's preserved across
> operations on the junction. Junctions also implicitly distribute across
> operations, and rejunctify the results.
=end description
# L<S03/Junctive operators/They thread through operations>
{
my @subs = (sub {3}, sub {2});
my Mu $got;
my Mu $want;
is(j(any(@subs)()), j(3|2), '.() on any() junction of subs');
$want = (3&2);
$got = all(@subs)();
is(j($got), j($want), '.() on all() junction of subs');
$want = (3^2);
$got = one(@subs)();
is(j($got), j($want), '.() on one() junction of subs');
$want = none(3,2);
$got = none(@subs)();
is(j($got), j($want), '.() on none() junction of subs');
$want = one( any(3,2), all(3,2) );
$got = one( any(@subs), all(@subs) )();
is(j($got), j($want), '.() on complex junction of subs');
# Avoid future constant folding
#my $rand = rand;
#my $zero = int($rand-$rand);
#my @subs = (sub {3+$zero}, sub {2+$zero});
}
# Check functional and operator versions produce the same structure
{
is(j((1|2)^(3&4)), j(one(any(1,2),all(3,4))),
'((1|2)^(3&4)) equiv to one(any(1,2),all(3,4))');
is(j((1|2)&(3&4)), j(all(any(1,2),all(3,4))),
'((1|2)&(3&4)) equiv to all(any(1,2),all(3,4))');
is(j((1|2)|(3&4)), j(any(any(1,2),all(3,4))),
'((1|2)|(3&4)) equiv to any(any(1,2),all(3,4))');
}
# junction in boolean context
ok(?(0&0) == ?(0&&0), 'boolean context');
ok(?(0&1) == ?(0&&1), 'boolean context');
ok(?(1&1) == ?(1&&1), 'boolean context');
ok(?(1&0) == ?(1&&0), 'boolean context');
ok(!(?(0&0) != ?(0&&0)), 'boolean context');
ok(!(?(0&1) != ?(0&&1)), 'boolean context');
ok(!(?(1&1) != ?(1&&1)), 'boolean context');
ok(!(?(1&0) != ?(1&&0)), 'boolean context');
{
my $c = 0;
if 1 == 1 { $c++ }
is $c, 1;
if 1 == 1|2 { $c++ }
is $c, 2;
if 1 == 1|2|3 { $c++ }
is $c, 3;
$c++ if 1 == 1;
is $c, 4;
$c++ if 1 == 1|2;
is $c, 5, 'if modifier with junction should be called once';
$c = 0;
$c++ if 1 == 1|2|3;
is $c, 1, 'if modifier with junction should be called once';
$c = 0;
$c++ if 1 == any(1, 2, 3);
is $c, 1, 'if modifier with junction should be called once';
}
{
my @array = <1 2 3 4 5 6 7 8>;
jok( all(@array) == one(@array), "all(@x) == one(@x) tests uniqueness(+ve)" );
push @array, 6;
jok( !( all(@array) == one(@array) ), "all(@x) == one(@x) tests uniqueness(-ve)" );
}
# used to be a rakudo regression (RT #60886)
ok Mu & Mu ~~ Mu, 'Mu & Mu ~~ Mu works';
## See also S03-junctions/autothreading.t
{
is substr("abcd", 1, 2), "bc", "simple substr";
my Mu $res = substr(any("abcd", "efgh"), 1, 2);
isa-ok $res, Junction;
ok $res eq "bc", "substr on junctions: bc";
ok $res eq "fg", "substr on junctions: fg";
}
{
my Mu $res = substr("abcd", 1|2, 2);
isa-ok $res, Junction;
ok $res eq "bc", "substr on junctions: bc";
ok $res eq "cd", "substr on junctions: cd";
}
{
my Mu $res = substr("abcd", 1, 1|2);
isa-ok $res, Junction;
ok $res eq "bc", "substr on junctions: bc";
ok $res eq "b", "substr on junctions: b";
}
{
my Mu $res = index(any("abcd", "qwebdd"), "b");
isa-ok $res, Junction;
ok $res == 1, "index on junctions: 1";
ok $res == 3, "index on junctions: 3";
}
{
my Mu $res = index("qwebdd", "b"|"w");
isa-ok $res, Junction;
ok $res == 1, "index on junctions: 1";
ok $res == 3, "index on junctions: 3";
}
# RT #63686
{
lives-ok { try { for any(1,2) -> $x {}; } },
'for loop over junction in try block';
sub rt63686 {
for any(1,2) -> $x {}; #OK not used
return 'happiness';
}
is rt63686(), 'happiness', 'for loop over junction in sub';
}
# RT #67866: [BUG] [LHF] Error with stringifying .WHAT on any junctions
{
ok((WHAT any()) ~~ Junction, "test WHAT on empty any junction");
ok(any().WHAT ~~ Junction, "test WHAT on empty any junction");
ok((WHAT any(1,2)) ~~ Junction, "test WHAT on any junction");
ok(any(1,2).WHAT ~~ Junction, "test WHAT on any junction");
}
# Any list has junction methods
{
jok(5 < (6,7,8).all, '.all method builds "all" junction');
jok(!(7 < (6,7,8).all), '.all method builds "all" junction');
jok(7 == (6,7,8).one, '.one method builds "one" junction');
jok(9 == (6,7,8).none, '.none method builds "none" junction');
my @x = (6,7,8);
jok(5 < @x.all, '.all method works on array objects');
}
# RT #63126
#?DOES 2
{
my @a = "foo", "foot";
ok @a[all(0,1)] ~~ /^foo/,
'junction can be used to index Array';
my %h = (
"0" => "foo",
"1" => "foot"
);
ok %h{all(0,1)} ~~ /^foo/,
'junction can be used to index Hash';
}
# RT #111726
{
is (all() ~~ /^ \d+ $/).gist, 'all()',
'regex match in all junction is an empty all junction (1)';
is (all() ~~ /./).gist, 'all()',
'regex match in all junction is an empty all junction (2)';
is (all() ~~ /all/).gist, 'all()',
'regex match in all junction is an empty all junction (3)';
is (all() ~~ /bll/).gist, 'all()',
'regex match in all junction is an empty all junction (4)';
is (any("4","5") ~~ /4/).gist, 'any(「4」, Nil)',
'successful regex match in any junction';
}
# RT #103106
{
is ("foo" & "a nice old foo" ~~ /foo/).gist, 'all(「foo」, 「foo」)',
'successful regex match in all junction';
}
# RT #120992
{
is (all("a","b") ~~ /a/).gist, 'all(「a」, Nil)',
'successful regex match in all junction if one element does not match';
}
# stringy tests
#?niecza todo '#82'
{
my class Foo {
multi method gist(Foo:D:) { "gisted"; }
multi method perl(Foo:D:) { "perled"; }
multi method Str(Foo:D:) { "Stred"; }
}
is any(Foo.new).perl, 'any(perled)', 'any(Foo.new).perl';
is any(Foo.new).gist, 'any(gisted)', 'any(Foo.new).gist';
}
# RT #109188
ok { a => 1} ~~ List|Hash, 'Can construct junction with List type object';
# RT #112392
ok (1|2).Str ~~ Str, 'Junction.Str returns a Str, not a Junction';
# RT #101124
ok (0|1 == 0&1), 'test junction evaluation order';
ok (0&1 == 0|1), 'test junction evaluation order';
# test one-arg-flattening of listop forms
ok any((1,2,3),(4,5,6)) eqv (1,2,3), 'any is not flattening 1';
nok any((1,2,4),(4,5,6)) == 2, 'any is not flattening 2';
is (any((1,2,3),(4,5,6)) eqv (4,5,6)).gist, 'any(False, True)', 'any is not flattening 3';
ok any((1,2,4)) == 2, 'any is onearg';
ok all((4,5,6),(4,5,6)) eqv (4,5,6), 'all is not flattening 1';
ok all((1,2,3),(4,5,6)) == 3, 'all is non flattening 2';
is (all((1,2,3),(4,5,6)) eqv (4,5,6)).gist, 'all(False, True)', 'all is not flattening 3';
nok all((1,2,3)) == 3, 'all is onearg';
ok one((4,5,6),(4,5,6,7)) eqv (4,5,6,7), 'one is not flattening 1';
nok one((1,2,3),(4,5,6)) eq '3' , 'one is not flattening 2';
is (one((1,2,3),(4,5,6)) eqv (1,2,3)).gist, 'one(True, False)', 'one is not flattening 3';
ok one((1,2,3)) == 2, 'one is onearg';
ok none((4,5,6),(4,5,6)) == 4, 'none is not flattening 1';
ok none((1,2,3,4),(4,5,6,7)) eq '3' , 'none is not flattening 2';
is (none(1,2,3,(4,5,6)) == 3).gist, 'none(False, False, True, True)', 'none is not flattening 3';
nok none((1,2,3,4)) == 3 , 'none is onearg';
# test non-flattening of method forms
nok (<a b c>,(4,5,6)).any == 4, '.any is not flattening 1';
ok (<a b c>,(4,5,6)).any == 3, '.any is not flattening 2';
is ((<a b c>,(4,5,6)).any == 3).gist, 'any(True, True)', '.any is not flattening 3';
nok ((4,5,6),(4,5,6)).all > 3, '.all is not flattening 1';
ok (<a b c>,(4,5,6)).all == 3, '.all is not flattening 2';
is ((<a b c>,(4,5,6)).all == 3).gist, 'all(True, True)', '.any is not flattening 3';
nok ((4,5,6),(4,5,6,7)).one == 7, '.one is not flattening 1';
ok (<a b c>,(4,5,6)).one eq 'a b c' , '.one is not flattening 2';
is ((<a b c>,(4,5,6)).one eq 'a b c').gist, 'one(True, False)', '.one is not flattening 3';
nok ((4,5,6),(4,5,6,7)).none == 3, '.none is not flattening 1';
ok (<a b c>,(4,5,6)).none eq 'a' , '.none is not flattening 2';
is ((<a b c>,(4,5,6)).none eq 'a b c').gist, 'none(True, False)', '.none is not flattening 3';
throws-like 'multi sub foo($) { }; foo(Junction)', X::Multi::NoMatch,
'Do not try to auto-thread Junction type object (multi case)';
throws-like 'sub foo($) { }; foo(Junction)', X::TypeCheck::Binding,
'Do not try to auto-thread Junction type object (only case)';
# vim: ft=perl6