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. mapError :: forall e1 e2 (r :: EffectRow) a . Member (Error e2 :: (Type -> Type) -> Type -> Type) r => (e1 -> e2) -> Sem ((Error e1 :: (Type -> Type) -> Type -> Type) ': r) a -> Sem r a

    incipit-core IncipitCore

    Transform one Error into another. This function can be used to aggregate multiple errors into a single type.

  2. mapWithFailure :: (a -> Either String b) -> Parser a -> Parser b

    json-stream Data.JsonStream.Parser

    A back-door for lifting of possibly failing actions. If an action fails with Left value, convert it into failure of parsing

  3. mapMaybeM :: Monad m => Maybe a -> (a -> m b) -> m (Maybe b)

    language-c Language.C.Analysis.TravMonad

    No documentation available.

  4. mapSndM :: Monad m => (b -> m c) -> (a, b) -> m (a, c)

    language-c Language.C.Analysis.TravMonad

    No documentation available.

  5. mapBlockItemStmts :: (CStat -> Bool) -> (CStat -> CStat) -> CBlockItem -> CBlockItem

    language-c Language.C.Syntax.Utils

    No documentation available.

  6. mapSubStmts :: (CStat -> Bool) -> (CStat -> CStat) -> CStat -> CStat

    language-c Language.C.Syntax.Utils

    No documentation available.

  7. mapHom :: (a -> b) -> Path a -> Path b

    lca Data.LCA.Online.Monoidal

    O(n) Re-annotate a Path full of monoidal values/ Unlike map, mapHom f assumes that f is a Monoid homomorphism, that is to say you must ensure 

    f a `mappend' f b = f (a `mappend' b)
f mempty = mempty

  8. mapWithKey :: Monoid b => (Int -> a -> b) -> Path a -> Path b

    lca Data.LCA.Online.Monoidal

    O(n) Re-annotate a Path full of monoidal values with access to the key.

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

    listsafe Data.List.Safe

    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)

    listsafe Data.List.Safe

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