Skip to content

Comment on Parallel Hashmap

Comments

Still the state of the art, bypassing folly and the swisstables on parallel benchmarks.

And even on single threaded workloads it's about 10x faster than std::unordered_map. My smhasher has benchmark tables.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.