Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
PerlMonks  

Re: Sorting by the value of the inner hash

by halley (Prior)
on Mar 31, 2004 at 14:58 UTC ( [id://341306]=note: print w/replies, xml ) Need Help??


in reply to Sorting by the value of the inner hash

First, DamnedDirtyApe gave you a strong hint: the first line has a typo where you missed a dollar sign. This would put all the scores on a single key 'key2' in what you're calling the inner hash.

Second, maybe this mistake was just typing your example wrong, but that's why we want you to know How to ask questions the smart way.

Third, boil your test case down to a single routine which you CAN copy here in whole. This allows people to use their computers, not just their eyeballs, to help you find the problem. That includes a sample __DATA__ section if necessary. If we can't reproduce your problem at our desks, we are limited in how we can help.

# build a data structure from <DATA> # use the data structure (print loops, etc.) # support the data structure (custom sort routines, etc.) __DATA__ # provide sample data

--
[ e d @ h a l l e y . c c ]

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (6)
As of 2024-04-20 00:16 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found