Skip to content

How HashMap works in Java

javarevisited.blogspot.com
7 pointsmono3 comments
On HN

Comments

Does anyone know why they chose to go with linear probing over double hashing? I could never really think of why one would be more advantageous than the other.

Linear probing will always let you fill a hash table to a load factor (\alpha) of 1. Double hashing may prohibit this, even if it is more efficient for smaller values of \alpha.

That was utterly unreadable.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.