java HashMap源码问题，只取HashMap put的方法

public V put(K key, V value) {
public V put(K key, V value) {
if (table == EMPTY_TABLE) {
inflateTable(threshold);
}
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;

//----------------------如果hash相同并且key相同,是覆盖，还是压根用回当前元素的内容
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;