Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. data a ~>@#@$$ (b :: TyFun Type Type)

   singletons	Data.Singletons

   No documentation available.

2. type x ~>@#@$$$ y = x ~> y

   singletons	Data.Singletons

   No documentation available.

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

   relude	Relude.Functor.Fmap

   Alias for fmap . fmap. Convenient to work with two nested Functors.

   >>> negate <<$>> Just [1,2,3]
   Just [-1,-2,-3]
   

4. (<$) :: 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
   

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

   relude	Relude.Functor.Reexport

   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)
   

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

   relude	Relude.Monad.Reexport

   Strict version of <$>.

7. data ((c :: a -> b) <$> (d :: Exp a)) (e :: b)

   first-class-families	Fcf

   No documentation available.

8. data ((c :: a -> b) <$> (d :: Exp a)) (e :: b)

   first-class-families	Fcf.Combinators

   No documentation available.

9. (<$?>) :: Filterable f => (a -> Maybe b) -> f a -> f b

   witherable	Witherable

   An infix alias for mapMaybe. The name of the operator alludes to <$>, and has the same fixity.

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 39 of many | Previous | Next