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. (<~~~$$$$$>) :: (Functor f0, Functor f1, Functor f2, Functor f3, Functor f4) => (a -> b -> c -> d -> e) -> f4 (f3 (f2 (f1 (f0 d)))) -> f4 (f3 (f2 (f1 (f0 (a -> b -> c -> e)))))

   composition-extra	Data.Functor.Syntax

   No documentation available.

2. (<~~~$$$$>) :: (Functor f0, Functor f1, Functor f2, Functor f3) => (a -> b -> c -> d -> e) -> f3 (f2 (f1 (f0 d))) -> f3 (f2 (f1 (f0 (a -> b -> c -> e))))

   composition-extra	Data.Functor.Syntax

   No documentation available.

3. (<~~~$$$>) :: (Functor f0, Functor f1, Functor f2) => (a -> b -> c -> d -> e) -> f2 (f1 (f0 d)) -> f2 (f1 (f0 (a -> b -> c -> e)))

   composition-extra	Data.Functor.Syntax

   No documentation available.

4. (<~~~$$>) :: (Functor f0, Functor f1) => (a -> b -> c -> d -> e) -> f1 (f0 d) -> f1 (f0 (a -> b -> c -> e))

   composition-extra	Data.Functor.Syntax

   No documentation available.

5. (<~~~$>) :: Functor f0 => (a -> b -> c -> d -> e) -> f0 d -> f0 (a -> b -> c -> e)

   composition-extra	Data.Functor.Syntax

   No documentation available.

6. (-$) :: (a -> b -> c) -> b -> a -> c

   composition-prelude	Control.Composition

   Backwards function application. This is an infix synonym for flip

7. (.$) :: Monad m => m (m a) -> m a

   composition-prelude	Control.Composition

   Infix version of join As an example, one could use this to rewrite

   between (char '"') (char '"')
   

   to

   between .$ (char '"')
   

   Or

   fromEither :: Either a a -> a
   fromEither = either id id
   

   to

   fromEither :: Either a a -> a
   fromEither = either .$ id
   

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

   constrained-categories	Control.Category.Constrained.Prelude

   No documentation available.

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

   constrained-categories	Control.Category.Hask

   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

    constrained-categories	Control.Category.Hask

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