-
Notifications
You must be signed in to change notification settings - Fork 0
/
bytepool.go
55 lines (50 loc) · 982 Bytes
/
bytepool.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
package bpool
/*
BytePool implements a leaky pool of []byte in the form of a bounded
channel.
*/
type BytePool struct {
c chan []byte
w int
}
/*
NewBytePool creates a new BytePool bounded to the given maxSize, with new byte
arrays sized based on width.
*/
func NewBytePool(maxSize int, width int) (bp *BytePool) {
return &BytePool{
c: make(chan []byte, maxSize),
w: width,
}
}
/*
Get gets a []byte from the BytePool, or creates a new one if none are available
in the pool.
*/
func (bp *BytePool) Get() (b []byte) {
select {
case b = <-bp.c:
// reuse existing buffer
default:
// create new buffer
b = make([]byte, bp.w)
}
return
}
/*
Put returns the given Buffer to the BytePool.
*/
func (bp *BytePool) Put(b []byte) {
select {
case bp.c <- b:
// buffer went back into pool
default:
// buffer didn't go back into pool, just discard
}
}
/*
Width returns the width of the byte arrays in this pool.
*/
func (bp *BytePool) Width() (n int) {
return bp.w
}