-
-
Notifications
You must be signed in to change notification settings - Fork 8
Expand file tree
/
Copy pathqueue.go
More file actions
106 lines (87 loc) · 1.8 KB
/
queue.go
File metadata and controls
106 lines (87 loc) · 1.8 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
package floodwait
import (
"container/heap"
"sync"
"time"
)
type scheduled struct {
request request
sendTime time.Time
index int
}
type scheduledHeap []scheduled
func (r scheduledHeap) Len() int { return len(r) }
func (r scheduledHeap) Less(i, j int) bool {
return r[i].sendTime.UnixNano() < r[j].sendTime.UnixNano()
}
func (r scheduledHeap) Swap(i, j int) {
r[i], r[j] = r[j], r[i]
r[i].index = i
r[j].index = j
}
func (r *scheduledHeap) Push(x interface{}) {
n := len(*r)
item := x.(scheduled)
item.index = n
*r = append(*r, item)
}
func (r *scheduledHeap) Pop() interface{} {
old := *r
n := len(old)
item := old[n-1]
item.index = -1 // for safety
*r = old[0 : n-1]
return item
}
type queue struct {
requests scheduledHeap
requestsMux sync.Mutex
}
func newQueue(initialCapacity int) *queue {
r := make(scheduledHeap, 0, initialCapacity)
return &queue{requests: r}
}
func (q *queue) add(r request, t time.Time) {
q.requestsMux.Lock()
defer q.requestsMux.Unlock()
heap.Push(&q.requests, scheduled{
request: r,
sendTime: t,
})
}
func (q *queue) len() int {
q.requestsMux.Lock()
r := len(q.requests)
q.requestsMux.Unlock()
return r
}
func (q *queue) move(k key, now time.Time, dur time.Duration) {
q.requestsMux.Lock()
defer q.requestsMux.Unlock()
for idx, s := range q.requests {
if s.request.key != k {
continue
}
t := s.sendTime
if t.Sub(now) > dur {
break
}
q.requests[idx].sendTime = t.Add(dur)
}
heap.Init(&q.requests)
}
func (q *queue) gather(now time.Time, req []scheduled) []scheduled {
q.requestsMux.Lock()
defer q.requestsMux.Unlock()
for {
if q.requests.Len() < 1 {
return req
}
next := heap.Pop(&q.requests).(scheduled)
if now.Before(next.sendTime) {
heap.Push(&q.requests, next)
return req
}
req = append(req, next)
}
}