/
fq.go
86 lines (68 loc) · 1.22 KB
/
fq.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
package queue
import (
"sync"
"github.com/MeteorsLiu/simpleMQ/generic"
)
type FairQueue struct {
sync.RWMutex
cap int
queue *generic.List[Task]
}
func WithFairQueueCap(cap int) Options {
return func(queue Queue) {
queue.Resize(cap)
}
}
func NewFairQueue(opts ...Options) Queue {
fq := &FairQueue{
queue: generic.New[Task](),
}
for _, o := range opts {
o(fq)
}
return fq
}
func (f *FairQueue) Resize(cap int) bool {
return true
}
func (f *FairQueue) Cap() int {
f.RLock()
defer f.RUnlock()
return f.cap
}
func (f *FairQueue) Len() int {
f.RLock()
defer f.RUnlock()
return f.cap
}
func (f *FairQueue) Free() int {
f.RLock()
defer f.RUnlock()
return f.cap
}
func (f *FairQueue) IsClosed() bool {
return false
}
// close wait until all tasks are executed.
func (f *FairQueue) Close() {
}
func (f *FairQueue) Publish(t Task) bool {
return false
}
func (f *FairQueue) ForcePublish(t Task) error {
return nil
}
func (f *FairQueue) Subscribe() (chan Task, error) {
return nil, nil
}
func (f *FairQueue) TryPop() (Task, bool) {
return nil, false
}
func (f *FairQueue) Pop() (Task, error) {
return nil, nil
}
func (f *FairQueue) Copy() []Task {
return nil
}
func (f *FairQueue) Save(_ func(Task)) {
}