- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 1,077 for Bits (0.04 sec)
-
src/cmd/asm/internal/arch/arm.go
if cond == "" { return true } bits, ok := ParseARMCondition(cond) if !ok { return false } /* hack to make B.NE etc. work: turn it into the corresponding conditional */ if prog.As == arm.AB { prog.As = bcode[(bits^arm.C_SCOND_XOR)&0xf] bits = (bits &^ 0xf) | arm.C_SCOND_NONE } prog.Scond = bits return true }
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Oct 23 15:18:14 UTC 2024 - 6.1K bytes - Viewed (0) -
lib/fips140/v1.0.0.zip
errors.New("edwards25519: invalid field element input size") } // Bits 0:51 (bytes 0:8, bits 0:64, shift 0, mask 51). v.l0 = byteorder.LEUint64(x[0:8]) v.l0 &= maskLow51Bits // Bits 51:102 (bytes 6:14, bits 48:112, shift 3, mask 51). v.l1 = byteorder.LEUint64(x[6:14]) >> 3 v.l1 &= maskLow51Bits // Bits 102:153 (bytes 12:20, bits 96:160, shift 6, mask 51). v.l2 = byteorder.LEUint64(x[12:20]) >> 6 v.l2 &= maskLow51Bits // Bits 153:204 (bytes 19:27, bits 152:216, shift 1, mask 51). v.l3 = byteorder.LEUint64(x[19:27])...
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 29 15:10:35 UTC 2025 - 635K bytes - Viewed (0) -
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: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 5.1K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/idn/IdnaMappingTable.kt
* * ``` * 0..63 : Length of the UTF-16 sequence that this range maps to. The offset is b2b3. * 64..79 : Offset by a fixed negative offset. The bottom 4 bits of b1 are the top 4 bits of the offset. * 80..95 : Offset by a fixed positive offset. The bottom 4 bits of b1 are the top 4 bits of the offset. * 119 : Ignored. * 120 : Valid. * 121 : Disallowed * 122 : Mapped inline to the sequence: [b2].
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Fri Dec 27 13:39:56 UTC 2024 - 9K 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: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 8.8K bytes - Viewed (0) -
guava/src/com/google/common/hash/ChecksumHashFunction.java
private final int bits; private final String toString; ChecksumHashFunction( ImmutableSupplier<? extends Checksum> checksumSupplier, int bits, String toString) { this.checksumSupplier = checkNotNull(checksumSupplier); checkArgument(bits == 32 || bits == 64, "bits (%s) must be either 32 or 64", bits); this.bits = bits; this.toString = checkNotNull(toString); }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Feb 13 17:34:21 UTC 2025 - 4.4K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
/** Checks that the passed argument is positive, and ceils it to a multiple of 32. */ static int checkPositiveAndMakeMultipleOf32(int bits) { checkArgument(bits > 0, "Number of bits must be positive"); return (bits + 31) & ~31; } /** * Returns a hash function which computes its hash code by concatenating the hash codes of the * underlying hash functions together. This can be useful if you need to generate hash codes of a
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Jul 17 15:26:41 UTC 2025 - 29.8K 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 Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 02 21:21:53 UTC 2019 - 13.5K 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)
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 10.6K 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
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Mon Oct 04 20:20:20 UTC 2021 - 10.7K bytes - Viewed (0)