- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 46 for bits (0.2 sec)
-
android/guava/src/com/google/common/hash/Hashing.java
public static HashFunction goodFastHash(int minimumBits) { int bits = checkPositiveAndMakeMultipleOf32(minimumBits); if (bits == 32) { return Murmur3_32HashFunction.GOOD_FAST_HASH_32; } if (bits <= 128) { return Murmur3_128HashFunction.GOOD_FAST_HASH_128; } // Otherwise, join together some 128-bit murmur3s int hashFunctionsNeeded = (bits + 127) / 128;
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) -
guava-tests/test/com/google/common/hash/HashingTest.java
Hashing.concatenating(asList(Hashing.md5(), Hashing.murmur3_32(), Hashing.murmur3_128())) .bits()); } public void testConcatenatingVarArgs_bits() { assertEquals( Hashing.md5().bits() + Hashing.md5().bits(), Hashing.concatenating(Hashing.md5(), Hashing.md5()).bits()); assertEquals( Hashing.md5().bits() + Hashing.murmur3_32().bits(),
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 26.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/HashTestUtils.java
* Test for avalanche with 2-bit deltas. Most probabilities of output bit(j) differing are well * within 50%. */ static void check2BitAvalanche(HashFunction function, int trials, double epsilon) { Random rand = new Random(0); int keyBits = 32; int hashBits = function.bits(); for (int bit1 = 0; bit1 < keyBits; bit1++) { for (int bit2 = 0; bit2 < keyBits; bit2++) { if (bit2 <= bit1) continue;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 25.3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* byte sequences under the covers. * <li><b>hash code:</b> each hash function always yields hash codes of the same fixed bit length * (given by {@link #bits}). For example, {@link Hashing#sha1} produces a 160-bit number, * while {@link Hashing#murmur3_32()} yields only 32 bits. Because a {@code long} value is * clearly insufficient to hold all hash code values, this API represents a hash code as an
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 25 18:22:59 GMT 2021 - 10.9K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilterStrategies.java
LockFreeBitArray bits) { long bitSize = bits.bitSize(); long hash64 = Hashing.murmur3_128().hashObject(object, funnel).asLong(); int hash1 = (int) hash64; int hash2 = (int) (hash64 >>> 32); boolean bitsChanged = false; for (int i = 1; i <= numHashFunctions; i++) { int combinedHash = hash1 + (i * hash2); // Flip all the bits if it's negative (guaranteed positive number)
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 10.7K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
@ParametricNullness T object, Funnel<? super T> funnel, int numHashFunctions, LockFreeBitArray bits); /** * Queries {@code numHashFunctions} bits of the given bit array, by hashing a user element; * returns {@code true} if and only if all selected bits are set. */ <T extends @Nullable Object> boolean mightContain( @ParametricNullness T object,
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashCode.java
/** * An immutable hash code of arbitrary bit length. * * @author Dimitris Andreou * @author Kurt Alfred Kluever * @since 11.0 */ @ElementTypesAreNonnullByDefault public abstract class HashCode { HashCode() {} /** Returns the number of bits in this hash code; a positive multiple of 8. */ public abstract int bits(); /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 20 18:43:59 GMT 2021 - 12.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
/** Stores the hash table mask as the number of bits needed to represent an index. */ private void setHashTableMask(int mask) { int hashTableBits = Integer.SIZE - Integer.numberOfLeadingZeros(mask); metadata = CompactHashing.maskCombine(metadata, hashTableBits, CompactHashing.HASH_TABLE_BITS_MASK); } /** Gets the hash table mask using the stored number of hash table bits. */ private int hashTableMask() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
android/guava/src/com/google/common/net/InetAddresses.java
* This method does so by hashing 64 bits of the IPv6 address into {@code 224.0.0.0/3} (64 bits * into 29 bits): * * <ul> * <li>If the IPv6 address contains an embedded IPv4 address, the function hashes that. * <li>Otherwise, it hashes the upper 64 bits of the IPv6 address. * </ul> * * <p>A "coerced" IPv4 address is equivalent to itself.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 44K bytes - Viewed (1) -
android/guava/src/com/google/common/math/BigIntegerMath.java
long numeratorAccum = n; long denominatorAccum = 1; int bits = LongMath.log2(n, CEILING); int numeratorBits = bits; for (int i = 1; i < k; i++) { int p = n - i; int q = i + 1; // log2(p) >= bits - 1, because p >= n/2 if (numeratorBits + bits >= Long.SIZE - 1) { // The numerator is as big as it can get without risking overflow.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0)