//1.無參構(gòu)造方法
public LinkedHashSet() {
		/**調(diào)用父類HashSet的構(gòu)造方法，dummy只是為了重載加的參數(shù)，沒有具體含義
		HashSet(int initialCapacity, float loadFactor, boolean dummy) {
        	map = new LinkedHashMap<>(initialCapacity, loadFactor);
    	}
		**/
		//默認(rèn)初始數(shù)組長(zhǎng)度16，加載因子為0.75
        super(16, .75f, true);
    }
//2.有參構(gòu)造方法，數(shù)組長(zhǎng)度
public LinkedHashSet(int initialCapacity) {
        super(initialCapacity, .75f, true);
    }
//3.有參構(gòu)造方法，數(shù)組長(zhǎng)度及加載因子
public LinkedHashSet(int initialCapacity, float loadFactor) {
        super(initialCapacity, loadFactor, true);
    }

//此參數(shù)是元素排序，等于true的時(shí)候是按哈希值排序，等于false的時(shí)候是按插入順序排序
final boolean accessOrder;
//1.無參構(gòu)造方法
public LinkedHashMap() {
        super();
        accessOrder = false;
    }
//2.有參構(gòu)造方法，數(shù)組長(zhǎng)度
public LinkedHashMap(int initialCapacity) {
        super(initialCapacity);
        accessOrder = false;
    }
//3.有參構(gòu)造方法，數(shù)組長(zhǎng)度和加載因子
public LinkedHashMap(int initialCapacity, float loadFactor) {
        super(initialCapacity, loadFactor);
        accessOrder = false;
    }

Node<K,V> newNode(int hash, K key, V value, Node<K,V> next) {
        return new Node<>(hash, key, value, next);
    }
//HashMap的內(nèi)部類Node
static class Node<K,V> implements Map.Entry<K,V> {
        final int hash;
        final K key;
        V value;
        Node<K,V> next;
        Node(int hash, K key, V value, Node<K,V> next) {
            this.hash = hash;
            this.key = key;
            this.value = value;
            this.next = next;
        }
        public final K getKey()        { return key; }
        public final V getValue()      { return value; }
        public final String toString() { return key + "=" + value; }
        public final int hashCode() {
            return Objects.hashCode(key) ^ Objects.hashCode(value);
        }
        public final V setValue(V newValue) {
            V oldValue = value;
            value = newValue;
            return oldValue;
        }
        public final boolean equals(Object o) {
            if (o == this)
                return true;
            if (o instanceof Map.Entry) {
                Map.Entry<?,?> e = (Map.Entry<?,?>)o;
                if (Objects.equals(key, e.getKey()) &&
                    Objects.equals(value, e.getValue()))
                    return true;
            }
            return false;
        }
    }

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;
    }
//LinkedHashMap的內(nèi)部類Entry<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);
        }
    }
//指針前后指向
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;
        }
    }