Data.SortingNetwork.TH

Documentation

gMkSortBy :: MkPairs -> Int -> ([Pat] -> Pat) -> ([Exp] -> Exp) -> Q Exp

gMkSortBy mkPairs n mkP mkE generates a function that sorts elements using sorting network.

mkP :: [Pat] -> Pat and mkE :: [Exp] -> Exp deals with unpacking input value and packing final results respectively. This generalization allows us to deal with lists, tuples, and unboxed-tuples all at once.

mkUnsafeSortListBy :: MkPairs -> Int -> ExpQ

mkUnsafeSortListBy mkPairs n generates an expression of type (a -> a -> Ordering) -> [a] -> [a].

Note that resulting function is partial and requires input list to contain exactly n elements.

mkSortTupBy :: MkPairs -> Int -> ExpQ

mkSortTupBy mkPairs n generates an expression of type (a -> a -> Ordering) -> (a, a, ...) -> (a, a, ...).

Where the input and output tuple (a, a, ...) contains n elements.

mkUnsafeSortListByFns :: MkPairs -> [Int] -> Q [Dec]

mkSortTupByFns :: MkPairs -> [Int] -> Q [Dec]