-
-
Notifications
You must be signed in to change notification settings - Fork 17
/
queue.go
81 lines (72 loc) · 1.52 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
81
package queue
import (
"container/list"
"fmt"
"sync"
"github.com/panjf2000/ants/v2"
)
// Queue representation of task queue.
type Queue struct {
goPool *ants.Pool
limit int
mutex sync.Mutex
queue *list.List
oneworkerQueue sync.Map
}
// New creates task queue which is processed by goroutines.
func New(cfg Config) (*Queue, error) {
if cfg.Size <= 0 {
return nil, fmt.Errorf("invalid value of Size")
}
p, err := ants.NewPool(cfg.GoPoolSize, ants.WithPreAlloc(true), ants.WithExpiryDuration(cfg.MaxIdleTime), ants.WithNonblocking(true))
if err != nil {
return nil, err
}
return &Queue{
queue: list.New(),
goPool: p,
limit: cfg.Size,
}, nil
}
func (q *Queue) appendQueue(tasks []func()) error {
q.mutex.Lock()
defer q.mutex.Unlock()
if q.queue.Len()+len(tasks) > q.limit {
return fmt.Errorf("reached limit of max processed jobs")
}
for _, t := range tasks {
q.queue.PushBack(t)
}
return nil
}
func (q *Queue) popQueue() func() {
q.mutex.Lock()
defer q.mutex.Unlock()
if q.queue.Len() == 0 {
return nil
}
return q.queue.Remove(q.queue.Front()).(func())
}
// Submit appends and execute task by Queue.
func (q *Queue) Submit(tasks ...func()) error {
if err := q.appendQueue(tasks); err != nil {
return err
}
_ = q.goPool.Submit(func() {
for {
task := q.popQueue()
if task == nil {
return
}
task()
}
})
return nil
}
// Release closes queue and release it.
func (q *Queue) Release() {
q.goPool.Release()
q.mutex.Lock()
defer q.mutex.Unlock()
q.queue.Init()
}