- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 109 for node_ (0.09 sec)
-
common-protos/k8s.io/api/storage/v1/generated.proto
// refer to a given node as "node1", but the storage system may refer to // the same node as "nodeA". When Kubernetes issues a command to the storage // system to attach a volume to a specific node, it can use this field to // refer to the node name using the ID that the storage system will // understand, e.g. "nodeA" instead of "node1". This field is required. optional string nodeID = 2;
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 24.7K bytes - Viewed (0) -
staging/src/k8s.io/api/storage/v1/generated.proto
// refer to a given node as "node1", but the storage system may refer to // the same node as "nodeA". When Kubernetes issues a command to the storage // system to attach a volume to a specific node, it can use this field to // refer to the node name using the ID that the storage system will // understand, e.g. "nodeA" instead of "node1". This field is required. optional string nodeID = 2;
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Mar 28 15:34:11 UTC 2024 - 24.8K bytes - Viewed (0) -
staging/src/k8s.io/api/storage/v1beta1/generated.proto
// refer to a given node as "node1", but the storage system may refer to // the same node as "nodeA". When Kubernetes issues a command to the storage // system to attach a volume to a specific node, it can use this field to // refer to the node name using the ID that the storage system will // understand, e.g. "nodeA" instead of "node1". This field is required. optional string nodeID = 2;
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Mar 28 15:34:11 UTC 2024 - 25K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
MutableGraph<N> subgraph = (nodes instanceof Collection) ? GraphBuilder.from(graph).expectedNodeCount(((Collection) nodes).size()).build() : GraphBuilder.from(graph).build(); for (N node : nodes) { subgraph.addNode(node); } for (N node : subgraph.nodes()) { for (N successorNode : graph.successors(node)) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.2K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
MutableGraph<N> subgraph = (nodes instanceof Collection) ? GraphBuilder.from(graph).expectedNodeCount(((Collection) nodes).size()).build() : GraphBuilder.from(graph).build(); for (N node : nodes) { subgraph.addNode(node); } for (N node : subgraph.nodes()) { for (N successorNode : graph.successors(node)) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.7K bytes - Viewed (0) -
pkg/kubelet/cm/cpumanager/cpu_assignment.go
// sockets contain a bigger number of CPUs (free and busy) than NUMA nodes, or equivalently that each // socket contains more than one NUMA node. // // If instead sockets are lower in the memory hierarchy than NUMA nodes, they are sorted as follows. // First, they are sorted by number of free CPUs in the NUMA nodes that contain them. Then, for each
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Jan 25 23:56:21 UTC 2024 - 36.3K bytes - Viewed (0) -
src/cmd/compile/internal/walk/assign.go
} return as } // walkAssignDotType walks an OAS2DOTTYPE node. func walkAssignDotType(n *ir.AssignListStmt, init *ir.Nodes) ir.Node { walkExprListSafe(n.Lhs, init) n.Rhs[0] = walkExpr(n.Rhs[0], init) return n } // walkAssignFunc walks an OAS2FUNC node. func walkAssignFunc(init *ir.Nodes, n *ir.AssignListStmt) ir.Node { init.Append(ir.TakeInit(n)...) r := n.Rhs[0]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:09:06 UTC 2024 - 20.3K bytes - Viewed (0) -
src/cmd/compile/internal/types2/initorder.go
isDependency() } // A graphNode represents a node in the object dependency graph. // Each node p in n.pred represents an edge p->n, and each node // s in n.succ represents an edge n->s; with a->b indicating that // a depends on b. type graphNode struct { obj dependency // object represented by this node pred, succ nodeSet // consumers and dependencies of this node (lazily initialized)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 28 22:06:51 UTC 2024 - 9.8K bytes - Viewed (0) -
src/go/types/initorder.go
isDependency() } // A graphNode represents a node in the object dependency graph. // Each node p in n.pred represents an edge p->n, and each node // s in n.succ represents an edge n->s; with a->b indicating that // a depends on b. type graphNode struct { obj dependency // object represented by this node pred, succ nodeSet // consumers and dependencies of this node (lazily initialized)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 9.9K bytes - Viewed (0) -
pkg/controller/volume/persistentvolume/provision_test.go
func(ctrl *PersistentVolumeController, reactor *pvtesting.VolumeReactor) { nodesIndexer := cache.NewIndexer(cache.MetaNamespaceKeyFunc, cache.Indexers{}) node := &v1.Node{ObjectMeta: metav1.ObjectMeta{Name: "node1"}} nodesIndexer.Add(node) ctrl.NodeLister = corelisters.NewNodeLister(nodesIndexer) }), }, { // volume provision for PVC that scheduled
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Apr 24 18:25:29 UTC 2024 - 35.3K bytes - Viewed (0)