java hashtable_hashmap_java – 为什么Hashtable的initialCapacity为11,而HashMap中的DEFAULT_INITIAL_CAPACITY为16并...

最新推荐文章于 2023-06-01 15:37:04 发布

挽挽深铃

最新推荐文章于 2023-06-01 15:37:04 发布

阅读量632

点赞数

文章标签： java hashtable_hashmap

本文链接：https://blog.csdn.net/weixin_35757732/article/details/115069343

版权

下面的文章详细解决了这个问题：

HashMap requires a better hashCode() – JDK 1.4 Part II。

根据该文章，移动到二的幂的主要原因是位屏蔽比整数除法快。这不是没有不良后果，这是由一个原作者解释：

07001: The downside of using a power-of-two is that the resulting hash table is very sensitive to the quality of the hash function (hashCode). It is imperative that any change in the input must affect the low order bits of the hash value. (Ideally, it should affect all bits of the hash value with equal likelihood.) Because we have no assurance that this is true, we put in a secondary (or “defensive”) hash function when we switched to the power-of-two hash table. This hash function is applied to the results of hashCode before masking off the low order bits. Its job is to scatter the information over all the bits, and in particular, into the low order bits. Of course it has to run very fast, or you lose the benefit of switching to the power-of-two-sized table. The original secondary hash function in 1.4 turned out to be insufficient. We knew that this was a theoretical possibility, but we thought that it didn’t affect any practical data sets. We were wrong. The replacement secondary hash function (which I developed with the aid of a computer) has strong statistical properties that pretty much guarantee good bucket distribution.