Like Prometheus, but for logs.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 
loki/pkg/logql/vector.go

96 lines
1.7 KiB

package logql
import (
"math"
"time"
"github.com/prometheus/prometheus/promql"
)
type vectorByValueHeap promql.Vector
func (s vectorByValueHeap) Len() int {
return len(s)
}
func (s vectorByValueHeap) Less(i, j int) bool {
if math.IsNaN(s[i].F) {
return true
}
return s[i].F < s[j].F
}
func (s vectorByValueHeap) Swap(i, j int) {
s[i], s[j] = s[j], s[i]
}
func (s *vectorByValueHeap) Push(x interface{}) {
*s = append(*s, *(x.(*promql.Sample)))
}
func (s *vectorByValueHeap) Pop() interface{} {
old := *s
n := len(old)
el := old[n-1]
*s = old[0 : n-1]
return el
}
type vectorByReverseValueHeap promql.Vector
func (s vectorByReverseValueHeap) Len() int {
return len(s)
}
func (s vectorByReverseValueHeap) Less(i, j int) bool {
if math.IsNaN(s[i].F) {
return true
}
return s[i].F > s[j].F
}
func (s vectorByReverseValueHeap) Swap(i, j int) {
s[i], s[j] = s[j], s[i]
}
func (s *vectorByReverseValueHeap) Push(x interface{}) {
*s = append(*s, *(x.(*promql.Sample)))
}
func (s *vectorByReverseValueHeap) Pop() interface{} {
old := *s
n := len(old)
el := old[n-1]
*s = old[0 : n-1]
return el
}
type VectorStepEvaluator struct {
exhausted bool
start time.Time
data promql.Vector
}
func NewVectorStepEvaluator(start time.Time, data promql.Vector) *VectorStepEvaluator {
return &VectorStepEvaluator{
exhausted: false,
start: start,
data: data,
}
}
func (e *VectorStepEvaluator) Next() (bool, int64, StepResult) {
if !e.exhausted {
e.exhausted = true
return true, e.start.UnixNano() / int64(time.Millisecond), SampleVector(e.data)
}
return false, 0, nil
}
func (e *VectorStepEvaluator) Close() error {
return nil
}
func (e *VectorStepEvaluator) Error() error {
return nil
}