- Sort Score
- Result 10 results
- Languages All
Results 441 - 450 of 542 for vary (0.01 sec)
-
okhttp/src/jvmTest/kotlin/okhttp3/internal/ws/WebSocketReaderTest.kt
data.write("880203ee".decodeHex()) // Close with code 1006 for (i in 1015..2999) { data.write(("8802" + format("%04X", i)).decodeHex()) // Close with code 'i' } var count = 0 while (!data.exhausted()) { assertFailsWith<ProtocolException> { clientReader.processNextFrame() }.also { expected -> assertThat(expected.message!!)
Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Tue Nov 04 16:11:23 UTC 2025 - 14.4K bytes - Viewed (0) -
src/test/java/jcifs/internal/fscc/FileBothDirectoryInfoTest.java
fileBothDirectoryInfo.decode(buffer, 0, buffer.length); // Verify assertEquals("", fileBothDirectoryInfo.getFilename()); } @Test @DisplayName("Test decode with very long filename") void testDecodeWithLongFilename() throws SMBProtocolDecodingException { // Prepare test data with long filename (255 characters) StringBuilder longName = new StringBuilder();
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 20.9K bytes - Viewed (0) -
fess-crawler/src/test/java/org/codelibs/fess/crawler/rule/RuleTest.java
assertEquals(2, executionOrder.size()); assertEquals("match_true", executionOrder.get(0)); assertEquals("processor_executed", executionOrder.get(1)); } /** * Test rule with very long rule ID */ public void test_veryLongRuleId() { StringBuilder longId = new StringBuilder(); for (int i = 0; i < 1000; i++) { longId.append("verylongruleid_"); }Registered: Sat Dec 20 11:21:39 UTC 2025 - Last Modified: Wed Sep 03 14:42:53 UTC 2025 - 22.7K bytes - Viewed (0) -
guava/src/com/google/common/base/Suppliers.java
synchronized (lock) { if (nanos == expirationNanos) { // recheck for lost race T t = delegate.get(); value = t; nanos = now + durationNanos; // In the very unlikely event that nanos is 0, set it to 1; // no one will notice 1 ns of tardiness. expirationNanos = (nanos == 0) ? 1 : nanos; return t; } } }
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 16.5K bytes - Viewed (0) -
src/main/java/jcifs/internal/smb1/AndXServerMessageBlock.java
* the 'received' member of the response object will not * be set to true indicating the send and sendTransaction * methods that the next part should be sent. This is a * very indirect and simple batching control mechanism. */ if (this.andx == null || !getConfig().isUseBatching() || this.batchLevel >= getBatchLimit(getConfig(), (byte) this.andx.getCommand())) {
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sun Aug 31 08:00:57 UTC 2025 - 15.8K bytes - Viewed (0) -
src/test/java/jcifs/util/StringsTest.java
@NullAndEmptySource @ValueSource(strings = { "Simple ASCII", "Special chars: !@#$%^&*()", "Unicode: ñöt ascii ℃", "Mixed: ASCII + 中文 + Русский", "Emojis: 🎉🌟💻", "Very long string with multiple words and various characters 1234567890" }) void testGetBytesWithVariousInputs(String input) { // When byte[] result = Strings.getBytes(input, StandardCharsets.UTF_8);Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 18.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* they end up depending on <i>other</i> existing poor-quality {@code hashCode} implementations, * including those in many JDK classes. * * <p>{@code Object.hashCode} implementations tend to be very fast, but have weak collision * prevention and <i>no</i> expectation of bit dispersion. This leaves them perfectly suitable for * use in hash tables, because extra collisions cause only a slight performance hit, while poor bit
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 10.9K bytes - Viewed (0) -
guava/src/com/google/common/hash/HashFunction.java
* they end up depending on <i>other</i> existing poor-quality {@code hashCode} implementations, * including those in many JDK classes. * * <p>{@code Object.hashCode} implementations tend to be very fast, but have weak collision * prevention and <i>no</i> expectation of bit dispersion. This leaves them perfectly suitable for * use in hash tables, because extra collisions cause only a slight performance hit, while poor bit
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 10.9K bytes - Viewed (0) -
mockwebserver-deprecated/src/test/java/okhttp3/mockwebserver/MockWebServerTest.kt
import org.junit.runner.Description import org.junit.runners.model.Statement @Suppress("deprecation") @Timeout(30) @Tag("Slow") class MockWebServerTest { @RegisterExtension var platform = PlatformRule() private val server = MockWebServer() @BeforeEach fun setUp() { server.start() } @AfterEach fun tearDown() { server.shutdown() } @TestRegistered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Thu Jul 03 13:16:34 UTC 2025 - 22.3K bytes - Viewed (0) -
src/test/java/jcifs/internal/smb2/Smb2EncryptionContextTest.java
Smb2EncryptionContext context = new Smb2EncryptionContext(EncryptionNegotiateContext.CIPHER_AES128_GCM, DialectVersion.SMB311, encKey, decKey, sessionKey, preauthHash); // When - Set very low rotation limits to trigger rotation context.setKeyRotationBytesLimit(100); // Rotate after 100 bytes // Encrypt first message - should work byte[] plaintext1 = "Message before rotation".getBytes();
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sun Aug 31 08:00:57 UTC 2025 - 44.1K bytes - Viewed (0)