/
iovec.go
126 lines (111 loc) · 2.04 KB
/
iovec.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
// Copyright (c) 2023 Kai Luo <gluokai@gmail.com>. All rights reserved.
package core
import (
"bytes"
"fmt"
"io"
"net"
)
type IoVec net.Buffers
func FromSlice(s []byte) *IoVec {
var v IoVec
v.Take(s)
return &v
}
func (self IoVec) Len() (l int) {
for _, v := range self {
l += len(v)
}
return
}
func (self IoVec) Concat() []byte {
var b bytes.Buffer
for _, s := range self {
b.Write(s)
}
return b.Bytes()
}
func (self *IoVec) Take(s []byte) *IoVec {
if len(s) == 0 {
return self
}
*self = append(*self, s)
return self
}
func (self *IoVec) Write(s []byte) (n int, err error) {
var b bytes.Buffer
n, err = b.Write(s)
if err != nil {
return
}
self.Take(b.Bytes())
return b.Len(), nil
}
func (self *IoVec) WriteTo(w io.Writer) (int64, error) {
return (*net.Buffers)(self).WriteTo(w)
}
func (self *IoVec) Read(p []byte) (int, error) {
return (*net.Buffers)(self).Read(p)
}
func (self *IoVec) Consume() []byte {
if len(*self) == 1 {
data := (*self)[0]
*self = IoVec{}
return data
}
b := &bytes.Buffer{}
_, err := b.ReadFrom(self)
if err != nil {
panic(err)
}
return b.Bytes()
}
func (self IoVec) LastByte() (byte, error) {
l := len(self)
if l == 0 {
return 0, fmt.Errorf("This IoVec is empty")
}
k := len(self[l-1])
return self[l-1][k-1], nil
}
func (self *IoVec) Drop(s int) error {
l := len(*self)
c := 0
for i := l - 1; i >= 0; i-- {
v := (*self)[i]
vl := len(v)
if c+vl >= s {
(*self) = (*self)[:i]
self.Take(v[:c+vl-s])
return nil
}
c += vl
}
return fmt.Errorf("Unable to drop %d bytes", s)
}
func (self IoVec) At(i int) (byte, error) {
c := 0
for _, v := range self {
if i >= c && i < c+len(v) {
return v[i-c], nil
}
c += len(v)
}
return 0, fmt.Errorf("Index %d out of bound", i)
}
func (self *IoVec) Split(i int) (tail IoVec) {
c := 0
for k, v := range *self {
if i >= c && i < c+len(v) {
tail.Take(v[i-c:])
if len((*self)[k+1:]) != 0 {
tail = append(tail, (*self)[k+1:]...)
}
*self = (*self)[:k]
self.Take(v[:i-c])
return
}
c += len(v)
}
return
}