Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

Exact lookup

1. fontMapBitmap :: FontSet -> Text

   LambdaHack	Game.LambdaHack.Common.Misc

   No documentation available.

2. fontMapScalable :: FontSet -> Text

   LambdaHack	Game.LambdaHack.Common.Misc

   No documentation available.

3. imapA :: (UnboxRepClass c, UnboxRepClass d) => (Point -> c -> d) -> Array c -> Array d

   LambdaHack	Game.LambdaHack.Common.PointArray

   Map over an array (function applied to each element and its index).

4. imapMA_ :: (Monad m, UnboxRepClass c) => (Point -> c -> m ()) -> Array c -> m ()

   LambdaHack	Game.LambdaHack.Common.PointArray

   Map monadically over an array (function applied to each element and its index) and ignore the results.

5. sitemIxMap :: State -> ItemIxMap

   LambdaHack	Game.LambdaHack.Common.State

   No documentation available.

6. unknownTileMap :: Area -> ContentId TileKind -> X -> Y -> TileMap

   LambdaHack	Game.LambdaHack.Common.State

   Create a map full of unknown tiles.

   >>> unknownTileMap (fromJust (toArea (0,0,0,0))) TK.unknownId 2 2
   PointArray.Array with size (2,2)
   

7. updateItemIxMap :: (ItemIxMap -> ItemIxMap) -> State -> State

   LambdaHack	Game.LambdaHack.Common.State

   Update the item kind index map.

8. concatMap :: Foldable t => (a -> [b]) -> t a -> [b]

   LambdaHack	Game.LambdaHack.Core.Prelude

   Map a function over all the elements of a container and concatenate the resulting lists.

   Examples

   Basic usage:

   >>> concatMap (take 3) [[1..], [10..], [100..], [1000..]]
   [1,2,3,10,11,12,100,101,102,1000,1001,1002]
   

   >>> concatMap (take 3) (Just [1..])
   [1,2,3]
   

9. concatMap :: Foldable t => (a -> [b]) -> t a -> [b]

   LambdaHack	Game.LambdaHack.Core.Prelude

   Map a function over all the elements of a container and concatenate the resulting lists.

   Examples

   Basic usage:

   >>> concatMap (take 3) [[1..], [10..], [100..], [1000..]]
   [1,2,3,10,11,12,100,101,102,1000,1001,1002]
   

   >>> concatMap (take 3) (Just [1..])
   [1,2,3]
   

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

    LambdaHack	Game.LambdaHack.Core.Prelude

    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)
    

Page 1010 of many | Previous | Next