Skip to content

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

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
martinconic merged 1 commit into from
Sep 19, 2025
+2 −2
Merged

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

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions pkg/manifest/mantaray/walker.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,7 @@ package mantaray

import (
"context"
"sort"
"slices"
)

// WalkNodeFunc is the type of the function called for each node visited
Expand Down Expand Up @@ -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]
Expand Down
Loading