-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtree.go
74 lines (67 loc) · 1.39 KB
/
tree.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
package mux
import (
"fmt"
"net/http"
"github.com/matthewmueller/enroute"
)
type tree struct {
Tree *enroute.Tree
Handlers map[string]http.Handler
}
func (t *tree) Insert(route string, handler http.Handler) error {
if err := t.Tree.Insert(route, route); err != nil {
return err
}
t.Handlers[route] = handler
return nil
}
func (t *tree) Find(method, route string) (*Route, error) {
node, err := t.Tree.Find(route)
if err != nil {
return nil, err
}
handler, ok := t.Handlers[route]
if !ok {
return nil, fmt.Errorf("router: handler not found for %s %s", method, route)
}
return &Route{
Method: method,
Route: node.Route,
Handler: handler,
}, nil
}
func (t *tree) Match(method, path string) (*Match, error) {
m, err := t.Tree.Match(path)
if err != nil {
return nil, err
}
handler, ok := t.Handlers[m.Value]
if !ok {
return nil, fmt.Errorf("router: no handler provided for %s %s", method, path)
}
return &Match{
Method: method,
Route: m.Route,
Path: m.Path,
Slots: m.Slots,
Handler: handler,
}, nil
}
func (t *tree) Routes(method string) (routes []*Route) {
t.Tree.Each(func(node *enroute.Node) bool {
if node.Route == "" {
return true
}
handler, ok := t.Handlers[node.Value]
if !ok {
return true
}
routes = append(routes, &Route{
Method: method,
Route: node.Route,
Handler: handler,
})
return true
})
return routes
}