/
queue.go
133 lines (119 loc) · 2.49 KB
/
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
// Galang - Golang common utilities
// Copyright (c) 2020-present, gakkiiyomi@gamil.com
//
// gakkiyomi is licensed under Mulan PSL v2.
// You can use this software according to the terms and conditions of the Mulan PSL v2.
// You may obtain a copy of Mulan PSL v2 at:
// http://license.coscl.org.cn/MulanPSL2
// THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT, MERCHANTABILITY OR FIT FOR A PARTICULAR PURPOSE.
// See the Mulan PSL v2 for more details.
package structure
// NewQueue retruns a Queue
func NewQueue[T any]() *Queue[T] {
return &Queue[T]{nil, nil, 0}
}
// Offer a value into queue
func (q *Queue[T]) Offer(v T) {
n := &node[T]{nil, v, nil}
if q.len == 0 {
q.tail = n
q.head = n
} else {
n.pre = q.tail
q.tail.next = n
q.tail = q.tail.next
}
q.len++
}
// Poll a value out of queue
func (q *Queue[T]) Poll() (data T) {
if q.len == 0 {
return data
}
res := q.head
q.head = q.head.next
q.len--
data = res.v
return
}
// Peek retrun head node value ,if queue isEmpty return nil
func (q *Queue[T]) Peek() (data T) {
if q.len == 0 {
return
}
data = q.head.v
return
}
// Len returns the queue length
func (q *Queue[T]) Len() int {
return q.len
}
// IsEmpty return this queue isempty
func (q *Queue[T]) IsEmpty() bool {
return q.Len() == 0
}
//------------------------Deque------------------------------
// OfferLeft insert a value into queue head
func (q *Queue[T]) OfferLeft(v T) {
n := &node[T]{nil, v, nil}
if q.len == 0 {
q.tail = n
q.head = n
} else {
n.next = q.head
q.head.pre = n
q.head = q.head.pre
}
q.len++
}
// PollLeft delete a value into queue head
func (q *Queue[T]) PollLeft() (data T) {
if q.len == 0 {
return
}
res := q.head
q.head = q.head.next
q.len--
data = res.v
return
}
// Left get head in queue
func (q *Queue[T]) Left() (data T) {
if q.len == 0 {
return
}
data = q.head.v
return
}
// OfferRight insert a value into queue tail
func (q *Queue[T]) OfferRight(v T) {
n := &node[T]{nil, v, nil}
if q.len == 0 {
q.tail = n
q.head = n
} else {
n.pre = q.tail
q.tail.next = n
q.tail = q.tail.next
}
q.len++
}
// PollRight delete a value into queue tail
func (q *Queue[T]) PollRight() (data T) {
if q.len == 0 {
return
}
res := q.tail
q.tail = q.tail.pre
q.len--
data = res.v
return
}
// Right get last item in queue
func (q *Queue[T]) Right() (data T) {
if q.len == 0 {
return
}
data = q.tail.v
return
}