Safe Haskell | Safe |
---|---|
Language | Haskell98 |
Control.Monad.ListM
Description
Documentation
intersperseM :: (Monad m, MonadPlus p) => m a -> [a] -> m (p a) Source #
intercalateM :: (Monad m, MonadPlus p) => m (p a) -> [p a] -> m (p a) Source #
mapAccumM :: (Monad m, MonadPlus p) => (acc -> x -> m (acc, y)) -> acc -> [x] -> m (acc, p y) Source #
takeWhileM :: (Monad m, MonadPlus p) => (a -> m Bool) -> [a] -> m (p a) Source #
dropWhileM :: Monad m => (a -> m Bool) -> [a] -> m [a] Source #
partitionM :: (Monad m, MonadPlus p) => (a -> m Bool) -> [a] -> m (p a, [a]) Source #
elemIndexM :: (Eq a, Integral i, Monad m, MonadPlus p) => a -> [a] -> m (p i) Source #
elemIndicesM :: (Eq a, Integral i, Monad m, MonadPlus p) => a -> [a] -> m (p i) Source #
findIndexM :: (Integral i, Monad m, MonadPlus p) => (a -> m Bool) -> [a] -> m (p i) Source #
findIndicesM :: (Integral i, Monad m, MonadPlus p) => (a -> m Bool) -> [a] -> m (p i) Source #
zipWithM3 :: (Monad m, MonadPlus p) => (a -> b -> c -> m d) -> [a] -> [b] -> [c] -> m (p d) Source #
zipWithM4 :: (Monad m, MonadPlus p) => (a -> b -> c -> d -> m e) -> [a] -> [b] -> [c] -> [d] -> m (p e) Source #
zipWithM5 :: (Monad m, MonadPlus p) => (a -> b -> c -> d -> e -> m f) -> [a] -> [b] -> [c] -> [d] -> [e] -> m (p f) Source #
zipWithM6 :: (Monad m, MonadPlus p) => (a -> b -> c -> d -> e -> f -> m g) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> m (p g) Source #
deleteFirstsM :: (Eq a, Monad m) => [a] -> [a] -> m [a] Source #
deleteFirstsByM :: Monad m => (a -> a -> m Bool) -> [a] -> [a] -> m [a] Source #
intersectM :: (Eq a, Monad m, MonadPlus p) => [a] -> [a] -> m (p a) Source #
intersectByM :: (Monad m, MonadPlus p) => (a -> a -> m Bool) -> [a] -> [a] -> m (p a) Source #
groupByM :: (Monad m, MonadPlus p, MonadPlus q) => (a -> a -> m Bool) -> [a] -> m (p (q a)) Source #
maximumByM :: Monad m => (a -> a -> m Ordering) -> [a] -> m a Source #
minimumByM :: Monad m => (a -> a -> m Ordering) -> [a] -> m a Source #