7 if (($Config::Config{'extensions'} !~ m!\bList/Util\b!) ){
8 print "1..0 # Skip -- Perl configured without List::Util module\n";
15 # Anonymous subroutines:
16 '+' => sub {new Oscalar $ {$_[0]}+$_[1]},
17 '-' => sub {new Oscalar
18 $_[2]? $_[1]-${$_[0]} : ${$_[0]}-$_[1]},
19 '<=>' => sub {new Oscalar
20 $_[2]? $_[1]-${$_[0]} : ${$_[0]}-$_[1]},
21 'cmp' => sub {new Oscalar
22 $_[2]? ($_[1] cmp ${$_[0]}) : (${$_[0]} cmp $_[1])},
23 '*' => sub {new Oscalar ${$_[0]}*$_[1]},
24 '/' => sub {new Oscalar
25 $_[2]? $_[1]/${$_[0]} :
27 '%' => sub {new Oscalar
28 $_[2]? $_[1]%${$_[0]} : ${$_[0]}%$_[1]},
29 '**' => sub {new Oscalar
30 $_[2]? $_[1]**${$_[0]} : ${$_[0]}-$_[1]},
34 0+ numify) # Order of arguments unsignificant
42 sub stringify { "${$_[0]}" }
43 sub numify { 0 + "${$_[0]}" } # Not needed, additional overhead
44 # comparing to direct compilation based on
51 print "1..",&last,"\n";
57 $comment = " # " . $_ [2] if @_ > 2;
59 print "ok $test$comment\n";
61 $comment .= ": '$_[0]' ne '$_[1]'";
62 print "not ok $test$comment\n";
68 print "not ok $test\n";
73 $a = new Oscalar "087";
76 # All test numbers in comments are off by 1.
77 # So much for hard-wiring them in :-) To fix this:
81 test ($b eq "087"); # 3
82 test (ref $a eq "Oscalar"); # 4
84 test ($a eq "087"); # 6
88 test (ref $c eq "Oscalar"); # 7
89 test (!($c eq $a)); # 8
90 test ($c eq "94"); # 9
94 test (ref $a eq "Oscalar"); # 10
98 test (ref $b eq "Oscalar"); # 11
99 test ( $a eq "087"); # 12
100 test ( $b eq "88"); # 13
101 test (ref $a eq "Oscalar"); # 14
106 test (ref $c eq "Oscalar"); # 15
107 test ( $a eq "087"); # 16
108 test ( $c eq "1"); # 17
109 test (ref $a eq "Oscalar"); # 18
114 test (ref $b eq "Oscalar"); # 19
115 test ( $a eq "087"); # 20
116 test ( $b eq "88"); # 21
117 test (ref $a eq "Oscalar"); # 22
119 eval q[ package Oscalar; use overload ('++' => sub { $ {$_[0]}++;$_[0] } ) ];
123 test (ref $a eq "Oscalar"); # 23
127 test (ref $b eq "Oscalar"); # 24
128 test ( $a eq "087"); # 25
129 test ( $b eq "88"); # 26
130 test (ref $a eq "Oscalar"); # 27
133 $dummy=bless \$dummy; # Now cache of method should be reloaded
139 test (ref $b eq "Oscalar"); # 28
140 test ( $a eq "087"); # 29
141 test ( $b eq "88"); # 30
142 test (ref $a eq "Oscalar"); # 31
144 undef $b; # Destroying updates tables too...
146 eval q[package Oscalar; use overload ('++' => sub { $ {$_[0]} += 2; $_[0] } ) ];
150 test (ref $a eq "Oscalar"); # 32
154 test (ref $b eq "Oscalar"); # 33
155 test ( $a eq "087"); # 34
156 test ( $b eq "88"); # 35
157 test (ref $a eq "Oscalar"); # 36
160 $dummy=bless \$dummy; # Now cache of method should be reloaded
165 test (ref $b eq "Oscalar"); # 37
166 test ( $a eq "087"); # 38
167 test ( $b eq "90"); # 39
168 test (ref $a eq "Oscalar"); # 40
173 test (ref $b eq "Oscalar"); # 41
174 test ( $a eq "087"); # 42
175 test ( $b eq "89"); # 43
176 test (ref $a eq "Oscalar"); # 44
181 eval q[ package Oscalar; use overload ('=' => sub {$main::copies++;
183 local $new=$ {$_[0]};
188 test (ref $b eq "Oscalar"); # 46
189 test ( $a eq "087"); # 47
190 test ( $b eq "087"); # 48
191 test (ref $a eq "Oscalar"); # 49
195 test (ref $b eq "Oscalar"); # 50
196 test ( $a eq "087"); # 51
197 test ( $b eq "89"); # 52
198 test (ref $a eq "Oscalar"); # 53
199 test ($copies == 0); # 54
203 test (ref $b eq "Oscalar"); # 55
204 test ( $a eq "087"); # 56
205 test ( $b eq "90"); # 57
206 test (ref $a eq "Oscalar"); # 58
207 test ($copies == 0); # 59
212 test (ref $b eq "Oscalar"); # 60
213 test ( $a eq "087"); # 61
214 test ( $b eq "88"); # 62
215 test (ref $a eq "Oscalar"); # 63
216 test ($copies == 0); # 64
221 test (ref $b eq "Oscalar") || print ref $b,"=ref(b)\n"; # 65
222 test ( $a eq "087"); # 66
223 test ( $b eq "89"); # 67
224 test (ref $a eq "Oscalar"); # 68
225 test ($copies == 1); # 69
227 eval q[package Oscalar; use overload ('+=' => sub {$ {$_[0]} += 3*$_[1];
229 $c=new Oscalar; # Cause rehash
234 test (ref $b eq "Oscalar"); # 70
235 test ( $a eq "087"); # 71
236 test ( $b eq "90"); # 72
237 test (ref $a eq "Oscalar"); # 73
238 test ($copies == 2); # 74
242 test (ref $b eq "Oscalar"); # 75
243 test ( $b eq "360"); # 76
244 test ($copies == 2); # 77
247 test (ref $b eq "Oscalar"); # 78
248 test ( $b eq "-360"); # 79
249 test ($copies == 2); # 80
253 test (ref $b eq "Oscalar"); # 81
254 test ( $b eq "360"); # 82
255 test ($copies == 2); # 83
259 test (ref $b eq "Oscalar"); # 84
260 test ( $b eq "360"); # 85
261 test ($copies == 2); # 86
263 eval q[package Oscalar;
264 use overload ('x' => sub {new Oscalar ( $_[2] ? "_.$_[1]._" x $ {$_[0]}
265 : "_.${$_[0]}._" x $_[1])}) ];
269 test ($a eq "_.yy.__.yy.__.yy._"); # 87
271 eval q[package Oscalar;
272 use overload ('.' => sub {new Oscalar ( $_[2] ?
273 "_.$_[1].__.$ {$_[0]}._"
274 : "_.$ {$_[0]}.__.$_[1]._")}) ];
278 test ("b${a}c" eq "_._.b.__.xx._.__.c._"); # 88
280 # Check inheritance of overloading;
286 $aI = new OscalarI "$a";
287 test (ref $aI eq "OscalarI"); # 89
288 test ("$aI" eq "xx"); # 90
289 test ($aI eq "xx"); # 91
290 test ("b${aI}c" eq "_._.b.__.xx._.__.c._"); # 92
292 # Here we test blessing to a package updates hash
294 eval "package Oscalar; no overload '.'";
296 test ("b${a}" eq "_.b.__.xx._"); # 93
299 test ("b${a}c" eq "bxxc"); # 94
301 test ("b${a}c" eq "bxxc"); # 95
303 # Negative overloading:
306 test($@ =~ /no method found/); # 96
311 sub { *{"Oscalar::$AUTOLOAD"} = sub {"_!_" . shift() . "_!_"} ;
312 goto &{"Oscalar::$AUTOLOAD"}};
314 eval "package Oscalar; sub comple; use overload '~' => 'comple'";
316 $na = eval { ~$a }; # Hash was not updated
317 test($@ =~ /no method found/); # 97
321 $na = eval { ~$a }; # Hash updated
322 warn "`$na', $@" if $@;
324 test($na eq '_!_xx_!_'); # 99
328 $na = eval { ~$aI }; # Hash was not updated
329 test($@ =~ /no method found/); # 100
337 test($na eq '_!_xx_!_'); # 102
339 eval "package Oscalar; sub rshft; use overload '>>' => 'rshft'";
341 $na = eval { $aI >> 1 }; # Hash was not updated
342 test($@ =~ /no method found/); # 103
348 $na = eval { $aI >> 1 };
352 test($na eq '_!_xx_!_'); # 105
354 # warn overload::Method($a, '0+'), "\n";
355 test (overload::Method($a, '0+') eq \&Oscalar::numify); # 106
356 test (overload::Method($aI,'0+') eq \&Oscalar::numify); # 107
357 test (overload::Overloaded($aI)); # 108
358 test (!overload::Overloaded('overload')); # 109
360 test (! defined overload::Method($aI, '<<')); # 110
361 test (! defined overload::Method($a, '<')); # 111
363 test (overload::StrVal($aI) =~ /^OscalarI=SCALAR\(0x[\da-fA-F]+\)$/); # 112
364 test (overload::StrVal(\$aI) eq "@{[\$aI]}"); # 113
366 # Check overloading by methods (specified deep in the ISA tree).
370 sub Oscalar::lshft {"_<<_" . shift() . "_<<_"}
371 eval "package OscalarI; use overload '<<' => 'lshft', '|' => 'lshft'";
376 bless $aII, 'OscalarII';
377 bless \$fake, 'OscalarI'; # update the hash
378 test(($aI | 3) eq '_<<_xx_<<_'); # 114
380 test(($aII << 3) eq '_<<_087_<<_'); # 115
383 BEGIN { $int = 7; overload::constant 'integer' => sub {$int++; shift}; }
387 test($out, 1024); # 117
392 BEGIN { $q = $qr = 7;
393 overload::constant 'q' => sub {$q++; push @q, shift, ($_[1] || 'none'); shift},
394 'qr' => sub {$qr++; push @qr, shift, ($_[1] || 'none'); shift}; }
397 $out2 = "a\a$foo,\,";
401 test($out, 'foo'); # 118
402 test($out, $foo); # 119
403 test($out1, 'f\'o\\o'); # 120
404 test($out1, $foo1); # 121
405 test($out2, "a\afoo,\,"); # 122
406 test("@q", "foo q f'o\\\\o q a\\a qq ,\\, qq"); # 123
408 test("@qr", "b\\b qq .\\. qq"); # 125
412 $_ = '!<b>!foo!<-.>!';
413 BEGIN { overload::constant 'q' => sub {push @q1, shift, ($_[1] || 'none'); "_<" . (shift) . ">_"},
414 'qr' => sub {push @qr1, shift, ($_[1] || 'none'); "!<" . (shift) . ">!"}; }
417 $out2 = "a\a$foo,\,";
427 s'first part'second part';
428 s/yet another/tail here/;
432 test($out, '_<foo>_'); # 117
433 test($out1, '_<f\'o\\o>_'); # 128
434 test($out2, "_<a\a>_foo_<,\,>_"); # 129
435 test("@q1", "foo q f'o\\\\o q a\\a qq ,\\, qq oups
437 q second part q tail here s A-Z tr a-z tr"); # 130
438 test("@qr1", "b\\b qq .\\. qq try it q first part q yet another qq"); # 131
444 test($c, "bareword"); # 135
447 package symbolic; # Primitive symbolic calculator
448 use overload nomethod => \&wrap, '""' => \&str, '0+' => \&num,
449 '=' => \&cpy, '++' => \&inc, '--' => \&dec;
451 sub new { shift; bless ['n', @_] }
454 bless [@$self], ref $self;
456 sub inc { $_[0] = bless ['++', $_[0], 1]; }
457 sub dec { $_[0] = bless ['--', $_[0], 1]; }
459 my ($obj, $other, $inv, $meth) = @_;
460 if ($meth eq '++' or $meth eq '--') {
461 @$obj = ($meth, (bless [@$obj]), 1); # Avoid circular reference
464 ($obj, $other) = ($other, $obj) if $inv;
465 bless [$meth, $obj, $other];
468 my ($meth, $a, $b) = @{+shift};
469 $a = 'u' unless defined $a;
476 my %subr = ( 'n' => sub {$_[0]} );
477 foreach my $op (split " ", $overload::ops{with_assign}) {
478 $subr{$op} = $subr{"$op="} = eval "sub {shift() $op shift()}";
480 my @bins = qw(binary 3way_comparison num_comparison str_comparison);
481 foreach my $op (split " ", "@overload::ops{ @bins }") {
482 $subr{$op} = eval "sub {shift() $op shift()}";
484 foreach my $op (split " ", "@overload::ops{qw(unary func)}") {
485 $subr{$op} = eval "sub {$op shift()}";
487 $subr{'++'} = $subr{'+'};
488 $subr{'--'} = $subr{'-'};
491 my ($meth, $a, $b) = @{+shift};
492 my $subr = $subr{$meth}
493 or die "Do not know how to ($meth) in symbolic";
494 $a = $a->num if ref $a eq __PACKAGE__;
495 $b = $b->num if ref $b eq __PACKAGE__;
498 sub TIESCALAR { my $pack = shift; $pack->new(@_) }
500 sub nop { } # Around a bug
501 sub vars { my $p = shift; tie($_, $p), $_->nop foreach @_; }
510 my $foo = new symbolic 11;
512 test( (sprintf "%d", $foo), '12');
513 test( (sprintf "%d", $baz), '11');
516 test( (sprintf "%d", $foo), '13');
517 test( (sprintf "%d", $bar), '12');
518 test( (sprintf "%d", $baz), '13');
521 test( (sprintf "%d", $foo), '14');
522 test( (sprintf "%d", $bar), '12');
523 test( (sprintf "%d", $baz), '14');
524 test( (sprintf "%d", $ban), '13');
527 test( (sprintf "%d", $foo), '15');
528 test( (sprintf "%d", $baz), '14');
529 test( "$foo", '[++ [+= [++ [++ [n 11] 1] 1] 1] 1]');
533 my $iter = new symbolic 2;
534 my $side = new symbolic 1;
538 $cnt = $cnt - 1; # The "simple" way
539 $side = (sqrt(1 + $side**2) - 1)/$side;
541 my $pi = $side*(2**($iter+2));
542 test "$side", '[/ [- [sqrt [+ 1 [** [/ [- [sqrt [+ 1 [** [n 1] 2]]] 1] [n 1]] 2]]] 1] [/ [- [sqrt [+ 1 [** [n 1] 2]]] 1] [n 1]]]';
543 test( (sprintf "%f", $pi), '3.182598');
547 my $iter = new symbolic 2;
548 my $side = new symbolic 1;
552 $side = (sqrt(1 + $side**2) - 1)/$side;
554 my $pi = $side*(2**($iter+2));
555 test "$side", '[/ [- [sqrt [+ 1 [** [/ [- [sqrt [+ 1 [** [n 1] 2]]] 1] [n 1]] 2]]] 1] [/ [- [sqrt [+ 1 [** [n 1] 2]]] 1] [n 1]]]';
556 test( (sprintf "%f", $pi), '3.182598');
561 symbolic->vars($a, $b);
562 my $c = sqrt($a**2 + $b**2);
564 test( (sprintf "%d", $c), '5');
566 test( (sprintf "%d", $c), '13');
570 package symbolic1; # Primitive symbolic calculator
572 use overload nomethod => \&wrap, '""' => \&str, '0+' => \&num, '=' => \&cpy;
574 sub new { shift; bless ['n', @_] }
577 bless [@$self], ref $self;
580 my ($obj, $other, $inv, $meth) = @_;
581 if ($meth eq '++' or $meth eq '--') {
582 @$obj = ($meth, (bless [@$obj]), 1); # Avoid circular reference
585 ($obj, $other) = ($other, $obj) if $inv;
586 bless [$meth, $obj, $other];
589 my ($meth, $a, $b) = @{+shift};
590 $a = 'u' unless defined $a;
597 my %subr = ( 'n' => sub {$_[0]} );
598 foreach my $op (split " ", $overload::ops{with_assign}) {
599 $subr{$op} = $subr{"$op="} = eval "sub {shift() $op shift()}";
601 my @bins = qw(binary 3way_comparison num_comparison str_comparison);
602 foreach my $op (split " ", "@overload::ops{ @bins }") {
603 $subr{$op} = eval "sub {shift() $op shift()}";
605 foreach my $op (split " ", "@overload::ops{qw(unary func)}") {
606 $subr{$op} = eval "sub {$op shift()}";
608 $subr{'++'} = $subr{'+'};
609 $subr{'--'} = $subr{'-'};
612 my ($meth, $a, $b) = @{+shift};
613 my $subr = $subr{$meth}
614 or die "Do not know how to ($meth) in symbolic";
615 $a = $a->num if ref $a eq __PACKAGE__;
616 $b = $b->num if ref $b eq __PACKAGE__;
619 sub TIESCALAR { my $pack = shift; $pack->new(@_) }
621 sub nop { } # Around a bug
622 sub vars { my $p = shift; tie($_, $p), $_->nop foreach @_; }
631 my $foo = new symbolic1 11;
633 test( (sprintf "%d", $foo), '12');
634 test( (sprintf "%d", $baz), '11');
637 test( (sprintf "%d", $foo), '13');
638 test( (sprintf "%d", $bar), '12');
639 test( (sprintf "%d", $baz), '13');
642 test( (sprintf "%d", $foo), '14');
643 test( (sprintf "%d", $bar), '12');
644 test( (sprintf "%d", $baz), '14');
645 test( (sprintf "%d", $ban), '13');
648 test( (sprintf "%d", $foo), '15');
649 test( (sprintf "%d", $baz), '14');
650 test( "$foo", '[++ [+= [++ [++ [n 11] 1] 1] 1] 1]');
654 my $iter = new symbolic1 2;
655 my $side = new symbolic1 1;
659 $cnt = $cnt - 1; # The "simple" way
660 $side = (sqrt(1 + $side**2) - 1)/$side;
662 my $pi = $side*(2**($iter+2));
663 test "$side", '[/ [- [sqrt [+ 1 [** [/ [- [sqrt [+ 1 [** [n 1] 2]]] 1] [n 1]] 2]]] 1] [/ [- [sqrt [+ 1 [** [n 1] 2]]] 1] [n 1]]]';
664 test( (sprintf "%f", $pi), '3.182598');
668 my $iter = new symbolic1 2;
669 my $side = new symbolic1 1;
673 $side = (sqrt(1 + $side**2) - 1)/$side;
675 my $pi = $side*(2**($iter+2));
676 test "$side", '[/ [- [sqrt [+ 1 [** [/ [- [sqrt [+ 1 [** [n 1] 2]]] 1] [n 1]] 2]]] 1] [/ [- [sqrt [+ 1 [** [n 1] 2]]] 1] [n 1]]]';
677 test( (sprintf "%f", $pi), '3.182598');
682 symbolic1->vars($a, $b);
683 my $c = sqrt($a**2 + $b**2);
685 test( (sprintf "%d", $c), '5');
687 test( (sprintf "%d", $c), '13');
691 package two_face; # Scalars with separate string and
693 sub new { my $p = shift; bless [@_], $p }
694 use overload '""' => \&str, '0+' => \&num, fallback => 1;
700 my $seven = new two_face ("vii", 7);
701 test( (sprintf "seven=$seven, seven=%d, eight=%d", $seven, $seven+1),
702 'seven=vii, seven=7, eight=8');
703 test( scalar ($seven =~ /i/), '1')
708 use overload 'cmp' => \∁
709 sub new { my ($p, $v) = @_; bless \$v, $p }
710 sub comp { my ($x,$y) = @_; ($$x * 3 % 10) <=> ($$y * 3 % 10) or $$x cmp $$y }
713 my @arr = map sorting->new($_), 0..12;
714 my @sorted1 = sort @arr;
715 my @sorted2 = map $$_, @sorted1;
716 test "@sorted2", '0 10 7 4 1 11 8 5 12 2 9 6 3';
720 use overload '<>' => \&iter;
721 sub new { my ($p, $v) = @_; bless \$v, $p }
722 sub iter { my ($x) = @_; return undef if $$x < 0; return $$x--; }
725 # XXX iterator overload not intended to work with CORE::GLOBAL?
726 if (defined &CORE::GLOBAL::glob) {
732 my $iter = iterator->new(5);
735 $acc .= " $out" while $out = <${iter}>;
736 test $acc, ' 5 4 3 2 1 0'; # 175
737 $iter = iterator->new(5);
738 test scalar <${iter}>, '5'; # 176
740 $acc .= " $out" while $out = <$iter>;
741 test $acc, ' 4 3 2 1 0'; # 177
745 use overload '%{}' => \&hderef, '&{}' => \&cderef,
746 '*{}' => \&gderef, '${}' => \&sderef, '@{}' => \&aderef;
747 sub new { my ($p, $v) = @_; bless \$v, $p }
749 my ($self, $key) = (shift, shift);
750 my $class = ref $self;
751 bless $self, 'deref::dummy'; # Disable overloading of %{}
752 my $out = $self->{$key};
753 bless $self, $class; # Restore overloading
756 sub hderef {shift->deref('h')}
757 sub aderef {shift->deref('a')}
758 sub cderef {shift->deref('c')}
759 sub gderef {shift->deref('g')}
760 sub sderef {shift->deref('s')}
763 my $deref = bless { h => { foo => 5 , fake => 23 },
764 c => sub {return shift() + 34},
770 my @cont = sort %$deref;
771 if ("\t" eq "\011") { # ascii
772 test "@cont", '23 5 fake foo'; # 178
774 else { # ebcdic alpha-numeric sort order
775 test "@cont", 'fake foo 23 5'; # 178
777 my @keys = sort keys %$deref;
778 test "@keys", 'fake foo'; # 179
779 my @val = sort values %$deref;
780 test "@val", '23 5'; # 180
781 test $deref->{foo}, 5; # 181
782 test defined $deref->{bar}, ''; # 182
785 push @keys, $key while $key = each %$deref;
787 test "@keys", 'fake foo'; # 183
788 test exists $deref->{bar}, ''; # 184
789 test exists $deref->{foo}, 1; # 185
791 test $deref->(5), 39; # 186
792 test &$deref(6), 40; # 187
793 sub xxx_goto { goto &$deref }
794 test xxx_goto(7), 41; # 188
795 my $srt = bless { c => sub {$b <=> $a}
798 my @sorted = sort srt 11, 2, 5, 1, 22;
799 test "@sorted", '22 11 5 2 1'; # 189
801 test $$deref, 123; # 190
803 @sorted = sort $srt 11, 2, 5, 1, 22;
804 test "@sorted", '22 11 5 2 1'; # 191
806 test "@$deref", '11 12 13'; # 192
807 test $#$deref, '2'; # 193
810 test $deref->[2], '13'; # 195
814 test $deref->[$l], '12'; # 197
815 # Repeated dereference
816 my $double = bless { h => $deref,
818 test $double->{foo}, 5; # 198
823 use overload '%{}' => \&gethash, '@{}' => sub { ${shift()} };
831 tie %h, ref $self, $self;
835 sub TIEHASH { my $p = shift; bless \ shift, $p }
838 $fields{$_} = $i++ foreach qw{zero one two three};
840 my $self = ${shift()};
841 my $key = $fields{shift()};
842 defined $key or die "Out of band access";
843 $$self->[$key] = shift;
846 my $self = ${shift()};
847 my $key = $fields{shift()};
848 defined $key or die "Out of band access";
853 my $bar = new two_refs 3,4,5,6;
855 test $bar->{two}, 11; # 199
857 test $bar->[3], 13; # 200
864 $bar = new two_refs_o 3,4,5,6;
866 test $bar->{two}, 11; # 201
868 test $bar->[3], 13; # 202
872 use overload '%{}' => sub { ${shift()}->[1] },
873 '@{}' => sub { ${shift()}->[0] };
879 bless \ [$a, \%h], $p;
884 tie %h, ref $self, $self;
888 sub TIEHASH { my $p = shift; bless \ shift, $p }
891 $fields{$_} = $i++ foreach qw{zero one two three};
894 my $key = $fields{shift()};
895 defined $key or die "Out of band access";
900 my $key = $fields{shift()};
901 defined $key or die "Out of band access";
906 $bar = new two_refs_o 3,4,5,6;
908 test $bar->{two}, 11; # 203
910 test $bar->[3], 13; # 204
914 @ISA = ('two_refs1');
917 $bar = new two_refs1_o 3,4,5,6;
919 test $bar->{two}, 11; # 205
921 test $bar->[3], 13; # 206
925 use overload bool => sub { ${+shift} };
929 { my $bbbb = 0; $aaa = bless \$bbbb, B }
934 test 'ok', 'ok'; # 208
936 test 'is not', 'ok'; # 208
939 # check that overload isn't done twice by join
942 use overload '""' => sub { $c++ };
943 my $x = join '', bless([]), 'pq', bless([]);
944 main::test $x, '0pq1'; # 209
947 # Test module-specific warning
949 # check the Odd number of arguments for overload::constant warning
951 local $SIG{__WARN__} = sub {$a = $_[0]} ;
952 $x = eval ' overload::constant "integer" ; ' ;
953 test($a eq "") ; # 210
954 use warnings 'overload' ;
955 $x = eval ' overload::constant "integer" ; ' ;
956 test($a =~ /^Odd number of arguments for overload::constant at/) ; # 211
960 # check the `$_[0]' is not an overloadable type warning
962 local $SIG{__WARN__} = sub {$a = $_[0]} ;
963 $x = eval ' overload::constant "fred" => sub {} ; ' ;
964 test($a eq "") ; # 212
965 use warnings 'overload' ;
966 $x = eval ' overload::constant "fred" => sub {} ; ' ;
967 test($a =~ /^`fred' is not an overloadable type at/); # 213
971 # check the `$_[1]' is not a code reference warning
973 local $SIG{__WARN__} = sub {$a = $_[0]} ;
974 $x = eval ' overload::constant "integer" => 1; ' ;
975 test($a eq "") ; # 214
976 use warnings 'overload' ;
977 $x = eval ' overload::constant "integer" => 1; ' ;
978 test($a =~ /^`1' is not a code reference at/); # 215
984 use overload '""' => sub { 3+shift->[0] },
985 '0+' => sub { 10+shift->[0] },
986 'int' => sub { 100+shift->[0] };
987 sub new {my $p = shift; bless [shift], $p}
990 use overload '""' => sub { 5+shift->[0] },
991 '0+' => sub { 30+shift->[0] },
992 'int' => sub { 'ov_int1'->new(1000+shift->[0]) };
993 sub new {my $p = shift; bless [shift], $p}
996 use overload '""' => sub { 2+shift->[0] },
997 '0+' => sub { 9+shift->[0] };
998 sub new {my $p = shift; bless [shift], $p}
1002 my $x = new noov_int 11;
1004 main::test("$int_x" eq 20); # 216
1005 $x = new ov_int1 31;
1007 main::test("$int_x" eq 131); # 217
1008 $x = new ov_int2 51;
1010 main::test("$int_x" eq 1054); # 218
1013 # make sure that we don't inifinitely recurse
1017 use overload '""' => sub { shift },
1018 '0+' => sub { shift },
1019 'bool' => sub { shift },
1022 main::test("$x" =~ /Recurse=ARRAY/); # 219
1023 main::test($x); # 220
1024 main::test($x+0 =~ /Recurse=ARRAY/); # 221
1027 # BugID 20010422.003
1031 'bool' => sub { return !$_[0]->is_zero() || undef; }
1037 return $self->{var} == 0;
1044 $self->{var} = shift;
1052 my $r = Foo->new(8);
1055 test(($r || 0) == 0); # 222
1060 '""' => sub { return $_[0]->{var}; }
1067 $self->{var} = shift;
1074 my $utfvar = new utf8_o 200.2.1;
1075 test("$utfvar" eq 200.2.1); # 223 - stringify
1076 test("a$utfvar" eq "a".200.2.1); # 224 - overload via sv_2pv_flags
1078 # 225..227 -- more %{} tests. Hangs in 5.6.0, okay in later releases.
1079 # Basically this example implements strong encapsulation: if Hderef::import()
1080 # were to eval the overload code in the caller's namespace, the privatisation
1081 # would be quite transparent.
1083 use overload '%{}' => sub { (caller(0))[0] eq 'Foo' ? $_[0] : die "zap" };
1085 @Foo::ISA = 'Hderef';
1086 sub new { bless {}, shift }
1087 sub xet { @_ == 2 ? $_[0]->{$_[1]} :
1088 @_ == 3 ? ($_[0]->{$_[1]} = $_[2]) : undef }
1092 test ($a->xet('b'), 42);
1093 test (!defined eval { $a->{b} });
1096 test (overload::StrVal(qr/a/) =~ /^Regexp=SCALAR\(0x[0-9a-f]+\)$/);
1100 use overload '=' => sub { 42 },
1101 '++' => sub { my $x = ${$_[0]}; $_[0] };
1102 sub new { my $x = 42; bless \$x }
1106 local $SIG{__WARN__} = sub { $warn++ };
1111 main::test (!$warn);
1115 my ($int, $out1, $out2);
1117 BEGIN { $int = 0; overload::constant 'integer' => sub {$int++; 17}; }
1121 test($int, 2, "#24313"); # 230
1122 test($out1, 17, "#24313"); # 231
1123 test($out2, 17, "#24313"); # 232