refactor: use slices.Sort where appropriate (#1965)

Signed-off-by: hongmengning <hongmengning@outlook.com>

Author: hongmengning

x/dymns/utils/map.go

@@ -1,15 +1,13 @@
 package utils
 
-import "sort"
+import "slices"
 
 // GetSortedStringKeys returns the sorted keys of a map[string]V.
 func GetSortedStringKeys[V any](m map[string]V) []string {
 	keys := make([]string, 0, len(m))
 	for k := range m {
 		keys = append(keys, k)
 	}
-	sort.Slice(keys, func(i, j int) bool {
-		return keys[i] < keys[j]
-	})
+	slices.Sort(keys)
 	return keys
 }

x/lockup/keeper/lock.go

@@ -2,6 +2,7 @@ package keeper
 
 import (
 	"fmt"
+	"slices"
 	"sort"
 	"time"
 
@@ -491,7 +492,7 @@ func (k Keeper) InitializeAllLocks(ctx sdk.Context, locks []types.PeriodLock) er
 		for duration := range curDurationMap {
 			durations = append(durations, duration)
 		}
-		sort.Slice(durations, func(i, j int) bool { return durations[i] < durations[j] })
+		slices.Sort(durations)
 		// now that we have a sorted list of durations for this denom,
 		// add them all to accumulation store
 		msg := fmt.Sprintf("Setting accumulation entries for locks for %s, there are %d distinct durations",