type sort.Interface

24 uses

	sort (current package)
		sort.go#L14: type Interface interface {
		sort.go#L45: func Sort(data Interface) {
		sort.go#L88: 	Interface
		sort.go#L97: func Reverse(data Interface) Interface {
		sort.go#L105: func IsSorted(data Interface) bool {
		sort.go#L228: func Stable(data Interface) {
		zsortinterface.go#L10: func insertionSort(data Interface, a, b int) {
		zsortinterface.go#L20: func siftDown(data Interface, lo, hi, first int) {
		zsortinterface.go#L38: func heapSort(data Interface, a, b int) {
		zsortinterface.go#L61: func pdqsort(data Interface, a, b, limit int) {
		zsortinterface.go#L135: func partition(data Interface, a, b, pivot int) (newpivot int, alreadyPartitioned bool) {
		zsortinterface.go#L173: func partitionEqual(data Interface, a, b, pivot int) (newpivot int) {
		zsortinterface.go#L195: func partialInsertionSort(data Interface, a, b int) bool {
		zsortinterface.go#L240: func breakPatterns(data Interface, a, b int) {
		zsortinterface.go#L261: func choosePivot(data Interface, a, b int) (pivot int, hint sortedHint) {
		zsortinterface.go#L298: func order2(data Interface, a, b int, swaps *int) (int, int) {
		zsortinterface.go#L307: func median(data Interface, a, b, c int, swaps *int) int {
		zsortinterface.go#L315: func medianAdjacent(data Interface, a int, swaps *int) int {
		zsortinterface.go#L319: func reverseRange(data Interface, a, b int) {
		zsortinterface.go#L329: func swapRange(data Interface, a, b, n int) {
		zsortinterface.go#L335: func stable(data Interface, n int) {
		zsortinterface.go#L378: func symMerge(data Interface, a, m, b int) {
		zsortinterface.go#L464: func rotate(data Interface, a, m, b int) {