|
@@ -13,6 +13,7 @@ import (
|
|
|
"time"
|
|
"time"
|
|
|
|
|
|
|
|
"github.com/d4l3k/messagediff"
|
|
"github.com/d4l3k/messagediff"
|
|
|
|
|
+ "golang.org/x/exp/slices"
|
|
|
)
|
|
)
|
|
|
|
|
|
|
|
func TestJobQueue(t *testing.T) {
|
|
func TestJobQueue(t *testing.T) {
|
|
@@ -282,7 +283,6 @@ func BenchmarkJobQueuePushPopDone10k(b *testing.B) {
|
|
|
q.Done(n)
|
|
q.Done(n)
|
|
|
}
|
|
}
|
|
|
}
|
|
}
|
|
|
-
|
|
|
|
|
}
|
|
}
|
|
|
|
|
|
|
|
func TestQueuePagination(t *testing.T) {
|
|
func TestQueuePagination(t *testing.T) {
|
|
@@ -302,21 +302,21 @@ func TestQueuePagination(t *testing.T) {
|
|
|
progress, queued, skip = q.Jobs(1, 5)
|
|
progress, queued, skip = q.Jobs(1, 5)
|
|
|
if len(progress) != 0 || len(queued) != 5 || skip != 0 {
|
|
if len(progress) != 0 || len(queued) != 5 || skip != 0 {
|
|
|
t.Error("Wrong length", len(progress), len(queued), 0)
|
|
t.Error("Wrong length", len(progress), len(queued), 0)
|
|
|
- } else if !equalStrings(queued, names[:5]) {
|
|
|
|
|
|
|
+ } else if !slices.Equal(queued, names[:5]) {
|
|
|
t.Errorf("Wrong elements in queued, got %v, expected %v", queued, names[:5])
|
|
t.Errorf("Wrong elements in queued, got %v, expected %v", queued, names[:5])
|
|
|
}
|
|
}
|
|
|
|
|
|
|
|
progress, queued, skip = q.Jobs(2, 5)
|
|
progress, queued, skip = q.Jobs(2, 5)
|
|
|
if len(progress) != 0 || len(queued) != 5 || skip != 5 {
|
|
if len(progress) != 0 || len(queued) != 5 || skip != 5 {
|
|
|
t.Error("Wrong length", len(progress), len(queued), 0)
|
|
t.Error("Wrong length", len(progress), len(queued), 0)
|
|
|
- } else if !equalStrings(queued, names[5:]) {
|
|
|
|
|
|
|
+ } else if !slices.Equal(queued, names[5:]) {
|
|
|
t.Errorf("Wrong elements in queued, got %v, expected %v", queued, names[5:])
|
|
t.Errorf("Wrong elements in queued, got %v, expected %v", queued, names[5:])
|
|
|
}
|
|
}
|
|
|
|
|
|
|
|
progress, queued, skip = q.Jobs(2, 7)
|
|
progress, queued, skip = q.Jobs(2, 7)
|
|
|
if len(progress) != 0 || len(queued) != 3 || skip != 7 {
|
|
if len(progress) != 0 || len(queued) != 3 || skip != 7 {
|
|
|
t.Error("Wrong length", len(progress), len(queued), 0)
|
|
t.Error("Wrong length", len(progress), len(queued), 0)
|
|
|
- } else if !equalStrings(queued, names[7:]) {
|
|
|
|
|
|
|
+ } else if !slices.Equal(queued, names[7:]) {
|
|
|
t.Errorf("Wrong elements in queued, got %v, expected %v", queued, names[7:])
|
|
t.Errorf("Wrong elements in queued, got %v, expected %v", queued, names[7:])
|
|
|
}
|
|
}
|
|
|
|
|
|
|
@@ -338,23 +338,23 @@ func TestQueuePagination(t *testing.T) {
|
|
|
progress, queued, skip = q.Jobs(1, 5)
|
|
progress, queued, skip = q.Jobs(1, 5)
|
|
|
if len(progress) != 1 || len(queued) != 4 || skip != 0 {
|
|
if len(progress) != 1 || len(queued) != 4 || skip != 0 {
|
|
|
t.Error("Wrong length", len(progress), len(queued), 0)
|
|
t.Error("Wrong length", len(progress), len(queued), 0)
|
|
|
- } else if !equalStrings(progress, names[:1]) {
|
|
|
|
|
|
|
+ } else if !slices.Equal(progress, names[:1]) {
|
|
|
t.Errorf("Wrong elements in progress, got %v, expected %v", progress, names[:1])
|
|
t.Errorf("Wrong elements in progress, got %v, expected %v", progress, names[:1])
|
|
|
- } else if !equalStrings(queued, names[1:5]) {
|
|
|
|
|
|
|
+ } else if !slices.Equal(queued, names[1:5]) {
|
|
|
t.Errorf("Wrong elements in queued, got %v, expected %v", queued, names[1:5])
|
|
t.Errorf("Wrong elements in queued, got %v, expected %v", queued, names[1:5])
|
|
|
}
|
|
}
|
|
|
|
|
|
|
|
progress, queued, skip = q.Jobs(2, 5)
|
|
progress, queued, skip = q.Jobs(2, 5)
|
|
|
if len(progress) != 0 || len(queued) != 5 || skip != 5 {
|
|
if len(progress) != 0 || len(queued) != 5 || skip != 5 {
|
|
|
t.Error("Wrong length", len(progress), len(queued), 0)
|
|
t.Error("Wrong length", len(progress), len(queued), 0)
|
|
|
- } else if !equalStrings(queued, names[5:]) {
|
|
|
|
|
|
|
+ } else if !slices.Equal(queued, names[5:]) {
|
|
|
t.Errorf("Wrong elements in queued, got %v, expected %v", queued, names[5:])
|
|
t.Errorf("Wrong elements in queued, got %v, expected %v", queued, names[5:])
|
|
|
}
|
|
}
|
|
|
|
|
|
|
|
progress, queued, skip = q.Jobs(2, 7)
|
|
progress, queued, skip = q.Jobs(2, 7)
|
|
|
if len(progress) != 0 || len(queued) != 3 || skip != 7 {
|
|
if len(progress) != 0 || len(queued) != 3 || skip != 7 {
|
|
|
t.Error("Wrong length", len(progress), len(queued), 0)
|
|
t.Error("Wrong length", len(progress), len(queued), 0)
|
|
|
- } else if !equalStrings(queued, names[7:]) {
|
|
|
|
|
|
|
+ } else if !slices.Equal(queued, names[7:]) {
|
|
|
t.Errorf("Wrong elements in queued, got %v, expected %v", queued, names[7:])
|
|
t.Errorf("Wrong elements in queued, got %v, expected %v", queued, names[7:])
|
|
|
}
|
|
}
|
|
|
|
|
|
|
@@ -378,25 +378,25 @@ func TestQueuePagination(t *testing.T) {
|
|
|
progress, queued, skip = q.Jobs(1, 5)
|
|
progress, queued, skip = q.Jobs(1, 5)
|
|
|
if len(progress) != 5 || len(queued) != 0 || skip != 0 {
|
|
if len(progress) != 5 || len(queued) != 0 || skip != 0 {
|
|
|
t.Error("Wrong length", len(progress), len(queued), 0)
|
|
t.Error("Wrong length", len(progress), len(queued), 0)
|
|
|
- } else if !equalStrings(progress, names[:5]) {
|
|
|
|
|
|
|
+ } else if !slices.Equal(progress, names[:5]) {
|
|
|
t.Errorf("Wrong elements in progress, got %v, expected %v", progress, names[:5])
|
|
t.Errorf("Wrong elements in progress, got %v, expected %v", progress, names[:5])
|
|
|
}
|
|
}
|
|
|
|
|
|
|
|
progress, queued, skip = q.Jobs(2, 5)
|
|
progress, queued, skip = q.Jobs(2, 5)
|
|
|
if len(progress) != 3 || len(queued) != 2 || skip != 5 {
|
|
if len(progress) != 3 || len(queued) != 2 || skip != 5 {
|
|
|
t.Error("Wrong length", len(progress), len(queued), 0)
|
|
t.Error("Wrong length", len(progress), len(queued), 0)
|
|
|
- } else if !equalStrings(progress, names[5:8]) {
|
|
|
|
|
|
|
+ } else if !slices.Equal(progress, names[5:8]) {
|
|
|
t.Errorf("Wrong elements in progress, got %v, expected %v", progress, names[5:8])
|
|
t.Errorf("Wrong elements in progress, got %v, expected %v", progress, names[5:8])
|
|
|
- } else if !equalStrings(queued, names[8:]) {
|
|
|
|
|
|
|
+ } else if !slices.Equal(queued, names[8:]) {
|
|
|
t.Errorf("Wrong elements in queued, got %v, expected %v", queued, names[8:])
|
|
t.Errorf("Wrong elements in queued, got %v, expected %v", queued, names[8:])
|
|
|
}
|
|
}
|
|
|
|
|
|
|
|
progress, queued, skip = q.Jobs(2, 7)
|
|
progress, queued, skip = q.Jobs(2, 7)
|
|
|
if len(progress) != 1 || len(queued) != 2 || skip != 7 {
|
|
if len(progress) != 1 || len(queued) != 2 || skip != 7 {
|
|
|
t.Error("Wrong length", len(progress), len(queued), 0)
|
|
t.Error("Wrong length", len(progress), len(queued), 0)
|
|
|
- } else if !equalStrings(progress, names[7:8]) {
|
|
|
|
|
|
|
+ } else if !slices.Equal(progress, names[7:8]) {
|
|
|
t.Errorf("Wrong elements in progress, got %v, expected %v", progress, names[7:8])
|
|
t.Errorf("Wrong elements in progress, got %v, expected %v", progress, names[7:8])
|
|
|
- } else if !equalStrings(queued, names[8:]) {
|
|
|
|
|
|
|
+ } else if !slices.Equal(queued, names[8:]) {
|
|
|
t.Errorf("Wrong elements in queued, got %v, expected %v", queued, names[8:])
|
|
t.Errorf("Wrong elements in queued, got %v, expected %v", queued, names[8:])
|
|
|
}
|
|
}
|
|
|
|
|
|
|
@@ -405,15 +405,3 @@ func TestQueuePagination(t *testing.T) {
|
|
|
t.Error("Wrong length", len(progress), len(queued), 0)
|
|
t.Error("Wrong length", len(progress), len(queued), 0)
|
|
|
}
|
|
}
|
|
|
}
|
|
}
|
|
|
-
|
|
|
|
|
-func equalStrings(first, second []string) bool {
|
|
|
|
|
- if len(first) != len(second) {
|
|
|
|
|
- return false
|
|
|
|
|
- }
|
|
|
|
|
- for i := range first {
|
|
|
|
|
- if first[i] != second[i] {
|
|
|
|
|
- return false
|
|
|
|
|
- }
|
|
|
|
|
- }
|
|
|
|
|
- return true
|
|
|
|
|
-}
|
|
|