public class HashMap<K,V> extends AbstractMap<K,V>
implements Map<K,V>, Cloneable, Serializable {
private static final long serialVersionUID = 362498820763181265L;
//容量必须是2的指数次幂
static final int DEFAULT_INITIAL_CAPACITY = 1 << 4; // aka 16
//hashMap的最大容量为2^30次方
static final int MAXIMUM_CAPACITY = 1 << 30;
//默认的负载因子为0.75
static final float DEFAULT_LOAD_FACTOR = 0.75f;
//当链表中元素的数量到达8的时候，链表会转换成红黑树结构
static final int TREEIFY_THRESHOLD = 8;
//当bucket中的元素个数小于6的时候,红黑树结构转换成链表结构
static final int UNTREEIFY_THRESHOLD = 6;
//当HashMap中存在红黑树时，HashMap中数组（table）的最小容量为64
static final int MIN_TREEIFY_CAPACITY = 64;
//hash表中存储的每一个Node元素
static class Node<K,V> implements Map.Entry<K,V> {
final int hash;//元素的hash值
final K key;
V value;
Node<K,V> next;//该node节点的下一个节点
Node(int hash, K key, V value, Node<K,V> next) {
this.hash = hash;
this.key = key;
this.value = value;
this.next = next;
}
public final K getKey() { return key; }
public final V getValue() { return value; }
public final String toString() { return key + "=" + value; }
public final int hashCode() {
return Objects.hashCode(key) ^ Objects.hashCode(value);
}
public final V setValue(V newValue) {
V oldValue = value;
value = newValue;
return oldValue;
}
public final boolean equals(Object o) {
if (o == this)
return true;
if (o instanceof Map.Entry) {
Map.Entry<?,?> e = (Map.Entry<?,?>)o;
if (Objects.equals(key, e.getKey()) &&
Objects.equals(value, e.getValue()))
return true;
}
return false;
}
}
/**
key的hash值右移16位的原因：从putVal方法中可以看出，hashMap添加元素时，确认数组索引是用(p = tab[i = (n - 1) & hash])，
又因为n必须是2的整数次幂，所以n的表现形式只能是01111这种形式，所以当（n-1）与hash进行 与 运算时，起决定性作用的永远是hash。
01010010101000100101001100101010101
01111
------------------------------------
并且如上图所示，hash的32位二进制数中，能够起到运算作用的也只有后几位，这样计算出来的hash值重复率比较高。
所以需要让key.hashCode()右移16位，然后与自身进行 异或 运算。这样做可以降低hash值的重复率。
**/
static final int hash(Object key) {
int h;
return (key == null) ? 0 : (h = key.hashCode()) ^ (h >>> 16);
}
/**
* Returns x's Class if it is of the form "class C implements
* Comparable<C>", else null.
*/
static Class<?> comparableClassFor(Object x) {
if (x instanceof Comparable) {
Class<?> c; Type[] ts, as; Type t; ParameterizedType p;
if ((c = x.getClass()) == String.class) // bypass checks
return c;
if ((ts = c.getGenericInterfaces()) != null) {
for (int i = 0; i < ts.length; ++i) {
if (((t = ts[i]) instanceof ParameterizedType) &&
((p = (ParameterizedType)t).getRawType() ==
Comparable.class) &&
(as = p.getActualTypeArguments()) != null &&
as.length == 1 && as[0] == c) // type arg is c
return c;
}
}
}
return null;
}
/**
* Returns k.compareTo(x) if x matches kc (k's screened comparable
* class), else 0.
*/
@SuppressWarnings({"rawtypes","unchecked"}) // for cast to Comparable
static int compareComparables(Class<?> kc, Object k, Object x) {
return (x == null || x.getClass() != kc ? 0 :
((Comparable)k).compareTo(x));
}
//该方法的作用是初始化临界值的大小----->threshold,返回大于initialCapacity的最小的二次幂数值,
//如果在构造方法中传入的不是2的整数次幂，该方法会强制转换成2的整数次幂
static final int tableSizeFor(int cap) {
int n = cap - 1;
n |= n >>> 1;
n |= n >>> 2;
n |= n >>> 4;
n |= n >>> 8;
n |= n >>> 16;
return (n < 0) ? 1 : (n >= MAXIMUM_CAPACITY) ? MAXIMUM_CAPACITY : n + 1;
}
//存储元素的数组，总是2的幂次倍---->就是hash表中的数组
transient Node<K,V>[] table;
/**
* Holds cached entrySet(). Note that AbstractMap fields are used
* for keySet() and values().
*/
transient Set<Map.Entry<K,V>> entrySet;
//HashMap中所有key-value对的数量
transient int size;
//它是一个计数器，HashMap的结构每修改一次，modCount++
transient int modCount;
//它是一个临界值，当size变量达到这个临界值的时候，HashMap会自动扩容。threshold = capacity * loadFactor
int threshold;
//负载因子，默认为0.75
final float loadFactor;
//*--------------------------------------------------HashMap的构造方法------------------------------------------------------------------------*//
public HashMap(int initialCapacity, float loadFactor) {
if (initialCapacity < 0)
throw new IllegalArgumentException("Illegal initial capacity: " +
initialCapacity);
if (initialCapacity > MAXIMUM_CAPACITY)
initialCapacity = MAXIMUM_CAPACITY;
if (loadFactor <= 0 || Float.isNaN(loadFactor))
throw new IllegalArgumentException("Illegal load factor: " +
loadFactor);
this.loadFactor = loadFactor;
//强制将初始化容量装换成2的n次幂
this.threshold = tableSizeFor(initialCapacity);
}
public HashMap(int initialCapacity) {
this(initialCapacity, DEFAULT_LOAD_FACTOR);
}
public HashMap() {
this.loadFactor = DEFAULT_LOAD_FACTOR; // all other fields defaulted
}
public HashMap(Map<? extends K, ? extends V> m) {
this.loadFactor = DEFAULT_LOAD_FACTOR;
putMapEntries(m, false);
}
//该函数的作用是将m集合中的所有元素全部放入到该HashMap实例中
final void putMapEntries(Map<? extends K, ? extends V> m, boolean evict) {
int s = m.size();
if (s > 0) {
if (table == null) { // pre-size
float ft = ((float)s / loadFactor) + 1.0F;
int t = ((ft < (float)MAXIMUM_CAPACITY) ?
(int)ft : MAXIMUM_CAPACITY);
if (t > threshold)
threshold = tableSizeFor(t);
}
else if (s > threshold)
resize();
for (Map.Entry<? extends K, ? extends V> e : m.entrySet()) {
K key = e.getKey();
V value = e.getValue();
putVal(hash(key), key, value, false, evict);
}
}
}
//返回当前<key,value>的数量
public int size() {
return size;
}
public boolean isEmpty() {
return size == 0;
}
//提供的对外访问的方法，内部调用的getNode();
public V get(Object key) {
Node<K,V> e;
return (e = getNode(hash(key), key)) == null ? null : e.value;
}
/*
getNode的过程：1：首先判断当前HashMap是否为空并且根据key的Hash值判断当前索引处是否为空，若不为空，继续查找，为空，返回null
2:然后判断当前索引处的第一个元素是否与要找的元素相等，如果相等，返回第一个数据，若不等，继续查找
3：判断当前节点是否是红黑树结构，若是，遍历红黑树。若不是，遍历链表
*/
final Node<K,V> getNode(int hash, Object key) {
Node<K,V>[] tab; Node<K,V> first, e; int n; K k;
if ((tab = table) != null && (n = tab.length) > 0 &&
(first = tab[(n - 1) & hash]) != null) {
if (first.hash == hash && // always check first node
((k = first.key) == key || (key != null && key.equals(k))))
return first;
if ((e = first.next) != null) {
if (first instanceof TreeNode)//判断是否为红黑树
return ((TreeNode<K,V>)first).getTreeNode(hash, key);
do {
if (e.hash == hash &&
((k = e.key) == key || (key != null && key.equals(k))))
return e;
} while ((e = e.next) != null);//遍历链表
}
}
return null;
}
//判断HashMap中是否包含当前的key,实际调用getNode();
public boolean containsKey(Object key) {
return getNode(hash(key), key) != null;
}
//对外提供的向HashMap中添加元素的方法，内部实际调用的是putVal();
public V put(K key, V value) {
return putVal(hash(key), key, value, false, true);
}
/*
putVal的过程：（1）首先将node[] table 复值给一个空的数组 tab 判断tab[]是否为空，为null则进行扩容操作，不为null，利用key的Hash&（n-1）确定该元素在数组中的位置。
（2）判断该位置是否已经存在元素，若为null，则直接添加，不为null,判断当前元素的key与已有元素的key的hash和equals是否相等，若相等，则进行覆盖，返回oldVal
(3)若不相等，继续判断要加入的NOde是否属于红黑树结构，若属于，则以红黑树的方式进行添加操作，若不属于，则遍历后面的链表。
（4）若与链表中的某个元素相等，则进行覆盖，若不等，则添加到链表的最后面。
（5）添加完以后判断当前链表中元素的个数，有没有达到链表转换为红黑树的临界值（默认为8），若达到，则转换。
（6）最后判断hash表中的元素个数size，有没有达到扩容的临界值，若达到，则扩容。threshold = loadFactor * capacity
*/
final V putVal(int hash, K key, V value, boolean onlyIfAbsent,
boolean evict) {
Node<K,V>[] tab; Node<K,V> p; int n, i;
if ((tab = table) == null || (n = tab.length) == 0)
n = (tab = resize()).length;
if ((p = tab[i = (n - 1) & hash]) == null)
tab[i] = newNode(hash, key, value, null);
else {
Node<K,V> e; K k;
if (p.hash == hash &&
((k = p.key) == key || (key != null && key.equals(k))))
e = p;
else if (p instanceof TreeNode)
e = ((TreeNode<K,V>)p).putTreeVal(this, tab, hash, key, value);
else {
for (int binCount = 0; ; ++binCount) {//遍历链表
if ((e = p.next) == null) {
p.next = newNode(hash, key, value, null);
if (binCount >= TREEIFY_THRESHOLD - 1) // -1 for 1st
treeifyBin(tab, hash);//转成红黑树
break;
}
if (e.hash == hash &&
((k = e.key) == key || (key != null && key.equals(k))))
break;
p = e;
}
}
if (e != null) { // existing mapping for key
V oldValue = e.value;
if (!onlyIfAbsent || oldValue == null)
e.value = value;
afterNodeAccess(e);
return oldValue;
}
}
++modCount;
if (++size > threshold)
resize();//扩容
afterNodeInsertion(evict);
return null;
}
/**
* Initializes or doubles table size. If null, allocates in
* accord with initial capacity target held in field threshold.
* Otherwise, because we are using power-of-two expansion, the
* elements from each bin must either stay at same index, or move
* with a power of two offset in the new table.
*
* @return the table
初始化或者翻倍表大小。
* 如果表为null，则根据存放在threshold变量中的初始化capacity的值来分配table内存
* （这个注释说的很清楚，在实例化HashMap时，capacity其实是存放在了成员变量threshold中，
* 注意，HashMap中没有capacity这个成员变量）
* 。如果表不为null，由于我们使用2的幂来扩容，
* 则每个bin元素要么还是在原来的bucket中，要么在2的幂中
*/
final Node<K,V>[] resize() {
Node<K,V>[] oldTab = table;
int oldCap = (oldTab == null) ? 0 : oldTab.length;
int oldThr = threshold;
int newCap, newThr = 0;
if (oldCap > 0) {
if (oldCap >= MAXIMUM_CAPACITY) {
threshold = Integer.MAX_VALUE;
return oldTab;
}
else if ((newCap = oldCap << 1) < MAXIMUM_CAPACITY &&
oldCap >= DEFAULT_INITIAL_CAPACITY)
newThr = oldThr << 1; // double threshold
}
else if (oldThr > 0) // initial capacity was placed in threshold
newCap = oldThr;
else { // zero initial threshold signifies using defaults
newCap = DEFAULT_INITIAL_CAPACITY;
newThr = (int)(DEFAULT_LOAD_FACTOR * DEFAULT_INITIAL_CAPACITY);
}
if (newThr == 0) {
float ft = (float)newCap * loadFactor;
newThr = (newCap < MAXIMUM_CAPACITY && ft < (float)MAXIMUM_CAPACITY ?
(int)ft : Integer.MAX_VALUE);
}
threshold = newThr;
@SuppressWarnings({"rawtypes","unchecked"})
Node<K,V>[] newTab = (Node<K,V>[])new Node[newCap];
table = newTab;
if (oldTab != null) {
for (int j = 0; j < oldCap; ++j) {
Node<K,V> e;
if ((e = oldTab[j]) != null) {
oldTab[j] = null;
if (e.next == null)
newTab[e.hash & (newCap - 1)] = e;
else if (e instanceof TreeNode)
((TreeNode<K,V>)e).split(this, newTab, j, oldCap);
else { // preserve order
Node<K,V> loHead = null, loTail = null;
Node<K,V> hiHead = null, hiTail = null;
Node<K,V> next;
do {
next = e.next;
if ((e.hash & oldCap) == 0) {
if (loTail == null)
loHead = e;
else
loTail.next = e;
loTail = e;
}
else {
if (hiTail == null)
hiHead = e;
else
hiTail.next = e;
hiTail = e;
}
} while ((e = next) != null);
if (loTail != null) {
loTail.next = null;
newTab[j] = loHead;
}
if (hiTail != null) {
hiTail.next = null;
newTab[j + oldCap] = hiHead;
}
}
}
}
}
return newTab;
}
7205
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
