Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

Exact lookup

1. mapTree :: (a -> b) -> Tree a -> Tree b

   debian	Debian.Apt.Dependencies

   No documentation available.

2. mapExn :: forall e m a . (MonadCatch m, Exception e) => m a -> (e -> e) -> m a

   debian	Debian.Loc

   No documentation available.

3. mapEither :: Filtrable f => (a -> Either b c) -> f a -> (f b, f c)

   filtrable	Data.Filtrable

   Map the container with the given function, collecting the Lefts and the Rights separately.

4. mapEitherA :: (Filtrable f, Traversable f, Applicative p) => (a -> p (Either b c)) -> f a -> p (f b, f c)

   filtrable	Data.Filtrable

   Traverse the container with the given function, collecting the Lefts and the Rights separately.

5. mapMaybe :: Filtrable f => (a -> Maybe b) -> f a -> f b

   filtrable	Data.Filtrable

   Map the container with the given function, dropping the elements for which it returns Nothing.

6. mapMaybeA :: (Filtrable f, Traversable f, Applicative p) => (a -> p (Maybe b)) -> f a -> p (f b)

   filtrable	Data.Filtrable

   Traverse the container with the given function, dropping the elements for which it returns Nothing.

7. mapS :: (Applicative f, Sequence sq) => (forall x y . () => cat x y -> f (cat x y)) -> sq cat a b -> f (sq cat a b)

   freer-par-monad	Control.Monad.Freer.Par.Sequence

   No documentation available.

8. mapPost :: forall a c (f :: Type -> Type) b . (a -> c) -> Post a f b -> Post c f b

   functor-combinators	Data.HFunctor.Route

   Post-compose on the post-routing function.

9. mapPre :: forall c a (f :: Type -> Type) b . (c -> a) -> Pre a f b -> Pre c f b

   functor-combinators	Data.HFunctor.Route

   Pre-compose on the pre-routing function.

10. mapWithIds :: (Ord i, GenValid a) => Set i -> Gen (Map i a)

    genvalidity-appendful	Data.GenValidity.Appendful.Collection

    No documentation available.

Page 242 of many | Previous | Next