-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstatics.go
More file actions
275 lines (237 loc) · 4.69 KB
/
Copy pathstatics.go
File metadata and controls
275 lines (237 loc) · 4.69 KB
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
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
package windows
import (
"math"
)
type StaticType int
const (
StaticBase StaticType = iota
StaticSum
StaticMin
StaticMax
StaticAvg
)
type WindowStatic interface {
Value(i *Item) float64
Total(i *Item) int
Static(i *Item) (float64, int)
Add(v float64, index int)
Reset(i *Item, index int)
SetIgnoreCurrent(i bool)
}
func NewStatic(staticType StaticType, size int) WindowStatic {
switch staticType {
case StaticBase:
return nil
case StaticSum:
return newSumStatic()
case StaticMin:
return newMinStatic(size)
case StaticMax:
return newMaxStatic(size)
case StaticAvg:
return newAgvStatic(size)
}
return nil
}
type BaseStatic struct {
TotalSum int
ignoreCurrent bool
}
func (s *BaseStatic) Total(i *Item) int {
if i != nil && s.ignoreCurrent {
return s.TotalSum - i.Total
}
return s.TotalSum
}
func (s *BaseStatic) SetIgnoreCurrent(i bool) {
s.ignoreCurrent = i
}
/*
* space o(1)
* value o(1)
* add [avg] o(1)
* reset o(1)
*/
type SumStatic struct {
BaseStatic
ValSum float64
}
func newSumStatic() *SumStatic {
return &SumStatic{}
}
func (s *SumStatic) Value(i *Item) float64 {
if i != nil && s.ignoreCurrent {
return s.ValSum - i.Val
}
return s.ValSum
}
func (s *SumStatic) Static(i *Item) (float64, int) {
return s.Value(i), s.Total(i)
}
func (s *SumStatic) Add(v float64, index int) {
s.ValSum += v
s.TotalSum++
}
func (s *SumStatic) Reset(i *Item, index int) {
s.ValSum -= i.Val
s.TotalSum -= i.Total
}
/*
* space o(k)
* value o(1)
* add [avg] o(1)
* reset o(1)
*/
type MaxStatic struct {
BaseStatic
Size int
curPos int
cap int
curVal float64
Queue *CircularQueue
}
func newMaxStatic(size int) *MaxStatic {
return &MaxStatic{Queue: NewCircularQueue(size), Size: size}
}
func (s *MaxStatic) Value(i *Item) float64 {
// 初始桶是0值,所以如果队列没满,桶的最大值是0值
var max = s.Queue.First()
if max < 0 && s.cap < s.Size-1 {
max = 0
}
if s.ignoreCurrent {
return max
}
return math.Max(max, i.Val)
}
func (s *MaxStatic) Static(i *Item) (float64, int) {
return s.Value(i), s.Total(i)
}
func (s *MaxStatic) Add(v float64, index int) {
if index != s.curPos {
d := (index + s.Size - s.curPos) % s.Size
s.Queue.PushEmpty(d)
s.curPos = index
}
s.curVal += v
s.TotalSum++
}
func (s *MaxStatic) getIndex(i int) int {
return i % s.Size
}
func (s *MaxStatic) Reset(i *Item, index int) {
if i.Val == s.Queue.First() {
s.Queue.Shift()
}
if s.curVal != 0 {
s.cap++
}
if index == s.getIndex(s.curPos+1) && s.curVal != 0 {
// 说明上一个统计结束了
for !s.Queue.IsEmpty() && s.Queue.Last() < s.curVal {
s.Queue.Pop()
}
s.Queue.Push(s.curVal)
s.curVal = 0
s.curPos = s.getIndex(s.curPos + 1)
}
s.TotalSum -= i.Total
if i.Val != 0 && s.cap > 0 {
s.cap--
}
}
/*
* space o(k)
* value o(1)
* add [avg] o(1)
* reset o(1)
*/
type MinStatic struct {
BaseStatic
Size int
curPos int
curVal float64
cap int
Queue *CircularQueue
}
func newMinStatic(size int) *MinStatic {
return &MinStatic{Queue: NewCircularQueue(size), Size: size}
}
func (s *MinStatic) Value(i *Item) float64 {
// 初始桶是0值,所以如果队列没满,桶的最大值是0值
var min = s.Queue.First()
if min > 0 && s.cap < s.Size-1 {
min = 0
}
if s.ignoreCurrent {
return min
}
return math.Min(min, i.Val)
}
func (s *MinStatic) Static(i *Item) (float64, int) {
return s.Value(i), s.Total(i)
}
func (s *MinStatic) Add(v float64, index int) {
if index != s.curPos {
d := (index + s.Size - s.curPos) % s.Size
s.Queue.PushEmpty(d)
s.curPos = index
}
s.curVal += v
s.TotalSum++
}
func (s *MinStatic) Reset(i *Item, index int) {
if i.Val == s.Queue.First() {
s.Queue.Shift()
}
if s.curVal != 0 {
s.cap++
}
if index == s.getIndex(s.curPos+1) && s.curVal != 0 {
// 说明上一个统计结束了
for !s.Queue.IsEmpty() && s.Queue.Last() > s.curVal {
s.Queue.Pop()
}
s.Queue.Push(s.curVal)
s.curVal = 0
s.curPos = s.getIndex(s.curPos + 1)
}
s.TotalSum -= i.Total
if i.Val != 0 && s.cap > 0 {
s.cap--
}
}
func (s *MinStatic) getIndex(i int) int {
return i % s.Size
}
/*
* space o(1)
* value o(1)
* add [avg] o(1)
* reset o(1)
*/
type AgvStatic struct {
BaseStatic
Size int
ValSum float64
}
func newAgvStatic(size int) *AgvStatic {
return &AgvStatic{Size: size}
}
func (s *AgvStatic) Value(i *Item) float64 {
if i != nil && s.ignoreCurrent {
return (s.ValSum - i.Val)/float64(s.Size-1)
}
return s.ValSum / float64(s.Size)
}
func (s *AgvStatic) Static(i *Item) (float64, int) {
return s.Value(i), s.Total(i)
}
func (s *AgvStatic) Add(v float64, index int) {
s.ValSum += v
s.TotalSum++
}
func (s *AgvStatic) Reset(i *Item, index int) {
s.ValSum -= i.Val
s.TotalSum -= i.Total
}