- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 390 for nodeIPs (0.1 sec)
-
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) -
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) -
.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) -
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) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
public abstract class AbstractNetwork<N, E> implements Network<N, E> { @Override public Graph<N> asGraph() { return new AbstractGraph<N>() { @Override public Set<N> nodes() { return AbstractNetwork.this.nodes(); } @Override public Set<EndpointPair<N>> edges() { if (allowsParallelEdges()) { return super.edges(); // Defer to AbstractGraph implementation. }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Mar 13 18:17:09 UTC 2024 - 10.1K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractNetwork.java
public abstract class AbstractNetwork<N, E> implements Network<N, E> { @Override public Graph<N> asGraph() { return new AbstractGraph<N>() { @Override public Set<N> nodes() { return AbstractNetwork.this.nodes(); } @Override public Set<EndpointPair<N>> edges() { if (allowsParallelEdges()) { return super.edges(); // Defer to AbstractGraph implementation. }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Mar 13 18:17:09 UTC 2024 - 10.4K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/imagelocality/image_locality_test.go
// Score: 100 * (250M/2 - 23M)/(1000M * 2 - 23M) = 5 pod: &v1.Pod{Spec: test40250}, nodes: []*v1.Node{makeImageNode("node1", node403002000), makeImageNode("node2", node25010)}, expectedList: []framework.NodeScore{{Name: "node1", Score: 0}, {Name: "node2", Score: 5}}, name: "two images spread on two nodes, prefer the larger image one", }, { // Pod: gcr.io/40 gcr.io/300 // Node1
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Feb 19 06:17:57 UTC 2024 - 10.3K bytes - Viewed (0) -
plugin/pkg/admission/noderestriction/admission.go
} // only allow nodes to create mirror pods if _, isMirrorPod := pod.Annotations[api.MirrorPodAnnotationKey]; !isMirrorPod { return admission.NewForbidden(a, fmt.Errorf("pod does not have %q annotation, node %q can only create mirror pods", api.MirrorPodAnnotationKey, nodeName)) } // only allow nodes to create a pod bound to itself if pod.Spec.NodeName != nodeName {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Mar 07 21:22:55 UTC 2024 - 23.6K bytes - Viewed (0) -
pkg/kubelet/cm/devicemanager/manager.go
return false } // If one or the other of nodes[i] or nodes[j] is the fake NUMA node -1 (they can't both be) if nodes[i] == nodeWithoutTopology { return false } if nodes[j] == nodeWithoutTopology { return true } // Otherwise both nodes[i] and nodes[j] are real NUMA nodes that are not in the 'hint's' affinity list. return perNodeDevices[nodes[i]].Len() < perNodeDevices[nodes[j]].Len()
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Apr 15 12:01:56 UTC 2024 - 43K bytes - Viewed (0)