-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmaker_test.go
More file actions
411 lines (341 loc) · 10.3 KB
/
maker_test.go
File metadata and controls
411 lines (341 loc) · 10.3 KB
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
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
package batchr
import (
"math/rand"
"sync"
"testing"
"time"
)
func TestNewInstance(t *testing.T) {
batchProcessorFunc := func(items []int) {
t.Logf("Received a batch of size %d", len(items))
t.Logf("The batch is: %v", items)
}
capacityEvaluatorFunc := func(newItem int, existingItems []int) (r bool) {
r = len(existingItems) == 5
return
}
intervalEvaluatorFunc := func(lastUpdated *time.Time) (r bool) {
if lastUpdated == nil {
return false
}
cur := time.Now().UnixMilli()
lu := lastUpdated.UnixMilli()
return cur-lu > 700
}
b, err := New[int](
batchProcessorFunc,
capacityEvaluatorFunc,
intervalEvaluatorFunc,
)
assrtNotNil(t, b)
assrtNil(t, err)
assrtTrue(t, b.IsEmpty())
assrtEqual(t, 0, b.Size())
b.Add(1)
/*********************************
* The below tests may fail depending on
* processor speed/efficiency
* it's all about timing
**********************************/
time.Sleep(50 * time.Millisecond)
assrtFalse(t, b.IsEmpty()) // this may fail
assrtEqual(t, 1, b.Size()) // this may fail
b.Add(2, 3, 4, 5, 6, 7)
assrtFalse(t, b.IsEmpty())
time.Sleep(2 * time.Second) // allow time for the remaining of the batched to process (if any)
b.Stop()
assrtEqual(t, 2, b.BatchCount())
// **** Potential Test Output ****
// ../batchr/types_test.go:13: Received a batch of size 5
// ../batchr/types_test.go:14: The batch is: [1 2 3 4 5]
// ../batchr/types_test.go:13: Received a batch of size 2
// ../batchr/types_test.go:14: The batch is: [6 7]
}
func TestAddAfterStop(t *testing.T) {
batchProcessorFunc := func(items []int) {
t.Logf("Received a batch of size %d", len(items))
t.Logf("The batch is: %v", items)
}
capacityEvaluatorFunc := func(newItem int, existingItems []int) (r bool) {
r = len(existingItems) == 5
return
}
intervalEvaluatorFunc := func(lastUpdated *time.Time) (r bool) {
if lastUpdated == nil {
return false
}
cur := time.Now().UnixMilli()
lu := lastUpdated.UnixMilli()
return cur-lu > 700
}
b, err := New[int](
batchProcessorFunc,
capacityEvaluatorFunc,
intervalEvaluatorFunc,
)
assrtNotNil(t, b)
assrtNil(t, err)
assrtTrue(t, b.IsEmpty())
assrtEqual(t, 0, b.Size())
assrtTrue(t, b.Add(1)) // SHOULD be added
/*********************************
* The below tests may fail depending on
* processor speed/efficiency
* it's all about timing
**********************************/
time.Sleep(50 * time.Millisecond)
assrtFalse(t, b.IsEmpty()) // this may fail
assrtEqual(t, 1, b.Size()) // this may fail
assrtTrue(t,b.Add(2, 3, 4, 5, 6, 7)) // SHOULD be added
assrtFalse(t, b.IsEmpty())
time.Sleep(2 * time.Second) // allow time for the remaining of the batched to process (if any)
b.Stop()
assrtEqual(t, 2, b.BatchCount())
assrtFalse(t, b.Add(999)) // should NOT be added
assrtEqual(t, 2, b.BatchCount())
// **** Potential Test Output ****
// ../batchr/types_test.go:13: Received a batch of size 5
// ../batchr/types_test.go:14: The batch is: [1 2 3 4 5]
// ../batchr/types_test.go:13: Received a batch of size 2
// ../batchr/types_test.go:14: The batch is: [6 7]
}
func Test_Stress01(t *testing.T) {
var batchCount, itemCount, lastItemValue int
batchCap := 1000
expBatchCount := 1000
expItemCount := expBatchCount * batchCap
batchProcessorFunc := func(items []int) {
t.Logf("Received a batch of size %d", len(items))
batchCount++
receivedItemsCount := len(items)
itemCount += receivedItemsCount
for _, iNum := range items {
lastItemValue=iNum
}
if itemCount == expItemCount {
t.Log("Just processed the last item!")
}
}
capacityEvaluatorFunc := func(newItem int, existingItems []int) (r bool) {
r = len(existingItems) == batchCap
return
}
intervalEvaluatorFunc := func(lastUpdated *time.Time) (r bool) {
if lastUpdated == nil {
return false
}
cur := time.Now().UnixMilli()
lu := lastUpdated.UnixMilli()
timeSinceLastProcessed := cur-lu
r = timeSinceLastProcessed > 700
if r {
t.Logf(
"Need to force processing because too much time (%d ms) has passed since the last batch was processed",
timeSinceLastProcessed)
}
return
}
bOptions := Opts {
PollingInterval: time.Second,
NumChecksAfterStop: 3,
}
b, err := New(batchProcessorFunc, capacityEvaluatorFunc, intervalEvaluatorFunc, bOptions)
assrtNil(t, err)
if err != nil {
t.Fatalf("%v", err)
}
var attemptedItemCount int
for i := 0; i < expItemCount; i++ {
if ! b.Add(i) {
t.Logf("could not add item # %d to batcher",i)
} else {
attemptedItemCount++
}
}
b.Stop()
remainingItems := b.Size()
t.Log("Stopped batcher")
t.Logf("Attempted to add %d items", attemptedItemCount)
t.Logf("Items remaining in batcher, after Stop(): %d",remainingItems)
t.Logf("last item value to be processed: %d",lastItemValue)
time.Sleep(1 * time.Second)
t.Logf("Actual number of batches: %d", batchCount)
assrtEqual(t, expBatchCount, batchCount)
t.Logf("Actual number of items: %d", itemCount)
actualItemCount := itemCount //photo finish
assrtEqualAny(t, []any{expItemCount, expItemCount - 1}, actualItemCount) // could be off due to polling interval and timing ...
if actualItemCount == expItemCount-1 {
time.Sleep(2 * time.Second) // delay until the final item is processed
assrtTrue(t, b.IsEmpty(), "Batch should be empty, by now!")
}
assrtEqual(t, expItemCount, itemCount)
}
func Test_Stress02_RandomDelays(t *testing.T) {
var batchCount, itemCount, lastItemValue int
batchCap := 1000
expBatchCount := 100
expItemCount := expBatchCount * batchCap
batchProcessorFunc := func(items []int) {
t.Logf("Received a batch of size %d", len(items))
batchCount++
receivedItemsCount := len(items)
itemCount += receivedItemsCount
for _, iNum := range items {
lastItemValue=iNum
}
if itemCount == expItemCount {
t.Log("Just processed the last item!")
}
}
capacityEvaluatorFunc := func(newItem int, existingItems []int) (r bool) {
r = len(existingItems) == batchCap
return
}
intervalEvaluatorFunc := func(lastUpdated *time.Time) (r bool) {
if lastUpdated == nil {
return false
}
cur := time.Now().UnixMilli()
lu := lastUpdated.UnixMilli()
timeSinceLastProcessed := cur-lu
r = timeSinceLastProcessed > 700
if r {
t.Logf(
"Need to force processing because too much time (%d ms) has passed since the last batch was processed",
timeSinceLastProcessed)
}
return
}
bOptions := Opts {
PollingInterval: time.Second,
NumChecksAfterStop: 3,
}
b, err := New(batchProcessorFunc, capacityEvaluatorFunc, intervalEvaluatorFunc, bOptions)
assrtNil(t, err)
if err != nil {
t.Fatalf("%v", err)
}
var totalDelay time.Duration
delay := func() {
if totalDelay > 10 * time.Second {
return
}
dVal := rand.Intn(900)
dly := time.Duration(dVal) * time.Millisecond
totalDelay += dly
if dVal % 2 == 0 || totalDelay > 10 * time.Second {
return
}
time.Sleep( dly)
}
var attemptedItemCount int
for i := 0; i < expItemCount; i++ {
if i % 1000 == 0 {
delay()
}
if ! b.Add(i) {
t.Logf("could not add item # %d to batcher",i)
} else {
attemptedItemCount++
}
}
b.Stop()
remainingItems := b.Size()
t.Log("Stopped batcher")
t.Logf("Attempted to add %d items", attemptedItemCount)
t.Logf("Items remaining in batcher, after Stop(): %d",remainingItems)
t.Logf("last item value to be processed: %d",lastItemValue)
time.Sleep(1 * time.Second)
t.Logf("Actual number of batches: %d", batchCount)
assrtEqual(t, expBatchCount, batchCount)
t.Logf("Actual number of items: %d", itemCount)
actualItemCount := itemCount //photo finish
assrtEqualAny(t, []any{expItemCount, expItemCount - 1}, actualItemCount) // could be off due to polling interval and timing ...
if actualItemCount == expItemCount-1 {
time.Sleep(2 * time.Second) // delay until the final item is processed
assrtTrue(t, b.IsEmpty(), "Batch should be empty, by now!")
}
assrtEqual(t, expItemCount, itemCount)
}
func Test_Stress03_ConcurrentAdds(t *testing.T) {
var batchCount, itemCount, lastItemValue int
batchCap := 1000
expBatchCount := 1000
expItemCount := expBatchCount * batchCap
batchProcessorFunc := func(items []int) {
t.Logf("Received a batch of size %d", len(items))
batchCount++
receivedItemsCount := len(items)
itemCount += receivedItemsCount
for _, iNum := range items {
lastItemValue=iNum
}
if itemCount == expItemCount {
t.Log("Just processed the last item!")
}
}
capacityEvaluatorFunc := func(newItem int, existingItems []int) (r bool) {
r = len(existingItems) == batchCap
return
}
intervalEvaluatorFunc := func(lastUpdated *time.Time) (r bool) {
if lastUpdated == nil {
return false
}
cur := time.Now().UnixMilli()
lu := lastUpdated.UnixMilli()
timeSinceLastProcessed := cur-lu
r = timeSinceLastProcessed > 700
if r {
t.Logf(
"Need to force processing because too much time (%d ms) has passed since the last batch was processed",
timeSinceLastProcessed)
}
return
}
bOptions := Opts {
PollingInterval: time.Second,
NumChecksAfterStop: 3,
}
b, err := New(batchProcessorFunc, capacityEvaluatorFunc, intervalEvaluatorFunc, bOptions)
assrtNil(t, err)
if err != nil {
t.Fatalf("%v", err)
}
var attemptedItemCount int
var w sync.WaitGroup
w.Add(2)
go func (iCount *int) {
defer w.Done()
for j := 0; j < expItemCount; j+=2 {
if ! b.Add(j*-1) {
t.Logf("(p) could not add item # %d to batcher",j)
} else {
*iCount++
}
}
}(&attemptedItemCount)
for i := 1; i < expItemCount; i+=2 {
if ! b.Add(i) {
t.Logf("could not add item # %d to batcher",i)
} else {
attemptedItemCount++
}
}
w.Done()
// wait for concurrent processing to complete before stopping
w.Wait()
b.Stop()
remainingItems := b.Size()
t.Log("Stopped batcher")
t.Logf("Attempted to add %d items", attemptedItemCount)
t.Logf("Items remaining in batcher, after Stop(): %d",remainingItems)
t.Logf("last item value to be processed: %d",lastItemValue)
time.Sleep(1 * time.Second)
t.Logf("Actual number of batches: %d", batchCount)
assrtEqual(t, expBatchCount, batchCount)
t.Logf("Actual number of items: %d", itemCount)
actualItemCount := itemCount //photo finish
assrtEqualAny(t, []any{expItemCount, expItemCount - 1}, actualItemCount) // could be off due to polling interval and timing ...
assrtEqual(t, expItemCount, itemCount)
}