HashMap

1.7

put() && indexFor()

public V put(K key, V value) {
   
    if (table == EMPTY_TABLE) {
   
        //是空表，初始化
        inflateTable(threshold);
    }
    //hashMap允许插入key == null
    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;
        //key完全相同，替换value
        if (e.hash == hash && ((k = e.key) == key || key.equals(k))) {
   
            V oldValue = e.value;
            e.value = value;
            e.recordAccess(this);
            return oldValue;
        }
    }
	
    modCount++;
    //添加数据
    addEntry(hash, key, value, i);
    return null;
}

static int indexFor(int h, int length) {
   
    //index计算其实一样
    return h & (length-1);
}

---

inflateTable() && roundUpToPowerOf2() && initHashSeedAsNeeded()

private void inflateTable(int toSize) {
   
    // Find a power of 2 >= toSize
    // 找到大于number的最小2的幂
    // 初始化容量
    int capacity = roundUpToPowerOf2(toSize);

    //初始化容量阈值
    threshold = (int) Math.min(capacity * loadFactor, MAXIMUM_CAPACITY + 1);
    table = new Entry[capacity];
    initHashSeedAsNeeded(capacity);
}

private static int roundUpToPowerOf2(int number) {
   
    //找到大于number的最小2的幂
    return number >= MAXIMUM_CAPACITY
        ? MAXIMUM_CAPACITY
        : (number > 1) ? Integer.highestOneBit((number - 1) << 1) : 1;
}

//hashseed(hash种子)重新赋值
final boolean initHashSeedAsNeeded(int capacity) {
   
    boolean currentAltHashing = hashSeed != 0;
    boolean useAltHashing = sun.misc.VM.isBooted() &&
        (capacity >= Holder.ALTERNATIVE_HASHING_THRESHOLD);
    boolean switching = currentAltHashing ^ useAltHashing;
    if (switching) {
   
        hashSeed = useAltHashing
            ? sun.misc.Hashing.randomHashSeed(this)
            : 0;
    }
    return switching;
}

---

addEntry() && createEntry()

void addEntry(int hash, K key, V value, int bucketIndex) {
   
    //判断是否需要扩容
    if ((size >= threshold) && (null != table[bucketIndex])) {
   
        resize(2 * table.length);
        hash = (null != key) ? hash(key) :