- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 258 for fits (0.04 sec)
-
lib/fips140/v1.1.0-rc1.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 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
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 Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Sep 25 19:53:19 UTC 2025 - 642.7K bytes - Viewed (0) -
doc/go_spec.html
all types in its type set must have the same underlying slice type <code>[]E</code>. </p> <p> If the capacity of <code>s</code> is not large enough to fit the additional values, <code>append</code> <a href="#Allocation">allocates</a> a new, sufficiently large underlying array that fits both the existing slice elements and the additional values.
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Tue Dec 02 23:07:19 UTC 2025 - 286.5K bytes - Viewed (1) -
android/guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
moment to be trampled under its feet, ran round the thistle again; then the puppy began a series of short charges at the stick, running a very little way forwards each time and a long way back, and barking hoarsely all the while, till at last it sat down a good way off, panting, with its tongue hanging out of its mouth, and its great eyes half shut. This seemed to Alice a good opportunity for making her escape;
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Fri Apr 21 02:27:51 UTC 2017 - 145.2K bytes - Viewed (0) -
src/archive/zip/struct.go
// If either the uncompressed or compressed size of the file // does not fit in 32 bits, CompressedSize is set to ^uint32(0). // // Deprecated: Use CompressedSize64 instead. CompressedSize uint32 // UncompressedSize is the uncompressed size of the file in bytes. // If either the uncompressed or compressed size of the file // does not fit in 32 bits, UncompressedSize is set to ^uint32(0). //
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Tue May 28 21:41:09 UTC 2024 - 12.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashing.java
static final byte UNSET = 0; /** Number of bits used to store the numbers of hash table bits (max 30). */ 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. */
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/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.Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 18.8K bytes - Viewed (0) -
doc/godebug.md
Cryptographic Module operates in FIPS 140-3 mode. The possible values are: - "off": no special support for FIPS 140-3 mode. This is the default. - "on": the Go Cryptographic Module operates in FIPS 140-3 mode. - "only": like "on", but cryptographic algorithms not approved by FIPS 140-3 return an error or panic. For more information, see [FIPS 140-3 Compliance](/doc/security/fips140).
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Wed Dec 03 00:18:09 UTC 2025 - 24.7K bytes - Viewed (0) -
src/cmd/asm/internal/arch/arm64.go
// constant) is one of the TBL-like instructions and one of its // inputs does not fit into prog.Reg, so require special handling. func IsARM64TBL(op obj.As) bool { switch op { case arm64.AVTBL, arm64.AVTBX, arm64.AVMOVQ: return true } return false } // IsARM64CASP reports whether the op (as defined by an arm64.A* // constant) is one of the CASP-like instructions, and its 2nd
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Oct 16 00:35:29 UTC 2025 - 6.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
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Mon Oct 04 20:20:20 UTC 2021 - 10.7K bytes - Viewed (0)