52 lines
752 B
Go
52 lines
752 B
Go
package slice
|
|
|
|
import (
|
|
"golang.org/x/exp/constraints"
|
|
"sort"
|
|
)
|
|
|
|
const (
|
|
ASC = iota
|
|
DESC
|
|
)
|
|
|
|
type anyArr[T any] struct {
|
|
data []T
|
|
fn func(i, j T) bool
|
|
}
|
|
|
|
func (r anyArr[T]) Len() int {
|
|
return len(r.data)
|
|
}
|
|
|
|
func (r anyArr[T]) Swap(i, j int) {
|
|
r.data[i], r.data[j] = r.data[j], r.data[i]
|
|
}
|
|
|
|
func (r anyArr[T]) Less(i, j int) bool {
|
|
return r.fn(r.data[i], r.data[j])
|
|
}
|
|
|
|
// Sort fn 中i>j 为降序，反之为升序
|
|
func Sort[T any](arr []T, fn func(i, j T) bool) {
|
|
slice := anyArr[T]{
|
|
data: arr,
|
|
fn: fn,
|
|
}
|
|
sort.Sort(slice)
|
|
return
|
|
}
|
|
|
|
func Sorts[T constraints.Ordered](a []T, order int) {
|
|
slice := anyArr[T]{
|
|
data: a,
|
|
fn: func(i, j T) bool {
|
|
if order == DESC {
|
|
return i > j
|
|
}
|
|
return i < j
|
|
},
|
|
}
|
|
sort.Sort(slice)
|
|
}
|