|
|
|
|
Synopsis |
|
|
|
Documentation |
|
consperse :: [a] -> [[a]] -> [a] | Source |
|
The mighty consperse function - e.g. consperse , [a, b] -> a,b
consperse = MissingH.List.join
|
|
surround :: [a] -> [a] -> [[a]] -> [a] | Source |
|
surround each element of a list - e.g. surround ( ) [a, b] -> [(a)(b)]
|
|
|
Replace the prefix of s, return Nothing if it doesn't match.
|
|
|
Remove a prefix of s, return nothing if it doesn't match.
|
|
cartesianProduct :: [[a]] -> [[a]] | Source |
|
cartesianProduct [[1,2,3], [4,5],[6]] -> [[1,4,6],[1,5,6],[2,4,6],[2,5,6],[3,4,6],[3,5,6]]
|
|
|
FIXME: implement for a string
|
|
empty :: b -> ([a] -> b) -> [a] -> b | Source |
|
Like maybe, but with empty vs. non-empty list
|
|
|
Sort a list using the compare function on the list elements mapped
over f. This is like sortBy ( a b -> compare (f a) (f b))
except that f is applied O(n) times instead of O(n log n)
|
|
|
Monadic version of sortByMapped
|
|
|
|
listIntersection :: Eq a => [[a]] -> [a] | Source |
|
|
|
|
Produced by Haddock version 2.6.0 |