- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 681 for nodeIPs (0.13 sec)
-
pkg/scheduler/testing/framework/fake_extender.go
func ErrorPrioritizerExtender(pod *v1.Pod, nodes []*framework.NodeInfo) (*framework.NodeScoreList, error) { return &framework.NodeScoreList{}, fmt.Errorf("some error") } // Node1PrioritizerExtender implements PriorityFunc function to give score 10 // if the given node's name is "node1"; otherwise score 1. func Node1PrioritizerExtender(pod *v1.Pod, nodes []*framework.NodeInfo) (*framework.NodeScoreList, error) {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Feb 26 19:07:19 UTC 2024 - 13.9K bytes - Viewed (0) -
pkg/controller/volume/attachdetach/cache/actual_state_of_world.go
if !volumeExists || len(volumeObj.nodesAttachedTo) == 0 { return []types.NodeName{} } nodes := []types.NodeName{} for nodeName, nodesAttached := range volumeObj.nodesAttachedTo { if nodesAttached.attachedConfirmed { nodes = append(nodes, nodeName) } } return nodes } func (asw *actualStateOfWorld) GetVolumesToReportAttached(logger klog.Logger) map[types.NodeName][]v1.AttachedVolume {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Apr 11 07:35:17 UTC 2024 - 28.7K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/ast/astutil/enclosing.go
var visit func(node ast.Node) bool visit = func(node ast.Node) bool { path = append(path, node) nodePos := node.Pos() nodeEnd := node.End() // fmt.Printf("visit(%T, %d, %d)\n", node, nodePos, nodeEnd) // debugging // Intersect [start, end) with interval of node. if start < nodePos { start = nodePos } if end > nodeEnd { end = nodeEnd } // Find sole child that contains [start, end).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Dec 18 21:28:13 UTC 2023 - 15.9K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/execution/plan/DefaultExecutionPlan.java
SortedSet<Node> nodes = new TreeSet<>(NodeComparator.INSTANCE); for (Task task : tasks) { nodes.add(taskNodeFactory.getOrCreateNode(task)); } doAddEntryNodes(nodes, ordinal); } public void addEntryNodes(Collection<? extends Node> nodes) { addEntryNodes(nodes, order++); }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Dec 11 13:37:56 UTC 2023 - 13.6K bytes - Viewed (0) -
tensorflow/cc/framework/gradients.cc
} } // BFS from nodes in 'inputs_' along out edges for the entire graph. Internal // output nodes are recorded during the traversal. All nodes that are output // nodes but not internal output nodes are considered the frontier of the // output nodes, and thus our stop backprop nodes. while (!queue.empty()) { std::pair<Node*, Node*> p = queue.front();
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sat Apr 13 05:57:22 UTC 2024 - 22K bytes - Viewed (0) -
cluster/gce/config-default.sh
export E2E_STORAGE_TEST_ENVIRONMENT="${KUBE_E2E_STORAGE_TEST_ENVIRONMENT:-false}" # Evict pods whenever compute resource availability on the nodes gets below a threshold. EVICTION_HARD="${EVICTION_HARD:-memory.available<250Mi,nodefs.available<10%,nodefs.inodesFree<5%}" # Optional: custom scheduling algorithm SCHEDULING_ALGORITHM_PROVIDER="${SCHEDULING_ALGORITHM_PROVIDER:-}"
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat Mar 16 20:16:32 UTC 2024 - 26.9K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/podtopologyspread/scoring.go
// Since <size> is at least 1 (all nodes that passed the Filters are in the // same topology), and k8s supports 5k nodes, the result is in the interval // <1.09, 8.52>. // // Note: <size> could also be zero when no nodes have the required topologies, // however we don't care about topology weight in this case as we return a 0 // score for all nodes. func topologyNormalizingWeight(size int) float64 {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Dec 15 03:30:06 UTC 2023 - 10.1K bytes - Viewed (0) -
src/strings/replace.go
// "bcbc", "x" and "xy" could have eight nodes: // // n0 - // n1 a- // n2 .x+ // n3 .y+ // n4 b- // n5 .cbc+ // n6 x+ // n7 .y+ // // n0 is the root node, and its children are n1, n4 and n6; n1's children are // n2 and n3; n4's child is n5; n6's child is n7. Nodes n0, n1 and n4 (marked // with a trailing "-") are partial keys, and nodes n2, n3, n5, n6 and n7
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Oct 13 17:10:31 UTC 2023 - 14.5K bytes - Viewed (0) -
src/internal/profile/graph.go
} nodes := make(Nodes, len(lines)) for ln := range lines { nodes[ln] = nm.findOrInsertLine(l, lines[ln], o) } locations.add(l.ID, nodes) } return nm.nodes(), locations } func (nm NodeMap) nodes() Nodes { nodes := make(Nodes, 0, len(nm)) for _, n := range nm { nodes = append(nodes, n) } return nodes }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 05 20:59:15 UTC 2024 - 13.1K bytes - Viewed (0) -
tensorflow/compiler/jit/shape_inference.cc
} } // Sometimes we have VariableShape nodes in while loop (after Enter nodes). // They won't be constant-folded because TensorFlow constant folding does // not handle Enter nodes (and thus does not handle any nodes after Enter // nodes). We try to replace such VariableShape nodes with Const nodes here. if (n->type_string() == "VariableShape") {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri May 31 00:41:19 UTC 2024 - 13K bytes - Viewed (0)