Allowing overlapping catch all parameter

error.go

@@ -22,7 +22,7 @@ type RouteConflictError struct {
 
 func newConflictErr(method, path, catchAllKey string, matched []string) *RouteConflictError {
 	if catchAllKey != "" {
-		path += "*" + catchAllKey
+		path += "*{" + catchAllKey + "}"
 	}
 	return &RouteConflictError{
 		Method:  method,

iter.go

@@ -181,6 +181,11 @@ func (it *Iterator) Handler() Handler {
 	return nil
 }
 
+type stack struct {
+	method string
+	edges  []*node
+}
+
 func newRawIterator(n *node) *rawIterator {
 	return &rawIterator{
 		stack: []stack{{edges: []*node{n}}},
@@ -193,19 +198,6 @@ type rawIterator struct {
 	stack   []stack
 }
 
-type stack struct {
-	method string
-	edges  []*node
-}
-
-func (it *rawIterator) fullPath() string {
-	return it.path
-}
-
-func (it *rawIterator) node() *node {
-	return it.current
-}
-
 func (it *rawIterator) hasNext() bool {
 	for len(it.stack) > 0 {
 		n := len(it.stack)

node.go

@@ -206,3 +206,24 @@ func (n *node) string(space int) string {
 	}
 	return sb.String()
 }
+
+type skippedNodes []skippedNode
+
+func (n *skippedNodes) free(t *Tree) {
+	if cap(*n) < int(t.maxDepth.Load()) {
+		return
+	}
+	*n = (*n)[:0]
+	t.np.Put(n)
+}
+
+func (n *skippedNodes) pop() skippedNode {
+	skipped := (*n)[len(*n)-1]
+	*n = (*n)[:len(*n)-1]
+	return skipped
+}
+
+type skippedNode struct {
+	node      *node
+	pathIndex int
+}

router.go

@@ -108,8 +108,8 @@ func (fox *Router) NewTree() *Tree {
 
 	tree.np = sync.Pool{
 		New: func() any {
-			skippedNodes := make([]skippedNode, 0, tree.maxDepth.Load())
-			return &skippedNodes
+			skpNds := make(skippedNodes, 0, tree.maxDepth.Load())
+			return &skpNds
 		},
 	}
 
@@ -232,7 +232,7 @@ NEXT:
 		method := nds[i].key
 		it := newRawIterator(nds[i])
 		for it.hasNext() {
-			err := fn(method, it.fullPath(), it.node().handler)
+			err := fn(method, it.path, it.current.handler)
 			if err != nil {
 				if errors.Is(err, SkipMethod) {
 					continue NEXT
@@ -520,6 +520,15 @@ func parseRoute(path string) (string, string, int, error) {
 
 func getRouteConflict(n *node) []string {
 	routes := make([]string, 0)
+
+	if n.isCatchAll() {
+		routes = append(routes, n.path)
+		return routes
+	}
+
+	if n.paramChildIndex >= 0 {
+		n = n.children[n.paramChildIndex].Load()
+	}
 	it := newRawIterator(n)
 	for it.hasNext() {
 		routes = append(routes, it.current.path)