Hoogle Search

Within LTS Haskell 24.17 (ghc-9.10.3)

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

Exact lookup

1. map :: T sample0 sample1 -> T s sample0 sample1

   synthesizer-dimensional	Synthesizer.Dimensional.Causal.Process

   No documentation available.

2. 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]
   

3. 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]
   

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

   Stream	Data.Stream

   Apply a function uniformly over all elements of a sequence.

5. 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.

6. 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.

7. 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.

8. 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.

9. 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]
   

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

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

    No documentation available.

Page 22 of many | Previous | Next