LinkedHashMap

一、定义介绍
Map 接口的哈希表和链接列表实现，具有可预知的迭代顺序。此实现与 HashMap 的不同之处在于，后者维护着一个运行于所有条目的双重链接列表。此链接列表定义了迭代顺序，该迭代顺序通常就是将键插入到映射中的顺序（插入顺序）。注意，如果在映射中重新插入 键，则插入顺序不受影响。（如果在调用 m.put(k, v) 前 m.containsKey(k) 返回了 true，则调用时会将键 k 重新插入到映射 m 中。）
二、构建方法说明
LinkedHashMap(int initialCapacity, float loadFactor, boolean accessOrder)
nitialCapacity：初始容量
loadFactor：负载因子
accessOrder：false/按插入顺序排序，true/按读取顺序存储

LinkedHashMap<String,String> map=new LinkedHashMap(4,0.75f,true);
map.put(“1”, “a”);
map.put(“2”, “b”);
map.put(“3”, “c”);
map.put(“4”, “d”);
System.out.println(“原始数据顺序为:”);
for(Iterator<Map.Entry<String,String>> it = map.entrySet().iterator(); it.hasNext()😉{
System.out.print(it.next().getKey()+" ");
}
String val=map.get(“3”);

    System.out.println();
    System.out.println("读取key=3后顺序为:");
    for(Iterator<Map.Entry<String,String>> it=map.entrySet().iterator();it.hasNext();){
        System.out.print(it.next().getKey()+" ");
    }

    map.put("2","aa" );
    System.out.println();
    System.out.println("覆盖key=2数据后顺序为:");
    for(Iterator<Map.Entry<String,String>> it=map.entrySet().iterator();it.hasNext();){
        System.out.print(it.next().getKey()+" ");
    }
    System.out.println();
    
  ==========
  原始数据顺序为:

1 2 3 4
读取key=3后顺序为:
1 2 4 3
覆盖key=2数据后顺序为:
1 4 3 2

三、指定容量
float DEFAULT_LOAD_FACTOR=0.75f;
int MAX_CACHE_SIZE=3;
int capacity = (int) Math.ceil(MAX_CACHE_SIZE / DEFAULT_LOAD_FACTOR) + 1;
LinkedHashMap<String,String> map = new LinkedHashMap<String, String>(capacity, DEFAULT_LOAD_FACTOR, true) {
@Override
protected boolean removeEldestEntry(Map.Entry<String, String> eldest) {
return size() > MAX_CACHE_SIZE;
}
};

    map.put("1", "a");
    map.put("2", "b");
    System.out.println();
    System.out.println("原始顺序:");
    for(Iterator<Map.Entry<String,String>> it = map.entrySet().iterator(); it.hasNext();){
        System.out.print(it.next().getKey()+" ");
    }
    map.put("3", "c");
    System.out.println();
    System.out.println("put key=3后顺序:");
    for(Iterator<Map.Entry<String,String>> it = map.entrySet().iterator(); it.hasNext();){
        System.out.print(it.next().getKey()+" ");
    }
    map.put("4", "d");
    System.out.println();
    System.out.println("put key=4后顺序:");
    for(Iterator<Map.Entry<String,String>> it = map.entrySet().iterator(); it.hasNext();){
        System.out.print(it.next().getKey()+" ");
    }
    String val=map.get("3");
    System.out.println();
    System.out.println("读取key=3后，顺序为:");
    for(Iterator<Map.Entry<String,String>> it = map.entrySet().iterator(); it.hasNext();){
        System.out.print(it.next().getKey()+" ");
    }

=======
原始顺序:
1 2
put key=3后顺序:
1 2 3
put key=4后顺序:
2 3 4
读取key=3后，顺序为:
2 4 3

说明：
size() > MAX_CACHE_SIZE这个控制了最大容量，初始化大小可以随意指定。太小会频繁扩容，消耗性能

四、应用
该类型适合做本地缓存，但是由于不是线程安全的，需要进行改写
/*

• Copyright © 2016 Shouqi, Inc. All Rights Reserved.
  */

package com.yiqi.lbs.mileage.core.base.structure;

import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Set;

/**

• LRU缓存数据结构

*/
public class LRUCache<K, V> {
private final int MAX_CACHE_SIZE;
private final float DEFAULT_LOAD_FACTOR = 0.75f;
private LinkedHashMap<K, V> map;

public LRUCache(int cacheSize) {
    MAX_CACHE_SIZE = cacheSize;

    int capacity = (int) Math.ceil(MAX_CACHE_SIZE / DEFAULT_LOAD_FACTOR) + 1;
    map = new LinkedHashMap<K, V>(capacity, DEFAULT_LOAD_FACTOR, true) {
        @Override
        protected boolean removeEldestEntry(Map.Entry<K, V> eldest) {
            return size() > MAX_CACHE_SIZE;
        }
    };
}

public synchronized void put(K key, V value) {
    map.put(key, value);
}

public synchronized V get(K key) {
    return map.get(key);
}

public synchronized boolean containsKey(K key) {
    return map.containsKey(key);
}

public synchronized V remove(K key) {
    return map.remove(key);
}

public synchronized Set<Map.Entry<K, V>> getAll() {
    return map.entrySet();
}

public synchronized int size() {
    return map.size();
}

public synchronized void clear() {
    map.clear();
}

@Override
public String toString() {
    StringBuilder sb = new StringBuilder();
    for (Map.Entry entry : map.entrySet()) {
        sb.append(String.format("%s:%s ", entry.getKey(), entry.getValue()));
    }
    return sb.toString();
}

}