10 # these shouldn't hang
13 sort { for ($_ = 0;; $_++) {} } @a;
14 sort { while(1) {} } @a;
15 sort { while(1) { last; } } @a;
16 sort { while(0) { last; } } @a;
19 sub Backwards { $a lt $b ? 1 : $a gt $b ? -1 : 0 }
20 sub Backwards_stacked($$) { my($a,$b) = @_; $a lt $b ? 1 : $a gt $b ? -1 : 0 }
22 my $upperfirst = 'A' lt 'a';
24 # Beware: in future this may become hairier because of possible
25 # collation complications: qw(A a B c) can be sorted at least as
26 # any of the following
33 # All the above orders make sense.
35 # That said, EBCDIC sorts all small letters first, as opposed
36 # to ASCII which sorts all big letters first.
38 @harry = ('dog','cat','x','Cain','Abel');
39 @george = ('gone','chased','yz','punished','Axed');
41 $x = join('', sort @harry);
42 $expected = $upperfirst ? 'AbelCaincatdogx' : 'catdogxAbelCain';
43 print "# 1: x = '$x', expected = '$expected'\n";
44 print ($x eq $expected ? "ok 1\n" : "not ok 1\n");
46 $x = join('', sort( Backwards @harry));
47 $expected = $upperfirst ? 'xdogcatCainAbel' : 'CainAbelxdogcat';
48 print "# 2: x = '$x', expected = '$expected'\n";
49 print ($x eq $expected ? "ok 2\n" : "not ok 2\n");
51 $x = join('', sort( Backwards_stacked @harry));
52 $expected = $upperfirst ? 'xdogcatCainAbel' : 'CainAbelxdogcat';
53 print "# 3: x = '$x', expected = '$expected'\n";
54 print ($x eq $expected ? "ok 3\n" : "not ok 3\n");
56 $x = join('', sort @george, 'to', @harry);
57 $expected = $upperfirst ?
58 'AbelAxedCaincatchaseddoggonepunishedtoxyz' :
59 'catchaseddoggonepunishedtoxyzAbelAxedCain' ;
60 print "# 4: x = '$x', expected = '$expected'\n";
61 print ($x eq $expected ?"ok 4\n":"not ok 4\n");
65 print ("@b" eq "" ? "ok 5\n" : "not ok 5 (@b)\n");
69 print ("@b" eq "1" ? "ok 6\n" : "not ok 6 (@b)\n");
73 print ("@b" eq "2 1" ? "ok 7\n" : "not ok 7 (@b)\n");
77 print ("@b" eq "3 2 1" ? "ok 8\n" : "not ok 8 (@b)\n");
81 print ("@b" eq "4 3 2 1" ? "ok 9\n" : "not ok 9 (@b)\n");
84 @b = sort {$a <=> $b;} @a;
85 print ("@b" eq "2 3 4 10" ? "ok 10\n" : "not ok 10 (@b)\n");
88 $x = join('', sort $sub @harry);
89 $expected = $upperfirst ? 'xdogcatCainAbel' : 'CainAbelxdogcat';
90 print "# 11: x = $x, expected = '$expected'\n";
91 print ($x eq $expected ? "ok 11\n" : "not ok 11\n");
93 $sub = 'Backwards_stacked';
94 $x = join('', sort $sub @harry);
95 $expected = $upperfirst ? 'xdogcatCainAbel' : 'CainAbelxdogcat';
96 print "# 12: x = $x, expected = '$expected'\n";
97 print ($x eq $expected ? "ok 12\n" : "not ok 12\n");
99 # literals, combinations
102 print ("@b" eq '1 2 3 4' ? "ok 13\n" : "not ok 13\n");
103 print "# x = '@b'\n";
105 @b = sort grep { $_ } (4,1,3,2);
106 print ("@b" eq '1 2 3 4' ? "ok 14\n" : "not ok 14\n");
107 print "# x = '@b'\n";
109 @b = sort map { $_ } (4,1,3,2);
110 print ("@b" eq '1 2 3 4' ? "ok 15\n" : "not ok 15\n");
111 print "# x = '@b'\n";
113 @b = sort reverse (4,1,3,2);
114 print ("@b" eq '1 2 3 4' ? "ok 16\n" : "not ok 16\n");
115 print "# x = '@b'\n";
117 # redefining sort sub inside the sort sub should fail
118 sub twoface { *twoface = sub { $a <=> $b }; &twoface }
119 eval { @b = sort twoface 4,1,3,2 };
120 print ($@ =~ /redefine active sort/ ? "ok 17\n" : "not ok 17\n");
122 # redefining sort subs outside the sort should not fail
123 eval { no warnings 'redefine'; *twoface = sub { &Backwards } };
124 print $@ ? "not ok 18\n" : "ok 18\n";
126 eval { @b = sort twoface 4,1,3,2 };
127 print ("@b" eq '4 3 2 1' ? "ok 19\n" : "not ok 19 |@b|\n");
130 no warnings 'redefine';
131 *twoface = sub { *twoface = *Backwards; $a <=> $b };
133 eval { @b = sort twoface 4,1 };
134 print ($@ =~ /redefine active sort/ ? "ok 20\n" : "not ok 20\n");
137 no warnings 'redefine';
139 eval 'sub twoface { $a <=> $b }';
140 die($@ =~ /redefine active sort/ ? "ok 21\n" : "not ok 21\n");
144 eval { @b = sort twoface 4,1 };
145 print $@ ? "$@" : "not ok 21\n";
148 my @result = sort main'Backwards 'one', 'two';
150 print $@ ? "not ok 22\n# $@" : "ok 22\n";
153 # "sort 'one', 'two'" should not try to parse "'one" as a sort sub
154 my @result = sort 'one', 'two';
156 print $@ ? "not ok 23\n# $@" : "ok 23\n";
159 my $sortsub = \&Backwards;
160 my $sortglob = *Backwards;
161 my $sortglobr = \*Backwards;
162 my $sortname = 'Backwards';
163 @b = sort $sortsub 4,1,3,2;
164 print ("@b" eq '4 3 2 1' ? "ok 24\n" : "not ok 24 |@b|\n");
165 @b = sort $sortglob 4,1,3,2;
166 print ("@b" eq '4 3 2 1' ? "ok 25\n" : "not ok 25 |@b|\n");
167 @b = sort $sortname 4,1,3,2;
168 print ("@b" eq '4 3 2 1' ? "ok 26\n" : "not ok 26 |@b|\n");
169 @b = sort $sortglobr 4,1,3,2;
170 print ("@b" eq '4 3 2 1' ? "ok 27\n" : "not ok 27 |@b|\n");
174 my $sortsub = \&Backwards_stacked;
175 my $sortglob = *Backwards_stacked;
176 my $sortglobr = \*Backwards_stacked;
177 my $sortname = 'Backwards_stacked';
178 @b = sort $sortsub 4,1,3,2;
179 print ("@b" eq '4 3 2 1' ? "ok 28\n" : "not ok 28 |@b|\n");
180 @b = sort $sortglob 4,1,3,2;
181 print ("@b" eq '4 3 2 1' ? "ok 29\n" : "not ok 29 |@b|\n");
182 @b = sort $sortname 4,1,3,2;
183 print ("@b" eq '4 3 2 1' ? "ok 30\n" : "not ok 30 |@b|\n");
184 @b = sort $sortglobr 4,1,3,2;
185 print ("@b" eq '4 3 2 1' ? "ok 31\n" : "not ok 31 |@b|\n");
189 local $sortsub = \&Backwards;
190 local $sortglob = *Backwards;
191 local $sortglobr = \*Backwards;
192 local $sortname = 'Backwards';
193 @b = sort $sortsub 4,1,3,2;
194 print ("@b" eq '4 3 2 1' ? "ok 32\n" : "not ok 32 |@b|\n");
195 @b = sort $sortglob 4,1,3,2;
196 print ("@b" eq '4 3 2 1' ? "ok 33\n" : "not ok 33 |@b|\n");
197 @b = sort $sortname 4,1,3,2;
198 print ("@b" eq '4 3 2 1' ? "ok 34\n" : "not ok 34 |@b|\n");
199 @b = sort $sortglobr 4,1,3,2;
200 print ("@b" eq '4 3 2 1' ? "ok 35\n" : "not ok 35 |@b|\n");
204 local $sortsub = \&Backwards_stacked;
205 local $sortglob = *Backwards_stacked;
206 local $sortglobr = \*Backwards_stacked;
207 local $sortname = 'Backwards_stacked';
208 @b = sort $sortsub 4,1,3,2;
209 print ("@b" eq '4 3 2 1' ? "ok 36\n" : "not ok 36 |@b|\n");
210 @b = sort $sortglob 4,1,3,2;
211 print ("@b" eq '4 3 2 1' ? "ok 37\n" : "not ok 37 |@b|\n");
212 @b = sort $sortname 4,1,3,2;
213 print ("@b" eq '4 3 2 1' ? "ok 38\n" : "not ok 38 |@b|\n");
214 @b = sort $sortglobr 4,1,3,2;
215 print ("@b" eq '4 3 2 1' ? "ok 39\n" : "not ok 39 |@b|\n");
218 ## exercise sort builtins... ($a <=> $b already tested)
219 @a = ( 5, 19, 1996, 255, 90 );
221 my $dummy; # force blockness
224 print ("@b" eq '1996 255 90 19 5' ? "ok 40\n" : "not ok 40\n");
225 print "# x = '@b'\n";
226 $x = join('', sort { $a cmp $b } @harry);
227 $expected = $upperfirst ? 'AbelCaincatdogx' : 'catdogxAbelCain';
228 print ($x eq $expected ? "ok 41\n" : "not ok 41\n");
229 print "# x = '$x'; expected = '$expected'\n";
230 $x = join('', sort { $b cmp $a } @harry);
231 $expected = $upperfirst ? 'xdogcatCainAbel' : 'CainAbelxdogcat';
232 print ($x eq $expected ? "ok 42\n" : "not ok 42\n");
233 print "# x = '$x'; expected = '$expected'\n";
236 @b = sort { $a <=> $b } @a;
237 print ("@b" eq '5 19 90 255 1996' ? "ok 43\n" : "not ok 43\n");
238 print "# x = '@b'\n";
239 @b = sort { $b <=> $a } @a;
240 print ("@b" eq '1996 255 90 19 5' ? "ok 44\n" : "not ok 44\n");
241 print "# x = '@b'\n";
242 $x = join('', sort { $a cmp $b } @harry);
243 $expected = $upperfirst ? 'AbelCaincatdogx' : 'catdogxAbelCain';
244 print ($x eq $expected ? "ok 45\n" : "not ok 45\n");
245 print "# x = '$x'; expected = '$expected'\n";
246 $x = join('', sort { $b cmp $a } @harry);
247 $expected = $upperfirst ? 'xdogcatCainAbel' : 'CainAbelxdogcat';
248 print ($x eq $expected ? "ok 46\n" : "not ok 46\n");
249 print "# x = '$x'; expected = '$expected'\n";
252 # test that an optimized-away comparison block doesn't take any other
253 # arguments away with it
254 $x = join('', sort { $a <=> $b } 3, 1, 2);
255 print $x eq "123" ? "ok 47\n" : "not ok 47\n";
257 # test sorting in non-main package
259 @a = ( 5, 19, 1996, 255, 90 );
260 @b = sort { $b <=> $a } @a;
261 print ("@b" eq '1996 255 90 19 5' ? "ok 48\n" : "not ok 48\n");
262 print "# x = '@b'\n";
264 @b = sort main::Backwards_stacked @a;
265 print ("@b" eq '90 5 255 1996 19' ? "ok 49\n" : "not ok 49\n");
266 print "# x = '@b'\n";
268 # check if context for sort arguments is handled right
272 my $gimme = wantarray;
273 print "not " unless $gimme;
277 my $m = sub { $a <=> $b };
279 sub cxt_one { sort $m test_if_list() }
281 sub cxt_two { sort { $a <=> $b } test_if_list() }
283 sub cxt_three { sort &test_if_list() }
287 my $gimme = wantarray;
288 print "not " if $gimme or !defined($gimme);
293 $m = \&test_if_scalar;
294 sub cxt_four { sort $m 1,2 }
296 sub cxt_five { sort { test_if_scalar($a,$b); } 1,2 }
298 sub cxt_six { sort test_if_scalar 1,2 }
301 # test against a reentrancy bug
304 sub compare { $a cmp $b }
305 sub reenter { my @force = sort compare qw/a b/ }
308 my($def, $init) = (0, 0);
310 $def = 1 if defined $Bar::a;
311 Bar::reenter() unless $init++;
314 print ("@b" eq '1 2 3 4' ? "ok 56\n" : "not ok 56\n");
315 print "# x = '@b'\n";
316 print !$def ? "ok 57\n" : "not ok 57\n";
321 sub routine { "one", "two" };
322 @a = sort(routine(1));
323 print "@a" eq "one two" ? "ok 58\n" : "not ok 58\n";
329 print "not " unless $_[0] eq $_[1];
330 print "ok $test - $_[2]\n";
331 print "#[$_[0]] ne [$_[1]]\n" unless $_[0] eq $_[1];
335 # check for in-place optimisation of @a = sort @a
339 @g = (3,2,1); $r1 = \$g[2]; @g = sort @g; $r2 = \$g[0];
340 ok "$r1-@g", "$r2-1 2 3", "inplace sort of global";
342 @a = qw(b a c); $r1 = \$a[1]; @a = sort @a; $r2 = \$a[0];
343 ok "$r1-@a", "$r2-a b c", "inplace sort of lexical";
345 @g = (2,3,1); $r1 = \$g[1]; @g = sort { $b <=> $a } @g; $r2 = \$g[0];
346 ok "$r1-@g", "$r2-3 2 1", "inplace reversed sort of global";
349 $r1 = \$g[1]; @g = sort { $a<$b?1:$a>$b?-1:0 } @g; $r2 = \$g[0];
350 ok "$r1-@g", "$r2-3 2 1", "inplace custom sort of global";
352 sub mysort { $b cmp $a };
353 @a = qw(b c a); $r1 = \$a[1]; @a = sort mysort @a; $r2 = \$a[0];
354 ok "$r1-@a", "$r2-c b a", "inplace sort with function of lexical";
358 tie @t, 'Tie::StdArray';
360 @t = qw(b c a); @t = sort @t;
361 ok "@t", "a b c", "inplace sort of tied array";
363 @t = qw(b c a); @t = sort mysort @t;
364 ok "@t", "c b a", "inplace sort of tied array with function";
366 # [perl #29790] don't optimise @a = ('a', sort @a) !
368 @g = (3,2,1); @g = ('0', sort @g);
369 ok "@g", "0 1 2 3", "un-inplace sort of global";
370 @g = (3,2,1); @g = (sort(@g),'4');
371 ok "@g", "1 2 3 4", "un-inplace sort of global 2";
373 @a = qw(b a c); @a = ('x', sort @a);
374 ok "@a", "x a b c", "un-inplace sort of lexical";
375 @a = qw(b a c); @a = ((sort @a), 'x');
376 ok "@a", "a b c x", "un-inplace sort of lexical 2";
378 @g = (2,3,1); @g = ('0', sort { $b <=> $a } @g);
379 ok "@g", "0 3 2 1", "un-inplace reversed sort of global";
380 @g = (2,3,1); @g = ((sort { $b <=> $a } @g),'4');
381 ok "@g", "3 2 1 4", "un-inplace reversed sort of global 2";
383 @g = (2,3,1); @g = ('0', sort { $a<$b?1:$a>$b?-1:0 } @g);
384 ok "@g", "0 3 2 1", "un-inplace custom sort of global";
385 @g = (2,3,1); @g = ((sort { $a<$b?1:$a>$b?-1:0 } @g),'4');
386 ok "@g", "3 2 1 4", "un-inplace custom sort of global 2";
388 @a = qw(b c a); @a = ('x', sort mysort @a);
389 ok "@a", "x c b a", "un-inplace sort with function of lexical";
390 @a = qw(b c a); @a = ((sort mysort @a),'x');
391 ok "@a", "c b a x", "un-inplace sort with function of lexical 2";
394 # Test optimisations of reversed sorts. As we now guarantee stability by
395 # default, # optimisations which do not provide this are bogus.
399 use overload (qw("" stringify 0+ numify fallback 1));
402 bless [$_[1], $_[2]], $_[0];
405 sub stringify { $_[0]->[0] }
407 sub numify { $_[0]->[1] }
412 map {new Oscalar $_, $count++} qw(A A A B B B C C C);
415 my @input = &generate;
416 my @output = sort @input;
417 ok join(" ", map {0+$_} @output), "0 1 2 3 4 5 6 7 8", "Simple stable sort";
420 @input = sort @input;
421 ok join(" ", map {0+$_} @input), "0 1 2 3 4 5 6 7 8",
422 "Simple stable in place sort";
424 # This won't be very interesting
426 @output = sort {$a <=> $b} @input;
427 ok "@output", "A A A B B B C C C", 'stable $a <=> $b sort';
430 @output = sort {$a cmp $b} @input;
431 ok join(" ", map {0+$_} @output), "0 1 2 3 4 5 6 7 8", 'stable $a cmp $b sort';
434 @input = sort {$a cmp $b} @input;
435 ok join(" ", map {0+$_} @input), "0 1 2 3 4 5 6 7 8",
436 'stable $a cmp $b in place sort';
439 @output = sort {$b cmp $a} @input;
440 ok join(" ", map {0+$_} @output), "6 7 8 3 4 5 0 1 2", 'stable $b cmp $a sort';
443 @input = sort {$b cmp $a} @input;
444 ok join(" ", map {0+$_} @input), "6 7 8 3 4 5 0 1 2",
445 'stable $b cmp $a in place sort';
448 @output = reverse sort @input;
449 ok join(" ", map {0+$_} @output), "8 7 6 5 4 3 2 1 0", "Reversed stable sort";
452 @input = reverse sort @input;
453 ok join(" ", map {0+$_} @input), "8 7 6 5 4 3 2 1 0",
454 "Reversed stable in place sort";
457 my $output = reverse sort @input;
458 ok $output, "CCCBBBAAA", "Reversed stable sort in scalar context";
462 @output = reverse sort {$a cmp $b} @input;
463 ok join(" ", map {0+$_} @output), "8 7 6 5 4 3 2 1 0",
464 'reversed stable $a cmp $b sort';
467 @input = reverse sort {$a cmp $b} @input;
468 ok join(" ", map {0+$_} @input), "8 7 6 5 4 3 2 1 0",
469 'revesed stable $a cmp $b in place sort';
472 $output = reverse sort @input;
473 ok $output, "CCCBBBAAA", 'Reversed stable $a cmp $b sort in scalar context';
476 @output = reverse sort {$b cmp $a} @input;
477 ok join(" ", map {0+$_} @output), "2 1 0 5 4 3 8 7 6",
478 'reversed stable $b cmp $a sort';
481 @input = reverse sort {$b cmp $a} @input;
482 ok join(" ", map {0+$_} @input), "2 1 0 5 4 3 8 7 6",
483 'revesed stable $b cmp $a in place sort';
486 $output = reverse sort {$b cmp $a} @input;
487 ok $output, "AAABBBCCC", 'Reversed stable $b cmp $a sort in scalar context';
490 # And now with numbers
494 map {new Oscalar $count++, $_} 0, 0, 0, 1, 1, 1, 2, 2, 2;
497 # This won't be very interesting
499 @output = sort {$a cmp $b} @input;
500 ok "@output", "A B C D E F G H I", 'stable $a cmp $b sort';
503 @output = sort {$a <=> $b} @input;
504 ok "@output", "A B C D E F G H I", 'stable $a <=> $b sort';
507 @input = sort {$a <=> $b} @input;
508 ok "@input", "A B C D E F G H I", 'stable $a <=> $b in place sort';
511 @output = sort {$b <=> $a} @input;
512 ok "@output", "G H I D E F A B C", 'stable $b <=> $a sort';
515 @input = sort {$b <=> $a} @input;
516 ok "@input", "G H I D E F A B C", 'stable $b <=> $a in place sort';
518 # These two are actually doing string cmp on 0 1 and 2
520 @output = reverse sort @input;
521 ok "@output", "I H G F E D C B A", "Reversed stable sort";
524 @input = reverse sort @input;
525 ok "@input", "I H G F E D C B A", "Reversed stable in place sort";
528 $output = reverse sort @input;
529 ok $output, "IHGFEDCBA", "Reversed stable sort in scalar context";
532 @output = reverse sort {$a <=> $b} @input;
533 ok "@output", "I H G F E D C B A", 'reversed stable $a <=> $b sort';
536 @input = reverse sort {$a <=> $b} @input;
537 ok "@input", "I H G F E D C B A", 'revesed stable $a <=> $b in place sort';
540 $output = reverse sort {$a <=> $b} @input;
541 ok $output, "IHGFEDCBA", 'reversed stable $a <=> $b sort in scalar context';
544 @output = reverse sort {$b <=> $a} @input;
545 ok "@output", "C B A F E D I H G", 'reversed stable $b <=> $a sort';
548 @input = reverse sort {$b <=> $a} @input;
549 ok "@input", "C B A F E D I H G", 'revesed stable $b <=> $a in place sort';
552 $output = reverse sort {$b <=> $a} @input;
553 ok $output, "CBAFEDIHG", 'reversed stable $b <=> $a sort in scalar context';