Hoogle Search

Within LTS Haskell 24.4 (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

   semigroupoids	Data.Functor.Apply

   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. (<$) :: Functor f => a -> f b -> f a

   semigroupoids	Data.Functor.Bind

   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
   

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

   base-compat	Data.Functor.Compat

   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
   

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

   comonad	Control.Comonad

   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
   

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

   ghc	GHC.Prelude.Basic

   No documentation available.

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

   rio	RIO.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
   

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

   diagrams-lib	Diagrams.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
   

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

   Cabal-syntax	Distribution.Compat.Prelude

   No documentation available.

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

   relude	Relude.Functor.Reexport

   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 -> f b -> f a

    base-compat-batteries	Control.Monad.Compat

    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
    

Page 2 of many | Previous | Next