Hoogle Search

Within LTS Haskell 24.11 (ghc-9.10.2)

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

Exact lookup

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

   faktory	Faktory.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 :: Natural n => (a -> b) -> T n a -> T n b

   fixed-length	Data.FixedLength

   No documentation available.

3. map :: (HVectorF v, ArityC c (ElemsF v)) => Proxy c -> (forall a . c a => f a -> g a) -> v f -> v g

   fixed-vector-hetero	Data.Vector.HFixed

   Apply function to every value of parametrized product.

   >>> map (Proxy @Num) (Identity . fromMaybe 0) (mk2F (Just 12) Nothing :: HVecF '[Double, Int] Maybe)
   [Identity 12.0,Identity 0]
   

4. map :: (a -> b) -> Map k a -> Map k b

   hashmap	Data.HashMap

   Map a function over all values in the map.

5. map :: (Hashable b, Ord b) => (a -> b) -> Set a -> Set b

   hashmap	Data.HashSet

   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

6. map :: (Unbox a, Unbox b) => (a -> b) -> Histogram bin a -> Histogram bin b

   histogram-fill	Data.Histogram

   No documentation available.

7. map :: forall (v :: Type -> Type) a b bin . (Vector v a, Vector v b) => (a -> b) -> Histogram v bin a -> Histogram v bin b

   histogram-fill	Data.Histogram.Generic

   fmap lookalike. It's not possible to create Functor instance because of type class context.

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

   hledger-web	Hledger.Web.Import

   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 :: (a <-> b) -> [a] <-> [b]

   invertible	Data.Invertible.List

   Apply a bijection over a list using map.

10. map :: (a <-> b) -> [a] <-> [b]

    invertible	Data.Invertible.Prelude

    Apply a bijection over a list using map.

Page 38 of many | Previous | Next