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
|
package xlist
import (
"testing"
"github.com/bradenaw/juniper/internal/fuzz"
"github.com/bradenaw/juniper/internal/require2"
"github.com/bradenaw/juniper/xslices"
)
func FuzzList(f *testing.F) {
f.Fuzz(func(t *testing.T, b []byte) {
var l List[int]
var oracle []int
nodeAt := func(i int) *Node[int] {
j := 0
curr := l.Front()
for j < i {
curr = curr.Next()
j++
}
return curr
}
fuzz.Operations(
b,
func() { // check
t.Logf("%v", oracle)
require2.Equal(t, len(oracle), l.Len())
if len(oracle) == 0 {
require2.Nil(t, l.Front())
require2.Nil(t, l.Back())
return
}
node := l.Front()
for i := range oracle {
require2.NotNilf(t, node, "node nil at index %d, len(oracle)==%d", i, len(oracle))
require2.Equal(t, oracle[i], node.Value)
if node.Next() != nil {
require2.Equal(t, node, node.Next().Prev())
}
node = node.Next()
}
require2.Nil(t, node)
require2.NotNil(t, l.Back())
require2.Equal(t, oracle[len(oracle)-1], l.Back().Value)
},
func(value int) {
t.Logf("PushFront(%d)", value)
l.PushFront(value)
oracle = append([]int{value}, oracle...)
},
func(value int) {
t.Logf("PushBack(%d)", value)
l.PushBack(value)
oracle = append(oracle, value)
},
func(value int, idx int) {
if len(oracle) == 0 || idx < 0 {
return
}
idx = idx % len(oracle)
t.Logf("InsertBefore(%d, node @ %d)", value, idx)
l.InsertBefore(value, nodeAt(idx))
oracle = xslices.Insert(oracle, idx, value)
},
func(value int, idx int) {
if len(oracle) == 0 || idx < 0 {
return
}
idx = idx % len(oracle)
t.Logf("InsertAfter(%d, node @ %d)", value, idx)
l.InsertAfter(value, nodeAt(idx))
oracle = xslices.Insert(oracle, idx+1, value)
},
func(idx int) {
if len(oracle) == 0 || idx < 0 {
return
}
idx = idx % len(oracle)
t.Logf("Remove(node @ %d)", idx)
l.Remove(nodeAt(idx))
oracle = xslices.Remove(oracle, idx, 1)
},
func(src, dest int) {
if len(oracle) == 0 || src < 0 || dest < 0 {
return
}
src = src % len(oracle)
dest = dest % len(oracle)
t.Logf("MoveBefore(node @ %d, node @ %d)", src, dest)
l.MoveBefore(nodeAt(src), nodeAt(dest))
item := oracle[src]
oracle = xslices.Remove(oracle, src, 1)
if dest > src {
dest--
}
oracle = xslices.Insert(oracle, dest, item)
},
func(src, dest int) {
if len(oracle) == 0 || src < 0 || dest < 0 {
return
}
src = src % len(oracle)
dest = dest % len(oracle)
t.Logf("MoveAfter(node @ %d, node @ %d)", src, dest)
l.MoveAfter(nodeAt(src), nodeAt(dest))
item := oracle[src]
oracle = xslices.Remove(oracle, src, 1)
if dest >= src {
dest--
}
oracle = xslices.Insert(oracle, dest+1, item)
},
func(idx int) {
if len(oracle) == 0 || idx < 0 {
return
}
idx = idx % len(oracle)
t.Logf("MoveToFront(node @ %d)", idx)
l.MoveToFront(nodeAt(idx))
item := oracle[idx]
oracle = xslices.Remove(oracle, idx, 1)
oracle = append([]int{item}, oracle...)
},
func(idx int) {
if len(oracle) == 0 || idx < 0 {
return
}
idx = idx % len(oracle)
t.Logf("MoveToBack(node @ %d)", idx)
l.MoveToBack(nodeAt(idx))
item := oracle[idx]
oracle = xslices.Remove(oracle, idx, 1)
oracle = append(oracle, item)
},
)
})
}
|
