If the form of the data is appropriate to a hash then order of elements doesn't matter. If order of elements matters then a hash is not an appropriate representation. Of course it is always reasonable to extract keys or values from a hash into an array and sort that; or sort arrays and assemble them into hashes.
Therefore construct @name_this_array_wisely = keys %ifSpeeds; Sort that array to your taste and iterate through it.
In reply to Re: Looping Over Hash Skips an Element?
by Xiong
in thread Looping Over Hash Skips an Element?
by mmartin
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |