Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

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

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

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

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

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

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

   dense-linear-algebra	Statistics.Matrix

   Apply function to every element of matrix

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

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

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

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

    linear-base	Foreign.List

    No documentation available.

Page 23 of many | Previous | Next