Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 145 for networks (0.07 sec)

  1. guava/src/com/google/common/graph/Network.java

     * subtype of {@code Network} that provides methods for adding and removing nodes and edges. If you
     * do not need to mutate a network (e.g. if you write a method than runs a read-only algorithm on
     * the network), you should use the non-mutating {@link Network} interface, or an {@link
     * ImmutableNetwork}.
     *
     * <p>You can create an immutable copy of an existing {@code Network} using {@link
     * ImmutableNetwork#copyOf(Network)}:
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 22:03:02 UTC 2025
    - 22.5K bytes
    - Viewed (0)
  2. CHANGELOG.md

    **This release introduces fast fallback to better support mixed IPv4+IPv6 networks.** Fast fallback
    is what we're calling our implementation of Happy Eyeballs, [RFC 8305][rfc_8305]. With this
    feature OkHttp will attempt both IPv6 and IPv4 connections concurrently, keeping whichever connects
    first. Fast fallback gives IPv6 connections a 250 ms head start so IPv6 is preferred on networks
    where it's available.
    
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Mon Jul 07 19:32:33 UTC 2025
    - 31.6K bytes
    - Viewed (1)
  3. src/main/java/jcifs/internal/smb2/rdma/disni/DisniRdmaConnection.java

    import jcifs.internal.smb2.rdma.RdmaNegotiateResponse;
    
    /**
     * DiSNI RDMA connection implementation.
     *
     * This class would integrate with the DiSNI library to provide
     * high-performance RDMA operations over InfiniBand/RoCE networks.
     *
     * Note: This is a skeleton implementation. A real implementation would
     * require proper DiSNI integration with actual RDMA hardware.
     */
    public class DisniRdmaConnection extends RdmaConnection {
    
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 23 05:11:12 UTC 2025
    - 10.2K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/base/Ascii.java

       * Data Link Escape: A communication control character which will change the meaning of a limited
       * number of contiguously following characters. It is used exclusively to provide supplementary
       * controls in data communication networks.
       *
       * @since 8.0
       */
      public static final byte DLE = 16;
    
      /**
       * Device Control 1. Characters for the control of ancillary devices associated with data
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 21.7K bytes
    - Viewed (0)
  5. cmd/storage-rest-client.go

    	case strings.Contains(err.Error(), "server closed idle connection"):
    		return true
    	}
    
    	return false
    }
    
    // Converts network error to storageErr. This function is
    // written so that the storageAPI errors are consistent
    // across network disks.
    func toStorageErr(err error) error {
    	if err == nil {
    		return nil
    	}
    
    	if isNetworkError(err) {
    		return errDiskNotFound
    	}
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 08 02:38:41 UTC 2025
    - 30.4K bytes
    - Viewed (0)
  6. 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();
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 18.6K bytes
    - Viewed (0)
  7. android/guava-tests/test/com/google/common/graph/AbstractNetworkTest.java

            assertThat(network.incidentEdges(node).size() + selfLoopCount)
                .isEqualTo(network.inDegree(node) + network.outDegree(node));
            assertThat(network.inEdges(node)).hasSize(network.inDegree(node));
            assertThat(network.outEdges(node)).hasSize(network.outDegree(node));
          } else {
            assertThat(network.predecessors(node)).isEqualTo(network.adjacentNodes(node));
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 32.7K bytes
    - Viewed (0)
  8. 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);
      }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 21.3K bytes
    - Viewed (0)
  9. android/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);
      }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 20.9K bytes
    - Viewed (0)
  10. 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
        }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 22.7K bytes
    - Viewed (0)
Back to top