|
|
|
| P is for Practical | |
| PerlMonks |
Re (tilly) 3: More Sorted Business with Hashesby tilly (Archbishop) |
| on Jan 03, 2002 at 00:50 UTC ( [id://135886]=note: print w/replies, xml ) | Need Help?? |
This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.
The FAQ notwithstanding, the original statement is correct. Hash lookup algorithms produce fundamentally unordered results. Perl's hashes implement a concept properly called associative arrays. They are called hashes because that is how they work under the hood. Therefore native Perl hashes are not obviously ordered, and anything you run across in any language called a hash should be assumed to likewise be not obviously ordered.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||||