- Sort Score
- Num 10 results
- Language All
Results 371 - 380 of 606 for State (0.02 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
src/test/java/jcifs/smb/SSPContextTest.java
assertThrows(CIFSException.class, () -> ctx.verifyMIC(data, null)); } @Test @DisplayName("dispose toggles state and is not idempotent") void testDisposeBehavior() throws Exception { DummySSPContext ctx = new DummySSPContext(new byte[] { 1 }, true, null, null, 0, false); ctx.dispose();
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 15.2K bytes - Click Count (0) -
android/guava/src/com/google/common/net/UrlEscapers.java
* escaper escapes all non-ASCII characters, even though <a * href="https://url.spec.whatwg.org/#url-code-points">many of these are accepted in modern * URLs</a>. (<a href="https://url.spec.whatwg.org/#path-state">If the escaper were to leave these * characters unescaped, they would be escaped by the consumer at parse time, anyway.</a>) * Additionally, the escaper escapes the slash character ("/"). While slashes are acceptable in
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sat Dec 21 03:10:51 GMT 2024 - 7.1K bytes - Click Count (0) -
android/guava/src/com/google/common/hash/FarmHashFingerprint64.java
*/ private static long hashLength65Plus(byte[] bytes, int offset, int length) { int seed = 81; // For strings over 64 bytes we loop. Internal state consists of 56 bytes: v, w, x, y, and z. long x = seed; @SuppressWarnings("ConstantOverflow") long y = seed * K1 + 113; long z = shiftMix(y * K2 + 113) * K2; long[] v = new long[2];
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) -
android/guava/src/com/google/common/util/concurrent/AtomicDoubleArray.java
b.append(longBitsToDouble(longs.get(i))); if (i == iMax) { return b.append(']').toString(); } b.append(',').append(' '); } } /** * Saves the state to a stream (that is, serializes it). * * @serialData The length of the array is emitted (int), followed by all of its elements (each a * {@code double}) in the proper order. */
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Jan 29 22:14:05 GMT 2026 - 8.1K bytes - Click Count (0) -
src/main/java/jcifs/smb/SmbFileHandleImpl.java
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sun Aug 31 08:00:57 GMT 2025 - 9.4K bytes - Click Count (1) -
src/test/java/jcifs/SmbTreeTest.java
* Test for close() idempotency. * Verifies that calling close multiple times has the same effect as calling it once. */ @Test void testClose_idempotency() { // Mock a tree that tracks close state SmbTree idempotentTree = mock(SmbTree.class); doNothing().when(idempotentTree).close(); // Close multiple times idempotentTree.close(); idempotentTree.close();
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 9.2K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/FluentFuture.java
* AsyncFunction.apply}. Any heavyweight operations should occur in other threads responsible for * completing the returned {@code Future}.) * * <p>The returned {@code Future} attempts to keep its cancellation state in sync with that of the * input future and that of the future returned by the chain function. That is, if the returned * {@code Future} is cancelled, it will attempt to cancel the other two, and if either of theCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Feb 23 19:19:10 GMT 2026 - 19.8K bytes - Click Count (0) -
src/test/java/jcifs/internal/smb2/lease/DirectoryLeasingIntegrationTest.java
for (Thread thread : updateThreads) { thread.join(5000); } for (Thread thread : readThreads) { thread.join(5000); } // Verify final state assertEquals(100, entry.getChildren().size()); assertTrue(entry.hasChanges()); }
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 23 01:47:47 GMT 2025 - 14.2K bytes - Click Count (0) -
LICENSE
reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions.Created: Wed Apr 01 00:11:11 GMT 2026 - Last Modified: Thu Feb 20 19:53:57 GMT 2020 - 11.1K bytes - Click Count (0) -
LICENSE.txt
reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions.Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Mon Jul 23 14:02:28 GMT 2012 - 11.1K bytes - Click Count (0)