go.mod: Bump go version to 1.22 #259
3 changed files with 11 additions and 10 deletions
|
@ -12,7 +12,8 @@ run:
|
||||||
# output configuration options
|
# output configuration options
|
||||||
output:
|
output:
|
||||||
# colored-line-number|line-number|json|tab|checkstyle|code-climate, default is "colored-line-number"
|
# colored-line-number|line-number|json|tab|checkstyle|code-climate, default is "colored-line-number"
|
||||||
format: tab
|
formats:
|
||||||
|
- format: tab
|
||||||
|
|
||||||
# all available settings of specific linters
|
# all available settings of specific linters
|
||||||
linters-settings:
|
linters-settings:
|
||||||
|
|
|
@ -73,8 +73,8 @@ func newMinAgg() aggregator {
|
||||||
|
|
||||||
// newReverseMinNorm returns a normalizer which
|
// newReverseMinNorm returns a normalizer which
|
||||||
// normalize values in range of 0.0 to 1.0 to a minimum value.
|
// normalize values in range of 0.0 to 1.0 to a minimum value.
|
||||||
func newReverseMinNorm(min float64) normalizer {
|
func newReverseMinNorm(minV float64) normalizer {
|
||||||
return &reverseMinNorm{min: min}
|
return &reverseMinNorm{min: minV}
|
||||||
}
|
}
|
||||||
|
|
||||||
// newSigmoidNorm returns a normalizer which
|
// newSigmoidNorm returns a normalizer which
|
||||||
|
@ -125,22 +125,22 @@ func (a *meanIQRAgg) Compute() float64 {
|
||||||
|
|
||||||
slices.Sort(a.arr)
|
slices.Sort(a.arr)
|
||||||
|
|
||||||
var min, max float64
|
var minV, maxV float64
|
||||||
|
|
||||||
const minLn = 4
|
const minLn = 4
|
||||||
|
|
||||||
if l < minLn {
|
if l < minLn {
|
||||||
min, max = a.arr[0], a.arr[l-1]
|
minV, maxV = a.arr[0], a.arr[l-1]
|
||||||
} else {
|
} else {
|
||||||
start, end := l/minLn, l*3/minLn-1
|
start, end := l/minLn, l*3/minLn-1
|
||||||
min, max = a.arr[start], a.arr[end]
|
minV, maxV = a.arr[start], a.arr[end]
|
||||||
}
|
}
|
||||||
|
|
||||||
count := 0
|
count := 0
|
||||||
sum := float64(0)
|
sum := float64(0)
|
||||||
|
|
||||||
for _, e := range a.arr {
|
for _, e := range a.arr {
|
||||||
if e >= min && e <= max {
|
if e >= minV && e <= maxV {
|
||||||
sum += e
|
sum += e
|
||||||
count++
|
count++
|
||||||
}
|
}
|
||||||
|
|
|
@ -94,14 +94,14 @@ func (c *context) addUsedNodes(ns ...NodeInfo) {
|
||||||
|
|
||||||
func defaultWeightFunc(ns nodes) weightFunc {
|
func defaultWeightFunc(ns nodes) weightFunc {
|
||||||
mean := newMeanAgg()
|
mean := newMeanAgg()
|
||||||
min := newMinAgg()
|
minV := newMinAgg()
|
||||||
|
|
||||||
for i := range ns {
|
for i := range ns {
|
||||||
mean.Add(float64(ns[i].capacity()))
|
mean.Add(float64(ns[i].capacity()))
|
||||||
min.Add(float64(ns[i].Price()))
|
minV.Add(float64(ns[i].Price()))
|
||||||
}
|
}
|
||||||
|
|
||||||
return newWeightFunc(
|
return newWeightFunc(
|
||||||
newSigmoidNorm(mean.Compute()),
|
newSigmoidNorm(mean.Compute()),
|
||||||
newReverseMinNorm(min.Compute()))
|
newReverseMinNorm(minV.Compute()))
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in a new issue