yaclty/Java-Interview-Guide
1
0
Fork 0
mirror of https://github.com/Snailclimb/JavaGuide synced 2025-06-16 18:10:13 +08:00
Code Issues Projects Releases Wiki Activity

[docs improve]优化表述

Browse Source 
HashMap源码&底层数据结构分析#JDK1.8 之后-类的属性
(docs/java/collection/hashmap-source-code.md)
This commit is contained in:
Sr 2022-02-11 22:08:52 +08:00 committed by GitHub
parent 58ed684131
commit 810fc9f426
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
docs/java/collection/hashmap-source-code.md
View File

@ -85,7 +85,7 @@ public class HashMap<K,V> extends AbstractMap<K,V> implements Map<K,V>, Cloneabl
static final int TREEIFY_THRESHOLD = 8; static final int TREEIFY_THRESHOLD = 8;
// 当桶(bucket)上的结点数小于这个值时树转链表 // 当桶(bucket)上的结点数小于这个值时树转链表
static final int UNTREEIFY_THRESHOLD = 6; static final int UNTREEIFY_THRESHOLD = 6;
// 桶中结构转化为红黑树对应的table的最小大小 // 桶中结构转化为红黑树对应的table的最小容量
static final int MIN_TREEIFY_CAPACITY = 64; static final int MIN_TREEIFY_CAPACITY = 64;
// 存储元素的数组，总是2的幂次倍 // 存储元素的数组，总是2的幂次倍
transient Node<k,v>[] table; transient Node<k,v>[] table;
@ -95,7 +95,7 @@ public class HashMap<K,V> extends AbstractMap<K,V> implements Map<K,V>, Cloneabl
transient int size; transient int size;
// 每次扩容和更改map结构的计数器 // 每次扩容和更改map结构的计数器
transient int modCount; transient int modCount;
// 临界值 当实际大小(容量*填充因子)超过临界值时，会进行扩容 // 临界值(容量*填充因子) 当实际大小超过临界值时，会进行扩容
int threshold; int threshold;
// 加载因子 // 加载因子
final float loadFactor; final float loadFactor;
@ -562,4 +562,4 @@ public class HashMapDemo {
} }
} }
``` ```