Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

  1. mapsto :: LaTeXC l => l

    HaTeX Text.LaTeX.Packages.AMSMath

    A right-arrow for function definitions, <math>.

  2. mapStrategyM :: Monad m => (a -> m (Maybe b)) -> Strategy a -> m (Strategy b)

    LambdaHack Game.LambdaHack.Client.AI.Strategy

    No documentation available.

  3. mapPosToOffset :: (Point, AttrCharW32) -> (PointUI, AttrString)

    LambdaHack Game.LambdaHack.Client.UI.Animation

    No documentation available.

  4. mapFontIsBitmap :: FrontendSession -> Bool

    LambdaHack Game.LambdaHack.Client.UI.Frontend.Sdl

    No documentation available.

  5. mapStartY :: Int

    LambdaHack Game.LambdaHack.Client.UI.PointUI

    The row where the dungeon map starts, both in PointUI and PointSquare coordinates.

  6. mapToSquare :: Point -> PointSquare

    LambdaHack Game.LambdaHack.Client.UI.PointUI

    No documentation available.

  7. mapActorItems_ :: Monad m => (CStore -> ItemId -> ItemQuant -> m ()) -> Actor -> State -> m ()

    LambdaHack Game.LambdaHack.Common.ActorState

    No documentation available.

  8. mapA :: (UnboxRepClass c, UnboxRepClass d) => (c -> d) -> Array c -> Array d

    LambdaHack Game.LambdaHack.Common.PointArray

    Map over an array.

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

    LambdaHack Game.LambdaHack.Core.Prelude

    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)

    LambdaHack Game.LambdaHack.Core.Prelude

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