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

    ghc-lib-parser GHC.Prelude.Basic

    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)

  2. foldMap :: (Foldable t, Monoid m) => (a -> m) -> t a -> m

    ghc-lib-parser GHC.Prelude.Basic

    Map each element of the structure into a monoid, and combine the results with (<>). This fold is right-associative and lazy in the accumulator. For strict left-associative folds consider foldMap' instead.

    Examples

    Basic usage: 
    >>> foldMap Sum [1, 3, 5]
Sum {getSum = 9}

    >>> foldMap Product [1, 3, 5]
Product {getProduct = 15}

    >>> foldMap (replicate 3) [1, 2, 3]
[1,1,1,2,2,2,3,3,3]
    When a Monoid's (<>) is lazy in its second argument, foldMap can return a result even from an unbounded structure. For example, lazy accumulation enables Data.ByteString.Builder to efficiently serialise large data structures and produce the output incrementally: 
    >>> import qualified Data.ByteString.Lazy as L

>>> import qualified Data.ByteString.Builder as B

>>> let bld :: Int -> B.Builder; bld i = B.intDec i <> B.word8 0x20

>>> let lbs = B.toLazyByteString $ foldMap bld [0..]

>>> L.take 64 lbs
"0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24"

  3. stgToCmmInfoTableMap :: StgToCmmConfig -> !Bool

    ghc-lib-parser GHC.StgToCmm.Config

    true means generate C Stub for IPE map, See Note [Mapping Info Tables to Source Positions]

  4. stgToCmmInfoTableMapWithFallback :: StgToCmmConfig -> !Bool

    ghc-lib-parser GHC.StgToCmm.Config

    Include info tables with fallback source locations in the info table map

  5. stgToCmmInfoTableMapWithStack :: StgToCmmConfig -> !Bool

    ghc-lib-parser GHC.StgToCmm.Config

    Include info tables for STACK closures in the info table map

  6. NonCanonical_Mappend :: NonCanonical_Monoid

    ghc-lib-parser GHC.Tc.Errors.Types

    mappend was defined as something other than (<>).

  7. inert_famapp_cache :: InertSet -> FunEqMap Reduction

    ghc-lib-parser GHC.Tc.Solver.InertSet

    No documentation available.

  8. type DictMap a = TcAppMap a

    ghc-lib-parser GHC.Tc.Solver.Types

    No documentation available.

  9. type FunEqMap a = TcAppMap a

    ghc-lib-parser GHC.Tc.Solver.Types

    No documentation available.

  10. type TcAppMap a = DTyConEnv ListMap LooseTypeMap a

    ghc-lib-parser GHC.Tc.Solver.Types

    No documentation available.

Page 610 of many | Previous | Next