Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. mapM_ :: (PrimMonad m, Unbox a) => (a -> m b) -> MVector (PrimState m) a -> m ()

   rebase	Rebase.Data.Vector.Unboxed.Mutable

   No documentation available.

2. mapBoth :: (a -> c) -> (b -> d) -> Either a b -> Either c d

   rebase	Rebase.Prelude

   The mapBoth function takes two functions and applies the first if iff the value takes the form Left _ and the second if the value takes the form Right _. Using Data.Bifunctor:

   mapBoth = bimap
   

   Using Control.Arrow:

   mapBoth = (+++)
   

   >>> mapBoth (*2) (*3) (Left 4)
   Left 8
   

   >>> mapBoth (*2) (*3) (Right 4)
   Right 12
   

3. mapCont :: (r -> r) -> Cont r a -> Cont r a

   rebase	Rebase.Prelude

   Apply a function to transform the result of a continuation-passing computation.

   • runCont (mapCont f m) = f . runCont
     m

4. mapExcept :: (Either e a -> Either e' b) -> Except e a -> Except e' b

   rebase	Rebase.Prelude

   Map the unwrapped computation using the given function.

   • runExcept (mapExcept f m) = f (runExcept
     m)

5. mapExceptT :: (m (Either e a) -> n (Either e' b)) -> ExceptT e m a -> ExceptT e' n b

   rebase	Rebase.Prelude

   Map the unwrapped computation using the given function.

   • runExceptT (mapExceptT f m) = f
     (runExceptT m)

6. mapMaybeT :: (m (Maybe a) -> n (Maybe b)) -> MaybeT m a -> MaybeT n b

   rebase	Rebase.Prelude

   Transform the computation inside a MaybeT.

   • runMaybeT (mapMaybeT f m) = f (runMaybeT
     m)

7. mapReader :: (a -> b) -> Reader r a -> Reader r b

   rebase	Rebase.Prelude

   Transform the value returned by a Reader.

   • runReader (mapReader f m) = f .
     runReader m

8. mapReaderT :: (m a -> n b) -> ReaderT r m a -> ReaderT r n b

   rebase	Rebase.Prelude

   Transform the computation inside a ReaderT.

   • runReaderT (mapReaderT f m) = f .
     runReaderT m

9. mapState :: ((a, s) -> (b, s)) -> State s a -> State s b

   rebase	Rebase.Prelude

   Map both the return value and final state of a computation using the given function.

   • runState (mapState f m) = f . runState
     m

10. mapStateT :: (m (a, s) -> n (b, s)) -> StateT s m a -> StateT s n b

    rebase	Rebase.Prelude

    Map both the return value and final state of a computation using the given function.

    • runStateT (mapStateT f m) = f .
      runStateT m

Page 248 of many | Previous | Next