- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 300 for rehash (0.16 sec)
-
android/guava/src/com/google/common/cache/Striped64.java
* using a secondary hash (Marsaglia XorShift) to try to find a * free slot. * * The table size is capped because, when there are more threads * than CPUs, supposing that each thread were bound to a CPU, * there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Striped64.java
* using a secondary hash (Marsaglia XorShift) to try to find a * free slot. * * The table size is capped because, when there are more threads * than CPUs, supposing that each thread were bound to a CPU, * there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* using a secondary hash (Marsaglia XorShift) to try to find a * free slot. * * The table size is capped because, when there are more threads * than CPUs, supposing that each thread were bound to a CPU, * there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
E copyEntry(E original, E newNext) { int hash = original.getHash(); return segmentFor(hash).copyEntry(original, newNext); } int hash(Object key) { int h = keyEquivalence.hash(key); return rehash(h); } void reclaimValue(WeakValueReference<K, V, E> valueReference) { E entry = valueReference.getEntry(); int hash = entry.getHash();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 91.9K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/LocalCache.java
} /** * Applies a supplemental hash function to a given hash code, which defends against poor quality * hash functions. This is critical when the concurrent hash map uses power-of-two length hash * tables, that otherwise encounter collisions for hash codes that do not differ in lower or upper * bits. * * @param h hash code */ static int rehash(int h) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 144.7K bytes - Viewed (0) -
guava/src/com/google/common/cache/LocalCache.java
} /** * Applies a supplemental hash function to a given hash code, which defends against poor quality * hash functions. This is critical when the concurrent hash map uses power-of-two length hash * tables, that otherwise encounter collisions for hash codes that do not differ in lower or upper * bits. * * @param h hash code */ static int rehash(int h) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 150.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/MapsTest.java
} catch (IllegalArgumentException expected) { } } /** * Tests that nHMWES makes hash maps large enough that adding the expected number of elements * won't cause a rehash. * * <p>As of jdk7u40, HashMap has an empty-map optimization. The argument to new HashMap(int) is * noted, but the initial table is a zero-length array. *
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Mar 04 16:06:01 GMT 2024 - 67.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/MapsTest.java
} catch (IllegalArgumentException expected) { } } /** * Tests that nHMWES makes hash maps large enough that adding the expected number of elements * won't cause a rehash. * * <p>As of jdk7u40, HashMap has an empty-map optimization. The argument to new HashMap(int) is * noted, but the initial table is a zero-length array. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 04 16:06:01 GMT 2024 - 64.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
size--; modCount++; } /** Removes the entry at the specified index, given the hash of its key. */ void removeEntryKeyHashKnown(int entry, int keyHash) { removeEntry(entry, keyHash, Hashing.smearedHash(values[entry])); } /** Removes the entry at the specified index, given the hash of its value. */ void removeEntryValueHashKnown(int entry, int valueHash) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 36.4K bytes - Viewed (0) -
cmd/data-usage-cache.go
hash := hashPath(path) if d.Cache == nil { d.Cache = make(map[string]dataUsageEntry, 100) } d.Cache[hash.Key()] = e if parent != "" { phash := hashPath(parent) p := d.Cache[phash.Key()] p.addChild(hash) d.Cache[phash.Key()] = p } } // replaceHashed add or replaces an entry to the cache based on its hash.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Mon Apr 22 17:49:30 GMT 2024 - 41.4K bytes - Viewed (1)