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
|
#!./perl
BEGIN {
chdir 't' if -d 't';
@INC = qw(../lib);
require './test.pl';
plan (tests => 17);
}
is __SUB__, "__SUB__", '__SUB__ is a bareword outside of use feature';
{
use v5.15;
is __SUB__, undef, '__SUB__ under use v5.16';
}
use feature 'current_sub';
is __SUB__, undef, '__SUB__ returns undef outside of a subroutine';
is +()=__SUB__, 1, '__SUB__ returns undef in list context';
sub foo { __SUB__ }
is foo, \&foo, '__SUB__ inside a named subroutine';
is foo->(), \&foo, '__SUB__ is callable';
is ref foo, 'CODE', '__SUB__ is a code reference';
my $subsub = sub { __SUB__ };
is &$subsub, $subsub, '__SUB__ inside anonymous non-closure';
my @subsubs;
for my $x(1..3) {
push @subsubs, sub { return $x if @_; __SUB__ };
}
# Don’t loop here; we need to avoid interactions between the iterator
# and the closure.
is $subsubs[0]()(0), 1, '__SUB__ inside closure (1)';
is $subsubs[1]()(0), 2, '__SUB__ inside closure (2)';
is $subsubs[2]()(0), 3, '__SUB__ inside closure (3)';
BEGIN {
return "begin 1" if @_;
is CORE::__SUB__->(0), "begin 1", 'in BEGIN block'
}
BEGIN {
return "begin 2" if @_;
is &CORE::__SUB__->(0), "begin 2", 'in BEGIN block via & (unoptimised)'
}
sub bar;
sub bar {
() = sort {
is CORE::__SUB__, \&bar, 'in sort block in sub with forw decl'
} 1,2;
}
bar();
sub bur;
sub bur {
() = sort {
is &CORE::__SUB__, \&bur, '& in sort block in sub with forw decl'
} 1,2;
}
bur();
sub squog;
sub squog {
grep { is CORE::__SUB__, \&squog,
'in grep block in sub with forw decl'
} 1;
}
squog();
sub squag;
sub squag {
grep { is &CORE::__SUB__, \&squag,
'& in grep block in sub with forw decl'
} 1;
}
squag();
|
