Hoogle Search
Within LTS Haskell 24.40 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapFortunes :: (IndexEntry -> b) -> FortuneFile -> IO [b]misfortune Data.Fortune No documentation available.
mapFortunesM :: (IndexEntry -> IO b) -> FortuneFile -> IO [b]misfortune Data.Fortune No documentation available.
mapFortunesWithIndex :: (Num a, Enum a) => (a -> IO b) -> FortuneFile -> IO [b]misfortune Data.Fortune No documentation available.
mapFortunesWithIndexM :: (Num a, Enum a) => (a -> IndexEntry -> IO b) -> FortuneFile -> IO [b]misfortune Data.Fortune No documentation available.
mapMaybeM :: (Monad m, Functor m) => (a -> m (Maybe b)) -> [a] -> m [b]monad-extras Control.Monad.Extra A monadic version of mapMaybe :: (a -> Maybe b) -> [a] -> [b].
mapAccumM :: (Monad m, MonadPlus p) => (acc -> x -> m (acc, y)) -> acc -> [x] -> m (acc, p y)monadlist Control.Monad.ListM No documentation available.
mapMP :: (Monad m, MonadPlus p) => (a -> m b) -> [a] -> m (p b)monadlist Control.Monad.ListM No documentation available.
mapMonoidMap :: DecidablyEmpty b => (a -> b) -> MonoidMap k a -> MonoidMap k bmonoid-map Data.MonoidMap No documentation available.
mapMState :: (MonadIO m, MonadIO n) => (m (a, t) -> n (b, t)) -> MState t m a -> MState t n bmstate Control.Concurrent.MState Map a stateful computation from one (return value, state) pair to another. See Control.Monad.State.Lazy for more information. Be aware that both MStates still share the same state.
mapMState_ :: MonadIO n => (m a -> n b) -> MState t m a -> MState t n bmstate Control.Concurrent.MState No documentation available.