Lines Matching full:hash
63 * The returned map is implemented as a hash table with similar performance
114 * any other kind of hash table is a relatively slow operation, so,
131 * contention. Because placement in hash tables is essentially random,
346 @Override int hash(Object o) {
355 int hash, ReferenceEntry<K, V> next) {
357 ? new WeakEntry<K, V>(internals, key, hash)
358 : new LinkedWeakEntry<K, V>(internals, key, hash, next);
365 ? new WeakEntry<K, V>(from.internals, key, from.hash)
367 from.internals, key, from.hash, newNext);
375 @Override int hash(Object o) {
384 int hash, ReferenceEntry<K, V> next) {
386 ? new SoftEntry<K, V>(internals, key, hash)
387 : new LinkedSoftEntry<K, V>(internals, key, hash, next);
394 ? new SoftEntry<K, V>(from.internals, key, from.hash)
396 hash, newNext);
404 @Override int hash(Object o) {
413 int hash, ReferenceEntry<K, V> next) {
415 ? new StrongEntry<K, V>(internals, key, hash)
417 internals, key, hash, next);
424 ? new StrongEntry<K, V>(from.internals, key, from.hash)
426 from.internals, key, from.hash, newNext);
439 abstract int hash(Object o);
453 int hash, ReferenceEntry<K, V> next);
529 return keyStrength.hash(key);
541 K key, int hash, ReferenceEntry<K, V> next) {
542 return keyStrength.newEntry(internals, key, hash, next);
868 /** Gets the entry's hash. */
882 int hash) {
885 this.hash = hash;
895 final int hash;
912 return hash;
919 K key, int hash, ReferenceEntry<K, V> next) {
920 super(internals, key, hash);
937 int hash) {
940 this.hash = hash;
954 final int hash;
971 return hash;
977 K key, int hash, ReferenceEntry<K, V> next) {
978 super(internals, key, hash);
995 int hash) {
998 this.hash = hash;
1012 final int hash;
1029 return hash;
1035 K key, int hash, ReferenceEntry<K, V> next) {
1036 super(internals, key, hash);
