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. mapLeft :: Bifunctor p => (a -> b) -> p a c -> p b c

   rebase	Rebase.Data.Bifunctor

   A more meaningful and conflict-free alias for first.

2. mapRight :: Bifunctor p => (b -> c) -> p a b -> p a c

   rebase	Rebase.Data.Bifunctor

   A more meaningful and conflict-free alias for second.

3. mapM :: Monad m => (a -> m b) -> Vector a -> m (Vector b)

   rebase	Rebase.Data.Vector

   No documentation available.

4. mapM_ :: Monad m => (a -> m b) -> Vector a -> m ()

   rebase	Rebase.Data.Vector

   No documentation available.

5. mapMaybe :: (a -> Maybe b) -> Vector a -> Vector b

   rebase	Rebase.Data.Vector

   No documentation available.

6. mapMaybeM :: Monad m => (a -> m (Maybe b)) -> Vector a -> m (Vector b)

   rebase	Rebase.Data.Vector

   No documentation available.

7. mapM :: Monad m => (a -> m b) -> Stream m a -> Stream m b

   rebase	Rebase.Data.Vector.Fusion.Stream.Monadic

   Map a monadic function over a Stream

8. mapM_ :: Monad m => (a -> m b) -> Stream m a -> m ()

   rebase	Rebase.Data.Vector.Fusion.Stream.Monadic

   Execute a monadic action for each element of the Stream

9. mapMaybe :: forall (m :: Type -> Type) a b . Monad m => (a -> Maybe b) -> Stream m a -> Stream m b

   rebase	Rebase.Data.Vector.Fusion.Stream.Monadic

   No documentation available.

10. mapMaybeM :: Monad m => (a -> m (Maybe b)) -> Stream m a -> Stream m b

    rebase	Rebase.Data.Vector.Fusion.Stream.Monadic

    Apply monadic function to each element and drop all Nothings

Page 245 of many | Previous | Next