HashMap的Entry内部类

map.entrySet();

    public Set<Map.Entry<K,V>> entrySet() {
        Set<Map.Entry<K,V>> es;
        return (es = entrySet) == null ? (entrySet = new EntrySet()) : es;
    }

会放回一个空的EntrySet.

final class EntrySet extends AbstractSet<Map.Entry<K,V>>

那什么时候才会进行真正的初始化呢？

调用迭代器的时候。

public final Iterator<Map.Entry<K,V>> iterator() {
            return new EntryIterator();
}



final class EntryIterator extends HashIterator
        implements Iterator<Map.Entry<K,V>> {
        public final Map.Entry<K,V> next() { return nextNode(); }
}

    abstract class HashIterator {
        Node<K,V> next;        // next entry to return
        Node<K,V> current;     // current entry
        int expectedModCount;  // for fast-fail
        int index;             // current slot

        HashIterator() {
            expectedModCount = modCount;
            Node<K,V>[] t = table;
            current = next = null;
            index = 0;
            if (t != null && size > 0) { // advance to first entry
                do {} while (index < t.length && (next = t[index++]) == null);
            }
     }

它会调用抽象类HashIterator的构造方法让next指向第一个元素。