Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

1. 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.

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

   mono-traversable	Data.Containers

   Create a map from a single key-value pair.

3. updateMap :: IsMap map => (MapValue map -> Maybe (MapValue map)) -> ContainerKey map -> map -> map

   mono-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.

4. oconcatMap :: (MonoFoldable mono, Monoid m) => (Element mono -> m) -> mono -> m

   mono-traversable	Data.MonoTraversable

   Synonym for ofoldMap

5. ofoldMap :: (MonoFoldable mono, Monoid m) => (Element mono -> m) -> mono -> m

   mono-traversable	Data.MonoTraversable

   Map each element of a monomorphic container to a Monoid and combine the results.

6. ofoldMap1Ex :: (MonoFoldable mono, Semigroup m) => (Element mono -> m) -> mono -> m

   mono-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.

7. omap :: MonoFunctor mono => (Element mono -> Element mono) -> mono -> mono

   mono-traversable	Data.MonoTraversable

   Map over a monomorphic container

8. omapM :: (MonoTraversable mono, Applicative m) => (Element mono -> m (Element mono)) -> mono -> m mono

   mono-traversable	Data.MonoTraversable

   Map each element of a monomorphic container to a monadic action, evaluate these actions from left to right, and collect the results.

9. omapM_ :: (MonoFoldable mono, Applicative m) => (Element mono -> m ()) -> mono -> m ()

   mono-traversable	Data.MonoTraversable

   Map each element of a monomorphic container to a monadic action, evaluate these actions from left to right, and ignore the results.

10. concatMap :: (MonoFoldable mono, Monoid m) => (Element mono -> m) -> mono -> m

    mono-traversable	Data.MonoTraversable.Unprefixed

    Synonym for oconcatMap

Page 487 of many | Previous | Next