forked from dimfeld/httptreemux
-
Notifications
You must be signed in to change notification settings - Fork 0
/
tree_test.go
337 lines (284 loc) · 9.3 KB
/
tree_test.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
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
package httptreemux
import (
"net/http"
"strings"
"testing"
)
func dummyHandler(w http.ResponseWriter, r *http.Request, urlParams map[string]string) {
}
func addPath(t *testing.T, tree *node, path string) {
t.Logf("Adding path %s", path)
n := tree.addPath(path[1:], nil)
handler := func(w http.ResponseWriter, r *http.Request, urlParams map[string]string) {
urlParams["path"] = path
}
n.setHandler("GET", handler)
}
var test *testing.T
func testPath(t *testing.T, tree *node, path string, expectPath string, expectedParams map[string]string) {
if t.Failed() {
t.Log(tree.dumpTree("", " "))
t.FailNow()
}
expectCatchAll := strings.Contains(expectPath, "/*")
t.Log("Testing", path)
n, paramList := tree.search(path[1:])
if expectPath != "" && n == nil {
t.Errorf("No match for %s, expected %s", path, expectPath)
return
} else if expectPath == "" && n != nil {
t.Errorf("Expected no match for %s but got %v with params %v", path, n, expectedParams)
t.Error("Node and subtree was\n" + n.dumpTree("", " "))
return
}
if n == nil {
return
}
if expectCatchAll != n.isCatchAll {
t.Errorf("For path %s expectCatchAll %v but saw %v", path, expectCatchAll, n.isCatchAll)
}
handler, ok := n.leafHandler["GET"]
if !ok {
t.Errorf("Path %s returned node without handler", path)
t.Error("Node and subtree was\n" + n.dumpTree("", " "))
return
}
pathMap := make(map[string]string)
handler(nil, nil, pathMap)
matchedPath := pathMap["path"]
if matchedPath != expectPath {
t.Errorf("Path %s matched %s, expected %s", path, matchedPath, expectPath)
t.Error("Node and subtree was\n" + n.dumpTree("", " "))
}
if expectedParams == nil {
if len(paramList) != 0 {
t.Errorf("Path %p expected no parameters, saw %v", path, paramList)
}
} else {
if len(paramList) != len(n.leafWildcardNames) {
t.Errorf("Got %d params back but node specifies %d",
len(paramList), len(n.leafWildcardNames))
}
params := map[string]string{}
for i := 0; i < len(paramList); i++ {
params[n.leafWildcardNames[len(paramList)-i-1]] = paramList[i]
}
t.Log("\tGot params", params)
for key, val := range expectedParams {
sawVal, ok := params[key]
if !ok {
t.Errorf("Path %s matched without key %s", path, key)
} else if sawVal != val {
t.Errorf("Path %s expected param %s to be %s, saw %s", path, key, val, sawVal)
}
delete(params, key)
}
for key, val := range params {
t.Errorf("Path %s returned unexpected param %s=%s", path, key, val)
}
}
}
func checkHandlerNodes(t *testing.T, n *node) {
hasHandlers := len(n.leafHandler) != 0
hasWildcards := len(n.leafWildcardNames) != 0
if hasWildcards && !hasHandlers {
t.Errorf("Node %s has wildcards without handlers", n.path)
}
}
func TestTree(t *testing.T) {
test = t
tree := &node{path: "/"}
addPath(t, tree, "/")
addPath(t, tree, "/i")
addPath(t, tree, "/i/:aaa")
addPath(t, tree, "/images")
addPath(t, tree, "/images/abc.jpg")
addPath(t, tree, "/images/:imgname")
addPath(t, tree, "/images/*path")
addPath(t, tree, "/ima")
addPath(t, tree, "/ima/:par")
addPath(t, tree, "/images1")
addPath(t, tree, "/images2")
addPath(t, tree, "/apples")
addPath(t, tree, "/app/les")
addPath(t, tree, "/apples1")
addPath(t, tree, "/appeasement")
addPath(t, tree, "/appealing")
addPath(t, tree, "/date/:year/:month")
addPath(t, tree, "/date/:year/month")
addPath(t, tree, "/date/:year/:month/abc")
addPath(t, tree, "/date/:year/:month/:post")
addPath(t, tree, "/date/:year/:month/*post")
addPath(t, tree, "/:page")
addPath(t, tree, "/:page/:index")
addPath(t, tree, "/post/:post/page/:page")
addPath(t, tree, "/plaster")
addPath(t, tree, "/users/:pk/:related")
addPath(t, tree, "/users/:id/updatePassword")
addPath(t, tree, "/:something/abc")
addPath(t, tree, "/:something/def")
testPath(t, tree, "/users/abc/updatePassword", "/users/:id/updatePassword",
map[string]string{"id": "abc"})
testPath(t, tree, "/users/all/something", "/users/:pk/:related",
map[string]string{"pk": "all", "related": "something"})
testPath(t, tree, "/aaa/abc", "/:something/abc",
map[string]string{"something": "aaa"})
testPath(t, tree, "/aaa/def", "/:something/def",
map[string]string{"something": "aaa"})
testPath(t, tree, "/paper", "/:page",
map[string]string{"page": "paper"})
testPath(t, tree, "/", "/", nil)
testPath(t, tree, "/i", "/i", nil)
testPath(t, tree, "/images", "/images", nil)
testPath(t, tree, "/images/abc.jpg", "/images/abc.jpg", nil)
testPath(t, tree, "/images/something", "/images/:imgname",
map[string]string{"imgname": "something"})
testPath(t, tree, "/images/long/path", "/images/*path",
map[string]string{"path": "long/path"})
testPath(t, tree, "/images/even/longer/path", "/images/*path",
map[string]string{"path": "even/longer/path"})
testPath(t, tree, "/ima", "/ima", nil)
testPath(t, tree, "/apples", "/apples", nil)
testPath(t, tree, "/app/les", "/app/les", nil)
testPath(t, tree, "/abc", "/:page",
map[string]string{"page": "abc"})
testPath(t, tree, "/abc/100", "/:page/:index",
map[string]string{"page": "abc", "index": "100"})
testPath(t, tree, "/post/a/page/2", "/post/:post/page/:page",
map[string]string{"post": "a", "page": "2"})
testPath(t, tree, "/date/2014/5", "/date/:year/:month",
map[string]string{"year": "2014", "month": "5"})
testPath(t, tree, "/date/2014/month", "/date/:year/month",
map[string]string{"year": "2014"})
testPath(t, tree, "/date/2014/5/abc", "/date/:year/:month/abc",
map[string]string{"year": "2014", "month": "5"})
testPath(t, tree, "/date/2014/5/def", "/date/:year/:month/:post",
map[string]string{"year": "2014", "month": "5", "post": "def"})
testPath(t, tree, "/date/2014/5/def/hij", "/date/:year/:month/*post",
map[string]string{"year": "2014", "month": "5", "post": "def/hij"})
testPath(t, tree, "/date/2014/5/def/hij/", "/date/:year/:month/*post",
map[string]string{"year": "2014", "month": "5", "post": "def/hij/"})
testPath(t, tree, "/date/2014/ab%2f", "/date/:year/:month",
map[string]string{"year": "2014", "month": "ab/"})
testPath(t, tree, "/post/ab%2fdef/page/2%2f", "/post/:post/page/:page",
map[string]string{"post": "ab/def", "page": "2/"})
testPath(t, tree, "/ima/bcd/fgh", "", nil)
testPath(t, tree, "/date/2014//month", "", nil)
testPath(t, tree, "/date/2014/05/", "", nil) // Empty catchall should not match
testPath(t, tree, "/post//abc/page/2", "", nil)
testPath(t, tree, "/post/abc//page/2", "", nil)
testPath(t, tree, "/post/abc/page//2", "", nil)
testPath(t, tree, "//post/abc/page/2", "", nil)
testPath(t, tree, "//post//abc//page//2", "", nil)
t.Log("Test retrieval of duplicate paths")
params := make(map[string]string)
p := "date/:year/:month/abc"
n := tree.addPath(p, nil)
if n == nil {
t.Errorf("Duplicate add of %s didn't return a node", p)
} else {
handler, ok := n.leafHandler["GET"]
matchPath := ""
if ok {
handler(nil, nil, params)
matchPath = params["path"]
}
if len(matchPath) < 2 || matchPath[1:] != p {
t.Errorf("Duplicate add of %s returned node for %s\n%s", p, matchPath,
n.dumpTree("", " "))
}
}
checkHandlerNodes(t, tree)
t.Log(tree.dumpTree("", " "))
test = nil
}
func TestPanics(t *testing.T) {
sawPanic := false
panicHandler := func() {
if err := recover(); err != nil {
sawPanic = true
}
}
addPathPanic := func(p ...string) {
sawPanic = false
defer panicHandler()
tree := &node{path: "/"}
for _, path := range p {
tree.addPath(path, nil)
}
}
addPathPanic("abc/*path/")
if !sawPanic {
t.Error("Expected panic with slash after catch-all")
}
addPathPanic("abc/*path/def")
if !sawPanic {
t.Error("Expected panic with path segment after catch-all")
}
addPathPanic("abc/*path", "abc/*paths")
if !sawPanic {
t.Error("Expected panic when adding conflicting catch-alls")
}
func() {
sawPanic = false
defer panicHandler()
tree := &node{path: "/"}
tree.setHandler("GET", dummyHandler)
tree.setHandler("GET", dummyHandler)
}()
if !sawPanic {
t.Error("Expected panic when adding a duplicate handler for a pattern")
}
addPathPanic("abc/ab:cd")
if !sawPanic {
t.Error("Expected panic with : in middle of path segment")
}
addPathPanic("abc/ab", "abc/ab:cd")
if !sawPanic {
t.Error("Expected panic with : in middle of path segment with existing path")
}
addPathPanic("abc/ab*cd")
if !sawPanic {
t.Error("Expected panic with * in middle of path segment")
}
addPathPanic("abc/ab", "abc/ab*cd")
if !sawPanic {
t.Error("Expected panic with * in middle of path segment with existing path")
}
twoPathPanic := func(first, second string) {
addPathPanic(first, second)
if !sawPanic {
t.Errorf("Expected panic with ambiguous wildcards on paths %s and %s", first, second)
}
}
twoPathPanic("abc/:ab/def/:cd", "abc/:ad/def/:cd")
twoPathPanic("abc/:ab/def/:cd", "abc/:ab/def/:ef")
twoPathPanic(":abc", ":def")
twoPathPanic(":abc/ggg", ":def/ggg")
}
func BenchmarkTreeNullRequest(b *testing.B) {
b.ReportAllocs()
tree := &node{path: "/"}
b.ResetTimer()
for i := 0; i < b.N; i++ {
tree.search("")
}
}
func BenchmarkTreeOneStatic(b *testing.B) {
b.ReportAllocs()
tree := &node{path: "/"}
tree.addPath("abc", nil)
b.ResetTimer()
for i := 0; i < b.N; i++ {
tree.search("abc")
}
}
func BenchmarkTreeOneParam(b *testing.B) {
b.ReportAllocs()
tree := &node{path: "/"}
tree.addPath(":abc", nil)
b.ResetTimer()
for i := 0; i < b.N; i++ {
tree.search("abc")
}
}