Search Options

Results per page
Sort
Preferred Languages
Advance

Results 171 - 180 of 500 for node3 (0.87 sec)

  1. compat/maven-resolver-provider/src/test/java/org/apache/maven/repository/internal/RepositorySystemTest.java

            CollectResult collectResult = system.collectDependencies(session, collectRequest);
    
            List<DependencyNode> nodes = collectResult.getRoot().getChildren();
            assertEquals(2, nodes.size());
            checkUtSimpleArtifactDependencies(
                    nodes.get(0).getDependency(), nodes.get(1).getDependency());
        }
    
        @Test
        void testResolveArtifact() throws Exception {
    Registered: Sun Dec 28 03:35:09 UTC 2025
    - Last Modified: Wed Sep 17 10:01:14 UTC 2025
    - 9.5K bytes
    - Viewed (0)
  2. CHANGELOG/CHANGELOG-1.14.md

    ### Node Binaries
    
    filename | sha512 hash
    -------- | -----------
    [kubernetes-node-linux-amd64.tar.gz](https://dl.k8s.io/v1.14.10/kubernetes-node-linux-amd64.tar.gz) | `3f509a406e2c1c889ad447d37f9f34043d61f7e60f14dad2c6a94980283381695e99d058b6a783423d4c5e742d1d6c0c0e16b049dc2e49b6f203bce7c97da025`
    Registered: Fri Dec 26 09:05:12 UTC 2025
    - Last Modified: Mon Jun 14 22:06:39 UTC 2021
    - 271.5K bytes
    - Viewed (0)
  3. docs/distributed/DESIGN.md

    sets, which is *16* 64 = 1024* drives in total.
    
    - *If total number of nodes are of odd number then GCD algorithm provides affinity towards odd number erasure sets to provide for uniform distribution across nodes*. This is to ensure that same number of drives are pariticipating in any erasure set. For example if you have 2 nodes with 180 drives then GCD is 15 but this would lead to uneven distribution, one of the nodes would participate more drives. To avoid this the affinity is given towards...
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Wed Feb 26 09:25:50 UTC 2025
    - 8K bytes
    - Viewed (2)
  4. guava/src/com/google/common/graph/UndirectedGraphConnections.java

      }
    
      @Override
      public @Nullable V value(N node) {
        return adjacentNodeValues.get(node);
      }
    
      @Override
      public void removePredecessor(N node) {
        @SuppressWarnings("unused")
        V unused = removeSuccessor(node);
      }
    
      @Override
      public @Nullable V removeSuccessor(N node) {
        return adjacentNodeValues.remove(node);
      }
    
      @Override
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 3.3K bytes
    - Viewed (0)
  5. helm-releases/minio-3.0.0.tgz

    If you'd rather use `emptyDir`, disable PersistentVolumeClai by: ```bash helm install --set persistence.enabled=false minio/minio ``` > *"An emptyDir volume is first created when a Pod is assigned to a Node, and exists as long as that Pod is running on that node. When a Pod is removed from a node for any reason, the data in the emptyDir is deleted forever."* Existing PersistentVolumeClai ---------- If a Persistent Volume Claim already exists, specify it during installation. 1. Create the PersistentVolume...
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Thu Sep 02 01:47:43 UTC 2021
    - 13.8K bytes
    - Viewed (0)
  6. helm-releases/minio-3.1.3.tgz

    If you'd rather use `emptyDir`, disable PersistentVolumeClai by: ```bash helm install --set persistence.enabled=false minio/minio ``` > *"An emptyDir volume is first created when a Pod is assigned to a Node, and exists as long as that Pod is running on that node. When a Pod is removed from a node for any reason, the data in the emptyDir is deleted forever."* Existing PersistentVolumeClai ---------- If a Persistent Volume Claim already exists, specify it during installation. 1. Create the PersistentVolume...
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sat Sep 18 18:09:59 UTC 2021
    - 14.4K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/graph/UndirectedMultiNetworkConnections.java

      public N removeOutEdge(E edge) {
        N node = super.removeOutEdge(edge);
        Multiset<N> adjacentNodes = getReference(adjacentNodesReference);
        if (adjacentNodes != null) {
          checkState(adjacentNodes.remove(node));
        }
        return node;
      }
    
      @Override
      public void addInEdge(E edge, N node, boolean isSelfLoop) {
        if (!isSelfLoop) {
          addOutEdge(edge, node);
        }
      }
    
      @Override
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 3.7K bytes
    - Viewed (0)
  8. cmd/metrics-v3-system-network.go

    		"Average dial time of internode TCP calls in nanoseconds")
    	internodeSentBytesTotalMD = NewCounterMD(internodeSentBytesTotal,
    		"Total number of bytes sent to other peer nodes")
    	internodeRecvBytesTotalMD = NewCounterMD(internodeRecvBytesTotal,
    		"Total number of bytes received from other peer nodes")
    )
    
    // loadNetworkInternodeMetrics - reads internode network metrics.
    //
    // This is a `MetricsLoaderFn`.
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Mar 10 09:15:15 UTC 2024
    - 2.4K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/graph/UndirectedGraphConnections.java

      }
    
      @Override
      public @Nullable V value(N node) {
        return adjacentNodeValues.get(node);
      }
    
      @Override
      public void removePredecessor(N node) {
        @SuppressWarnings("unused")
        V unused = removeSuccessor(node);
      }
    
      @Override
      public @Nullable V removeSuccessor(N node) {
        return adjacentNodeValues.remove(node);
      }
    
      @Override
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 3.3K bytes
    - Viewed (0)
  10. guava/src/com/google/common/graph/AbstractDirectedNetworkConnections.java

     *
     * @author James Sexton
     * @param <N> Node parameter type
     * @param <E> Edge parameter type
     */
    abstract class AbstractDirectedNetworkConnections<N, E> implements NetworkConnections<N, E> {
      /** Keys are edges incoming to the origin node, values are the source node. */
      final Map<E, N> inEdgeMap;
    
      /** Keys are edges outgoing from the origin node, values are the target node. */
      final Map<E, N> outEdgeMap;
    
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 4.5K bytes
    - Viewed (0)
Back to top