CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”
CppCon · 59:33 · Watch on YouTube
This talk shows how Google step-by-step evolved std::unorderedset into Swiss Table (flathashset/nodehashset) — a SIMD-accelerated open-addressing table that is ~2x faster than unorderedset, uses ~1% less fleet-wide RA...