Skip to content

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

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
merged 2 commits into from
Oct 17, 2025
Merged

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

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
0587edf
refactor: replace sort.Slice with slices.Sort for natural ordering
suranmiao Oct 17, 2025
875e8cc
Merge branch 'main' into main
tac0turtle Oct 17, 2025
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
6 changes: 2 additions & 4 deletions tools/cache-analyzer/main.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,7 +7,7 @@ import (
"fmt"
"os"
"path/filepath"
"sort"
"slices"
"strings"

"github.com/evstack/ev-node/types"
Expand Down Expand Up @@ -114,9 +114,7 @@ func analyzeEvents(events map[uint64]*DAHeightEvent, limit int) []eventEntry {
for height := range events {
heights = append(heights, height)
}
sort.Slice(heights, func(i, j int) bool {
return heights[i] < heights[j]
})
slices.Sort(heights)

// Apply limit
if limit > 0 && len(heights) > limit {
Expand Down
Loading