Linux cpanel2.daytoncreative.net 2.6.32-754.29.2.el6.x86_64 #1 SMP Tue May 12 17:39:04 UTC 2020 x86_64
Apache/2.4.43 (cPanel) OpenSSL/1.1.1g mod_bwlimited/1.4
Server IP : 70.62.220.67 & Your IP : 216.73.216.193
Domains :
Cant Read [ /etc/named.conf ]
User : michaelgreg
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
var /
log /
perl-5.20.2 /
t /
op /
Delete
Unzip
Name
Size
Permission
Date
Action
64bitint.t
8.14
KB
-r--r--r--
2014-12-27 11:49
alarm.t
1.5
KB
-r--r--r--
2014-12-27 11:49
anonsub.t
1.7
KB
-r--r--r--
2014-12-27 11:49
append.t
1.58
KB
-r--r--r--
2014-12-27 11:49
args.t
2.12
KB
-r--r--r--
2014-12-27 11:49
array.t
12.32
KB
-r--r--r--
2014-12-27 11:49
array_base.t
720
B
-r--r--r--
2014-12-27 11:49
assignwarn.t
1.52
KB
-r--r--r--
2014-12-27 11:49
attrhand.t
1.01
KB
-r--r--r--
2014-12-27 11:49
attrproto.t
6.55
KB
-r--r--r--
2014-12-27 11:49
attrs.t
10.73
KB
-r--r--r--
2014-12-27 11:49
auto.t
2.36
KB
-r--r--r--
2014-12-27 11:49
avhv.t
4.04
KB
-r--r--r--
2014-12-27 11:49
bless.t
4.12
KB
-r--r--r--
2014-12-27 11:49
blocks.t
2.95
KB
-r--r--r--
2014-12-27 11:49
bop.t
12.82
KB
-r--r--r--
2014-12-27 11:49
caller.pl
3.75
KB
-r--r--r--
2014-12-27 11:49
caller.t
8.14
KB
-r--r--r--
2014-12-27 11:49
chars.t
1.73
KB
-r--r--r--
2014-12-27 11:49
chdir.t
6.68
KB
-r--r--r--
2014-12-27 11:49
chop.t
7.67
KB
-r--r--r--
2014-12-27 11:49
chr.t
2.48
KB
-r--r--r--
2014-12-27 11:49
closure.t
19.6
KB
-r--r--r--
2014-12-27 11:49
closure_test.pl
327
B
-r--r--r--
2014-12-27 11:49
concat2.t
1.41
KB
-r--r--r--
2014-12-27 11:49
cond.t
282
B
-r--r--r--
2014-12-27 11:49
context.t
404
B
-r--r--r--
2014-12-27 11:49
coreamp.t
29.17
KB
-r--r--r--
2014-12-27 11:49
coresubs.t
4.87
KB
-r--r--r--
2014-12-27 11:49
cproto.t
3.6
KB
-r--r--r--
2014-12-27 11:49
crypt.t
1.17
KB
-r--r--r--
2014-12-27 11:49
current_sub.t
1.71
KB
-r--r--r--
2014-12-27 11:49
dbm.t
1.54
KB
-r--r--r--
2014-12-27 11:49
defined.t
551
B
-r--r--r--
2014-12-27 11:49
defins.t
4.84
KB
-r--r--r--
2014-12-27 11:49
delete.t
2.93
KB
-r--r--r--
2014-12-27 11:49
die.t
1.99
KB
-r--r--r--
2014-12-27 11:49
die_except.t
1.57
KB
-r--r--r--
2014-12-27 11:49
die_exit.t
1.9
KB
-r--r--r--
2014-12-27 11:49
die_keeperr.t
1.57
KB
-r--r--r--
2014-12-27 11:49
die_unwind.t
1.69
KB
-r--r--r--
2014-12-27 11:49
do.t
8.35
KB
-r--r--r--
2014-12-27 11:49
dor.t
2.64
KB
-r--r--r--
2014-12-27 11:49
each.t
7.09
KB
-r--r--r--
2014-12-27 11:49
each_array.t
5.48
KB
-r--r--r--
2014-12-27 11:49
eval.t
13.92
KB
-r--r--r--
2014-12-27 11:49
evalbytes.t
989
B
-r--r--r--
2014-12-27 11:49
exec.t
4.36
KB
-r--r--r--
2014-12-27 11:49
exists_sub.t
2.09
KB
-r--r--r--
2014-12-27 11:49
exp.t
1.47
KB
-r--r--r--
2014-12-27 11:49
fh.t
790
B
-r--r--r--
2014-12-27 11:49
filehandle.t
564
B
-r--r--r--
2014-12-27 11:49
filetest.t
11.97
KB
-r--r--r--
2014-12-27 11:49
filetest_stack_ok.t
1.12
KB
-r--r--r--
2014-12-27 11:49
filetest_t.t
1.18
KB
-r--r--r--
2014-12-27 11:49
flip.t
868
B
-r--r--r--
2014-12-27 11:49
for.t
12.77
KB
-r--r--r--
2014-12-27 11:49
fork.t
8.8
KB
-r--r--r--
2014-12-27 11:49
fresh_perl_utf8.t
411
B
-r--r--r--
2014-12-27 11:49
getpid.t
1.61
KB
-r--r--r--
2014-12-27 11:49
getppid.t
3.13
KB
-r--r--r--
2014-12-27 11:49
glob.t
4.22
KB
-r--r--r--
2014-12-27 11:49
gmagic.t
5.97
KB
-r--r--r--
2014-12-27 11:49
goto.t
14.85
KB
-r--r--r--
2014-12-27 11:49
goto_xs.t
2.98
KB
-r--r--r--
2014-12-27 11:49
grent.t
4.46
KB
-r--r--r--
2014-12-27 11:49
grep.t
6.66
KB
-r--r--r--
2014-12-27 11:49
groups.t
11.15
KB
-r--r--r--
2014-12-27 11:49
gv.t
30.15
KB
-r--r--r--
2014-12-27 11:49
hash-rt85026.t
1.57
KB
-r--r--r--
2014-12-27 11:49
hash.t
6.02
KB
-r--r--r--
2014-12-27 11:49
hashassign.t
18.85
KB
-r--r--r--
2014-12-27 11:49
hashwarn.t
2.05
KB
-r--r--r--
2014-12-27 11:49
heredoc.t
2.29
KB
-r--r--r--
2014-12-27 11:49
inc.t
6.72
KB
-r--r--r--
2014-12-27 11:49
inccode-tie.t
338
B
-r--r--r--
2014-12-27 11:49
inccode.t
11.19
KB
-r--r--r--
2014-12-27 11:49
incfilter.t
7.33
KB
-r--r--r--
2014-12-27 11:49
index.t
6.81
KB
-r--r--r--
2014-12-27 11:49
index_thr.t
56
B
-r--r--r--
2014-12-27 11:49
int.t
1.72
KB
-r--r--r--
2014-12-27 11:49
join.t
3.2
KB
-r--r--r--
2014-12-27 11:49
kill0.t
3.18
KB
-r--r--r--
2014-12-27 11:49
kill0_child
596
B
-r--r--r--
2014-12-27 11:49
kvaslice.t
4.66
KB
-r--r--r--
2014-12-27 11:49
kvhslice.t
5.44
KB
-r--r--r--
2014-12-27 11:49
lc.t
11.8
KB
-r--r--r--
2014-12-27 11:49
leaky-magic.t
3.43
KB
-r--r--r--
2014-12-27 11:49
length.t
5.03
KB
-r--r--r--
2014-12-27 11:49
lex.t
2.33
KB
-r--r--r--
2014-12-27 11:49
lex_assign.t
7.17
KB
-r--r--r--
2014-12-27 11:49
lexsub.t
19.62
KB
-r--r--r--
2014-12-27 12:24
lfs.t
6.2
KB
-r--r--r--
2014-12-27 11:49
list.t
5.31
KB
-r--r--r--
2014-12-27 11:52
local.t
17.11
KB
-r--r--r--
2014-12-27 11:49
localref.t
2.73
KB
-r--r--r--
2014-12-27 11:49
lock.t
465
B
-r--r--r--
2014-12-27 11:49
loopctl.t
17.88
KB
-r--r--r--
2014-12-27 11:49
lop.t
1.2
KB
-r--r--r--
2014-12-27 11:49
magic-27839.t
622
B
-r--r--r--
2014-12-27 11:49
magic.t
21.81
KB
-r--r--r--
2014-12-27 11:49
method.t
18.91
KB
-r--r--r--
2014-12-27 11:49
mkdir.t
1.25
KB
-r--r--r--
2014-12-27 11:49
my.t
4.29
KB
-r--r--r--
2014-12-27 11:49
my_stash.t
769
B
-r--r--r--
2014-12-27 11:49
mydef.t
5.51
KB
-r--r--r--
2014-12-27 11:49
negate.t
4.3
KB
-r--r--r--
2014-12-27 11:49
not.t
3.15
KB
-r--r--r--
2014-12-27 11:49
numconvert.t
8.33
KB
-r--r--r--
2014-12-27 11:49
oct.t
3.58
KB
-r--r--r--
2014-12-27 11:49
or.t
1.79
KB
-r--r--r--
2014-12-27 11:49
ord.t
2.48
KB
-r--r--r--
2014-12-27 11:49
overload_integer.t
506
B
-r--r--r--
2014-12-27 11:49
override.t
4.33
KB
-r--r--r--
2014-12-27 11:49
pack.t
65.34
KB
-r--r--r--
2014-12-27 11:49
packagev.t
5.97
KB
-r--r--r--
2014-12-27 11:49
pos.t
3.59
KB
-r--r--r--
2014-12-27 11:49
postfixderef.t
11.97
KB
-r--r--r--
2014-12-27 11:49
pow.t
2.34
KB
-r--r--r--
2014-12-27 11:49
print.t
692
B
-r--r--r--
2014-12-27 11:49
protowarn.t
1.35
KB
-r--r--r--
2014-12-27 11:49
push.t
3.03
KB
-r--r--r--
2014-12-27 11:49
pwent.t
6.63
KB
-r--r--r--
2014-12-27 11:49
qr.t
2.32
KB
-r--r--r--
2014-12-27 11:49
quotemeta.t
5.61
KB
-r--r--r--
2014-12-27 11:49
rand.t
8.31
KB
-r--r--r--
2014-12-27 11:49
range.t
9.25
KB
-r--r--r--
2014-12-27 11:49
read.t
2.28
KB
-r--r--r--
2014-12-27 11:49
readdir.t
2.09
KB
-r--r--r--
2014-12-27 11:49
readline.t
7.19
KB
-r--r--r--
2014-12-27 11:49
recurse.t
2.73
KB
-r--r--r--
2014-12-27 11:49
ref.t
22.74
KB
-r--r--r--
2014-12-27 11:49
repeat.t
4.8
KB
-r--r--r--
2014-12-27 11:49
require_37033.t
1.18
KB
-r--r--r--
2014-12-27 11:49
require_errors.t
3.68
KB
-r--r--r--
2014-12-27 11:49
reset.t
5.41
KB
-r--r--r--
2014-12-27 11:49
reverse.t
3.01
KB
-r--r--r--
2014-12-27 11:49
rt119311.t
5.58
KB
-r--r--r--
2014-12-27 11:49
runlevel.t
5.28
KB
-r--r--r--
2014-12-27 11:49
select.t
1.03
KB
-r--r--r--
2014-12-27 11:49
setpgrpstack.t
378
B
-r--r--r--
2014-12-27 11:49
sigdispatch.t
4.33
KB
-r--r--r--
2014-12-27 11:49
signatures.t
41.02
KB
-r--r--r--
2014-12-27 11:49
sigsystem.t
1.36
KB
-r--r--r--
2014-12-27 11:49
sleep.t
468
B
-r--r--r--
2014-12-27 11:49
smartkve.t
18.26
KB
-r--r--r--
2014-12-27 11:49
smartmatch.t
10.34
KB
-r--r--r--
2014-12-27 11:49
sort.t
28.4
KB
-r--r--r--
2015-01-10 13:17
splice.t
3.38
KB
-r--r--r--
2014-12-27 11:49
split.t
13.1
KB
-r--r--r--
2014-12-27 11:49
split_unicode.t
2.4
KB
-r--r--r--
2014-12-27 11:49
sprintf.t
28.5
KB
-r--r--r--
2014-12-27 11:49
sprintf2.t
5.49
KB
-r--r--r--
2014-12-27 11:49
srand.t
1.87
KB
-r--r--r--
2014-12-27 11:49
sselect.t
2.67
KB
-r--r--r--
2014-12-27 11:49
stash.t
9.01
KB
-r--r--r--
2014-12-27 11:49
stat.t
17.51
KB
-r--r--r--
2014-12-27 11:49
state.t
9.72
KB
-r--r--r--
2014-12-27 12:15
study.t
2.99
KB
-r--r--r--
2014-12-27 11:49
studytied.t
1.29
KB
-r--r--r--
2014-12-27 11:49
sub.t
6.54
KB
-r--r--r--
2014-12-27 11:49
sub_lval.t
24.2
KB
-r--r--r--
2014-12-27 11:49
substr.t
20.53
KB
-r--r--r--
2014-12-27 11:49
substr_thr.t
56
B
-r--r--r--
2014-12-27 11:49
svleak.pl
6
B
-r--r--r--
2014-12-27 11:49
svleak.t
15.93
KB
-r--r--r--
2015-01-10 12:06
switch.t
28.06
KB
-r--r--r--
2014-12-27 11:49
symbolcache.t
1.06
KB
-r--r--r--
2014-12-27 11:49
sysio.t
5
KB
-r--r--r--
2014-12-27 11:49
taint.t
66.84
KB
-r--r--r--
2014-12-27 12:32
threads-dirh.t
3.47
KB
-r--r--r--
2014-12-27 11:49
threads.t
9.3
KB
-r--r--r--
2014-12-27 11:49
threads_create.pl
42
B
-r--r--r--
2014-12-27 11:49
tie.t
28.34
KB
-r--r--r--
2014-12-27 11:49
tie_fetch_count.t
11.49
KB
-r--r--r--
2014-12-27 11:49
tiearray.t
4.53
KB
-r--r--r--
2014-12-27 11:49
tiehandle.t
5.27
KB
-r--r--r--
2014-12-27 11:49
time.t
7.86
KB
-r--r--r--
2015-01-17 11:51
time_loop.t
378
B
-r--r--r--
2014-12-27 11:49
tr.t
12.99
KB
-r--r--r--
2014-12-27 11:49
undef.t
3.15
KB
-r--r--r--
2014-12-27 11:49
universal.t
8.32
KB
-r--r--r--
2014-12-27 11:49
unlink.t
1.02
KB
-r--r--r--
2014-12-27 11:49
unshift.t
3.17
KB
-r--r--r--
2014-12-27 11:49
upgrade.t
1.15
KB
-r--r--r--
2014-12-27 11:49
utf8cache.t
3.83
KB
-r--r--r--
2014-12-27 11:49
utf8decode.t
7.59
KB
-r--r--r--
2014-12-27 11:49
utf8magic.t
808
B
-r--r--r--
2014-12-27 11:49
utfhash.t
5.33
KB
-r--r--r--
2014-12-27 11:49
utftaint.t
4.46
KB
-r--r--r--
2014-12-27 11:49
vec.t
2.87
KB
-r--r--r--
2014-12-27 11:49
ver.t
8.39
KB
-r--r--r--
2014-12-27 11:49
waitpid.t
973
B
-r--r--r--
2014-12-27 11:49
wantarray.t
874
B
-r--r--r--
2014-12-27 11:49
warn.t
4.15
KB
-r--r--r--
2014-12-27 11:49
while.t
3.81
KB
-r--r--r--
2014-12-27 11:49
write.t
39.99
KB
-r--r--r--
2015-01-24 15:03
yadayada.t
1.67
KB
-r--r--r--
2015-01-15 22:12
Save
Rename
#!./perl BEGIN { chdir 't' if -d 't'; @INC = qw(. ../lib); require 'test.pl'; } use warnings; plan( tests => 183 ); # these shouldn't hang { no warnings; sort { for ($_ = 0;; $_++) {} } @a; sort { while(1) {} } @a; sort { while(1) { last; } } @a; sort { while(0) { last; } } @a; # Change 26011: Re: A surprising segfault map scalar(sort(+())), ('')x68; } sub Backwards { $a lt $b ? 1 : $a gt $b ? -1 : 0 } sub Backwards_stacked($$) { my($a,$b) = @_; $a lt $b ? 1 : $a gt $b ? -1 : 0 } sub Backwards_other { $a lt $b ? 1 : $a gt $b ? -1 : 0 } my $upperfirst = 'A' lt 'a'; # Beware: in future this may become hairier because of possible # collation complications: qw(A a B b) 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'); $x = join('', sort @harry); $expected = $upperfirst ? 'AbelCaincatdogx' : 'catdogxAbelCain'; cmp_ok($x,'eq',$expected,'upper first 1'); $x = join('', sort( Backwards @harry)); $expected = $upperfirst ? 'xdogcatCainAbel' : 'CainAbelxdogcat'; cmp_ok($x,'eq',$expected,'upper first 2'); $x = join('', sort( Backwards_stacked @harry)); $expected = $upperfirst ? 'xdogcatCainAbel' : 'CainAbelxdogcat'; cmp_ok($x,'eq',$expected,'upper first 3'); $x = join('', sort @george, 'to', @harry); $expected = $upperfirst ? 'AbelAxedCaincatchaseddoggonepunishedtoxyz' : 'catchaseddoggonepunishedtoxyzAbelAxedCain' ; cmp_ok($x,'eq',$expected,'upper first 4'); $" = ' '; @a = (); @b = reverse @a; cmp_ok("@b",'eq',"",'reverse 1'); @a = (1); @b = reverse @a; cmp_ok("@b",'eq',"1",'reverse 2'); @a = (1,2); @b = reverse @a; cmp_ok("@b",'eq',"2 1",'reverse 3'); @a = (1,2,3); @b = reverse @a; cmp_ok("@b",'eq',"3 2 1",'reverse 4'); @a = (1,2,3,4); @b = reverse @a; cmp_ok("@b",'eq',"4 3 2 1",'reverse 5'); @a = (10,2,3,4); @b = sort {$a <=> $b;} @a; cmp_ok("@b",'eq',"2 3 4 10",'sort numeric'); $sub = 'Backwards'; $x = join('', sort $sub @harry); $expected = $upperfirst ? 'xdogcatCainAbel' : 'CainAbelxdogcat'; cmp_ok($x,'eq',$expected,'sorter sub name in var 1'); $sub = 'Backwards_stacked'; $x = join('', sort $sub @harry); $expected = $upperfirst ? 'xdogcatCainAbel' : 'CainAbelxdogcat'; cmp_ok($x,'eq',$expected,'sorter sub name in var 2'); # literals, combinations @b = sort (4,1,3,2); cmp_ok("@b",'eq','1 2 3 4','just sort'); @b = sort grep { $_ } (4,1,3,2); cmp_ok("@b",'eq','1 2 3 4','grep then sort'); @b = sort map { $_ } (4,1,3,2); cmp_ok("@b",'eq','1 2 3 4','map then sort'); @b = sort reverse (4,1,3,2); cmp_ok("@b",'eq','1 2 3 4','reverse then sort'); @b = sort CORE::reverse (4,1,3,2); cmp_ok("@b",'eq','1 2 3 4','CORE::reverse then sort'); eval { @b = sort CORE::revers (4,1,3,2); }; like($@, qr/^Undefined sort subroutine "CORE::revers" called at /); sub twoface { no warnings 'redefine'; *twoface = sub { $a <=> $b }; &twoface } eval { @b = sort twoface 4,1,3,2 }; cmp_ok("@b",'eq','1 2 3 4','redefine sort sub inside the sort sub'); eval { no warnings 'redefine'; *twoface = sub { &Backwards } }; ok(!$@,"redefining sort subs outside the sort \$@=[$@]"); eval { @b = sort twoface 4,1,3,2 }; cmp_ok("@b",'eq','4 3 2 1','twoface redefinition'); { no warnings 'redefine'; *twoface = sub { *twoface = *Backwards_other; $a <=> $b }; } eval { @b = sort twoface 4,1,9,5 }; ok(($@ eq "" && "@b" eq "1 4 5 9"),'redefinition should not take effect during the sort'); { no warnings 'redefine'; *twoface = sub { eval 'sub twoface { $a <=> $b }'; die($@ eq "" ? "good\n" : "bad\n"); $a <=> $b; }; } eval { @b = sort twoface 4,1 }; cmp_ok(substr($@,0,4), 'eq', 'good', 'twoface eval'); eval <<'CODE'; my @result = sort main'Backwards 'one', 'two'; CODE cmp_ok($@,'eq','',q(old skool package)); eval <<'CODE'; # "sort 'one', 'two'" should not try to parse "'one" as a sort sub my @result = sort 'one', 'two'; CODE cmp_ok($@,'eq','',q(one is not a sub)); { my $sortsub = \&Backwards; my $sortglob = *Backwards; my $sortglobr = \*Backwards; my $sortname = 'Backwards'; @b = sort $sortsub 4,1,3,2; cmp_ok("@b",'eq','4 3 2 1','sortname 1'); @b = sort $sortglob 4,1,3,2; cmp_ok("@b",'eq','4 3 2 1','sortname 2'); @b = sort $sortname 4,1,3,2; cmp_ok("@b",'eq','4 3 2 1','sortname 3'); @b = sort $sortglobr 4,1,3,2; cmp_ok("@b",'eq','4 3 2 1','sortname 4'); } { my $sortsub = \&Backwards_stacked; my $sortglob = *Backwards_stacked; my $sortglobr = \*Backwards_stacked; my $sortname = 'Backwards_stacked'; @b = sort $sortsub 4,1,3,2; cmp_ok("@b",'eq','4 3 2 1','sortname 5'); @b = sort $sortglob 4,1,3,2; cmp_ok("@b",'eq','4 3 2 1','sortname 6'); @b = sort $sortname 4,1,3,2; cmp_ok("@b",'eq','4 3 2 1','sortname 7'); @b = sort $sortglobr 4,1,3,2; cmp_ok("@b",'eq','4 3 2 1','sortname 8'); } { local $sortsub = \&Backwards; local $sortglob = *Backwards; local $sortglobr = \*Backwards; local $sortname = 'Backwards'; @b = sort $sortsub 4,1,3,2; cmp_ok("@b",'eq','4 3 2 1','sortname local 1'); @b = sort $sortglob 4,1,3,2; cmp_ok("@b",'eq','4 3 2 1','sortname local 2'); @b = sort $sortname 4,1,3,2; cmp_ok("@b",'eq','4 3 2 1','sortname local 3'); @b = sort $sortglobr 4,1,3,2; cmp_ok("@b",'eq','4 3 2 1','sortname local 4'); } { local $sortsub = \&Backwards_stacked; local $sortglob = *Backwards_stacked; local $sortglobr = \*Backwards_stacked; local $sortname = 'Backwards_stacked'; @b = sort $sortsub 4,1,3,2; cmp_ok("@b",'eq','4 3 2 1','sortname local 5'); @b = sort $sortglob 4,1,3,2; cmp_ok("@b",'eq','4 3 2 1','sortname local 6'); @b = sort $sortname 4,1,3,2; cmp_ok("@b",'eq','4 3 2 1','sortname local 7'); @b = sort $sortglobr 4,1,3,2; cmp_ok("@b",'eq','4 3 2 1','sortname local 8'); } ## exercise sort builtins... ($a <=> $b already tested) @a = ( 5, 19, 1996, 255, 90 ); @b = sort { my $dummy; # force blockness return $b <=> $a } @a; cmp_ok("@b",'eq','1996 255 90 19 5','force blockness'); $x = join('', sort { $a cmp $b } @harry); $expected = $upperfirst ? 'AbelCaincatdogx' : 'catdogxAbelCain'; cmp_ok($x,'eq',$expected,'a cmp b'); $x = join('', sort { $b cmp $a } @harry); $expected = $upperfirst ? 'xdogcatCainAbel' : 'CainAbelxdogcat'; cmp_ok($x,'eq',$expected,'b cmp a'); { use integer; @b = sort { $a <=> $b } @a; cmp_ok("@b",'eq','5 19 90 255 1996','integer a <=> b'); @b = sort { $b <=> $a } @a; cmp_ok("@b",'eq','1996 255 90 19 5','integer b <=> a'); $x = join('', sort { $a cmp $b } @harry); $expected = $upperfirst ? 'AbelCaincatdogx' : 'catdogxAbelCain'; cmp_ok($x,'eq',$expected,'integer a cmp b'); $x = join('', sort { $b cmp $a } @harry); $expected = $upperfirst ? 'xdogcatCainAbel' : 'CainAbelxdogcat'; cmp_ok($x,'eq',$expected,'integer b cmp a'); } $x = join('', sort { $a <=> $b } 3, 1, 2); cmp_ok($x,'eq','123',q(optimized-away comparison block doesn't take any other arguments away with it)); # test sorting in non-main package { package Foo; @a = ( 5, 19, 1996, 255, 90 ); @b = sort { $b <=> $a } @a; ::cmp_ok("@b",'eq','1996 255 90 19 5','not in main:: 1'); @b = sort ::Backwards_stacked @a; ::cmp_ok("@b",'eq','90 5 255 1996 19','not in main:: 2'); # check if context for sort arguments is handled right sub test_if_list { my $gimme = wantarray; ::is($gimme,1,'wantarray 1'); } my $m = sub { $a <=> $b }; sub cxt_one { sort $m test_if_list() } cxt_one(); sub cxt_two { sort { $a <=> $b } test_if_list() } cxt_two(); sub cxt_three { sort &test_if_list() } cxt_three(); sub cxt_three_anna_half { sort 0, test_if_list() } cxt_three_anna_half(); sub test_if_scalar { my $gimme = wantarray; ::is(!($gimme or !defined($gimme)),1,'wantarray 2'); } $m = \&test_if_scalar; sub cxt_four { sort $m 1,2 } @x = cxt_four(); sub cxt_five { sort { test_if_scalar($a,$b); } 1,2 } @x = cxt_five(); sub cxt_six { sort test_if_scalar 1,2 } @x = cxt_six(); } # test against a reentrancy bug { package Bar; sub compare { $a cmp $b } sub reenter { my @force = sort compare qw/a b/ } } { my($def, $init) = (0, 0); @b = sort { $def = 1 if defined $Bar::a; Bar::reenter() unless $init++; $a <=> $b } qw/4 3 1 2/; cmp_ok("@b",'eq','1 2 3 4','reenter 1'); ok(!$def,'reenter 2'); } { sub routine { "one", "two" }; @a = sort(routine(1)); cmp_ok("@a",'eq',"one two",'bug id 19991001.003'); } # check for in-place optimisation of @a = sort @a { my ($r1,$r2,@a); our @g; @g = (3,2,1); $r1 = \$g[2]; @g = sort @g; $r2 = \$g[0]; is "$r1-@g", "$r2-1 2 3", "inplace sort of global"; @a = qw(b a c); $r1 = \$a[1]; @a = sort @a; $r2 = \$a[0]; is "$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]; is "$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]; is "$r1-@g", "$r2-3 2 1", "inplace custom sort of global"; sub mysort { $b cmp $a }; @a = qw(b c a); $r1 = \$a[1]; @a = sort mysort @a; $r2 = \$a[0]; is "$r1-@a", "$r2-c b a", "inplace sort with function of lexical"; use Tie::Array; my @t; tie @t, 'Tie::StdArray'; @t = qw(b c a); @t = sort @t; is "@t", "a b c", "inplace sort of tied array"; @t = qw(b c a); @t = sort mysort @t; is "@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); is "@g", "0 1 2 3", "un-inplace sort of global"; @g = (3,2,1); @g = (sort(@g),'4'); is "@g", "1 2 3 4", "un-inplace sort of global 2"; @a = qw(b a c); @a = ('x', sort @a); is "@a", "x a b c", "un-inplace sort of lexical"; @a = qw(b a c); @a = ((sort @a), 'x'); is "@a", "a b c x", "un-inplace sort of lexical 2"; @g = (2,3,1); @g = ('0', sort { $b <=> $a } @g); is "@g", "0 3 2 1", "un-inplace reversed sort of global"; @g = (2,3,1); @g = ((sort { $b <=> $a } @g),'4'); is "@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); is "@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'); is "@g", "3 2 1 4", "un-inplace custom sort of global 2"; @a = qw(b c a); @a = ('x', sort mysort @a); is "@a", "x c b a", "un-inplace sort with function of lexical"; @a = qw(b c a); @a = ((sort mysort @a),'x'); is "@a", "c b a x", "un-inplace sort with function of lexical 2"; # RT#54758. Git 62b40d2474e7487e6909e1872b6bccdf812c6818 no warnings 'void'; my @m; push @m, 0 for 1 .. 1024; $#m; @m = sort @m; ::pass("in-place sorting segfault"); } # Test optimisations of reversed sorts. As we now guarantee stability by # default, # optimisations which do not provide this are bogus. { package Oscalar; use overload (qw("" stringify 0+ numify fallback 1)); sub new { bless [$_[1], $_[2]], $_[0]; } sub stringify { $_[0]->[0] } sub numify { $_[0]->[1] } } sub generate { my $count = 0; map {new Oscalar $_, $count++} qw(A A A B B B C C C); } my @input = &generate; my @output = sort @input; is join(" ", map {0+$_} @output), "0 1 2 3 4 5 6 7 8", "Simple stable sort"; @input = &generate; @input = sort @input; is join(" ", map {0+$_} @input), "0 1 2 3 4 5 6 7 8", "Simple stable in place sort"; # This won't be very interesting @input = &generate; @output = sort {$a <=> $b} @input; is "@output", "A A A B B B C C C", 'stable $a <=> $b sort'; @input = &generate; @output = sort {$a cmp $b} @input; is join(" ", map {0+$_} @output), "0 1 2 3 4 5 6 7 8", 'stable $a cmp $b sort'; @input = &generate; @input = sort {$a cmp $b} @input; is join(" ", map {0+$_} @input), "0 1 2 3 4 5 6 7 8", 'stable $a cmp $b in place sort'; @input = &generate; @output = sort {$b cmp $a} @input; is join(" ", map {0+$_} @output), "6 7 8 3 4 5 0 1 2", 'stable $b cmp $a sort'; @input = &generate; @input = sort {$b cmp $a} @input; is join(" ", map {0+$_} @input), "6 7 8 3 4 5 0 1 2", 'stable $b cmp $a in place sort'; @input = &generate; @output = reverse sort @input; is join(" ", map {0+$_} @output), "8 7 6 5 4 3 2 1 0", "Reversed stable sort"; @input = &generate; @input = reverse sort @input; is join(" ", map {0+$_} @input), "8 7 6 5 4 3 2 1 0", "Reversed stable in place sort"; @input = &generate; my $output = reverse sort @input; is $output, "CCCBBBAAA", "Reversed stable sort in scalar context"; @input = &generate; @output = reverse sort {$a cmp $b} @input; is join(" ", map {0+$_} @output), "8 7 6 5 4 3 2 1 0", 'reversed stable $a cmp $b sort'; @input = &generate; @input = reverse sort {$a cmp $b} @input; is join(" ", map {0+$_} @input), "8 7 6 5 4 3 2 1 0", 'revesed stable $a cmp $b in place sort'; @input = &generate; $output = reverse sort {$a cmp $b} @input; is $output, "CCCBBBAAA", 'Reversed stable $a cmp $b sort in scalar context'; @input = &generate; @output = reverse sort {$b cmp $a} @input; is join(" ", map {0+$_} @output), "2 1 0 5 4 3 8 7 6", 'reversed stable $b cmp $a sort'; @input = &generate; @input = reverse sort {$b cmp $a} @input; is join(" ", map {0+$_} @input), "2 1 0 5 4 3 8 7 6", 'revesed stable $b cmp $a in place sort'; @input = &generate; $output = reverse sort {$b cmp $a} @input; is $output, "AAABBBCCC", 'Reversed stable $b cmp $a sort in scalar context'; sub stuff { # Something complex enough to defeat any constant folding optimiser $$ - $$; } @input = &generate; @output = reverse sort {stuff || $a cmp $b} @input; is join(" ", map {0+$_} @output), "8 7 6 5 4 3 2 1 0", 'reversed stable complex sort'; @input = &generate; @input = reverse sort {stuff || $a cmp $b} @input; is join(" ", map {0+$_} @input), "8 7 6 5 4 3 2 1 0", 'revesed stable complex in place sort'; @input = &generate; $output = reverse sort {stuff || $a cmp $b } @input; is $output, "CCCBBBAAA", 'Reversed stable complex sort in scalar context'; sub sortr { reverse sort @_; } @output = sortr &generate; is join(" ", map {0+$_} @output), "8 7 6 5 4 3 2 1 0", 'reversed stable sort return list context'; $output = sortr &generate; is $output, "CCCBBBAAA", 'reversed stable sort return scalar context'; sub sortcmpr { reverse sort {$a cmp $b} @_; } @output = sortcmpr &generate; is join(" ", map {0+$_} @output), "8 7 6 5 4 3 2 1 0", 'reversed stable $a cmp $b sort return list context'; $output = sortcmpr &generate; is $output, "CCCBBBAAA", 'reversed stable $a cmp $b sort return scalar context'; sub sortcmprba { reverse sort {$b cmp $a} @_; } @output = sortcmprba &generate; is join(" ", map {0+$_} @output), "2 1 0 5 4 3 8 7 6", 'reversed stable $b cmp $a sort return list context'; $output = sortcmprba &generate; is $output, "AAABBBCCC", 'reversed stable $b cmp $a sort return scalar context'; sub sortcmprq { reverse sort {stuff || $a cmp $b} @_; } @output = sortcmpr &generate; is join(" ", map {0+$_} @output), "8 7 6 5 4 3 2 1 0", 'reversed stable complex sort return list context'; $output = sortcmpr &generate; is $output, "CCCBBBAAA", 'reversed stable complex sort return scalar context'; # And now with numbers sub generate1 { my $count = 'A'; map {new Oscalar $count++, $_} 0, 0, 0, 1, 1, 1, 2, 2, 2; } # This won't be very interesting @input = &generate1; @output = sort {$a cmp $b} @input; is "@output", "A B C D E F G H I", 'stable $a cmp $b sort'; @input = &generate1; @output = sort {$a <=> $b} @input; is "@output", "A B C D E F G H I", 'stable $a <=> $b sort'; @input = &generate1; @input = sort {$a <=> $b} @input; is "@input", "A B C D E F G H I", 'stable $a <=> $b in place sort'; @input = &generate1; @output = sort {$b <=> $a} @input; is "@output", "G H I D E F A B C", 'stable $b <=> $a sort'; @input = &generate1; @input = sort {$b <=> $a} @input; is "@input", "G H I D E F A B C", 'stable $b <=> $a in place sort'; # test that optimized {$b cmp $a} and {$b <=> $a} remain stable # (new in 5.9) without overloading { no warnings; @b = sort { $b <=> $a } @input = qw/5first 6first 5second 6second/; is "@b" , "6first 6second 5first 5second", "optimized {$b <=> $a} without overloading" ; @input = sort {$b <=> $a} @input; is "@input" , "6first 6second 5first 5second","inline optimized {$b <=> $a} without overloading" ; }; # These two are actually doing string cmp on 0 1 and 2 @input = &generate1; @output = reverse sort @input; is "@output", "I H G F E D C B A", "Reversed stable sort"; @input = &generate1; @input = reverse sort @input; is "@input", "I H G F E D C B A", "Reversed stable in place sort"; @input = &generate1; $output = reverse sort @input; is $output, "IHGFEDCBA", "Reversed stable sort in scalar context"; @input = &generate1; @output = reverse sort {$a <=> $b} @input; is "@output", "I H G F E D C B A", 'reversed stable $a <=> $b sort'; @input = &generate1; @input = reverse sort {$a <=> $b} @input; is "@input", "I H G F E D C B A", 'revesed stable $a <=> $b in place sort'; @input = &generate1; $output = reverse sort {$a <=> $b} @input; is $output, "IHGFEDCBA", 'reversed stable $a <=> $b sort in scalar context'; @input = &generate1; @output = reverse sort {$b <=> $a} @input; is "@output", "C B A F E D I H G", 'reversed stable $b <=> $a sort'; @input = &generate1; @input = reverse sort {$b <=> $a} @input; is "@input", "C B A F E D I H G", 'revesed stable $b <=> $a in place sort'; @input = &generate1; $output = reverse sort {$b <=> $a} @input; is $output, "CBAFEDIHG", 'reversed stable $b <=> $a sort in scalar context'; @input = &generate1; @output = reverse sort {stuff || $a <=> $b} @input; is "@output", "I H G F E D C B A", 'reversed stable complex sort'; @input = &generate1; @input = reverse sort {stuff || $a <=> $b} @input; is "@input", "I H G F E D C B A", 'revesed stable complex in place sort'; @input = &generate1; $output = reverse sort {stuff || $a <=> $b} @input; is $output, "IHGFEDCBA", 'reversed stable complex sort in scalar context'; sub sortnumr { reverse sort {$a <=> $b} @_; } @output = sortnumr &generate1; is "@output", "I H G F E D C B A", 'reversed stable $a <=> $b sort return list context'; $output = sortnumr &generate1; is $output, "IHGFEDCBA", 'reversed stable $a <=> $b sort return scalar context'; sub sortnumrba { reverse sort {$b <=> $a} @_; } @output = sortnumrba &generate1; is "@output", "C B A F E D I H G", 'reversed stable $b <=> $a sort return list context'; $output = sortnumrba &generate1; is $output, "CBAFEDIHG", 'reversed stable $b <=> $a sort return scalar context'; sub sortnumrq { reverse sort {stuff || $a <=> $b} @_; } @output = sortnumrq &generate1; is "@output", "I H G F E D C B A", 'reversed stable complex sort return list context'; $output = sortnumrq &generate1; is $output, "IHGFEDCBA", 'reversed stable complex sort return scalar context'; @output = reverse (sort(qw(C A B)), 0); is "@output", "0 C B A", 'reversed sort with trailing argument'; @output = reverse (0, sort(qw(C A B))); is "@output", "C B A 0", 'reversed sort with leading argument'; eval { @output = sort {goto sub {}} 1,2; }; $fail_msg = q(Can't goto subroutine outside a subroutine); cmp_ok(substr($@,0,length($fail_msg)),'eq',$fail_msg,'goto subr outside subr'); sub goto_sub {goto sub{}} eval { @output = sort goto_sub 1,2; }; $fail_msg = q(Can't goto subroutine from a sort sub); cmp_ok(substr($@,0,length($fail_msg)),'eq',$fail_msg,'goto subr from a sort sub'); eval { @output = sort {goto label} 1,2; }; $fail_msg = q(Can't "goto" out of a pseudo block); cmp_ok(substr($@,0,length($fail_msg)),'eq',$fail_msg,'goto out of a pseudo block 1'); sub goto_label {goto label} label: eval { @output = sort goto_label 1,2; }; $fail_msg = q(Can't "goto" out of a pseudo block); cmp_ok(substr($@,0,length($fail_msg)),'eq',$fail_msg,'goto out of a pseudo block 2'); sub self_immolate {undef &self_immolate; $a<=>$b} eval { @output = sort self_immolate 1,2,3 }; $fail_msg = q(Can't undef active subroutine); cmp_ok(substr($@,0,length($fail_msg)),'eq',$fail_msg,'undef active subr'); for(1,2) # We run this twice, to make sure sort does not lower the ref { # count. See bug 71076. my $failed = 0; sub rec { my $n = shift; if (!defined($n)) { # No arg means we're being called by sort() return 1; } if ($n<5) { rec($n+1); } else { () = sort rec 1,2; } $failed = 1 if !defined $n; } rec(1); ok(!$failed, "sort from active sub"); } # $a and $b are set in the package the sort() is called from, # *not* the package the sort sub is in. This is longstanding # de facto behaviour that shouldn't be broken. my $answer = "good"; () = sort OtherPack::foo 1,2,3,4; { package OtherPack; no warnings 'once'; sub foo { $answer = "something was unexpectedly defined or undefined" if defined($a) || defined($b) || !defined($main::a) || !defined($main::b); $main::a <=> $main::b; } } cmp_ok($answer,'eq','good','sort subr called from other package'); # Bug 36430 - sort called in package2 while a # sort in package1 is active should set $package2::a/b. { my $answer = "good"; my @list = sort { A::min(@$a) <=> A::min(@$b) } [3, 1, 5], [2, 4], [0]; cmp_ok($answer,'eq','good','bug 36430'); package A; sub min { my @list = sort { $answer = '$a and/or $b are not defined ' if !defined($a) || !defined($b); $a <=> $b; } @_; $list[0]; } } # Bug 7567 - an array shouldn't be modifiable while it's being # sorted in-place. { eval { @a=(1..8); @a = sort { @a = (0) } @a; }; $fail_msg = q(Modification of a read-only value attempted); cmp_ok(substr($@,0,length($fail_msg)),'eq',$fail_msg,'bug 7567'); eval { @a=1..3 }; is $@, "", 'abrupt scope exit turns off readonliness'; } { local $TODO = "sort should make sure elements are not freed in the sort block"; eval { @nomodify_x=(1..8); our @copy = sort { undef @nomodify_x; 1 } (@nomodify_x, 3); }; is($@, ""); } # Sorting shouldn't increase the refcount of a sub { sub sportello {(1+$a) <=> (1+$b)} my $refcnt = &Internals::SvREFCNT(\&sportello); @output = sort sportello 3,7,9; { package Doc; ::is($refcnt, &Internals::SvREFCNT(\&::sportello), "sort sub refcnt"); $fail_msg = q(Modification of a read-only value attempted); # Sorting a read-only array in-place shouldn't be allowed my @readonly = (1..10); Internals::SvREADONLY(@readonly, 1); eval { @readonly = sort @readonly; }; ::cmp_ok(substr($@,0,length($fail_msg)),'eq',$fail_msg,'in-place sort of read-only array'); } } # Using return() should be okay even in a deeper context @b = sort {while (1) {return ($a <=> $b)} } 1..10; is("@b", "1 2 3 4 5 6 7 8 9 10", "return within loop"); # Using return() should be okay even if there are other items # on the stack at the time. @b = sort {$_ = ($a<=>$b) + do{return $b<=> $a}} 1..10; is("@b", "10 9 8 7 6 5 4 3 2 1", "return with SVs on stack"); # As above, but with a sort sub rather than a sort block. sub ret_with_stacked { $_ = ($a<=>$b) + do {return $b <=> $a} } @b = sort ret_with_stacked 1..10; is("@b", "10 9 8 7 6 5 4 3 2 1", "return with SVs on stack"); # Comparison code should be able to give result in non-integer representation. sub cmp_as_string($$) { $_[0] < $_[1] ? "-1" : $_[0] == $_[1] ? "0" : "+1" } @b = sort { cmp_as_string($a, $b) } (1,5,4,7,3,2,3); is("@b", "1 2 3 3 4 5 7", "comparison result as string"); @b = sort cmp_as_string (1,5,4,7,3,2,3); is("@b", "1 2 3 3 4 5 7", "comparison result as string"); # RT #34604: sort didn't honour overloading if the overloaded elements # were retrieved via tie { package RT34604; sub TIEHASH { bless { p => bless({ val => 2 }), q => bless({ val => 1 }), } } sub FETCH { $_[0]{$_[1] } } my $cc = 0; sub compare { $cc++; $_[0]{val} cmp $_[1]{val} } my $cs = 0; sub str { $cs++; $_[0]{val} } use overload 'cmp' => \&compare, '""' => \&str; package main; tie my %h, 'RT34604'; my @sorted = sort @h{qw(p q)}; is($cc, 1, 'overload compare called once'); is("@sorted","1 2", 'overload sort result'); is($cs, 2, 'overload string called twice'); } fresh_perl_is('sub w ($$) {my ($l, my $r) = @_; my $v = \@_; undef @_; $l <=> $r}; print join q{ }, sort w 3, 1, 2, 0', '0 1 2 3', {stderr => 1, switches => ['-w']}, 'RT #72334'); fresh_perl_is('sub w ($$) {my ($l, my $r) = @_; my $v = \@_; undef @_; @_ = 0..2; $l <=> $r}; print join q{ }, sort w 3, 1, 2, 0', '0 1 2 3', {stderr => 1, switches => ['-w']}, 'RT #72334'); { my $count = 0; { package Counter; sub new { ++$count; bless []; } sub DESTROY { --$count; } } sub sorter ($$) { my ($l, $r) = @_; my $q = \@_; $l <=> $r; } is($count, 0, 'None before we start'); my @a = map { Counter->new() } 0..1; is($count, 2, '2 here'); my @b = sort sorter @a; is(scalar @b, 2); cmp_ok($b[0], '<', $b[1], 'sorted!'); is($count, 2, 'still the same 2 here'); @a = (); @b = (); is($count, 0, 'all gone'); } # [perl #77930] The context stack may be reallocated during a sort, as a # result of deeply-nested (or not-so-deeply-nested) calls # from a custom sort subroutine. fresh_perl_is ' $sub = sub { local $count = $count+1; ()->$sub if $count < 1000; $a cmp $b }; () = sort $sub qw<a b c d e f g>; print "ok" ', 'ok', {}, '[perl #77930] cx_stack reallocation during sort' ; # [perl #76026] # Match vars should not leak from one sort sub call to the next { my $output = ''; sub soarter { $output .= $1; "Leakage" =~ /(.*)/; 1 } sub soarterdd($$) { $output .= $1; "Leakage" =~ /(.*)/; 1 } "Win" =~ /(.*)/; my @b = sort soarter 0..2; like $output, qr/^(?:Win)+\z/, "Match vars do not leak from one plain sort sub to the next"; $output = ''; "Win" =~ /(.*)/; @b = sort soarterdd 0..2; like $output, qr/^(?:Win)+\z/, 'Match vars do not leak from one $$ sort sub to the next'; } # [perl #30661] autoloading AUTOLOAD { $b <=> $a } sub stubbedsub; is join("", sort stubbedsub split//, '04381091'), '98431100', 'stubborn AUTOLOAD'; is join("", sort hopefullynonexistent split//, '04381091'), '98431100', 'AUTOLOAD without stub'; my $stubref = \&givemeastub; is join("", sort $stubref split//, '04381091'), '98431100', 'AUTOLOAD with stubref'; # [perl #90030] sort without arguments eval '@x = (sort); 1'; is $@, '', '(sort) does not die'; is @x, 0, '(sort) returns empty list'; eval '@x = sort; 1'; is $@, '', 'sort; does not die'; is @x, 0, 'sort; returns empty list'; eval '{@x = sort} 1'; is $@, '', '{sort} does not die'; is @x, 0, '{sort} returns empty list'; # this happened while the padrange op was being added. Sort blocks # are executed in void context, and the padrange op was skipping pushing # the item in void cx. The net result was that the return value was # whatever was on the stack last. { my @a = sort { my $r = $a <=> $b; if ($r) { undef; # this got returned by mistake return $r } return 0; } 5,1,3,6,0; is "@a", "0 1 3 5 6", "padrange and void context"; } # Fatal warnings an sort sub returning a non-number # We need two evals, because the panic used to happen on scope exit. eval { eval { use warnings FATAL => 'all'; () = sort { undef } 1,2 } }; is $@, "", 'no panic/crash with fatal warnings when sort sub returns undef'; eval { eval { use warnings FATAL => 'all'; () = sort { "no thin" } 1,2 } }; is $@, "", 'no panic/crash with fatal warnings when sort sub returns string'; sub notdef($$) { undef } eval { eval { use warnings FATAL => 'all'; () = sort notdef 1,2 } }; is $@, "", 'no panic/crash with fatal warnings when sort sub($$) returns undef'; sub yarn($$) { "no thinking aloud" } eval { eval { use warnings FATAL => 'all'; () = sort yarn 1,2 } }; is $@, "", 'no panic/crash with fatal warnings when sort sub($$) returns string'; $#a = -1; () = [sort { $a = 10; $b = 10; 0 } $#a, $#a]; is $#a, 10, 'sort block modifying $a and $b'; () = sort { is \$a, \$a, '[perl #78194] op return values passed to sort'; 0 } "${\''}", "${\''}"; package deletions { @_=sort { delete $deletions::{a}; delete $deletions::{b}; 3 } 1..3; } pass "no crash when sort block deletes *a and *b";