Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re: Problem with HOA.

by cog (Parson)
on Aug 28, 2006 at 07:10 UTC ( #569939=note: print w/replies, xml ) Need Help??


in reply to Problem with HOA.

my @array = map { $hash{$_}->[0] } sort { $a <=> $b } keys %hash;

That's the first solution that comes to my mind. Try reading it backwards:

    1. Take the keys of the hash... (keys %hash)
    2. ...sort them numerically... (sort { $a <=> $b } ...)
    3. ...and get the first element of the array corresponding to each key in the hash... (map { $hash{$_}->[0] } ...)

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://569939]
help
Chatterbox?
[perldigious]: Quick question, is undef %hash a recommended/good way to delete an entire hash structure from memory? Or sould I be doing it some other way?
[1nickt]: The best way is to scope it tightly so it just goes away when you are finished with it.
[perldigious]: but... but... perldigious is the unvirtuous kind of lazy in this case. :-)
[perldigious]: Just kidding. Thanks 1nickt, I'll go ahead and do it the right way. An extra set of brackets and a little extra indentation isn't too much to ask.

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (9)
As of 2017-07-21 19:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I came, I saw, I ...
























    Results (335 votes). Check out past polls.