LinkedHashMap继承了HashMap,底层数据的存储还是用到了hashmap,但是会维护一个双链表,主要是对hashmap中的节点进行了重写
看下相关属性:
transient LinkedHashMap.Entry<K,V> head; //头部指针控制器
transient LinkedHashMap.Entry<K,V> tail; //头部指针控制器
final boolean accessOrder; //是否需要采用LRU,把查询,插入重复的节点放到双链表的尾部
节点重写:
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);
}
}
在节点里面添加了前置指针,后置指针
来看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;
afterNodeAccess(e);
return oldValue;
}
}
++modCount;
if (++size > threshold)
resize();
afterNodeInsertion(evict);
return null;
}
此时这里的newNode(hash, key, value, null); 不是hashmap中的节点类型了,而是调用一下方法:
Node<K,V> newNode(int hash, K key, V value, Node<K,V> e) {
LinkedHashMap.Entry<K,V> p =
new LinkedHashMap.Entry<K,V>(hash, key, value, e);
linkNodeLast(p);
return p;
}
private void linkNodeLast(LinkedHashMap.Entry<K,V> p) {
LinkedHashMap.Entry<K,V> last = tail;
tail = p;
if (last == null)
head = p;
else {
p.before = last;
last.after = p;
}
}
linkNodeLast来实现了插入节点的前后关系
if (e != null) { // existing mapping for key
V oldValue = e.value;
if (!onlyIfAbsent || oldValue == null)
e.value = value;
afterNodeAccess(e);
return oldValue;
}
有没有注意到hashmap中put方法中,当有key相等时,会调用,afterNodeAccess(e);afterNodeAccess 这个方法hashmap本身没有,LinkedHashMap提供 了
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;
}
}
这个方法要在accessOrder == true的情况下执行,当要实现LRU时才执行,就是把当前更新的节点放置双链表的最后面
++modCount;
if (++size > threshold)
resize();
afterNodeInsertion(evict);
return null;
afterNodeInsertion 这个方法也是hashmap提供实现的,这个是实现LRU算法的关键,意思就是当插入元素的时候,采用的尾插法,如果要求双向链表的长度有个阈值,如果达到这个阈值,就要删掉双向链表的第一个节点,这样做的目标就是此时双向链表里面的元素都是最近频繁被使用的,而且我们只需要保留一定长度的操作最新的节点
LinkedHashMap实现了afterNodeInsertion这个方法,如下:
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);
}
}
removeEldestEntry这个方法非常关键,默认是返回false,如果要达到阈值,删除第一个节点,就要实现这个方法
protected boolean removeEldestEntry(Map.Entry<K,V> eldest) {
return false;
}
所以我来实现下,实现的关键点就是 ,设置阈值,把accessOrder改为true,双链表长度达到阈值 return true,否则 false
public class LruLinkedHashMap extends LinkedHashMap {
private final Integer maxLength = 20;
LruLinkedHashMap(){
super(16, 0.75f, true) ;
}
@Override
protected boolean removeEldestEntry(Map.Entry eldest) {
if(size() > maxLength){
return true;
}else{
return false;
}
}
}
现在测试一下:
public class LruLinkedHashMapTest {
public static void main(String[] args) {
LruLinkedHashMap lruLinkedHashMap = new LruLinkedHashMap();
for(int i=0;i<1000;i++){
lruLinkedHashMap.put("a"+i,"a"+i);
}
lruLinkedHashMap.forEach((k,v)->{
System.out.println("k,v:"+k+","+v);
});
}
}
查询操作:
public class LruLinkedHashMapTest {
public static void main(String[] args) {
LruLinkedHashMap lruLinkedHashMap = new LruLinkedHashMap();
for(int i=0;i<1000;i++){
lruLinkedHashMap.put("a"+i,"a"+i);
}
lruLinkedHashMap.get("a993");
lruLinkedHashMap.forEach((k,v)->{
System.out.println("k,v:"+k+","+v);
});
}
}
看k,v:a993,a993是最后一个打印的
更新操作:
public class LruLinkedHashMapTest {
public static void main(String[] args) {
LruLinkedHashMap lruLinkedHashMap = new LruLinkedHashMap();
for(int i=0;i<1000;i++){
lruLinkedHashMap.put("a"+i,"a"+i);
}
lruLinkedHashMap.put("a995","aaaaa");
lruLinkedHashMap.forEach((k,v)->{
System.out.println("k,v:"+k+","+v);
});
}
}
k,v:a995,aaaaa 已经排到队尾了