/
mock.go
208 lines (178 loc) · 3.52 KB
/
mock.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
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
package storage
import (
"bytes"
"container/list"
"context"
"io"
"strings"
"go.f110.dev/xerrors"
)
type Mock struct {
root *objectNode
}
type objectNode struct {
Name string
Data []byte
Children []*objectNode
parent *objectNode
}
func (n *objectNode) FullPath() string {
p := n.Name
for v := n.parent; v != nil; v = v.parent {
if v.Name != "" {
p = v.Name + "/" + p
}
}
return p
}
var _ storageInterface = &Mock{}
func NewMock() *Mock {
return &Mock{root: &objectNode{}}
}
func (m *Mock) Name() string {
return "mock"
}
func (m *Mock) AddTree(name string, data []byte) {
m.addNode(name, data)
}
func (m *Mock) addNode(name string, data []byte) {
p := strings.Split(name, "/")
if len(p) == 0 {
return
}
if len(p) == 1 {
for _, v := range m.root.Children {
if v.Name == p[0] {
v.Data = data
return
}
}
m.root.Children = append(m.root.Children, &objectNode{
Name: p[0],
Data: data,
parent: m.root,
})
}
nodeName := p[0]
p = p[1:]
curr := m.root
NextChild:
for {
for _, v := range curr.Children {
if v.Name == nodeName {
if len(p) == 0 {
// This is end node.
// The node is already exists. So update data.
v.Data = data
break NextChild
}
curr = v
nodeName = p[0]
p = p[1:]
continue NextChild
}
}
// Create new node. because nodeName is not found in children
newNode := &objectNode{Name: nodeName, parent: curr}
curr.Children = append(curr.Children, newNode)
curr = newNode
if len(p) > 0 {
// There is more nodes. Deep into depth.
nodeName = p[0]
p = p[1:]
} else {
// This is end node
newNode.Data = data
break
}
}
return
}
func (m *Mock) findNode(name string) *objectNode {
if name == "" {
return m.root
}
p := strings.Split(name, "/")
nodeName := p[0]
p = p[1:]
curr := m.root
NextChild:
for {
for _, v := range curr.Children {
if v.Name == nodeName {
curr = v
if len(p) == 0 {
return v
}
nodeName = p[0]
p = p[1:]
continue NextChild
}
}
break
}
return nil
}
func (m *Mock) deleteNode(name string) {
n := m.findNode(name)
if n == nil {
return
}
p := strings.Split(name, "/")
last := p[len(p)-1]
for i, v := range n.parent.Children {
if v.Name == last {
n.parent.Children = append(n.parent.Children[:i], n.parent.Children[i+1:]...)
break
}
}
}
func (m *Mock) Get(_ context.Context, name string) (*Object, error) {
n := m.findNode(name)
if n != nil {
return &Object{
Name: name,
Size: int64(len(n.Data)),
Body: io.NopCloser(bytes.NewReader(n.Data)),
}, nil
}
return nil, xerrors.WithStack(ErrObjectNotFound)
}
func (m *Mock) List(_ context.Context, prefix string) ([]*Object, error) {
n := m.findNode(prefix)
if n == nil {
return nil, nil
}
var objs []*Object
stack := list.New()
for _, v := range n.Children {
stack.PushBack(v)
}
for stack.Len() > 0 {
e := stack.Back()
stack.Remove(e)
obj := e.Value.(*objectNode)
if obj.Data != nil {
objs = append(objs, &Object{Name: obj.FullPath(), Size: int64(len(obj.Data))})
}
for _, v := range obj.Children {
stack.PushBack(v)
}
}
return objs, nil
}
func (m *Mock) Put(_ context.Context, name string, data []byte) error {
m.addNode(name, data)
return nil
}
func (m *Mock) PutReader(ctx context.Context, name string, data io.Reader) error {
buf, err := io.ReadAll(data)
if err != nil {
return xerrors.WithStack(err)
}
return m.Put(ctx, name, buf)
}
func (m *Mock) Delete(_ context.Context, name string) error {
m.deleteNode(name)
return nil
}