V (final long key) { final Entry<V>[] table = this.table; final int hash = hashCode(key); final int index = hash % table.length; for (Entry<V> e = table[index]; e != null; e = e.hashNext) { if (e.keyHash == hash && e.key == key) { moveToTop(e); return e.value; } } return null; }