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
|
package xheap
import (
"testing"
"github.com/bradenaw/juniper/internal/require2"
"github.com/bradenaw/juniper/iterator"
"github.com/bradenaw/juniper/xsort"
)
func FuzzHeap(f *testing.F) {
f.Fuzz(func(t *testing.T, b1 []byte, b2 []byte) {
t.Logf("initial: %#v", b1)
t.Logf("pushed: %#v", b2)
h := New(xsort.OrderedLess[byte], append([]byte{}, b1...))
for i := range b2 {
h.Push(b2[i])
}
outByIterate := iterator.Collect(h.Iterate())
xsort.Slice(outByIterate, xsort.OrderedLess[byte])
if outByIterate == nil {
outByIterate = []byte{}
}
outByPop := []byte{}
for h.Len() > 0 {
item := h.Pop()
outByPop = append(outByPop, item)
}
expected := append(append([]byte{}, b1...), b2...)
t.Logf("expected: %#v", expected)
xsort.Slice(expected, xsort.OrderedLess[byte])
t.Logf("expected sorted: %#v", expected)
require2.SlicesEqual(t, expected, outByPop)
require2.SlicesEqual(t, expected, outByIterate)
})
}
func FuzzPriorityQueue(f *testing.F) {
const (
Update = iota
Pop
Peek
Contains
Priority
Remove
Iterate
)
f.Fuzz(func(t *testing.T, b1 []byte, b2 []byte) {
initial := make([]KP[int, float32], 0, len(b1))
oracle := make(map[int]float32)
for i := range b1 {
k := int((b1[i] & 0b00011100) >> 2)
p := float32((b1[i] & 0b00000011))
_, ok := oracle[k]
if ok {
continue
}
initial = append(initial, KP[int, float32]{k, p})
oracle[k] = p
}
t.Logf("initial: %#v", initial)
t.Logf("initial oracle: %#v", oracle)
h := NewPriorityQueue(xsort.OrderedLess[float32], initial)
oracleLowestP := func() float32 {
first := true
lowest := float32(0)
for _, p := range oracle {
if first || p < lowest {
lowest = p
}
first = false
}
return lowest
}
for _, b := range b2 {
op := (b & 0b11100000) >> 5
k := int((b & 0b00011100) >> 2)
p := float32(b & 0b00000011)
switch op {
case Update:
t.Logf("Update(%d, %f)", k, p)
oracle[k] = p
h.Update(k, p)
case Pop:
t.Logf("Pop()")
if len(oracle) == 0 {
require2.Equal(t, 0, h.Len())
continue
}
lowestP := oracleLowestP()
hPopped := h.Pop()
require2.Equal(t, lowestP, oracle[hPopped])
delete(oracle, hPopped)
case Peek:
t.Logf("Peek()")
if len(oracle) == 0 {
require2.Equal(t, 0, h.Len())
continue
}
lowestP := oracleLowestP()
hPeeked := h.Peek()
require2.Equal(t, lowestP, oracle[hPeeked])
case Contains:
t.Logf("Contains(%d)", k)
_, oracleContains := oracle[k]
require2.Equal(t, oracleContains, h.Contains(k))
case Priority:
t.Logf("Priority(%d)", k)
require2.Equal(t, oracle[k], h.Priority(k))
case Remove:
t.Logf("Remove(%d)", k)
delete(oracle, k)
h.Remove(k)
case Iterate:
t.Logf("Iterate()")
oracleItems := make([]int, 0, len(oracle))
for k := range oracle {
oracleItems = append(oracleItems, k)
}
items := iterator.Collect(h.Iterate())
require2.ElementsMatch(t, oracleItems, items)
}
require2.Equal(t, len(oracle), h.Len())
}
})
}
|
