- Sort Score
- Num 10 results
- Language All
Results 41 - 50 of 1,424 for Kits (0.05 seconds)
-
guava/src/com/google/common/collect/Sets.java
return new AbstractIterator<Set<E>>() { final BitSet bits = new BitSet(index.size()); @Override protected @Nullable Set<E> computeNext() { if (bits.isEmpty()) { bits.set(0, size); } else { int firstSetBit = bits.nextSetBit(0); int bitToFlip = bits.nextClearBit(firstSetBit);
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Feb 23 19:19:10 GMT 2026 - 83K bytes - Click Count (0) -
lib/fips140/v1.26.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])...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
src/test/java/jcifs/dcerpc/ndr/NdrShortTest.java
// Given: An input value // When: Creating NdrShort with that value NdrShort ndrShort = new NdrShort(inputValue); // Then: Value should be masked with 0xFF (lower 8 bits) assertEquals(inputValue & 0xFF, ndrShort.value, "Constructor should mask value with 0xFF"); } @Test @DisplayName("Should handle zero value correctly")Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 11.2K bytes - Click Count (0) -
android/guava/src/com/google/common/net/InetAddresses.java
* This method does so by hashing 64 bits of the IPv6 address into {@code 224.0.0.0/3} (64 bits * into 29 bits): * * <ul> * <li>If the IPv6 address contains an embedded IPv4 address, the function hashes that. * <li>Otherwise, it hashes the upper 64 bits of the IPv6 address. * </ul> * * <p>A "coerced" IPv4 address is equivalent to itself.Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Mar 19 18:53:45 GMT 2026 - 47.7K bytes - Click Count (0) -
android/guava/src/com/google/common/hash/FarmHashFingerprint64.java
import com.google.common.annotations.VisibleForTesting; /** * Implementation of FarmHash Fingerprint64, an open-source fingerprinting algorithm for strings. * * <p>Its speed is comparable to CityHash64, and its quality of hashing is at least as good. * * <p>Note to maintainers: This implementation relies on signed arithmetic being bit-wise equivalent * to unsigned arithmetic in all cases except: * * <ul>
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Aug 11 19:31:30 GMT 2025 - 7.6K bytes - Click Count (0) -
src/test/java/jcifs/internal/TreeConnectResponseTest.java
@Test @DisplayName("Should indicate search bits support") void testIsSupportSearchBits() throws Exception { // Test with search bits supported setPrivateField(response, "supportSearchBits", true); assertTrue(response.isSupportSearchBits(), "Should indicate search bits support"); // Test without search bits supportCreated: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 24.9K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/RateLimiter.java
* during which the {@code RateLimiter} smoothly ramps up its rate, until it reaches its maximum * rate at the end of the period (as long as there are enough requests to saturate it). Similarly, * if the {@code RateLimiter} is left <i>unused</i> for a duration of {@code warmupPeriod}, it * will gradually return to its "cold" state, i.e. it will go through the same warming up process * as when it was first created.Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Dec 26 20:05:27 GMT 2025 - 21.8K bytes - Click Count (0) -
doc/asm.html
<li> <code>R0.UXTB</code> <br> <code>R0.UXTB<<imm</code>: <code>UXTB</code>: extract an 8-bit value from the low-order bits of <code>R0</code> and zero-extend it to the size of <code>R0</code>. <code>R0.UXTB<<imm</code>: left shift the result of <code>R0.UXTB</code> by <code>imm</code> bits. The <code>imm</code> value can be 0, 1, 2, 3, or 4.
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Fri Nov 14 19:09:46 GMT 2025 - 36.5K bytes - Click Count (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])...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0) -
internal/crypto/error.go
// MD5 checksum. ErrMissingCustomerKeyMD5 = Errorf("The SSE-C request is missing the customer key MD5") // ErrInvalidCustomerKey indicates that the SSE-C client key is not valid - e.g. not a // base64-encoded string or not 256 bits long. ErrInvalidCustomerKey = Errorf("The SSE-C client key is invalid") // ErrSecretKeyMismatch indicates that the provided secret key (SSE-C client key / SSE-S3 KMS key)
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 4.4K bytes - Click Count (0)