Quickly sort an array of Floats.
Quickly sort an array of Ints.
Quickly sort an array of items with an implicit Ordering.
Quickly sort an array of Doubles.
Stably sorts a sequence of items given an extraction function that will return an ordered key from an item.
Stably sorts a sequence of items given an extraction function that will return an ordered key from an item.
the sequence to be sorted.
the comparison function.
the sorted sequence of items.
Sorts an arbitrary sequence of items that are viewable as ordered.
Sorts an arbitrary sequence into an array, given a comparison function
that should return true
iff parameter one is strictly less than parameter two.
Sorts an arbitrary sequence into an array, given a comparison function
that should return true
iff parameter one is strictly less than parameter two.
the sequence to be sorted.
the comparison function.
the sorted sequence of items.
Sorts an array of K
given an ordering function f
.
Sorts an array of K
given an ordering function f
.
f
should return true
iff its first parameter is strictly less than its second parameter.
Sort an array of K where K is Ordered, preserving the existing order where the values are equal.
The Sorting object provides functions that can sort various kinds of objects. You can provide a comparison function, or you can request a sort of items that are viewable as scala.math.Ordered. Some sorts that operate directly on a subset of value types are also provided. These implementations are derived from those in the Sun JDK.
Note that stability doesn't matter for value types, so use the
quickSort
variants for those.stableSort
is intended to be used with objects when the prior ordering should be preserved, where possible.1.0