Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re: reusable hash value sort

by Revelation (Deacon)
on Jul 13, 2002 at 16:04 UTC ( [id://181493]=note: print w/replies, xml ) Need Help??


in reply to reusable hash value sort

First of all, this task is not one that should be undertaken by a subroutine using sort(). One must remember that sort sorts into an array, so there is no knowledge of the hash we sorted from! Therefore, the task you propose is (probbably) impossiblie, as long as you want to sort by_something, without giving it the hashes name, and globalizing the hash, or just passing the hash itself (Which will come up later).

The pragmatic programmer aproaches issues that he has trouble with, with differant. I have to ask, what is the purpose of a subroutine that sorts? Why not pass the subroutine a hash, , and hard code the sort/hash name into the script. (Does exactly the same thing, except you don't have to deal with those problems....)
key_val(%whatever_hash_name_you_want_); sub key_val { my %hash = shift; map {print "$_ - $hash{$_} \n";} sort{$hash{$a} cmp $hash{$b}} keys %h +ash; }
Passing coderefs would even allow you to print in any format you wished!

If, for some reason you *have* to have a subroutine block in the sort: It would be more pragmatic to just use the hashname as an arg. You can then shift the hashname, and do the sort, but this would not compy with strict (you can figure the code out yourself :) )

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others chilling in the Monastery: (5)
As of 2024-04-18 21:43 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found