-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathaggregate.go
249 lines (213 loc) · 4.67 KB
/
aggregate.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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
package stdlib
import (
"bytes"
"math"
"sort"
"gonum.org/v1/gonum/stat"
)
type mode struct {
counts map[any]int
top any
topCount int
}
func newMode() *mode {
return &mode{
counts: map[any]int{},
}
}
func (m *mode) Step(x any) {
m.counts[x]++
c := m.counts[x]
if c > m.topCount {
m.top = x
m.topCount = c
}
}
func (m *mode) Done() any {
return m.top
}
type stddev struct {
mean float64
count int
meanSquared float64
}
func newStddev() *stddev { return &stddev{} }
func (s *stddev) Step(x any) {
// Welford's method
// https://jonisalonen.com/2013/deriving-welfords-method-for-computing-variance/
xf := floaty(x)
s.count++
oldMean := s.mean
s.mean += (xf - s.mean) / float64(s.count)
s.meanSquared += (xf - s.mean) * (xf - oldMean)
}
func (s *stddev) Done() float64 {
if s.count < 2 {
return 0
}
return s.meanSquared / float64(s.count-1)
}
type percentile struct {
xs []float64
percentile float64
kind stat.CumulantKind
}
func newPercentile() *percentile {
return &percentile{
kind: stat.Empirical,
}
}
func newPercentileN(n int) func() *percentile {
return func() *percentile {
p := newPercentile()
p.percentile = float64(n)
return p
}
}
func newPercentileCont() *percentile {
return &percentile{
kind: stat.LinInterp,
}
}
func newPercentileContN(n int) func() *percentile {
return func() *percentile {
p := newPercentileCont()
p.percentile = float64(n)
return p
}
}
func (s *percentile) Step(x any, perc ...any) {
if len(perc) > 0 {
s.percentile = floaty(perc[0])
}
s.xs = append(s.xs, floaty(x))
}
func (s *percentile) Done() float64 {
if s.percentile == 0 || len(s.xs) == 0 {
return 0
}
sort.Float64s(s.xs)
r := stat.Quantile(s.percentile/100, s.kind, s.xs, nil)
return r
}
type sqliteValueKind uint
const (
sqliteNull sqliteValueKind = iota
sqliteInt
sqliteString
sqliteReal
sqliteBlob
)
type sqliteValue struct {
kind sqliteValueKind
i int64
s string
r float64
b []byte
}
type sqliteValues []sqliteValue
func (svs *sqliteValues) Len() int {
return len(*svs)
}
func (svs *sqliteValues) Less(i, j int) bool {
ie := (*svs)[i]
je := (*svs)[j]
if ie.kind != je.kind {
// TODO: support mixed value types?
return false
}
switch ie.kind {
case sqliteInt:
return ie.i < je.i
case sqliteString:
return ie.s < je.s
case sqliteReal:
return ie.r < je.r
case sqliteBlob:
return bytes.Compare(ie.b, je.b) < 0
}
return false
}
func (svs *sqliteValues) Swap(i, j int) {
(*svs)[i], (*svs)[j] = (*svs)[j], (*svs)[i]
}
type median struct {
xs sqliteValues
}
func newMedian() *median {
return &median{}
}
func (m *median) Step(x any) {
v := sqliteValue{kind: sqliteNull}
switch t := x.(type) {
case int64:
v.kind = sqliteInt
v.i = t
case int:
v.kind = sqliteInt
v.i = int64(t)
case string:
v.kind = sqliteString
v.s = t
case float64:
v.kind = sqliteReal
v.r = t
case []byte:
v.kind = sqliteBlob
v.b = t
}
m.xs = append(m.xs, v)
}
func (m *median) Done() any {
if len(m.xs) == 0 {
return nil
}
sort.Sort(&m.xs)
e := m.xs[int(math.Floor(float64(len(m.xs))/2))]
switch e.kind {
case sqliteInt:
return e.i
case sqliteString:
return e.s
case sqliteReal:
return e.r
case sqliteBlob:
return e.b
}
return nil
}
var aggregateFunctions = map[string]any{
"stddev": newStddev,
"stdev": newStddev,
"stddev_pop": newStddev,
"mode": newMode,
"median": newMedian,
"percentile_25": newPercentileN(25),
"perc_25": newPercentileN(25),
"percentile_50": newPercentileN(50),
"perc_50": newPercentileN(50),
"percentile_75": newPercentileN(75),
"perc_75": newPercentileN(75),
"percentile_90": newPercentileN(90),
"perc_90": newPercentileN(90),
"percentile_95": newPercentileN(95),
"perc_95": newPercentileN(95),
"percentile_99": newPercentileN(99),
"perc_99": newPercentileN(99),
"percentile": newPercentile,
"perc": newPercentile,
"percentile_cont_25": newPercentileContN(25),
"perc_cont_25": newPercentileContN(25),
"percentile_cont_50": newPercentileContN(50),
"perc_cont_50": newPercentileContN(50),
"percentile_cont_75": newPercentileContN(75),
"perc_cont_75": newPercentileContN(75),
"percentile_cont_90": newPercentileContN(90),
"perc_cont_90": newPercentileContN(90),
"percentile_cont_95": newPercentileContN(95),
"perc_cont_95": newPercentileContN(95),
"percentile_cont_99": newPercentileContN(99),
"perc_cont_99": newPercentileContN(99),
"percentile_cont": newPercentileCont,
"perc_cont": newPercentileCont,
}