-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathstack.go
238 lines (203 loc) · 4.18 KB
/
stack.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
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
package collections
import (
"container/list"
"sync"
)
type Stack[T any] interface {
Push(val T) (newElem bool)
Pop() (T, bool)
Top() (T, bool)
Size() int
Empty() bool
Clear()
}
var _ Stack[any] = (*UnsafeStack[any])(nil)
var _ Stack[Frame] = (*UnsafeCompressedStack[Frame])(nil)
var _ Stack[uint32] = (*UnsafeUint32Stack)(nil)
type UnsafeStack[T any] struct {
elements *list.List
_padding0 [56]byte
}
func NewUnsafeStack[T any]() *UnsafeStack[T] {
return &UnsafeStack[T]{
elements: list.New(),
}
}
func (u *UnsafeStack[T]) Push(val T) (newElem bool) {
u.elements.PushBack(val)
return true
}
func (u *UnsafeStack[T]) Pop() (t T, ok bool) {
v := u.elements.Back()
if v != nil {
u.elements.Remove(v)
t = v.Value.(T)
ok = true
}
return
}
func (u *UnsafeStack[T]) Top() (t T, ok bool) {
v := u.elements.Back()
if v != nil {
ok = true
t = v.Value.(T)
}
return
}
func (u *UnsafeStack[T]) Size() int {
return u.elements.Len()
}
func (u *UnsafeStack[T]) Empty() bool {
return u.elements.Len() == 0
}
func (u *UnsafeStack[T]) Clear() {
u.elements.Init()
}
// UnsafeCompressedStack 非并发安全的Stack
type UnsafeCompressedStack[T Frame] struct {
elements *list.List
_padding0 [56]byte
count int
_padding1 [56]byte
}
type Frame interface {
Equals(value Frame) bool
Init()
ReEnter()
}
type stackElement[T Frame] struct {
// 栈元素值
val T
// 当前在栈中元素个数
count int
}
func NewUnsafeCompressedStack[T Frame]() *UnsafeCompressedStack[T] {
return &UnsafeCompressedStack[T]{
elements: list.New(),
}
}
func (s *UnsafeCompressedStack[T]) Push(val T) bool {
s.count++
back := s.elements.Back()
if back != nil {
ele := back.Value.(*stackElement[T])
if val.Equals(ele.val) {
ele.val.ReEnter()
ele.count++
return false
}
}
val.Init()
s.elements.PushBack(&stackElement[T]{val: val, count: 1})
return true
}
func (s *UnsafeCompressedStack[T]) Pop() (t T, ok bool) {
e := s.elements.Back()
if e != nil {
ele := e.Value.(*stackElement[T])
ele.count--
if ele.count == 0 {
s.elements.Remove(e)
}
s.count--
t = ele.val
ok = true
}
return
}
func (s *UnsafeCompressedStack[T]) Top() (t T, ok bool) {
e := s.elements.Back()
if e != nil {
ok = true
t = e.Value.(*stackElement[T]).val
}
return
}
func (s *UnsafeCompressedStack[T]) Size() int {
return s.count
}
func (s *UnsafeCompressedStack[T]) Empty() bool {
//return s.elements.Len() == 0
return s.count == 0
}
func (s *UnsafeCompressedStack[T]) Clear() {
s.elements.Init()
}
type uint32Node struct {
prev *uint32Node
ele uint64 // 高32位 val,低32位 count
extra uintptr
}
var nodePool = &sync.Pool{New: func() any { return &uint32Node{} }}
type UnsafeUint32Stack struct {
tail *uint32Node
}
func NewUnsafeUint32Stack() *UnsafeUint32Stack {
return &UnsafeUint32Stack{}
}
func (u *UnsafeUint32Stack) Push(val uint32) (newElem bool) {
if u.tail != nil {
if uint32(u.tail.ele>>32) == val {
// same
u.tail.ele += 1
return false
}
}
n := nodePool.Get().(*uint32Node)
n.ele = uint64(val)<<32 | 1
n.prev = u.tail
u.tail = n
return true
}
func (u *UnsafeUint32Stack) Pop() (val uint32, suc bool) {
val, _, suc = u.PopWithExtra()
return
}
func (u *UnsafeUint32Stack) PopWithExtra() (val uint32, extra uintptr, suc bool) {
if u.tail == nil {
return 0, 0, false
}
val = uint32(u.tail.ele >> 32)
extra = u.tail.extra
if uint32(u.tail.ele) == 1 {
// real pop
top := u.tail
u.tail = top.prev
nodePool.Put(top)
} else {
u.tail.ele--
}
suc = true
return
}
func (u *UnsafeUint32Stack) Top() (val uint32, suc bool) {
val, _, suc = u.TopWithExtra()
return
}
func (u *UnsafeUint32Stack) TopWithExtra() (val uint32, extra uintptr, suc bool) {
if u.tail == nil {
return 0, 0, false
}
return uint32(u.tail.ele >> 32), u.tail.extra, true
}
func (u *UnsafeUint32Stack) Size() int {
panic("unsupported")
}
func (u *UnsafeUint32Stack) Empty() bool {
return u.tail == nil
}
func (u *UnsafeUint32Stack) Clear() {
// fast clear
u.tail = nil
}
func (u *UnsafeUint32Stack) SetTopExtra(extra uintptr) {
if u.tail != nil {
u.tail.extra = extra
}
}
func (u *UnsafeUint32Stack) GetTopExtra() uintptr {
if u.tail != nil {
return u.tail.extra
}
return 0
}