- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 172 for hashInt (0.21 sec)
-
android/guava-tests/test/com/google/common/hash/HashingTest.java
Hashing.md5().bits() + Hashing.md5().bits(), Hashing.concatenating(Hashing.md5(), Hashing.md5()).bits()); assertEquals( Hashing.md5().bits() + Hashing.murmur3_32().bits(), Hashing.concatenating(Hashing.md5(), Hashing.murmur3_32()).bits()); assertEquals( Hashing.md5().bits() + Hashing.murmur3_32().bits() + Hashing.murmur3_128().bits(),
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 26.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
* specific length. * * <p>For example, if you need 1024-bit hash codes, you could join two {@link Hashing#sha512} hash * functions together: {@code Hashing.concatenating(Hashing.sha512(), Hashing.sha512())}. * * @since 19.0 */ public static HashFunction concatenating( HashFunction first, HashFunction second, HashFunction... rest) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Murmur3_32HashFunction.java
new Murmur3_32HashFunction(0, /* supplementaryPlaneFix= */ true); // We can include the non-BMP fix here because Hashing.goodFastHash stresses that the hash is a // temporary-use one. Therefore it shouldn't be persisted. static final HashFunction GOOD_FAST_HASH_32 = new Murmur3_32HashFunction(Hashing.GOOD_FAST_HASH_SEED, /* supplementaryPlaneFix= */ true); private static final int CHUNK_SIZE = 4;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Jun 15 20:59:00 GMT 2022 - 11.9K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/hash/MessageDigestAlgorithmBenchmark.java
} private enum Algorithm { MD5("MD5", Hashing.md5()), SHA_1("SHA-1", Hashing.sha1()), SHA_256("SHA-256", Hashing.sha256()), SHA_384("SHA-384", Hashing.sha384()), SHA_512("SHA-512", Hashing.sha512()); private final String algorithmName; private final HashFunction hashFn; Algorithm(String algorithmName, HashFunction hashFn) { this.algorithmName = algorithmName;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/MacHashFunctionTest.java
assertEquals( "Hashing.hmacMd5(Key[algorithm=HmacMD5, format=RAW])", Hashing.hmacMd5(MD5_KEY).toString()); assertEquals( "Hashing.hmacMd5(Key[algorithm=HmacMD5, format=RAW])", Hashing.hmacMd5(keyData).toString()); assertEquals( "Hashing.hmacSha1(Key[algorithm=HmacSHA1, format=RAW])", Hashing.hmacSha1(SHA1_KEY).toString()); assertEquals(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 13.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
} if (hashTableKToV.length < minCapacity) { int newTableSize = Hashing.closedTableSize(minCapacity, 1.0); hashTableKToV = createFilledWithAbsent(newTableSize); hashTableVToK = createFilledWithAbsent(newTableSize); for (int entryToRehash = 0; entryToRehash < size; entryToRehash++) { int keyHash = Hashing.smearedHash(keys[entryToRehash]); int keyBucket = bucket(keyHash);
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) -
guava-tests/test/com/google/common/collect/MapMakerInternalMapTest.java
Segment<Object, Object, ?, ?> segment = map.segments[0]; Object keyOne = new Object(); Object valueOne = new Object(); int hashOne = map.hash(keyOne); InternalEntry<Object, Object, ?> entryOne = segment.newEntryForTesting(keyOne, hashOne, null); WeakValueReference<Object, Object, ?> valueRefOne = segment.newWeakValueReferenceForTesting(entryOne, valueOne);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 35.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/MapMakerInternalMapTest.java
Segment<Object, Object, ?, ?> segment = map.segments[0]; Object keyOne = new Object(); Object valueOne = new Object(); int hashOne = map.hash(keyOne); InternalEntry<Object, Object, ?> entryOne = segment.newEntryForTesting(keyOne, hashOne, null); WeakValueReference<Object, Object, ?> valueRefOne = segment.newWeakValueReferenceForTesting(entryOne, valueOne);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 35.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/ChecksumHashFunctionTest.java
* the License. */ package com.google.common.hash; import static com.google.common.hash.Hashing.ChecksumType.ADLER_32; import static com.google.common.hash.Hashing.ChecksumType.CRC_32; import java.util.zip.Checksum; import junit.framework.TestCase; /** * Tests for ChecksumHashFunction. * * @author Colin Decker */
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Jan 30 14:33:12 GMT 2018 - 3.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
* double the index of the entry in entrySet.asList.) * * The basic data structure is described in https://en.wikipedia.org/wiki/Open_addressing. * The pointer to a key is stored in hashTable[Hashing.smear(key.hashCode()) % table.length], * save that if that location is already full, we try the next index, and the next, until we * find an empty table position. Since the table has a power-of-two size, we use
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 22.7K bytes - Viewed (0)