HashMap集合特点

public V put(K key, V value) {
        if (key == null)
            return putForNullKey(value);
        int hash = hash(key.());
        int i = indexFor(hash, table.length);
        for (Entry<K,V> e = table[i]; e != null; e = e.next) {
            Object k;
            if ( && ((k = e.key) == key || key.(k))) {
                V oldValue = e.value;
                e.value = value;
                e.recordAccess(this);
                return oldValue;
            }
        }

        modCount++;
        addEntry(hash, key, value, i);
        return null;
    }