Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

  1. map :: (a -> b) -> [a] -> [b]

    LambdaHack Game.LambdaHack.Core.Prelude

    map f xs is the list obtained by applying f to each element of xs, i.e., 

    map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn]
map f [x1, x2, ...] == [f x1, f x2, ...]
    this means that map id == id

    Examples

    >>> map (+1) [1, 2, 3]
[2,3,4]

    >>> map id [1, 2, 3]
[1,2,3]

    >>> map (\n -> 3 * n + 1) [1, 2, 3]
[4,7,10]

  2. map :: (a -> b) -> Stream a -> Stream b

    Stream Data.Stream

    Apply a function uniformly over all elements of a sequence.

  3. map :: Ix i => (Bool -> Bool) -> BitArray i -> BitArray i

    bitwise Data.Array.BitArray

    Bitwise map. Implementation lifts from Bool to Bits and maps large chunks at a time.

  4. map :: Ix i => (Bool -> Bool) -> IOBitArray i -> IO (IOBitArray i)

    bitwise Data.Array.BitArray.IO

    Bitwise map. Implementation lifts from Bool to Bits and maps large chunks at a time.

  5. map :: Ix i => (Bool -> Bool) -> STBitArray s i -> ST s (STBitArray s i)

    bitwise Data.Array.BitArray.ST

    Bitwise map. Implementation lifts from Bool to Bits and maps large chunks at a time.

  6. map :: Bits b => (Bool -> Bool) -> b -> b

    bitwise Data.Bits.Bitwise

    Lift a unary boolean operation to a bitwise operation. The implementation is by exhaustive input/output case analysis: thus the operation provided must be total.

  7. map :: (a -> b) -> [a] -> [b]

    cabal-install-solver Distribution.Solver.Compat.Prelude

    map f xs is the list obtained by applying f to each element of xs, i.e., 

    map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn]
map f [x1, x2, ...] == [f x1, f x2, ...]
    this means that map id == id

    Examples

    >>> map (+1) [1, 2, 3]
[2,3,4]

    >>> map id [1, 2, 3]
[1,2,3]

    >>> map (\n -> 3 * n + 1) [1, 2, 3]
[4,7,10]

  8. map :: (v1 -> v2) -> PSQ k v1 -> PSQ k v2

    cabal-install-solver Distribution.Solver.Modular.PSQ

    No documentation available.

  9. map :: forall a b (n :: Nat) . (a -> b) -> Vec n a -> Vec n b

    clash-prelude Clash.Explicit.Prelude

    "map f xs" is the vector obtained by applying f to each element of xs, i.e., 

    map f (x1 :> x2 :>  ... :> xn :> Nil) == (f x1 :> f x2 :> ... :> f xn :> Nil)
    and corresponds to the following circuit layout:

  10. map :: forall a b (n :: Nat) . (a -> b) -> Vec n a -> Vec n b

    clash-prelude Clash.Explicit.Prelude.Safe

    "map f xs" is the vector obtained by applying f to each element of xs, i.e., 

    map f (x1 :> x2 :>  ... :> xn :> Nil) == (f x1 :> f x2 :> ... :> f xn :> Nil)
    and corresponds to the following circuit layout:

Page 34 of many | Previous | Next