- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 242 for bits (0.15 sec)
-
android/guava/src/com/google/common/math/DoubleUtils.java
} /* * We need the top SIGNIFICAND_BITS + 1 bits, including the "implicit" one bit. To make rounding * easier, we pick out the top SIGNIFICAND_BITS + 2 bits, so we have one to help us round up or * down. twiceSignifFloor will contain the top SIGNIFICAND_BITS + 2 bits, and signifFloor the * top SIGNIFICAND_BITS + 1. *
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 28 15:37:52 GMT 2021 - 5.1K bytes - Viewed (0) -
okhttp/src/test/java/okhttp3/internal/ws/WebSocketExtensionsTest.kt
assertThat(parse("permessage-deflate; client_max_window_bits=8")).isEqualTo( WebSocketExtensions(perMessageDeflate = true, clientMaxWindowBits = 8), ) assertThat(parse("permessage-deflate; client_max_window_bits=\"8\"")).isEqualTo( WebSocketExtensions(perMessageDeflate = true, clientMaxWindowBits = 8), ) assertThat(parse("permessage-deflate; client_max_window_bits=15")).isEqualTo(
Plain Text - Registered: Fri Apr 19 11:42:09 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 8.3K bytes - Viewed (0) -
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 Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 25.3K 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 Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 25.3K bytes - Viewed (0) -
api/go1.9.txt
pkg math/bits (windows-amd64), const UintSize = 64 pkg math/bits, const UintSize ideal-int pkg math/bits, func LeadingZeros(uint) int pkg math/bits, func LeadingZeros16(uint16) int pkg math/bits, func LeadingZeros32(uint32) int pkg math/bits, func LeadingZeros64(uint64) int pkg math/bits, func LeadingZeros8(uint8) int pkg math/bits, func Len(uint) int pkg math/bits, func Len16(uint16) int pkg math/bits, func Len32(uint32) int
Plain Text - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Mon Oct 04 20:20:20 GMT 2021 - 10.7K bytes - Viewed (0) -
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 19 12:43:09 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K 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 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 10.7K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/ws/WebSocketExtensions.kt
* * Note that [java.util.zip.Deflater] is hardcoded to use 15 bits (32 KiB) for * `client_max_window_bits` and [java.util.zip.Inflater] is hardcoded to use 15 bits (32 KiB) for * `server_max_window_bits`. This harms our ability to support these parameters: * * * If `client_max_window_bits` is less than 15, OkHttp must close the web socket with code 1010.
Plain Text - Registered: Fri Apr 19 11:42:09 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 8.1K bytes - Viewed (0) -
src/main/java/jcifs/internal/dtyp/ACE.java
* the operation and the desired access bits are compared to the SID * and access mask of each ACE. If the SID matches, the allow/deny flags * and access mask are considered. If the ACE is a "deny" * ACE and <i>any</i> of the desired access bits match bits in the access * mask of the ACE, the whole access check fails. If the ACE is an "allow" * ACE and <i>all</i> of the bits in the desired access bits match bits in
Java - Registered: Sun Apr 21 00:10:10 GMT 2024 - Last Modified: Sun Jul 01 13:12:10 GMT 2018 - 5.4K 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 19 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0)