Lines Matching defs:hash
105 * the initial capacity of this hash map.
154 LinkedEntry(K key, V value, int hash, HashMapEntry<K, V> next,
156 super(key, value, hash, next);
177 * to the hash table (which is properly the province of our superclass).
182 * the resulting hash table corrupt.
184 @Override void addNewEntry(K key, V value, int hash, int index) {
196 key, value, hash, table[index], header, oldTail);
220 K key, V value, int hash, HashMapEntry<K, V> next) {
224 = new LinkedEntry<K,V>(key, value, hash, next, header, oldTail);
251 int hash = key.hashCode();
252 hash ^= (hash >>> 20) ^ (hash >>> 12);
253 hash ^= (hash >>> 7) ^ (hash >>> 4);
256 for (HashMapEntry<K, V> e = tab[hash & (tab.length - 1)];
259 if (eKey == key || (e.hash == hash && key.equals(eKey))) {