Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

  1. module Relude.Functor.Fmap

    This module contains useful functions to work with Functor type class.

  2. fmap :: Functor f => (a -> b) -> f a -> f b

    relude Relude.Functor.Reexport

    fmap is used to apply a function of type (a -> b) to a value of type f a, where f is a functor, to produce a value of type f b. Note that for any type constructor with more than one parameter (e.g., Either), only the last type parameter can be modified with fmap (e.g., b in `Either a b`). Some type constructors with two parameters or more have a Bifunctor instance that allows both the last and the penultimate parameters to be mapped over.

    Examples

    Convert from a Maybe Int to a Maybe String using show:
    >>> fmap show Nothing
    Nothing
    
    >>> fmap show (Just 3)
    Just "3"
    
    Convert from an Either Int Int to an Either Int String using show:
    >>> fmap show (Left 17)
    Left 17
    
    >>> fmap show (Right 17)
    Right "17"
    
    Double each element of a list:
    >>> fmap (*2) [1,2,3]
    [2,4,6]
    
    Apply even to the second element of a pair:
    >>> fmap even (2,2)
    (2,True)
    
    It may seem surprising that the function is only applied to the last element of the tuple compared to the list example above which applies it to every element in the list. To understand, remember that tuples are type constructors with multiple type parameters: a tuple of 3 elements (a,b,c) can also be written (,,) a b c and its Functor instance is defined for Functor ((,,) a b) (i.e., only the third parameter is free to be mapped over with fmap). It explains why fmap can be used with tuples containing values of different types as in the following example:
    >>> fmap even ("hello", 1.0, 4)
    ("hello",1.0,True)
    

  3. class RecMapMethod (c :: Type -> Constraint) (f :: u -> Type) (ts :: [u])

    vinyl Data.Vinyl

    Apply a typeclass method to each field of a Rec where the class constrains the index of the field, but not its interpretation functor.

  4. class XRMap (f :: u -> Type) (g :: u -> Type) (rs :: [u])

    vinyl Data.Vinyl

    The implementation of xrmap is broken into a type class to permit unrolling of the recursion across a record. The function mapped across the vector hides the HKD type family under a newtype constructor to help the type checker.

  5. rmapMethod :: RecMapMethod c f ts => (forall (a :: u) . c (PayloadType f a) => f a -> g a) -> Rec f ts -> Rec g ts

    vinyl Data.Vinyl

    No documentation available.

  6. rmapMethodF :: forall c (f :: Type -> Type) (ts :: [Type]) . (Functor f, FieldPayload f ~ 'FieldId, RecMapMethod c f ts) => (forall a . c a => a -> a) -> Rec f ts -> Rec f ts

    vinyl Data.Vinyl

    Apply a typeclass method to each field of a Rec f ts using the Functor instance for f to lift the function into the functor. This is a commonly-used specialization of rmapMethod composed with fmap.

  7. class RecMapMethod (c :: Type -> Constraint) (f :: u -> Type) (ts :: [u])

    vinyl Data.Vinyl.Class.Method

    Apply a typeclass method to each field of a Rec where the class constrains the index of the field, but not its interpretation functor.

  8. class RecMapMethod1 (c :: Type -> Constraint) (f :: u -> Type) (ts :: [u])

    vinyl Data.Vinyl.Class.Method

    Apply a typeclass method to each field of a Rec where the class constrains the field when considered as a value interpreted by the record's interpretation functor.

  9. rmapMethod :: RecMapMethod c f ts => (forall (a :: u) . c (PayloadType f a) => f a -> g a) -> Rec f ts -> Rec g ts

    vinyl Data.Vinyl.Class.Method

    No documentation available.

  10. rmapMethod1 :: RecMapMethod1 c f ts => (forall (a :: u) . c (f a) => f a -> g a) -> Rec f ts -> Rec g ts

    vinyl Data.Vinyl.Class.Method

    No documentation available.

Page 516 of many | Previous | Next