public class LinkedHashMap<K,V>
    extends HashMap<K,V> //繼承了HashMap
    implements Map<K,V>//實(shí)現(xiàn)了Map接口
{

     private transient Entry<K,V> header; //頭結(jié)點(diǎn)
     private final boolean accessOrder;//順序性； true(訪問(wèn)有序); false(插入有序)

//子類重寫方法；
@Override
    void init() {
        header = new Entry<>(-1, null, null, null); //hash值為-1；
        header.before = header.after = header;
    }
   //父類構(gòu)造函數(shù)：
    public HashMap(int initialCapacity, float loadFactor) {
        if (initialCapacity < 0)
            throw new IllegalArgumentException("Illegal initial capacity: " +
                                               initialCapacity);
        if (initialCapacity > MAXIMUM_CAPACITY)
            initialCapacity = MAXIMUM_CAPACITY;
        if (loadFactor <= 0 || Float.isNaN(loadFactor))
            throw new IllegalArgumentException("Illegal load factor: " +
                                               loadFactor);
        this.loadFactor = loadFactor;
        threshold = initialCapacity;
        init(); //在LinkedHashMap起作用，用來(lái)初始化header;
    }

 public LinkedHashMap(int initialCapacity, float loadFactor) {
        super(initialCapacity, loadFactor);//調(diào)用父類的構(gòu)造函數(shù)
        accessOrder = false; 
    }
     //只指定數(shù)組大小
    public LinkedHashMap(int initialCapacity) {
        super(initialCapacity); 
        accessOrder = false;
    }
    public LinkedHashMap() {
        super();
        accessOrder = false;
    }
    public LinkedHashMap(Map<? extends K, ? extends V> m) {
        super(m);
        accessOrder = false;
    }
     //指定數(shù)組大小。加載因子，以及確定使用何種有序
    public LinkedHashMap(int initialCapacity,
                         float loadFactor,
                         boolean accessOrder) {
        super(initialCapacity, loadFactor);
        this.accessOrder = accessOrder;
    }

// （父類HashMap實(shí)現(xiàn)）
public V put(K key, V value) {
    if (table == EMPTY_TABLE) {//如果table為空，創(chuàng)建默認(rèn)數(shù)組
        inflateTable(threshold);
    }
    if (key == null)//對(duì)key進(jìn)行特殊處理，key為null總在0號(hào)角標(biāo)鏈表中
        return putForNullKey(value);
    int hash = hash(key);
    int i = indexFor(hash, table.length); //通過(guò)hash找到對(duì)應(yīng)角標(biāo)
    for (Entry<K,V> e = table[i]; e != null; e = e.next) {
    //遍歷該角標(biāo)倆表，找到對(duì)應(yīng)key值
        Object k;
        if (e.hash == hash && ((k = e.key) == key || key.equals(k))) {
        //找到key值將value值進(jìn)行更新，并返回舊的value值
            V oldValue = e.value;
            e.value = value;
            e.recordAccess(this);//此方法在子類LinkedHashMap重寫，發(fā)揮作用；
				//針對(duì)LinkedHashMap,確定是插入有序，還是插入有序；
				//如果是訪問(wèn)有序，將原節(jié)點(diǎn)刪除，并添加到header最后
            return oldValue;
        }
    }
    modCount++;
    addEntry(hash, key, value, i);//現(xiàn)有集合中沒(méi)找到key，那么創(chuàng)建一個(gè)新的entry實(shí)體
    return null;
}
//（當(dāng)前類LinkedHashMap實(shí)現(xiàn)）
void addEntry(int hash, K key, V value, int bucketIndex) {
//目前此函數(shù)并沒(méi)有看出與父類的區(qū)別
    super.addEntry(hash, key, value, bucketIndex);//調(diào)用父類創(chuàng)建entry實(shí)體
    // Remove eldest entry if instructed
    Entry<K,V> eldest = header.after;
    if (removeEldestEntry(eldest)) {//總返回false；這句等于無(wú)效代碼，留作后用；
        removeEntryForKey(eldest.key);
    }
}
//（父類HashMap實(shí)現(xiàn)）
void addEntry(int hash, K key, V value, int bucketIndex) {
    if ((size >= threshold) && (null != table[bucketIndex])) {
    //如果集合中元素個(gè)數(shù)已經(jīng)大于閾值，那么進(jìn)行擴(kuò)容；
        resize(2 * table.length);//二倍擴(kuò)容
        hash = (null != key) ? hash(key) : 0; 
        bucketIndex = indexFor(hash, table.length); 找到新的key對(duì)應(yīng)的數(shù)組角標(biāo)
    }
    createEntry(hash, key, value, bucketIndex);//創(chuàng)建entry實(shí)體，子類重寫
}
//（當(dāng)前類LinkedHashMap實(shí)現(xiàn)）
void createEntry(int hash, K key, V value, int bucketIndex) {
    HashMap.Entry<K,V> old = table[bucketIndex];
    Entry<K,V> e = new Entry<>(hash, key, value, old);//頭插法
    table[bucketIndex] = e;
    e.addBefore(header);//實(shí)現(xiàn)第二功能，使數(shù)據(jù)實(shí)現(xiàn)插入有序；
    size++;
}
//（當(dāng)前類LinkedHashMap實(shí)現(xiàn)） ,addBefore為子類Entry內(nèi)部類中的方法，
//Entry多了兩個(gè)屬性，before(前驅(qū))，after(后驅(qū))
private void addBefore(Entry<K,V> existingEntry) {
//使header實(shí)現(xiàn)插入有序，header所處鏈表實(shí)質(zhì)上為一個(gè)循環(huán)的雙向鏈表；
//將header.after理解為頭結(jié)點(diǎn)的下一個(gè)結(jié)點(diǎn)，將header.before理解為尾結(jié)點(diǎn)；新結(jié)點(diǎn)插入位置為尾插
    after  = existingEntry;//新的尾結(jié)點(diǎn)鏈接頭結(jié)點(diǎn)
    before = existingEntry.before;//新的尾結(jié)點(diǎn)的前驅(qū)鏈接舊的尾結(jié)點(diǎn)
    before.after = this;//舊的尾結(jié)點(diǎn)的下一結(jié)點(diǎn)鏈接新的尾結(jié)點(diǎn)
    after.before = this;//新的尾結(jié)點(diǎn)的下一結(jié)點(diǎn)的前驅(qū)鏈接新的尾結(jié)點(diǎn)
    //當(dāng)然這句代碼可以改為existingEntry.before=this;//頭結(jié)點(diǎn)的前驅(qū)鏈接新的尾結(jié)點(diǎn)
}
  //根據(jù)put操作和get操作，并且根據(jù)當(dāng)前集合是插入有序還是訪問(wèn)有序，進(jìn)行操作； 
  void recordAccess(HashMap<K,V> m) { 
            LinkedHashMap<K,V> lm = (LinkedHashMap<K,V>)m;
            if (lm.accessOrder) { //訪問(wèn)有序，刪除原節(jié)點(diǎn)，并將新節(jié)點(diǎn)添加到最后；
                lm.modCount++;
                remove();//刪除當(dāng)前節(jié)點(diǎn)
                addBefore(lm.header);//在末尾添加被刪除節(jié)點(diǎn)
            }
        }