Java——Java基础之LinkedHashMap

1. 结构

LinkedHashMap相比HashMap增加了双向链表的结构，在第一个节点处维护head，在最后一个插入的节点处维护tail，前后插入的节点间维护before+after

2. 原理

• 结构

public class LinkedHashMap<K,V>
    extends HashMap<K,V>
    implements Map<K,V>
{
	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);
        }
    }
	transient LinkedHashMap.Entry<K,V> head;
	transient LinkedHashMap.Entry<K,V> tail;

}

• 初始化

调用父类的构造方法

public LinkedHashMap(int initialCapacity) {
    super(initialCapacity);
    // 这里是指是否基于访问排序，默认为false
    accessOrder = false;
}

• put方法

调用HashMap的put方法 - putVal

//HashMap.class
public V put(K key, V value) {
    return putVal(hash(key), key, value, false, true);
}
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;
    //通过hash定位所在桶是否为空，为空创建新节点
    if ((p = tab[i = (n - 1) & hash]) == null)
        tab[i] = newNode(hash, key, value, null);//注意这里的方法被重写
    //...

LinkedHashMap重写了newNode方法，构造Entry，调用linkNodeLast方法将Entry接在双向链表的尾部

//LinkedHashMap.class
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);//构造Entry
    linkNodeLast(p);//将Entry接在双向链表的尾部
    return p;
}
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);
    }
}
private void linkNodeLast(LinkedHashMap.Entry<K,V> p) {//p：当前节点、head：头节点、tail：尾节点
    LinkedHashMap.Entry<K,V> last = tail;
    tail = p;
    if (last == null)
        head = p;
    else {
        p.before = last;
        last.after = p;
    }
}

• get方法

//LinkedHashMap.class
public V get(Object key) {
    Node<K,V> e;
    if ((e = getNode(hash(key), key)) == null)
        return null;
    if (accessOrder)
        afterNodeAccess(e);
    return e.value;
}

• remove方法

hahsmap的删除方法：判断是链表还是红黑树、删除节点

//HashMap.class
public V remove(Object key) {
    Node<K,V> e;
    return (e = removeNode(hash(key), key, null, false, true)) == null ?
        null : e.value;
}
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;
}

维护双向链表的删除操作

//LinkedHashMap.class
void afterNodeRemoval(Node<K,V> e) { // unlink
    LinkedHashMap.Entry<K,V> p =
        (LinkedHashMap.Entry<K,V>)e, b = p.before, a = p.after;
    p.before = p.after = null;
    if (b == null)
        head = a;
    else
        b.after = a;
    if (a == null)
        tail = b;
    else
        a.before = b;
}

3. LRU

最近最少使用：设计数据结构，具有查找快，插入快，删除快，有顺序之分的特点，查找块：hash，插入删除快、有顺序之分：链表，所以需要哈希表+链表

使用LinkedHashMap实现

class LRUCache extends LinkedHashMap<Integer, Integer>{
    private int capacity;
    
    public LRUCache(int capacity) {
        super(capacity, 0.75F, true);
        this.capacity = capacity;
    }

    public int get(int key) {
        return super.getOrDefault(key, -1);
    }

    public void put(int key, int value) {
        super.put(key, value);
    }

    @Override
    protected boolean removeEldestEntry(Map.Entry<Integer, Integer> eldest) {
        return size() > capacity; 
    }
}

自定义实现

class LRUCache {

    private HashMap<Integer,Node> map;
    private DoubleList cache;
    private int capacity;


    public LRUCache(int capacity) {
        this.capacity=capacity;
        map=new HashMap<>();
        cache=new DoubleList();
    }
    
    public int get(int key) {
        if(!map.containsKey(key)){
            return -1;
        }
        int value=map.get(key).value;
        put(key,value);//把该节点提前
        return value;

    }
    
    public void put(int key, int value) {
        Node cur=new Node(key,value);
        //之前插入过该节点
        if(map.containsKey(key)){
            cache.remove(map.get(key));
        }
        //之前没有插入过该节点
        else{
            if(capacity==cache.size()){
                Node last=cache.removeLast();
                map.remove(last.key);
            }
        }
        cache.addFirst(cur);
        map.put(key,cur);

    }
}
class Node{
    int key;
    int value;
    Node pre;
    Node next;
    public Node(int key,int value){
        this.key=key;
        this.value=value;
    }
}
class DoubleList{
    Node head;
    Node tail;
    int size=0;
    //在链表头部插入节点
    public void addFirst(Node node){
        if(head==null){
            head=node;
            tail=node;
        }
        else{
            Node temp=head;
            temp.pre=node;
            node.next=temp;
            head=node;
        }
        size++;
    }
    //删除某个节点
    public void remove(Node node){
        //如果该链表只有一个节点
        if(head==node && tail==node){
            head=null;
            tail=null;
        }
        //如果待删除节点是头节点
        else if(node==head){
            Node temp=node.next;
            head=temp;
            temp.pre=null;

        }
        //如果待删除节点是尾节点
        else if(node==tail){
            Node temp=node.pre;
            tail=temp;
            temp.next=null;
        }
        //如果待删除节点是中间节点
        else{
            Node temp1=node.pre;
            Node temp2=node.next;
            temp1.next=temp2;
            temp2.pre=temp1;
        }
        size--;
    }
    //删除最后一个节点，并返回
    public Node removeLast(){
        Node temp=tail;
        remove(temp);
        return temp;
    }
    //链表长度
    public int size(){
        return size;
    }
}