Whats the best way to structure a hash table?
Don’t ask me. I’m an expert on hash functions, not on the ways to use them. I do advocate hash tables whose size is a power of two if that makes your code simpler and you know you’ll use a decent hash. The best structure for a hash table varies with how you plan to use it. Wikipedia is a good place to start. If your requirements are more interesting than normal, I suggest you search for “cache lines”, “consistent hashing”, “lock free hash table”, “cuckoo hashing”, “bit array”, and “bloom filters”.
