Hoogle Search

Within LTS Haskell 24.15 (ghc-9.10.3)

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

Exact lookup

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

   ghc-lib-parser	GHC.Prelude.Basic

   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 :: Ord b => (a -> b) -> MaxQueue a -> MaxQueue b

   pqueue	Data.PQueue.Max

   Creates a new priority queue containing the images of the elements of this queue. Equivalent to fromList . map f . toList.

3. map :: Ord b => (a -> b) -> MinQueue a -> MinQueue b

   pqueue	Data.PQueue.Min

   Creates a new priority queue containing the images of the elements of this queue. Equivalent to fromList . map f . toList.

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

   pqueue	Data.PQueue.Prio.Max

   Map a function over all values in the queue.

5. map :: (a -> b) -> MinPQueue k a -> MinPQueue k b

   pqueue	Data.PQueue.Prio.Min

   Map a function over all values in the queue.

6. map :: (a -> b) -> T a -> T b

   sample-frame	Sound.Frame.Stereo

   No documentation available.

7. map :: forall t (f :: Type -> Type -> Type) a u b . (Recursive (->) t (f a), Steppable (->) u (f b), Bifunctor f) => (a -> b) -> t -> u

   yaya	Yaya.Zoo

   A more general implementation of fmap, because it can also work to, from, or within monomorphic structures, obviating the need for classes like MonoFunctor.

8. map :: (Contiguous arr1, Element arr1 b, Contiguous arr2, Element arr2 c) => (b -> c) -> arr1 b -> arr2 c

   contiguous	Data.Primitive.Contiguous

   Map over the elements of an array. Note that because a new array must be created, the resulting array type can be different than the original.

9. map :: Ord k => Decoder k -> Decoder v -> Decoder (Map k v)

   dhall	Dhall.Marshal.Decode

   Decode a Map from a toMap expression or generally a Prelude.Map.Type.

   >>> input (Dhall.map strictText bool) "toMap { a = True, b = False }"
   fromList [("a",True),("b",False)]
   
   >>> input (Dhall.map strictText bool) "[ { mapKey = \"foo\", mapValue = True } ]"
   fromList [("foo",True)]
   

   If there are duplicate mapKeys, later mapValues take precedence:

   >>> let expr = "[ { mapKey = 1, mapValue = True }, { mapKey = 1, mapValue = False } ]"
   
   >>> input (Dhall.map natural bool) expr
   fromList [(1,False)]
   

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

    express	Data.Express.Triexpr

    Maps a function to the stored values in a Triexpr.

Page 16 of many | Previous | Next