karmada-io
/
karmada
mirror of https://github.com/karmada-io/karmada.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

chore:clean up 

Signed-off-by: qinguoyi <1532979219@qq.com>
This commit is contained in:
qinguoyi 2024-08-08 10:52:23 +08:00
parent 2db9dc4811
commit df681d0861
1 changed files with 6 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
pkg/scheduler/core/spreadconstraint/select_groups.go
View File

@ -161,18 +161,6 @@ func findFeasiblePaths(groups []*GroupInfo, minConstraint, maxConstraint, target
rootPath := new(dfsPath) rootPath := new(dfsPath)
var dfsFunc func(int, int) var dfsFunc func(int, int)
dfsFunc = func(sum, begin int) { dfsFunc = func(sum, begin int) {
// directly check the sum
if len(groups) == minConstraint {
for _, group := range groups {
sum += group.value
rootPath.enqueue(group)
}
if sum >= target {
paths = append(paths, rootPath.next())
}
return
}
if sum >= target && rootPath.length() >= minConstraint && rootPath.length() <= maxConstraint { if sum >= target && rootPath.length() >= minConstraint && rootPath.length() <= maxConstraint {
paths = append(paths, rootPath.next()) paths = append(paths, rootPath.next())
return return
@ -187,6 +175,12 @@ func findFeasiblePaths(groups []*GroupInfo, minConstraint, maxConstraint, target
sum += groups[i].value sum += groups[i].value
rootPath.enqueue(groups[i]) rootPath.enqueue(groups[i])
dfsFunc(sum, i+1) dfsFunc(sum, i+1)
// stop backtracking when we have to traverse all groups to satisfy the minimum constraint.
if len(groups) == minConstraint {
break
}
sum -= groups[i].value sum -= groups[i].value
rootPath.popLast() rootPath.popLast()
} }