/
radix_star_test.go
206 lines (181 loc) · 4.62 KB
/
radix_star_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
package radix
import (
"testing"
)
type (
routeAndValue struct {
r string
v int
}
routes []routeAndValue
)
// PrintTree: Print out current tree struct, it will using \t for tree level
func (t *TreeTester) PrintStarTree(currentNode *Node, treeLevel int) {
if currentNode == nil {
currentNode = &t.root
}
tabs := ""
for i := 1; i < treeLevel; i++ {
tabs = tabs + "\t"
}
if currentNode.isLeaf() {
// Reach the end point
t.logger("%s[%d] Leaf key : %q value : %v\n", tabs, treeLevel, currentNode.leaf.key, currentNode.leaf.value)
return
}
t.logger("%s[%d] Node has %d edges \n", tabs, treeLevel, len(currentNode.edges))
for _, edge := range currentNode.edges {
if edge.isStar() {
t.logger("%s[%d] StarEdge [%q]\n", tabs, treeLevel, edge.label)
} else {
t.logger("%s[%d] NormalEdge [%q]\n", tabs, treeLevel, edge.label)
}
t.PrintTree(edge.child, treeLevel+1)
}
if treeLevel == 1 {
t.logger("Tree printed.\n\n")
}
}
// This should work with only one route defined
func TestStarOneRoute(t *testing.T) {
useSortEdges = true
rTree := &TreeTester{logger: t.Logf}
rTree.Insert("*/*", 5555)
// without the below insertion, works fine, but you won't be able to collect the parameters correctly
rTree.Insert("*/never-matched", 10000)
ret, find := rTree.StarSearch("something/else")
if !find || ret != 5555 {
t.Errorf("Lookup failed, expect '5555', but got %v", ret)
} else {
t.Log("Ok `something/else` ", ret)
}
ret, find = rTree.StarSearch("do/else")
if !find || ret != 5555 {
t.Errorf("Lookup failed, expect '5555', but got %v", ret)
} else {
t.Log("Ok `do/else` ", ret)
}
rTree.PrintStarTree(nil, 1)
}
func TestStar(t *testing.T) {
useSortEdges = true
rTree := &TreeTester{logger: t.Logf}
routes := routes{
{
"*", 11,
}, {
"test", 1,
}, {
"team", 2,
}, {
"trouble", 3,
}, {
"apple", 4,
}, {
"app", 5,
}, {
"app/blah", 555,
}, {
"app/blah/blah", 5555,
}, {
"app/blah/blah?*", 10000,
}, {
"tesla", 6,
}, {
"test/*", 12,
}, {
"test/*/*", 13,
}, {
"test/*/*?*", 14,
}, {
"tesla/copy/*?*", 202,
}, {
"tesla/particular/*?*", 220,
}, {
"tesla/*/*?*", 200,
}, {
"tesla/*/paste", 205,
}, {
"tesla/*/paste/*?*", 210,
},
}
for _, route := range routes {
rTree.Insert(route.r, route.v)
}
var ret interface{}
var find bool
ret, find = rTree.StarSearch("app/blah/blah")
if !find || ret != 5555 {
t.Errorf("Lookup failed, expect '5555', but got %v", ret)
} else {
t.Log("Ok `app/blah/blah` ", ret)
}
ret, find = rTree.StarSearch("app/blah/blah?filter=blah")
if !find || ret != 10000 {
t.Errorf("Lookup failed, expect '10000', but got %v", ret)
} else {
t.Log("Ok `app/blah/blah?filter=blah` ", ret)
}
ret, find = rTree.StarSearch("app/blah")
if !find || ret != 555 {
t.Errorf("Lookup failed, expect '555', but got %v", ret)
} else {
t.Log("Ok `app/blah` ", ret)
}
ret, find = rTree.StarSearch("tesla/copy/oops?search=blah")
if !find || ret != 202 {
t.Errorf("Lookup failed, expect '202', but got %v", ret)
} else {
t.Log("Ok `tesla/copy/oops?search=blah` ", ret)
}
ret, find = rTree.StarSearch("test/457/doo?search=string")
if !find || ret != 14 {
t.Errorf("Lookup failed, expect '14', but got %v", ret)
} else {
t.Log("Ok `test/457/doo?search=string` ", ret)
}
ret, find = rTree.StarSearch("test/123")
if !find || ret != 12 {
t.Errorf("Lookup failed, expect '12', but got %v", ret)
} else {
t.Log("OK `test/123` ", ret)
}
ret, find = rTree.StarSearch("test/123/abc")
if !find || ret != 13 {
t.Errorf("Lookup failed, expect '13', but got %v", ret)
} else {
t.Log("OK `test/123/abc` ", ret)
}
ret, find = rTree.StarSearch("tesla/457/paste/oops?search=blah")
if !find || ret != 210 {
t.Errorf("Lookup failed, expect '210', but got %v", ret)
} else {
t.Log("Ok `tesla/457/paste/oops?search=blah` ", ret)
}
ret, find = rTree.StarSearch("tesla/457/paste")
if !find || ret != 205 {
t.Errorf("Lookup failed, expect '205', but got %v", ret)
} else {
t.Log("Ok `tesla/457/paste` ", ret)
}
ret, find = rTree.StarSearch("tesla/457/doo?search=string")
if !find || ret != 200 {
t.Errorf("Lookup failed, expect '200', but got %v", ret)
} else {
t.Log("Ok `tesla/457/doo?search=string` ", ret)
}
ret, find = rTree.StarSearch("trouble")
if !find || ret != 3 {
t.Errorf("Lookup failed, expect '3', but got %v", ret)
} else {
t.Log("Ok `trouble` ", ret)
}
ret, find = rTree.StarSearch("something")
if !find || ret != 11 {
t.Errorf("Lookup failed, expect (universal) '11', but got %v", ret)
} else {
t.Log("Ok `something` ", ret)
}
rTree.PrintStarTree(nil, 1)
t.Log("Test finished.")
}