-
Notifications
You must be signed in to change notification settings - Fork 0
/
queue.go
66 lines (55 loc) · 843 Bytes
/
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
package standard
import (
"sync"
)
// 多线程队列
type Queue[T any] struct {
mutex_ sync.RWMutex
size_ uint // 容量
head_ *node[T] // 队头
tail_ *node[T] // 队尾
}
type node[T any] struct {
value_ T
next_ *node[T]
}
func NewQueue[T any]() *Queue[T] {
return &Queue[T]{
size_: 0,
head_: nil,
tail_: nil,
}
}
// 插入
func (q *Queue[T]) Push(v T) {
n := &node[T]{
value_: v,
next_: nil,
}
q.mutex_.Lock()
if q.size_ == 0 {
q.head_ = n
} else {
q.tail_.next_ = n
}
q.tail_ = n
q.size_++
q.mutex_.Unlock()
}
// 弹出
func (q *Queue[T]) Pop() any {
q.mutex_.Lock()
defer q.mutex_.Unlock()
if q.size_ == 0 {
return nil
}
n := q.head_
q.head_ = n.next_
q.size_--
return n.value_
}
func (q *Queue[T]) Size() uint {
q.mutex_.RLock()
defer q.mutex_.RUnlock()
return q.size_
}