-
Notifications
You must be signed in to change notification settings - Fork 6
/
aggregates.go
80 lines (72 loc) · 1.29 KB
/
aggregates.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
package functions
import (
"github.com/viterin/partial"
"golang.org/x/exp/constraints"
"golang.org/x/exp/slices"
"math"
)
func Sum_Go[T constraints.Float](x []T) T {
sum := T(0)
for i := 0; i < len(x); i++ {
sum += x[i]
}
return sum
}
func CumSum_Go[T constraints.Float](x []T) {
sum := T(0)
for i := 0; i < len(x); i++ {
sum += x[i]
x[i] = sum
}
}
func Prod_Go[T constraints.Float](x []T) T {
prod := T(1)
for i := 0; i < len(x); i++ {
prod *= x[i]
}
return prod
}
func CumProd_Go[T constraints.Float](x []T) {
prod := T(1)
for i := 0; i < len(x); i++ {
prod *= x[i]
x[i] = prod
}
}
func Mean_Go[T constraints.Float](x []T) T {
return Sum_Go(x) / T(len(x))
}
func Median_Go[T constraints.Float](x []T) T {
if len(x)%2 == 1 {
x = slices.Clone(x)
i := len(x) / 2
partial.TopK(x, i+1)
return x[i]
}
return Quantile_Go(x, T(0.5))
}
func Quantile_Go[T constraints.Float](x []T, q T) T {
if len(x) == 1 {
return x[0]
}
if q == T(0) {
return Min_Go(x)
}
if q == T(1) {
return Max_Go(x)
}
x = slices.Clone(x)
f := T(len(x)-1) * q
i := int(math.Floor(float64(f)))
if q < 0.5 {
partial.TopK(x, i+2)
a := Max_Go(x[:i+1])
b := x[i+1]
return a + (b-a)*(f-T(i))
} else {
partial.TopK(x, i+1)
a := x[i]
b := Min_Go(x[i+1:])
return a + (b-a)*(f-T(i))
}
}