I have some code that uses std::unordered_map. I’m considering rewriting it to use TMap.
I am wondering if anyone has done any comparisons between the performance of TMap and std::unordered_map. From my understanding, the std::unordered_map is slow because it uses a nasty linked list for buckets. So, rather cache unfriendly with stuff everywhere in RAM.
TMap uses a contiguous block of memory, so it should be more cache friendly. So, it should be fast, but how fast I wonder?
Maybe I’ll do my own benchmarks if no one else has any measurements. Google also has a crazy fast “swiss tables” hash map optimized for the CPU cache and SIMD.