- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 1,706 for _nodes (0.12 sec)
-
subprojects/core/src/main/java/org/gradle/execution/plan/QueryableExecutionPlan.java
* An immutable snapshot of the set of scheduled nodes. */ interface ScheduledNodes { /** * Invokes the consumer with the list of scheduled nodes and the set of entry nodes. Entry nodes may not be a subset of scheduled nodes. * * @param visitor the consumer of nodes and entry nodes */ void visitNodes(BiConsumer<List<Node>, Set<Node>> visitor); }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Nov 23 19:05:29 UTC 2023 - 3K bytes - Viewed (0) -
pkg/test/loadbalancersim/mesh/mesh.go
NetworkLatencies map[RouteKey]time.Duration } type Instance struct { nodes Nodes clients []*Client s Settings networkQ *timer.Queue } func New(s Settings) *Instance { return &Instance{ s: s, networkQ: timer.NewQueue(), } } func (m *Instance) Nodes() Nodes { return m.nodes } func (m *Instance) Clients() []*Client { return m.clients }
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Jan 27 20:55:37 UTC 2022 - 2.3K bytes - Viewed (0) -
pkg/kubelet/cm/topologymanager/policy_best_effort_test.go
numaInfo := commonNUMAInfoFourNodes() policy := &bestEffortPolicy{numaInfo: numaInfo} tcases := commonPolicyMergeTestCases(numaInfo.Nodes) tcases = append(tcases, policy.mergeTestCases(numaInfo.Nodes)...) tcases = append(tcases, policy.mergeTestCasesNoPolicies(numaInfo.Nodes)...) testPolicyMerge(policy, tcases, t) } func TestPolicyBestEffortMergeClosestNUMA(t *testing.T) { numaInfo := commonNUMAInfoEightNodes()
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Nov 03 09:45:25 UTC 2022 - 2.1K bytes - Viewed (0) -
docs/ja/docs/advanced/additional-status-codes.md
Sebastián RamÃrez <******@****.***> 1652529599 -0500
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Sat May 14 11:59:59 UTC 2022 - 2.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EndpointPairIterator.java
* EndpointPair [N2, N1] - skip * EndpointPair [N2, N3] - return * Visited Nodes = {N1, N2} * EndpointPair [N3, N1] - skip * EndpointPair [N3, N2] - skip * Visited Nodes = {N1, N2, N3} * EndpointPair [N4, N4] - return * Visited Nodes = {N1, N2, N3, N4} * </pre> */ private static final class Undirected<N> extends EndpointPairIterator<N> {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jul 09 17:31:04 UTC 2021 - 5K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/noderesources/requested_to_capacity_ratio_test.go
pod *v1.Pod pods []*v1.Pod nodes []*v1.Node expectedScores framework.NodeScoreList name string }{ { // Node1 Score = Node2 Score = 0 as the incoming Pod doesn't request extended resource. pod: st.MakePod().Obj(), nodes: []*v1.Node{makeNode("node1", 4000, 10000*1024*1024, extendedResource2), makeNode("node2", 4000, 10000*1024*1024, extendedResource1)},
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Dec 15 03:30:06 UTC 2023 - 21.2K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/conflicts/DefaultCapabilitiesConflictHandler.java
final Set<NodeState> nodes = findNodesFor(capability); Collection<NodeState> implicitCapabilityProviders = candidate.getImplicitCapabilityProviders(); nodes.addAll(implicitCapabilityProviders); NodeState node = candidate.getNode(); if (nodes.add(node) && nodes.size() > 1) { // The registered nodes may contain nodes which are no longer selected.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jun 07 14:19:34 UTC 2024 - 12.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 30 20:12:45 UTC 2023 - 19.8K bytes - Viewed (0) -
guava/src/com/google/common/graph/Traverser.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 30 20:12:45 UTC 2023 - 19.8K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/MetadataGraph.java
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Wed Sep 06 11:28:54 UTC 2023 - 2K bytes - Viewed (0)