#!./perl
BEGIN {
chdir 't' if -d 't';
}
use overload (
# Anonymous subroutines:
$_[2]? $_[1]-${$_[0]} : ${$_[0]}-$_[1]},
$_[2]? $_[1]-${$_[0]} : ${$_[0]}-$_[1]},
$_[2]? $_[1]/${$_[0]} :
${$_[0]}/$_[1]},
$_[2]? $_[1]%${$_[0]} : ${$_[0]}%$_[1]},
$_[2]? $_[1]**${$_[0]} : ${$_[0]}-$_[1]},
qw(
"" stringify
);
my $foo = $_[1];
}
# comparing to direct compilation based on
# stringify
$| = 1;
sub test {
$test++;
if (@_ > 1) {
return 1;
} else {
return 0;
}
} else {
if (shift) {
return 1;
} else {
return 0;
}
}
}
$b= "$a";
# All test numbers in comments are off by 1.
# So much for hard-wiring them in :-) To fix this:
test(1); # 1
$c = $a + 7;
$b=$a;
$b++;
$c=$b;
$c-=$a;
$b=1;
$b+=$a;
$b=$a;
$b++;
$b=$a;
$b++;
undef $b; # Destroying updates tables too...
$b=$a;
$b++;
$b++;
$b=$a;
$b++;
test ($b? 1:0); # 45
local $new=$ {$_[0]};
$b++;
$b+=1;
$b=$a;
$b+=1;
$b=$a;
$b++;
$_[0] } ) ];
$b=$a;
$b+=1;
$b+=$b;
$b=-$b;
: "_.${$_[0]}._" x $_[1])}) ];
$a x= 3;
"_.$_[1].__.$ {$_[0]}._"
: "_.$ {$_[0]}.__.$_[1]._")}) ];
# Check inheritance of overloading;
{
}
# Here we test blessing to a package updates hash
eval "package Oscalar; no overload '.'";
$x="1";
# Negative overloading:
$na = eval { ~$a };
# Check AUTOLOADING:
eval "package Oscalar; sub comple; use overload '~' => 'comple'";
test !$@; # 98
$na = 0;
$na = eval { ~$aI }; # Hash was not updated
test($@ =~ /no method found/); # 100
bless \$x, OscalarI;
$na = eval { ~$aI };
print $@;
test !$@; # 101
$na = eval { $aI >> 1 }; # Hash was not updated
test($@ =~ /no method found/); # 103
bless \$x, OscalarI;
$na = 0;
$na = eval { $aI >> 1 };
print $@;
test !$@; # 104
# warn overload::Method($a, '0+'), "\n";
test (overload::Method($a, '0+') eq \&Oscalar::numify); # 106
test (overload::Method($aI,'0+') eq \&Oscalar::numify); # 107
test (overload::Overloaded($aI)); # 108
test (! defined overload::Method($aI, '<<')); # 110
test (! defined overload::Method($a, '<')); # 111
test (overload::StrVal($aI) =~ /^OscalarI=SCALAR\(0x[\da-fA-F]+\)$/); # 112
test (overload::StrVal(\$aI) eq "@{[\$aI]}"); # 113
# Check overloading by methods (specified deep in the ISA tree).
{
package OscalarII;
sub Oscalar::lshft {"_<<_" . shift() . "_<<_"}
}
$aaII = "087";
$aII = \$aaII;
test(($aI | 3) eq '_<<_xx_<<_'); # 114
# warn $aII << 3;
test(($aII << 3) eq '_<<_087_<<_'); # 115
{
BEGIN { $int = 7; overload::constant 'integer' => sub {$int++; shift}; }
$out = 2**10;
}
test($int, 9); # 116
test($out, 1024); # 117
$foo = 'foo';
$foo1 = 'f\'o\\o';
{
BEGIN { $q = $qr = 7;
overload::constant 'q' => sub {$q++; push @q, shift, ($_[1] || 'none'); shift},
'qr' => sub {$qr++; push @qr, shift, ($_[1] || 'none'); shift}; }
$out = 'foo';
$out1 = 'f\'o\\o';
$out2 = "a\a$foo,\,";
/b\b$foo.\./;
}
test($out, 'foo'); # 118
test($out, $foo); # 119
test($out1, 'f\'o\\o'); # 120
test($out1, $foo1); # 121
test($out2, "a\afoo,\,"); # 122
test("@q", "foo q f'o\\\\o q a\\a qq ,\\, qq"); # 123
test($q, 11); # 124
test("@qr", "b\\b qq .\\. qq"); # 125
test($qr, 9); # 126
{
$_ = '!<b>!foo!<-.>!';
BEGIN { overload::constant 'q' => sub {push @q1, shift, ($_[1] || 'none'); "_<" . (shift) . ">_"},
'qr' => sub {push @qr1, shift, ($_[1] || 'none'); "!<" . (shift) . ">!"}; }
$out = 'foo';
$out1 = 'f\'o\\o';
$out2 = "a\a$foo,\,";
$res = /b\b$foo.\./;
$a = <<EOF;
oups
EOF
$b = <<'EOF';
oups1
EOF
$c = bareword;
m'try it';
s'first part'second part';
s/yet another/tail here/;
tr/A-Z/a-z/;
}
test($out, '_<foo>_'); # 117
test($out1, '_<f\'o\\o>_'); # 128
test($out2, "_<a\a>_foo_<,\,>_"); # 129
test("@q1", "foo q f'o\\\\o q a\\a qq ,\\, qq oups
qq oups1
q second part q tail here s A-Z tr a-z tr"); # 130
test("@qr1", "b\\b qq .\\. qq try it q first part q yet another qq"); # 131
test($res, 1); # 132
test($a, "_<oups
>_"); # 133
test($b, "_<oups1
>_"); # 134
test($c, "bareword"); # 135
{
package symbolic; # Primitive symbolic calculator
use overload nomethod => \&wrap, '""' => \&str, '0+' => \&num,
'=' => \&cpy, '++' => \&inc, '--' => \&dec;
sub new { shift; bless ['n', @_] }
sub cpy {
my $self = shift;
bless [@$self], ref $self;
}
sub inc { $_[0] = bless ['++', $_[0], 1]; }
sub dec { $_[0] = bless ['--', $_[0], 1]; }
sub wrap {
my ($obj, $other, $inv, $meth) = @_;
if ($meth eq '++' or $meth eq '--') {
@$obj = ($meth, (bless [@$obj]), 1); # Avoid circular reference
return $obj;
}
($obj, $other) = ($other, $obj) if $inv;
bless [$meth, $obj, $other];
}
sub str {
my ($meth, $a, $b) = @{+shift};
$a = 'u' unless defined $a;
if (defined $b) {
"[$meth $a $b]";
} else {
"[$meth $a]";
}
}
my %subr = ( 'n' => sub {$_[0]} );
foreach my $op (split " ", $overload::ops{with_assign}) {
$subr{$op} = $subr{"$op="} = eval "sub {shift() $op shift()}";
}
my @bins = qw(binary 3way_comparison num_comparison str_comparison);
foreach my $op (split " ", "@overload::ops{ @bins }") {
$subr{$op} = eval "sub {shift() $op shift()}";
}
foreach my $op (split " ", "@overload::ops{qw(unary func)}") {
$subr{$op} = eval "sub {$op shift()}";
}
$subr{'++'} = $subr{'+'};
$subr{'--'} = $subr{'-'};
sub num {
my ($meth, $a, $b) = @{+shift};
my $subr = $subr{$meth}
or die "Do not know how to ($meth) in symbolic";
$a = $a->num if ref $a eq __PACKAGE__;
$b = $b->num if ref $b eq __PACKAGE__;
$subr->($a,$b);
}
sub TIESCALAR { my $pack = shift; $pack->new(@_) }
sub FETCH { shift }
sub nop { } # Around a bug
sub vars { my $p = shift; tie($_, $p), $_->nop foreach @_; }
sub STORE {
my $obj = shift;
$#$obj = 1;
$obj->[1] = shift;
}
}
{
my $foo = new symbolic 11;
my $baz = $foo++;
test( (sprintf "%d", $foo), '12');
test( (sprintf "%d", $baz), '11');
my $bar = $foo;
$baz = ++$foo;
test( (sprintf "%d", $foo), '13');
test( (sprintf "%d", $bar), '12');
test( (sprintf "%d", $baz), '13');
my $ban = $foo;
$baz = ($foo += 1);
test( (sprintf "%d", $foo), '14');
test( (sprintf "%d", $bar), '12');
test( (sprintf "%d", $baz), '14');
test( (sprintf "%d", $ban), '13');
$baz = 0;
$baz = $foo++;
test( (sprintf "%d", $foo), '15');
test( (sprintf "%d", $baz), '14');
test( "$foo", '[++ [+= [++ [++ [n 11] 1] 1] 1] 1]');
}
{
my $iter = new symbolic 2;
my $side = new symbolic 1;
my $cnt = $iter;
while ($cnt) {
$cnt = $cnt - 1; # The "simple" way
$side = (sqrt(1 + $side**2) - 1)/$side;
}
my $pi = $side*(2**($iter+2));
test "$side", '[/ [- [sqrt [+ 1 [** [/ [- [sqrt [+ 1 [** [n 1] 2]]] 1] [n 1]] 2]]] 1] [/ [- [sqrt [+ 1 [** [n 1] 2]]] 1] [n 1]]]';
test( (sprintf "%f", $pi), '3.182598');
}
{
my $iter = new symbolic 2;
my $side = new symbolic 1;
my $cnt = $iter;
while ($cnt--) {
$side = (sqrt(1 + $side**2) - 1)/$side;
}
my $pi = $side*(2**($iter+2));
test "$side", '[/ [- [sqrt [+ 1 [** [/ [- [sqrt [+ 1 [** [n 1] 2]]] 1] [n 1]] 2]]] 1] [/ [- [sqrt [+ 1 [** [n 1] 2]]] 1] [n 1]]]';
test( (sprintf "%f", $pi), '3.182598');
}
{
my ($a, $b);
symbolic->vars($a, $b);
my $c = sqrt($a**2 + $b**2);
$a = 3; $b = 4;
test( (sprintf "%d", $c), '5');
$a = 12; $b = 5;
test( (sprintf "%d", $c), '13');
}
{
package symbolic1; # Primitive symbolic calculator
# Mutator inc/dec
use overload nomethod => \&wrap, '""' => \&str, '0+' => \&num, '=' => \&cpy;
sub new { shift; bless ['n', @_] }
sub cpy {
my $self = shift;
bless [@$self], ref $self;
}
sub wrap {
my ($obj, $other, $inv, $meth) = @_;
if ($meth eq '++' or $meth eq '--') {
@$obj = ($meth, (bless [@$obj]), 1); # Avoid circular reference
return $obj;
}
($obj, $other) = ($other, $obj) if $inv;
bless [$meth, $obj, $other];
}
sub str {
my ($meth, $a, $b) = @{+shift};
$a = 'u' unless defined $a;
if (defined $b) {
"[$meth $a $b]";
} else {
"[$meth $a]";
}
}
my %subr = ( 'n' => sub {$_[0]} );
foreach my $op (split " ", $overload::ops{with_assign}) {
$subr{$op} = $subr{"$op="} = eval "sub {shift() $op shift()}";
}
my @bins = qw(binary 3way_comparison num_comparison str_comparison);
foreach my $op (split " ", "@overload::ops{ @bins }") {
$subr{$op} = eval "sub {shift() $op shift()}";
}
foreach my $op (split " ", "@overload::ops{qw(unary func)}") {
$subr{$op} = eval "sub {$op shift()}";
}
$subr{'++'} = $subr{'+'};
$subr{'--'} = $subr{'-'};
sub num {
my ($meth, $a, $b) = @{+shift};
my $subr = $subr{$meth}
or die "Do not know how to ($meth) in symbolic";
$a = $a->num if ref $a eq __PACKAGE__;
$b = $b->num if ref $b eq __PACKAGE__;
$subr->($a,$b);
}
sub TIESCALAR { my $pack = shift; $pack->new(@_) }
sub FETCH { shift }
sub nop { } # Around a bug
sub vars { my $p = shift; tie($_, $p), $_->nop foreach @_; }
sub STORE {
my $obj = shift;
$#$obj = 1;
$obj->[1] = shift;
}
}
{
my $foo = new symbolic1 11;
my $baz = $foo++;
test( (sprintf "%d", $foo), '12');
test( (sprintf "%d", $baz), '11');
my $bar = $foo;
$baz = ++$foo;
test( (sprintf "%d", $foo), '13');
test( (sprintf "%d", $bar), '12');
test( (sprintf "%d", $baz), '13');
my $ban = $foo;
$baz = ($foo += 1);
test( (sprintf "%d", $foo), '14');
test( (sprintf "%d", $bar), '12');
test( (sprintf "%d", $baz), '14');
test( (sprintf "%d", $ban), '13');
$baz = 0;
$baz = $foo++;
test( (sprintf "%d", $foo), '15');
test( (sprintf "%d", $baz), '14');
test( "$foo", '[++ [+= [++ [++ [n 11] 1] 1] 1] 1]');
}
{
my $iter = new symbolic1 2;
my $side = new symbolic1 1;
my $cnt = $iter;
while ($cnt) {
$cnt = $cnt - 1; # The "simple" way
$side = (sqrt(1 + $side**2) - 1)/$side;
}
my $pi = $side*(2**($iter+2));
test "$side", '[/ [- [sqrt [+ 1 [** [/ [- [sqrt [+ 1 [** [n 1] 2]]] 1] [n 1]] 2]]] 1] [/ [- [sqrt [+ 1 [** [n 1] 2]]] 1] [n 1]]]';
test( (sprintf "%f", $pi), '3.182598');
}
{
my $iter = new symbolic1 2;
my $side = new symbolic1 1;
my $cnt = $iter;
while ($cnt--) {
$side = (sqrt(1 + $side**2) - 1)/$side;
}
my $pi = $side*(2**($iter+2));
test "$side", '[/ [- [sqrt [+ 1 [** [/ [- [sqrt [+ 1 [** [n 1] 2]]] 1] [n 1]] 2]]] 1] [/ [- [sqrt [+ 1 [** [n 1] 2]]] 1] [n 1]]]';
test( (sprintf "%f", $pi), '3.182598');
}
{
my ($a, $b);
symbolic1->vars($a, $b);
my $c = sqrt($a**2 + $b**2);
$a = 3; $b = 4;
test( (sprintf "%d", $c), '5');
$a = 12; $b = 5;
test( (sprintf "%d", $c), '13');
}
{
package two_face; # Scalars with separate string and
# numeric values.
sub new { my $p = shift; bless [@_], $p }
use overload '""' => \&str, '0+' => \&num, fallback => 1;
sub num {shift->[1]}
sub str {shift->[0]}
}
{
my $seven = new two_face ("vii", 7);
test( (sprintf "seven=$seven, seven=%d, eight=%d", $seven, $seven+1),
'seven=vii, seven=7, eight=8');
test( scalar ($seven =~ /i/), '1')
}
{
package sorting;
use overload 'cmp' => \∁
sub new { my ($p, $v) = @_; bless \$v, $p }
sub comp { my ($x,$y) = @_; ($$x * 3 % 10) <=> ($$y * 3 % 10) or $$x cmp $$y }
}
{
my @arr = map sorting->new($_), 0..12;
my @sorted1 = sort @arr;
my @sorted2 = map $$_, @sorted1;
test "@sorted2", '0 10 7 4 1 11 8 5 12 2 9 6 3';
}
{
package iterator;
use overload '<>' => \&iter;
sub new { my ($p, $v) = @_; bless \$v, $p }
sub iter { my ($x) = @_; return undef if $$x < 0; return $$x--; }
}
# XXX iterator overload not intended to work with CORE::GLOBAL?
if (defined &CORE::GLOBAL::glob) {
test '1', '1'; # 175
test '1', '1'; # 176
test '1', '1'; # 177
}
else {
my $iter = iterator->new(5);
my $acc = '';
my $out;
$acc .= " $out" while $out = <${iter}>;
test $acc, ' 5 4 3 2 1 0'; # 175
$iter = iterator->new(5);
test scalar <${iter}>, '5'; # 176
$acc = '';
$acc .= " $out" while $out = <$iter>;
test $acc, ' 4 3 2 1 0'; # 177
}
{
package deref;
use overload '%{}' => \&hderef, '&{}' => \&cderef,
'*{}' => \&gderef, '${}' => \&sderef, '@{}' => \&aderef;
sub new { my ($p, $v) = @_; bless \$v, $p }
sub deref {
my ($self, $key) = (shift, shift);
my $class = ref $self;
bless $self, 'deref::dummy'; # Disable overloading of %{}
my $out = $self->{$key};
bless $self, $class; # Restore overloading
$out;
}
sub hderef {shift->deref('h')}
sub aderef {shift->deref('a')}
sub cderef {shift->deref('c')}
sub gderef {shift->deref('g')}
sub sderef {shift->deref('s')}
}
{
my $deref = bless { h => { foo => 5 , fake => 23 },
c => sub {return shift() + 34},
's' => \123,
a => [11..13],
g => \*srt,
}, 'deref';
# Hash:
my @cont = sort %$deref;
if ("\t" eq "\011") { # ascii
test "@cont", '23 5 fake foo'; # 178
}
else { # ebcdic alpha-numeric sort order
test "@cont", 'fake foo 23 5'; # 178
}
my @keys = sort keys %$deref;
test "@keys", 'fake foo'; # 179
my @val = sort values %$deref;
test "@val", '23 5'; # 180
test $deref->{foo}, 5; # 181
test defined $deref->{bar}, ''; # 182
my $key;
@keys = ();
push @keys, $key while $key = each %$deref;
@keys = sort @keys;
test "@keys", 'fake foo'; # 183
test exists $deref->{bar}, ''; # 184
test exists $deref->{foo}, 1; # 185
# Code:
test $deref->(5), 39; # 186
test &$deref(6), 40; # 187
sub xxx_goto { goto &$deref }
test xxx_goto(7), 41; # 188
my $srt = bless { c => sub {$b <=> $a}
}, 'deref';
*srt = \&$srt;
my @sorted = sort srt 11, 2, 5, 1, 22;
test "@sorted", '22 11 5 2 1'; # 189
# Scalar
test $$deref, 123; # 190
# Code
@sorted = sort $srt 11, 2, 5, 1, 22;
test "@sorted", '22 11 5 2 1'; # 191
# Array
test "@$deref", '11 12 13'; # 192
test $#$deref, '2'; # 193
my $l = @$deref;
test $l, 3; # 194
test $deref->[2], '13'; # 195
$l = pop @$deref;
test $l, 13; # 196
$l = 1;
test $deref->[$l], '12'; # 197
# Repeated dereference
my $double = bless { h => $deref,
}, 'deref';
test $double->{foo}, 5; # 198
}
{
package two_refs;
use overload '%{}' => \&gethash, '@{}' => sub { ${shift()} };
sub new {
my $p = shift;
bless \ [@_], $p;
}
sub gethash {
my %h;
my $self = shift;
tie %h, ref $self, $self;
\%h;
}
sub TIEHASH { my $p = shift; bless \ shift, $p }
my %fields;
my $i = 0;
$fields{$_} = $i++ foreach qw{zero one two three};
sub STORE {
my $self = ${shift()};
my $key = $fields{shift()};
defined $key or die "Out of band access";
$$self->[$key] = shift;
}
sub FETCH {
my $self = ${shift()};
my $key = $fields{shift()};
defined $key or die "Out of band access";
$$self->[$key];
}
}
my $bar = new two_refs 3,4,5,6;
$bar->[2] = 11;
test $bar->{two}, 11; # 199
$bar->{three} = 13;
test $bar->[3], 13; # 200
{
package two_refs_o;
@ISA = ('two_refs');
}
$bar = new two_refs_o 3,4,5,6;
$bar->[2] = 11;
test $bar->{two}, 11; # 201
$bar->{three} = 13;
test $bar->[3], 13; # 202
{
package two_refs1;
use overload '%{}' => sub { ${shift()}->[1] },
'@{}' => sub { ${shift()}->[0] };
sub new {
my $p = shift;
my $a = [@_];
my %h;
tie %h, $p, $a;
bless \ [$a, \%h], $p;
}
sub gethash {
my %h;
my $self = shift;
tie %h, ref $self, $self;
\%h;
}
sub TIEHASH { my $p = shift; bless \ shift, $p }
my %fields;
my $i = 0;
$fields{$_} = $i++ foreach qw{zero one two three};
sub STORE {
my $a = ${shift()};
my $key = $fields{shift()};
defined $key or die "Out of band access";
$a->[$key] = shift;
}
sub FETCH {
my $a = ${shift()};
my $key = $fields{shift()};
defined $key or die "Out of band access";
$a->[$key];
}
}
$bar = new two_refs_o 3,4,5,6;
$bar->[2] = 11;
test $bar->{two}, 11; # 203
$bar->{three} = 13;
test $bar->[3], 13; # 204
{
package two_refs1_o;
@ISA = ('two_refs1');
}
$bar = new two_refs1_o 3,4,5,6;
$bar->[2] = 11;
test $bar->{two}, 11; # 205
$bar->{three} = 13;
test $bar->[3], 13; # 206
{
package B;
use overload bool => sub { ${+shift} };
}
my $aaa;
{ my $bbbb = 0; $aaa = bless \$bbbb, B }
test !$aaa, 1; # 207
unless ($aaa) {
test 'ok', 'ok'; # 208
} else {
test 'is not', 'ok'; # 208
}
# check that overload isn't done twice by join
{ my $c = 0;
package Join;
use overload '""' => sub { $c++ };
my $x = join '', bless([]), 'pq', bless([]);
main::test $x, '0pq1'; # 209
};
# Test module-specific warning
{
# check the Odd number of arguments for overload::constant warning
my $a = "" ;
local $SIG{__WARN__} = sub {$a = $_[0]} ;
$x = eval ' overload::constant "integer" ; ' ;
test($a eq "") ; # 210
use warnings 'overload' ;
$x = eval ' overload::constant "integer" ; ' ;
test($a =~ /^Odd number of arguments for overload::constant at/) ; # 211
}
{
# check the `$_[0]' is not an overloadable type warning
my $a = "" ;
local $SIG{__WARN__} = sub {$a = $_[0]} ;
$x = eval ' overload::constant "fred" => sub {} ; ' ;
test($a eq "") ; # 212
use warnings 'overload' ;
$x = eval ' overload::constant "fred" => sub {} ; ' ;
test($a =~ /^`fred' is not an overloadable type at/); # 213
}
{
# check the `$_[1]' is not a code reference warning
my $a = "" ;
local $SIG{__WARN__} = sub {$a = $_[0]} ;
$x = eval ' overload::constant "integer" => 1; ' ;
test($a eq "") ; # 214
use warnings 'overload' ;
$x = eval ' overload::constant "integer" => 1; ' ;
test($a =~ /^`1' is not a code reference at/); # 215
}
{
my $c = 0;
package ov_int1;
use overload '""' => sub { 3+shift->[0] },
'0+' => sub { 10+shift->[0] },
'int' => sub { 100+shift->[0] };
sub new {my $p = shift; bless [shift], $p}
package ov_int2;
use overload '""' => sub { 5+shift->[0] },
'0+' => sub { 30+shift->[0] },
'int' => sub { 'ov_int1'->new(1000+shift->[0]) };
sub new {my $p = shift; bless [shift], $p}
package noov_int;
use overload '""' => sub { 2+shift->[0] },
'0+' => sub { 9+shift->[0] };
sub new {my $p = shift; bless [shift], $p}
package main;
my $x = new noov_int 11;
my $int_x = int $x;
main::test("$int_x" eq 20); # 216
$x = new ov_int1 31;
$int_x = int $x;
main::test("$int_x" eq 131); # 217
$x = new ov_int2 51;
$int_x = int $x;
main::test("$int_x" eq 1054); # 218
}
# make sure that we don't inifinitely recurse
{
my $c = 0;
package Recurse;
use overload '""' => sub { shift },
'0+' => sub { shift },
'bool' => sub { shift },
fallback => 1;
my $x = bless([]);
main::test("$x" =~ /Recurse=ARRAY/); # 219
main::test($x); # 220
main::test($x+0 =~ /Recurse=ARRAY/); # 221
}
# BugID 20010422.003
package Foo;
use overload
'bool' => sub { return !$_[0]->is_zero() || undef; }
;
sub is_zero
{
my $self = shift;
return $self->{var} == 0;
}
sub new
{
my $class = shift;
my $self = {};
$self->{var} = shift;
bless $self,$class;
}
package main;
use strict;
my $r = Foo->new(8);
$r = Foo->new(0);
test(($r || 0) == 0); # 222
package utf8_o;
use overload
'""' => sub { return $_[0]->{var}; }
;
sub new
{
my $class = shift;
my $self = {};
$self->{var} = shift;
bless $self,$class;
}
package main;
my $utfvar = new utf8_o 200.2.1;
test("$utfvar" eq 200.2.1); # 223 - stringify
test("a$utfvar" eq "a".200.2.1); # 224 - overload via sv_2pv_flags
# 225..227 -- more %{} tests. Hangs in 5.6.0, okay in later releases.
# Basically this example implements strong encapsulation: if Hderef::import()
# were to eval the overload code in the caller's namespace, the privatisation
# would be quite transparent.
package Hderef;
use overload '%{}' => sub { (caller(0))[0] eq 'Foo' ? $_[0] : die "zap" };
package Foo;
@Foo::ISA = 'Hderef';
sub new { bless {}, shift }
sub xet { @_ == 2 ? $_[0]->{$_[1]} :
@_ == 3 ? ($_[0]->{$_[1]} = $_[2]) : undef }
package main;
my $a = Foo->new;
$a->xet('b', 42);
print $a->xet('b') == 42 ? "ok 225\n" : "not ok 225\n";
print defined eval { $a->{b} } ? "not ok 226\n" : "ok 226\n";
print $@ =~ /zap/ ? "ok 227\n" : "not ok 227\n";
print overload::StrVal(qr/a/) =~ /^Regexp=SCALAR\(0x[0-9a-f]+\)$/ ? "ok 228\n" : "not ok 228\n";
{
package t229;
use overload '=' => sub { 42 },
'++' => sub { my $x = ${$_[0]}; $_[0] };
sub new { my $x = 42; bless \$x }
my $warn;
{
local $SIG{__WARN__} = sub { $warn++ };
my $x = t229->new;
my $y = $x;
eval { $y++ };
}
print $warn ? "not ok 229\n" : "ok 229\n";
}
{
package Numify;
use overload (qw(0+ numify fallback 1));
sub new {
my $val = $_[1];
bless \$val, $_[0];
}
sub numify { ${$_[0]} }
}
# These are all check that overloaded values rather than reference addressess
# are what is getting tested.
my ($two, $one, $un, $deux) = map {new Numify $_} 2, 1, 1, 2;
my ($ein, $zwei) = (1, 2);
my %map = (one => 1, un => 1, ein => 1, deux => 2, two => 2, zwei => 2);
foreach my $op (qw(<=> == != < <= > >=)) {
foreach my $l (keys %map) {
foreach my $r (keys %map) {
my $ocode = "\$$l $op \$$r";
my $rcode = "$map{$l} $op $map{$r}";
my $got = eval $ocode;
die if $@;
my $expect = eval $rcode;
die if $@;
test ($got, $expect, $ocode) or print "# $rcode\n";
}
}
}
# Last test is:
sub last {476}