-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathqueue_test.go
123 lines (107 loc) · 2.86 KB
/
queue_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
package pubsub
import (
"testing"
"testing/quick"
)
func TestQueueLen(t *testing.T) {
t.Parallel()
t.Run("empty", func(t *testing.T) {
q := NewQueue()
if expected, actual := 0, q.Len(); expected != actual {
t.Errorf("expected: %d, actual: %d", expected, actual)
}
})
t.Run("push node", func(t *testing.T) {
q := NewQueue()
q.Push(Node{})
if expected, actual := 1, q.Len(); expected != actual {
t.Errorf("expected: %d, actual: %d", expected, actual)
}
})
t.Run("push multiple nodes", func(t *testing.T) {
q := NewQueue()
for i := 0; i < 10; i++ {
q.Push(Node{})
if expected, actual := i+1, q.Len(); expected != actual {
t.Errorf("expected: %d, actual: %d", expected, actual)
}
}
})
t.Run("push and pop", func(t *testing.T) {
q := NewQueue()
for i := 0; i < 10; i++ {
q.Push(Node{})
if expected, actual := i+1, q.Len(); expected != actual {
t.Errorf("expected: %d, actual: %d", expected, actual)
}
}
_, ok := q.Pop()
if expected, actual := false, ok; expected != actual {
t.Errorf("expected: %v, actual: %v", expected, actual)
}
if expected, actual := 9, q.Len(); expected != actual {
t.Errorf("expected: %d, actual: %d", expected, actual)
}
index := q.Len() - 1
for _, ok := q.Pop(); !ok; _, ok = q.Pop() {
if expected, actual := index, q.Len(); expected != actual {
t.Errorf("expected: %d, actual: %d", expected, actual)
}
index--
}
if expected, actual := 0, q.Len(); expected != actual {
t.Errorf("expected: %d, actual: %d", expected, actual)
}
})
}
func TestQueuePop(t *testing.T) {
t.Parallel()
t.Run("empty", func(t *testing.T) {
q := NewQueue()
node, ok := q.Pop()
if expected, actual := true, ok; expected != actual {
t.Errorf("expected: %v, actual: %v", expected, actual)
}
if expected, actual := node.event, (Event{}); expected != actual {
t.Errorf("expected: %v, actual: %v", expected, actual)
}
})
}
func TestQueuePushReturnsValidNode(t *testing.T) {
f := func(topic string, payload string) bool {
q := NewQueue()
if expected, actual := 0, q.Len(); expected != actual {
t.Errorf("expected: %d, actual: %d", expected, actual)
}
node := Node{
event: Event{
topic: topic,
payload: payload,
},
}
q.Push(node)
if expected, actual := 1, q.Len(); expected != actual {
t.Errorf("expected: %d, actual: %d", expected, actual)
}
other, ok := q.Pop()
return !ok && node.event == other.event
}
if err := quick.Check(f, nil); err != nil {
t.Error(err)
}
}
func TestQueuePushAmountHasValidLen(t *testing.T) {
f := func(amount uint8) bool {
q := NewQueue()
if expected, actual := 0, q.Len(); expected != actual {
t.Errorf("expected: %d, actual: %d", expected, actual)
}
for i := 0; i < int(amount); i++ {
q.Push(Node{})
}
return int(amount) == q.Len()
}
if err := quick.Check(f, nil); err != nil {
t.Error(err)
}
}