optimize nested conditional (#708)

Co-authored-by: heyanfu <heyanfu@kingsoft.com>

core/search/tree.go

@@ -97,23 +97,22 @@ func (t *Tree) next(n *node, route string, result *Result) bool {
 	}
 
 	for i := range route {
-		if route[i] == slash {
+		if route[i] != slash {
+			continue
+		}
 		token := route[:i]
 		return n.forEach(func(k string, v *node) bool {
-				if r := match(k, token); r.found {
-					if t.next(v, route[i+1:], result) {
+			r := match(k, token)
+			if !r.found || !t.next(v, route[i+1:], result) {
+				return false
+			}
 			if r.named {
 				addParam(result, r.key, r.value)
 			}
 
 			return true
-					}
-				}
-
-				return false
 		})
 	}
-	}
 
 	return n.forEach(func(k string, v *node) bool {
 		if r := match(k, route); r.found && v.item != nil {