martinus/robin-hood-hashing
View on GitHub ↗ ★ 1,621 C++ archived
Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20
5 mentions on Hacker News by 5 people: 1 story, 4 comments · first 2021-05-23 · latest 2023-11-12
20082026
-
…Tsl, Martinus, and CC are all Robin Hood tables ( https://github.com/Tessil/robin-map , https://github.com/martinus/robin-hood-hashing , and https://github.com/JacksonAllan/CC , respectively). Absl (from Google) and Boost are well-known…
comment by JacksonAllan · 2023-11-12 · in Hashmaps in Factor are faster than in Zig -
…in that an O(n*log(n)) algorithm is not necessarily slower than an O(n) algorithm in practice. [1]: https://github.com/martinus/robin-hood-hashing
comment by attractivechaos · 2023-06-29 · in Solving “Two Sum” in C with a tiny hash table -
…unordered_set or unordered_map is in a hot part of the code, I'd also highly recommend Robin Hood: https://github.com/martinus/robin-hood-hashing It made a huge difference in one of the programs I was running. EDIT: I could have sworn they…
comment by Night_Thastus · 2023-03-02 · in Effortless Performance Improvements in C++: std:unordered_map -
…of std:: stuff - https://gist.github.com/jcelerier/74dfd473bccec8f1bd5d78be5a... ; boost, fmt and https://github.com/martinus/robin-hood-hashing $ g++ -I robin-hood-hashing/src/include -O2 -flto -std=c++20 -fno-exceptions…
comment by jcelerier · 2022-07-25 · in Performance comparison: counting words in Python, C/C++, Awk, Rust, and more -
▲ 2
Fast And Memory Efficient C++ Hashtable Based On Robin Hood Hashingstory by optimalsolver · 2021-05-23 · 0 comments