Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re (tilly) 3: More Sorted Business with Hashes

by tilly (Archbishop)
on Jan 03, 2002 at 05:50 UTC ( [id://135886] : note . print w/replies, xml ) Need Help??


in reply to Re: Re: More Sorted Business with Hashes
in thread More Sorted Business with Hashes

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.

  • Comment on Re (tilly) 3: More Sorted Business with Hashes