blackteay/gin
3
0
Fork 0
mirror of https://github.com/gin-gonic/gin.git synced 2026-07-08 11:41:09 +08:00
Code Issues Projects Releases Wiki Activity

refactor: create seperate function to handle empty tree condition

Browse Source
This commit is contained in:
72 2026-04-28 09:17:13 +05:00
parent d3ffc99852
commit ad38d93dbc
1 changed files with 16 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
tree.go
View File

@ -130,18 +130,28 @@ func (n *node) incrementChildPrio(pos int) int {
return newPos return newPos
} }
func (n *node) compareEmptyTree(path string, fullPath string, handlers HandlersChain) {
if len(n.path) == 0 && len(n.children) == 0 {
n.insertChild(path, fullPath, handlers)
n.nType = root
return
}
}
// addRoute adds a node with the given handle to the path. // addRoute adds a node with the given handle to the path.
// Not concurrency-safe! // Not concurrency-safe!
func (n *node) addRoute(path string, handlers HandlersChain) { func (n *node) addRoute(path string, handlers HandlersChain) {
fullPath := path fullPath := path
n.priority++ n.priority++
// Empty tree // // Empty tree
if len(n.path) == 0 && len(n.children) == 0 { // if len(n.path) == 0 && len(n.children) == 0 {
n.insertChild(path, fullPath, handlers) // n.insertChild(path, fullPath, handlers)
n.nType = root // n.nType = root
return // return
} // }
n.compareEmptyTree(path, fullPath, handlers)
parentFullPathIndex := 0 parentFullPathIndex := 0