Hoogle Search
Within LTS Haskell 24.33 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mappendS :: forall w (m :: Type -> Type) . (Monoid w, Monad m) => Automaton m w wautomaton Data.Automaton Like mappendFrom, initialised at mempty.
mapMaybeT :: (m (Maybe a) -> n (Maybe b)) -> MaybeT m a -> MaybeT n bautomaton Data.Automaton.Trans.Maybe Transform the computation inside a MaybeT.
mapRWS :: ((a, s, w) -> (b, s, w')) -> RWS r w s a -> RWS r w' s bautomaton Data.Automaton.Trans.RWS Map the return value, final state and output of a computation using the given function.
mapRWST :: (m (a, s, w) -> n (b, s, w')) -> RWST r w s m a -> RWST r w' s n bautomaton Data.Automaton.Trans.RWS Map the inner computation using the given function.
mapWriter :: ((a, w) -> (b, w')) -> Writer w a -> Writer w' bautomaton Data.Automaton.Trans.Writer Map both the return value and output of a computation using the given function.
mapWriterT :: (m (a, w) -> n (b, w')) -> WriterT w m a -> WriterT w' n bautomaton Data.Automaton.Trans.Writer Map both the return value and output of a computation using the given function.
runWriterT (mapWriterT f m) = f (runWriterT m)
-
automaton Data.Stream.Except Apply a function to the output of the stream
-
automaton Data.Stream.Optimized Change the output type and effect of a stream without changing its state type.
mapResultState :: (s1 -> s2) -> Result s1 a -> Result s2 aautomaton Data.Stream.Result Apply a function to the state of a Result.
mappend :: Monoid a => a -> a -> abase-prelude BasePrelude An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.