-
Notifications
You must be signed in to change notification settings - Fork 1
/
queue.go
102 lines (88 loc) · 1.89 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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
package queue
import (
"container/list"
"reflect"
"sync"
"time"
or "github.com/fwtpe/owl-backend/common/reflect"
"github.com/fwtpe/owl-backend/common/utils"
)
type Config struct {
Num int
Dur time.Duration
}
type Queue struct {
l *list.List // not thead safe
mutex *sync.Mutex
}
func New() *Queue {
return &Queue{
l: list.New(),
mutex: &sync.Mutex{},
}
}
func (q *Queue) Enqueue(v interface{}) {
q.mutex.Lock()
defer q.mutex.Unlock()
q.l.PushBack(v)
}
func (q *Queue) DrainNWithDuration(c *Config) []interface{} {
result := make([]interface{}, 0)
haveWaited := false
config := *c
for config.Num > 0 {
batchResult := q.dequeueN(config.Num)
config.Num -= len(batchResult)
/**
* Waiting and fetch next batch of data.
*
* If the next batch is still nothing after waiting, stop fetching process.
*/
if len(batchResult) == 0 {
if haveWaited {
break
}
haveWaited = true
if config.Dur > time.Duration(0) {
time.Sleep(config.Dur)
}
continue
}
// :~)
haveWaited = false
result = append(result, batchResult...)
}
return result
}
func (q *Queue) DrainNWithDurationByType(c *Config, eleValue interface{}) interface{} {
return q.DrainNWithDurationByReflectType(c, or.TypeOfValue(eleValue))
}
func (q *Queue) DrainNWithDurationByReflectType(c *Config, eleType reflect.Type) interface{} {
return utils.MakeAbstractArray(
q.DrainNWithDuration(c),
).
MapTo(
func(v interface{}) interface{} {
return reflect.ValueOf(v).Convert(eleType).Interface()
},
eleType,
).GetArray()
}
func (q *Queue) Len() int {
return q.l.Len()
}
// DequeueN dequeues UP TO N elements.
func (q *Queue) dequeueN(num int) []interface{} {
q.mutex.Lock()
defer q.mutex.Unlock()
elems := make([]interface{}, 0, num)
for i := 0; i < num; i++ {
e := q.l.Front()
if e == nil {
break
}
q.l.Remove(e)
elems = append(elems, e.Value)
}
return elems
}