- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 221 for bits (1.17 sec)
-
src/test/java/jcifs/smb1/dcerpc/ndr/NdrShortTest.java
/** * Validate that the constructor masks the supplied value to its * lowest 8 bits (NdrShort incorrectly masks to 8 bits even though it's a short). */ @ParameterizedTest @ValueSource(ints = { 0, 1, 255, -1, 256, 65535 }) void constructorMasksValue(int input) { NdrShort ns = new NdrShort(input); // NdrShort masks to 0xFF (8 bits) in its constructor int expected = input & 0xFF;Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 5.1K 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;
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Oct 28 18:19:59 UTC 2025 - 25.6K bytes - Viewed (0) -
api/go1.12.txt
pkg log, method (*Logger) Writer() io.Writer pkg math/bits, func Add(uint, uint, uint) (uint, uint) pkg math/bits, func Add32(uint32, uint32, uint32) (uint32, uint32) pkg math/bits, func Add64(uint64, uint64, uint64) (uint64, uint64) pkg math/bits, func Div(uint, uint, uint) (uint, uint) pkg math/bits, func Div32(uint32, uint32, uint32) (uint32, uint32) pkg math/bits, func Div64(uint64, uint64, uint64) (uint64, uint64)
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Wed Jan 02 21:21:53 UTC 2019 - 13.5K bytes - Viewed (0) -
src/main/java/jcifs/smb1/smb1/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
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 8.8K bytes - Viewed (0) -
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)Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Jan 08 14:27:16 UTC 2025 - 10.7K bytes - Viewed (0) -
guava/src/com/google/common/math/DoubleUtils.java
long signifRounded = increment ? signifFloor + 1 : signifFloor; long bits = (long) (exponent + EXPONENT_BIAS) << SIGNIFICAND_BITS; bits += signifRounded; /* * If signifRounded == 2^53, we'd need to set all of the significand bits to zero and add 1 to * the exponent. This is exactly the behavior we get from just adding signifRounded to bits * directly. If the exponent is MAX_DOUBLE_EXPONENT, we round up (correctly) toRegistered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sat Dec 21 03:10:51 UTC 2024 - 5.1K bytes - Viewed (0) -
guava/src/com/google/common/primitives/UnsignedLong.java
* interpreted as an unsigned 64-bit value. Specifically, the sign bit of {@code bits} is * interpreted as a normal bit, and all other bits are treated as usual. * * <p>If the argument is nonnegative, the returned result will be equal to {@code bits}, * otherwise, the result will be equal to {@code 2^64 + bits}. *Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Jun 04 13:03:16 UTC 2025 - 8.8K bytes - Viewed (0) -
guava/src/com/google/common/hash/MacHashFunction.java
private final Key key; private final String toString; private final int bits; private final boolean supportsClone; MacHashFunction(String algorithmName, Key key, String toString) { this.prototype = getMac(algorithmName, key); this.key = checkNotNull(key); this.toString = checkNotNull(toString); this.bits = prototype.getMacLength() * Byte.SIZE; this.supportsClone = supportsClone(prototype); }
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sat Dec 21 03:10:51 UTC 2024 - 3.6K 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,Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Sep 23 19:23:59 UTC 2025 - 26.9K bytes - Viewed (0) -
src/test/java/jcifs/ACETest.java
@Test @DisplayName("Should validate constant bit ranges") void shouldValidateConstantBitRanges() { // File access constants should fit in lower 16 bits (0x0000FFFF) assertTrue(ACE.FILE_READ_DATA <= 0x0000FFFF, "FILE_READ_DATA should fit in lower 16 bits"); assertTrue(ACE.FILE_WRITE_DATA <= 0x0000FFFF, "FILE_WRITE_DATA should fit in lower 16 bits");Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 24.4K bytes - Viewed (0)