Hoogle Search
Within LTS Haskell 24.35 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
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.
map :: Ord b => (a -> b) -> NonEmptySet a -> NonEmptySet bCabal-syntax Distribution.Compat.NonEmptySet No documentation available.
-
Cabal-syntax Distribution.Compat.Prelude No documentation available.
map :: C sh => (a -> b) -> Array sh a -> Array sh bcomfort-array Data.Array.Comfort.Boxed No documentation available.
map :: C sh => (a -> b) -> Array sh a -> Array sh bcomfort-array Data.Array.Comfort.Boxed.Unchecked No documentation available.
map :: (C sh, Storable a, Storable b) => (a -> b) -> Array sh a -> Array sh bcomfort-array Data.Array.Comfort.Storable No documentation available.
map :: (C sh, Storable a, Storable b) => (a -> b) -> Array sh a -> Array sh bcomfort-array Data.Array.Comfort.Storable.Unchecked No documentation available.
-
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]