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
|
#!./perl
BEGIN {
chdir 't' if -d 't';
@INC = qw(. ../lib);
}
require "test.pl";
plan( tests => 38 );
# delete() on hash elements
$foo{1} = 'a';
$foo{2} = 'b';
$foo{3} = 'c';
$foo{4} = 'd';
$foo{5} = 'e';
$foo = delete $foo{2};
cmp_ok($foo,'eq','b','delete 2');
ok(!(exists $foo{2}),'b absent');
cmp_ok($foo{1},'eq','a','a exists');
cmp_ok($foo{3},'eq','c','c exists');
cmp_ok($foo{4},'eq','d','d exists');
cmp_ok($foo{5},'eq','e','e exists');
@foo = delete @foo{4, 5};
cmp_ok(scalar(@foo),'==',2,'deleted slice');
cmp_ok($foo[0],'eq','d','slice 1');
cmp_ok($foo[1],'eq','e','slice 2');
ok(!(exists $foo{4}),'d absent');
ok(!(exists $foo{5}),'e absent');
cmp_ok($foo{1},'eq','a','a still exists');
cmp_ok($foo{3},'eq','c','c still exists');
$foo = join('',values(%foo));
ok($foo eq 'ac' || $foo eq 'ca','remaining keys');
foreach $key (keys %foo) {
delete $foo{$key};
}
$foo{'foo'} = 'x';
$foo{'bar'} = 'y';
$foo = join('',values(%foo));
ok($foo eq 'xy' || $foo eq 'yx','fresh keys');
$refhash{"top"}->{"foo"} = "FOO";
$refhash{"top"}->{"bar"} = "BAR";
delete $refhash{"top"}->{"bar"};
@list = keys %{$refhash{"top"}};
cmp_ok("@list",'eq',"foo", 'autoviv and delete hashref');
{
my %a = ('bar', 33);
my($a) = \(values %a);
my $b = \$a{bar};
my $c = \delete $a{bar};
ok($a == $b && $b == $c,'a b c equivalent');
}
# delete() on array elements
@foo = ();
$foo[1] = 'a';
$foo[2] = 'b';
$foo[3] = 'c';
$foo[4] = 'd';
$foo[5] = 'e';
$foo = delete $foo[2];
cmp_ok($foo,'eq','b','ary delete 2');
ok(!(exists $foo[2]),'ary b absent');
cmp_ok($foo[1],'eq','a','ary a exists');
cmp_ok($foo[3],'eq','c','ary c exists');
cmp_ok($foo[4],'eq','d','ary d exists');
cmp_ok($foo[5],'eq','e','ary e exists');
@bar = delete @foo[4,5];
cmp_ok(scalar(@bar),'==',2,'ary deleted slice');
cmp_ok($bar[0],'eq','d','ary slice 1');
cmp_ok($bar[1],'eq','e','ary slice 2');
ok(!(exists $foo[4]),'ary d absent');
ok(!(exists $foo[5]),'ary e absent');
cmp_ok($foo[1],'eq','a','ary a still exists');
cmp_ok($foo[3],'eq','c','ary c still exists');
$foo = join('',@foo);
cmp_ok($foo,'eq','ac','ary elems');
cmp_ok(scalar(@foo),'==',4,'four is the number thou shalt count');
foreach $key (0 .. $#foo) {
delete $foo[$key];
}
cmp_ok(scalar(@foo),'==',0,'and then there were none');
$foo[0] = 'x';
$foo[1] = 'y';
$foo = "@foo";
cmp_ok($foo,'eq','x y','two fresh');
$refary[0]->[0] = "FOO";
$refary[0]->[3] = "BAR";
delete $refary[0]->[3];
cmp_ok( scalar(@{$refary[0]}),'==',1,'one down');
{
my @a = 33;
my($a) = \(@a);
my $b = \$a[0];
my $c = \delete $a[bar];
ok($a == $b && $b == $c,'a b c also equivalent');
}
{
my %h;
my ($x,$y) = (1, scalar delete @h{()});
ok(!defined($y),q([perl #29127] scalar delete of empty slice returned garbage));
}
{
my $x = 0;
sub X::DESTROY { $x++ }
{
my @a;
$a[0] = bless [], 'X';
my $y = delete $a[0];
}
cmp_ok($x,'==',1,q([perl #30733] array delete didn't free returned element));
}
|