Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. adjustMap :: IsMap map => (MapValue map -> MapValue map) -> ContainerKey map -> map -> map

   mono-traversable	Data.Containers

   Apply a function to the value of a given key. Returns the input map when the key-value pair does not exist.

2. alterMap :: IsMap map => (Maybe (MapValue map) -> Maybe (MapValue map)) -> ContainerKey map -> map -> map

   mono-traversable	Data.Containers

   Update/Delete the value of a given key. Applies a function to previous value of a given key, if it results in Nothing delete the key-value pair from the map, otherwise replace the previous value with the new value.

3. deleteMap :: IsMap map => ContainerKey map -> map -> map

   mono-traversable	Data.Containers

   Delete a key-value pair of a map using a specified key.

4. differenceMap :: PolyMap map => map value1 -> map value2 -> map value1

   mono-traversable	Data.Containers

   Get the difference between two maps, using the left map's values.

5. filterMap :: IsMap map => (MapValue map -> Bool) -> map -> map

   mono-traversable	Data.Containers

   Filter values in a map.

6. insertMap :: IsMap map => ContainerKey map -> MapValue map -> map -> map

   mono-traversable	Data.Containers

   Insert a key-value pair into a map.

7. intersectionMap :: PolyMap map => map value1 -> map value2 -> map value1

   mono-traversable	Data.Containers

   Get the intersection of two maps, using the left map's values.

8. intersectionWithMap :: PolyMap map => (value1 -> value2 -> value3) -> map value1 -> map value2 -> map value3

   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.

9. omapKeysWith :: IsMap map => (MapValue map -> MapValue map -> MapValue map) -> (ContainerKey map -> ContainerKey map) -> map -> map

   mono-traversable	Data.Containers

   Apply a function over every key of a pair and run unionsWith over the results.

10. singletonMap :: IsMap map => ContainerKey map -> MapValue map -> map

    mono-traversable	Data.Containers

    Create a map from a single key-value pair.

Page 487 of many | Previous | Next