Re^5: Hashes do preserve insertion order after all

This is pretty much what Hash::Ordered does, but with tombstoning to reduce the overheads when deleting. See its POD (and code) for details, as well as its benchmarking results.

Comment on Re^5: Hashes do preserve insertion order after all

Replies are listed 'Best First'.
Re^6: Hashes do preserve insertion order after all by LanX (Saint) on Aug 01, 2019 at 11:11 UTC
What a great and deep work. The author didn't only list a bunch of alternatives, but also provided a benchmark module to compare them. I was going to lament that the OO handling breaks with normal hash interface, but he also later added an alternative tie mechanism plus a backdoor with `tied` to access the methods directly! +++ Cheers Rolf _{(addicted to the Perl Programming Language :) Wikisyntax for the Monastery FootballPerl is like chess, only without the dice}	[reply] [d/l]
Re^7: Hashes do preserve insertion order after all by swl (Prior) on Aug 02, 2019 at 00:19 UTC
Yes, his modules are usually pretty good and with thorough documentation. The exceptions tend to be clearly flagged as experimental.	[reply]