-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathappend.go
58 lines (52 loc) · 836 Bytes
/
append.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
package chunked
import "github.com/liferoot/bits"
func Append(b []byte, p ...[]byte) (r []byte) {
z := 0
for _, r = range p {
z += len(r)
}
if z == 0 {
return b
}
n := len(b)
z += n
if z <= cap(b) {
r = b[:z]
} else {
if z > defaultPool.largest {
r = make([]byte, z, int(1<<(bits.MSB64(uint64(z))+1)))
} else {
r = GetChunk(z)[:z]
}
copy(r, b)
}
for _, b = range p {
n += copy(r[n:], b)
}
return
}
func AppendByte(b []byte, p ...byte) (r []byte) {
if len(b) == 0 {
return p
}
if len(p) == 0 {
return b
}
n := len(b)
z := n + len(p)
if z <= cap(b) {
r = b[:z]
} else {
if z > defaultPool.largest {
r = make([]byte, z, int(1<<(bits.MSB64(uint64(z))+1)))
} else {
r = GetChunk(z)[:z]
}
copy(r, b)
}
for i, z := 0, len(p); i < z; i++ {
r[n] = p[i]
n++
}
return
}