| Issue |
129384
|
| Summary |
[libc++] adapt "elastic hashing" in `std::__hash_table`
|
| Labels |
libc++,
performance
|
| Assignees |
|
| Reporter |
firewave
|
Recently I came across this article: [Undergrad and colleagues accidentally shred 40-year hash table gospel](https://www.theregister.com/2025/02/13/hash_table_breakthrough/).
It refers to another article ([Undergraduate Upends a 40-Year-Old Data Science Conjecture](https://www.quantamagazine.org/undergraduate-upends-a-40-year-old-data-science-conjecture-20250210/)) which is about the paper [Optimal Bounds for Open Addressing Without Reordering](https://arxiv.org/abs/2501.02305).
The paper is about assumptions in the implementation of hash tables and includes an insertion strategy referred to as "elastic hashing".
I do not know if this could actually be applied to the implementation of `std::__hash_table` but I thought it might be worth pointing out.
CC @ldionne as this concerns libc++ performance.
![]()
_______________________________________________
llvm-bugs mailing list
llvm-bugs@lists.llvm.org
https://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-bugs
