borisz,
I agree with you but feel you have left out some information that may result in misunderstandings. Insert order (which the modules you listed are good at) is often not the same as a desired sorted order. That is why I created Tie::Hash::Sorted. In this particular case, Tie::IxHash also can do naive sorts that meet the stated requirements but fail if gets any more complicated.