Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.SortingNetwork.MutableVector

Description

Functions that sorts mutable vectors using sorting network.

Synopsis

unsafeSortBy :: (PrimMonad m, MVector v e) => MkPairs -> (e -> e -> Ordering) -> v (PrimState m) e -> m ()
maySortBy :: (PrimMonad m, MVector v e) => MkPairs -> (e -> e -> Ordering) -> v (PrimState m) e -> m (Maybe (v (PrimState m) e))

Documentation

Sorts a mutable vector by applying compare-and-swap operations generated through MkPairs.

Raises error if vector size cannot be handled by the sorting network.

Safe version of unsafeSortBy.

This function either returns input vector reference upon successful sorting or Nothing if the vector size cannot be handled.