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
|
package http
import (
"strings"
"net/http"
"os"
)
const maxLevel = 127
type dataTree map[string]interface{}
type fileTree map[string]interface{}
// parseData parses incoming request body into data tree.
func parseData(r *http.Request) (dataTree, error) {
data := make(dataTree)
for k, v := range r.PostForm {
data.push(k, v)
}
for k, v := range r.MultipartForm.Value {
data.push(k, v)
}
return data, nil
}
// pushes value into data tree.
func (d dataTree) push(k string, v []string) {
if len(v) == 0 {
// skip empty values
return
}
indexes := make([]string, 0)
for _, index := range strings.Split(k, "[") {
indexes = append(indexes, strings.Trim(index, "]"))
}
if len(indexes) <= maxLevel {
d.mount(indexes, v)
}
}
// mount mounts data tree recursively.
func (d dataTree) mount(i []string, v []string) {
if len(v) == 0 {
return
}
if len(i) == 1 {
// single value context
d[i[0]] = v[0]
return
}
if len(i) == 2 && i[1] == "" {
// non associated array of elements
d[i[0]] = v
return
}
if p, ok := d[i[0]]; ok {
p.(dataTree).mount(i[1:], v)
}
d[i[0]] = make(dataTree)
d[i[0]].(dataTree).mount(i[1:], v)
}
// parse incoming dataTree request into JSON (including multipart form dataTree)
func parseUploads(r *http.Request, cfg *UploadsConfig) (*Uploads, error) {
u := &Uploads{
cfg: cfg,
tree: make(fileTree),
list: make([]*FileUpload, 0),
}
for k, v := range r.MultipartForm.File {
files := make([]*FileUpload, 0, len(v))
for _, f := range v {
files = append(files, NewUpload(f))
}
u.list = append(u.list, files...)
u.tree.push(k, files)
}
return u, nil
}
// exists if file exists.
func exists(path string) bool {
_, err := os.Stat(path)
if err == nil {
return true
}
if os.IsNotExist(err) {
return false
}
return false
}
// pushes new file upload into it's proper place.
func (d fileTree) push(k string, v []*FileUpload) {
if len(v) == 0 {
// skip empty values
return
}
indexes := make([]string, 0)
for _, index := range strings.Split(k, "[") {
indexes = append(indexes, strings.Trim(index, "]"))
}
if len(indexes) <= maxLevel {
d.mount(indexes, v)
}
}
// mount mounts data tree recursively.
func (d fileTree) mount(i []string, v []*FileUpload) {
if len(v) == 0 {
return
}
if len(i) == 1 {
// single value context
d[i[0]] = v[0]
return
}
if len(i) == 2 && i[1] == "" {
// non associated array of elements
d[i[0]] = v
return
}
if p, ok := d[i[0]]; ok {
p.(fileTree).mount(i[1:], v)
}
d[i[0]] = make(fileTree)
d[i[0]].(fileTree).mount(i[1:], v)
}
|
