Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

  1. mapWithAlphabeticName :: (Name -> a -> b) -> [a] -> [b]

    th-lego THLego.Helpers

    Map every element of a list with a new name.

  2. mapperIsLabel :: TyLit -> Type -> Type -> Exp -> Dec

    th-lego THLego.Instances

    Template of IsLabel for instances mapping to mapper functions. 

    instance (mapper ~ (Text -> Text)) => IsLabel "name" (mapper -> Person -> Person)

  3. mapSlim :: forall (procs :: [Type]) . AreProcs procs => HandlesOf procs -> [SlimHandle]

    tmp-proc System.TmpProc.Docker

    Obtain the SlimHandle of several Procs

  4. mapping :: [Pair] -> Node ()

    HsYAML Data.YAML

    No documentation available.

  5. mapM :: (ListLike full item, Applicative m, ListLike full' item') => (item -> m item') -> full -> m full'

    ListLike Data.ListLike

    A map in monad space. Same as sequence . map See also rigidMapM

  6. mapM_ :: (Monad m, FoldableLL full item) => (item -> m b) -> full -> m ()

    ListLike Data.ListLike

    A map in monad space, discarding results.

  7. mapM :: (ListLike full item, Applicative m, ListLike full' item') => (item -> m item') -> full -> m full'

    ListLike Data.ListLike.Base

    A map in monad space. Same as sequence . map See also rigidMapM

  8. mapM_ :: (Monad m, FoldableLL full item) => (item -> m b) -> full -> m ()

    ListLike Data.ListLike.FoldableLL

    A map in monad space, discarding results.

  9. mapAccumL :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)

    basic-prelude BasicPrelude

    The mapAccumL function behaves like a combination of fmap and foldl; it applies a function to each element of a structure, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new structure.

    Examples

    Basic usage: 
    >>> mapAccumL (\a b -> (a + b, a)) 0 [1..10]
(55,[0,1,3,6,10,15,21,28,36,45])

    >>> mapAccumL (\a b -> (a <> show b, a)) "0" [1..5]
("012345",["0","01","012","0123","01234"])

  10. mapAccumR :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)

    basic-prelude BasicPrelude

    The mapAccumR function behaves like a combination of fmap and foldr; it applies a function to each element of a structure, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new structure.

    Examples

    Basic usage: 
    >>> mapAccumR (\a b -> (a + b, a)) 0 [1..10]
(55,[54,52,49,45,40,34,27,19,10,0])

    >>> mapAccumR (\a b -> (a <> show b, a)) "0" [1..5]
("054321",["05432","0543","054","05","0"])

Page 207 of many | Previous | Next