Hoogle Search
Within LTS Haskell 24.15 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
map :: (ListLike full item, ListLike full' item') => (item -> item') -> full -> full'ListLike Data.ListLike.Base Apply a function to each element, returning any other valid ListLike. rigidMap will always be at least as fast, if not faster, than this function and is recommended if it will work for your purposes. See also mapM.
map :: Functor f => (a -> b) -> f a -> f bbasic-prelude BasicPrelude map = fmap
map :: Functor f => (a -> b) -> f a -> f bclassy-prelude ClassyPrelude No documentation available.
map :: forall (m :: Type -> Type) a b x . Monad m => (a -> b) -> Stream m a x -> Stream m b xghc-lib-parser GHC.Data.Stream Apply a function to each element of a Stream, lazily
map :: (a -> b) -> Word64Map a -> Word64Map bghc-lib-parser GHC.Data.Word64Map.Internal Map a function over all values in the map.
map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
map :: (a -> b) -> Word64Map a -> Word64Map bghc-lib-parser GHC.Data.Word64Map.Lazy Map a function over all values in the map.
map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
map :: (a -> b) -> Word64Map a -> Word64Map bghc-lib-parser GHC.Data.Word64Map.Strict Map a function over all values in the map.
map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
map :: (a -> b) -> Word64Map a -> Word64Map bghc-lib-parser GHC.Data.Word64Map.Strict.Internal Map a function over all values in the map.
map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
map :: (Key -> Key) -> Word64Set -> Word64Setghc-lib-parser GHC.Data.Word64Set map f s is the set obtained by applying f to each element of s. It's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f y
map :: (Key -> Key) -> Word64Set -> Word64Setghc-lib-parser GHC.Data.Word64Set.Internal map f s is the set obtained by applying f to each element of s. It's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f y