Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re: Re: Re: hard referencing in hashes?!?

by DamnDirtyApe (Curate)
on Nov 08, 2002 at 04:08 UTC ( [id://211329]=note: print w/replies, xml ) Need Help??


in reply to Re: Re: hard referencing in hashes?!?
in thread hard referencing in hashes?!?

Look at using a Schwartzian Transform:

my @sorted = sort { $b->[1] <=> $a->[1] } map { [ $_, $word_count{$_} ] } keys %word_count ;

_______________
DamnDirtyApe
Those who know that they are profound strive for clarity. Those who
would like to seem profound to the crowd strive for obscurity.
            --Friedrich Nietzsche

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others having an uproarious good time at the Monastery: (4)
As of 2024-04-16 13:40 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found