forked from Raku/roast
-
Notifications
You must be signed in to change notification settings - Fork 0
/
misc.t
167 lines (127 loc) · 4.72 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
use v6;
use Test;
=begin kwid
Tests for Synopsis 3
=end kwid
plan 55;
my $str1 = "foo";
my $str2 = "bar";
my $str3 = "foobar";
my $str4 = $str1~$str2;
# L<S03/Concatenation>
is($str3, $str4, "~");
# L<S03/Conditional operator precedence/Also known as the ternary or trinary operator>
my $bar = "";
($str3 eq $str4) ?? ($bar = 1) !! ($bar = 0);
ok($bar, "?? !!");
# L<S03/Chaining binary precedence/==>
my $five = 5;
my $four = 4;
my $wibble = 4;
ok(!($five == $four), "== (false)");
ok($wibble == $four, "== (true)");
ok(!($wibble != $four), "== (false)");
ok($five != $four, "!= (true)");
ok($five == 5, "== (const on rhs)");
ok(!($five != 5), "!= (const on rhs)");
ok(5 == $five, "== (const on lhs)");
ok(!(5 != $five), "!= (const on lhs)");
ok($five == (2 + 3), "== (sum on rhs)");
ok(!($five != (2 + 3)), "== (sum on rhs)");
is(2 + 3, $five, "== (sum on lhs)");
ok((2 + 3) == 5, "== (sum on lhs)");
ok(!((2 + 3) != $five), "== (sum on lhs)");
# L<S03/Concatenation>
is("text " ~ "stitching", "text stitching", 'concatenation with ~ operator');
# Bit Stitching
# L<S03/Tight or precedence/short-circuit inclusive-or>
is(2 || 3, 2, "|| returns first true value");
ok(!(defined( 0 || Mu)), "|| returns last false value of list?");
{
(my @s)[0] //= 5;
is @s[0], 5, '(my @s)[0] //= something works';
(state @t)[0] //= 5;
is @t[0], 5, '(state @t)[0] //= something works';
}
is(2 ?| 3, True, "boolean or (?|) returns True or False");
is(0 ?| Any, False, "boolean or (?|) returns True or False");
# L<S03/Junctive operators/They thread through operations>
ok(?((all((4|5|6) + 3) == one(7|8|9))), "all elements in junction are incremented");
ok(?((any(1..6) == one(1|2|3|4|5|6))), "any elements will match via junction");
{
ok( ?(7 > any(4..12)), "any test against scalar" );
my @oldval = (5, 8, 12);
my @newval1 = (17, 15, 14); # all greater
my @newval2 = (15, 7, 20); # some less some greater
my @newval3 = (3, 1, 4); # all less
my @newval4 = (1,2,40);
ok( ?(any(@newval4) > any(@oldval)), "any test array against any array" );
ok( ?(any(@newval4) > all(@oldval)), "any test array against all array" );
ok( ?(all(@newval2) > any(@oldval)), "all test array against any array" );
ok( ?(all(@newval1) > all(@oldval)), "all test array against all array" );
ok(?(42 > 12 & 20 & 32), "test the all infix operator");
}
# L<S03/Hyper operators/hyper operator distributes over them as lists>
{
my @rv;
@rv = (1,2,3,4) >>+<< (1,2,3,4);
is(~@rv, "2 4 6 8", 'hyper-add');
}
# L<S03/List infix precedence/"the zip operator">
#for RT #73836
my @z=2,3;
is (2 Z 3), @z, 'joining of single items';
# RT #117045
{
throws-like { EVAL q[.say for (1 , 2, 3)«~» "!"] },
X::Syntax::Confused,
'Guillemet form of subscript does not parse as infix hyperop',
message => { m/"Two terms in a row"/ };
}
# RT #122654
{
multi infix:«≃» { $^l lt $^r };
multi infix:«!≃» { not($^l ≃ $^r) };
ok "foo" !≃ "bar",
'operator can start with a bang (!) and have Unicode character in it';
}
# Duplicate prefixes
{
# RT #73198
throws-like "1%^^1", X::Syntax::DuplicatedPrefix, prefixes => "^^",
"%^^ fails to parse (RT #73198)";
# RT #76436
throws-like "555 ~~!~~ 666", X::Syntax::DuplicatedPrefix, prefixes => "~~",
"~~!~~ fails to parse (RT #76436)";
}
# comparison complains if either of its arguments is undefined - RT #93978
{
throws-like {Int < 0}, Exception;
#?rakudo todo "RT #93978"
throws-like {"cat" gt Str}, Exception;
}
# unicode operators are there
{
is −1, -1, "unary MINUS SIGN";
is 42−1, 42-1, "infix MINUS SIGN";
my \a = 42; my \b = 1;
is a−b, a - b, "infix MINUS SIGN is not considered a hyphen";
is −a−b, -a - b, "prefix MINUS SIGN works with infix";
is 2 × 3, 6, "we have infix MULTIPLICATION SIGN";
#?rakudo.jvm skip 'Bogus term'
is 2 ÷ 3, ⅔, "we have infix DIVISION SIGN";
ok 4 ≤ 23, 'we have infix LESS-THAN OR EQUAL TO';
ok 16 ≥ 8, 'we have infix GREATER-THAN OR EQUAL TO';
ok 15 ≠ 42, 'we have infix NOT EQUAL TO';
nok 4 ≥ 23, 'we have infix LESS-THAN OR EQUAL TO (not always True)';
nok 16 ≤ 8, 'we have infix GREATER-THAN OR EQUAL TO (not always True)';
nok 42 ≠ 42, 'we have infix NOT EQUAL TO (not always True)';
ok -5 ≤ -4 ≤ -3, 'unicode op chaining';
ok 5 ≥ 4 ≥ 3, 'unicode op chaining';
ok -3 ≠ -4 ≠ 1, 'unicode op chaining';
ok 4 < 8 ≤ 15 <= 16 != 23 ≠ 42 == 42 ≠ 23 != 16 >= 15 ≥ 8 > 4,
'unicode ops chain with texas ones';
nok 4 < 8 ≤ 15 <= 16 != 23 ≠ 42 == 42 ≠ 23 != 16 >= 15 ≥ ∞ > 4,
'unicode ops chain with texas ones (not always True)';
}
# vim: ft=perl6