-
Notifications
You must be signed in to change notification settings - Fork 1
/
queue_callbacks_test.go
145 lines (121 loc) · 2.87 KB
/
queue_callbacks_test.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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
package eventbus
import (
"sync"
"testing"
"time"
)
func TestQueueCallbacks_start(t *testing.T) {
queue := NewQueue(2)
queue.start()
isDone := false
queue.Set(func() {
isDone = true
})
time.Sleep(time.Millisecond * 1)
if !isDone {
t.Error("QueueCallbacks.start() dosen't start the consumer")
}
}
func TestQueueCallbacks_WaitingCallbacks(t *testing.T) {
type fields struct {
isRunning bool
startOnce sync.Once
waitingCallbacks uint32
queue []FnCallback
mtx *sync.Mutex
runnerFn *PorcessFn
}
tests := []struct {
name string
fields fields
want uint32
}{
{
name: "Same as underline waintingCallbacks uint32",
fields: fields{
waitingCallbacks: 1,
},
want: 1,
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
q := &QueueCallbacks{
isRunning: tt.fields.isRunning,
startOnce: tt.fields.startOnce,
waitingCallbacks: tt.fields.waitingCallbacks,
queue: tt.fields.queue,
mtx: tt.fields.mtx,
runnerFn: tt.fields.runnerFn,
}
if got := q.WaitingCallbacks(); got != tt.want {
t.Errorf("QueueCallbacks.WaitingCallbacks() = %v, want %v", got, tt.want)
}
})
}
}
func TestQueueCallbacks_resetQueue(t *testing.T) {
type fields struct {
isRunning bool
startOnce sync.Once
waitingCallbacks uint32
queue []FnCallback
mtx *sync.Mutex
runnerFn *PorcessFn
}
tests := []struct {
name string
fields fields
}{
{
name: "Dosen't panic",
fields: fields{},
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
q := &QueueCallbacks{
isRunning: tt.fields.isRunning,
startOnce: tt.fields.startOnce,
waitingCallbacks: tt.fields.waitingCallbacks,
queue: tt.fields.queue,
mtx: tt.fields.mtx,
runnerFn: tt.fields.runnerFn,
}
q.resetQueue()
})
}
}
func TestQueueCallbacks_fitOrExtand(t *testing.T) {
q := NewQueue(2)
lenQ := len(q.queue)
q.fitOrExtand(func() {})
if lenQ != len(q.queue) {
t.Error("QueueCallbacks.fitOrExtand() extands queue when is not necessary")
}
for i := 0; i < lenQ; i++ {
q.fitOrExtand(func() {})
}
if lenQ >= len(q.queue) {
t.Error("QueueCallbacks.fitOrExtand() dosen't extands queue when is not necessary")
}
}
func TestQueueCallbacks_Set(t *testing.T) {
queue := NewQueue(2)
queue.Set(func() {
})
if queue.WaitingCallbacks() != 1 {
t.Error("QueueCallbacks.Set() dosen't increase the number of waitingCallbacks correctly")
}
for i := range queue.queue {
if queue.queue[i] != nil {
return
}
}
t.Error("QueueCallbacks.Set() dosen't append the FnCallback to the underline slice of callbacks")
}
func TestNewQueue(t *testing.T) {
if got := NewQueue(1); got == nil {
t.Errorf("NewQueue() got nil")
}
}