Search Options

Results per page
Sort
Preferred Languages
Advance

Results 161 - 170 of 3,103 for node (0.02 sec)

  1. 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)
  2. docs/metrics/prometheus/alerts.md

            "instance": "localhost:9000",
            "job": "minio-job-node",
            "pool": "0",
            "server": "127.0.0.1:9000",
            "set": "0",
            "severity": "critical"
          },
          "annotations": {
            "description": "MinIO instance 127.0.0.1:9000 of job minio-job has tolerance <=0 for more than 5 minutes.",
            "summary": "Instance 127.0.0.1:9000 unable to tolerate node failures"
          },
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Wed Apr 23 15:13:23 UTC 2025
    - 4.4K bytes
    - Viewed (0)
  3. cmd/endpoint.go

    				node.Pools = append(node.Pools, ep.PoolIdx)
    			}
    			nodesMap[ep.Host] = node
    		}
    	}
    	nodes = make([]Node, 0, len(nodesMap))
    	for _, v := range nodesMap {
    		nodes = append(nodes, v)
    	}
    	sort.Slice(nodes, func(i, j int) bool {
    		return nodes[i].Host < nodes[j].Host
    	})
    	return
    }
    
    // GetPoolIdx return pool index
    func (l EndpointServerPools) GetPoolIdx(pool string) int {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Sun Mar 30 00:56:02 UTC 2025
    - 34.4K bytes
    - Viewed (0)
  4. src/main/java/jcifs/smb1/smb1/Trans2GetDfsReferralResponse.java

                    if (nodeOffset > 0) {
                        node = readString(buffer, start + nodeOffset, len, (flags2 & FLAGS2_UNICODE) != 0);
                    }
                } else if (version == 1) {
                    node = readString(buffer, bufferIndex, len, (flags2 & FLAGS2_UNICODE) != 0);
                }
    
                return size;
            }
    
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 07:14:38 UTC 2025
    - 5.2K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/collect/CompactLinkedHashSet.java

      /**
       * Pointer to the predecessor of an entry in insertion order. ENDPOINT indicates a node is the
       * first node in insertion order; all values at indices ≥ {@link #size()} are UNSET.
       */
      private transient int @Nullable [] predecessor;
    
      /**
       * Pointer to the successor of an entry in insertion order. ENDPOINT indicates a node is the last
       * node in insertion order; all values at indices ≥ {@link #size()} are UNSET.
       */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed Aug 06 14:59:07 UTC 2025
    - 9.4K bytes
    - Viewed (0)
  6. guava/src/com/google/thirdparty/publicsuffix/PublicSuffixType.java

      /** Returns a PublicSuffixType of the right type according to the given code */
      static PublicSuffixType fromCode(char code) {
        for (PublicSuffixType value : values()) {
          if (value.getInnerNodeCode() == code || value.getLeafNodeCode() == code) {
            return value;
          }
        }
        throw new IllegalArgumentException("No enum corresponding to given code: " + code);
      }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 10 15:48:57 UTC 2020
    - 2K bytes
    - Viewed (0)
  7. android/guava-tests/test/com/google/common/graph/NetworkMutationTest.java

          AbstractNetworkTest.validateNetwork(network);
    
          Collections.shuffle(nodeList, gen);
          for (Integer node : nodeList) {
            assertThat(network.addNode(node)).isTrue();
          }
          Collections.shuffle(edgeList, gen);
          for (Object edge : edgeList) {
            assertThat(
                    network.addEdge(
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 4.6K bytes
    - Viewed (0)
  8. guava-tests/test/com/google/common/graph/GraphMutationTest.java

          AbstractGraphTest.validateGraph(graph);
    
          Collections.shuffle(nodeList, gen);
          for (Integer node : nodeList) {
            assertThat(graph.addNode(node)).isTrue();
          }
          Collections.shuffle(edgeList, gen);
          for (EndpointPair<Integer> edge : edgeList) {
            assertThat(graph.putEdge(edge.nodeU(), edge.nodeV())).isTrue();
          }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 4.2K bytes
    - Viewed (0)
  9. cmd/admin-handlers_test.go

    	defer cancel()
    
    	adminTestBed, err := prepareAdminErasureTestBed(ctx)
    	if err != nil {
    		t.Fatal("Failed to initialize a single node Erasure backend for admin handler tests.", err)
    	}
    	defer adminTestBed.TearDown()
    
    	// Initialize admin peers to make admin RPC calls. Note: In a
    	// single node setup, this degenerates to a simple function
    	// call under the hood.
    	globalMinioAddr = "127.0.0.1:9000"
    
    	var wg sync.WaitGroup
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 13.9K bytes
    - Viewed (0)
  10. cmd/endpoint-ellipses.go

    		var eps []string
    
    		for i := 0; ; i++ {
    			for _, node := range endpointsList {
    				if node.nodeName == "" {
    					singleNode = true
    				}
    
    				if len(node.disks) <= i {
    					stopping = true
    					continue
    				}
    				if stopping {
    					return layout, errors.New("number of disks per node does not match")
    				}
    				eps = append(eps, node.disks[i])
    			}
    			if stopping {
    				break
    			}
    		}
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 14.6K bytes
    - Viewed (0)
Back to top