#!./perl
chdir 't' if -d 't';
}
print "1..75\n";
# these shouldn't hang
{
sort { for ($_ = 0;; $_++) {} } @a; }
# Beware: in future this may become hairier because of possible
# collation complications: qw(A a B c) can be sorted at least as
# any of the following
#
# A a B b
# A B a b
# a b A B
# a A b B
#
# All the above orders make sense.
#
# That said, EBCDIC sorts all small letters first, as opposed
# to ASCII which sorts all big letters first.
@harry = ('dog','cat','x','Cain','Abel'); @george = ('gone','chased','yz','punished','Axed');
print "# 1: x = '$x', expected = '$expected'\n";
print "# 2: x = '$x', expected = '$expected'\n";
print "# 3: x = '$x', expected = '$expected'\n";
'AbelAxedCaincatchaseddoggonepunishedtoxyz' :
'catchaseddoggonepunishedtoxyzAbelAxedCain' ;
print "# 4: x = '$x', expected = '$expected'\n";
@a = ();
print ("@b" eq "" ? "ok 5\n" : "not ok 5 (@b)\n");
@a = (1);
print ("@b" eq "1" ? "ok 6\n" : "not ok 6 (@b)\n");
@a = (1,2);
print ("@b" eq "2 1" ? "ok 7\n" : "not ok 7 (@b)\n");
@a = (1,2,3);
print ("@b" eq "3 2 1" ? "ok 8\n" : "not ok 8 (@b)\n");
@a = (1,2,3,4);
print ("@b" eq "4 3 2 1" ? "ok 9\n" : "not ok 9 (@b)\n");
@a = (10,2,3,4);
@b = sort {$a <=> $b;} @a; print ("@b" eq "2 3 4 10" ? "ok 10\n" : "not ok 10 (@b)\n");
print "# 11: x = $x, expected = '$expected'\n";
$sub = 'Backwards_stacked'; print "# 12: x = $x, expected = '$expected'\n";
# literals, combinations
print ("@b" eq '1 2 3 4' ? "ok 13\n" : "not ok 13\n"); print "# x = '@b'\n";
print ("@b" eq '1 2 3 4' ? "ok 14\n" : "not ok 14\n"); print "# x = '@b'\n";
print ("@b" eq '1 2 3 4' ? "ok 15\n" : "not ok 15\n"); print "# x = '@b'\n";
print ("@b" eq '1 2 3 4' ? "ok 16\n" : "not ok 16\n"); print "# x = '@b'\n";
# redefining sort sub inside the sort sub should fail
# redefining sort subs outside the sort should not fail
print $@ ? "not ok 18\n" : "ok 18\n";
print ("@b" eq '4 3 2 1' ? "ok 19\n" : "not ok 19 |@b|\n");
{
}
{
eval 'sub twoface { $a <=> $b }';
$a <=> $b;
};
}
print $@ ? "$@" : "not ok 21\n";
eval <<'CODE';
CODE
print $@ ? "not ok 22\n# $@" : "ok 22\n";
# "sort 'one', 'two'" should not try to parse "'one" as a sort sub my @result = sort 'one', 'two';
CODE
print $@ ? "not ok 23\n# $@" : "ok 23\n";
{
print ("@b" eq '4 3 2 1' ? "ok 24\n" : "not ok 24 |@b|\n"); print ("@b" eq '4 3 2 1' ? "ok 25\n" : "not ok 25 |@b|\n"); print ("@b" eq '4 3 2 1' ? "ok 26\n" : "not ok 26 |@b|\n"); print ("@b" eq '4 3 2 1' ? "ok 27\n" : "not ok 27 |@b|\n"); }
{
print ("@b" eq '4 3 2 1' ? "ok 28\n" : "not ok 28 |@b|\n"); print ("@b" eq '4 3 2 1' ? "ok 29\n" : "not ok 29 |@b|\n"); print ("@b" eq '4 3 2 1' ? "ok 30\n" : "not ok 30 |@b|\n"); print ("@b" eq '4 3 2 1' ? "ok 31\n" : "not ok 31 |@b|\n"); }
{
print ("@b" eq '4 3 2 1' ? "ok 32\n" : "not ok 32 |@b|\n"); print ("@b" eq '4 3 2 1' ? "ok 33\n" : "not ok 33 |@b|\n"); print ("@b" eq '4 3 2 1' ? "ok 34\n" : "not ok 34 |@b|\n"); print ("@b" eq '4 3 2 1' ? "ok 35\n" : "not ok 35 |@b|\n"); }
{
print ("@b" eq '4 3 2 1' ? "ok 36\n" : "not ok 36 |@b|\n"); print ("@b" eq '4 3 2 1' ? "ok 37\n" : "not ok 37 |@b|\n"); print ("@b" eq '4 3 2 1' ? "ok 38\n" : "not ok 38 |@b|\n"); print ("@b" eq '4 3 2 1' ? "ok 39\n" : "not ok 39 |@b|\n"); }
## exercise sort builtins... ($a <=> $b already tested)
@a = ( 5, 19, 1996, 255, 90 );
return $b <=> $a
} @a;
print ("@b" eq '1996 255 90 19 5' ? "ok 40\n" : "not ok 40\n"); print "# x = '@b'\n";
print "# x = '$x'; expected = '$expected'\n"; print "# x = '$x'; expected = '$expected'\n"; {
use integer;
@b = sort { $a <=> $b } @a; print ("@b" eq '5 19 90 255 1996' ? "ok 43\n" : "not ok 43\n"); print "# x = '@b'\n";
@b = sort { $b <=> $a } @a; print ("@b" eq '1996 255 90 19 5' ? "ok 44\n" : "not ok 44\n"); print "# x = '@b'\n";
print "# x = '$x'; expected = '$expected'\n"; print "# x = '$x'; expected = '$expected'\n"; }
# test that an optimized-away comparison block doesn't take any other
# arguments away with it
$x = join('', sort { $a <=> $b } 3, 1, 2); print $x eq "123" ? "ok 47\n" : "not ok 47\n";
# test sorting in non-main package
@a = ( 5, 19, 1996, 255, 90 );
@b = sort { $b <=> $a } @a; print ("@b" eq '1996 255 90 19 5' ? "ok 48\n" : "not ok 48\n"); print "# x = '@b'\n";
print ("@b" eq '90 5 255 1996 19' ? "ok 49\n" : "not ok 49\n"); print "# x = '@b'\n";
# check if context for sort arguments is handled right
}
my $m = sub { $a <=> $b };
}
# test against a reentrancy bug
{
}
{
$a <=> $b
print ("@b" eq '1 2 3 4' ? "ok 56\n" : "not ok 56\n"); print "# x = '@b'\n";
print !$def ? "ok 57\n" : "not ok 57\n"; }
# Bug 19991001.003
{
print "@a" eq "one two" ? "ok 58\n" : "not ok 58\n"; }
print "ok $test - $_[2]\n"; print "#[$_[0]] ne [$_[1]]\n" unless $_[0] eq $_[1]; }
# check for in-place optimisation of @a = sort @a
{
@g = (3,2,1); $r1 = \$g[2]; @g = sort @g; $r2 = \$g[0]; ok "$r1-@g", "$r2-1 2 3", "inplace sort of global";
ok "$r1-@a", "$r2-a b c", "inplace sort of lexical";
@g = (2,3,1); $r1 = \$g[1]; @g = sort { $b <=> $a } @g; $r2 = \$g[0]; ok "$r1-@g", "$r2-3 2 1", "inplace reversed sort of global";
@g = (2,3,1);
$r1 = \$g[1]; @g = sort { $a<$b?1:$a>$b?-1:0 } @g; $r2 = \$g[0]; ok "$r1-@g", "$r2-3 2 1", "inplace custom sort of global";
ok "$r1-@a", "$r2-c b a", "inplace sort with function of lexical";
my @t;
ok "@t", "a b c", "inplace sort of tied array";
ok "@t", "c b a", "inplace sort of tied array with function";
# [perl #29790] don't optimise @a = ('a', sort @a) !
@g = (3,2,1); @g = ('0', sort @g); ok "@g", "0 1 2 3", "un-inplace sort of global"; @g = (3,2,1); @g = (sort(@g),'4'); ok "@g", "1 2 3 4", "un-inplace sort of global 2";
@a = qw(b a c); @a = ('x', sort @a); ok "@a", "x a b c", "un-inplace sort of lexical"; @a = qw(b a c); @a = ((sort @a), 'x'); ok "@a", "a b c x", "un-inplace sort of lexical 2";
@g = (2,3,1); @g = ('0', sort { $b <=> $a } @g); ok "@g", "0 3 2 1", "un-inplace reversed sort of global"; @g = (2,3,1); @g = ((sort { $b <=> $a } @g),'4'); ok "@g", "3 2 1 4", "un-inplace reversed sort of global 2";
@g = (2,3,1); @g = ('0', sort { $a<$b?1:$a>$b?-1:0 } @g); ok "@g", "0 3 2 1", "un-inplace custom sort of global"; @g = (2,3,1); @g = ((sort { $a<$b?1:$a>$b?-1:0 } @g),'4'); ok "@g", "3 2 1 4", "un-inplace custom sort of global 2";
ok "@a", "x c b a", "un-inplace sort with function of lexical"; ok "@a", "c b a x", "un-inplace sort with function of lexical 2"; }