Method addRoute

tree.go:125–267

addRoute adds a node with the given handle to the path. Not concurrency-safe!

(path string, handle RouterHandle, m ...Middleware)

// addRoute adds a node with the given handle to the path.
// Not concurrency-safe!
func (n *Node) addRoute(path string, handle RouterHandle, m ...Middleware) (outnode *Node) {
	outnode = n

	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:],
					fullPath:         n.fullPath,
					wildChild:        n.wildChild,
					nType:            static,
					indices:          n.indices,
					children:         n.children,
					handle:           n.handle,
					priority:         n.priority - 1,
					middlewares:      n.middlewares,
					groupMiddlewares: n.groupMiddlewares,
					appMiddlewares:   n.appMiddlewares,
				}

				// 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
				n.middlewares = nil
				n.groupMiddlewares = nil
				n.appMiddlewares = nil
			}