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
143
144
145
146
147
148
149
150
151
152
153
154
|
package priorityqueue
import (
"fmt"
"math/rand"
"sync/atomic"
"testing"
"time"
"github.com/stretchr/testify/require"
)
type Test int
func (t Test) Ack() error {
return nil
}
func (t Test) Nack() error {
return nil
}
func (t Test) Requeue(_ map[string][]string, _ int64) error {
return nil
}
func (t Test) Body() []byte {
return nil
}
func (t Test) Context() ([]byte, error) {
return nil, nil
}
func (t Test) ID() string {
return "none"
}
func (t Test) Priority() int64 {
return int64(t)
}
func TestBinHeap_Init(t *testing.T) {
a := []Item{Test(2), Test(23), Test(33), Test(44), Test(1), Test(2), Test(2), Test(2), Test(4), Test(6), Test(99)}
bh := NewBinHeap(12)
for i := 0; i < len(a); i++ {
bh.Insert(a[i])
}
expected := []Item{Test(1), Test(2), Test(2), Test(2), Test(2), Test(4), Test(6), Test(23), Test(33), Test(44), Test(99)}
res := make([]Item, 0, 12)
for i := 0; i < 11; i++ {
item := bh.ExtractMin()
res = append(res, item)
}
require.Equal(t, expected, res)
}
func TestBinHeap_MaxLen(t *testing.T) {
a := []Item{Test(2), Test(23), Test(33), Test(44), Test(1), Test(2), Test(2), Test(2), Test(4), Test(6), Test(99)}
bh := NewBinHeap(1)
go func() {
expected := []Item{Test(2), Test(23), Test(33), Test(44), Test(1), Test(2), Test(2), Test(2), Test(4), Test(6), Test(99)}
res := make([]Item, 0, 12)
for i := 0; i < 11; i++ {
item := bh.ExtractMin()
res = append(res, item)
}
require.Equal(t, expected, res)
return
}()
time.Sleep(time.Second)
for i := 0; i < len(a); i++ {
bh.Insert(a[i])
}
time.Sleep(time.Second)
}
func TestNewPriorityQueue(t *testing.T) {
insertsPerSec := uint64(0)
getPerSec := uint64(0)
stopCh := make(chan struct{}, 1)
pq := NewBinHeap(1000)
go func() {
tt3 := time.NewTicker(time.Millisecond * 10)
for {
select {
case <-tt3.C:
require.Less(t, pq.Len(), uint64(1002))
case <-stopCh:
return
}
}
}()
go func() {
tt := time.NewTicker(time.Second)
for {
select {
case <-tt.C:
fmt.Println(fmt.Sprintf("Insert per second: %d", atomic.LoadUint64(&insertsPerSec)))
atomic.StoreUint64(&insertsPerSec, 0)
fmt.Println(fmt.Sprintf("ExtractMin per second: %d", atomic.LoadUint64(&getPerSec)))
atomic.StoreUint64(&getPerSec, 0)
case <-stopCh:
tt.Stop()
return
}
}
}()
go func() {
for {
select {
case <-stopCh:
return
default:
pq.ExtractMin()
atomic.AddUint64(&getPerSec, 1)
}
}
}()
go func() {
for {
select {
case <-stopCh:
return
default:
pq.Insert(Test(rand.Int())) //nolint:gosec
atomic.AddUint64(&insertsPerSec, 1)
}
}
}()
time.Sleep(time.Second * 5)
stopCh <- struct{}{}
stopCh <- struct{}{}
stopCh <- struct{}{}
stopCh <- struct{}{}
}
|
