Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re^4: sorting a hash

by Ben Win Lue (Friar)
on Mar 27, 2005 at 17:33 UTC ( #442653=note: print w/replies, xml ) Need Help??


in reply to Re^3: sorting a hash
in thread sorting a hash

Thanks a lot to everyone. Especially the links were helpful.

It looks like I have to do as much copying operations as I expected.
But the hints you gave me give my code more perlish elegance.

Pustular Postulant is right, the records are much larger than the keys - but rethinking it - the records are just stored as pointers in a hash of hashes. So copying them won't hurt that much

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://442653]
help
Chatterbox?
and the monks are chillaxin'...

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (5)
As of 2016-12-08 08:35 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:













    Results (136 votes). Check out past polls.