Modulevector-algorithms-0.9.1.0Haskell2010

Data.Vector.Algorithms.Insertion

A simple insertion sort. Though it's O(n^2), its iterative nature can be beneficial for small arrays. It is used to sort small segments of an array by some of the more heavy-duty, recursive algorithms.

1 type
6 values

Packagevector-algorithms-0.9.1.0
Exports7
LanguageHaskell2010
LicenceBSD-3-Clause
SourceInsertion.hs

valuesort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m ()

Sorts an entire array using the default comparison for the type

valuesortUniq

:: (PrimMonad m, MVector v e, Ord e)
=> v (PrimState m) e
-> m (v (PrimState m) e)

A variant on sort that returns a vector of unique elements.

valuesortBy

:: (PrimMonad m, MVector v e)
=> Comparison e
-> v (PrimState m) e
-> m ()

Sorts an entire array using a given comparison

valuesortUniqBy

:: (PrimMonad m, MVector v e)
=> Comparison e
-> v (PrimState m) e
-> m (v (PrimState m) e)

A variant on sortBy which returns a vector of unique elements.

valuesortByBounds

:: (PrimMonad m, MVector v e)
=> Comparison e
-> v (PrimState m) e
-> Int
-> Int
-> m ()

Sorts the portion of an array delimited by [l,u)

valuesortByBounds'

:: (PrimMonad m, MVector v e)
=> Comparison e
-> v (PrimState m) e
-> Int
-> Int
-> Int
-> m ()

Sorts the portion of the array delimited by [l,u) under the assumption that [l,m) is already sorted.

typetype Comparison e = e -> e -> Ordering

A type of comparisons between two values of a given type.