- Sort Score
- Result 10 results
- Languages All
Results 6831 - 6840 of 7,200 for RETURN (0.04 sec)
-
src/test/java/jcifs/internal/smb2/lease/Smb2LeaseKeyTest.java
Smb2LeaseKey key2 = new Smb2LeaseKey(); assertNotEquals(key1, key2); assertFalse(Arrays.equals(key1.getKey(), key2.getKey())); } @Test @DisplayName("Should return defensive copy of key") void testDefensiveCopy() { byte[] originalBytes = new byte[] { 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F, 0x10 };
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 21 00:16:17 UTC 2025 - 6K bytes - Viewed (0) -
src/test/java/jcifs/internal/smb2/multichannel/ChannelLoadBalancerTest.java
when(mockChannelManager.getHealthyChannels()).thenReturn(Arrays.asList(channel1, channel2)); // Multiple calls with same file ID should return same channel ChannelInfo first = loadBalancer.selectChannel(readRequest); ChannelInfo second = loadBalancer.selectChannel(readRequest); assertEquals(first, second); } @TestRegistered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sat Aug 23 05:11:12 UTC 2025 - 7.7K bytes - Viewed (0) -
okhttp-tls/src/main/kotlin/okhttp3/tls/internal/der/DerWriter.kt
* longer usable by the current type's members. */ fun <T> withTypeHint(block: () -> T): T { typeHintStack.add(null) try { return block() } finally { typeHintStack.removeAt(typeHintStack.size - 1) } } private fun sink(): BufferedSink = stack[stack.size - 1] fun writeBoolean(b: Boolean) {
Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Wed Mar 19 19:25:20 UTC 2025 - 5.7K bytes - Viewed (0) -
cmd/xl-storage_test.go
} } } func newLocalXLStorage(path string) (*xlStorage, error) { return newLocalXLStorageWithDiskIdx(path, 0) } // Initialize a new storage disk. func newLocalXLStorageWithDiskIdx(path string, diskIdx int) (*xlStorage, error) { u := url.URL{Path: path} return newXLStorage(Endpoint{ URL: &u, IsLocal: true, PoolIdx: 0, SetIdx: 0, DiskIdx: diskIdx,
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 66K bytes - Viewed (0) -
impl/maven-cli/src/main/java/org/apache/maven/cling/invoker/LookupContext.java
eventSpyDispatcher = null; lookup = null; containerCapsule = null; } } } public Options options() { return options; }Registered: Sun Dec 28 03:35:09 UTC 2025 - Last Modified: Wed Jun 11 13:14:09 UTC 2025 - 5.7K bytes - Viewed (0) -
android/guava-testlib/test/com/google/common/testing/AbstractPackageSanityTestsTest.java
@SuppressWarnings("unused") // accessed reflectively public void testPublic() {} } private List<Class<?>> findClassesToTest( Iterable<? extends Class<?>> classes, String... explicitTestNames) { return sanityTests.findClassesToTest(classes, Arrays.asList(explicitTestNames)); }Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sat Dec 28 02:48:50 UTC 2024 - 5.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/FuturesGetCheckedInputs.java
String message, String a1, String a2, String a3, String a4, String a5, String a6) { super(message); } public Throwable getAntecedent() { return antecedent; } } @SuppressWarnings("unused") // we're testing that they're not used public static final class ExceptionWithSomePrivateConstructors extends Exception {Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 6.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/PredecessorsFunction.java
* * {@snippet : * someGraphAlgorithm(startNode, MyNode::getParents); * } * * <p>If you have some other mechanism for returning the predecessors of a node, or one that doesn't * return a {@code Iterable<? extends N>}, then you can use a lambda to perform a more general * transformation: * * {@snippet : * someGraphAlgorithm(startNode, node -> ImmutableList.of(node.mother(), node.father())); * } *Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
* * {@snippet : * someGraphAlgorithm(startNode, MyNode::getChildren); * } * * <p>If you have some other mechanism for returning the successors of a node, or one that doesn't * return an {@code Iterable<? extends N>}, then you can use a lambda to perform a more general * transformation: * * {@snippet : * someGraphAlgorithm(startNode, node -> ImmutableList.of(node.leftChild(), node.rightChild())); * }Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 4.2K bytes - Viewed (0) -
tests/test_dependency_yield_scope_websockets.py
global_state = global_context.get() global_state["named_func_session_closed"] = True def get_named_regular_func_session(session: SessionFuncDep) -> Any: named_session = NamedSession(name="named") return named_session, session BrokenSessionsDep = Annotated[ tuple[NamedSession, Session], Depends(get_named_func_session) ] NamedSessionsFuncDep = Annotated[
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Wed Dec 17 21:25:59 UTC 2025 - 6K bytes - Viewed (0)