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
package queue
//环形队列
import (
"container/list"
"fmt"
"sync"
)
type CircularLinked struct {
data *list.List
}
var lock1 sync.Mutex
var _ *CircularLinked
func (q *CircularLinked) Push(v interface{}) {
defer lock1.Unlock()
lock1.Lock()
q.data.PushFront(v)
}
func (q *CircularLinked) Pop() interface{} {
defer lock1.Unlock()
lock1.Lock()
iter := q.data.Back()
v := iter.Value
q.data.Remove(iter)
return v
}
//读取第一个元素后,把它移到队列尾
func (q *CircularLinked) Front() *list.Element {
defer lock1.Unlock()
lock1.Lock()
iter := q.data.Front()
q.data.Remove(iter)
if iter != nil {
//q.data.MoveToBack(iter)
q.data.PushBack(iter.Value.(string))
}
return iter
}
//移除元素
func (q *CircularLinked) Remove(iter *list.Element) {
defer lock1.Unlock()
lock1.Lock()
if iter != nil {
q.data.Remove(iter)
}
}
func (q *CircularLinked) Len() int {
return q.data.Len()
}
func (q *CircularLinked) Dump() {
for iter := q.data.Back(); iter != nil; iter = iter.Prev() {
fmt.Println("item:", iter.Value)
}
}