Re^5: Hashes do preserve insertion order after all

[LanX]

You will always need to update two data structures if you reuse Perl structures.

The OP suggested using sort, so how efficient is that without caching the result?

Maybe B-Trees are better suited here, though this certainly depends on the use case.