/
queue.go
80 lines (70 loc) · 1.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
package fafnir
import (
"fmt"
"sort"
"sync"
)
var (
ErrEmptyQueue = fmt.Errorf("Queue is empty")
ErrQueueNotFound = fmt.Errorf("Queue doesn't exist")
)
type QueueRepository interface {
Fetch() ([]*Queue, error)
Create(string) error
Delete(string) error
Get(string, chan error) (*Queue, error)
}
type Queue struct {
Name string
Entries []Entry
FailedEntries []Entry
mu sync.Mutex
}
func NewQueue(name string) *Queue {
return &Queue{
Name: name,
}
}
func (q *Queue) EnQueue(e Entry) error {
q.mu.Lock()
defer q.mu.Unlock()
q.Entries = append(q.Entries, e)
return nil
}
func (q *Queue) DeQueue() (Entry, error) {
q.mu.Lock()
defer q.mu.Unlock()
if len(q.Entries) == 0 {
return Entry{}, ErrEmptyQueue
}
e := q.Entries[0]
q.Entries = q.Entries[1:]
return e, nil
}
func (q *Queue) EnQueueFail(e Entry) error {
q.mu.Lock()
defer q.mu.Unlock()
q.FailedEntries = append(q.FailedEntries, e)
return nil
}
func (q *Queue) DeQueueFail() (Entry, error) {
q.mu.Lock()
defer q.mu.Unlock()
if len(q.FailedEntries) == 0 {
return Entry{}, ErrEmptyQueue
}
e := q.FailedEntries[0]
q.FailedEntries = q.FailedEntries[1:]
return e, nil
}
func (q *Queue) SortByName(descending bool) {
if descending {
sort.Slice(q.Entries, func(i, j int) bool {
return sortName(q.Entries[i].Filename) > sortName(q.Entries[j].Filename)
})
} else {
sort.Slice(q.Entries, func(i, j int) bool {
return sortName(q.Entries[i].Filename) < sortName(q.Entries[j].Filename)
})
}
}