refactor: use a more modern writing style

hardlydearly · hardlydearly · commit 99ee1bc4dc16 · 2025-04-30T11:10:56.000+08:00
Signed-off-by: hardlydearly &lt;799511800@qq.com&gt;
diff --git a/sdk/utils/utils.go b/sdk/utils/utils.go
@@ -6,6 +6,7 @@ import (
 	"context"
 	"os"
 	"os/signal"
+	"slices"
 	"sort"
 	"time"
 
@@ -26,12 +27,7 @@ func Unique[T comparable](arr []T) []T {
 }
 
 func Belongs[T comparable](input []T, elem T) bool {
-	for _, e := range input {
-		if e == elem {
-			return true
-		}
-	}
-	return false
+	return slices.Contains(input, elem)
 }
 
 func Map[T, U any](input []T, f func(T) U) []U {
@@ -43,7 +39,7 @@ func Map[T, U any](input []T, f func(T) U) []U {
 }
 
 func Uint32Sort(arr []uint32) {
-	sort.Slice(arr, func(i, j int) bool { return arr[i] < arr[j] })
+	slices.Sort(arr)
 }
 
 // Context for API requests

Original file line number	Diff line number	Diff line change
`@@ -6,6 +6,7 @@ import (`
`6`	`6`	`"context"`
`7`	`7`	`"os"`
`8`	`8`	`"os/signal"`
	`9`	`+ "slices"`
`9`	`10`	`"sort"`
`10`	`11`	`"time"`
`11`	`12`
`@@ -26,12 +27,7 @@ func Unique[T comparable](arr []T) []T {`
`26`	`27`	`}`
`27`	`28`
`28`	`29`	`func Belongs[T comparable](input []T, elem T) bool {`
`29`		`- for _, e := range input {`
`30`		`- if e == elem {`
`31`		`- return true`
`32`		`- }`
`33`		`- }`
`34`		`- return false`
	`30`	`+ return slices.Contains(input, elem)`
`35`	`31`	`}`
`36`	`32`
`37`	`33`	`func Map[T, U any](input []T, f func(T) U) []U {`
`@@ -43,7 +39,7 @@ func Map[T, U any](input []T, f func(T) U) []U {`
`43`	`39`	`}`
`44`	`40`
`45`	`41`	`func Uint32Sort(arr []uint32) {`
`46`		`- sort.Slice(arr, func(i, j int) bool { return arr[i] < arr[j] })`
	`42`	`+ slices.Sort(arr)`
`47`	`43`	`}`
`48`	`44`
`49`	`45`	`// Context for API requests`