// Copyright 2009 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.

//go:generate go run genzfunc.go

// Package sort provides primitives for sorting slices and user-defined collections.
package sort

type Interface interface {
	// Len is the number of elements in the collection.
	Len() int

	lessSwap
}

type lessSwap interface {
	Less(i, j int) bool
	Swap(i, j int)
}

type sliceLessSwap struct {
	less func(i, j int) bool
	swap func(i, j int)
}

func (s sliceLessSwap) Less(i, j int) bool {
	return s.less(i, j)
}

func (s sliceLessSwap) Swap(i, j int) {
	s.swap(i, j)
}

func quickSort(data lessSwap, a, b, maxDepth int)

func Slice(x interface{}, less func(i, j int) bool) {
	rv := reflectValueOf(x)
	swap := reflectSwapper(x)
	length := rv.Len()
	quickSort(sliceLessSwap{less, swap}, 0, length, maxDepth(length))
}