/** * Adds a new entry with the specified key, value and hash code to the specified bucket. It is the * responsibility of this method to resize the table if appropriate. * * <p>Subclass overrides this to alter the behavior of put method. */ 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) : 0; bucketIndex = indexFor(hash, table.length); } createEntry(hash, key, value, bucketIndex); }
/** * This method is used instead of put by constructors and pseudoconstructors (clone, readObject). * It does not resize the table, check for comodification, etc. It calls createEntry rather than * addEntry. */ private void putForCreate(K key, V value) { int hash = null == key ? 0 : hash(key); int i = indexFor(hash, table.length); /** * Look for preexisting entry for key. This will never happen for clone or deserialize. It will * only happen for construction if the input Map is a sorted map whose ordering is inconsistent * w/ equals. */ for (Entry<K, V> e = table[i]; e != null; e = e.next) { Object k; if (e.hash == hash && ((k = e.key) == key || (key != null && key.equals(k)))) { e.value = value; return; } } createEntry(hash, key, value, i); }