Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number

Re: Complex Sort - using varying numbers of parameters

by RMGir (Prior)
on Jul 04, 2002 at 12:38 UTC ( #179441=note: print w/replies, xml ) Need Help??

in reply to Complex Sort - using varying numbers of parameters

It's mildly ugly, but in fact it's not really slow or all that fattening :)

The only problem with it is that you're going to be carrying the Sort key after you no longer need it.

ST to the rescue!

sub computeSortKey { my $aref=shift; my $sort; my $M = 100; for (@{$aref}) { $sort += $M * $_; $M = $M / 100; } return $sort; } #Schwartzian Transform @Tree = map {$_->[0]} sort {$a->[1] <=> $b->[1]} map {[ $_, computeSortKey($_->{Path})]} @Tree;
Note that I don't have perl on this PC, so I can't double check the code for syntax errors, but I think that'll work for you.

The advantages of doing it this way are that
1) it's a well known idiom, so a lot of perl programmers will grok right away what you're trying to do, and
2) you don't keep the sort key around after you no longer need it, so it keeps @Tree relatively clean.

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://179441]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (3)
As of 2021-08-04 05:11 GMT
Find Nodes?
    Voting Booth?
    My primary motivation for participating at PerlMonks is: (Choices in context)

    Results (41 votes). Check out past polls.