Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
insertMap :: IsMap map => ContainerKey map -> MapValue map -> map -> mapmono-traversable Data.Containers Insert a key-value pair into a map.
intersectionMap :: PolyMap map => map value1 -> map value2 -> map value1mono-traversable Data.Containers Get the intersection of two maps, using the left map's values.
-
mono-traversable Data.Containers Get the intersection of two maps with a supplied function that takes in the left map's value and the right map's value.
-
mono-traversable Data.Containers Apply a function over every key of a pair and run unionsWith over the results.
singletonMap :: IsMap map => ContainerKey map -> MapValue map -> mapmono-traversable Data.Containers Create a map from a single key-value pair.
updateMap :: IsMap map => (MapValue map -> Maybe (MapValue map)) -> ContainerKey map -> map -> mapmono-traversable Data.Containers Apply a function to the value of a given key. If the function returns Nothing, this deletes the key-value pair. Returns the input map when the key-value pair does not exist.
oconcatMap :: (MonoFoldable mono, Monoid m) => (Element mono -> m) -> mono -> mmono-traversable Data.MonoTraversable Synonym for ofoldMap
ofoldMap :: (MonoFoldable mono, Monoid m) => (Element mono -> m) -> mono -> mmono-traversable Data.MonoTraversable Map each element of a monomorphic container to a Monoid and combine the results.
ofoldMap1Ex :: (MonoFoldable mono, Semigroup m) => (Element mono -> m) -> mono -> mmono-traversable Data.MonoTraversable Map each element of a monomorphic container to a semigroup, and combine the results. Note: this is a partial function. On an empty MonoFoldable, it will throw an exception. See ofoldMap1 from Data.NonNull for a total version of this function.
omap :: MonoFunctor mono => (Element mono -> Element mono) -> mono -> monomono-traversable Data.MonoTraversable Map over a monomorphic container