An efficient way to make hash maps with insertion ordering
The surprising&#x2F;interesting thing about this article is the notion that insertion order is the order that you want to iterate through a hash map.<p>In my experience, I&#x27;m doing either (A) using them as associative memory (I want the value for a key) and I don&#x27;t ever iterate, or (B) I don&#x27;t care about order when I iterate (I&#x27;m summing values, say) or (C) I want the keys in some <i>sorted</i> order, that probably has nothing whatsoever to do with insertion order (counting keywords, then showing them in alphabetical order).<p>So I&#x27;m curious why the insertion order is preferred, in your experience.