| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.List.Extra
Synopsis
- partitionM :: Monad m => (a -> m Bool) -> [a] -> m ([a], [a])
- mapAccumLM :: Monad m => (acc -> x -> m (acc, y)) -> acc -> [x] -> m (acc, [y])
- (<:>) :: Applicative f => f a -> f [a] -> f [a]
- indexMaybe :: [a] -> Int -> Maybe a
- splitAtList :: [b] -> [a] -> ([a], [a])
- equalLength :: [a] -> [b] -> Bool
- countEq :: Eq a => a -> [a] -> Int
- zipEqual :: [a] -> [b] -> [(a, b)]
- anyM :: Monad m => (a -> m Bool) -> [a] -> m Bool
- allM :: Monad m => (a -> m Bool) -> [a] -> m Bool
- orM :: Monad m => [m Bool] -> m Bool
Documentation
mapAccumLM :: Monad m => (acc -> x -> m (acc, y)) -> acc -> [x] -> m (acc, [y]) Source #
Monadic version of mapAccumL
(<:>) :: Applicative f => f a -> f [a] -> f [a] infixr 5 Source #
Applicative version of 'GHC.Types.(:)'
indexMaybe :: [a] -> Int -> Maybe a Source #
Safe indexing, returns a Nothing if the index does not exist
splitAtList :: [b] -> [a] -> ([a], [a]) Source #
equalLength :: [a] -> [b] -> Bool Source #
Return number of occurrences of an item in a list