Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

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

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

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

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

   No documentation available.

4. map :: (Double -> Double) -> Matrix -> Matrix

   dense-linear-algebra	Statistics.Matrix

   Apply function to every element of matrix

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

   ihaskell	IHaskellPrelude

   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]
   

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

   incipit-base	Incipit.Base

   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]
   

7. map :: (Int -> Int) -> IntSet -> IntSet

   intern	Data.Interned.IntSet

   O(n*min(n,W)). map f s is the set obtained by applying f to each element of s. It's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f y

8. map :: (Representable a, Representable b) => (a % 1 -> b) -> List a % 1 -> Pool % 1 -> List b

   linear-base	Foreign.List

   No documentation available.

9. map :: (a -> b) -> ShareMap k a -> ShareMap k b

   liquid-fixpoint	Data.ShareMap

   No documentation available.

10. map :: (a -> b) -> AList a -> AList b

    monad-par-extras	Control.Monad.Par.AList

    The usual map operation.

Page 34 of many | Previous | Next