- Sort Score
- Result 10 results
- Languages All
Results 181 - 190 of 289 for randomid (1.45 sec)
-
CHANGELOG/CHANGELOG-1.11.md
* Update kubectl to v1.10.7. * Support extra `--prune-whitelist` resources in kube-addon-manager. ([#67743](https://github.com/kubernetes/kubernetes/pull/67743), [@Random-Liu](https://github.com/Random-Liu))
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Thu Feb 06 06:04:15 UTC 2020 - 328.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/LongsTest.java
(byte) 0xAA, (byte) 0x99, (byte) 0x88)) .isEqualTo(0xFFEEDDCCBBAA9988L); } public void testByteArrayRoundTrips() { Random r = new Random(5); byte[] b = new byte[Longs.BYTES]; for (int i = 0; i < 1000; i++) { long num = r.nextLong(); assertThat(Longs.fromByteArray(Longs.toByteArray(num))).isEqualTo(num);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 28.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/ShortsTest.java
assertThat(Shorts.fromBytes((byte) 0xFE, (byte) 0xDC)).isEqualTo((short) 0xFEDC); } @GwtIncompatible // Shorts.fromByteArray, Shorts.toByteArray public void testByteArrayRoundTrips() { Random r = new Random(5); byte[] b = new byte[Shorts.BYTES]; // total overkill, but, it takes 0.1 sec so why not... for (int i = 0; i < 10000; i++) { short num = (short) r.nextInt();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 27.6K bytes - Viewed (0) -
guava/src/com/google/common/hash/Hashing.java
seed += 1500450271; // a prime; shouldn't matter hashFunctions[i] = murmur3_128(seed); } return new ConcatenatedHashFunction(hashFunctions); } /** * Used to randomize {@link #goodFastHash} instances, so that programs which persist anything * dependent on the hash codes they produce will fail sooner. */ @SuppressWarnings("GoodTime") // reading system time without TimeSource
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 22:06:57 UTC 2025 - 31.1K bytes - Viewed (0) -
src/main/java/jcifs/util/SecureCredentialStorage.java
return null; } // Convert char[] to byte[] for encryption byte[] plaintextBytes = charsToBytes(plaintext); try { // Generate random IV byte[] iv = new byte[GCM_IV_SIZE]; secureRandom.nextBytes(iv); // Setup cipher Cipher cipher = Cipher.getInstance(ENCRYPTION_ALGORITHM);
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 30 05:58:03 UTC 2025 - 12.7K bytes - Viewed (0) -
cmd/veeam-sos-api.go
// Veeam Block Size for backup and restore processing before compression is applied. The higher the block size, the more // backup space is needed for incremental backups. Larger block sizes also mean less performance for random read restore // methods like Instant Restore, File Level Recovery, and Database/Application restores. Veeam recommends that vendors
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Thu Aug 15 00:34:56 UTC 2024 - 8.8K bytes - Viewed (0) -
docs/smb3-features/01-smb3-lease-design.md
import java.util.Arrays; public class Smb2LeaseKey { private final byte[] key; // 16-byte lease key private static final SecureRandom random = new SecureRandom(); public Smb2LeaseKey() { this.key = new byte[16]; random.nextBytes(this.key); } public Smb2LeaseKey(byte[] key) { if (key.length != 16) {
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 02:53:50 UTC 2025 - 22K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/MultipartBody.kt
.build() return create(headers, body) } } } class Builder @JvmOverloads constructor( boundary: String = UUID.randomUUID().toString(), ) { private val boundary: ByteString = boundary.encodeUtf8() private var type = MIXED private val parts = mutableListOf<Part>() /**
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Wed Mar 19 19:25:20 UTC 2025 - 10.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/IntsTest.java
.isEqualTo(0x12131415); assertThat(Ints.fromBytes((byte) 0xFF, (byte) 0xEE, (byte) 0xDD, (byte) 0xCC)) .isEqualTo(0xFFEEDDCC); } public void testByteArrayRoundTrips() { Random r = new Random(5); byte[] b = new byte[Ints.BYTES]; // total overkill, but, it takes 0.1 sec so why not... for (int i = 0; i < 10000; i++) { int num = r.nextInt();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 29.2K bytes - Viewed (0) -
src/test/java/jcifs/util/SecureCredentialStorageTest.java
byte[] encrypted1 = storage.encryptCredentials(plaintext.clone()); byte[] encrypted2 = storage.encryptCredentials(plaintext.clone()); // Should produce different ciphertexts due to random IV assertFalse(Arrays.equals(encrypted1, encrypted2), "Different encryptions should produce different ciphertexts"); // But both should decrypt to same plaintext
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 30 05:58:03 UTC 2025 - 12.7K bytes - Viewed (0)