- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 433 for _nodes (0.09 sec)
-
common-protos/k8s.io/api/node/v1/generated.proto
repeated RuntimeClass items = 2; } // Scheduling specifies the scheduling constraints for nodes supporting a // RuntimeClass. message Scheduling { // nodeSelector lists labels that must be present on nodes that support this // RuntimeClass. Pods using this RuntimeClass can only be scheduled to a // node matched by this selector. The RuntimeClass nodeSelector is merged
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 4.4K bytes - Viewed (0) -
guava/src/com/google/common/graph/ValueGraph.java
int outDegree(N node); /** * Returns true if there is an edge that directly connects {@code nodeU} to {@code nodeV}. This is * equivalent to {@code nodes().contains(nodeU) && successors(nodeU).contains(nodeV)}. * * <p>In an undirected graph, this is equal to {@code hasEdgeConnecting(nodeV, nodeU)}. * * @since 23.0 */ @Override boolean hasEdgeConnecting(N nodeU, N nodeV); /**
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 10 15:41:27 UTC 2024 - 16K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractValueGraph.java
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Apr 17 13:59:28 UTC 2023 - 4.3K bytes - Viewed (0) -
common-protos/k8s.io/api/node/v1beta1/generated.proto
// https://git.k8s.io/enhancements/keps/sig-node/688-pod-overhead/README.md // +optional optional Overhead overhead = 3; // scheduling holds the scheduling constraints to ensure that pods running // with this RuntimeClass are scheduled to nodes that support it. // If scheduling is nil, this RuntimeClass is assumed to be supported by all // nodes. // +optional optional Scheduling scheduling = 4; }
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 4.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
int outDegree(N node); /** * Returns true if there is an edge that directly connects {@code nodeU} to {@code nodeV}. This is * equivalent to {@code nodes().contains(nodeU) && successors(nodeU).contains(nodeV)}. * * <p>In an undirected graph, this is equal to {@code hasEdgeConnecting(nodeV, nodeU)}. * * @since 23.0 */ @Override boolean hasEdgeConnecting(N nodeU, N nodeV); /**
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 10 15:41:27 UTC 2024 - 13.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graph.java
int outDegree(N node); /** * Returns true if there is an edge that directly connects {@code nodeU} to {@code nodeV}. This is * equivalent to {@code nodes().contains(nodeU) && successors(nodeU).contains(nodeV)}. * * <p>In an undirected graph, this is equal to {@code hasEdgeConnecting(nodeV, nodeU)}. * * @since 23.0 */ @Override boolean hasEdgeConnecting(N nodeU, N nodeV); /**
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 10 15:41:27 UTC 2024 - 13.7K bytes - Viewed (0) -
cmd/bucket-replication-stats.go
ReplicatedSize: totReplicatedSize, ReplicatedCount: totReplicatedCount, Failed: totFailed.toMetric(), } var qs ReplicationQueueStats for _, bs := range bucketStats { qs.Nodes = append(qs.Nodes, bs.QueueStats.Nodes...) } qs.Uptime = UTCNow().Unix() - globalBootTime.Unix() var ps ProxyMetric for _, bs := range bucketStats { ps.add(bs.ProxyStats) } bs = BucketStats{
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Aug 15 12:04:40 UTC 2024 - 13.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
assertThat(network.edgesConnecting(node, adjacentNode)) .containsExactlyElementsIn(network.edgesConnecting(adjacentNode, node)); } } } @Override @Test public void nodes_checkReturnedSetMutability() { Set<Integer> nodes = network.nodes(); assertThrows(UnsupportedOperationException.class, () -> nodes.add(N2)); addNode(N1);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Jul 02 18:21:29 UTC 2024 - 18.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
* equivalent to {@code nodes().contains(nodeU) && successors(nodeU).contains(nodeV)}, and to * {@code edgeConnectingOrNull(nodeU, nodeV) != null}. * * <p>In an undirected network, this is equal to {@code hasEdgeConnecting(nodeV, nodeU)}. * * @since 23.0 */ boolean hasEdgeConnecting(N nodeU, N nodeV); /**
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 10 15:41:27 UTC 2024 - 21.1K bytes - Viewed (0) -
docs/tuning/README.md
``` #### Step 2 - install tuned.conf as supported performance profile on all nodes ``` sudo mkdir -p /usr/lib/tuned/minio/ sudo mv tuned.conf /usr/lib/tuned/minio ``` #### Step 3 - to enable minio performance profile on all the nodes ``` sudo tuned-adm profile minio
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Jul 19 01:15:02 UTC 2024 - 644 bytes - Viewed (0)