Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

Exact lookup

1. (<$) :: Functor f => a -> f b -> f a

   LambdaHack	Game.LambdaHack.Core.Prelude

   Replace all locations in the input with the same value. The default definition is fmap . const, but this may be overridden with a more efficient version.

   Examples

   Perform a computation with Maybe and replace the result with a constant value if it is Just:

   >>> 'a' <$ Just 2
   Just 'a'
   
   >>> 'a' <$ Nothing
   Nothing
   

2. (<$!>) :: Monad m => (a -> b) -> m a -> m b

   LambdaHack	Game.LambdaHack.Core.Prelude

   Strict version of <$>.

3. (<$$>) :: (Functor f, Functor g) => (a -> b) -> f (g a) -> f (g b)

   LambdaHack	Game.LambdaHack.Core.Prelude

   No documentation available.

4. (<$>) :: Functor f => (a -> b) -> f a -> f b

   LambdaHack	Game.LambdaHack.Core.Prelude

   An infix synonym for fmap. The name of this operator is an allusion to $. Note the similarities between their types:

   ($)  ::              (a -> b) ->   a ->   b
   (<$>) :: Functor f => (a -> b) -> f a -> f b
   

   Whereas $ is function application, <$> is function application lifted over a Functor.

   Examples

   Convert from a Maybe Int to a Maybe String using show:

   >>> show <$> Nothing
   Nothing
   

   >>> show <$> Just 3
   Just "3"
   

   Convert from an Either Int Int to an Either Int String using show:

   >>> show <$> Left 17
   Left 17
   

   >>> show <$> Right 17
   Right "17"
   

   Double each element of a list:

   >>> (*2) <$> [1,2,3]
   [2,4,6]
   

   Apply even to the second element of a pair:

   >>> even <$> (2,2)
   (2,True)
   

5. (<$) :: (Traversable f, Backprop b, Backprop (f a), Reifies s W) => BVar s b -> BVar s (f a) -> BVar s (f b)

   backprop	Prelude.Backprop

   Alias for fmapConst.

6. (<$>) :: (Traversable f, Backprop a, Backprop b, Reifies s W) => (BVar s a -> BVar s b) -> BVar s (f a) -> BVar s (f b)

   backprop	Prelude.Backprop

   Alias for fmap.

7. (<$) :: (Functor f, Foldable f, Num b, Num (f a), Reifies s W) => BVar s b -> BVar s (f a) -> BVar s (f b)

   backprop	Prelude.Backprop.Num

   Alias for fmapConst.

8. (<$>) :: (Traversable f, Num a, Num b, Reifies s W) => (BVar s a -> BVar s b) -> BVar s (f a) -> BVar s (f b)

   backprop	Prelude.Backprop.Num

   Alias for fmap.

9. (<$) :: Functor f => a -> f b -> f a

   cabal-install-solver	Distribution.Solver.Compat.Prelude

   Replace all locations in the input with the same value. The default definition is fmap . const, but this may be overridden with a more efficient version.

   Examples

   Perform a computation with Maybe and replace the result with a constant value if it is Just:

   >>> 'a' <$ Just 2
   Just 'a'
   
   >>> 'a' <$ Nothing
   Nothing
   

10. (<$>) :: Functor f => (a -> b) -> f a -> f b

    cabal-install-solver	Distribution.Solver.Compat.Prelude

    An infix synonym for fmap. The name of this operator is an allusion to $. Note the similarities between their types:

    ($)  ::              (a -> b) ->   a ->   b
    (<$>) :: Functor f => (a -> b) -> f a -> f b
    

    Whereas $ is function application, <$> is function application lifted over a Functor.

    Examples

    Convert from a Maybe Int to a Maybe String using show:

    >>> show <$> Nothing
    Nothing
    

    >>> show <$> Just 3
    Just "3"
    

    Convert from an Either Int Int to an Either Int String using show:

    >>> show <$> Left 17
    Left 17
    

    >>> show <$> Right 17
    Right "17"
    

    Double each element of a list:

    >>> (*2) <$> [1,2,3]
    [2,4,6]
    

    Apply even to the second element of a pair:

    >>> even <$> (2,2)
    (2,True)
    

Page 64 of many | Previous | Next