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 :: (Key -> Key) -> Word64Set -> Word64Set

   ghc	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

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

   ghc	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

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

   ghc	GHC.Prelude.Basic

   No documentation available.

4. map :: forall (m :: Type -> Type) a b r . Functor m => (a -> b) -> Pipe a b m r

   pipes	Pipes.Prelude

   Apply a function to all values flowing downstream

   map id = cat
   
   map (g . f) = map f >-> map g
   

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

   haskell-gi-base	Data.GI.Base.ShortPrelude

   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]
   

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

   regex-tdfa	Data.IntMap.CharMap2

   No documentation available.

7. map :: Enum key => (a -> b) -> EnumMap key a -> EnumMap key b

   regex-tdfa	Data.IntMap.EnumMap2

   No documentation available.

8. map :: Enum e => (e -> e) -> EnumSet e -> EnumSet e

   regex-tdfa	Data.IntSet.EnumSet2

   No documentation available.

9. map :: Ord a => Fold (a, b) (Map a b)

   foldl	Control.Foldl

   Fold pairs into a map.

10. map :: Ord k => (a -> b) -> T k a -> T k b

    non-empty	Data.NonEmpty.Map

    No documentation available.

Page 18 of many | Previous | Next