- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 20 for all_ones (0.22 sec)
-
pkg/scheduler/internal/cache/node_tree_test.go
nodesToAdd: allNodes[:1], expectedTree: map[string][]string{"": {"node-0"}}, }, { name: "same node specified twice", nodesToAdd: []*v1.Node{allNodes[0], allNodes[0]}, expectedTree: map[string][]string{"": {"node-0"}}, }, { name: "mix of nodes with and without proper labels", nodesToAdd: allNodes[:4], expectedTree: map[string][]string{
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jul 05 08:00:25 UTC 2023 - 13.1K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/interpodaffinity/filtering.go
return affinityCounts, antiAffinityCounts } affinityCountsList := make([]topologyToMatchedTermCount, len(allNodes)) antiAffinityCountsList := make([]topologyToMatchedTermCount, len(allNodes)) index := int32(-1) processNode := func(i int) { nodeInfo := allNodes[i] node := nodeInfo.Node() affinity := make(topologyToMatchedTermCount) antiAffinity := make(topologyToMatchedTermCount)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Jun 01 10:24:54 UTC 2023 - 14.6K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/interpodaffinity/scoring.go
// need to process nodes hosting pods with affinity. var allNodes []*framework.NodeInfo var err error if hasConstraints { allNodes, err = pl.sharedLister.NodeInfos().List() if err != nil { return framework.AsStatus(fmt.Errorf("failed to get all nodes from shared lister: %w", err)) } } else { allNodes, err = pl.sharedLister.NodeInfos().HavePodsWithAffinityList() if err != nil {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Dec 15 03:30:06 UTC 2023 - 10.5K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/podtopologyspread/filtering.go
return &preFilterState{}, nil } allNodes, err := pl.sharedLister.NodeInfos().List() if err != nil { return nil, fmt.Errorf("listing NodeInfos: %w", err) } s := preFilterState{ Constraints: constraints, TpKeyToCriticalPaths: make(map[string]*criticalPaths, len(constraints)), TpPairToMatchNum: make(map[topologyPair]int, sizeHeuristic(len(allNodes), constraints)), }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Feb 28 10:42:29 UTC 2024 - 12.4K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/podtopologyspread/scoring.go
ctx context.Context, cycleState *framework.CycleState, pod *v1.Pod, filteredNodes []*framework.NodeInfo, ) *framework.Status { allNodes, err := pl.sharedLister.NodeInfos().List() if err != nil { return framework.AsStatus(fmt.Errorf("getting all nodes: %w", err)) } if len(allNodes) == 0 { // No need to score. return framework.NewStatus(framework.Skip) } state := &preScoreState{
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Dec 15 03:30:06 UTC 2023 - 10.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/quantization/quantization_context.cc
} }); } std::vector<quantfork::QuantizeRegionOp> QuantizeContext::GetAllOps() { std::vector<quantfork::QuantizeRegionOp> all_ops; all_ops.reserve(128); func_.walk([&](quantfork::QuantizeRegionOp op) { all_ops.push_back(op); }); return all_ops; } KernelSpecs::Signature QuantizeContext::GetSignature( quantfork::QuantizeRegionOp op) { KernelSpecs::Signature signature;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Apr 08 01:38:03 UTC 2024 - 13.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/merge_control_flow.cc
llvm::SmallSetVector<Operation*, 4> GetAllOpsFromIf(TF::IfRegionOp if_op) { llvm::SmallSetVector<Operation*, 4> all_ops; all_ops.insert(if_op); for (Operation& op : if_op.getThenBranch().front()) { all_ops.insert(&op); } for (Operation& op : if_op.getElseBranch().front()) { all_ops.insert(&op); } return all_ops; } // Returns whether it is safe to merge `second_if` IfRegion into `first_if`
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Mar 17 07:31:01 UTC 2023 - 25.9K bytes - Viewed (0) -
src/internal/profile/profile.go
if len(p.SampleType) != len(ratios) { return fmt.Errorf("mismatched scale ratios, got %d, want %d", len(ratios), len(p.SampleType)) } allOnes := true for _, r := range ratios { if r != 1 { allOnes = false break } } if allOnes { return nil } for _, s := range p.Sample { for i, v := range s.Value { if ratios[i] != 1 { s.Value[i] = int64(float64(v) * ratios[i])
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 08 17:57:40 UTC 2024 - 13.4K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/profile/profile.go
if len(p.SampleType) != len(ratios) { return fmt.Errorf("mismatched scale ratios, got %d, want %d", len(ratios), len(p.SampleType)) } allOnes := true for _, r := range ratios { if r != 1 { allOnes = false break } } if allOnes { return nil } fillIdx := 0 for _, s := range p.Sample { keepSample := false for i, v := range s.Value { if ratios[i] != 1 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 22.3K bytes - Viewed (0) -
pkg/scheduler/framework/interface.go
} func (p *PreFilterResult) AllNodes() bool { return p == nil || p.NodeNames == nil } func (p *PreFilterResult) Merge(in *PreFilterResult) *PreFilterResult { if p.AllNodes() && in.AllNodes() { return nil } r := PreFilterResult{} if p.AllNodes() { r.NodeNames = in.NodeNames.Clone() return &r } if in.AllNodes() { r.NodeNames = p.NodeNames.Clone() return &r
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri May 31 15:52:16 UTC 2024 - 35.4K bytes - Viewed (0)