-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathslice1_test.go
More file actions
82 lines (64 loc) · 1.46 KB
/
slice1_test.go
File metadata and controls
82 lines (64 loc) · 1.46 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
package pool
import (
"math/rand"
"testing"
)
func TestChanPoolConsist(t *testing.T) {
isPool := NewSlicePool(
func(l int, c int) interface{} { return make([]int, l, c) },
checkInts,
)
testPoolConsist(isPool, t)
}
func TestHugePool(t *testing.T) {
isPool := NewSlicePool(
func(l int, c int) interface{} { return make([]int, l, c) },
checkInts,
)
testHugePool(isPool, t)
}
func TestPoolEdgeCondition(t *testing.T) {
bsPool := NewSlicePool(
func(l int, c int) interface{} { return make([]byte, l, c) },
checkBytes,
)
testPoolEdgeCondition(bsPool, t)
}
func TestDifferentTypePanic(t *testing.T) {
bsPool := NewSlicePool(
func(l int, c int) interface{} { return make([]byte, l, c) },
checkBytes,
)
testDifferentTypePanic(bsPool, t)
}
func TestPoolFull(t *testing.T) {
bsPool := NewSlicePool(
func(l int, c int) interface{} { return make([]byte, l, c) },
checkBytes,
)
for i := 0; i <= cacheSliceCap+1; i++ {
bsPool.Return(make([]byte, 0, 8))
}
}
func BenchmarkSliceBorrowReturn(t *testing.B) {
bytesPool := NewSlicePool(
func(l int, c int) interface{} { return make([]byte, l, c) },
checkBytes,
)
for i := 0; i < t.N; i++ {
size := rand.Intn(maxSliceSize)
if size == 0 {
continue
}
v := bytesPool.Borrow(size)
b, ok := v.([]byte)
if !ok {
t.Fatal(v, "is not slice type!")
}
if len(b) != size || cap(b) < len(b) {
t.Fatal("length:", len(b), "is less than cap:", cap(b))
} else {
bytesPool.Return(b)
}
}
}