#!./perl
-print "1..72\n";
+BEGIN {
+ chdir 't' if -d 't';
+ @INC = ('.', '../lib');
+ require 'test.pl';
+}
+
+plan (135);
#
# @foo, @bar, and @ary are also used from tie-stdarray after tie-ing them
#
@ary = (1,2,3,4,5);
-if (join('',@ary) eq '12345') {print "ok 1\n";} else {print "not ok 1\n";}
+is(join('',@ary), '12345');
$tmp = $ary[$#ary]; --$#ary;
-if ($tmp == 5) {print "ok 2\n";} else {print "not ok 2\n";}
-if ($#ary == 3) {print "ok 3\n";} else {print "not ok 3\n";}
-if (join('',@ary) eq '1234') {print "ok 4\n";} else {print "not ok 4\n";}
-
-$[ = 1;
-@ary = (1,2,3,4,5);
-if (join('',@ary) eq '12345') {print "ok 5\n";} else {print "not ok 5\n";}
-
-$tmp = $ary[$#ary]; --$#ary;
-if ($tmp == 5) {print "ok 6\n";} else {print "not ok 6\n";}
-if ($#ary == 4) {print "ok 7\n";} else {print "not ok 7\n";}
-if (join('',@ary) eq '1234') {print "ok 8\n";} else {print "not ok 8\n";}
-
-if ($ary[5] eq '') {print "ok 9\n";} else {print "not ok 9\n";}
+is($tmp, 5);
+is($#ary, 3);
+is(join('',@ary), '1234');
-$#ary += 1; # see if element 5 gone for good
-if ($#ary == 5) {print "ok 10\n";} else {print "not ok 10\n";}
-if (defined $ary[5]) {print "not ok 11\n";} else {print "ok 11\n";}
-
-$[ = 0;
@foo = ();
$r = join(',', $#foo, @foo);
-if ($r eq "-1") {print "ok 12\n";} else {print "not ok 12 $r\n";}
+is($r, "-1");
$foo[0] = '0';
$r = join(',', $#foo, @foo);
-if ($r eq "0,0") {print "ok 13\n";} else {print "not ok 13 $r\n";}
+is($r, "0,0");
$foo[2] = '2';
$r = join(',', $#foo, @foo);
-if ($r eq "2,0,,2") {print "ok 14\n";} else {print "not ok 14 $r\n";}
+is($r, "2,0,,2");
@bar = ();
$bar[0] = '0';
$bar[1] = '1';
$r = join(',', $#bar, @bar);
-if ($r eq "1,0,1") {print "ok 15\n";} else {print "not ok 15 $r\n";}
+is($r, "1,0,1");
@bar = ();
$r = join(',', $#bar, @bar);
-if ($r eq "-1") {print "ok 16\n";} else {print "not ok 16 $r\n";}
+is($r, "-1");
$bar[0] = '0';
$r = join(',', $#bar, @bar);
-if ($r eq "0,0") {print "ok 17\n";} else {print "not ok 17 $r\n";}
+is($r, "0,0");
$bar[2] = '2';
$r = join(',', $#bar, @bar);
-if ($r eq "2,0,,2") {print "ok 18\n";} else {print "not ok 18 $r\n";}
-reset 'b';
+is($r, "2,0,,2");
+reset 'b' if $^O ne 'VMS';
@bar = ();
$bar[0] = '0';
$r = join(',', $#bar, @bar);
-if ($r eq "0,0") {print "ok 19\n";} else {print "not ok 19 $r\n";}
+is($r, "0,0");
$bar[2] = '2';
$r = join(',', $#bar, @bar);
-if ($r eq "2,0,,2") {print "ok 20\n";} else {print "not ok 20 $r\n";}
+is($r, "2,0,,2");
$foo = 'now is the time';
-if (($F1,$F2,$Etc) = ($foo =~ /^(\S+)\s+(\S+)\s*(.*)/)) {
- if ($F1 eq 'now' && $F2 eq 'is' && $Etc eq 'the time') {
- print "ok 21\n";
- }
- else {
- print "not ok 21\n";
- }
-}
-else {
- print "not ok 21\n";
-}
+ok(scalar (($F1,$F2,$Etc) = ($foo =~ /^(\S+)\s+(\S+)\s*(.*)/)));
+is($F1, 'now');
+is($F2, 'is');
+is($Etc, 'the time');
$foo = 'lskjdf';
-if ($cnt = (($F1,$F2,$Etc) = ($foo =~ /^(\S+)\s+(\S+)\s*(.*)/))) {
- print "not ok 22 $cnt $F1:$F2:$Etc\n";
-}
-else {
- print "ok 22\n";
-}
+ok(!($cnt = (($F1,$F2,$Etc) = ($foo =~ /^(\S+)\s+(\S+)\s*(.*)/))))
+ or diag("$cnt $F1:$F2:$Etc");
%foo = ('blurfl','dyick','foo','bar','etc.','etc.');
%bar = %foo;
-print $bar{'foo'} eq 'bar' ? "ok 23\n" : "not ok 23\n";
+is($bar{'foo'}, 'bar');
%bar = ();
-print $bar{'foo'} eq '' ? "ok 24\n" : "not ok 24\n";
+is($bar{'foo'}, undef);
(%bar,$a,$b) = (%foo,'how','now');
-print $bar{'foo'} eq 'bar' ? "ok 25\n" : "not ok 25\n";
-print $bar{'how'} eq 'now' ? "ok 26\n" : "not ok 26\n";
+is($bar{'foo'}, 'bar');
+is($bar{'how'}, 'now');
@bar{keys %foo} = values %foo;
-print $bar{'foo'} eq 'bar' ? "ok 27\n" : "not ok 27\n";
-print $bar{'how'} eq 'now' ? "ok 28\n" : "not ok 28\n";
+is($bar{'foo'}, 'bar');
+is($bar{'how'}, 'now');
@foo = grep(/e/,split(' ','now is the time for all good men to come to'));
-print join(' ',@foo) eq 'the time men come' ? "ok 29\n" : "not ok 29\n";
+is(join(' ',@foo), 'the time men come');
@foo = grep(!/e/,split(' ','now is the time for all good men to come to'));
-print join(' ',@foo) eq 'now is for all good to to' ? "ok 30\n" : "not ok 30\n";
+is(join(' ',@foo), 'now is for all good to to');
$foo = join('',('a','b','c','d','e','f')[0..5]);
-print $foo eq 'abcdef' ? "ok 31\n" : "not ok 31\n";
+is($foo, 'abcdef');
$foo = join('',('a','b','c','d','e','f')[0..1]);
-print $foo eq 'ab' ? "ok 32\n" : "not ok 32\n";
+is($foo, 'ab');
$foo = join('',('a','b','c','d','e','f')[6]);
-print $foo eq '' ? "ok 33\n" : "not ok 33\n";
+is($foo, '');
@foo = ('a','b','c','d','e','f')[0,2,4];
@bar = ('a','b','c','d','e','f')[1,3,5];
$foo = join('',(@foo,@bar)[0..5]);
-print $foo eq 'acebdf' ? "ok 34\n" : "not ok 34\n";
+is($foo, 'acebdf');
$foo = ('a','b','c','d','e','f')[0,2,4];
-print $foo eq 'e' ? "ok 35\n" : "not ok 35\n";
+is($foo, 'e');
$foo = ('a','b','c','d','e','f')[1];
-print $foo eq 'b' ? "ok 36\n" : "not ok 36\n";
+is($foo, 'b');
@foo = ( 'foo', 'bar', 'burbl');
-push(foo, 'blah');
-print $#foo == 3 ? "ok 37\n" : "not ok 37\n";
+{
+ no warnings 'deprecated';
+ push(foo, 'blah');
+}
+is($#foo, 3);
# various AASSIGN_COMMON checks (see newASSIGNOP() in op.c)
-$test = 37;
-sub t { ++$test; print "not " unless $_[0]; print "ok $test\n"; }
+#curr_test(38);
@foo = @foo;
-t("@foo" eq "foo bar burbl blah"); # 38
+is("@foo", "foo bar burbl blah"); # 38
(undef,@foo) = @foo;
-t("@foo" eq "bar burbl blah"); # 39
+is("@foo", "bar burbl blah"); # 39
@foo = ('XXX',@foo, 'YYY');
-t("@foo" eq "XXX bar burbl blah YYY"); # 40
+is("@foo", "XXX bar burbl blah YYY"); # 40
@foo = @foo = qw(foo b\a\r bu\\rbl blah);
-t("@foo" eq 'foo b\a\r bu\\rbl blah'); # 41
+is("@foo", 'foo b\a\r bu\\rbl blah'); # 41
@bar = @foo = qw(foo bar); # 42
-t("@foo" eq "foo bar");
-t("@bar" eq "foo bar"); # 43
+is("@foo", "foo bar");
+is("@bar", "foo bar"); # 43
# try the same with local
# XXX tie-stdarray fails the tests involving local, so we use
{
local @bee = @bee;
- t("@bee" eq "foo bar burbl blah"); # 44
+ is("@bee", "foo bar burbl blah"); # 44
{
local (undef,@bee) = @bee;
- t("@bee" eq "bar burbl blah"); # 45
+ is("@bee", "bar burbl blah"); # 45
{
local @bee = ('XXX',@bee,'YYY');
- t("@bee" eq "XXX bar burbl blah YYY"); # 46
+ is("@bee", "XXX bar burbl blah YYY"); # 46
{
local @bee = local(@bee) = qw(foo bar burbl blah);
- t("@bee" eq "foo bar burbl blah"); # 47
+ is("@bee", "foo bar burbl blah"); # 47
{
local (@bim) = local(@bee) = qw(foo bar);
- t("@bee" eq "foo bar"); # 48
- t("@bim" eq "foo bar"); # 49
+ is("@bee", "foo bar"); # 48
+ is("@bim", "foo bar"); # 49
}
- t("@bee" eq "foo bar burbl blah"); # 50
+ is("@bee", "foo bar burbl blah"); # 50
}
- t("@bee" eq "XXX bar burbl blah YYY"); # 51
+ is("@bee", "XXX bar burbl blah YYY"); # 51
}
- t("@bee" eq "bar burbl blah"); # 52
+ is("@bee", "bar burbl blah"); # 52
}
- t("@bee" eq "foo bar burbl blah"); # 53
+ is("@bee", "foo bar burbl blah"); # 53
}
# try the same with my
{
-
my @bee = @bee;
- t("@bee" eq "foo bar burbl blah"); # 54
+ is("@bee", "foo bar burbl blah"); # 54
{
my (undef,@bee) = @bee;
- t("@bee" eq "bar burbl blah"); # 55
+ is("@bee", "bar burbl blah"); # 55
{
my @bee = ('XXX',@bee,'YYY');
- t("@bee" eq "XXX bar burbl blah YYY"); # 56
+ is("@bee", "XXX bar burbl blah YYY"); # 56
{
my @bee = my @bee = qw(foo bar burbl blah);
- t("@bee" eq "foo bar burbl blah"); # 57
+ is("@bee", "foo bar burbl blah"); # 57
{
my (@bim) = my(@bee) = qw(foo bar);
- t("@bee" eq "foo bar"); # 58
- t("@bim" eq "foo bar"); # 59
+ is("@bee", "foo bar"); # 58
+ is("@bim", "foo bar"); # 59
+ }
+ is("@bee", "foo bar burbl blah"); # 60
+ }
+ is("@bee", "XXX bar burbl blah YYY"); # 61
+ }
+ is("@bee", "bar burbl blah"); # 62
+ }
+ is("@bee", "foo bar burbl blah"); # 63
+}
+
+# try the same with our (except that previous values aren't restored)
+{
+ our @bee = @bee;
+ is("@bee", "foo bar burbl blah");
+ {
+ our (undef,@bee) = @bee;
+ is("@bee", "bar burbl blah");
+ {
+ our @bee = ('XXX',@bee,'YYY');
+ is("@bee", "XXX bar burbl blah YYY");
+ {
+ our @bee = our @bee = qw(foo bar burbl blah);
+ is("@bee", "foo bar burbl blah");
+ {
+ our (@bim) = our(@bee) = qw(foo bar);
+ is("@bee", "foo bar");
+ is("@bim", "foo bar");
}
- t("@bee" eq "foo bar burbl blah"); # 60
}
- t("@bee" eq "XXX bar burbl blah YYY"); # 61
}
- t("@bee" eq "bar burbl blah"); # 62
}
- t("@bee" eq "foo bar burbl blah"); # 63
}
# make sure reification behaves
-my $t = 63;
-sub reify { $_[1] = ++$t; print "@_\n"; }
+my $t = curr_test();
+sub reify { $_[1] = $t++; print "@_\n"; }
reify('ok');
reify('ok');
-# qw() is no more a runtime split, it's compiletime.
-print "not " unless qw(foo bar snorfle)[2] eq 'snorfle';
-print "ok 66\n";
+curr_test($t);
+
+# qw() is no longer a runtime split, it's compiletime.
+is (qw(foo bar snorfle)[2], 'snorfle');
@ary = (12,23,34,45,56);
-print "not " unless shift(@ary) == 12;
-print "ok 67\n";
+is(shift(@ary), 12);
+is(pop(@ary), 56);
+is(push(@ary,56), 4);
+is(unshift(@ary,12), 5);
+
+sub foo { "a" }
+@foo=(foo())[0,0];
+is ($foo[1], "a");
+
+# bugid #15439 - clearing an array calls destructors which may try
+# to modify the array - caused 'Attempt to free unreferenced scalar'
-print "not " unless pop(@ary) == 56;
-print "ok 68\n";
+my $got = runperl (
+ prog => q{
+ sub X::DESTROY { @a = () }
+ @a = (bless {}, q{X});
+ @a = ();
+ },
+ stderr => 1
+ );
-print "not " unless push(@ary,56) == 4;
-print "ok 69\n";
+$got =~ s/\n/ /g;
+is ($got, '');
-print "not " unless unshift(@ary,12) == 5;
-print "ok 70\n";
+# Test negative and funky indices.
-sub foo { "a" }
-@foo=(foo())[0,0];
-$foo[1] eq "a" or print "not ";
-print "ok 71\n";
-# $[ should have the same effect regardless of whether the aelem
-# op is optimized to aelemfast.
+{
+ my @a = 0..4;
+ is($a[-1], 4);
+ is($a[-2], 3);
+ is($a[-5], 0);
+ ok(!defined $a[-6]);
+
+ is($a[2.1] , 2);
+ is($a[2.9] , 2);
+ is($a[undef], 0);
+ is($a["3rd"], 3);
+}
+
+
+{
+ my @a;
+ eval '$a[-1] = 0';
+ like($@, qr/Modification of non-creatable array value attempted, subscript -1/, "\$a[-1] = 0");
+}
+
+sub test_arylen {
+ my $ref = shift;
+ local $^W = 1;
+ is ($$ref, undef, "\$# on freed array is undef");
+ my @warn;
+ local $SIG{__WARN__} = sub {push @warn, "@_"};
+ $$ref = 1000;
+ is (scalar @warn, 1);
+ like ($warn[0], qr/^Attempt to set length of freed array/);
+}
+
+{
+ my $a = \$#{[]};
+ # Need a new statement to make it go out of scope
+ test_arylen ($a);
+ test_arylen (do {my @a; \$#a});
+}
+
+{
+ use vars '@array';
+
+ my $outer = \$#array;
+ is ($$outer, -1);
+ is (scalar @array, 0);
+
+ $$outer = 3;
+ is ($$outer, 3);
+ is (scalar @array, 4);
+
+ my $ref = \@array;
+
+ my $inner;
+ {
+ local @array;
+ $inner = \$#array;
+
+ is ($$inner, -1);
+ is (scalar @array, 0);
+ $$outer = 6;
+
+ is (scalar @$ref, 7);
+
+ is ($$inner, -1);
+ is (scalar @array, 0);
+
+ $$inner = 42;
+ }
+
+ is (scalar @array, 7);
+ is ($$outer, 6);
+
+ is ($$inner, undef, "orphaned $#foo is always undef");
+
+ is (scalar @array, 7);
+ is ($$outer, 6);
+
+ $$inner = 1;
+
+ is (scalar @array, 7);
+ is ($$outer, 6);
+
+ $$inner = 503; # Bang!
+
+ is (scalar @array, 7);
+ is ($$outer, 6);
+}
+
+{
+ # Bug #36211
+ use vars '@array';
+ for (1,2) {
+ {
+ local @a;
+ is ($#a, -1);
+ @a=(1..4)
+ }
+ }
+}
+
+{
+ # Bug #37350
+ my @array = (1..4);
+ $#{@array} = 7;
+ is ($#{4}, 7);
+
+ my $x;
+ $#{$x} = 3;
+ is(scalar @$x, 4);
+
+ push @{@array}, 23;
+ is ($4[8], 23);
+}
+{
+ # Bug #37350 -- once more with a global
+ use vars '@array';
+ @array = (1..4);
+ $#{@array} = 7;
+ is ($#{4}, 7);
+
+ my $x;
+ $#{$x} = 3;
+ is(scalar @$x, 4);
+
+ push @{@array}, 23;
+ is ($4[8], 23);
+}
+
+# more tests for AASSIGN_COMMON
+
+{
+ our($x,$y,$z) = (1..3);
+ our($y,$z) = ($x,$y);
+ is("$x $y $z", "1 1 2");
+}
+{
+ our($x,$y,$z) = (1..3);
+ (our $y, our $z) = ($x,$y);
+ is("$x $y $z", "1 1 2");
+}
+{
+ # AASSIGN_COMMON detection with logical operators
+ my $true = 1;
+ our($x,$y,$z) = (1..3);
+ (our $y, our $z) = $true && ($x,$y);
+ is("$x $y $z", "1 1 2");
+}
+
+# [perl #70171]
+{
+ my $x = get_x(); my %x = %$x; sub get_x { %x=(1..4); return \%x };
+ is(
+ join(" ", map +($_,$x{$_}), sort keys %x), "1 2 3 4",
+ 'bug 70171 (self-assignment via my %x = %$x)'
+ );
+ my $y = get_y(); my @y = @$y; sub get_y { @y=(1..4); return \@y };
+ is(
+ "@y", "1 2 3 4",
+ 'bug 70171 (self-assignment via my @x = @$x)'
+ );
+}
+
+# [perl #70171], [perl #82110]
+{
+ my ($i, $ra, $rh);
+ again:
+ my @a = @$ra; # common assignment on 2nd attempt
+ my %h = %$rh; # common assignment on 2nd attempt
+ @a = qw(1 2 3 4);
+ %h = qw(a 1 b 2 c 3 d 4);
+ $ra = \@a;
+ $rh = \%h;
+ goto again unless $i++;
+
+ is("@a", "1 2 3 4",
+ 'bug 70171 (self-assignment via my @x = @$x) - goto variant'
+ );
+ is(
+ join(" ", map +($_,$h{$_}), sort keys %h), "a 1 b 2 c 3 d 4",
+ 'bug 70171 (self-assignment via my %x = %$x) - goto variant'
+ );
+}
+
+
+*trit = *scile; $trit[0];
+ok(1, 'aelem_fast on a nonexistent array does not crash');
+
+# [perl #107440]
+sub A::DESTROY { $::ra = 0 }
+$::ra = [ bless [], 'A' ];
+undef @$::ra;
+pass 'no crash when freeing array that is being undeffed';
+$::ra = [ bless [], 'A' ];
+@$::ra = ('a'..'z');
+pass 'no crash when freeing array that is being cleared';
+
+# [perl #85670] Copying magic to elements
+SKIP: {
+ skip "no Scalar::Util::weaken on miniperl", 1, if is_miniperl;
+ require Scalar::Util;
+ package glelp {
+ Scalar::Util::weaken ($a = \@ISA);
+ @ISA = qw(Foo);
+ Scalar::Util::weaken ($a = \$ISA[0]);
+ ::is @ISA, 1, 'backref magic is not copied to elements';
+ }
+}
+package peen {
+ $#ISA = -1;
+ @ISA = qw(Foo);
+ $ISA[0] = qw(Sphare);
+
+ sub Sphare::pling { 'pling' }
-sub tary {
- local $[ = 10;
- my $five = 5;
- print "not " unless $tary[5] == $tary[$five];
- print "ok 72\n";
+ ::is eval { pling peen }, 'pling',
+ 'arylen_p magic does not stop isa magic from being copied';
}
-@tary = (0..50);
-tary();
+# Test that &PL_sv_undef is not special in arrays
+sub {
+ ok exists $_[0],
+ 'exists returns true for &PL_sv_undef elem [perl #7508]';
+ is \$_[0], \undef, 'undef preserves identity in array [perl #109726]';
+}->(undef);
+
+# [perl #118691]
+@plink=@plunk=();
+$plink[3] = 1;
+sub {
+ $_[0] = 2;
+ is $plink[0], 2, '@_ alias to nonexistent elem within array';
+ $_[1] = 3;
+ is $plink[1], 3, '@_ alias to nonexistent neg index within array';
+ is $_[2], undef, 'reading alias to negative index past beginning';
+ eval { $_[2] = 42 };
+ like $@, qr/Modification of non-creatable array value attempted, (?x:
+ )subscript -5/,
+ 'error when setting alias to negative index past beginning';
+ is $_[3], undef, 'reading alias to -1 elem of empty array';
+ eval { $_[3] = 42 };
+ like $@, qr/Modification of non-creatable array value attempted, (?x:
+ )subscript -1/,
+ 'error when setting alias to -1 elem of empty array';
+}->($plink[0], $plink[-2], $plink[-5], $plunk[-1]);
+
+
+"We're included by lib/Tie/Array/std.t so we need to return something true";
https://perl5.git.perl.org / perl5.git / blobdiff