Hacker News new | ask | show | jobs
by tarasglek 181 days ago
hash collision limitation for keys is the most questionable part of design. Usually thats handled by forcing key lookup to verify that what you looked up matches what you tried to lookup. Resolving this perf hit is probably doable by having an extra table of conflicting hashes
1 comments

(author here)

The documentation page is out of date, the format now resolves collisions through quadratic probing.