|
|
|
|
Synopsis |
|
|
|
Documentation |
|
|
|
|
If anyone of them returns Nothing, the whole thing does
|
|
|
|
|
pick all subsets (maintaining order) with a length of n
n must be greater or equal to the length of the list passed in
|
|
|
all permutations of a list
|
|
|
|
|
|
|
|
|
|
|
Constructors | | Instances | |
|
|
|
|
groupFsts :: Eq k => [(k, v)] -> [(k, [v])] | Source |
|
|
|
|
fold :: a -> (a -> a -> a) -> [a] -> a | Source |
|
|
fold1 :: (a -> a -> a) -> [a] -> a | Source |
|
|
halves :: [a] -> ([a], [a]) | Source |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
initLast :: [a] -> ([a], a) | Source |
|
|
|
|
|
|
|
|
split :: Eq a => a -> [a] -> [[a]] | Source |
|
|
|
|
|
|
|
|
consNub :: Eq a => a -> [a] -> [a] | Source |
|
|
|
|
|
|
|
|
|
Like splitAt, but also return the number of items that were split.
For performance.
|
|
Produced by Haddock version 2.4.2 |