// 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 slice x given the provided less function.
// It panics if x is not a slice.
//
// The sort is not guaranteed to be stable: equal elements
// may be reversed from their original order.
// For a stable sort, use SliceStable.
//
// The less function must satisfy the same requirements as
// the Interface type's Less method.
func ( interface{},  func(,  int) bool) {
	 := reflectValueOf()
	 := reflectSwapper()
	 := .Len()
	quickSort_func(lessSwap{, }, 0, , maxDepth())
}

// SliceStable sorts the slice x using the provided less
// function, keeping equal elements in their original order.
// It panics if x is not a slice.
//
// The less function must satisfy the same requirements as
// the Interface type's Less method.
func ( interface{},  func(,  int) bool) {
	 := reflectValueOf()
	 := reflectSwapper()
	stable_func(lessSwap{, }, .Len())
}

// SliceIsSorted reports whether the slice x is sorted according to the provided less function.
// It panics if x is not a slice.
func ( interface{},  func(,  int) bool) bool {
	 := reflectValueOf()
	 := .Len()
	for  :=  - 1;  > 0; -- {
		if (, -1) {
			return false
		}
	}
	return true
}