The stupid question is the question not asked | |
PerlMonks |
Re: Save the resultant of " hash sorted by values "by CountZero (Bishop) |
on Mar 23, 2011 at 17:28 UTC ( [id://895058]=note: print w/replies, xml ) | Need Help?? |
It is a property of a hash that it knows no inherent "order", at least not one we, puny humans, would recognize as such. One can sort a hash according to its keys or values or whatever rule one likes, but this is entirely external to the hash and making a new hash on basis of this sorted version of the original hash, will immediately loose that sort order. If you need to keep your data in a certain order, either use an array (or an Array of Hashes, or similar structure) or use Tie::IxHash which implements Perl hashes that preserve the order in which the hash elements were added. Note that once an element is added to this type of hash, its place is fixed. Changing its key or value will NOT re-sort the hash! It would therefore be very wrong and misleading to call this some form of "sorted" hash. It is an hash with a fixed and predictable order of key retrieval only. CountZero A program should be light and agile, its subroutines connected like a string of pearls. The spirit and intent of the program should be retained throughout. There should be neither too little or too much, neither needless loops nor useless variables, neither lack of structure nor overwhelming rigidity." - The Tao of Programming, 4.1 - Geoffrey James
In Section
Seekers of Perl Wisdom
|
|