-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | Sort small lists with sorting network.
--   
--   Functions that sort small (2~16 elements) lists or homogenous tuples.
@package sorting-network
@version 0.1.0.0

module Data.SortingNetwork.Compares
batcher :: Int -> [] (Int, Int)

module Data.SortingNetwork.TH
gMkSortBy :: MkPairs -> Int -> ([Pat] -> Pat) -> ([Exp] -> Exp) -> Q Exp
mkSortListBy :: MkPairs -> Int -> ExpQ
mkSortTupBy :: MkPairs -> Int -> ExpQ
mkSortListByFns :: MkPairs -> [Int] -> Q [Dec]
mkSortTupByFns :: MkPairs -> [Int] -> Q [Dec]

module Data.SortingNetwork
sortList16By :: (a -> a -> Ordering) -> [a] -> [a]
sortList15By :: (a -> a -> Ordering) -> [a] -> [a]
sortList14By :: (a -> a -> Ordering) -> [a] -> [a]
sortList13By :: (a -> a -> Ordering) -> [a] -> [a]
sortList12By :: (a -> a -> Ordering) -> [a] -> [a]
sortList11By :: (a -> a -> Ordering) -> [a] -> [a]
sortList10By :: (a -> a -> Ordering) -> [a] -> [a]
sortList9By :: (a -> a -> Ordering) -> [a] -> [a]
sortList8By :: (a -> a -> Ordering) -> [a] -> [a]
sortList7By :: (a -> a -> Ordering) -> [a] -> [a]
sortList6By :: (a -> a -> Ordering) -> [a] -> [a]
sortList5By :: (a -> a -> Ordering) -> [a] -> [a]
sortList4By :: (a -> a -> Ordering) -> [a] -> [a]
sortList3By :: (a -> a -> Ordering) -> [a] -> [a]
sortList2By :: (a -> a -> Ordering) -> [a] -> [a]
sortTup16By :: (p -> p -> Ordering) -> (p, p, p, p, p, p, p, p, p, p, p, p, p, p, p, p) -> (p, p, p, p, p, p, p, p, p, p, p, p, p, p, p, p)
sortTup15By :: (o -> o -> Ordering) -> (o, o, o, o, o, o, o, o, o, o, o, o, o, o, o) -> (o, o, o, o, o, o, o, o, o, o, o, o, o, o, o)
sortTup14By :: (n -> n -> Ordering) -> (n, n, n, n, n, n, n, n, n, n, n, n, n, n) -> (n, n, n, n, n, n, n, n, n, n, n, n, n, n)
sortTup13By :: (m -> m -> Ordering) -> (m, m, m, m, m, m, m, m, m, m, m, m, m) -> (m, m, m, m, m, m, m, m, m, m, m, m, m)
sortTup12By :: (l -> l -> Ordering) -> (l, l, l, l, l, l, l, l, l, l, l, l) -> (l, l, l, l, l, l, l, l, l, l, l, l)
sortTup11By :: (k -> k -> Ordering) -> (k, k, k, k, k, k, k, k, k, k, k) -> (k, k, k, k, k, k, k, k, k, k, k)
sortTup10By :: (j -> j -> Ordering) -> (j, j, j, j, j, j, j, j, j, j) -> (j, j, j, j, j, j, j, j, j, j)
sortTup9By :: (i -> i -> Ordering) -> (i, i, i, i, i, i, i, i, i) -> (i, i, i, i, i, i, i, i, i)
sortTup8By :: (h -> h -> Ordering) -> (h, h, h, h, h, h, h, h) -> (h, h, h, h, h, h, h, h)
sortTup7By :: (g -> g -> Ordering) -> (g, g, g, g, g, g, g) -> (g, g, g, g, g, g, g)
sortTup6By :: (f -> f -> Ordering) -> (f, f, f, f, f, f) -> (f, f, f, f, f, f)
sortTup5By :: (e -> e -> Ordering) -> (e, e, e, e, e) -> (e, e, e, e, e)
sortTup4By :: (d -> d -> Ordering) -> (d, d, d, d) -> (d, d, d, d)
sortTup3By :: (c -> c -> Ordering) -> (c, c, c) -> (c, c, c)
sortTup2By :: (b -> b -> Ordering) -> (b, b) -> (b, b)