-
Notifications
You must be signed in to change notification settings - Fork 0
/
ring_queue.go
183 lines (164 loc) · 3.05 KB
/
ring_queue.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
// Copyright 2021 fangyousong(方友松). All rights reserved.
// Use of this source code is governed by a MIT-style
// license that can be found in the LICENSE file.
package goutil
import (
"fmt"
"sync"
"time"
)
// 环形双向队列
type RingQueue struct {
queue []interface{}
headPos int
tailPos int
capacity int
queueSize int
lock sync.Mutex
threadSafe bool
queueSem chan byte
}
func NewRingQueue(capacity int, threadSafe bool) *RingQueue {
ret := new(RingQueue)
ret.queue = make([]interface{}, capacity)
ret.capacity = capacity
ret.tailPos = capacity - 1
ret.queueSem = make(chan byte, capacity)
ret.threadSafe = threadSafe
return ret
}
func (m *RingQueue) internalLock() {
if m.threadSafe {
m.lock.Lock()
}
}
func (m *RingQueue) internalUnlock() {
if m.threadSafe {
m.lock.Unlock()
}
}
func (m *RingQueue) Size() int {
return m.queueSize
}
func (m *RingQueue) PushHead(value interface{}, waitTime time.Duration) error {
getIt := false
select {
case m.queueSem <- 1:
getIt = true
default:
getIt = false
}
if !getIt && waitTime > 0 {
tmr := AcquireTimer(waitTime)
defer ReleaseTimer(tmr)
select {
case m.queueSem <- 1:
getIt = true
case <-tmr.C:
}
}
if !getIt {
return fmt.Errorf("queue full")
}
m.internalLock()
m.queue[m.headPos] = value
m.headPos++
if m.headPos >= len(m.queue) {
m.headPos = 0
}
m.queueSize++
m.internalUnlock()
return nil
}
func (m *RingQueue) PushTail(value interface{}, waitTime time.Duration) error {
getIt := false
select {
case m.queueSem <- 1:
getIt = true
default:
getIt = false
}
if !getIt && waitTime > 0 {
tmr := AcquireTimer(waitTime)
defer ReleaseTimer(tmr)
select {
case m.queueSem <- 1:
getIt = true
case <-tmr.C:
}
}
if !getIt {
return fmt.Errorf("queue full")
}
m.internalLock()
m.queue[m.tailPos] = value
m.tailPos--
if m.tailPos < 0 {
m.tailPos = m.capacity - 1
}
m.queueSize++
m.internalUnlock()
return nil
}
func (m *RingQueue) PopHead(waitTime time.Duration) (interface{}, error) {
getIt := false
select {
case <-m.queueSem:
getIt = true
default:
getIt = false
}
if !getIt && waitTime > 0 {
tmr := AcquireTimer(waitTime)
defer ReleaseTimer(tmr)
select {
case <-m.queueSem:
getIt = true
case <-tmr.C:
}
}
if !getIt {
return nil, fmt.Errorf("queue empty")
}
m.internalLock()
headPos := m.headPos - 1
if headPos < 0 {
headPos = m.capacity - 1
}
ret := m.queue[headPos]
m.headPos = headPos
m.queueSize--
m.internalUnlock()
return ret, nil
}
func (m *RingQueue) PopTail(waitTime time.Duration) (interface{}, error) {
getIt := false
select {
case <-m.queueSem:
getIt = true
default:
getIt = false
}
if !getIt && waitTime > 0 {
tmr := AcquireTimer(waitTime)
defer ReleaseTimer(tmr)
select {
case <-m.queueSem:
getIt = true
case <-tmr.C:
}
}
if !getIt {
return nil, fmt.Errorf("queue empty")
}
m.internalLock()
pos := m.tailPos + 1
if pos >= m.capacity {
pos = 0
}
ret := m.queue[pos]
m.tailPos = pos
m.queueSize--
m.internalUnlock()
return ret, nil
}