|
Data.Vector.Algorithms.Optimal | Portability | Portable | Stability | Experimental | Maintainer | Dan Doel |
|
|
|
Description |
Optimal sorts for very small array sizes, or for small numbers of
particular indices in a larger array (to be used, for instance, for
sorting a median of 3 values into the lowest position in an array
for a median-of-3 quicksort).
|
|
Synopsis |
|
|
|
Documentation |
|
|
Sorts the elements at the two given indices using the comparison. This
is essentially a compare-and-swap, although the first index is assumed to
be the lower of the two.
|
|
|
Sorts the elements at the positions off and 'off + 1' in the given
array using the comparison.
|
|
|
Sorts the elements at the three given indices. The indices are assumed
to be given from lowest to highest, so if 'l < m < u' then
'sort3ByIndex cmp a m l u' essentially sorts the median of three into the
lowest position in the array.
|
|
|
Sorts the three elements starting at the given offset in the array.
|
|
|
Sorts the elements at the four given indices. Like the 2 and 3 element
versions, this assumes that the indices are given in increasing order, so
it can be used to sort medians into particular positions and so on.
|
|
|
Sorts the four elements beginning at the offset.
|
|
|
A type of comparisons between two values of a given type.
|
|
Produced by Haddock version 2.4.2 |