Modulevector-algorithms-0.9.1.0Haskell2010

Data.Vector.Algorithms.Merge

This module implements a simple top-down merge sort. The temporary buffer is preallocated to 1/2 the size of the input array, and shared through the entire sorting process to ease the amount of allocation performed in total. This is a stable sort.

Synopsis

value sort
value sortUniq
value sortBy
value sortUniqBy
type Comparison

Packagevector-algorithms-0.9.1.0
Exports5
LanguageHaskell2010
LicenceBSD-3-Clause
SourceMerge.hs

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

Source#

Sorts an array using the default comparison.

valuesortUniq

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

Source#

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

valuesortBy

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

Source#

Sorts an array using a custom comparison.

valuesortUniqBy

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

Source#

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

typetype Comparison e = e -> e -> Ordering

Source#

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