RE: RE (tilly) 3: sort performance

[tye]

I suspect that the optimizer is just removing the whole $foo bit from "stupid" for you.

I was wondering if $a->[1] would be much faster than $hash{$a}{this}. I didn't think it would be by a big enough factor.

If you want raw speed here, create a side array for comparison and sort a list of indices:

my @list= keys %hash;
my @sort= map { $hash{$_}{this} } @list;
my @sorted= @list[
    sort { $sort[$a] cmp $sort[$b] } 0..$#sort  ];

        - tye (but my friends call me "Tye")

[tilly]

I suspected that, but it cannot be because the straight method without that line is much faster, and as you change the $foo line you see the speed of the stupid sort change.

I suspect a more fundamental issue with how map and grep are implemented, and it should IMO be fixable.