Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 182 for rehash (0.07 sec)

  1. 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
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Jun 14 17:55:55 UTC 2024
    - 11.5K bytes
    - Viewed (0)
  2. 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
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Jun 14 17:55:55 UTC 2024
    - 11.5K bytes
    - Viewed (0)
  3. 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();
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 20:24:49 UTC 2024
    - 90.8K bytes
    - Viewed (0)
  4. 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();
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 20:24:49 UTC 2024
    - 90.8K bytes
    - Viewed (0)
  5. 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) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 19:07:49 UTC 2024
    - 149.2K bytes
    - Viewed (0)
  6. 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.
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Oct 22 15:30:50 UTC 2024
    - 34.7K bytes
    - Viewed (0)
  7. guava/src/com/google/common/collect/HashBiMap.java

                K oldKey = delegate.key;
                int keyHash = smearedHash(key);
                if (keyHash == delegate.keyHash && Objects.equal(key, oldKey)) {
                  return key;
                }
                checkArgument(seekByKey(key, keyHash) == null, "value already present: %s", key);
                delete(delegate);
                BiEntry<K, V> newEntry =
                    new BiEntry<>(key, keyHash, delegate.value, delegate.valueHash);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 13 14:11:58 UTC 2023
    - 24.5K bytes
    - Viewed (0)
  8. 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) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Mar 06 16:06:58 UTC 2023
    - 36.4K bytes
    - Viewed (0)
  9. cmd/erasure-sets_test.go

    	// Tests hashing order to be consistent.
    	for i, testCase := range testCases {
    		if crcHashElement := hashKey("CRCMOD", testCase.objectName, 200, testUUID); crcHashElement != testCase.crcHash {
    			t.Errorf("Test case %d: Expected \"%v\" but failed \"%v\"", i+1, testCase.crcHash, crcHashElement)
    		}
    	}
    
    	if crcHashElement := hashKey("CRCMOD", "This will fail", -1, testUUID); crcHashElement != -1 {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Feb 12 07:21:56 UTC 2024
    - 6.9K bytes
    - Viewed (0)
  10. android/guava-tests/test/com/google/common/cache/LocalCacheTest.java

        assertNull(segment.get(key, hash));
    
        // count == 0
        table.set(index, entry);
        assertNull(segment.get(key, hash));
        assertFalse(segment.containsKey(key, hash));
        assertFalse(segment.containsValue(value));
    
        // count == 1
        segment.count++;
        assertSame(value, segment.get(key, hash));
        assertTrue(segment.containsKey(key, hash));
        assertTrue(segment.containsValue(value));
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 19:07:49 UTC 2024
    - 110.6K bytes
    - Viewed (0)
Back to top