V (K key) { Entry<K, V>[] entries = this.entries; int hash = hashKey(key); int index = hash & mask; for (Entry<K, V> e = entries[index]; e != null; e = e.hashNext) { K entryKey; if (e.keyHash == hash && ((entryKey = e.key) == key || hashingStrategy.isEqual(entryKey, key))) { moveToTop(e); return e.value; } } return null; }