generated from ipfs/ipfs-repository-template
-
Notifications
You must be signed in to change notification settings - Fork 4
/
queue.go
81 lines (70 loc) · 1.5 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 event
import (
"context"
)
type EventQueue interface {
Enqueue(context.Context, Action)
Dequeue(context.Context) Action
Size() uint
Close()
}
type EventQueueEnqueueMany interface {
EventQueue
EnqueueMany(context.Context, []Action)
}
func EnqueueMany(ctx context.Context, q EventQueue, actions []Action) {
switch queue := q.(type) {
case EventQueueEnqueueMany:
queue.EnqueueMany(ctx, actions)
default:
for _, a := range actions {
q.Enqueue(ctx, a)
}
}
}
type EventQueueDequeueMany interface {
DequeueMany(context.Context, int) []Action
}
func DequeueMany(ctx context.Context, q EventQueue, n int) []Action {
switch queue := q.(type) {
case EventQueueDequeueMany:
return queue.DequeueMany(ctx, n)
default:
actions := make([]Action, 0, n)
for i := 0; i < n; i++ {
if a := q.Dequeue(ctx); a != nil {
actions = append(actions, a)
} else {
break
}
}
return actions
}
}
type EventQueueDequeueAll interface {
DequeueAll(context.Context) []Action
}
func DequeueAll(ctx context.Context, q EventQueue) []Action {
switch queue := q.(type) {
case EventQueueDequeueAll:
return queue.DequeueAll(ctx)
default:
actions := make([]Action, 0, q.Size())
for a := q.Dequeue(ctx); a != nil; a = q.Dequeue(ctx) {
actions = append(actions, a)
}
return actions
}
}
type EventQueueWithEmpty interface {
EventQueue
Empty() bool
}
func Empty(q EventQueue) bool {
switch queue := q.(type) {
case EventQueueWithEmpty:
return queue.Empty()
default:
return q.Size() == 0
}
}