Hoogle Search

Within LTS Haskell 24.25 (ghc-9.10.3)

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

  1. liftA2 :: Applicative f => (a -> b -> c) -> f a -> f b -> f c

    rio RIO.Prelude

    Lift a binary function to actions. Some functors support an implementation of liftA2 that is more efficient than the default one. In particular, if fmap is an expensive operation, it is likely better to use liftA2 than to fmap over the structure and then use <*>. This became a typeclass method in 4.10.0.0. Prior to that, it was a function defined in terms of <*> and fmap.

    Example

    >>> liftA2 (,) (Just 3) (Just 5)
Just (3,5)

    >>> liftA2 (+) [1, 2, 3] [4, 5, 6]
[5,6,7,6,7,8,7,8,9]

  2. liftA2 :: Applicative f => (a -> b -> c) -> f a -> f b -> f c

    diagrams-lib Diagrams.Prelude

    Lift a binary function to actions. Some functors support an implementation of liftA2 that is more efficient than the default one. In particular, if fmap is an expensive operation, it is likely better to use liftA2 than to fmap over the structure and then use <*>. This became a typeclass method in 4.10.0.0. Prior to that, it was a function defined in terms of <*> and fmap.

    Example

    >>> liftA2 (,) (Just 3) (Just 5)
Just (3,5)

    >>> liftA2 (+) [1, 2, 3] [4, 5, 6]
[5,6,7,6,7,8,7,8,9]

  3. liftA2 :: Applicative f => (a -> b -> c) -> f a -> f b -> f c

    diagrams-lib Diagrams.Prelude

    Lift a binary function to actions. Some functors support an implementation of liftA2 that is more efficient than the default one. In particular, if fmap is an expensive operation, it is likely better to use liftA2 than to fmap over the structure and then use <*>. This became a typeclass method in 4.10.0.0. Prior to that, it was a function defined in terms of <*> and fmap.

    Example

    >>> liftA2 (,) (Just 3) (Just 5)
Just (3,5)

    >>> liftA2 (+) [1, 2, 3] [4, 5, 6]
[5,6,7,6,7,8,7,8,9]

  4. liftA2 :: Applicative f => (a -> b -> c) -> f a -> f b -> f c

    Cabal-syntax Distribution.Compat.Prelude

    No documentation available.

  5. liftA2 :: Applicative f => (a -> b -> c) -> f a -> f b -> f c

    relude Relude.Applicative

    Lift a binary function to actions. Some functors support an implementation of liftA2 that is more efficient than the default one. In particular, if fmap is an expensive operation, it is likely better to use liftA2 than to fmap over the structure and then use <*>. This became a typeclass method in 4.10.0.0. Prior to that, it was a function defined in terms of <*> and fmap.

    Example

    >>> liftA2 (,) (Just 3) (Just 5)
Just (3,5)

    >>> liftA2 (+) [1, 2, 3] [4, 5, 6]
[5,6,7,6,7,8,7,8,9]

  6. liftA2 :: Applicative f => (a -> b -> c) -> f a -> f b -> f c

    streaming Streaming

    Lift a binary function to actions. Some functors support an implementation of liftA2 that is more efficient than the default one. In particular, if fmap is an expensive operation, it is likely better to use liftA2 than to fmap over the structure and then use <*>. This became a typeclass method in 4.10.0.0. Prior to that, it was a function defined in terms of <*> and fmap.

    Example

    >>> liftA2 (,) (Just 3) (Just 5)
Just (3,5)

    >>> liftA2 (+) [1, 2, 3] [4, 5, 6]
[5,6,7,6,7,8,7,8,9]

  7. liftA2 :: Applicative f => (a -> b -> c) -> f a -> f b -> f c

    basement Basement.Compat.Base

    Lift a binary function to actions. Some functors support an implementation of liftA2 that is more efficient than the default one. In particular, if fmap is an expensive operation, it is likely better to use liftA2 than to fmap over the structure and then use <*>. This became a typeclass method in 4.10.0.0. Prior to that, it was a function defined in terms of <*> and fmap.

    Example

    >>> liftA2 (,) (Just 3) (Just 5)
Just (3,5)

    >>> liftA2 (+) [1, 2, 3] [4, 5, 6]
[5,6,7,6,7,8,7,8,9]

  8. liftA2 :: Applicative f => (a -> b -> c) -> f a -> f b -> f c

    basement Basement.Imports

    Lift a binary function to actions. Some functors support an implementation of liftA2 that is more efficient than the default one. In particular, if fmap is an expensive operation, it is likely better to use liftA2 than to fmap over the structure and then use <*>. This became a typeclass method in 4.10.0.0. Prior to that, it was a function defined in terms of <*> and fmap.

    Example

    >>> liftA2 (,) (Just 3) (Just 5)
Just (3,5)

    >>> liftA2 (+) [1, 2, 3] [4, 5, 6]
[5,6,7,6,7,8,7,8,9]

  9. liftA2 :: Applicative f => (a -> b -> c) -> f a -> f b -> f c

    ghc-internal GHC.Internal.Base

    Lift a binary function to actions. Some functors support an implementation of liftA2 that is more efficient than the default one. In particular, if fmap is an expensive operation, it is likely better to use liftA2 than to fmap over the structure and then use <*>. This became a typeclass method in 4.10.0.0. Prior to that, it was a function defined in terms of <*> and fmap.

    Example

    >>> liftA2 (,) (Just 3) (Just 5)
Just (3,5)

    >>> liftA2 (+) [1, 2, 3] [4, 5, 6]
[5,6,7,6,7,8,7,8,9]

  10. liftA2 :: Applicative f => (a -> b -> c) -> f a -> f b -> f c

    protolude Protolude

    Lift a binary function to actions. Some functors support an implementation of liftA2 that is more efficient than the default one. In particular, if fmap is an expensive operation, it is likely better to use liftA2 than to fmap over the structure and then use <*>. This became a typeclass method in 4.10.0.0. Prior to that, it was a function defined in terms of <*> and fmap.

    Example

    >>> liftA2 (,) (Just 3) (Just 5)
Just (3,5)

    >>> liftA2 (+) [1, 2, 3] [4, 5, 6]
[5,6,7,6,7,8,7,8,9]

Page 6 of many | Previous | Next