-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathtrie.go
128 lines (116 loc) · 2.34 KB
/
trie.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
package myrouter
import (
"net/http"
"strings"
)
// tree is a trie tree.
type tree struct {
node *node
}
type node struct {
label string
actions map[string]*action // key is method
children map[string]*node // key is a label o f next nodes
}
// action is an action.
type action struct {
handler http.Handler
}
// result is a search result.
type result struct {
actions *action
}
const (
pathRoot string = "/"
pathDelimiter string = "/"
)
// newResult creates a new result.
func newResult() *result {
return &result{}
}
// NewTree creates a new trie tree.
func NewTree() *tree {
return &tree{
node: &node{
label: pathRoot,
actions: make(map[string]*action),
children: make(map[string]*node),
},
}
}
// Insert inserts a route definition to tree.
func (t *tree) Insert(methods []string, path string, handler http.Handler) error {
curNode := t.node
if path == pathRoot {
curNode.label = path
for _, method := range methods {
curNode.actions[method] = &action{
handler: handler,
}
}
return nil
}
ep := explodePath(path)
for i, p := range ep {
nextNode, ok := curNode.children[p]
if ok {
curNode = nextNode
}
// Create a new node.
if !ok {
curNode.children[p] = &node{
label: p,
actions: make(map[string]*action),
children: make(map[string]*node),
}
curNode = curNode.children[p]
}
// last loop.
// If there is already registered data, overwrite it.
if i == len(ep)-1 {
curNode.label = p
for _, method := range methods {
curNode.actions[method] = &action{
handler: handler,
}
}
break
}
}
return nil
}
func (t *tree) Search(method string, path string) (*result, error) {
result := newResult()
curNode := t.node
if path != pathRoot {
for _, p := range explodePath(path) {
nextNode, ok := curNode.children[p]
if !ok {
if p == curNode.label {
break
} else {
return nil, ErrNotFound
}
}
curNode = nextNode
continue
}
}
result.actions = curNode.actions[method]
if result.actions == nil {
// no matching handler was found.
return nil, ErrMethodNotAllowed
}
return result, nil
}
// explodePath removes an empty value in slice.
func explodePath(path string) []string {
s := strings.Split(path, pathDelimiter)
var r []string
for _, str := range s {
if str != "" {
r = append(r, str)
}
}
return r
}