Hoogle Search

Within LTS Haskell 24.4 (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) -> Word64Map a -> Word64Map b

   ghc-lib-parser	GHC.Data.Word64Map.Strict.Internal

   Map a function over all values in the map.

   map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
   

2. map :: (Key -> Key) -> Word64Set -> Word64Set

   ghc-lib-parser	GHC.Data.Word64Set

   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

3. map :: (Key -> Key) -> Word64Set -> Word64Set

   ghc-lib-parser	GHC.Data.Word64Set.Internal

   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

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

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

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

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

   pqueue	Data.PQueue.Prio.Max

   Map a function over all values in the queue.

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

   pqueue	Data.PQueue.Prio.Min

   Map a function over all values in the queue.

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

   sample-frame	Sound.Frame.Stereo

   No documentation available.

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

Page 27 of many | Previous | Next