Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine

RE: Dynamic sort algorithm selection

by dchetlin (Friar)
on Nov 15, 2000 at 05:53 UTC ( #41698=note: print w/replies, xml ) Need Help??

in reply to Dynamic sort algorithm selection

That should work just fine as you have it (and has worked that way as far back as 5.004, at least). You can have the name of the subroutine in the scalar passed to sort.

Not only that, but you can go one better. You can pass sort a reference to a subroutine. This is safer and cleaner and faster than using the name of the sub.

my $sortref = \&firstname_descending; my @order = sort $sortref keys %data;

For best results, combine this approach with a dispatch table that does your subroutine lookup.


Log In?

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

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (8)
As of 2016-10-25 11:19 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (317 votes). Check out past polls.