mirror of
https://github.com/prometheus/prometheus.git
synced 2025-08-06 14:17:12 +02:00
promql: typo fix in comment
Signed-off-by: beorn7 <beorn@grafana.com>
This commit is contained in:
parent
c3da460474
commit
68b1bcc648
@ -682,7 +682,7 @@ func funcAvgOverTime(vals []parser.Value, args parser.Expressions, enh *EvalNode
|
||||
// https://stackoverflow.com/questions/61665473/is-it-beneficial-for-precision-to-calculate-the-incremental-mean-average
|
||||
// Additional note: For even better numerical accuracy, we would need to
|
||||
// process the values in a particular order. For avg_over_time, that
|
||||
// would be more or less feasible, but it would be more expensivo, and
|
||||
// would be more or less feasible, but it would be more expensive, and
|
||||
// it would also be much harder for the avg aggregator, given how the
|
||||
// PromQL engine works.
|
||||
if len(firstSeries.Floats) == 0 {
|
||||
|
4
promql/promqltest/testdata/functions.test
vendored
4
promql/promqltest/testdata/functions.test
vendored
@ -1086,8 +1086,8 @@ load 5s
|
||||
# relevant this scenario is.
|
||||
# eval instant at 55s avg_over_time(metric11[1m])
|
||||
# {} -44.848083237000004 <- This is the correct value.
|
||||
# {} -1.881783551706252e+203 <- This is the relust on linux/amd64.
|
||||
# {} 2.303079268822384e+202 <- This is the relust on darwin/arm64.
|
||||
# {} -1.881783551706252e+203 <- This is the result on linux/amd64.
|
||||
# {} 2.303079268822384e+202 <- This is the result on darwin/arm64.
|
||||
|
||||
# Test per-series aggregation on dense samples.
|
||||
clear
|
||||
|
Loading…
Reference in New Issue
Block a user