-
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlock_free_queue_fuzz_test.go
More file actions
75 lines (60 loc) · 1.58 KB
/
lock_free_queue_fuzz_test.go
File metadata and controls
75 lines (60 loc) · 1.58 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
package lockfreequeue
import (
"testing"
"github.com/stretchr/testify/assert"
"github.com/stretchr/testify/require"
)
// FuzzNewLockFreeQ verifies that a newly created queue is empty and can accept a value.
func FuzzNewLockFreeQ(f *testing.F) {
f.Add(1)
f.Fuzz(func(t *testing.T, seed int) {
q := NewLockFreeQ[int]()
require.NotNil(t, q)
assert.True(t, q.IsEmpty())
q.Enqueue(seed)
assert.False(t, q.IsEmpty())
val := q.Dequeue()
require.NotNil(t, val)
assert.Equal(t, seed, *val)
})
}
// FuzzLockFreeQEnqueue ensures that enqueued values are returned in order.
func FuzzLockFreeQEnqueue(f *testing.F) {
f.Add(0)
f.Add(123)
f.Fuzz(func(t *testing.T, v int) {
q := NewLockFreeQ[int]()
q.Enqueue(v)
val := q.Dequeue()
require.NotNil(t, val)
assert.Equal(t, v, *val)
})
}
// FuzzLockFreeQDequeue confirms dequeue returns values in FIFO order and nil when empty.
func FuzzLockFreeQDequeue(f *testing.F) {
f.Add(1, 2)
f.Fuzz(func(t *testing.T, first, second int) {
q := NewLockFreeQ[int]()
q.Enqueue(first)
q.Enqueue(second)
val1 := q.Dequeue()
require.NotNil(t, val1)
assert.Equal(t, first, *val1)
val2 := q.Dequeue()
require.NotNil(t, val2)
assert.Equal(t, second, *val2)
assert.Nil(t, q.Dequeue())
})
}
// FuzzLockFreeQIsEmpty checks the IsEmpty logic across enqueue and dequeue cycles.
func FuzzLockFreeQIsEmpty(f *testing.F) {
f.Add(10)
f.Fuzz(func(t *testing.T, v int) {
q := NewLockFreeQ[int]()
assert.True(t, q.IsEmpty())
q.Enqueue(v)
assert.False(t, q.IsEmpty())
require.NotNil(t, q.Dequeue())
assert.True(t, q.IsEmpty())
})
}