Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
PerlMonks  

Why not use a hash?

by tedv (Pilgrim)
on Dec 12, 2000 at 21:56 UTC ( #46283=note: print w/ replies, xml ) Need Help??


in reply to sort my arrayref

From the example data, you might be better off with a hash. It's much, much easier to manipulate (oops => 0, happy => 2, word => 4) than crazy array accessing. On top of that, it's clear you don't care about the original order of the array because you're sorting it. The only reason you might not be able to use an array is if you want to have duplicate entries (like [happy, 2], [happy, 2], or [oops, 0], [happy, 0], [happy, 2]. The second one doesn't have any true duplicates, but it's constructed in a way that you can't use either the left or the right element for the hash keys. But I doubt this is the case. Determine which value you will more commonly use for access (probably the number) and use it for hash keys.

-Ted


Comment on Why not use a hash?
Select or Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (4)
As of 2014-09-01 23:37 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite cookbook is:










    Results (18 votes), past polls