| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Data.SortingNetwork
Documentation
sortList16By :: (a -> a -> Ordering) -> [a] -> [a] Source #
sortList15By :: (a -> a -> Ordering) -> [a] -> [a] Source #
sortList14By :: (a -> a -> Ordering) -> [a] -> [a] Source #
sortList13By :: (a -> a -> Ordering) -> [a] -> [a] Source #
sortList12By :: (a -> a -> Ordering) -> [a] -> [a] Source #
sortList11By :: (a -> a -> Ordering) -> [a] -> [a] Source #
sortList10By :: (a -> a -> Ordering) -> [a] -> [a] Source #
sortList9By :: (a -> a -> Ordering) -> [a] -> [a] Source #
sortList8By :: (a -> a -> Ordering) -> [a] -> [a] Source #
sortList7By :: (a -> a -> Ordering) -> [a] -> [a] Source #
sortList6By :: (a -> a -> Ordering) -> [a] -> [a] Source #
sortList5By :: (a -> a -> Ordering) -> [a] -> [a] Source #
sortList4By :: (a -> a -> Ordering) -> [a] -> [a] Source #
sortList3By :: (a -> a -> Ordering) -> [a] -> [a] Source #
sortList2By :: (a -> a -> Ordering) -> [a] -> [a] Source #
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) Source #
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) Source #
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) Source #
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) Source #
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) Source #
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) Source #
sortTup10By :: (j -> j -> Ordering) -> (j, j, j, j, j, j, j, j, j, j) -> (j, j, j, j, j, j, j, j, j, j) Source #
sortTup9By :: (i -> i -> Ordering) -> (i, i, i, i, i, i, i, i, i) -> (i, i, i, i, i, i, i, i, i) Source #
sortTup8By :: (h -> h -> Ordering) -> (h, h, h, h, h, h, h, h) -> (h, h, h, h, h, h, h, h) Source #
sortTup7By :: (g -> g -> Ordering) -> (g, g, g, g, g, g, g) -> (g, g, g, g, g, g, g) Source #
sortTup6By :: (f -> f -> Ordering) -> (f, f, f, f, f, f) -> (f, f, f, f, f, f) Source #
sortTup5By :: (e -> e -> Ordering) -> (e, e, e, e, e) -> (e, e, e, e, e) Source #
sortTup4By :: (d -> d -> Ordering) -> (d, d, d, d) -> (d, d, d, d) Source #
sortTup3By :: (c -> c -> Ordering) -> (c, c, c) -> (c, c, c) Source #
sortTup2By :: (b -> b -> Ordering) -> (b, b) -> (b, b) Source #