Gecko [ 167.86.127.34 ]

Name	Size	Permission
example_interface_test.go	1.47 KB	-rw-r--r--
example_keys_test.go	2.68 KB	-rw-r--r--
example_multi_test.go	4.05 KB	-rw-r--r--
example_search_test.go	1.16 KB	-rw-r--r--
example_test.go	2.85 KB	-rw-r--r--
example_wrapper_test.go	1.63 KB	-rw-r--r--
export_test.go	239 B	-rw-r--r--
genzfunc.go	2.91 KB	-rw-r--r--
search.go	4.14 KB	-rw-r--r--
search_test.go	4.25 KB	-rw-r--r--
slice.go	1.26 KB	-rw-r--r--
slice_go113.go	305 B	-rw-r--r--
slice_go14.go	468 B	-rw-r--r--
slice_go18.go	291 B	-rw-r--r--
sort.go	15.8 KB	-rw-r--r--
sort_test.go	15.09 KB	-rw-r--r--
zfuncversion.go	4.82 KB	-rw-r--r--

Code Editor : slice.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.

package sort

// 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 := reflectValueOf(slice)
	swap := reflectSwapper(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 := reflectValueOf(slice)
	swap := reflectSwapper(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 := reflectValueOf(slice)
	n := rv.Len()
	for i := n - 1; i > 0; i-- {
		if less(i, i-1) {
			return false
		}
	}
	return true
}

${this.title}

Code Editor : slice.go