Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic

Re: Sort of anonymous hash

by ccn (Vicar)
on Sep 29, 2009 at 16:51 UTC ( #798162=note: print w/replies, xml ) Need Help??

in reply to Sort of anonymous hash

Schwartzian transform

for my $d ( map { $_->[0] } sort { $a->[1] cmp $b->[1] } map { [ $_, $hash{$_}{desc} ] } keys %hash ) { }

Replies are listed 'Best First'.
Re^2: Sort of anonymous hash
by ikegami (Pope) on Sep 29, 2009 at 16:54 UTC
    Simpler and faster:
    for my $d ( sort { $hash{$a}{desc} cmp $hash{$b}{desc} } keys %hash ) { }
Re^2: Sort of anonymous hash
by johngg (Abbot) on Sep 29, 2009 at 19:30 UTC

    To expand on ikegami's response, using a Schwartzian Transform only makes sense when the item(s) by which to sort is/are obtained by some expensive transformation. That transformation gets repeated many times for each element being sorted as the sort algorith moves it into the right place by successive comparisons with other elements. There was no transformation required in your code as $hash{$_}{desc} could be accessed directly.

    Consider the following two code snippets that sort files by modification time (requiring an lstat call, our expensive transformation). Note the timings; using Benchmark would be better but this was just a quick example.

    knoppix@Knoppix:~$ time perl -Mstrict -wle ' -> my $d = q{/usr/bin}; -> my @fns = do { opendir my $dh, $d or die $!; readdir $dh }; -> my @sorted = -> sort { ( lstat qq{$d/$a} )[ 9 ] <=> ( lstat qq{$d/$b} )[ 9 ] } -> @fns;' real 0m1.614s user 0m0.307s sys 0m1.273s knoppix@Knoppix:~$ time perl -Mstrict -wle ' -> my $d = q{/usr/bin}; -> my @fns = do { opendir my $dh, $d or die $!; readdir $dh }; -> my @sorted = -> map { $_->[ 0 ] } -> sort { $a->[ 1 ] <=> $b->[ 1 ] } -> map { [ $_, lstat qq{$d/$_} ] } -> @fns;' real 0m0.281s user 0m0.100s sys 0m0.160s knoppix@Knoppix:~$

    I hope this is of interest.



      It is, indeed.
      ikegami's response was surely the most correct, because with no transformation involved, direct access is always faster.

      My question was to illustrate a point, i.e. if there was some perl placeholder to accomodate for an anonymous hash being created by another function.
        Yes. They're called variables.
        for my $d (sort {$descs->{$a} cmp $descs->{$b}} keys %{ $descs = {map +{$_ => $hash{$_}{desc}} keys %hash}} ) { ... ... }

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://798162]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (2)
As of 2017-08-19 15:11 GMT
Find Nodes?
    Voting Booth?
    Who is your favorite scientist and why?

    Results (311 votes). Check out past polls.