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.
map :: (Word16 -> Word16) -> ShortByteString -> ShortByteStringos-string System.OsString.Data.ByteString.Short.Word16 O(n) map f xs is the ShortByteString obtained by applying f to each element of xs.
map :: (OsChar -> OsChar) -> OsString -> OsStringos-string System.OsString.Internal O(n) map f xs is the OsString obtained by applying f to each element of xs.
map :: (PosixChar -> PosixChar) -> PosixString -> PosixStringos-string System.OsString.Posix O(n) map f xs is the OsString obtained by applying f to each element of xs.
map :: (WindowsChar -> WindowsChar) -> WindowsString -> WindowsStringos-string System.OsString.Windows O(n) map f xs is the OsString obtained by applying f to each element of xs.
-
relude Relude.List.Reexport 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 :: (v1 -> v2) -> InsOrdHashMap k v1 -> InsOrdHashMap k v2insert-ordered-containers Data.HashMap.Strict.InsOrd No documentation available.
map :: (Hashable b, Eq b) => (a -> b) -> InsOrdHashSet a -> InsOrdHashSet binsert-ordered-containers Data.HashSet.InsOrd No documentation available.
-
streaming Streaming.Prelude Standard map on the elements of a stream.
>>> S.stdoutLn $ S.map reverse $ each (words "alpha beta") ahpla ateb
map :: (Char -> Char) -> YiString -> YiStringyi-rope Yi.Rope Maps the characters over the underlying string.
map :: (a -> b) -> NonEmpty a -> NonEmpty bbase-compat-batteries Data.List.NonEmpty.Compat Map a function over a NonEmpty stream.