Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re^2: Custom, Reusable Sort Subroutine for Hashes?

by QM (Parson)
on Aug 30, 2017 at 13:08 UTC ( #1198333=note: print w/replies, xml ) Need Help??


in reply to Re: Custom, Reusable Sort Subroutine for Hashes?
in thread Custom, Reusable Sort Subroutine for Hashes?

Yes, very helpful.

I was anticipating a sub generator of some sort, where the hash and comparison function are passed in, and a new anonymous sub is returned. This sub could then be used in the code block position of the sort command.

Perhaps something like this, which steals some ideas from Choroba's post, though I've not tried it:

sub make_sort_sub { my $coderef = shift; my $hashref = shift; my $sort_sub = sub { something goes here } return $sort_sub; } my %hash = ( a => 5, b => 4, c => 3 ); my $keys_by_value = make_sort_sub( { $hashref->{$a} <=> $hashref->{$b} }, \%hash); my @keys_sorted_by_value = sort $keys_by_value %hash;

Then $keys_by_value can be reused elsewhere on the same hash. But can't be used on a different hash. :(

Hmmm, I'm thinking there's not a really elegant solution.

-QM
--
Quantum Mechanics: The dreams stuff is made of

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (4)
As of 2018-07-21 00:35 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    It has been suggested to rename Perl 6 in order to boost its marketing potential. Which name would you prefer?















    Results (442 votes). Check out past polls.

    Notices?