sorting-network-0.2.1.0: Sort small lists with sorting network.
Safe HaskellSafe-Inferred
LanguageHaskell2010

Data.SortingNetwork.OddEvenMerge

Documentation

unsafeSortList16By :: forall a. (a -> a -> Ordering) -> [a] -> [a] Source #

unsafeSortList15By :: forall a. (a -> a -> Ordering) -> [a] -> [a] Source #

unsafeSortList14By :: forall a. (a -> a -> Ordering) -> [a] -> [a] Source #

unsafeSortList13By :: forall a. (a -> a -> Ordering) -> [a] -> [a] Source #

unsafeSortList12By :: forall a. (a -> a -> Ordering) -> [a] -> [a] Source #

unsafeSortList11By :: forall a. (a -> a -> Ordering) -> [a] -> [a] Source #

unsafeSortList10By :: forall a. (a -> a -> Ordering) -> [a] -> [a] Source #

unsafeSortList9By :: forall a. (a -> a -> Ordering) -> [a] -> [a] Source #

unsafeSortList8By :: forall a. (a -> a -> Ordering) -> [a] -> [a] Source #

unsafeSortList7By :: forall a. (a -> a -> Ordering) -> [a] -> [a] Source #

unsafeSortList6By :: forall a. (a -> a -> Ordering) -> [a] -> [a] Source #

unsafeSortList5By :: forall a. (a -> a -> Ordering) -> [a] -> [a] Source #

unsafeSortList4By :: forall a. (a -> a -> Ordering) -> [a] -> [a] Source #

unsafeSortList3By :: forall a. (a -> a -> Ordering) -> [a] -> [a] Source #

unsafeSortList2By :: forall a. (a -> a -> Ordering) -> [a] -> [a] Source #

sortTup16By :: (a -> a -> Ordering) -> (a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a) -> (a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a) Source #

sortTup15By :: (a -> a -> Ordering) -> (a, a, a, a, a, a, a, a, a, a, a, a, a, a, a) -> (a, a, a, a, a, a, a, a, a, a, a, a, a, a, a) Source #

sortTup14By :: (a -> a -> Ordering) -> (a, a, a, a, a, a, a, a, a, a, a, a, a, a) -> (a, a, a, a, a, a, a, a, a, a, a, a, a, a) Source #

sortTup13By :: (a -> a -> Ordering) -> (a, a, a, a, a, a, a, a, a, a, a, a, a) -> (a, a, a, a, a, a, a, a, a, a, a, a, a) Source #

sortTup12By :: (a -> a -> Ordering) -> (a, a, a, a, a, a, a, a, a, a, a, a) -> (a, a, a, a, a, a, a, a, a, a, a, a) Source #

sortTup11By :: (a -> a -> Ordering) -> (a, a, a, a, a, a, a, a, a, a, a) -> (a, a, a, a, a, a, a, a, a, a, a) Source #

sortTup10By :: (a -> a -> Ordering) -> (a, a, a, a, a, a, a, a, a, a) -> (a, a, a, a, a, a, a, a, a, a) Source #

sortTup9By :: (a -> a -> Ordering) -> (a, a, a, a, a, a, a, a, a) -> (a, a, a, a, a, a, a, a, a) Source #

sortTup8By :: (a -> a -> Ordering) -> (a, a, a, a, a, a, a, a) -> (a, a, a, a, a, a, a, a) Source #

sortTup7By :: (a -> a -> Ordering) -> (a, a, a, a, a, a, a) -> (a, a, a, a, a, a, a) Source #

sortTup6By :: (a -> a -> Ordering) -> (a, a, a, a, a, a) -> (a, a, a, a, a, a) Source #

sortTup5By :: (a -> a -> Ordering) -> (a, a, a, a, a) -> (a, a, a, a, a) Source #

sortTup4By :: (a -> a -> Ordering) -> (a, a, a, a) -> (a, a, a, a) Source #

sortTup3By :: (a -> a -> Ordering) -> (a, a, a) -> (a, a, a) Source #

sortTup2By :: (a -> a -> Ordering) -> (a, a) -> (a, a) Source #