This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
[inseparable changes from match from perl-5.003_99 to perl-5.003_99a]
[perl5.git] / t / op / sort.t
CommitLineData
a687059c
LW
1#!./perl
2
79072805 3# $RCSfile: sort.t,v $$Revision: 4.1 $$Date: 92/08/07 18:28:24 $
a687059c 4
7bac28a0 5print "1..19\n";
a687059c 6
2f52a358 7sub backwards { $a lt $b ? 1 : $a gt $b ? -1 : 0 }
a687059c
LW
8
9@harry = ('dog','cat','x','Cain','Abel');
2f52a358 10@george = ('gone','chased','yz','punished','Axed');
a687059c
LW
11
12$x = join('', sort @harry);
13print ($x eq 'AbelCaincatdogx' ? "ok 1\n" : "not ok 1\n");
2f52a358 14print "# x = '$x'\n";
a687059c 15
a0d0e21e 16$x = join('', sort( backwards @harry));
a687059c 17print ($x eq 'xdogcatCainAbel' ? "ok 2\n" : "not ok 2\n");
2f52a358 18print "# x = '$x'\n";
a687059c
LW
19
20$x = join('', sort @george, 'to', @harry);
2f52a358
JH
21print ($x eq 'AbelAxedCaincatchaseddoggonepunishedtoxyz'?"ok 3\n":"not ok 3\n");
22print "# x = '$x'\n";
03a14243
LW
23
24@a = ();
25@b = reverse @a;
26print ("@b" eq "" ? "ok 4\n" : "not ok 4 (@b)\n");
27
28@a = (1);
29@b = reverse @a;
30print ("@b" eq "1" ? "ok 5\n" : "not ok 5 (@b)\n");
31
32@a = (1,2);
33@b = reverse @a;
34print ("@b" eq "2 1" ? "ok 6\n" : "not ok 6 (@b)\n");
35
36@a = (1,2,3);
37@b = reverse @a;
38print ("@b" eq "3 2 1" ? "ok 7\n" : "not ok 7 (@b)\n");
39
40@a = (1,2,3,4);
41@b = reverse @a;
42print ("@b" eq "4 3 2 1" ? "ok 8\n" : "not ok 8 (@b)\n");
55204971
LW
43
44@a = (10,2,3,4);
45@b = sort {$a <=> $b;} @a;
46print ("@b" eq "2 3 4 10" ? "ok 9\n" : "not ok 9 (@b)\n");
988174c1 47
463ee0b2 48$sub = 'backwards';
988174c1
LW
49$x = join('', sort $sub @harry);
50print ($x eq 'xdogcatCainAbel' ? "ok 10\n" : "not ok 10\n");
51
cd5de442
GS
52# literals, combinations
53
54@b = sort (4,1,3,2);
55print ("@b" eq '1 2 3 4' ? "ok 11\n" : "not ok 11\n");
56print "# x = '@b'\n";
57
58@b = sort grep { $_ } (4,1,3,2);
59print ("@b" eq '1 2 3 4' ? "ok 12\n" : "not ok 12\n");
60print "# x = '@b'\n";
61
62@b = sort map { $_ } (4,1,3,2);
63print ("@b" eq '1 2 3 4' ? "ok 13\n" : "not ok 13\n");
64print "# x = '@b'\n";
65
66@b = sort reverse (4,1,3,2);
67print ("@b" eq '1 2 3 4' ? "ok 14\n" : "not ok 14\n");
68print "# x = '@b'\n";
7bac28a0 69
70$^W = 0;
71# redefining sort sub inside the sort sub should fail
72sub twoface { *twoface = sub { $a <=> $b }; &twoface }
73eval { @b = sort twoface 4,1,3,2 };
74print ($@ =~ /redefine active sort/ ? "ok 15\n" : "not ok 15\n");
75
76# redefining sort subs outside the sort should not fail
77eval { *twoface = sub { &backwards } };
78print $@ ? "not ok 16\n" : "ok 16\n";
79
80eval { @b = sort twoface 4,1,3,2 };
81print ("@b" eq '4 3 2 1' ? "ok 17\n" : "not ok 17 |@b|\n");
82
83*twoface = sub { *twoface = *backwards; $a <=> $b };
84eval { @b = sort twoface 4,1 };
85print ($@ =~ /redefine active sort/ ? "ok 18\n" : "not ok 18\n");
86
87*twoface = sub {
88 eval 'sub twoface { $a <=> $b }';
89 die($@ =~ /redefine active sort/ ? "ok 19\n" : "not ok 19\n");
90 $a <=> $b;
91 };
92eval { @b = sort twoface 4,1 };
93print $@ ? "$@" : "not ok 19\n";