Why Hashbrown Does a Double Lookup
If memory overhead (load factor) isn't a big issue, readers may also find cuckoo hashing rather interesting. (Theoretically, it has a worst-case constant lookup time. Learned about it in one of my university algorithms classes, but have yet to see an implementation in practice.)<p><a href="https://en.wikipedia.org/wiki/Cuckoo_hashing" rel="nofollow">https://en.wikipedia.org/wiki/Cuckoo_hashing</a>