- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for GOOD_FAST_HASH_128 (0.2 sec)
-
android/guava-tests/test/com/google/common/hash/HashFunctionEnum.java
* @author Kurt Alfred Kluever */ enum HashFunctionEnum { ADLER32(Hashing.adler32()), CRC32(Hashing.crc32()), GOOD_FAST_HASH_32(Hashing.goodFastHash(32)), GOOD_FAST_HASH_64(Hashing.goodFastHash(64)), GOOD_FAST_HASH_128(Hashing.goodFastHash(128)), GOOD_FAST_HASH_256(Hashing.goodFastHash(256)), MD5(Hashing.md5()), MURMUR3_128(Hashing.murmur3_128()), MURMUR3_32(Hashing.murmur3_32()),
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Sep 08 13:56:22 UTC 2021 - 1.7K bytes - Viewed (0) -
guava/src/com/google/common/hash/Murmur3_128HashFunction.java
@ElementTypesAreNonnullByDefault final class Murmur3_128HashFunction extends AbstractHashFunction implements Serializable { static final HashFunction MURMUR3_128 = new Murmur3_128HashFunction(0); static final HashFunction GOOD_FAST_HASH_128 = new Murmur3_128HashFunction(Hashing.GOOD_FAST_HASH_SEED); // TODO(user): when the shortcuts are implemented, update BloomFilterStrategies private final int seed; Murmur3_128HashFunction(int seed) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Apr 20 18:43:59 UTC 2021 - 5.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
} if (bits <= 128) { return Murmur3_128HashFunction.GOOD_FAST_HASH_128; } // Otherwise, join together some 128-bit murmur3s int hashFunctionsNeeded = (bits + 127) / 128; HashFunction[] hashFunctions = new HashFunction[hashFunctionsNeeded]; hashFunctions[0] = Murmur3_128HashFunction.GOOD_FAST_HASH_128; int seed = GOOD_FAST_HASH_SEED; for (int i = 1; i < hashFunctionsNeeded; i++) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Jul 19 16:02:36 UTC 2024 - 29.3K bytes - Viewed (0)