Martin Leitner-Ankerl

What SwissTable, Boost, F14, emhash8, emilib, indivi, Verstable, ihtab and unordered_dense put in front of their keys: every design read from its source, drawn to one scale, and measured on one machine - Two hash maps can agree on everything you would thi…

How ankerl::unordered_dense got 1.6x faster lookups with SSE2, explained for people who have never written an intrinsic - ankerl::unordered_dense is my C++ hash map.

Eight containers, fifteen workloads, and a little quiz that asks what your code does - Every few months somebody asks me which C++ hashmap is the fastest, and the honest answer is that the question is malformed.

A roof, a haircut, and a birthday. - The last few days were quite busy for me.

I chased a regression through two months of history where half the commits wouldn't even compile.

I tried three times to prove my old site was a disaster.

Where I've spent way too much time creating benchmarks of C++ hashmaps - It’s been over 3 years since I’ve spent considerable time finding the best C++ hashmap.

Some helpful Tricks - I recently upgraded from my 8 year old Kindle Keyboard (2011) to a brand new Kindle Paperwhite (2019, generation 10).

Finding the Fastest, Memory Efficient Hashmap - Table of Contents Overview Construction Benchmarks Construction & Destruction 👈 Construction & Insert 1 int & Destruction Modifying Benchmarks Insert & Erase 100M int Insert & Access with Varying Probability…

Finding the Fastest, Memory Efficient Hashmap - Table of Contents Overview Construction Benchmarks Construction & Destruction Construction & Insert 1 int & Destruction 👈 Modifying Benchmarks Insert & Erase 100M int Insert & Access with Varying Probability…

Finding the Fastest, Memory Efficient Hashmap - Table of Contents Overview Construction Benchmarks Construction & Destruction Construction & Insert 1 int & Destruction Modifying Benchmarks Insert & Erase 100M int 👈 Insert & Access with Varying Probability…

Finding the Fastest, Memory Efficient Hashmap - Table of Contents Overview Construction Benchmarks Construction & Destruction Construction & Insert 1 int & Destruction Modifying Benchmarks Insert & Erase 100M int Insert & Access with Varying Probability i…

Finding the Fastest, Memory Efficient Hashmap - Table of Contents Overview Construction Benchmarks Construction & Destruction Construction & Insert 1 int & Destruction Modifying Benchmarks Insert & Erase 100M int Insert & Access with Varying Probability i…

Finding the Fastest, Memory Efficient Hashmap - Table of Contents Overview Construction Benchmarks Construction & Destruction Construction & Insert 1 int & Destruction Modifying Benchmarks Insert & Erase 100M int Insert & Access with Varying Probability i…

Finding the Fastest, Memory Efficient Hashmap - Table of Contents Overview Construction Benchmarks Construction & Destruction Construction & Insert 1 int & Destruction Modifying Benchmarks Insert & Erase 100M int Insert & Access with Varying Probability i…

Finding the Fastest, Memory Efficient Hashmap - Table of Contents Overview Construction Benchmarks Construction & Destruction Construction & Insert 1 int & Destruction Modifying Benchmarks Insert & Erase 100M int Insert & Access with Varying Probability i…

Finding the Fastest, Memory Efficient Hashmap - Table of Contents Overview Construction Benchmarks Construction & Destruction Construction & Insert 1 int & Destruction Modifying Benchmarks Insert & Erase 100M int Insert & Access with Varying Probability i…

Finding the Fastest, Memory Efficient Hashmap - Table of Contents Overview Construction Benchmarks Construction & Destruction Construction & Insert 1 int & Destruction Modifying Benchmarks Insert & Erase 100M int Insert & Access with Varying Probability i…

Finding the Fastest, Memory Efficient Hashmap - Table of Contents Overview Construction Benchmarks Construction & Destruction Construction & Insert 1 int & Destruction Modifying Benchmarks Insert & Erase 100M int Insert & Access with Varying Probability i…

Finding the Fastest, Memory Efficient Hashmap - Table of Contents Overview Construction Benchmarks Construction & Destruction Construction & Insert 1 int & Destruction Modifying Benchmarks Insert & Erase 100M int Insert & Access with Varying Probability i…