-
Notifications
You must be signed in to change notification settings - Fork 0
/
uq_test.go
246 lines (204 loc) · 4.48 KB
/
uq_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
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
package uniqueue_test
import (
"fmt"
"sync"
"sync/atomic"
"testing"
"github.com/munnik/uniqueue"
)
func TestSinglePushAndSinglePop(t *testing.T) {
uq := uniqueue.NewUQ[int](2)
uq.Back() <- 1
got := <-uq.Front()
if got != 1 {
t.Errorf("Expected 1, got %d", got)
}
}
func TestMultiplePushAndSinglePop(t *testing.T) {
var got, expected int
uq := uniqueue.NewUQ[int](2)
uq.Back() <- 1
uq.Back() <- 2
expected = 1
got = <-uq.Front()
if got != expected {
t.Errorf("Expected %d, got %d", expected, got)
}
}
func TestMultiplePushAndMultiplePop(t *testing.T) {
var got, expected int
uq := uniqueue.NewUQ[int](3)
uq.Back() <- 1
uq.Back() <- 2
uq.Back() <- 3
expected = 1
got = <-uq.Front()
if got != expected {
t.Errorf("Expected %d, got %d", expected, got)
}
expected = 2
got = <-uq.Front()
if got != expected {
t.Errorf("Expected %d, got %d", expected, got)
}
uq.Back() <- 4
expected = 3
got = <-uq.Front()
if got != expected {
t.Errorf("Expected %d, got %d", expected, got)
}
expected = 4
got = <-uq.Front()
if got != expected {
t.Errorf("Expected %d, got %d", expected, got)
}
}
func TestChannelClose(t *testing.T) {
var got, expected int
uq := uniqueue.NewUQ[int](5)
wg := sync.WaitGroup{}
wg.Add(1)
var sum int32
go func() {
expected = 1
for got = range uq.Front() {
if got != expected {
t.Errorf("Expected %d, got %d", expected, got)
}
atomic.AddInt32(&sum, int32(expected))
expected += 1
}
wg.Done()
}()
uq.Back() <- 1
uq.Back() <- 2
uq.Back() <- 3
close(uq.Back())
wg.Wait()
if sum != 6 {
t.Errorf("Expected the sum to be 6, got %d", got)
}
}
func TestChannelUniqueness(t *testing.T) {
var got, expected int
uq := uniqueue.NewUQ[int](2)
go func() {
uq.Back() <- 1
uq.Back() <- 2
uq.Back() <- 3
uq.Back() <- 1
uq.Back() <- 1
uq.Back() <- 3
}()
expected = 1
got = <-uq.Front()
if got != expected {
t.Errorf("Expected %d, got %d", expected, got)
}
expected = 2
got = <-uq.Front()
if got != expected {
t.Errorf("Expected %d, got %d", expected, got)
}
expected = 3
got = <-uq.Front()
if got != expected {
t.Errorf("Expected %d, got %d", expected, got)
}
if len(uq.Front()) != 0 {
t.Errorf("Expected empty channel")
}
}
func TestIgnoreConstraint(t *testing.T) {
var got, expected int
uq := uniqueue.NewUQ[int](2)
go func() {
uq.Back() <- 1
uq.Back() <- 2
uq.Back() <- 3
uq.IgnoreConstraintFor(1)
uq.Back() <- 1
uq.Back() <- 1
uq.Back() <- 3
}()
expected = 1
got = <-uq.Front()
if got != expected {
t.Errorf("Expected %d, got %d", expected, got)
}
expected = 2
got = <-uq.Front()
if got != expected {
t.Errorf("Expected %d, got %d", expected, got)
}
expected = 3
got = <-uq.Front()
if got != expected {
t.Errorf("Expected %d, got %d", expected, got)
}
expected = 1
got = <-uq.Front()
if got != expected {
t.Errorf("Expected %d, got %d", expected, got)
}
if len(uq.Front()) != 0 {
t.Errorf("Expected empty channel")
}
}
func TestAutoRemoveConstraint(t *testing.T) {
var got, expected int
uq := uniqueue.NewUQ[int](6)
uq.AutoRemoveConstraint = true
uq.Back() <- 1
uq.Back() <- 2
// this value should not be added because 1 is still on the queue
uq.Back() <- 1
expected = 1
got = <-uq.Front()
if got != expected {
t.Errorf("Expected %d, got %d", expected, got)
}
// now 1 can be added to the queue again because the value is not on the queue anymore
uq.Back() <- 1
expected = 2
got = <-uq.Front()
if got != expected {
t.Errorf("Expected %d, got %d", expected, got)
}
expected = 1
got = <-uq.Front()
if got != expected {
t.Errorf("Expected %d, got %d", expected, got)
}
}
func Example() {
uq := uniqueue.NewUQ[int](2)
go func() {
uq.Back() <- 1
uq.Back() <- 2
uq.Back() <- 3
// these values should not be added because 1 is already on the queue
uq.Back() <- 1
uq.Back() <- 1
// ignore 3 from the unique constraint so it can be added again, once it's added again the unique constraint is enabled again
uq.IgnoreConstraintFor(3)
uq.Back() <- 3
uq.Back() <- 3
// close the back channel of the queue, this will automatically close the front channel
close(uq.Back())
}()
// read the unique values from the queue, when the queue is closed this loop will terminate
for value := range uq.Front() {
fmt.Println(value)
}
// the front channel should be closed when the back channel is closed
if _, ok := <-uq.Front(); !ok {
fmt.Println("The channel is closed")
}
// Output:
// 1
// 2
// 3
// 3
// The channel is closed
}