-
Notifications
You must be signed in to change notification settings - Fork 0
/
rolling_window.go
222 lines (172 loc) Β· 3.97 KB
/
rolling_window.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
package horus
import (
"errors"
"fmt"
"sync"
"time"
)
var ErrWrongWindowSize = errors.New("specified window must be equal or less than total window")
type RollingWindow struct {
sync.RWMutex
window time.Duration
granularity time.Duration
size int
position int
now time.Time
values []float64
counters []int64
quitC chan struct{}
close bool
}
// NewRWindow provides a slide window operation for a moving average in a rolling window.
// The given window must be in a valid time.Duration higher than 0.
func NewRWindow(window time.Duration, granularity time.Duration) (*RollingWindow, error) {
if window == 0 {
return nil, fmt.Errorf("window must be higher than 0")
}
if granularity == 0 {
return nil, fmt.Errorf("granularity must be higher than zero")
}
if granularity > window || window%granularity != 0 {
return nil, fmt.Errorf("window must be a multiplier of granularity")
}
size := int(window / granularity)
t := &RollingWindow{
window: window,
granularity: granularity,
size: size,
position: 0,
values: make([]float64, size),
counters: make([]int64, size),
quitC: make(chan struct{}),
close: false,
}
ticker := NewTicker(t.granularity)
go t.cleanBuckets(ticker)
return t, nil
}
func (r *RollingWindow) cleanBuckets(ticker TimeTicker) {
for {
select {
case tick := <-ticker.Chan():
r.Lock()
r.position++
if r.position >= r.size {
r.position = 0
}
r.values[r.position] = 0
r.counters[r.position] = 0
r.now = tick
r.Unlock()
case <-r.quitC:
ticker.Stop()
return
}
}
}
func (r *RollingWindow) Stop() {
r.Lock()
defer r.Unlock()
r.close = true
r.quitC <- struct{}{}
}
// Add adds a value to its given position in the rolling window.
// The given value is incremented with the position's value.
func (r *RollingWindow) Add(value float64) {
r.Lock()
defer r.Unlock()
if r.close {
return
}
r.counters[r.position]++
r.values[r.position] += value
}
// AddWithTime takes a value and timestamp and adds it into the correct position.
// The operation is ignored if the timestamp is older than the window size.
func (r *RollingWindow) AddWithTime(value float64, t time.Time) {
r.Lock()
defer r.Unlock()
if r.close {
return
}
// Compare transaction timestamp with current time - window in seconds
// if it is older, exit function.
if t.Unix() < r.now.Add(-r.window).Unix() {
return
}
diff := int(r.now.Unix() - t.Unix())
tpos := r.position - diff
if tpos < 0 {
tpos = r.size + tpos
}
r.counters[tpos]++
r.values[tpos] += value
}
// Count returns the total number of transactions in the rolling window
func (r *RollingWindow) Count() int64 {
r.RLock()
defer r.RUnlock()
var total int64
total = 0
for _, v := range r.counters {
total += v
}
return total
}
// Average calculates the average inside rolling window.
func (r *RollingWindow) Average() float64 {
r.RLock()
defer r.RUnlock()
total := 0.0
for _, v := range r.values {
total = total + v
}
if total == 0 {
return total
}
return total / float64(r.size)
}
// AverageSince calculates the average in the given window
func (r *RollingWindow) AverageSince(w time.Duration) (float64, error) {
r.RLock()
defer r.RUnlock()
if w > r.window {
return 0, ErrWrongWindowSize
}
sum := 0.0
count := 0.0
windowSize := int(w / r.granularity)
for i := 0; i < windowSize; i++ {
pos := r.position - i
if pos < 0 {
pos += len(r.values)
}
sum += r.values[pos]
count++
}
return sum / count, nil
}
// Max returns the max value in the given rolling window.
func (r *RollingWindow) Max() float64 {
r.RLock()
defer r.RUnlock()
max := r.values[0]
for _, v := range r.values {
if v > max {
max = v
}
}
return max
}
// Min returns the min value in the given rolling window.
func (r *RollingWindow) Min() float64 {
r.RLock()
defer r.RUnlock()
min := r.values[0]
for _, v := range r.values {
if v <= min {
min = v
}
}
return min
}