in reply to Re: problem while sorting hash
in thread problem while sorting hash

davorg,
There is no such thing as a sorted hash (well, unless you use something like Tie::IxHash).

Minor nit: Tie::IxHash provides a facility to maintain insertion order. Any relationship of this order to a sorted list must be done by the user.* On the other hand, Tie::Hash::Sorted does provide a very flexible and relatively efficient way to keep your hash sorted regardless of hash modifications.

I am not advocating using tied hashes without proper consideration but rather trying to clarify a common misconception about Tie::IxHash that others seem to have.

Cheers - L~R

It does provide methods to get the keys or values, normally returned by insertion order, in asciibetical order. This does not re-order the hash.