Re:An efficient way to make hash maps with insertion ordering
by arsome on Thursday July 01, 2021 @09:49PM
(#27707065)
That's very similar to the solution I'm using and that I hate - it involves unnecessary generation and storage of strings and is far less ideal than something like the implementation in tstl I linked above where you can simply provide a custom hash function and equality comparison.
[ Parent
| on HN ]
There are no comments on this comment yet.