This repository has been archived by the owner on Aug 23, 2023. It is now read-only.
/
func_sortbyname.go
77 lines (61 loc) · 1.63 KB
/
func_sortbyname.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
package expr
import (
"sort"
"github.com/grafana/metrictank/api/models"
"github.com/grafana/metrictank/util"
)
type FuncSortByName struct {
in GraphiteFunc
natural bool
reverse bool
}
func NewSortByName() GraphiteFunc {
return &FuncSortByName{}
}
func (s *FuncSortByName) Signature() ([]Arg, []Arg) {
return []Arg{
ArgSeriesList{val: &s.in},
ArgBool{key: "natural", opt: true, val: &s.natural},
ArgBool{key: "reverse", opt: true, val: &s.reverse},
}, []Arg{
ArgSeriesList{},
}
}
func (s *FuncSortByName) Context(context Context) Context {
return context
}
func (s *FuncSortByName) Exec(dataMap DataMap) ([]models.Series, error) {
series, err := s.in.Exec(dataMap)
if err != nil {
return nil, err
}
// Copy series to avoid conflicting with other functions
seriesCpy := make([]models.Series, 0, len(series))
for _, serie := range series {
seriesCpy = append(seriesCpy, serie)
}
sortFunc := seriesTargetSort{seriesCpy, stringLess}
if s.natural {
sortFunc.cmp = util.NaturalLess
}
if s.reverse {
sort.Sort(sort.Reverse(sortFunc))
} else {
sort.Sort(sortFunc)
}
return seriesCpy, nil
}
// Provides a comparison function pointer
func stringLess(a, b string) bool {
return a < b
}
// Pluggable comparison function, sorts by series target
type seriesTargetSort struct {
series []models.Series
cmp func(string, string) bool
}
func (ss seriesTargetSort) Len() int { return len(ss.series) }
func (ss seriesTargetSort) Less(i, j int) bool {
return ss.cmp(ss.series[i].Target, ss.series[j].Target)
}
func (ss seriesTargetSort) Swap(i, j int) { ss.series[i], ss.series[j] = ss.series[j], ss.series[i] }