Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

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

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

   clash-prelude	Clash.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:

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

   clash-prelude	Clash.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:

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

   clash-prelude	Clash.Sized.Vector

   "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:

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

   dense-linear-algebra	Statistics.Matrix

   Apply function to every element of matrix

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

Page 34 of many | Previous | Next