- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 441 for networks (0.11 seconds)
-
src/main/java/jcifs/internal/smb2/rdma/disni/DisniRdmaProvider.java
import jcifs.internal.smb2.rdma.RdmaProvider; /** * DiSNI RDMA provider for InfiniBand/RoCE networks. * * This provider uses the DiSNI (Direct Storage and Networking Interface) * library to provide high-performance RDMA operations over InfiniBand * and RoCE (RDMA over Converged Ethernet) networks. */ public class DisniRdmaProvider implements RdmaProvider { /**
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sun Aug 24 00:12:28 GMT 2025 - 5.2K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/UndirectedNetworkConnections.java
import com.google.common.collect.ImmutableBiMap; import java.util.Collections; import java.util.Map; import java.util.Set; /** * An implementation of {@link NetworkConnections} for undirected networks. * * @author James Sexton * @param <N> Node parameter type * @param <E> Edge parameter type */ final class UndirectedNetworkConnections<N, E> extends AbstractUndirectedNetworkConnections<N, E> {Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sat Dec 21 03:10:51 GMT 2024 - 1.9K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/EdgesConnecting.java
import org.jspecify.annotations.Nullable; /** * A class to represent the set of edges connecting an (implicit) origin node to a target node. * * <p>The {@link #nodeToOutEdge} map means this class only works on networks without parallel edges. * See {@link MultiEdgesConnecting} for a class that works with parallel edges. * * @author James Sexton * @param <E> Edge parameter type */
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Aug 11 19:31:30 GMT 2025 - 2.1K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/UndirectedMultiNetworkConnections.java
import java.util.Collections; import java.util.HashMap; import java.util.Map; import java.util.Set; import org.jspecify.annotations.Nullable; /** * An implementation of {@link NetworkConnections} for undirected networks with parallel edges. * * @author James Sexton * @param <N> Node parameter type * @param <E> Edge parameter type */ final class UndirectedMultiNetworkConnections<N, E>Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Dec 22 03:38:46 GMT 2024 - 3.7K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/Callback.kt
*/ package okhttp3 import okio.IOException interface Callback { /** * Called when the request could not be executed due to cancellation, a connectivity problem or * timeout. Because networks can fail during an exchange, it is possible that the remote server * accepted the request before the failure. */ fun onFailure( call: Call, e: IOException, ) /**Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Fri Dec 27 13:39:56 GMT 2024 - 1.6K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java
.allowsParallelEdges(!network.allowsParallelEdges()) .allowsSelfLoops(!network.allowsSelfLoops()) .build(); g2.addEdge(N1, N2, E12); assertThat(network).isEqualTo(g2); } // Node/edge sets and node/edge connections are the same, but edge order differs. // (In this case the networks are considered equivalent; the edge add orderings are irrelevant.) @Test
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 5.9K bytes - Click Count (0) -
guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java
.allowsParallelEdges(!network.allowsParallelEdges()) .allowsSelfLoops(!network.allowsSelfLoops()) .build(); g2.addEdge(N1, N2, E12); assertThat(network).isEqualTo(g2); } // Node/edge sets and node/edge connections are the same, but edge order differs. // (In this case the networks are considered equivalent; the edge add orderings are irrelevant.) @Test
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 5.9K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/DirectedNetworkConnections.java
import com.google.common.collect.ImmutableBiMap; import java.util.Collections; import java.util.Map; import java.util.Set; /** * An implementation of {@link NetworkConnections} for directed networks. * * @author James Sexton * @param <N> Node parameter type * @param <E> Edge parameter type */ final class DirectedNetworkConnections<N, E> extends AbstractDirectedNetworkConnections<N, E> {Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sat Dec 21 03:10:51 GMT 2024 - 2.1K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/MultiEdgesConnecting.java
import org.jspecify.annotations.Nullable; /** * A class to represent the set of edges connecting an (implicit) origin node to a target node. * * <p>The {@link #outEdgeToNode} map allows this class to work on networks with parallel edges. See * {@link EdgesConnecting} for a class that is more efficient but forbids parallel edges. * * @author James Sexton * @param <E> Edge parameter type */
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Dec 22 03:38:46 GMT 2024 - 2.2K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/NetworkConnections.java
Set<E> incidentEdges(); Set<E> inEdges(); Set<E> outEdges(); /** * Returns the set of edges connecting the origin node to {@code node}. For networks without * parallel edges, this set cannot be of size greater than one. */ Set<E> edgesConnecting(N node); /** * Returns the node that is adjacent to the origin node along {@code edge}. *
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Dec 22 03:38:46 GMT 2024 - 2.3K bytes - Click Count (0)