参考博文:https://blog.csdn.net/future234/article/details/80704005
一,LinkedHashMap概述
1,允许key为null,允许value为null
2,与HashMap最大区别:默认情况下,遍历顺序就是元素插入顺序。
LinkedHashMap的Entry
static class Entry<K,V> extends HashMap.Node<K,V> {
Entry<K,V> before, after;
Entry(int hash, K key, V value, Node<K,V> next) {
super(hash, key, value, next);
}
}
LinkedHashMap的成员变量
transient LinkedHashMap.Entry<K,V> head;//指向双链表的头
transient LinkedHashMap.Entry<K,V> tail;//指向双链表的尾
final boolean accessOrder;//访问是否排序
继承HashMap的Node,同时增加了before和after两个节点用来维护Entry顺序。
二,LinkedHashMap详解
1,get方法
public V get(Object key) {
Node<K,V> e;
//getNode是HashMap提供的方法,通过hash值确定下标,然后对比key值是否相等。
if ((e = getNode(hash(key), key)) == null)
return null;
if (accessOrder)
afterNodeAccess(e);//把Entry移动到双链表的尾端
return e.value;
}
访问包括 get(key) put(key,value) put只限于原来key有value才算访问,新插入的不会调用afterNodeAccess()
void afterNodeAccess(Node<K,V> e) { // move node to last
LinkedHashMap.Entry<K,V> last;
if (accessOrder && (last = tail) != e) {
LinkedHashMap.Entry<K,V> p =
(LinkedHashMap.Entry<K,V>)e, b = p.before, a = p.after;
p.after = null;
if (b == null)
head = a;
else
b.after = a;
if (a != null)
a.before = b;
else
last = b;
if (last == null)
head = p;
else {
p.before = last;
last.after = p;
}
tail = p;
++modCount;
}
}
2,put方法
put方法完全复用了HashMap的put方法。
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;
//如果是覆盖key的value调用afterNodeAccess(e)
afterNodeAccess(e);
return oldValue;
}
}
++modCount;
if (++size > threshold)
resize();
//如果是新插入的值 会调用afterNodeInsertion
afterNodeInsertion(evict);
return null;
}
如果允许,会根据需要删除双链表中最老的节点。
void afterNodeInsertion(boolean evict) { // possibly remove eldest
LinkedHashMap.Entry<K,V> first;
if (evict && (first = head) != null && removeEldestEntry(first)) {
K key = first.key;
removeNode(hash(key), key, null, false, true);
}
}
3,遍历
前面我们说过,LinkedHashMap的遍历是有序的,而HashMap的遍历是无序的。HashMap实现遍历的方式是从table数组的0下标开始查找,直到查到一个非空的元素,如果该元素还有链表或者红黑树,遍历之,遍历完接着遍历数组。LinkedHashMap遍历的方式是从双链表的head一直往尾端遍历。