4 ms·
No. Fundamentally it's not possible to be faster.
by szmarczak 3mo ago
No. Fundamentally it's not possible to be faster.
- infamouscow 3mo agoThis is not true. It is fast as a general purpose hash table, but claiming it's the fastest across all datasets and workloads is silly.
- szmarczak 3mo ago> claiming it's the fastest across all datasets I never claimed so. Please stop stating I said something when I didn't. > as a general purpose hash table That's what I claimed. The question IS about hash tables. If you want a hash table of any content, it's impossible to get faster. Unless you check all possible keys at once - only this will get you faster.