- Sort Score
- Num 10 results
- Language All
Results 11 - 20 of 551 for netware (0.05 seconds)
-
src/main/java/jcifs/smb1/dcerpc/msrpc/MsrpcShareEnum.java
* * This class implements the Server Service (SRVSVC) ShareEnumAll operation * for enumerating network shares on a remote server. */ public class MsrpcShareEnum extends srvsvc.ShareEnumAll { class MsrpcShareInfo1 extends SmbShareInfo { MsrpcShareInfo1(final srvsvc.ShareInfo1 info1) { this.netName = info1.netname; this.type = info1.type; this.remark = info1.remark; } }
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 2.5K bytes - Click Count (0) -
src/main/java/jcifs/internal/smb1/net/NetShareEnumResponse.java
import org.slf4j.LoggerFactory; import jcifs.Configuration; import jcifs.internal.smb1.trans.SmbComTransactionResponse; import jcifs.internal.util.SMBUtil; /** * SMB1 NetShareEnum response message for enumerating network shares on a server. * This class handles the response data from a NetShareEnum RPC call, which returns * information about all available shares on the target server. */
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 4K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
public void validateUndirectedEdges() { for (Integer node : network.nodes()) { new EqualsTester() .addEqualityGroup( network.inEdges(node), network.outEdges(node), network.incidentEdges(node)) .testEquals(); new EqualsTester() .addEqualityGroup( network.predecessors(node), network.successors(node), network.adjacentNodes(node)) .testEquals();
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Sep 30 17:09:51 GMT 2025 - 18.6K bytes - Click Count (0) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
assume().that(network.allowsSelfLoops()).isTrue(); addEdge(N1, N1, E11); assertThat(network.incidentEdges(N1)).containsExactly(E11); } @Test public void incidentNodes_selfLoop() { assume().that(network.allowsSelfLoops()).isTrue(); addEdge(N1, N1, E11); assertThat(network.incidentNodes(E11).source()).isEqualTo(N1); assertThat(network.incidentNodes(E11).target()).isEqualTo(N1); }
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Sep 30 17:09:51 GMT 2025 - 21.3K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/graph/ImmutableNetworkTest.java
mutableNetwork.addEdge("A", "A", "AA"); mutableNetwork.addEdge("A", "B", "AB"); Network<String, String> network = ImmutableNetwork.copyOf(mutableNetwork); assertThat(network.edgesConnecting("A", "A")).containsExactly("AA"); assertThat(network.edgesConnecting("A", "B")).containsExactly("AB"); assertThat(network.edgesConnecting("B", "A")).isEmpty(); } @Test public void edgesConnecting_undirected() {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Sep 30 17:09:51 GMT 2025 - 5.4K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/graph/NetworkMutationTest.java
MutableNetwork<Integer, Object> network = networkBuilder.allowsParallelEdges(true).allowsSelfLoops(true).build(); assertThat(network.nodes()).isEmpty(); assertThat(network.edges()).isEmpty(); AbstractNetworkTest.validateNetwork(network); while (network.nodes().size() < NUM_NODES) { network.addNode(gen.nextInt(NODE_POOL_SIZE)); }
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 4.6K bytes - Click Count (0) -
guava-tests/test/com/google/common/graph/ElementOrderTest.java
addEdges(network); assertThat(network.edgeOrder()).isEqualTo(ElementOrder.insertion()); assertThat(network.edges()).containsExactly("i", "e", "p").inOrder(); assertThat(network.nodeOrder()).isEqualTo(ElementOrder.insertion()); // default } // The default ordering is INSERTION unless otherwise specified. @Test public void edgeOrder_default() {Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Mar 17 19:26:39 GMT 2026 - 7.9K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/graph/DefaultNetworkImplementationsTest.java
network.addEdge(N1, N1, E11); network.addEdge(N1, N1, E11_A); assertThat(network.edgesConnecting(N1, N1)).containsExactly(E11, E11_A); } private static class NetworkForTest<N, E> extends AbstractNetwork<N, E> { private final Network<N, E> network; NetworkForTest(Network<N, E> network) { this.network = network; }
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 7.4K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/Graphs.java
/** * Returns a view of {@code network} with the direction (if any) of every edge reversed. All other * properties remain intact, and further updates to {@code network} will be reflected in the view. */ public static <N, E> Network<N, E> transpose(Network<N, E> network) { if (!network.isDirected()) { return network; // the transpose of an undirected network is an identical network }Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 24.4K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http/RealInterceptorChain.kt
/** * A concrete interceptor chain that carries the entire interceptor chain: all application * interceptors, the OkHttp core, all network interceptors, and finally the network caller. * * If the chain is for an application interceptor then [exchange] must be null. Otherwise it is for * a network interceptor and [exchange] must be non-null. */ class RealInterceptorChain( internal val call: RealCall,
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Mar 10 21:47:20 GMT 2026 - 12.8K bytes - Click Count (0)