Data.List.Extra

Documentation

partitionM :: Monad m => (a -> m Bool) -> [a] -> m ([a], [a])

Monadic version of partition

mapAccumLM :: Monad m => (acc -> x -> m (acc, y)) -> acc -> [x] -> m (acc, [y])

Monadic version of mapAccumL

(<:>) :: Applicative f => f a -> f [a] -> f [a] infixr 5

Applicative version of 'GHC.Types.(:)'

indexMaybe :: [a] -> Int -> Maybe a

Safe indexing, returns a Nothing if the index does not exist

splitAtList :: [b] -> [a] -> ([a], [a])

equalLength :: [a] -> [b] -> Bool

countEq

Arguments

:: Eq a

=> a

-> [a]

Haystack

-> Int

Times needle was found in haystack

Return number of occurrences of an item in a list

zipEqual :: [a] -> [b] -> [(a, b)]

Zip two lists of equal length

NB Errors out for a 1 compiler when the two lists are not of equal length

anyM :: Monad m => (a -> m Bool) -> [a] -> m Bool

Short-circuiting monadic version of any

allM :: Monad m => (a -> m Bool) -> [a] -> m Bool

orM :: Monad m => [m Bool] -> m Bool

short-circuiting monadic version of or