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.
deleteMap :: IsMap map => ContainerKey map -> map -> mapmono-traversable Data.Containers Delete a key-value pair of a map using a specified key.
differenceMap :: PolyMap map => map value1 -> map value2 -> map value1mono-traversable Data.Containers Get the difference between two maps, using the left map's values.
filterMap :: IsMap map => (MapValue map -> Bool) -> map -> mapmono-traversable Data.Containers Filter values in a map.
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