HashMap源码分析
不分析红黑树的情况。。水平不到
类声明：
public class HashMap<K,V> extends AbstractMap<K,V>
implements Map<K,V>, Cloneable, Serializable 常量：
1.DEFAULT_INITIAL_CAPACITY :默认初始化的容量（一般称作”桶”的数量）
默认认值为16。一般第一次扩容时会扩容到64，之后好像是2倍。总之，容量都是2的幂。
static final int DEFAULT_INITIAL_CAPACITY = 1 << 4;2.MAXIMUM_CAPACITY:最大容量（桶的最大个数）
static final int MAXIMUM_CAPACITY = 1 << 30;3.DEFAULT_LOAD_FACTOR:
loadFactor译为装载因子。装载因子用来衡量HashMap满的程度。loadFactor的默认值为0.75f。计算HashMap的实时装载因子的方法为：size/capacity，而不是占用桶的数量去除以capacity。
static final float DEFAULT_LOAD_FACTOR = 0.75f;4.TREEIFY_THRESHOLD:
一个桶中bin（箱子）的存储方式由链表转换成树的阈值。即当桶中bin的数量超过TREEIFY_THRESHOLD时使用树来代替链表。默认值是8
static final int TREEIFY_THRESHOLD = 8;5.UNTREEIFY_THRESHOLD:
当执行resize操作时，当桶中bin的数量少于UNTREEIFY_THRESHOLD时使用链表来代替树。默认值是6
static final int UNTREEIFY_THRESHOLD = 6;6.MIN_TREEIFY_CAPACITY:
当桶中的bin被树化时最小的hash表容量。（如果没有达到这个阈值，即hash表容量小于MIN_TREEIFY_CAPACITY，当桶中bin的数量太多时会执行resize扩容操作）这个MIN_TREEIFY_CAPACITY的值至少是TREEIFY_THRESHOLD的4倍。
static final int MIN_TREEIFY_CAPACITY = 64;成员变量：
1.table:存放Node的数组，我们一般称其为”桶”，table容量的大小也称作”桶的大小”
要求：第一次使用的时候被初始化，根据需要可以重新resize。分配的长度总是2的幂。
transient Node<K,V>[] table;2.entrySet:分别可以得到key/value的集合
当被调用entrySet时被赋值。通过keySet()方法可以得到map key的集合，通过values方法可以得到map value的集合
transient Set<Map.Entry<K,V>> entrySet;3.size:存放键值对的总数
注意是存放键值对的总数，而不是table数组中存放Node的长度
transient int size;4.modCount:
HashMap被结构性修改的次数。（结构性修改是指改变了KV映射数量的操作或者修改了HashMap的内部结构（如 rehash）。这个用于fail-fast。
transient int modCount;5.threshold:默认是16*0.75 = 12
当需要resize时的阈值。即当HashMap中KV映射的数量（即size）超过了threshold就会resize。threshold=capacity*loadFactor。(capacity不是一个成员变量或者类变量，他表示的是当前申请的总容量的大小)
int threshold;6.loadFactor:装载因子（默认值为DEFAULT_LOAD_FACTOR(0.75f)）
>
final float loadFactor;构造器：
1.HashMap(int initialCapacity, float loadFactor):指定阀值和装载因子的大小
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;
this.threshold = tableSizeFor(initialCapacity);
}
- initialCapacity用来初始化阀值。（注意用tableSizeFor()方法来使阀值的大小为2的次幂）
- loadFactor用来初始化装载因子。
2.HashMap(int initialCapacity):指定阀值的大小，装载因子使用默认值(0.75f)
public HashMap(int initialCapacity) {
this(initialCapacity, DEFAULT_LOAD_FACTOR);
}3.HashMap():创建一个’空’的HashMap，并指定装载因子为0.75f;
public HashMap() {
this.loadFactor = DEFAULT_LOAD_FACTOR; // all other fields defaulted
}4.HashMap(Map
public HashMap(Map<? extends K, ? extends V> m) {
this.loadFactor = DEFAULT_LOAD_FACTOR;
putMapEntries(m, false);
}内部类：
1.Node
static class Node<K,V> implements Map.Entry<K,V> {
final int hash;
final K key;
V value;
Node<K,V> next;
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;
}
}
- 每一个Node对象就表示一个键值对
- 注意Node中有一个next属性，可以得出Node同时也一个链表上的节点
- 提供了对key的get方法，对value的get/set方法；重写了toString方法，以 key=value的形式返回字符串。
- 重写了hashCode()和equals()方法。
- hashCode()方法：返回通过根类Object中hashCode()方法得到的key与value的异或值，根据数据结构中异或链表的知识，key值(或value值)与值取异或得到的是value值(或key值)
- equals()方法：只有两个Node节点中的key相等并且value也相等才返回true(这里的相等是指key，value其自身定义的equals()方法来比较)
（跳过。。能力不够）2.TreeNode
3.KeySet：所有key值的集合(Set接口)
final class KeySet extends AbstractSet<K> {
public final int size() { return size; }
public final void clear() { HashMap.this.clear(); }
public final Iterator<K> iterator() { return new KeyIterator(); }
public final boolean contains(Object o) { return containsKey(o); }
public final boolean remove(Object key) {
return removeNode(hash(key), key, null, false, true) != null;
}
public final Spliterator<K> spliterator() {
return new KeySpliterator<>(HashMap.this, 0, -1, 0, 0);
}
public final void forEach(Consumer<? super K> action) {
Node<K,V>[] tab;
if (action == null)
throw new NullPointerException();
if (size > 0 && (tab = table) != null) {
int mc = modCount;
for (int i = 0; i < tab.length; ++i) {
for (Node<K,V> e = tab[i]; e != null; e = e.next)
action.accept(e.key);
}
if (modCount != mc)
throw new ConcurrentModificationException();
}
}
}
- clear()方法是调用外部类的clear()方法，所以调用该内部类的clear方法会对HashMap容器造成影响。
- iterator()是KeyIterator这个内部类定义出来的迭代器。
- spliterator()也是KeySpliterator这个内部类定义出来的并行遍历迭代器。
- 最牛逼的是这个类没有定义任何成员变量，也就是说该类无法存放所有key值的集合；所有方法的实现都是借助外部类实现的
4.Values :所有value值的集合(Collection接口)
final class Values extends AbstractCollection<V> {
public final int size() { return size; }
public final void clear() { HashMap.this.clear(); }
public final Iterator<V> iterator() { return new ValueIterator(); }
public final boolean contains(Object o) { return containsValue(o); }
public final Spliterator<V> spliterator() {
return new ValueSpliterator<>(HashMap.this, 0, -1, 0, 0);
}
public final void forEach(Consumer<? super V> action) {
Node<K,V>[] tab;
if (action == null)
throw new NullPointerException();
if (size > 0 && (tab = table) != null) {
int mc = modCount;
for (int i = 0; i < tab.length; ++i) {
for (Node<K,V> e = tab[i]; e != null; e = e.next)
action.accept(e.value);
}
if (modCount != mc)
throw new ConcurrentModificationException();
}
}
}与keySet的实现思路并不大，不过该类继承的是Collection接口。这是因为HashMap中value值可以重复；而keySet继承的Set接口特点是值不可重复。
5.EntrySet:以形式为key=value的集合(Set接口)
final class EntrySet extends AbstractSet<Map.Entry<K,V>> {
public final int size() { return size; }
public final void clear() { HashMap.this.clear(); }
public final Iterator<Map.Entry<K,V>> iterator() {
return new EntryIterator();
}
public final boolean contains(Object o) {
if (!(o instanceof Map.Entry))
return false;
Map.Entry<?,?> e = (Map.Entry<?,?>) o;
Object key = e.getKey();
Node<K,V> candidate = getNode(hash(key), key);
return candidate != null && candidate.equals(e);
}
public final boolean remove(Object o) {
if (o instanceof Map.Entry) {
Map.Entry<?,?> e = (Map.Entry<?,?>) o;
Object key = e.getKey();
Object value = e.getValue();
return removeNode(hash(key), key, value, true, true) != null;
}
return false;
}
public final Spliterator<Map.Entry<K,V>> spliterator() {
return new EntrySpliterator<>(HashMap.this, 0, -1, 0, 0);
}
public final void forEach(Consumer<? super Map.Entry<K,V>> action) {
Node<K,V>[] tab;
if (action == null)
throw new NullPointerException();
if (size > 0 && (tab = table) != null) {
int mc = modCount;
for (int i = 0; i < tab.length; ++i) {
for (Node<K,V> e = tab[i]; e != null; e = e.next)
action.accept(e);
}
if (modCount != mc)
throw new ConcurrentModificationException();
}
}
}同上
/迭代器的内部类/
普通迭代器：
6.HashIterator:一个抽象类，表示HashMap中所有普通迭代器的父类。
abstract class HashIterator {
Node<K,V> next; // next entry to return
Node<K,V> current; // current entry
int expectedModCount; // for fast-fail
int index; // current slot
HashIterator() {
expectedModCount = modCount;
Node<K,V>[] t = table;
current = next = null;
index = 0;
if (t != null && size > 0) { // advance to first entry
do {} while (index < t.length && (next = t[index++]) == null);
}
}
public final boolean hasNext() {
return next != null;
}
final Node<K,V> nextNode() {
Node<K,V>[] t;
Node<K,V> e = next;
if (modCount != expectedModCount)
throw new ConcurrentModificationException();
if (e == null)
throw new NoSuchElementException();
if ((next = (current = e).next) == null && (t = table) != null) {
do {} while (index < t.length && (next = t[index++]) == null);
}
return e;
}
public final void remove() {
Node<K,V> p = current;
if (p == null)
throw new IllegalStateException();
if (modCount != expectedModCount)
throw new ConcurrentModificationException();
current = null;
K key = p.key;
removeNode(hash(key), key, null, false, false);
expectedModCount = modCount;
}
}
- 参数:
- next表示下一个访问的节点,注意next类型是Node类型，这对keyIterator和valueIterator都很方便了
- current表示刚刚访问的节点
- expectedModCount是用来表示modCount
- index为table的下标
- 无参构造器:将current设置为空，将index指向第一个table[]数组存在节点的下标，next指向此时table[index]的第一个节点。
- hasNext()判断是否还有下一个元素。
- next():current指向next，next往后移一位；如果此时next为null，说明当前”桶”的节点已经都遍历过，找到下一个”桶”的位置(改变index值)并将next指向这个桶中第一个节点。注意next()返回的是Node类型
- remove()：移除刚刚访问过的节点(current指向的)，并将current置为空，意味这该方法不能连续调用。
7.KeyIterator:key值的迭代器
final class KeyIterator extends HashIterator
implements Iterator<K> {
public final K next() { return nextNode().key; }
}继承HashIterator抽象类并重写next()方法。
8.ValueIterator:value值的迭代器
final class ValueIterator extends HashIterator
implements Iterator<V> {
public final V next() { return nextNode().value; }
}继承HashIterator抽象类并重写next()方法。
9.EntryIterator：形式为 key=value 的迭代器
final class EntryIterator extends HashIterator
implements Iterator<Map.Entry<K,V>> {
public final Map.Entry<K,V> next() { return nextNode(); }
}继承HashIterator抽象类并重写next()方法。
/并行遍历迭代器/
10.HashMapSpliterator
static class HashMapSpliterator<K,V> {
final HashMap<K,V> map;
Node<K,V> current; // current node
int index; // current index, modified on advance/split
int fence; // one past last index
int est; // size estimate
int expectedModCount; // for comodification checks
HashMapSpliterator(HashMap<K,V> m, int origin,
int fence, int est,
int expectedModCount) {
this.map = m;
this.index = origin;
this.fence = fence;
this.est = est;
this.expectedModCount = expectedModCount;
}
final int getFence() { // initialize fence and size on first use
int hi;
if ((hi = fence) < 0) {
HashMap<K,V> m = map;
est = m.size;
expectedModCount = m.modCount;
Node<K,V>[] tab = m.table;
hi = fence = (tab == null) ? 0 : tab.length;
}
return hi;
}
public final long estimateSize() {
getFence(); // force init
return (long) est;
}
}
static final class KeySpliterator<K,V>
extends HashMapSpliterator<K,V>
implements Spliterator<K> {
KeySpliterator(HashMap<K,V> m, int origin, int fence, int est,
int expectedModCount) {
super(m, origin, fence, est, expectedModCount);
}
public KeySpliterator<K,V> trySplit() {
int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
return (lo >= mid || current != null) ? null :
new KeySpliterator<>(map, lo, index = mid, est >>>= 1,
expectedModCount);
}
public void forEachRemaining(Consumer<? super K> action) {
int i, hi, mc;
if (action == null)
throw new NullPointerException();
HashMap<K,V> m = map;
Node<K,V>[] tab = m.table;
if ((hi = fence) < 0) {
mc = expectedModCount = m.modCount;
hi = fence = (tab == null) ? 0 : tab.length;
}
else
mc = expectedModCount;
if (tab != null && tab.length >= hi &&
(i = index) >= 0 && (i < (index = hi) || current != null)) {
Node<K,V> p = current;
current = null;
do {
if (p == null)
p = tab[i++];
else {
action.accept(p.key);
p = p.next;
}
} while (p != null || i < hi);
if (m.modCount != mc)
throw new ConcurrentModificationException();
}
}
public boolean tryAdvance(Consumer<? super K> action) {
int hi;
if (action == null)
throw new NullPointerException();
Node<K,V>[] tab = map.table;
if (tab != null && tab.length >= (hi = getFence()) && index >= 0) {
while (current != null || index < hi) {
if (current == null)
current = tab[index++];
else {
K k = current.key;
current = current.next;
action.accept(k);
if (map.modCount != expectedModCount)
throw new ConcurrentModificationException();
return true;
}
}
}
return false;
}
public int characteristics() {
return (fence < 0 || est == map.size ? Spliterator.SIZED : 0) |
Spliterator.DISTINCT;
}
}
static final class ValueSpliterator<K,V>
extends HashMapSpliterator<K,V>
implements Spliterator<V> {
ValueSpliterator(HashMap<K,V> m, int origin, int fence, int est,
int expectedModCount) {
super(m, origin, fence, est, expectedModCount);
}
public ValueSpliterator<K,V> trySplit() {
int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
return (lo >= mid || current != null) ? null :
new ValueSpliterator<>(map, lo, index = mid, est >>>= 1,
expectedModCount);
}
public void forEachRemaining(Consumer<? super V> action) {
int i, hi, mc;
if (action == null)
throw new NullPointerException();
HashMap<K,V> m = map;
Node<K,V>[] tab = m.table;
if ((hi = fence) < 0) {
mc = expectedModCount = m.modCount;
hi = fence = (tab == null) ? 0 : tab.length;
}
else
mc = expectedModCount;
if (tab != null && tab.length >= hi &&
(i = index) >= 0 && (i < (index = hi) || current != null)) {
Node<K,V> p = current;
current = null;
do {
if (p == null)
p = tab[i++];
else {
action.accept(p.value);
p = p.next;
}
} while (p != null || i < hi);
if (m.modCount != mc)
throw new ConcurrentModificationException();
}
}
public boolean tryAdvance(Consumer<? super V> action) {
int hi;
if (action == null)
throw new NullPointerException();
Node<K,V>[] tab = map.table;
if (tab != null && tab.length >= (hi = getFence()) && index >= 0) {
while (current != null || index < hi) {
if (current == null)
current = tab[index++];
else {
V v = current.value;
current = current.next;
action.accept(v);
if (map.modCount != expectedModCount)
throw new ConcurrentModificationException();
return true;
}
}
}
return false;
}
public int characteristics() {
return (fence < 0 || est == map.size ? Spliterator.SIZED : 0);
}
}
static final class EntrySpliterator<K,V>
extends HashMapSpliterator<K,V>
implements Spliterator<Map.Entry<K,V>> {
EntrySpliterator(HashMap<K,V> m, int origin, int fence, int est,
int expectedModCount) {
super(m, origin, fence, est, expectedModCount);
}
public EntrySpliterator<K,V> trySplit() {
int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
return (lo >= mid || current != null) ? null :
new EntrySpliterator<>(map, lo, index = mid, est >>>= 1,
expectedModCount);
}
public void forEachRemaining(Consumer<? super Map.Entry<K,V>> action) {
int i, hi, mc;
if (action == null)
throw new NullPointerException();
HashMap<K,V> m = map;
Node<K,V>[] tab = m.table;
if ((hi = fence) < 0) {
mc = expectedModCount = m.modCount;
hi = fence = (tab == null) ? 0 : tab.length;
}
else
mc = expectedModCount;
if (tab != null && tab.length >= hi &&
(i = index) >= 0 && (i < (index = hi) || current != null)) {
Node<K,V> p = current;
current = null;
do {
if (p == null)
p = tab[i++];
else {
action.accept(p);
p = p.next;
}
} while (p != null || i < hi);
if (m.modCount != mc)
throw new ConcurrentModificationException();
}
}
public boolean tryAdvance(Consumer<? super Map.Entry<K,V>> action) {
int hi;
if (action == null)
throw new NullPointerException();
Node<K,V>[] tab = map.table;
if (tab != null && tab.length >= (hi = getFence()) && index >= 0) {
while (current != null || index < hi) {
if (current == null)
current = tab[index++];
else {
Node<K,V> e = current;
current = current.next;
action.accept(e);
if (map.modCount != expectedModCount)
throw new ConcurrentModificationException();
return true;
}
}
}
return false;
}
public int characteristics() {
return (fence < 0 || est == map.size ? Spliterator.SIZED : 0) |
Spliterator.DISTINCT;
}
}方法(先去看put()+putVal()+resize()再看其他方法)：
1.hash(Object key):定义key的hash值。
static final int hash(Object key) {
int h;
return (key == null) ? 0 : (h = key.hashCode()) ^ (h >>> 16);
}从上面的代码可以看到key的hash值的计算方法。key的hash值高16位不变，低16位与高16位异或作为key的最终hash值。（h >>> 16，表示无符号右移16位，高位补0，任何数跟0异或都是其本身，因此key的hash值高16位不变。）
2.comparableClassFor(Object x):
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;
}HashMap类中有一个comparableClassFor(Object x)方法，当x的类型为X，且X直接实现了Comparable接口（比较类型必须为X类本身）时，返回x的运行时类型；否则返回null。通过这个方法，我们可以搞清楚一些与类型、泛型相关的概念和方法。
3.compareComparables(Class
static int compareComparables(Class<?> kc, Object k, Object x) {
return (x == null || x.getClass() != kc ? 0 :
((Comparable)k).compareTo(x));
}4.tableSizeFor(int cap)：设置”桶”的大小
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的次幂，因此如果参数cap是2的次幂的话，直接将大小设置为cap，如果cap不是2的次幂，那么返回满足大于cap的最小的2的次幂的值
该方法究竟是什么意思？(强烈推荐必看)：http://blog.csdn.net/fan2012huan/article/details/51097331
5.size():得到key-value的个数
public int size() {
return size;
}6.isEmpty():当前的HashMap是否为空
public boolean isEmpty() {
return size == 0;
}7.get(Object key):得到键为key的value值。实际通过getNode(int hash, Object key)方法完成的。
public V get(Object key) {
Node<K,V> e;
return (e = getNode(hash(key), key)) == null ? null : e.value;
}8.getNode(int hash, Object key)：通过key值和hash值得到相应的Node对象
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;
}9 put(K key, V value)：放入一个键值对，实际调用的是putVal(hash(key), key, value, false, true)方法。
public V put(K key, V value) {
return putVal(hash(key), key, value, false, true);
}10.putVal(int hash, K key, V value, boolean onlyIfAbsent , boolean evict)：放入key-value的实现方法
/**
* Implements Map.put and related methods
*
* @param hash hash for key
* @param key the key
* @param value the value to put
* @param onlyIfAbsent if true, don't change existing value
* @param evict if false, the table is in creation mode.
* @return previous value, or null if none
*/
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;
}- 参数：
- hash：第二个参数key的hash值
- key ：key值
- value：value值
- onlyIfAbsent：如果该值为true，那么不会修改已经存在key值的value值
- evict：evict if false, the table is in creation mode.
2. 理解如何确定放入数组的下标 -> tab[i = (n - 1) & hash] ：虽然写的是(n-1 ) & hash，但是n为2
的次幂，所以n-1的每一位都是1，所以i为hash值的低n-1位的值，假设低n-1都是1，那么i的值也只是n-1 小于数组的容量n，所以不会发生下标越界的情况
进阶问题？如果容量扩大(resize()方法)，那么n值就会发生变化，下标也就发生变化，这样的话又该如何进行扩大操作呢 答案见resize()方法
11.resize():初始化或更改table数组的大小(初始化是16)，成员变量threshold的值(初始化为12)
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) { //A
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;
}说明：
- 第一次调用resize()函数，是用来对table数组和threshold进行初始化的，table的大小为16，threshold的大小为12
- 第二次调用resize()函数，就是扩容操作了：阀值threshold和table数组的大小都为原来的两倍
- 解决pulValue()的疑惑：在A行的for循环中解决了这个问题：
- 1.先取出原来table的第j个位置上的值(table[j]，j = 0…table.length-1)
- 2.如果第j个位置上不为null，说明有链，继续往下走；如果为null，说明没有链，那么返回第一步并且开始对table的第j+1个位置进行操作(table[j+1])
- 3.如果该链上只有一个节点e(e.next == null) 那么直接用e的hash和新容量进行与操作，其结果有两个，其一为结果与旧容量的结果一样，其二是结果为该table的下标+旧容量；不管是那种结果，直接将e放入新位置并返回第一步(开始对table[j+1]操作)；
如果该链表上有多个节点(先跳过如果链表改为树的操作),那么依次对链表上的各个节点进行前一个的判断，并拆成两个链表，一个链表还是在原来的位置，另一个链表在原来的位置+旧容量，并将这两个链表放入相应的位置中。然后对下标为j+1的进行操作(table[j+1]) - 4.当遍历完所有的旧table后，也就意味着copy操作完成，返回新table
注意:HashMap允许key值和value值为null，请尝试当key/value为空时9，10，11函数的执行过程
–
12.treeifyBin(Node
final void treeifyBin(Node<K,V>[] tab, int hash) {
int n, index; Node<K,V> e;
if (tab == null || (n = tab.length) < MIN_TREEIFY_CAPACITY)
resize();
else if ((e = tab[index = (n - 1) & hash]) != null) {
TreeNode<K,V> hd = null, tl = null;
do {
TreeNode<K,V> p = replacementTreeNode(e, null);
if (tl == null)
hd = p;
else {
p.prev = tl;
tl.next = p;
}
tl = p;
} while ((e = e.next) != null);
if ((tab[index] = hd) != null)
hd.treeify(tab);
}
}参数：tab为table数组，hash为要转换的”桶位”的第一个节点的hash值（也就是第一个节点key的hash值）;需要说明的是：Node类中有hashCode()方法和hash属性，但是此hash属性不是由hashCode()得到的，而是直接用key的hash值
13.putAll(Map
public void putAll(Map<? extends K, ? extends V> m) {
putMapEntries(m, true);
}14.remove(Object key):根据key值移除一个节点，如果移除成功则返回移除的value值，失败则返回null；通过removeNode(int hash, Object key, Object value,boolean matchValue, boolean movable)方法来实现。
public V remove(Object key) {
Node<K,V> e;
return (e = removeNode(hash(key), key, null, false, true)) == null ?
null : e.value;
}15.removeNode(int hash, Object key, Object value,boolean matchValue, boolean movable)：HashMap中移除节点的最底层实现方法
final Node<K,V> removeNode(int hash, Object key, Object value,
boolean matchValue, boolean movable) {
Node<K,V>[] tab; Node<K,V> p; int n, index;
if ((tab = table) != null && (n = tab.length) > 0 &&
(p = tab[index = (n - 1) & hash]) != null) {
Node<K,V> node = null, e; K k; V v;
if (p.hash == hash &&
((k = p.key) == key || (key != null && key.equals(k))))
node = p;
else if ((e = p.next) != null) {
if (p instanceof TreeNode)
node = ((TreeNode<K,V>)p).getTreeNode(hash, key);
else {
do {
if (e.hash == hash &&
((k = e.key) == key ||
(key != null && key.equals(k)))) {
node = e;
break;
}
p = e;
} while ((e = e.next) != null);
}
}
if (node != null && (!matchValue || (v = node.value) == value ||
(value != null && value.equals(v)))) {
if (node instanceof TreeNode)
((TreeNode<K,V>)node).removeTreeNode(this, tab, movable);
else if (node == p)
tab[index] = node.next;
else
p.next = node.next;
++modCount;
--size;
afterNodeRemoval(node);
return node;
}
}
return null;
}- 参数和返回值的作用：
- @param hash hash for key
- @param key the key
- @param value the value to match if matchValue, else ignored
- @param matchValue if true only remove if value is equal
- @param movable if false do not move other nodes while removing
- @return the node, or null if none
16.clear():清空HashMap
public void clear() {
Node<K,V>[] tab;
modCount++;
if ((tab = table) != null && size > 0) {
size = 0;
for (int i = 0; i < tab.length; ++i)
tab[i] = null;
}
}17.containsValue(Object value):判断HashMap中是否存在value这个”值”
public boolean containsValue(Object value) {
Node<K,V>[] tab; V v;
if ((tab = table) != null && size > 0) {
for (int i = 0; i < tab.length; ++i) {
for (Node<K,V> e = tab[i]; e != null; e = e.next) {
if ((v = e.value) == value ||
(value != null && value.equals(v)))
return true;
}
}
}
return false;
}18.keySet():得到包含所有key值的Set容器
public Set<K> keySet() {
Set<K> ks = keySet;
if (ks == null) {
ks = new KeySet();
keySet = ks;
}
return ks;
}
- 重写父类的keySet()方法。
- 父类AbstractMap中有一个keySet属性，用来保存所有key值的集合
- 上面KeySet内部类说此内部类没有任何成员变量，对key的操作都是通过外部类实现的，同理虽然父类有一个Set容器的keySet属性，但是此keySet容器只有方法，实际并不是存放元素的。
- 这样做的好处是能确保每次调用keySet的任何方法都能保证是此刻父类的key值集合
- 虽然看起来更加复杂，函数嵌套的层数也很多，但实际上时间复杂度与原来比较并没有太大变化；
19.values():得到包含所有value值的Collection容器
public Collection<V> values() {
Collection<V> vs = values;
if (vs == null) {
vs = new Values();
values = vs;
}
return vs;
}注意是Collection接口，其他特点与keySet一样。
20.entrySet():得到形式为 key=value 的Set容器
public Set<Map.Entry<K,V>> entrySet() {
Set<Map.Entry<K,V>> es;
return (es = entrySet) == null ? (entrySet = new EntrySet()) : es;
}与上面两个一样。
注：方法17，18，19就是jdk api文档中所说的三种”视图”。如果还想在更加深入的了解这三个方法，请自己问自己他们的输出(toString())是什么？为什么？（我自己的：Study_Collection.test03）
–
21.getOrDefault(Object key, V defaultValue):得到键值key的value值，如果没有返回第二个参数defaultValue的值。但是并不会将这一个键值对加入容器中
public V getOrDefault(Object key, V defaultValue) {
Node<K,V> e;
return (e = getNode(hash(key), key)) == null ? defaultValue : e.value;
}22.putIfAbsent(K key, V value): 如果key值不在才放入，key值存在的话不会更改原value值
public V putIfAbsent(K key, V value) {
return putVal(hash(key), key, value, true, true);
}23.remove(Object key, Object value):只有key和value同时相同时才执行remove操作。
public boolean remove(Object key, Object value) {
return removeNode(hash(key), key, value, true, true) != null;
}24.replace(K key, V oldValue, V newValue)：替换操作，但是key键的value值必须和oldValue相等才替换
public boolean replace(K key, V oldValue, V newValue) {
Node<K,V> e; V v;
if ((e = getNode(hash(key), key)) != null &&
((v = e.value) == oldValue || (v != null && v.equals(oldValue)))) {
e.value = newValue;
afterNodeAccess(e);
return true;
}
return false;
}25.replace(K key, V value):替换操作，并返回旧的value，如果没有此key，返回null
public V replace(K key, V value) {
Node<K,V> e;
if ((e = getNode(hash(key), key)) != null) {
V oldValue = e.value;
e.value = value;
afterNodeAccess(e);
return oldValue;
}
return null;
}/**java8新特性(能力不足。。)
26.computeIfAbsent(K key,Function
public Object clone() {
HashMap<K,V> result;
try {
result = (HashMap<K,V>)super.clone();
} catch (CloneNotSupportedException e) {
// this shouldn't happen, since we are Cloneable
throw new InternalError(e);
}
result.reinitialize();
result.putMapEntries(this, false);
return result;
}
33.loadFactor()/capacity():得到装载因子和已申请容量的大小
final float loadFactor() { return loadFactor; }
final int capacity() {
return (table != null) ? table.length :
(threshold > 0) ? threshold :
DEFAULT_INITIAL_CAPACITY;
}34.writeObject(java.io.ObjectOutputStream s)/readObject(java.io.ObjectInputStream s)/internalWriteEntries(java.io.ObjectOutputStream s):与序列化有关.internalWriteEntries(java.io.ObjectOutputStream s)是writeObject的一个调用方法
35.newNode(int hash, K key, V value, Node
Node<K,V> newNode(int hash, K key, V value, Node<K,V> next) {
return new Node<>(hash, key, value, next);
}36.replacementNode(Node
Node<K,V> replacementNode(Node<K,V> p, Node<K,V> next) {
return new Node<>(p.hash, p.key, p.value, next);
}37.newTreeNode(int hash, K key, V value, Node
TreeNode<K,V> newTreeNode(int hash, K key, V value, Node<K,V> next) {
return new TreeNode<>(hash, key, value, next);
}38.replacementTreeNode(Node
TreeNode<K,V> replacementTreeNode(Node<K,V> p, Node<K,V> next) {
return new TreeNode<>(p.hash, p.key, p.value, next);
}39.reinitialize():将HashMap全部清空（只在clone和readObject中被调用）
void reinitialize() {
table = null;
entrySet = null;
keySet = null;
values = null;
modCount = 0;
threshold = 0;
size = 0;
}40.与LinkedHashMap有关的方法：
// Callbacks to allow LinkedHashMap post-actions
void afterNodeAccess(Node<K,V> p) { }
void afterNodeInsertion(boolean evict) { }
void afterNodeRemoval(Node<K,V> p) { }end -2018.3.5
838
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
