ContentsIndex
Util.List
Documentation
catMapM :: Monad m => (a -> m [b]) -> [a] -> m [b]
dropIx :: Int -> [a] -> [a]
dropWhen :: (a -> Bool) -> [a] -> [a]
eachAndOthers :: [a] -> [(a, [a])]
elemF :: (a -> a -> Bool) -> a -> [a] -> Bool
foldlR :: (s -> i -> (s, o)) -> s -> [i] -> (s, [o])
foldlR_ :: (s -> i -> (s, o)) -> s -> [i] -> s
interslurp :: [a] -> [a]
lookupF :: (a -> a -> Bool) -> a -> [(a, b)] -> Maybe b
loopi :: (state -> state) -> state -> Int -> state
nubF :: (a -> a -> Bool) -> [a] -> [a]
rotate :: Int -> [a] -> [a]
remove :: (a -> Bool) -> [a] -> Maybe (a, [a])
remove' :: (a -> Bool) -> [a] -> [a] -> Maybe (a, [a])
sequenceF :: [a -> a] -> a -> a
sequenceFF :: a -> [a -> a] -> a
makeSplits :: Eq a => ([a] -> ([a], [a])) -> [a] -> [[a]]
splitOn :: Eq a => a -> [a] -> ([a], [a])
splitOns :: Eq a => a -> [a] -> [[a]]
splitWhen :: (a -> Bool) -> [a] -> ([a], [a])
splitWhens :: Eq a => (a -> Bool) -> [a] -> [[a]]
makeBreaks :: Eq a => ([a] -> ([a], [a])) -> [a] -> [[a]]
update :: Eq a => a -> b -> [(a, b)] -> [(a, b)]
updateF :: Eq k => k -> (e -> e) -> [(k, e)] -> [(k, e)]
isNil :: [a] -> Bool
gather :: Ord a => [(a, b)] -> [(a, [b])]
mapT2_2 :: (b -> c) -> [(a, b)] -> [(a, c)]
partitionFs :: [a -> Bool] -> [a] -> [[a]]
takeLast :: [a] -> Maybe a
takeHead :: [a] -> Maybe a
Produced by Haddock version 0.7