mirror of
https://github.com/prometheus/prometheus.git
synced 2025-01-11 22:07:27 -08:00
Merge pull request #13267 from linasm/simplify-native-histogram-math
promql: simplify Native Histogram arithmetics
This commit is contained in:
commit
bfbb13cf36
|
@ -2507,22 +2507,12 @@ func vectorElemBinop(op parser.ItemType, lhs, rhs float64, hlhs, hrhs *histogram
|
|||
switch op {
|
||||
case parser.ADD:
|
||||
if hlhs != nil && hrhs != nil {
|
||||
// The histogram being added must have the larger schema
|
||||
// code (i.e. the higher resolution).
|
||||
if hrhs.Schema >= hlhs.Schema {
|
||||
return 0, hlhs.Copy().Add(hrhs).Compact(0), true
|
||||
}
|
||||
return 0, hrhs.Copy().Add(hlhs).Compact(0), true
|
||||
return 0, hlhs.Copy().Add(hrhs).Compact(0), true
|
||||
}
|
||||
return lhs + rhs, nil, true
|
||||
case parser.SUB:
|
||||
if hlhs != nil && hrhs != nil {
|
||||
// The histogram being subtracted must have the larger schema
|
||||
// code (i.e. the higher resolution).
|
||||
if hrhs.Schema >= hlhs.Schema {
|
||||
return 0, hlhs.Copy().Sub(hrhs).Compact(0), true
|
||||
}
|
||||
return 0, hrhs.Copy().Mul(-1).Add(hlhs).Compact(0), true
|
||||
return 0, hlhs.Copy().Sub(hrhs).Compact(0), true
|
||||
}
|
||||
return lhs - rhs, nil, true
|
||||
case parser.MUL:
|
||||
|
@ -2707,13 +2697,7 @@ func (ev *evaluator) aggregation(e *parser.AggregateExpr, grouping []string, par
|
|||
if s.H != nil {
|
||||
group.hasHistogram = true
|
||||
if group.histogramValue != nil {
|
||||
// The histogram being added must have
|
||||
// an equal or larger schema.
|
||||
if s.H.Schema >= group.histogramValue.Schema {
|
||||
group.histogramValue.Add(s.H)
|
||||
} else {
|
||||
group.histogramValue = s.H.Copy().Add(group.histogramValue)
|
||||
}
|
||||
group.histogramValue.Add(s.H)
|
||||
}
|
||||
// Otherwise the aggregation contained floats
|
||||
// previously and will be invalid anyway. No
|
||||
|
@ -2730,15 +2714,8 @@ func (ev *evaluator) aggregation(e *parser.AggregateExpr, grouping []string, par
|
|||
if group.histogramMean != nil {
|
||||
left := s.H.Copy().Div(float64(group.groupCount))
|
||||
right := group.histogramMean.Copy().Div(float64(group.groupCount))
|
||||
// The histogram being added/subtracted must have
|
||||
// an equal or larger schema.
|
||||
if s.H.Schema >= group.histogramMean.Schema {
|
||||
toAdd := right.Mul(-1).Add(left)
|
||||
group.histogramMean.Add(toAdd)
|
||||
} else {
|
||||
toAdd := left.Sub(right)
|
||||
group.histogramMean = toAdd.Add(group.histogramMean)
|
||||
}
|
||||
toAdd := left.Sub(right)
|
||||
group.histogramMean.Add(toAdd)
|
||||
}
|
||||
// Otherwise the aggregation contained floats
|
||||
// previously and will be invalid anyway. No
|
||||
|
|
|
@ -537,15 +537,8 @@ func funcAvgOverTime(vals []parser.Value, args parser.Expressions, enh *EvalNode
|
|||
count++
|
||||
left := h.H.Copy().Div(float64(count))
|
||||
right := mean.Copy().Div(float64(count))
|
||||
// The histogram being added/subtracted must have
|
||||
// an equal or larger schema.
|
||||
if h.H.Schema >= mean.Schema {
|
||||
toAdd := right.Mul(-1).Add(left)
|
||||
mean.Add(toAdd)
|
||||
} else {
|
||||
toAdd := left.Sub(right)
|
||||
mean = toAdd.Add(mean)
|
||||
}
|
||||
toAdd := left.Sub(right)
|
||||
mean.Add(toAdd)
|
||||
}
|
||||
return mean
|
||||
}), nil
|
||||
|
@ -685,13 +678,7 @@ func funcSumOverTime(vals []parser.Value, args parser.Expressions, enh *EvalNode
|
|||
return aggrHistOverTime(vals, enh, func(s Series) *histogram.FloatHistogram {
|
||||
sum := s.Histograms[0].H.Copy()
|
||||
for _, h := range s.Histograms[1:] {
|
||||
// The histogram being added must have
|
||||
// an equal or larger schema.
|
||||
if h.H.Schema >= sum.Schema {
|
||||
sum.Add(h.H)
|
||||
} else {
|
||||
sum = h.H.Copy().Add(sum)
|
||||
}
|
||||
sum.Add(h.H)
|
||||
}
|
||||
return sum
|
||||
}), nil
|
||||
|
|
Loading…
Reference in a new issue