-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbenchmark_test.go
90 lines (69 loc) · 1.43 KB
/
benchmark_test.go
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
package queue
import (
"testing"
)
func benchmarkPush(b *testing.B, items []*mockItem) {
b.Helper()
for i := 0; i < b.N; i++ {
q := NewQueue[*mockItem]()
for _, item := range items {
q.Push(item)
}
}
}
func BenchmarkHeap_Push10(b *testing.B) {
items := generateRandomItems(10)
b.ResetTimer()
benchmarkPush(b, items)
}
func BenchmarkHeap_Push100(b *testing.B) {
items := generateRandomItems(100)
b.ResetTimer()
benchmarkPush(b, items)
}
func benchmarkPop(
b *testing.B,
items []*mockItem,
popCallback func(q *Queue[*mockItem]),
) {
b.Helper()
for i := 0; i < b.N; i++ {
q := NewQueue[*mockItem]()
b.StopTimer()
for _, item := range items {
q.Push(item)
}
b.StartTimer()
for j := 0; j < len(items); j++ {
popCallback(&q)
}
}
}
func BenchmarkHeap_PopFront10(b *testing.B) {
items := generateRandomItems(10)
b.ResetTimer()
benchmarkPop(b, items, func(q *Queue[*mockItem]) {
q.PopFront()
})
}
func BenchmarkHeap_PopFront100(b *testing.B) {
items := generateRandomItems(100)
b.ResetTimer()
benchmarkPop(b, items, func(q *Queue[*mockItem]) {
q.PopFront()
})
}
func BenchmarkHeap_PopBack10(b *testing.B) {
items := generateRandomItems(10)
b.ResetTimer()
benchmarkPop(b, items, func(q *Queue[*mockItem]) {
q.PopBack()
})
}
func BenchmarkHeap_PopBack100(b *testing.B) {
items := generateRandomItems(100)
b.ResetTimer()
benchmarkPop(b, items, func(q *Queue[*mockItem]) {
q.PopBack()
})
}