Hoogle Search
Within LTS Haskell 24.3 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
map :: forall (m :: Type -> Type) a b r . Functor m => (a -> b) -> Pipe a b m rpipes Pipes.Prelude Apply a function to all values flowing downstream
map id = cat map (g . f) = map f >-> map g
-
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 == idExamples
>>> 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]
map :: (a -> b) -> CharMap a -> CharMap bregex-tdfa Data.IntMap.CharMap2 No documentation available.
map :: Enum key => (a -> b) -> EnumMap key a -> EnumMap key bregex-tdfa Data.IntMap.EnumMap2 No documentation available.
map :: Enum e => (e -> e) -> EnumSet e -> EnumSet eregex-tdfa Data.IntSet.EnumSet2 No documentation available.
map :: Ord a => Fold (a, b) (Map a b)foldl Control.Foldl Fold pairs into a map.
map :: Ord k => (a -> b) -> T k a -> T k bnon-empty Data.NonEmpty.Map No documentation available.
map :: (a -> b) -> InputStream a -> IO (InputStream b)io-streams System.IO.Streams.Combinators Maps a pure function over an InputStream. map f s passes all output from s through the function f. Satisfies the following laws:
Streams.map (g . f) === Streams.map f >=> Streams.map g Streams.map id === Streams.makeInputStream . Streams.read
map :: (v1 -> v2) -> KeyMap v1 -> KeyMap v2autodocodec Autodocodec.Aeson.Compat No documentation available.
map :: (Word8 -> Word8) -> ByteString -> ByteStringrio RIO.ByteString O(n) map f xs is the ByteString obtained by applying f to each element of xs.