- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 876 for Nodes (0.1 sec)
-
src/cmd/compile/internal/walk/assign.go
// } // s // // l2 is allowed to be a string. func appendSlice(n *ir.CallExpr, init *ir.Nodes) ir.Node { walkAppendArgs(n, init) l1 := n.Args[0] l2 := n.Args[1] l2 = cheapExpr(l2, init) n.Args[1] = l2 var nodes ir.Nodes // var s []T s := typecheck.TempAt(base.Pos, ir.CurFunc, l1.Type()) nodes.Append(ir.NewAssignStmt(base.Pos, s, l1)) // s = l1 elemtype := s.Type().Elem()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:09:06 UTC 2024 - 20.3K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/noderesources/most_allocated_test.go
// Node2 Score: (50 + 50) / 2 = 50 name: "nothing scheduled, resources requested, differently sized nodes", requestedPod: st.MakePod(). Req(map[v1.ResourceName]string{"cpu": "1000", "memory": "2000"}). Req(map[v1.ResourceName]string{"cpu": "2000", "memory": "3000"}). Obj(), nodes: []*v1.Node{ st.MakeNode().Name("node1").Capacity(map[v1.ResourceName]string{"cpu": "4000", "memory": "10000"}).Obj(),
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Dec 15 03:30:06 UTC 2023 - 16K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/noderesources/balanced_allocation_test.go
pod: &v1.Pod{Spec: cpuAndMemory}, nodes: []*v1.Node{makeNode("node1", 4000, 10000, nil), makeNode("node2", 6000, 10000, nil)}, expectedList: []framework.NodeScore{{Name: "node1", Score: 87}, {Name: "node2", Score: framework.MaxNodeScore}}, name: "nothing scheduled, resources requested, differently sized nodes",
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Dec 15 03:30:06 UTC 2023 - 15.9K bytes - Viewed (0) -
pkg/scheduler/extender.go
) fromNodeName := make(map[string]*framework.NodeInfo) for _, n := range nodes { fromNodeName[n.Node().Name] = n } if h.filterVerb == "" { return nodes, extenderv1.FailedNodesMap{}, extenderv1.FailedNodesMap{}, nil } if h.nodeCacheCapable { nodeNameSlice := make([]string, 0, len(nodes)) for _, node := range nodes { nodeNameSlice = append(nodeNameSlice, node.Node().Name) }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Feb 26 19:07:19 UTC 2024 - 13.4K bytes - Viewed (0) -
cluster/log-dump/log-dump.sh
fi } # Collect names of nodes which didn't run logexporter successfully. # This function examines NODE_NAMES but not WINDOWS_NODE_NAMES since logexporter # does not run on Windows nodes. # # Note: This step is O(#nodes^2) as we check if each node is present in the list of succeeded nodes. # Making it linear would add code complexity without much benefit (as it just takes ~1s for 5k nodes). # Assumes: # NODE_NAMES # Sets:
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue May 21 21:15:57 UTC 2024 - 28.9K bytes - Viewed (0) -
.github/actions/people/app/main.py
author: Union[Author, None] = None class Replies(BaseModel): nodes: List[CommentsNode] class DiscussionsCommentsNode(CommentsNode): replies: Replies class Comments(BaseModel): nodes: List[CommentsNode] class DiscussionsComments(BaseModel): nodes: List[DiscussionsCommentsNode] class DiscussionsNode(BaseModel): number: int
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Tue Mar 26 17:38:21 UTC 2024 - 19.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractGraphTest.java
assertThat(graph.nodes()).contains(N1); } @Test public void addNode_existingNode() { assume().that(graphIsMutable()).isTrue(); addNode(N1); ImmutableSet<Integer> nodes = ImmutableSet.copyOf(graph.nodes()); assertThat(graphAsMutableGraph.addNode(N1)).isFalse(); assertThat(graph.nodes()).containsExactlyElementsIn(nodes); } @Test
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 16.6K bytes - Viewed (0) -
src/cmd/compile/internal/types2/initorder.go
// repeatedly, until there are no nodes left. // In a valid Go program, those nodes always have zero dependencies (after // removing all incoming dependencies), otherwise there are initialization // cycles. emitted := make(map[*declInfo]bool) for len(pq) > 0 { // get the next node n := heap.Pop(&pq).(*graphNode) if debug { fmt.Printf("\t%s (src pos %d) depends on %d nodes now\n",
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
// repeatedly, until there are no nodes left. // In a valid Go program, those nodes always have zero dependencies (after // removing all incoming dependencies), otherwise there are initialization // cycles. emitted := make(map[*declInfo]bool) for len(pq) > 0 { // get the next node n := heap.Pop(&pq).(*graphNode) if debug { fmt.Printf("\t%s (src pos %d) depends on %d nodes now\n",
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 9.9K bytes - Viewed (0) -
platforms/core-configuration/core-serialization-codecs/src/main/kotlin/org/gradle/internal/serialize/codecs/core/WorkNodeCodec.kt
doRead() } private suspend fun WriteContext.doWrite(work: ScheduledWork) { val nodes = work.scheduledNodes val nodeCount = nodes.size writeSmallInt(nodeCount) val scheduledNodeIds = HashMap<Node, Int>(nodeCount) // Not all entry nodes are always scheduled.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Sat Jun 08 11:29:30 UTC 2024 - 10.4K bytes - Viewed (0)