- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 476 for hiding (0.04 sec)
-
CHANGELOG/CHANGELOG-1.27.md
- Fixing issue with Winkernel Proxier - IPV6 load balancer policies are missing when service is configured with ipFamilyPolicy: RequireDualStack ([#115503](https://github.com/kubernetes/kubernetes/pull/115503), [@princepereira](https://github.com/princepereira)) [SIG Network and Windows]
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Wed Jul 17 07:48:22 UTC 2024 - 466.3K bytes - Viewed (2) -
src/main/java/jcifs/internal/smb2/multichannel/Smb2ChannelCapabilities.java
/** * Channel binding is disabled */ public static final int CHANNEL_BINDING_DISABLED = 0; /** * Channel binding is preferred but not required */ public static final int CHANNEL_BINDING_PREFERRED = 1; /** * Channel binding is required */ public static final int CHANNEL_BINDING_REQUIRED = 2; /**
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 21 11:13:46 UTC 2025 - 2.4K bytes - Viewed (0) -
src/test/java/jcifs/dcerpc/DcerpcHandleTest.java
// When: Parsing the binding URL DcerpcBinding binding = DcerpcHandle.parseBinding(url); // Then: Should parse correctly assertNotNull(binding); assertEquals(expectedProto, binding.getProto()); assertEquals(expectedServer, binding.getServer()); assertEquals(expectedEndpoint, binding.getEndpoint()); }
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 15.3K bytes - Viewed (0) -
src/main/java/jcifs/dcerpc/DcerpcBind.java
} return null; } private DcerpcBinding binding; private int max_xmit, max_recv; /** * Construct bind message * */ public DcerpcBind() { } DcerpcBind(final DcerpcBinding binding, final DcerpcHandle handle) { this.binding = binding; this.max_xmit = handle.getMaxXmit(); this.max_recv = handle.getMaxRecv();
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 3.6K bytes - Viewed (0) -
src/main/java/jcifs/smb1/dcerpc/DcerpcBind.java
} return null; } DcerpcBinding binding; int max_xmit, max_recv; /** * Constructs a new DcerpcBind message. */ public DcerpcBind() { } DcerpcBind(final DcerpcBinding binding, final DcerpcHandle handle) { this.binding = binding; max_xmit = handle.max_xmit; max_recv = handle.max_recv; ptype = 11;
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 3.5K bytes - Viewed (0) -
src/main/java/jcifs/smb1/dcerpc/DcerpcHandle.java
} binding.setOption(key, val); key = null; } break; default: si = arr.length; } si++; } while (si < arr.length); if (binding == null || binding.endpoint == null) { throw new DcerpcException("Invalid binding URL: " + str); }
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 11.7K bytes - Viewed (0) -
src/main/java/jcifs/smb1/dcerpc/DcerpcPipeHandle.java
binding = DcerpcHandle.parseBinding(url); url = "smb1://" + binding.server + "/IPC$/" + binding.endpoint.substring(6); String params = "", server, address; server = (String) binding.getOption("server"); if (server != null) { params += "&server=" + server; } address = (String) binding.getOption("address"); if (server != null) {
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
/** * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting * and ending with the same node. * * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1). */ public static <N> boolean hasCycle(Graph<N> graph) { int numEdges = graph.edges().size();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 22.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
/** * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting * and ending with the same node. * * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1). */ public static <N> boolean hasCycle(Graph<N> graph) { int numEdges = graph.edges().size();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 23.3K bytes - Viewed (0) -
src/test/java/jcifs/internal/smb2/session/Smb2SessionSetupRequestTest.java
} @Test @DisplayName("Should handle session binding scenarios") void testSessionBindingScenarios() throws Exception { // Test both true and false session binding boolean[] bindingValues = { true, false }; for (boolean binding : bindingValues) { // Given Smb2SessionSetupRequest req =
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 21.2K bytes - Viewed (0)