mudhorn/prometheus
1
0
Fork 0
mirror of https://github.com/prometheus/prometheus.git synced 2024-11-09 23:24:05 -08:00
Code Issues Actions 3 Packages Projects Releases Wiki Activity

Implied simplifications.

Browse source
This commit is contained in:
Matt T. Proud 2013-03-18 11:50:27 -07:00
parent 51a0f21cf8
commit fd47ac570f
1 changed files with 7 additions and 14 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

21
storage/metric/operation.go
View file

@ -370,18 +370,15 @@ func optimizeForward(pending ops) (out ops) {
}
var (
firstOperation = pending[0]
head op = pending[0]
tail ops
)
pending = pending[1:len(pending)]
switch t := firstOperation.(type) {
switch t := head.(type) {
case *getValuesAtTimeOp:
out = ops{firstOperation}
tail := optimizeForward(pending)
return append(out, tail...)
out = ops{head}
case *getValuesAtIntervalOp:
// If the last value was a scan at a given frequency along an interval,
// several optimizations may exist.
@ -448,8 +445,6 @@ func optimizeForward(pending ops) (out ops) {
)
pending = append(head, tail...)
return optimizeForward(pending)
}
case *getValuesAtIntervalOp:
pending = pending[1:len(pending)]
@ -464,9 +459,7 @@ func optimizeForward(pending ops) (out ops) {
if t.After(next.through) {
next.from = t
pending = append(ops{next}, pending...)
return optimizeForward(pending)
tail = append(ops{next}, pending...)
}
}
}
@ -481,9 +474,9 @@ func optimizeForward(pending ops) (out ops) {
// Strictly needed?
sort.Sort(startsAtSort{pending})
tail := optimizeForward(pending)
tail = optimizeForward(pending)
return append(ops{firstOperation}, tail...)
return append(ops{head}, tail...)
}
// selectQueriesForTime chooses all subsequent operations from the slice that