public LinkedHashMap(int initialCapacity,
 float loadFactor,
 boolean accessOrder) {
 super(initialCapacity, loadFactor);
 this.accessOrder = accessOrder;
}

LinkedHashMap < Integer, Integer > map = new LinkedHashMap < > (0, 0.75f, true);
map.put(0, 0);
map.put(1, 1);
map.put(2, 2);
map.put(3, 3);
map.get(1);
map.get(2);

for (Map.Entry < Integer, Integer > entry: map.entrySet()) {
 System.out.println(entry.getKey() + ":" + entry.getValue());

}

/**
  * @param maxSize for caches that do not override {@link #sizeOf}, this is
  *  the maximum number of entries in the cache. For all other caches,
  *  this is the maximum sum of the sizes of the entries in this cache.
  */
 public LruCache(int maxSize) {
  if (maxSize <= 0) {
   throw new IllegalArgumentException("maxSize <= 0");
  }
  this.maxSize = maxSize;
  this.map = new LinkedHashMap<K, V>(0, 0.75f, true);//accessOrder被設置為true
 }

/**
  * Caches {@code value} for {@code key}. The value is moved to the head of
  * the queue.
  *
  * @return the previous value mapped by {@code key}.
  */
 public final V put(K key, V value) {
  if (key == null || value == null) {//判空，不可為空
   throw new NullPointerException("key == null || value == null");
  }

  V previous;
  synchronized (this) {
   putCount++;//插入緩存對象加1
   size += safeSizeOf(key, value);//增加已有緩存的大小
   previous = map.put(key, value);//向map中加入緩存對象
   if (previous != null) {//如果已有緩存對象，則緩存大小恢復到之前
    size -= safeSizeOf(key, previous);
   }
  }

  if (previous != null) {//entryRemoved()是個空方法，可以自行實現
   entryRemoved(false, key, previous, value);
  }

  trimToSize(maxSize);//調整緩存大小(關鍵方法)
  return previous;
 }

/**
  * Remove the eldest entries until the total of remaining entries is at or
  * below the requested size.
  *
  * @param maxSize the maximum size of the cache before returning. May be -1
  *   to evict even 0-sized elements.
  */
 public void trimToSize(int maxSize) {
  while (true) {//死循環(huán)
   K key;
   V value;
   synchronized (this) {
　　　　　　　　 //如果map為空并且緩存size不等于0或者緩存size小于0，拋出異常
    if (size < 0 || (map.isEmpty() && size != 0)) {
     throw new IllegalStateException(getClass().getName()
       + ".sizeOf() is reporting inconsistent results!");
    }
　　　　　　　　　　//如果緩存大小size小于最大緩存，或者map為空，不需要再刪除緩存對象，跳出循環(huán)
    if (size <= maxSize) {
     break;
    }
　　　　　　　　　　// 取出 map 中最老的映射
    Map.Entry<K, V> toEvict = map.eldest();
    if (toEvict == null) {
     break;
    }

    key = toEvict.getKey();
    value = toEvict.getValue();
    map.remove(key);
    size -= safeSizeOf(key, value);
    evictionCount++;
   }

   entryRemoved(true, key, value, null);
  }
 }

/**
  * Returns the value for {@code key} if it exists in the cache or can be
  * created by {@code #create}. If a value was returned, it is moved to the
  * head of the queue. This returns null if a value is not cached and cannot
  * be created.
  */
 public final V get(K key) {
  if (key == null) {//key不能為空
   throw new NullPointerException("key == null");
  }

  V mapValue;
  synchronized (this) {
　　　　　　　　/獲取對應的緩存對象 
   mapValue = map.get(key);
   if (mapValue != null) {
    hitCount++;
    return mapValue;
   }
   missCount++;
  }

public V get(Object key) {
  LinkedHashMapEntry<K,V> e = (LinkedHashMapEntry<K,V>)getEntry(key);
  if (e == null)
   return null;
  e.recordAccess(this);//實現排序的關鍵
  return e.value;
 }

/**
   * This method is invoked by the superclass whenever the value
   * of a pre-existing entry is read by Map.get or modified by Map.set.
   * If the enclosing Map is access-ordered, it moves the entry
   * to the end of the list; otherwise, it does nothing.
   */
  void recordAccess(HashMap<K,V> m) {
   LinkedHashMap<K,V> lm = (LinkedHashMap<K,V>)m;
   if (lm.accessOrder) {//判斷是否是訪問順序
    lm.modCount++;
    remove();//刪除此元素
    addBefore(lm.header);//將此元素移到隊尾
   }
  }