The hash table with 997 buckets appears to follow a pattern on how it fills its buckets, whereas the hash table with the 97 buckets is more evenly distributed. Nevertheless, the bigger hash table has ...

The next evolution is to remove the node pointers, which transforms the implementation into a probing hash table (think dense_hash_set). The linked list is gone and replaced with an implicit list ...

Facebook open sources C++ F14 hash table Making fast hash tables in programming, which don't cause collision trouble, is one of computing's holy grails. Facebook thinks it's created a good one.