- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 681 for nodeIPs (0.12 sec)
-
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) -
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) -
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) -
tensorflow/c/experimental/grappler/grappler.cc
TF_SetStatus(status, TF_OK, ""); const std::unordered_set<std::string>& nodes = reinterpret_cast<const tensorflow::grappler::GrapplerItem*>(item) ->NodesToPreserve(); *num_values = nodes.size(); *storage_size = 0; for (const std::string& str : nodes) { *storage_size += str.size(); } }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Sep 06 19:12:29 UTC 2023 - 15K bytes - Viewed (0) -
pkg/scheduler/internal/cache/snapshot_test.go
pods []*v1.Pod nodes []*v1.Node expectedNodesInfos []*framework.NodeInfo expectedNumNodes int expectedPodsWithAffinity int expectedPodsWithAntiAffinity int expectedUsedPVCSet sets.Set[string] }{ { name: "no pods no nodes", pods: nil, nodes: nil, }, { name: "single pod single node",
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jul 05 08:00:25 UTC 2023 - 12K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/execution/plan/DefaultFinalizedExecutionPlan.java
if (!node.allDependenciesSuccessful()) { // Nodes whose dependencies have failed are added to the 'readyNodes' queue. // This is because of history, where all nodes were added to this queue regardless of their status. // Instead, the nodes should be cancelled when a dependent fails and never added to the queue. //
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Dec 28 21:49:39 UTC 2022 - 28.1K 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)