pkg/fuzzer/queue: simplify the priority queue

We don't need the full priority queue functionality anymore. For our
purposes it's enough to only enforce the order between the elements of
different sub-queues.

1 files changed, 9 insertions, 8 deletions

diff --git a/pkg/fuzzer/queue/queue_test.go b/pkg/fuzzer/queue/queue_test.go
index 34a34ccbe..a89ec0d3d 100644
--- a/pkg/fuzzer/queue/queue_test.go
+++ b/pkg/fuzzer/queue/queue_test.go
@@ -36,19 +36,20 @@ func TestPlainQueue(t *testing.T) {
 func TestPrioQueue(t *testing.T) {
 	req1, req2, req3, req4 :=
 		&Request{}, &Request{}, &Request{}, &Request{}
-	pq := Priority()
+	pq := DynamicOrder()
 
-	pq1 := pq.AppendQueue()
-	pq2 := pq.AppendQueue()
-	pq3 := pq.AppendQueue()
+	pq1 := pq.Append()
+	pq2 := pq.Append()
+	pq3 := pq.Append()
 
 	pq2.Submit(req2)
 	pq3.Submit(req3)
-	pq3.Submit(req4)
-	pq1.Submit(req1)
+	assert.Equal(t, req2, pq.Next())
 
+	pq1.Submit(req1)
 	assert.Equal(t, req1, pq.Next())
-	assert.Equal(t, req2, pq.Next())
-	assert.Equal(t, req3, pq.Next())
+
+	pq2.Submit(req4)
 	assert.Equal(t, req4, pq.Next())
+	assert.Equal(t, req3, pq.Next())
 }