Hoogle Search
Within LTS Haskell 24.3 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
map :: (a -> b) -> Map k a -> Map k bcontainers Data.Map.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) -> Map k a -> Map k bcontainers Data.Map.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) -> Map k a -> Map k bcontainers Data.Map.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) -> Map k a -> Map k bcontainers Data.Map.Strict.Internal Map a function over all values in the map.
map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
map :: Ord b => (a -> b) -> Set a -> Set bcontainers Data.Set 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 :: Ord b => (a -> b) -> Set a -> Set bcontainers Data.Set.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
map :: (a -> b) -> KeyMap a -> KeyMap baeson Data.Aeson.KeyMap Map a function over all values in the map.
map :: (v1 -> v2) -> HashMap k v1 -> HashMap k v2unordered-containers Data.HashMap.Internal Transform this map by applying a function to every value.
map :: (a -> b) -> Array a -> Array bunordered-containers Data.HashMap.Internal.Array No documentation available.
map :: (v1 -> v2) -> HashMap k v1 -> HashMap k v2unordered-containers Data.HashMap.Internal.Strict Transform this map by applying a function to every value.