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
|
#!/usr/bin/perl
use v5.14;
use warnings;
use utf8;
use Test2::V0;
use B::Deparse;
my $deparser = B::Deparse->new( "-p" );
use lib "t";
use testcase "t::infix";
BEGIN { plan skip_all => "No PL_infix_plugin" unless XS::Parse::Infix::HAVE_PL_INFIX_PLUGIN; }
use feature 'current_sub';
BEGIN { $^H{"t::infix/permit"} = 1; }
{
my $result = 10 add 20;
is( $result, 30, 'add infix operator' );
$result = 15 ⊕ 20;
is( $result, 27, 'xor infix operator' );
my $aref = ["|" intersperse qw( a b c )];
is( $aref, [qw( a | b | c )],
'intersperse infix operator' );
my @list = qw( x y z );
$aref = ["|" intersperse @list];
is( $aref, [qw( x | y | z )],
'intersperse infix operator on PADAV' );
is( [ (2, 4, 6) addpairs (1, 1, 1) ],
[ 3, 5, 7 ], 'addpairs infix operator' );
}
# fully-qualified + lexical alias
{
BEGIN { t::infix->XS::Parse::Infix::apply_infix( 1, [ "fqadd" ], qw( fqadd ) ); }
my $result = 5 fqadd 10;
is( $result, 15, 'fqadd infix operator' );
}
{
my @importargs;
BEGIN {
@importargs = ( 123, fqadd => { -as => "localname" }, 456 );
t::infix->XS::Parse::Infix::apply_infix( 1, \@importargs, qw( fqadd ) ); }
my $result = 6 localname 12;
is( $result, 18, 'infix operator renamed' );
is( \@importargs, [ 123, 456 ], 'apply_infix correctly mutated import args' );
}
sub _getoptree
{
my ( $sub ) = @_;
# Ugh - this would be so much neater if we could pass coderefs into
# B::walkoptree directly
# Additionally there's no pre-mid-postfix walk options :(
my $dump_optree = sub {
my $sub = __SUB__;
my ( $op ) = @_;
my $opname = $op->name;
# Avoid test-dependence on the actual ppaddr by mangling out the name
$opname =~ s/0x[[:xdigit:]]+/0xXXX/;
return $op->first->$sub if $opname eq "null";
my @kids;
if( $op->flags & B::OPf_KIDS ) {
my $kid = $op->first;
while( $kid ) {
push @kids, $kid->$sub;
$kid = $kid->sibling; undef $kid if ref($kid) eq "B::NULL";
}
}
my $ret = $opname;
$ret .= "[" . join( ", ", @kids ) . "]" if @kids;
return $ret;
};
# Reach inside to the first statement
return B::svref_2object( $sub )->ROOT->first->first->sibling
->$dump_optree;
}
sub is_optree
{
my ( $sub, $exp, $name ) = @_;
is( _getoptree( $sub ), $exp, $name );
}
{
is_optree sub { $_[0] add $_[1] },
"infix_add_0xXXX[aelemfast, aelemfast]",
'optree of call to infix operator';
# Check precedence of operator parsing by observing the following precedence
# ordering:
# <--High Low-->
# ** * + &&
is_optree sub { $_[0] * $_[1] add $_[2] * $_[3] },
"infix_add_0xXXX[multiply[aelemfast, aelemfast], multiply[aelemfast, aelemfast]]",
'optree binds add lower than *';
is_optree sub { $_[0] + $_[1] add $_[2] + $_[3] },
"add[infix_add_0xXXX[add[aelemfast, aelemfast], aelemfast], aelemfast]",
'optree binds add equal to +';
is_optree sub { $_[0] && $_[1] add $_[2] && $_[3] },
"and[and[aelemfast, infix_add_0xXXX[aelemfast, aelemfast]], aelemfast]",
'optree binds add higher than &&';
is_optree sub { $_[0] ** $_[1] mul $_[2] ** $_[3] },
"infix_mul_0xXXX[pow[aelemfast, aelemfast], pow[aelemfast, aelemfast]]",
'optree binds mul lower than **';
is_optree sub { $_[0] * $_[1] mul $_[2] * $_[3] },
"multiply[infix_mul_0xXXX[multiply[aelemfast, aelemfast], aelemfast], aelemfast]",
'optree binds mul equal to *';
is_optree sub { $_[0] + $_[1] mul $_[2] + $_[3] },
"add[add[aelemfast, infix_mul_0xXXX[aelemfast, aelemfast]], aelemfast]",
'optree binds mul higher than +';
is_optree sub { $_[0] * ($_[1] add $_[2]) * $_[3] },
"multiply[multiply[aelemfast, infix_add_0xXXX[aelemfast, aelemfast]], aelemfast]",
'optree of call to infix operator at forced precedence';
}
sub is_deparsed
{
my ( $sub, $exp, $name ) = @_;
my $got = $deparser->coderef2text( $sub );
# Deparsed output is '{ ... }'-wrapped
$got = ( $got =~ m/^{\n(.*)\n}$/s )[0];
# Deparsed output will have a lot of pragmata and so on; just grab the
# final line
$got = ( split m/\n/, $got )[-1];
$got =~ s/^\s+//;
is( $got, $exp, $name );
}
{
is_deparsed sub { $_[0] add $_[1] },
'$_[0] add $_[1];',
'deparsed call to infix add operator';
is_deparsed sub { $_[0] * $_[1] add $_[2] * $_[3] },
'($_[0] * $_[1]) add ($_[2] * $_[3]);',
'deparsed call to infix add operator at default precedence';
is_deparsed sub { $_[0] ⊕ $_[1] },
'$_[0] ⊕ $_[1];',
'deparsed operator yields UTF-8';
is_deparsed sub { "+" intersperse (1,2,3) },
q['+' intersperse (1, 2, 3);],
'deparsed call to infix operator with list RHS';
is_deparsed sub { (1,2,3) addpairs (4,5,6) },
'(1, 2, 3) addpairs (4, 5, 6);',
'deparsed call to infix list/list operator';
}
# list-associative operator
{
is( "a" cat "b" cat "c", "^abc^",
'cat operator runs correctly' );
is_optree sub { "a" cat "b" cat "c" },
"infix_cat_0xXXX[const, const, const]",
'optree of list-associative cat operator';
is_optree sub { ( "a" cat "b" ) cat "c" },
"infix_cat_0xXXX[infix_cat_0xXXX[const, const], const]",
'parens on LHS defeat list-associativity';
is_optree sub { "a" cat ( "b" cat "c" ) },
"infix_cat_0xXXX[const, infix_cat_0xXXX[const, const]]",
'parens on RHS defeat list-associativity';
is_deparsed sub { "a" cat "b" cat "c" },
q['a' cat 'b' cat 'c';],
'deparsed list-associative cat operator';
}
done_testing;
|
