-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathqueue.go
62 lines (52 loc) · 1.06 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
package gmars
import "fmt"
type processQueue struct {
queue []Address
size Address
length Address
start Address
end Address
}
func newProcessQueue(size Address) *processQueue {
queue := make([]Address, size)
return &processQueue{
queue: queue,
size: size,
}
}
func (q *processQueue) Len() Address {
return q.length
}
func (q *processQueue) Push(a Address) {
if q.length >= q.size {
return
}
q.queue[q.end] = a
q.end = (q.end + 1) % q.size
q.length++
}
func (q *processQueue) Pop() (Address, error) {
if q.length == 0 {
return 0, fmt.Errorf("pull from empty queue")
}
val := q.queue[q.start]
q.start = (q.start + 1) % q.size
q.length--
return val, nil
}
func (q *processQueue) get(n Address) Address {
return q.queue[(q.start+n)%q.size]
}
func (q *processQueue) Values() []Address {
dat := make([]Address, q.Len())
for i := Address(0); i < q.Len(); i++ {
dat[i] = q.get(i)
}
return dat
}
func (q *processQueue) Next() (Address, error) {
if q.length == 0 {
return 0, fmt.Errorf("process queue is empty")
}
return q.get(0), nil
}