-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathringbuffer_test.go
209 lines (188 loc) · 4.05 KB
/
ringbuffer_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
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
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
package main
import "testing"
func TestRingBufferEmpty(t *testing.T) {
// Arrange
rb := ringbuffer{}
// Act
_, ok := rb.get()
// Assert
if ok {
t.Fatalf("Unexpected ok from rb.get()")
}
}
func TestRingBufferSimple(t *testing.T) {
// Arrange
rb := ringbuffer{}
// Act
rb.put(10)
rb.put(20)
rb.put(30)
r1, ok1 := rb.get()
r2, ok2 := rb.get()
r3, ok3 := rb.get()
_, ok4 := rb.get()
// Assert
if r1 != 10 {
t.Fatalf("Unexpected r1")
}
if r2 != 20 {
t.Fatalf("Unexpected r2")
}
if r3 != 30 {
t.Fatalf("Unexpected r3")
}
if !ok1 {
t.Fatalf("Unexpected ok1")
}
if !ok2 {
t.Fatalf("Unexpected ok1")
}
if !ok3 {
t.Fatalf("Unexpected ok1")
}
if ok4 {
t.Fatalf("Unexpected ok4")
}
}
func TestRingBufferWrapAroundRingBuffer(t *testing.T) {
// Arrange
rb := ringbuffer{}
var expectedVals []int
// Act
for i := 0; i < ringBufferInitialSize; i++ {
val := i * 10
expectedVals = append(expectedVals, val)
rb.put(val)
}
for i := 0; i < 2; i++ {
// Free some elements from the front so we can put more in place of these.
val1, ok1 := rb.get()
if !ok1 {
t.Fatalf("Unexpected ok1")
}
if val1 != expectedVals[0] {
t.Fatalf("Unexpected val1 %v", val1)
}
expectedVals = expectedVals[1:]
}
for i := 0; i < 2; i++ {
val := i * 1000
expectedVals = append(expectedVals, val)
rb.put(val)
}
// Assert
for _, expectedVal := range expectedVals {
val2, ok2 := rb.get()
if !ok2 {
t.Fatalf("Unexpected ok2")
}
if val2 != expectedVal {
t.Fatalf("Unexpected val2 %v", val2)
}
}
}
func TestRingBufferRemove(t *testing.T) {
// Arrange
rb := ringbuffer{}
var expectedVals []int
// Act
for i := 0; i < 7; i++ {
val := i * 10
expectedVals = append(expectedVals, val)
rb.put(val)
}
rb.remove(50)
copy(expectedVals[5:], expectedVals[5+1:])
expectedVals = expectedVals[:len(expectedVals)-1]
// Assert
for _, expectedVal := range expectedVals {
val, ok := rb.get()
if !ok {
t.Fatalf("Unexpected ok")
}
if val != expectedVal {
t.Fatalf("Unexpected val %v", val)
}
}
}
func TestRingBufferRemoveWrap(t *testing.T) {
for elementIdxToRemove := 0; elementIdxToRemove < ringBufferInitialSize; elementIdxToRemove++ {
// Arrange
rb := ringbuffer{}
var expectedVals []int
// Act
for i := 0; i < ringBufferInitialSize; i++ {
val := i * 10
expectedVals = append(expectedVals, val)
rb.put(val)
}
for i := 0; i < 2; i++ {
// Free some elements from the front so we can put more in place of these.
val1, ok1 := rb.get()
if !ok1 {
t.Fatalf("Unexpected ok1")
}
if val1 != expectedVals[0] {
t.Fatalf("Unexpected val1 %v", val1)
}
expectedVals = expectedVals[1:]
}
for i := 0; i < 2; i++ {
val := i * 10
expectedVals = append(expectedVals, val)
rb.put(val)
}
rb.remove(expectedVals[elementIdxToRemove])
copy(expectedVals[elementIdxToRemove:], expectedVals[elementIdxToRemove+1:])
expectedVals = expectedVals[:len(expectedVals)-1]
// Assert
for _, expectedVal := range expectedVals {
val2, ok2 := rb.get()
if !ok2 {
t.Fatalf("Unexpected ok2")
}
if val2 != expectedVal {
t.Fatalf("Unexpected val2 %v", val2)
}
}
}
}
func TestRingBufferRingBufferExpand(t *testing.T) {
// Arrange
rb := ringbuffer{}
var expectedVals []int
// Act
for i := 0; i < ringBufferInitialSize; i++ {
val := i * 10
expectedVals = append(expectedVals, val)
rb.put(val)
}
for i := 0; i < 2; i++ {
// Free some elements from the front so we can put more in place of these.
val1, ok1 := rb.get()
if !ok1 {
t.Fatalf("Unexpected ok1")
}
if val1 != expectedVals[0] {
t.Fatalf("Unexpected val1 %v", val1)
}
expectedVals = expectedVals[1:]
}
for i := 0; i < 10; i++ {
// Add more elements than the initial capacity to ensure the ring buffer auto expands
val := i * 1000
expectedVals = append(expectedVals, val)
rb.put(val)
}
// Assert
// Assert
for _, expectedVal := range expectedVals {
val2, ok2 := rb.get()
if !ok2 {
t.Fatalf("Unexpected ok2")
}
if val2 != expectedVal {
t.Fatalf("Unexpected val2 %v", val2)
}
}
}