mirror of
https://github.com/kataras/iris.git
synced 2025-02-02 23:40:35 +01:00
14e7751d21
New package "memstore" created, read it to see how I made it. Former-commit-id: 9edc344b938786b2ef68defec03c44259a2d539c
440 lines
11 KiB
Go
440 lines
11 KiB
Go
// Copyright 2013 Julien Schmidt. All rights reserved.
|
|
// Copyright 2017 Gerasimos Maropoulos, ΓΜ. All rights reserved.
|
|
// Use of the below source code is governed by the BSD 3-Clause license.
|
|
|
|
package httprouter
|
|
|
|
import (
|
|
"strings"
|
|
|
|
"github.com/kataras/iris/context"
|
|
"github.com/kataras/iris/core/errors"
|
|
)
|
|
|
|
func min(a, b int) int {
|
|
if a <= b {
|
|
return a
|
|
}
|
|
return b
|
|
}
|
|
|
|
func countParams(path string) uint8 {
|
|
var n uint
|
|
for i := 0; i < len(path); i++ {
|
|
if path[i] != ':' && path[i] != '*' {
|
|
continue
|
|
}
|
|
n++
|
|
}
|
|
if n >= 255 {
|
|
return 255
|
|
}
|
|
return uint8(n)
|
|
}
|
|
|
|
type nodeType uint8
|
|
|
|
const (
|
|
static nodeType = iota // default
|
|
root
|
|
param
|
|
catchAll
|
|
)
|
|
|
|
// Node is the default request handler's tree's entry type.
|
|
// Examples of its algorithm can be found via googling or via youtube
|
|
// search term: trie, tree sort, data structures: tree, reversed tree, sort tree etc...
|
|
type Node struct {
|
|
path string
|
|
wildChild bool
|
|
nType nodeType
|
|
maxParams uint8
|
|
indices string
|
|
children []*Node
|
|
handle context.Handlers
|
|
priority uint32
|
|
}
|
|
|
|
// increments priority of the given child and reorders if necessary
|
|
func (n *Node) incrementChildPrio(pos int) int {
|
|
n.children[pos].priority++
|
|
prio := n.children[pos].priority
|
|
|
|
// adjust position (move to front)
|
|
newPos := pos
|
|
for newPos > 0 && n.children[newPos-1].priority < prio {
|
|
// swap Node positions
|
|
n.children[newPos-1], n.children[newPos] = n.children[newPos], n.children[newPos-1]
|
|
|
|
newPos--
|
|
}
|
|
|
|
// build new index char string
|
|
if newPos != pos {
|
|
n.indices = n.indices[:newPos] + // unchanged prefix, might be empty
|
|
n.indices[pos:pos+1] + // the index char we move
|
|
n.indices[newPos:pos] + n.indices[pos+1:] // rest without char at 'pos'
|
|
}
|
|
|
|
return newPos
|
|
}
|
|
|
|
// AddRoute adds a route with the given handler to the path.
|
|
func (n *Node) AddRoute(path string, handle context.Handlers) error {
|
|
fullPath := path
|
|
n.priority++
|
|
numParams := countParams(path)
|
|
|
|
// non-empty tree
|
|
if len(n.path) > 0 || len(n.children) > 0 {
|
|
walk:
|
|
for {
|
|
// Update maxParams of the current Node
|
|
if numParams > n.maxParams {
|
|
n.maxParams = numParams
|
|
}
|
|
|
|
// Find the longest common prefix.
|
|
// This also implies that the common prefix contains no ':' or '*'
|
|
// since the existing key can't contain those chars.
|
|
i := 0
|
|
max := min(len(path), len(n.path))
|
|
for i < max && path[i] == n.path[i] {
|
|
i++
|
|
}
|
|
|
|
// Split edge
|
|
if i < len(n.path) {
|
|
child := Node{
|
|
path: n.path[i:],
|
|
wildChild: n.wildChild,
|
|
nType: static,
|
|
indices: n.indices,
|
|
children: n.children,
|
|
handle: n.handle,
|
|
priority: n.priority - 1,
|
|
}
|
|
|
|
// Update maxParams (max of all children)
|
|
for i := range child.children {
|
|
if child.children[i].maxParams > child.maxParams {
|
|
child.maxParams = child.children[i].maxParams
|
|
}
|
|
}
|
|
|
|
n.children = []*Node{&child}
|
|
// []byte for proper unicode char conversion, see #65
|
|
n.indices = string([]byte{n.path[i]})
|
|
n.path = path[:i]
|
|
n.handle = nil
|
|
n.wildChild = false
|
|
}
|
|
|
|
// Make new Node a child of this Node
|
|
if i < len(path) {
|
|
path = path[i:]
|
|
|
|
if n.wildChild {
|
|
n = n.children[0]
|
|
n.priority++
|
|
|
|
// Update maxParams of the child Node
|
|
if numParams > n.maxParams {
|
|
n.maxParams = numParams
|
|
}
|
|
numParams--
|
|
|
|
// Check if the wildcard matches
|
|
if len(path) >= len(n.path) && n.path == path[:len(n.path)] &&
|
|
// Check for longer wildcard, e.g. :name and :names
|
|
(len(n.path) >= len(path) || path[len(n.path)] == '/') {
|
|
continue walk
|
|
} else {
|
|
// Wildcard conflict
|
|
pathSeg := strings.SplitN(path, "/", 2)[0]
|
|
prefix := fullPath[:strings.Index(fullPath, pathSeg)] + n.path
|
|
return errors.New("'" + pathSeg +
|
|
"' in new path '" + fullPath +
|
|
"' conflicts with existing wildcard '" + n.path +
|
|
"' in existing prefix '" + prefix +
|
|
"'")
|
|
}
|
|
}
|
|
|
|
c := path[0]
|
|
|
|
// slash after param
|
|
if n.nType == param && c == '/' && len(n.children) == 1 {
|
|
n = n.children[0]
|
|
n.priority++
|
|
continue walk
|
|
}
|
|
|
|
// Check if a child with the next path byte exists
|
|
for i := 0; i < len(n.indices); i++ {
|
|
if c == n.indices[i] {
|
|
i = n.incrementChildPrio(i)
|
|
n = n.children[i]
|
|
continue walk
|
|
}
|
|
}
|
|
|
|
// Otherwise insert it
|
|
if c != ':' && c != '*' {
|
|
// []byte for proper unicode char conversion, see #65
|
|
n.indices += string([]byte{c})
|
|
child := &Node{
|
|
maxParams: numParams,
|
|
}
|
|
n.children = append(n.children, child)
|
|
n.incrementChildPrio(len(n.indices) - 1)
|
|
n = child
|
|
}
|
|
return n.insertChild(numParams, path, fullPath, handle)
|
|
|
|
} else if i == len(path) { // Make Node a (in-path) leaf
|
|
if n.handle != nil {
|
|
return errors.New("a handle is already registered for path '" + fullPath + "'")
|
|
}
|
|
n.handle = handle
|
|
}
|
|
return nil
|
|
}
|
|
} else { // Empty tree
|
|
n.insertChild(numParams, path, fullPath, handle)
|
|
n.nType = root
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (n *Node) insertChild(numParams uint8, path, fullPath string, handle context.Handlers) error {
|
|
var offset int // already handled bytes of the path
|
|
|
|
// find prefix until first wildcard (beginning with ':'' or '*'')
|
|
for i, max := 0, len(path); numParams > 0; i++ {
|
|
c := path[i]
|
|
if c != ':' && c != '*' {
|
|
continue
|
|
}
|
|
|
|
// find wildcard end (either '/' or path end)
|
|
end := i + 1
|
|
for end < max && path[end] != '/' {
|
|
switch path[end] {
|
|
// the wildcard name must not contain ':' and '*'
|
|
case ':', '*':
|
|
return errors.New("only one wildcard per path segment is allowed, has: '" +
|
|
path[i:] + "' in path '" + fullPath + "'")
|
|
default:
|
|
end++
|
|
}
|
|
}
|
|
|
|
// check if this Node existing children which would be
|
|
// unreachable if we insert the wildcard here
|
|
if len(n.children) > 0 {
|
|
return errors.New("wildcard route '" + path[i:end] +
|
|
"' conflicts with existing children in path '" + fullPath + "'")
|
|
}
|
|
|
|
// check if the wildcard has a name
|
|
if end-i < 2 {
|
|
return errors.New("wildcards must be named with a non-empty name in path '" + fullPath + "'")
|
|
}
|
|
|
|
if c == ':' { // param
|
|
// split path at the beginning of the wildcard
|
|
if i > 0 {
|
|
n.path = path[offset:i]
|
|
offset = i
|
|
}
|
|
|
|
child := &Node{
|
|
nType: param,
|
|
maxParams: numParams,
|
|
}
|
|
n.children = []*Node{child}
|
|
n.wildChild = true
|
|
n = child
|
|
n.priority++
|
|
numParams--
|
|
|
|
// if the path doesn't end with the wildcard, then there
|
|
// will be another non-wildcard subpath starting with '/'
|
|
if end < max {
|
|
n.path = path[offset:end]
|
|
offset = end
|
|
|
|
child := &Node{
|
|
maxParams: numParams,
|
|
priority: 1,
|
|
}
|
|
n.children = []*Node{child}
|
|
n = child
|
|
}
|
|
|
|
} else { // catchAll
|
|
if end != max || numParams > 1 {
|
|
return errors.New("catch-all routes are only allowed at the end of the path in path '" + fullPath + "'")
|
|
}
|
|
|
|
if len(n.path) > 0 && n.path[len(n.path)-1] == '/' {
|
|
return errors.New("catch-all conflicts with existing handle for the path segment root in path '" + fullPath + "'")
|
|
}
|
|
|
|
// currently fixed width 1 for '/'
|
|
i--
|
|
if path[i] != '/' {
|
|
return errors.New("no / before catch-all in path '" + fullPath + "'")
|
|
}
|
|
|
|
n.path = path[offset:i]
|
|
|
|
// first Node: catchAll Node with empty path
|
|
child := &Node{
|
|
wildChild: true,
|
|
nType: catchAll,
|
|
maxParams: 1,
|
|
}
|
|
n.children = []*Node{child}
|
|
n.indices = string(path[i])
|
|
n = child
|
|
n.priority++
|
|
|
|
// second Node: Node holding the variable
|
|
child = &Node{
|
|
path: path[i:],
|
|
nType: catchAll,
|
|
maxParams: 1,
|
|
handle: handle,
|
|
priority: 1,
|
|
}
|
|
n.children = []*Node{child}
|
|
|
|
return nil
|
|
}
|
|
}
|
|
|
|
// insert remaining path part and handle to the leaf
|
|
n.path = path[offset:]
|
|
n.handle = handle
|
|
return nil
|
|
}
|
|
|
|
// ResolveRoute sets the handlers registered to a given path which is acquiring by ctx.Path().
|
|
// The values of
|
|
// wildcards are saved to the context's Values.
|
|
// If no handle can be found, a TSR (trailing slash redirect) recommendation is
|
|
// made if a handle exists with an extra (without the) trailing slash for the
|
|
// given context.
|
|
//
|
|
// ResolveRoute finds the correct registered route from the Node when the ctx.Handlers() > 0.
|
|
func (n *Node) ResolveRoute(ctx context.Context) (handlers context.Handlers, tsr bool) { //(p context.RequestParams, tsr bool) {
|
|
path := ctx.Request().URL.Path
|
|
handlers = ctx.Handlers()
|
|
walk: // outer loop for walking the tree
|
|
for {
|
|
if len(path) > len(n.path) {
|
|
if path[:len(n.path)] == n.path {
|
|
path = path[len(n.path):]
|
|
// If this Node does not have a wildcard (param or catchAll)
|
|
// child, we can just look up the next child Node and continue
|
|
// to walk down the tree
|
|
if !n.wildChild {
|
|
c := path[0]
|
|
for i := 0; i < len(n.indices); i++ {
|
|
if c == n.indices[i] {
|
|
n = n.children[i]
|
|
continue walk
|
|
}
|
|
}
|
|
|
|
// Nothing found.
|
|
// We can recommend to redirect to the same URL without a
|
|
// trailing slash if a leaf exists for that path.
|
|
tsr = (path == "/" && n.handle != nil)
|
|
return
|
|
|
|
}
|
|
|
|
// handle wildcard child
|
|
n = n.children[0]
|
|
switch n.nType {
|
|
case param:
|
|
// find param end (either '/' or path end)
|
|
end := 0
|
|
for end < len(path) && path[end] != '/' {
|
|
end++
|
|
}
|
|
|
|
// save param value
|
|
ctx.Params().Set(n.path[1:], path[:end])
|
|
// we need to go deeper!
|
|
if end < len(path) {
|
|
if len(n.children) > 0 {
|
|
path = path[end:]
|
|
n = n.children[0]
|
|
continue walk
|
|
}
|
|
|
|
// ... but we can't
|
|
tsr = (len(path) == end+1)
|
|
return
|
|
}
|
|
|
|
if handlers = n.handle; handlers != nil {
|
|
return
|
|
} else if len(n.children) == 1 {
|
|
// No handle found. Check if a handle for this path + a
|
|
// trailing slash exists for TSR recommendation
|
|
n = n.children[0]
|
|
tsr = (n.path == "/" && n.handle != nil)
|
|
}
|
|
|
|
return
|
|
|
|
case catchAll:
|
|
ctx.Params().Set(n.path[2:], path)
|
|
handlers = n.handle
|
|
return
|
|
|
|
default:
|
|
// invalid Node type here
|
|
return
|
|
}
|
|
}
|
|
} else if path == n.path {
|
|
// We should have reached the Node containing the handle.
|
|
// Check if this Node has a handle registered.
|
|
if handlers = n.handle; handlers != nil {
|
|
return
|
|
}
|
|
|
|
if path == "/" && n.wildChild && n.nType != root {
|
|
tsr = true
|
|
return
|
|
}
|
|
|
|
// No handle found. Check if a handle for this path + a
|
|
// trailing slash exists for trailing slash recommendation
|
|
for i := 0; i < len(n.indices); i++ {
|
|
if n.indices[i] == '/' {
|
|
n = n.children[i]
|
|
tsr = (len(n.path) == 1 && n.handle != nil) ||
|
|
(n.nType == catchAll && n.children[0].handle != nil)
|
|
return
|
|
}
|
|
}
|
|
|
|
return
|
|
}
|
|
|
|
// Nothing found. We can recommend to redirect to the same URL with an
|
|
// extra trailing slash if a leaf exists for that path
|
|
tsr = (path == "/") ||
|
|
(len(n.path) == len(path)+1 && n.path[len(path)] == '/' &&
|
|
path == n.path[:len(n.path)-1] && n.handle != nil)
|
|
return
|
|
}
|
|
}
|