-
Notifications
You must be signed in to change notification settings - Fork 66
/
timeoutqueue.go
133 lines (110 loc) · 2.66 KB
/
timeoutqueue.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
// Copyright 2023 LiveKit, Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package utils
import (
"sync"
"time"
)
type TimeoutQueueItem[T any] struct {
Value T
time int64
next, prev *TimeoutQueueItem[T]
removed bool
}
type TimeoutQueue[T any] struct {
mu sync.Mutex
head, tail *TimeoutQueueItem[T]
}
func (q *TimeoutQueue[T]) Reset(i *TimeoutQueueItem[T]) bool {
t := time.Now().UnixNano()
q.mu.Lock()
defer q.mu.Unlock()
if !i.removed {
i.time = t
q.remove(i)
q.push(i)
}
return !i.removed
}
func (q *TimeoutQueue[T]) Remove(i *TimeoutQueueItem[T]) {
q.mu.Lock()
defer q.mu.Unlock()
i.removed = true
q.remove(i)
}
func (q *TimeoutQueue[T]) popBefore(t int64, remove bool) *TimeoutQueueItem[T] {
q.mu.Lock()
defer q.mu.Unlock()
i := q.head
if i == nil || i.time > t {
return nil
}
i.removed = i.removed || remove
i.time = 0
q.remove(i)
return i
}
func (q *TimeoutQueue[T]) push(i *TimeoutQueueItem[T]) {
i.prev = q.tail
i.next = nil
if i.prev != nil {
i.prev.next = i
}
q.tail = i
if q.head == nil {
q.head = i
}
}
func (q *TimeoutQueue[T]) remove(i *TimeoutQueueItem[T]) {
if q.tail == i {
q.tail = i.prev
}
if q.head == i {
q.head = i.next
}
if i.prev != nil {
i.prev.next = i.next
}
if i.next != nil {
i.next.prev = i.prev
}
i.next = nil
i.prev = nil
}
func (q *TimeoutQueue[T]) IterateAfter(timeout time.Duration) TimeoutQueueIterator[T] {
return newTimeoutQueueIterator(q, timeout, false)
}
func (q *TimeoutQueue[T]) IterateRemoveAfter(timeout time.Duration) TimeoutQueueIterator[T] {
return newTimeoutQueueIterator(q, timeout, true)
}
type TimeoutQueueIterator[T any] struct {
q *TimeoutQueue[T]
time int64
remove bool
item *TimeoutQueueItem[T]
}
func newTimeoutQueueIterator[T any](q *TimeoutQueue[T], timeout time.Duration, remove bool) TimeoutQueueIterator[T] {
return TimeoutQueueIterator[T]{
q: q,
time: time.Now().Add(-timeout).UnixNano(),
remove: remove,
}
}
func (i *TimeoutQueueIterator[T]) Next() bool {
i.item = i.q.popBefore(i.time, i.remove)
return i.item != nil
}
func (i *TimeoutQueueIterator[T]) Item() *TimeoutQueueItem[T] {
return i.item
}