-
Notifications
You must be signed in to change notification settings - Fork 0
/
queue_mem.go
68 lines (57 loc) · 941 Bytes
/
queue_mem.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
package ziva
import (
"fmt"
"sync"
)
type MemQueue struct {
mu *sync.Mutex
list []*Task
}
func NewMemQueue() TodoQueue {
return &MemQueue{
list: make([]*Task, 0),
mu: &sync.Mutex{},
}
}
func (m *MemQueue) Add(task *Task) {
m.mu.Lock()
defer m.mu.Unlock()
m.list = append(m.list, task)
}
func (m *MemQueue) AddTasks(list []*Task) {
m.mu.Lock()
defer m.mu.Unlock()
m.list = append(m.list, list...)
}
func (m *MemQueue) Pop() *Task {
m.mu.Lock()
defer m.mu.Unlock()
if m.IsEmpty() {
return nil
}
first := m.list[0]
m.list = m.list[1:]
return first
}
func (m *MemQueue) Clear() bool {
if m.IsEmpty() {
return false
}
for i := 0; i < m.Size(); i++ {
m.list[i].Url = ""
}
m.list = nil
return true
}
func (m *MemQueue) Size() int {
return len(m.list)
}
func (m *MemQueue) IsEmpty() bool {
if len(m.list) == 0 {
return true
}
return false
}
func (m *MemQueue) Print() {
fmt.Println(m.list)
}