saddle-core/org.saddle.array/PermuteMergeSort

PermuteMergeSort

object PermuteMergeSort

In-place merge sort implementation. This sort is stable but does mutate the given array. It is an in-place sort but it does allocate a temporary array of the same size as the input. It uses InsertionSort for sorting very small arrays.

class Object
trait Matchable
class Any

Value members

Concrete methods

@inline
final def mergePerm[@specialized A](data: Array[A], in: Array[Int], out: Array[Int], start: Int, mid: Int, end: Int)(implicit o: Order[A]): Unit
final def sort[@specialized A : Order](data: Array[A], perm: Array[Int]): Unit
@inline
final def startStep: Int
@inline
final def startWidth: Int