| 1 | #!./perl |
| 2 | |
| 3 | BEGIN { |
| 4 | chdir 't' if -d 't'; |
| 5 | unshift @INC, '../lib'; |
| 6 | } |
| 7 | print "1..49\n"; |
| 8 | |
| 9 | # XXX known to leak scalars |
| 10 | $ENV{PERL_DESTRUCT_LEVEL} = 0 unless $ENV{PERL_DESTRUCT_LEVEL} > 3; |
| 11 | |
| 12 | sub backwards { $a lt $b ? 1 : $a gt $b ? -1 : 0 } |
| 13 | sub backwards_stacked($$) { my($a,$b) = @_; $a lt $b ? 1 : $a gt $b ? -1 : 0 } |
| 14 | |
| 15 | my $upperfirst = 'A' lt 'a'; |
| 16 | |
| 17 | # Beware: in future this may become hairier because of possible |
| 18 | # collation complications: qw(A a B c) can be sorted at least as |
| 19 | # any of the following |
| 20 | # |
| 21 | # A a B b |
| 22 | # A B a b |
| 23 | # a b A B |
| 24 | # a A b B |
| 25 | # |
| 26 | # All the above orders make sense. |
| 27 | # |
| 28 | # That said, EBCDIC sorts all small letters first, as opposed |
| 29 | # to ASCII which sorts all big letters first. |
| 30 | |
| 31 | @harry = ('dog','cat','x','Cain','Abel'); |
| 32 | @george = ('gone','chased','yz','punished','Axed'); |
| 33 | |
| 34 | $x = join('', sort @harry); |
| 35 | $expected = $upperfirst ? 'AbelCaincatdogx' : 'catdogxAbelCain'; |
| 36 | print "# 1: x = '$x', expected = '$expected'\n"; |
| 37 | print ($x eq $expected ? "ok 1\n" : "not ok 1\n"); |
| 38 | |
| 39 | $x = join('', sort( backwards @harry)); |
| 40 | $expected = $upperfirst ? 'xdogcatCainAbel' : 'CainAbelxdogcat'; |
| 41 | print "# 2: x = '$x', expected = '$expected'\n"; |
| 42 | print ($x eq $expected ? "ok 2\n" : "not ok 2\n"); |
| 43 | |
| 44 | $x = join('', sort( backwards_stacked @harry)); |
| 45 | $expected = $upperfirst ? 'xdogcatCainAbel' : 'CainAbelxdogcat'; |
| 46 | print "# 3: x = '$x', expected = '$expected'\n"; |
| 47 | print ($x eq $expected ? "ok 3\n" : "not ok 3\n"); |
| 48 | |
| 49 | $x = join('', sort @george, 'to', @harry); |
| 50 | $expected = $upperfirst ? |
| 51 | 'AbelAxedCaincatchaseddoggonepunishedtoxyz' : |
| 52 | 'catchaseddoggonepunishedtoxyzAbelAxedCain' ; |
| 53 | print "# 4: x = '$x', expected = '$expected'\n"; |
| 54 | print ($x eq $expected ?"ok 4\n":"not ok 4\n"); |
| 55 | |
| 56 | @a = (); |
| 57 | @b = reverse @a; |
| 58 | print ("@b" eq "" ? "ok 5\n" : "not ok 5 (@b)\n"); |
| 59 | |
| 60 | @a = (1); |
| 61 | @b = reverse @a; |
| 62 | print ("@b" eq "1" ? "ok 6\n" : "not ok 6 (@b)\n"); |
| 63 | |
| 64 | @a = (1,2); |
| 65 | @b = reverse @a; |
| 66 | print ("@b" eq "2 1" ? "ok 7\n" : "not ok 7 (@b)\n"); |
| 67 | |
| 68 | @a = (1,2,3); |
| 69 | @b = reverse @a; |
| 70 | print ("@b" eq "3 2 1" ? "ok 8\n" : "not ok 8 (@b)\n"); |
| 71 | |
| 72 | @a = (1,2,3,4); |
| 73 | @b = reverse @a; |
| 74 | print ("@b" eq "4 3 2 1" ? "ok 9\n" : "not ok 9 (@b)\n"); |
| 75 | |
| 76 | @a = (10,2,3,4); |
| 77 | @b = sort {$a <=> $b;} @a; |
| 78 | print ("@b" eq "2 3 4 10" ? "ok 10\n" : "not ok 10 (@b)\n"); |
| 79 | |
| 80 | $sub = 'backwards'; |
| 81 | $x = join('', sort $sub @harry); |
| 82 | $expected = $upperfirst ? 'xdogcatCainAbel' : 'CainAbelxdogcat'; |
| 83 | print "# 11: x = $x, expected = '$expected'\n"; |
| 84 | print ($x eq $expected ? "ok 11\n" : "not ok 11\n"); |
| 85 | |
| 86 | $sub = 'backwards_stacked'; |
| 87 | $x = join('', sort $sub @harry); |
| 88 | $expected = $upperfirst ? 'xdogcatCainAbel' : 'CainAbelxdogcat'; |
| 89 | print "# 12: x = $x, expected = '$expected'\n"; |
| 90 | print ($x eq $expected ? "ok 12\n" : "not ok 12\n"); |
| 91 | |
| 92 | # literals, combinations |
| 93 | |
| 94 | @b = sort (4,1,3,2); |
| 95 | print ("@b" eq '1 2 3 4' ? "ok 13\n" : "not ok 13\n"); |
| 96 | print "# x = '@b'\n"; |
| 97 | |
| 98 | @b = sort grep { $_ } (4,1,3,2); |
| 99 | print ("@b" eq '1 2 3 4' ? "ok 14\n" : "not ok 14\n"); |
| 100 | print "# x = '@b'\n"; |
| 101 | |
| 102 | @b = sort map { $_ } (4,1,3,2); |
| 103 | print ("@b" eq '1 2 3 4' ? "ok 15\n" : "not ok 15\n"); |
| 104 | print "# x = '@b'\n"; |
| 105 | |
| 106 | @b = sort reverse (4,1,3,2); |
| 107 | print ("@b" eq '1 2 3 4' ? "ok 16\n" : "not ok 16\n"); |
| 108 | print "# x = '@b'\n"; |
| 109 | |
| 110 | $^W = 0; |
| 111 | # redefining sort sub inside the sort sub should fail |
| 112 | sub twoface { *twoface = sub { $a <=> $b }; &twoface } |
| 113 | eval { @b = sort twoface 4,1,3,2 }; |
| 114 | print ($@ =~ /redefine active sort/ ? "ok 17\n" : "not ok 17\n"); |
| 115 | |
| 116 | # redefining sort subs outside the sort should not fail |
| 117 | eval { *twoface = sub { &backwards } }; |
| 118 | print $@ ? "not ok 18\n" : "ok 18\n"; |
| 119 | |
| 120 | eval { @b = sort twoface 4,1,3,2 }; |
| 121 | print ("@b" eq '4 3 2 1' ? "ok 19\n" : "not ok 19 |@b|\n"); |
| 122 | |
| 123 | *twoface = sub { *twoface = *backwards; $a <=> $b }; |
| 124 | eval { @b = sort twoface 4,1 }; |
| 125 | print ($@ =~ /redefine active sort/ ? "ok 20\n" : "not ok 20\n"); |
| 126 | |
| 127 | *twoface = sub { |
| 128 | eval 'sub twoface { $a <=> $b }'; |
| 129 | die($@ =~ /redefine active sort/ ? "ok 21\n" : "not ok 21\n"); |
| 130 | $a <=> $b; |
| 131 | }; |
| 132 | eval { @b = sort twoface 4,1 }; |
| 133 | print $@ ? "$@" : "not ok 21\n"; |
| 134 | |
| 135 | eval <<'CODE'; |
| 136 | my @result = sort main'backwards 'one', 'two'; |
| 137 | CODE |
| 138 | print $@ ? "not ok 22\n# $@" : "ok 22\n"; |
| 139 | |
| 140 | eval <<'CODE'; |
| 141 | # "sort 'one', 'two'" should not try to parse "'one" as a sort sub |
| 142 | my @result = sort 'one', 'two'; |
| 143 | CODE |
| 144 | print $@ ? "not ok 23\n# $@" : "ok 23\n"; |
| 145 | |
| 146 | { |
| 147 | my $sortsub = \&backwards; |
| 148 | my $sortglob = *backwards; |
| 149 | my $sortglobr = \*backwards; |
| 150 | my $sortname = 'backwards'; |
| 151 | @b = sort $sortsub 4,1,3,2; |
| 152 | print ("@b" eq '4 3 2 1' ? "ok 24\n" : "not ok 24 |@b|\n"); |
| 153 | @b = sort $sortglob 4,1,3,2; |
| 154 | print ("@b" eq '4 3 2 1' ? "ok 25\n" : "not ok 25 |@b|\n"); |
| 155 | @b = sort $sortname 4,1,3,2; |
| 156 | print ("@b" eq '4 3 2 1' ? "ok 26\n" : "not ok 26 |@b|\n"); |
| 157 | @b = sort $sortglobr 4,1,3,2; |
| 158 | print ("@b" eq '4 3 2 1' ? "ok 27\n" : "not ok 27 |@b|\n"); |
| 159 | } |
| 160 | |
| 161 | { |
| 162 | my $sortsub = \&backwards_stacked; |
| 163 | my $sortglob = *backwards_stacked; |
| 164 | my $sortglobr = \*backwards_stacked; |
| 165 | my $sortname = 'backwards_stacked'; |
| 166 | @b = sort $sortsub 4,1,3,2; |
| 167 | print ("@b" eq '4 3 2 1' ? "ok 28\n" : "not ok 28 |@b|\n"); |
| 168 | @b = sort $sortglob 4,1,3,2; |
| 169 | print ("@b" eq '4 3 2 1' ? "ok 29\n" : "not ok 29 |@b|\n"); |
| 170 | @b = sort $sortname 4,1,3,2; |
| 171 | print ("@b" eq '4 3 2 1' ? "ok 30\n" : "not ok 30 |@b|\n"); |
| 172 | @b = sort $sortglobr 4,1,3,2; |
| 173 | print ("@b" eq '4 3 2 1' ? "ok 31\n" : "not ok 31 |@b|\n"); |
| 174 | } |
| 175 | |
| 176 | { |
| 177 | local $sortsub = \&backwards; |
| 178 | local $sortglob = *backwards; |
| 179 | local $sortglobr = \*backwards; |
| 180 | local $sortname = 'backwards'; |
| 181 | @b = sort $sortsub 4,1,3,2; |
| 182 | print ("@b" eq '4 3 2 1' ? "ok 32\n" : "not ok 32 |@b|\n"); |
| 183 | @b = sort $sortglob 4,1,3,2; |
| 184 | print ("@b" eq '4 3 2 1' ? "ok 33\n" : "not ok 33 |@b|\n"); |
| 185 | @b = sort $sortname 4,1,3,2; |
| 186 | print ("@b" eq '4 3 2 1' ? "ok 34\n" : "not ok 34 |@b|\n"); |
| 187 | @b = sort $sortglobr 4,1,3,2; |
| 188 | print ("@b" eq '4 3 2 1' ? "ok 35\n" : "not ok 35 |@b|\n"); |
| 189 | } |
| 190 | |
| 191 | { |
| 192 | local $sortsub = \&backwards_stacked; |
| 193 | local $sortglob = *backwards_stacked; |
| 194 | local $sortglobr = \*backwards_stacked; |
| 195 | local $sortname = 'backwards_stacked'; |
| 196 | @b = sort $sortsub 4,1,3,2; |
| 197 | print ("@b" eq '4 3 2 1' ? "ok 36\n" : "not ok 36 |@b|\n"); |
| 198 | @b = sort $sortglob 4,1,3,2; |
| 199 | print ("@b" eq '4 3 2 1' ? "ok 37\n" : "not ok 37 |@b|\n"); |
| 200 | @b = sort $sortname 4,1,3,2; |
| 201 | print ("@b" eq '4 3 2 1' ? "ok 38\n" : "not ok 38 |@b|\n"); |
| 202 | @b = sort $sortglobr 4,1,3,2; |
| 203 | print ("@b" eq '4 3 2 1' ? "ok 39\n" : "not ok 39 |@b|\n"); |
| 204 | } |
| 205 | |
| 206 | ## exercise sort builtins... ($a <=> $b already tested) |
| 207 | @a = ( 5, 19, 1996, 255, 90 ); |
| 208 | @b = sort { |
| 209 | my $dummy; # force blockness |
| 210 | return $b <=> $a |
| 211 | } @a; |
| 212 | print ("@b" eq '1996 255 90 19 5' ? "ok 40\n" : "not ok 40\n"); |
| 213 | print "# x = '@b'\n"; |
| 214 | $x = join('', sort { $a cmp $b } @harry); |
| 215 | $expected = $upperfirst ? 'AbelCaincatdogx' : 'catdogxAbelCain'; |
| 216 | print ($x eq $expected ? "ok 41\n" : "not ok 41\n"); |
| 217 | print "# x = '$x'; expected = '$expected'\n"; |
| 218 | $x = join('', sort { $b cmp $a } @harry); |
| 219 | $expected = $upperfirst ? 'xdogcatCainAbel' : 'CainAbelxdogcat'; |
| 220 | print ($x eq $expected ? "ok 42\n" : "not ok 42\n"); |
| 221 | print "# x = '$x'; expected = '$expected'\n"; |
| 222 | { |
| 223 | use integer; |
| 224 | @b = sort { $a <=> $b } @a; |
| 225 | print ("@b" eq '5 19 90 255 1996' ? "ok 43\n" : "not ok 43\n"); |
| 226 | print "# x = '@b'\n"; |
| 227 | @b = sort { $b <=> $a } @a; |
| 228 | print ("@b" eq '1996 255 90 19 5' ? "ok 44\n" : "not ok 44\n"); |
| 229 | print "# x = '@b'\n"; |
| 230 | $x = join('', sort { $a cmp $b } @harry); |
| 231 | $expected = $upperfirst ? 'AbelCaincatdogx' : 'catdogxAbelCain'; |
| 232 | print ($x eq $expected ? "ok 45\n" : "not ok 45\n"); |
| 233 | print "# x = '$x'; expected = '$expected'\n"; |
| 234 | $x = join('', sort { $b cmp $a } @harry); |
| 235 | $expected = $upperfirst ? 'xdogcatCainAbel' : 'CainAbelxdogcat'; |
| 236 | print ($x eq $expected ? "ok 46\n" : "not ok 46\n"); |
| 237 | print "# x = '$x'; expected = '$expected'\n"; |
| 238 | } |
| 239 | |
| 240 | # test that an optimized-away comparison block doesn't take any other |
| 241 | # arguments away with it |
| 242 | $x = join('', sort { $a <=> $b } 3, 1, 2); |
| 243 | print $x eq "123" ? "ok 47\n" : "not ok 47\n"; |
| 244 | |
| 245 | # test sorting in non-main package |
| 246 | package Foo; |
| 247 | @a = ( 5, 19, 1996, 255, 90 ); |
| 248 | @b = sort { $b <=> $a } @a; |
| 249 | print ("@b" eq '1996 255 90 19 5' ? "ok 48\n" : "not ok 48\n"); |
| 250 | print "# x = '@b'\n"; |
| 251 | |
| 252 | @b = sort main::backwards_stacked @a; |
| 253 | print ("@b" eq '90 5 255 1996 19' ? "ok 49\n" : "not ok 49\n"); |
| 254 | print "# x = '@b'\n"; |