Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
map :: forall s k a b . (a -> b) -> Map s k a -> Map s k brefined-containers Data.Map.Refined Apply a function to all values in a map. The set of keys remains the same.
map :: forall s k a b . (a -> b) -> Map s k a -> Map s k brefined-containers Data.Map.Strict.Refined Apply a function to all values in a map. The set of keys remains the same.
-
refined-containers Data.Set.Refined Apply the given function to each element of the set and collect the results. Note that the resulting set can be smaller.
map :: MonadUnliftIO m => (a -> b) -> InputStream a -> m (InputStream b)unliftio-streams UnliftIO.Streams.Combinators No documentation available.
-
xmonad-contrib XMonad.Config.Prime 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]
-
xmonad-contrib XMonad.Prelude 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]
-
unix System.Posix.Terminal ICRNL - Map CR to NL on input
-
unix System.Posix.Terminal INLCR - Map NL to CR on input
-
unix System.Posix.Terminal ONLCR - (XSI) Map NL to CR-NL on output
-
unix System.Posix.Terminal.ByteString ICRNL - Map CR to NL on input