＜细节向＞jdk1.8中HashMap底层链表转红黑树的阈值为什么是8？红黑树转链表为什么是6？

最新推荐文章于 2023-11-20 18:17:50 发布

Sirius_7

最新推荐文章于 2023-11-20 18:17:50 发布

阅读量2.5k

点赞数 7

分类专栏：数据结构 JAVA 文章标签：链表 hashmap java jdk 哈希

本文链接：https://blog.csdn.net/weixin_38107316/article/details/107952418

版权

本文探讨了JDK1.8中HashMap中链表转红黑树阈值为8的原因，以及红黑树转链表阈值为6的考虑。这与hashcode碰撞次数的泊松分布有关，旨在平衡时间和空间效率。实验数据显示，8次碰撞的概率极低，超过此阈值意味着高概率的hash冲突，适合转为红黑树。而阈值为6能避免频繁的转换，防止资源浪费。

摘要由CSDN通过智能技术生成

先看源码

/*
     * Implementation notes.
     *
     * This map usually acts as a binned (bucketed) hash table, but
     * when bins get too large, they are transformed into bins of
     * TreeNodes, each structured similarly to those in
     * java.util.TreeMap. Most methods try to use normal bins, but
     * relay to TreeNode methods when applicable (simply by checking
     * instanceof a node).  Bins of TreeNodes may be traversed and
     * used like any others, but additionally support faster lookup
     * when overpopulated. However, since the vast majority of bins in
     * normal use are not overpopulated, checking for existence of
     * tree bins may be delayed in the course of table methods.
     *
     * Tree bins (i.e., bins whose elements are all TreeNodes) are
     * ordered primarily by hashCode, but in the case of ties, if two
     * elements are of the same "class C implements C