1a2f01efa6
Update the Go library to the 1.10beta1 release.
Requires a few changes to the compiler for modifications to the map
runtime code, and to handle some nowritebarrier cases in the runtime.
Reviewed-on: https://go-review.googlesource.com/86455
gotools/:
* Makefile.am (go_cmd_vet_files): New variable.
(go_cmd_buildid_files, go_cmd_test2json_files): New variables.
(s-zdefaultcc): Change from constants to functions.
(noinst_PROGRAMS): Add vet, buildid, and test2json.
(cgo$(EXEEXT)): Link against $(LIBGOTOOL).
(vet$(EXEEXT)): New target.
(buildid$(EXEEXT)): New target.
(test2json$(EXEEXT)): New target.
(install-exec-local): Install all $(noinst_PROGRAMS).
(uninstall-local): Uninstasll all $(noinst_PROGRAMS).
(check-go-tool): Depend on $(noinst_PROGRAMS). Copy down
objabi.go.
(check-runtime): Depend on $(noinst_PROGRAMS).
(check-cgo-test, check-carchive-test): Likewise.
(check-vet): New target.
(check): Depend on check-vet. Look at cmd_vet-testlog.
(.PHONY): Add check-vet.
* Makefile.in: Rebuild.
From-SVN: r256365
47 lines
1.3 KiB
Go
47 lines
1.3 KiB
Go
// Copyright 2017 The Go Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
// +build !compiler_bootstrap go1.8
|
|
|
|
package sort
|
|
|
|
import "reflect"
|
|
|
|
// Slice sorts the provided slice given the provided less function.
|
|
//
|
|
// The sort is not guaranteed to be stable. For a stable sort, use
|
|
// SliceStable.
|
|
//
|
|
// The function panics if the provided interface is not a slice.
|
|
func Slice(slice interface{}, less func(i, j int) bool) {
|
|
rv := reflect.ValueOf(slice)
|
|
swap := reflect.Swapper(slice)
|
|
length := rv.Len()
|
|
quickSort_func(lessSwap{less, swap}, 0, length, maxDepth(length))
|
|
}
|
|
|
|
// SliceStable sorts the provided slice given the provided less
|
|
// function while keeping the original order of equal elements.
|
|
//
|
|
// The function panics if the provided interface is not a slice.
|
|
func SliceStable(slice interface{}, less func(i, j int) bool) {
|
|
rv := reflect.ValueOf(slice)
|
|
swap := reflect.Swapper(slice)
|
|
stable_func(lessSwap{less, swap}, rv.Len())
|
|
}
|
|
|
|
// SliceIsSorted tests whether a slice is sorted.
|
|
//
|
|
// The function panics if the provided interface is not a slice.
|
|
func SliceIsSorted(slice interface{}, less func(i, j int) bool) bool {
|
|
rv := reflect.ValueOf(slice)
|
|
n := rv.Len()
|
|
for i := n - 1; i > 0; i-- {
|
|
if less(i, i-1) {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|