From aa48942d91a978a4b3669654b815115d255eb00f Mon Sep 17 00:00:00 2001 From: Abdelrahman Said Date: Mon, 31 Aug 2026 23:34:56 +0100 Subject: [PATCH] Get most recent ankerl implementation --- documents/hash_tables_refs.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/documents/hash_tables_refs.md b/documents/hash_tables_refs.md index 3deb84b..3794223 100644 --- a/documents/hash_tables_refs.md +++ b/documents/hash_tables_refs.md @@ -24,7 +24,7 @@ uint64_t fold_128_to_64(uint128_t hash) { - [Gankra/Faultlore — clearest walkthrough from first principles](https://faultlore.com/blah/robinhood-part-1) - [Sebastian Sylvan — popularized Robin Hood in systems programming](https://www.sebastiansylvan.com/post/robin-hood-hashing-should-be-your-default-hash-table-implementation/) - [Emmanuel Goossaert — detailed C++ implementation + backward-shift deletion](http://codecapsule.com/2013/11/11/robin-hood-hashing/) -- [Martinus (Ankerl) — most widely used C++ implementation](https://github.com/martinus/robin-hood-hashing) +- [Martinus (Ankerl) — most widely used C++ implementation](https://github.com/martinus/unordered_dense) - [Tessil — clean header-only C++ implementation](https://github.com/Tessil/robin-map) - [Malte Skarupke — Robin Hood with probe count limit](https://github.com/skarupke/flat_hash_map)