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 :: (Unbox a, Unbox b) => (a -> b) -> Histogram bin a -> Histogram bin bhistogram-fill Data.Histogram No documentation available.
-
histogram-fill Data.Histogram.Generic fmap lookalike. It's not possible to create Functor instance because of type class context.
-
hledger-web Hledger.Web.Import 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) -> [a] <-> [b]invertible Data.Invertible.List Apply a bijection over a list using map.
map :: (a <-> b) -> [a] <-> [b]invertible Data.Invertible.Prelude Apply a bijection over a list using map.
map :: forall (m :: Type -> Type) a b . Monad m => (a -> b) -> Stream m a -> Stream m bleveldb-haskell Data.Stream.Monadic No documentation available.
map :: (Char -> Char) -> Text -> Textmiso Miso.String O(n) map f t is the Text obtained by applying f to each element of t. Example:
>>> let message = pack "I am not angry. Not at all." >>> T.map (\c -> if c == '.' then '!' else c) message "I am not angry! Not at all!"
Performs replacement on invalid scalar values.map :: (Ord k, Ord v1, Ord v2) => (v1 -> v2) -> SetMultimap k v1 -> SetMultimap k v2more-containers Data.Multimap.Set O(n * log n) Maps over the multimap's values. This function is useful since Set is not a functor.
map :: (Ord v1, Ord v2) => (v1 -> v2) -> Multiset v1 -> Multiset v2more-containers Data.Multiset Maps on the multiset's values.
map :: (Char -> Char) -> NonEmptyText -> NonEmptyTextnon-empty-text Data.NonEmptyText O(n) map f t is the NonEmptyText obtained by applying f to each element of t.