- Sort Score
- Result 10 results
- Languages All
Results 1 - 9 of 9 for bitPack (0.08 sec)
-
src/main/java/jcifs/internal/smb1/trans/nt/NtTransQuerySecurityDesc.java
/** * Constructs an NT transaction to query security descriptor information. * @param config the configuration context * @param fid the file identifier to query * @param securityInformation bitmask specifying which security information to retrieve */ public NtTransQuerySecurityDesc(final Configuration config, final int fid, final int securityInformation) { super(config, NT_TRANSACT_QUERY_SECURITY_DESC);Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 3.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ObjectCountHashMap.java
} private static final int MAXIMUM_CAPACITY = 1 << 30; static final float DEFAULT_LOAD_FACTOR = 1.0f; /** Bitmask that selects the low 32 bits. */ private static final long NEXT_MASK = (1L << 32) - 1; /** Bitmask that selects the high 32 bits. */ private static final long HASH_MASK = ~NEXT_MASK; static final int DEFAULT_SIZE = 3; // used to indicate blank table entries
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 14.5K bytes - Viewed (0) -
src/main/java/jcifs/internal/smb1/trans/nt/NtTransNotifyChange.java
/** * Constructs an NT transaction for change notification monitoring. * @param config the configuration context * @param fid the file identifier to monitor * @param completionFilter bitmask specifying the types of changes to monitor * @param watchTree true to monitor the entire directory tree, false for directory only */Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 3.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashing.java
private static final int HASH_TABLE_BITS_MAX_BITS = 5; /** Use high bits of metadata for modification count. */ static final int MODIFICATION_COUNT_INCREMENT = 1 << HASH_TABLE_BITS_MAX_BITS; /** Bitmask that selects the low bits of metadata to get hashTableBits. */ static final int HASH_TABLE_BITS_MASK = (1 << HASH_TABLE_BITS_MAX_BITS) - 1; /** Maximum size of a compact hash-based collection (2^30 - 1 because 0 is UNSET). */
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 7K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashing.java
private static final int HASH_TABLE_BITS_MAX_BITS = 5; /** Use high bits of metadata for modification count. */ static final int MODIFICATION_COUNT_INCREMENT = 1 << HASH_TABLE_BITS_MAX_BITS; /** Bitmask that selects the low bits of metadata to get hashTableBits. */ static final int HASH_TABLE_BITS_MASK = (1 << HASH_TABLE_BITS_MAX_BITS) - 1; /** Maximum size of a compact hash-based collection (2^30 - 1 because 0 is UNSET). */
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 7K bytes - Viewed (0) -
src/main/java/jcifs/internal/smb2/multichannel/NetworkInterfaceInfo.java
* Set interface capabilities * * @param capability capability flags */ public void setCapability(int capability) { this.capability = capability; // Update capability flags based on bitmask this.rssCapable = (capability & Smb2ChannelCapabilities.NETWORK_INTERFACE_CAP_RSS) != 0; this.rdmaCapable = (capability & Smb2ChannelCapabilities.NETWORK_INTERFACE_CAP_RDMA) != 0; } /**Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 21 11:13:46 UTC 2025 - 9.8K bytes - Viewed (0) -
guava/src/com/google/common/math/LongMath.java
// But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two. // We bend over backwards to avoid branching, adapting a technique from // http://graphics.stanford.edu/~seander/bithacks.html#IntegerMinOrMax long delta = a - b; // can't overflow, since a and b are nonnegative long minDeltaOrZero = delta & (delta >> (Long.SIZE - 1)); // equivalent to Math.min(delta, 0)
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Nov 03 21:01:09 UTC 2025 - 46.8K bytes - Viewed (0) -
lib/fips140/v1.1.0-rc1.zip
:= highBits88(fieldFromMontgomery(fieldAdd(rPlusZ, ct0))) return byte(constanttime.ByteEq(v1, r1) ^ 1) } // bitPack implements BitPack(r mod± q, γ₁-1, γ₁), which packs the centered // coefficients of r into little-endian γ1+1-bit chunks. It appends to buf. // // It must only be applied to r with coefficients in [−γ₁+1, γ₁], as // guaranteed by the rejection conditions in Sign. func bitPack(b []byte, r ringElement, p parameters) []byte { switch p.γ1 { case 17: return bitPack18(b, r) case 19: return...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Dec 11 16:27:41 UTC 2025 - 663K bytes - Viewed (0) -
lib/fips140/v1.0.0-c2097c7c.zip
the leftmost octet in // maskedDB are not all equal to zero, output "inconsistent" and // stop. var bitMask byte = 0xff >> (8*emLen - emBits) if em[0] & ^bitMask != 0 { return ErrVerification } // 7. Let dbMask = MGF(H, emLen - hLen - 1). // // 8. Let DB = maskedDB \xor dbMask. mgf1XOR(db, hash, h) // 9. Set the leftmost 8 * emLen - emBits bits of the leftmost octet in DB // to zero. db[0] &= bitMask // If we don't know the salt length, look for the 0x01 delimiter. if sLen == pssSaltLengthAutodet {...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Sep 25 19:53:19 UTC 2025 - 642.7K bytes - Viewed (0)