mirror of
https://github.com/kataras/iris.git
synced 2025-12-24 05:17:03 +00:00
add my new trie data structure implementation written from scratch and specifically designed for HTTP (and Iris) - see https://github.com/kataras/muxie for the net/http version of it
Former-commit-id: 4eed1585f29b57418b61f6de058f5d6db4bb98bf
This commit is contained in:
Gerasimos (Makis) Maropoulos
267
core/router/trie.go
Normal file
267
core/router/trie.go
Normal file
@@ -0,0 +1,267 @@
|
||||
package router
|
||||
|
||||
import (
|
||||
"strings"
|
||||
|
||||
"github.com/kataras/iris/context"
|
||||
)
|
||||
|
||||
const (
|
||||
// ParamStart the character in string representation where the underline router starts its dynamic named parameter.
|
||||
ParamStart = ":"
|
||||
// WildcardParamStart the character in string representation where the underline router starts its dynamic wildcard
|
||||
// path parameter.
|
||||
WildcardParamStart = "*"
|
||||
)
|
||||
|
||||
// An iris-specific identical version of the https://github.com/kataras/muxie version 1.0.0 released at 15 Oct 2018
|
||||
type trieNode struct {
|
||||
parent *trieNode
|
||||
|
||||
children map[string]*trieNode
|
||||
hasDynamicChild bool // does one of the children contains a parameter or wildcard?
|
||||
childNamedParameter bool // is the child a named parameter (single segmnet)
|
||||
childWildcardParameter bool // or it is a wildcard (can be more than one path segments) ?
|
||||
paramKeys []string // the param keys without : or *.
|
||||
end bool // it is a complete node, here we stop and we can say that the node is valid.
|
||||
key string // if end == true then key is filled with the original value of the insertion's key.
|
||||
// if key != "" && its parent has childWildcardParameter == true,
|
||||
// we need it to track the static part for the closest-wildcard's parameter storage.
|
||||
staticKey string
|
||||
|
||||
// insert data.
|
||||
Handlers context.Handlers
|
||||
RouteName string
|
||||
}
|
||||
|
||||
func newTrieNode() *trieNode {
|
||||
n := new(trieNode)
|
||||
return n
|
||||
}
|
||||
|
||||
func (tn *trieNode) hasChild(s string) bool {
|
||||
return tn.getChild(s) != nil
|
||||
}
|
||||
|
||||
func (tn *trieNode) getChild(s string) *trieNode {
|
||||
if tn.children == nil {
|
||||
tn.children = make(map[string]*trieNode)
|
||||
}
|
||||
|
||||
return tn.children[s]
|
||||
}
|
||||
|
||||
func (tn *trieNode) addChild(s string, n *trieNode) {
|
||||
if tn.children == nil {
|
||||
tn.children = make(map[string]*trieNode)
|
||||
}
|
||||
|
||||
if _, exists := tn.children[s]; exists {
|
||||
return
|
||||
}
|
||||
|
||||
n.parent = tn
|
||||
tn.children[s] = n
|
||||
}
|
||||
|
||||
func (tn *trieNode) findClosestParentWildcardNode() *trieNode {
|
||||
tn = tn.parent
|
||||
for tn != nil {
|
||||
if tn.childWildcardParameter {
|
||||
return tn.getChild(WildcardParamStart)
|
||||
}
|
||||
|
||||
tn = tn.parent
|
||||
}
|
||||
|
||||
return nil
|
||||
}
|
||||
|
||||
func (tn *trieNode) String() string {
|
||||
return tn.key
|
||||
}
|
||||
|
||||
type trie struct {
|
||||
root *trieNode
|
||||
|
||||
// if true then it will handle any path if not other parent wildcard exists,
|
||||
// so even 404 (on http services) is up to it, see trie#insert.
|
||||
hasRootWildcard bool
|
||||
|
||||
method string
|
||||
// subdomain is empty for default-hostname routes,
|
||||
// ex: mysubdomain.
|
||||
subdomain string
|
||||
}
|
||||
|
||||
func newTrie() *trie {
|
||||
return &trie{
|
||||
root: newTrieNode(),
|
||||
}
|
||||
}
|
||||
|
||||
const (
|
||||
pathSep = "/"
|
||||
pathSepB = '/'
|
||||
)
|
||||
|
||||
func slowPathSplit(path string) []string {
|
||||
if path == "/" {
|
||||
return []string{"/"}
|
||||
}
|
||||
|
||||
return strings.Split(path, pathSep)[1:]
|
||||
}
|
||||
|
||||
func (tr *trie) insert(path, routeName string, handlers context.Handlers) {
|
||||
input := slowPathSplit(path)
|
||||
|
||||
n := tr.root
|
||||
var paramKeys []string
|
||||
|
||||
for _, s := range input {
|
||||
c := s[0]
|
||||
|
||||
if isParam, isWildcard := c == ParamStart[0], c == WildcardParamStart[0]; isParam || isWildcard {
|
||||
n.hasDynamicChild = true
|
||||
paramKeys = append(paramKeys, s[1:]) // without : or *.
|
||||
|
||||
// if node has already a wildcard, don't force a value, check for true only.
|
||||
if isParam {
|
||||
n.childNamedParameter = true
|
||||
s = ParamStart
|
||||
}
|
||||
|
||||
if isWildcard {
|
||||
n.childWildcardParameter = true
|
||||
s = WildcardParamStart
|
||||
if tr.root == n {
|
||||
tr.hasRootWildcard = true
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if !n.hasChild(s) {
|
||||
child := newTrieNode()
|
||||
n.addChild(s, child)
|
||||
}
|
||||
|
||||
n = n.getChild(s)
|
||||
}
|
||||
|
||||
n.RouteName = routeName
|
||||
n.Handlers = handlers
|
||||
n.paramKeys = paramKeys
|
||||
n.key = path
|
||||
n.end = true
|
||||
|
||||
i := strings.Index(path, ParamStart)
|
||||
if i == -1 {
|
||||
i = strings.Index(path, WildcardParamStart)
|
||||
}
|
||||
if i == -1 {
|
||||
i = len(n.key)
|
||||
}
|
||||
|
||||
n.staticKey = path[:i]
|
||||
}
|
||||
|
||||
func (tr *trie) search(q string, params *context.RequestParams) *trieNode {
|
||||
end := len(q)
|
||||
n := tr.root
|
||||
if end == 1 && q[0] == pathSepB {
|
||||
return n.getChild(pathSep)
|
||||
}
|
||||
|
||||
start := 1
|
||||
i := 1
|
||||
var paramValues []string
|
||||
|
||||
for {
|
||||
if i == end || q[i] == pathSepB {
|
||||
if child := n.getChild(q[start:i]); child != nil {
|
||||
n = child
|
||||
} else if n.childNamedParameter {
|
||||
n = n.getChild(ParamStart)
|
||||
if ln := len(paramValues); cap(paramValues) > ln {
|
||||
paramValues = paramValues[:ln+1]
|
||||
paramValues[ln] = q[start:i]
|
||||
} else {
|
||||
paramValues = append(paramValues, q[start:i])
|
||||
}
|
||||
} else if n.childWildcardParameter {
|
||||
n = n.getChild(WildcardParamStart)
|
||||
if ln := len(paramValues); cap(paramValues) > ln {
|
||||
paramValues = paramValues[:ln+1]
|
||||
paramValues[ln] = q[start:]
|
||||
} else {
|
||||
paramValues = append(paramValues, q[start:])
|
||||
}
|
||||
break
|
||||
} else {
|
||||
n = n.findClosestParentWildcardNode()
|
||||
if n != nil {
|
||||
// means that it has :param/static and *wildcard, we go trhough the :param
|
||||
// but the next path segment is not the /static, so go back to *wildcard
|
||||
// instead of not found.
|
||||
//
|
||||
// Fixes:
|
||||
// /hello/*p
|
||||
// /hello/:p1/static/:p2
|
||||
// req: http://localhost:8080/hello/dsadsa/static/dsadsa => found
|
||||
// req: http://localhost:8080/hello/dsadsa => but not found!
|
||||
// and
|
||||
// /second/wild/*p
|
||||
// /second/wild/static/otherstatic/
|
||||
// req: /second/wild/static/otherstatic/random => but not found!
|
||||
params.Set(n.paramKeys[0], q[len(n.staticKey):])
|
||||
return n
|
||||
}
|
||||
|
||||
return nil
|
||||
}
|
||||
|
||||
if i == end {
|
||||
break
|
||||
}
|
||||
|
||||
i++
|
||||
start = i
|
||||
continue
|
||||
}
|
||||
|
||||
i++
|
||||
}
|
||||
|
||||
if n == nil || !n.end {
|
||||
if n != nil { // we need it on both places, on last segment (below) or on the first unnknown (above).
|
||||
if n = n.findClosestParentWildcardNode(); n != nil {
|
||||
params.Set(n.paramKeys[0], q[len(n.staticKey):])
|
||||
return n
|
||||
}
|
||||
}
|
||||
|
||||
if tr.hasRootWildcard {
|
||||
// that's the case for root wildcard, tests are passing
|
||||
// even without it but stick with it for reference.
|
||||
// Note ote that something like:
|
||||
// Routes: /other2/*myparam and /other2/static
|
||||
// Reqs: /other2/staticed will be handled
|
||||
// the /other2/*myparam and not the root wildcard, which is what we want.
|
||||
//
|
||||
n = tr.root.getChild(WildcardParamStart)
|
||||
params.Set(n.paramKeys[0], q[1:])
|
||||
return n
|
||||
}
|
||||
|
||||
return nil
|
||||
}
|
||||
|
||||
for i, paramValue := range paramValues {
|
||||
if len(n.paramKeys) > i {
|
||||
params.Set(n.paramKeys[i], paramValue)
|
||||
}
|
||||
}
|
||||
|
||||
return n
|
||||
}
|
||||
Reference in New Issue
Block a user