-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathpriorityqueue_test.go
More file actions
267 lines (231 loc) · 5.74 KB
/
Copy pathpriorityqueue_test.go
File metadata and controls
267 lines (231 loc) · 5.74 KB
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
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
package priorityqueue_test
import (
"context"
"sync"
"testing"
"time"
"github.com/azghr/forge/priorityqueue"
)
func TestMinHeap(t *testing.T) {
t.Parallel()
t.Run("basic ordering", func(t *testing.T) {
pq := priorityqueue.New[int]()
pq.Push(priorityqueue.Item[int]{Value: 1, Priority: 2})
pq.Push(priorityqueue.Item[int]{Value: 2, Priority: 1})
it, ok := pq.Pop()
if !ok || it.Value != 2 {
t.Errorf("expected 2 first (priority 1), got %+v", it)
}
it, ok = pq.Pop()
if !ok || it.Value != 1 {
t.Errorf("expected 1 second, got %+v", it)
}
_, ok = pq.Pop()
if ok {
t.Error("expected empty")
}
})
t.Run("FIFO for equal priority", func(t *testing.T) {
pq := priorityqueue.New[string]()
pq.Push(priorityqueue.Item[string]{Value: "first", Priority: 1})
pq.Push(priorityqueue.Item[string]{Value: "second", Priority: 1})
it, _ := pq.Pop()
if it.Value != "first" {
t.Errorf("expected first, got %s", it.Value)
}
})
t.Run("many items ascending", func(t *testing.T) {
n := 1000
pq := priorityqueue.New[int]()
for i := range n {
pq.Push(priorityqueue.Item[int]{Value: i, Priority: i})
}
for i := range n {
it, ok := pq.Pop()
if !ok || it.Value != i {
t.Fatalf("at %d: expected %d, got %d", i, i, it.Value)
}
}
})
t.Run("many items descending", func(t *testing.T) {
n := 1000
pq := priorityqueue.New[int]()
for i := n - 1; i >= 0; i-- {
pq.Push(priorityqueue.Item[int]{Value: i, Priority: i})
}
for i := range n {
it, ok := pq.Pop()
if !ok || it.Value != i {
t.Fatalf("at %d: expected %d, got %d", i, i, it.Value)
}
}
})
t.Run("pop empty returns false", func(t *testing.T) {
pq := priorityqueue.New[int]()
_, ok := pq.Pop()
if ok {
t.Error("expected false from empty queue")
}
})
t.Run("len", func(t *testing.T) {
pq := priorityqueue.New[string]()
if pq.Len() != 0 {
t.Errorf("initial Len = %d, want 0", pq.Len())
}
pq.Push(priorityqueue.Item[string]{Value: "a", Priority: 1})
if pq.Len() != 1 {
t.Errorf("after push Len = %d, want 1", pq.Len())
}
pq.Pop()
if pq.Len() != 0 {
t.Errorf("after pop Len = %d, want 0", pq.Len())
}
})
}
func TestMaxHeap(t *testing.T) {
t.Parallel()
t.Run("max ordering", func(t *testing.T) {
pq := priorityqueue.New[string](priorityqueue.WithMaxHeap())
pq.Push(priorityqueue.Item[string]{Value: "low", Priority: 1})
pq.Push(priorityqueue.Item[string]{Value: "high", Priority: 10})
pq.Push(priorityqueue.Item[string]{Value: "mid", Priority: 5})
it, _ := pq.Pop()
if it.Value != "high" {
t.Errorf("expected high first (priority 10), got %s", it.Value)
}
it, _ = pq.Pop()
if it.Value != "mid" {
t.Errorf("expected mid second (priority 5), got %s", it.Value)
}
it, _ = pq.Pop()
if it.Value != "low" {
t.Errorf("expected low last (priority 1), got %s", it.Value)
}
})
t.Run("same priorities", func(t *testing.T) {
pq := priorityqueue.New[string](priorityqueue.WithMaxHeap())
pq.Push(priorityqueue.Item[string]{Value: "a", Priority: 1})
pq.Push(priorityqueue.Item[string]{Value: "b", Priority: 1})
it, _ := pq.Pop()
if it.Value != "a" {
t.Errorf("expected a, got %s", it.Value)
}
})
t.Run("many items max", func(t *testing.T) {
n := 1000
pq := priorityqueue.New[int](priorityqueue.WithMaxHeap())
for i := range n {
pq.Push(priorityqueue.Item[int]{Value: i, Priority: i})
}
for i := n - 1; i >= 0; i-- {
it, ok := pq.Pop()
if !ok || it.Value != i {
t.Fatalf("expected %d, got %d", i, it.Value)
}
}
})
}
func TestPopContext(t *testing.T) {
t.Parallel()
t.Run("immediate value", func(t *testing.T) {
ctx := context.Background()
pq := priorityqueue.New[int]()
pq.Push(priorityqueue.Item[int]{Value: 99, Priority: 1})
it, ok := pq.PopContext(ctx)
if !ok || it.Value != 99 {
t.Errorf("expected 99, got %+v (ok=%v)", it, ok)
}
})
t.Run("block until push", func(t *testing.T) {
ctx := context.Background()
pq := priorityqueue.New[int]()
var wg sync.WaitGroup
wg.Add(1)
go func() {
defer wg.Done()
time.Sleep(10 * time.Millisecond)
pq.Push(priorityqueue.Item[int]{Value: 42, Priority: 1})
}()
it, ok := pq.PopContext(ctx)
if !ok || it.Value != 42 {
t.Errorf("expected 42, got %+v (ok=%v)", it, ok)
}
wg.Wait()
})
t.Run("context cancelled", func(t *testing.T) {
ctx, cancel := context.WithCancel(context.Background())
cancel()
pq := priorityqueue.New[int]()
_, ok := pq.PopContext(ctx)
if ok {
t.Error("expected false on cancelled context")
}
})
t.Run("context timeout", func(t *testing.T) {
ctx, cancel := context.WithTimeout(context.Background(), 20*time.Millisecond)
defer cancel()
pq := priorityqueue.New[int]()
_, ok := pq.PopContext(ctx)
if ok {
t.Error("expected false on timeout")
}
})
}
func TestConcurrentSafety(t *testing.T) {
t.Parallel()
pq := priorityqueue.New[int]()
var wg sync.WaitGroup
n := 100
for range 10 {
wg.Add(1)
go func() {
defer wg.Done()
for i := range n {
pq.Push(priorityqueue.Item[int]{Value: i, Priority: i})
}
}()
}
for range 10 {
wg.Add(1)
go func() {
defer wg.Done()
for range n {
pq.Pop()
}
}()
}
for range 5 {
wg.Add(1)
go func() {
defer wg.Done()
for range n {
pq.Len()
}
}()
}
wg.Wait()
}
func BenchmarkPush(b *testing.B) {
pq := priorityqueue.New[int]()
for b.Loop() {
pq.Push(priorityqueue.Item[int]{Value: 1, Priority: 1})
}
}
func BenchmarkPushPop(b *testing.B) {
pq := priorityqueue.New[int]()
for b.Loop() {
pq.Push(priorityqueue.Item[int]{Value: 1, Priority: 1})
pq.Pop()
}
}
func BenchmarkPushPopMany(b *testing.B) {
pq := priorityqueue.New[int]()
for b.Loop() {
for range 100 {
pq.Push(priorityqueue.Item[int]{Value: 1, Priority: 1})
}
for range 100 {
pq.Pop()
}
}
}