为什么HashMap 的加载因子是0.75？

最新推荐文章于 2024-10-17 10:27:13 发布

天空～之城

最新推荐文章于 2024-10-17 10:27:13 发布

阅读量144

点赞数

分类专栏：技术问答文章标签： java

技术问答专栏收录该内容

123 篇文章 4 订阅

订阅专栏

在这里插入图片描述

static final int hash(Object key) {
    int h;
    return (key == null) ? 0 : (h = key.hashCode()) ^ (h >>> 16);
}
// AbstractMap
public int hashCode() {
     int h = 0;
     Iterator<Entry<K,V>> i = entrySet().iterator();
     while (i.hasNext())
         h += i.next().hashCode();

     return h;
}

在这里插入图片描述

Hi = (H(key) + di) MOD m，其中i=1,2,…,k(k<=m-1)

在这里插入图片描述

Hi = RHi(key), 其中i=1,2,…,k

在这里插入图片描述

* Ideally, under random hashCodes, the frequency of
* nodes in bins follows a Poisson distribution
* (http://en.wikipedia.org/wiki/Poisson_distribution) with a
* parameter of about 0.5 on average for the default resizing
* threshold of 0.75, although with a large variance because of
* resizing granularity. Ignoring variance, the expected
* occurrences of list size k are (exp(-0.5) * pow(0.5, k) /
* factorial(k)). The first values are:
* 0:    0.60653066
* 1:    0.30326533
* 2:    0.07581633
* 3:    0.01263606
* 4:    0.00157952
* 5:    0.00015795
* 6:    0.00001316
* 7:    0.00000094
* 8:    0.00000006
* more: less than 1 in ten million

在这里插入图片描述

0:    0.60653066
1:    0.30326533
2:    0.07581633
3:    0.01263606
4:    0.00157952
5:    0.00015795
6:    0.00001316
7:    0.00000094
8:    0.00000006