refactor: replace sort.Slice with slices.Sort for natural ordering (#5218)

zhoujiaweii · web-flow · commit 41f26a41bcdb · 2025-09-19T15:21:30.000+03:00
Signed-off-by: zhoujiaweii &lt;zjwustc@outlook.com&gt;
diff --git a/pkg/manifest/mantaray/walker.go b/pkg/manifest/mantaray/walker.go
@@ -6,7 +6,7 @@ package mantaray
 
 import (
 	"context"
-	"sort"
+	"slices"
 )
 
 // WalkNodeFunc is the type of the function called for each node visited
@@ -34,7 +34,7 @@ func walkNode(ctx context.Context, path []byte, l Loader, n *Node, walkFn WalkNo
 	for k := range n.forks {
 		keys = append(keys, k)
 	}
-	sort.Slice(keys, func(i, j int) bool { return keys[i] < keys[j] })
+	slices.Sort(keys)
 
 	for _, k := range keys {
 		v := n.forks[k]

Original file line number	Diff line number	Diff line change
`@@ -6,7 +6,7 @@ package mantaray`
`6`	`6`
`7`	`7`	`import (`
`8`	`8`	`"context"`
`9`		`- "sort"`
	`9`	`+ "slices"`
`10`	`10`	`)`
`11`	`11`
`12`	`12`	`// WalkNodeFunc is the type of the function called for each node visited`
`@@ -34,7 +34,7 @@ func walkNode(ctx context.Context, path []byte, l Loader, n *Node, walkFn WalkNo`
`34`	`34`	`for k := range n.forks {`
`35`	`35`	`keys = append(keys, k)`
`36`	`36`	`}`
`37`		`- sort.Slice(keys, func(i, j int) bool { return keys[i] < keys[j] })`
	`37`	`+ slices.Sort(keys)`
`38`	`38`
`39`	`39`	`for _, k := range keys {`
`40`	`40`	`v := n.forks[k]`