golang如何对自定义类型的slice进行排序？

1
2
3
4
5
6
7
8
9
10
11
12

// A type, typically a collection, that satisfies sort.Interface can be
// sorted by the routines in this package. The methods require that the
// elements of the collection be enumerated by an integer index.
type Interface interface {
    // Len is the number of elements in the collection.
    Len() int
    // Less reports whether the element with
    // index i should sort before the element with index j.
    Less(i, j int) bool
    // Swap swaps the elements with indexes i and j.
    Swap(i, j int)
}

1
2
3
4
5

type TimestampSlice []int64

func (a TimestampSlice) Len() int           { return len(a) }
func (a TimestampSlice) Swap(i, j int)      { a[i], a[j] = a[j], a[i] }
func (a TimestampSlice) Less(i, j int) bool { return a[i] < a[j] }

1
2
3
4
5
6
7

func main() {
    timestampSLice := TimestampSlice{9, 10, 8, 7, 4, 3, 5, 2, 6, 1}
    fmt.Println("before:", timestampSLice)
    sort.Sort(timestampSLice)
    //sort.Stable(timestampSLice)
    fmt.Println("after :", timestampSLice)
}

1
2

before: [9 10 8 7 4 3 5 2 6 1]
after : [1 2 3 4 5 6 7 8 9 10]