VictoriaMetrics/lib/logstorage/stats_max.go

113 lines
2.2 KiB
Go
Raw Normal View History

2024-04-30 23:58:35 +00:00
package logstorage
import (
"slices"
2024-05-15 11:07:15 +00:00
"strings"
2024-04-30 23:58:35 +00:00
"unsafe"
)
type statsMax struct {
fields []string
containsStar bool
}
func (sm *statsMax) String() string {
return "max(" + fieldNamesString(sm.fields) + ")"
}
func (sm *statsMax) neededFields() []string {
return sm.fields
}
func (sm *statsMax) newStatsProcessor() (statsProcessor, int) {
smp := &statsMaxProcessor{
2024-05-15 11:07:15 +00:00
sm: sm,
2024-04-30 23:58:35 +00:00
}
return smp, int(unsafe.Sizeof(*smp))
}
type statsMaxProcessor struct {
sm *statsMax
2024-05-15 11:07:15 +00:00
max string
hasMax bool
2024-04-30 23:58:35 +00:00
}
func (smp *statsMaxProcessor) updateStatsForAllRows(br *blockResult) int {
2024-05-15 11:07:15 +00:00
maxLen := len(smp.max)
2024-04-30 23:58:35 +00:00
if smp.sm.containsStar {
2024-05-15 11:07:15 +00:00
// Find the minimum value across all the columns
2024-04-30 23:58:35 +00:00
for _, c := range br.getColumns() {
2024-05-15 11:07:15 +00:00
for _, v := range c.getValues(br) {
smp.updateState(v)
2024-04-30 23:58:35 +00:00
}
}
2024-05-03 12:03:17 +00:00
} else {
2024-05-15 11:07:15 +00:00
// Find the minimum value across the requested columns
2024-05-03 12:03:17 +00:00
for _, field := range smp.sm.fields {
c := br.getColumnByName(field)
2024-05-15 11:07:15 +00:00
for _, v := range c.getValues(br) {
smp.updateState(v)
2024-05-03 12:03:17 +00:00
}
2024-04-30 23:58:35 +00:00
}
}
2024-05-15 11:07:15 +00:00
return len(smp.max) - maxLen
2024-04-30 23:58:35 +00:00
}
func (smp *statsMaxProcessor) updateStatsForRow(br *blockResult, rowIdx int) int {
2024-05-15 11:07:15 +00:00
maxLen := len(smp.max)
2024-04-30 23:58:35 +00:00
if smp.sm.containsStar {
2024-05-15 11:07:15 +00:00
// Find the minimum value across all the fields for the given row
2024-04-30 23:58:35 +00:00
for _, c := range br.getColumns() {
2024-05-15 11:07:15 +00:00
v := c.getValueAtRow(br, rowIdx)
smp.updateState(v)
2024-04-30 23:58:35 +00:00
}
2024-05-03 12:03:17 +00:00
} else {
2024-05-15 11:07:15 +00:00
// Find the minimum value across the requested fields for the given row
2024-05-03 12:03:17 +00:00
for _, field := range smp.sm.fields {
c := br.getColumnByName(field)
2024-05-15 11:07:15 +00:00
v := c.getValueAtRow(br, rowIdx)
smp.updateState(v)
2024-04-30 23:58:35 +00:00
}
}
2024-05-15 11:07:15 +00:00
return maxLen - len(smp.max)
2024-04-30 23:58:35 +00:00
}
func (smp *statsMaxProcessor) mergeState(sfp statsProcessor) {
src := sfp.(*statsMaxProcessor)
2024-05-15 11:07:15 +00:00
if src.hasMax {
smp.updateState(src.max)
2024-04-30 23:58:35 +00:00
}
}
2024-05-15 11:07:15 +00:00
func (smp *statsMaxProcessor) updateState(v string) {
if smp.hasMax && !lessString(smp.max, v) {
return
}
smp.max = strings.Clone(v)
smp.hasMax = true
}
2024-04-30 23:58:35 +00:00
func (smp *statsMaxProcessor) finalizeStats() string {
2024-05-15 11:07:15 +00:00
if !smp.hasMax {
return "NaN"
}
return smp.max
2024-04-30 23:58:35 +00:00
}
func parseStatsMax(lex *lexer) (*statsMax, error) {
2024-05-03 12:03:17 +00:00
fields, err := parseFieldNamesForStatsFunc(lex, "max")
2024-04-30 23:58:35 +00:00
if err != nil {
2024-05-03 09:15:09 +00:00
return nil, err
2024-04-30 23:58:35 +00:00
}
sm := &statsMax{
fields: fields,
containsStar: slices.Contains(fields, "*"),
}
return sm, nil
}