Hoogle Search

Within LTS Haskell 24.5 (ghc-9.10.2)

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

Exact lookup

1. mapMissing :: forall (f :: Type -> Type) k x y . Applicative f => (k -> x -> y) -> WhenMissing f k x y

   containers	Data.Map.Strict.Internal

   Map over the entries whose keys are missing from the other map.

   mapMissing :: (k -> x -> y) -> SimpleWhenMissing k x y
   

   mapMissing f = mapMaybeMissing (\k x -> Just $ f k x)
   

   but mapMissing is somewhat faster.

2. mapMonotonic :: (a -> b) -> Set a -> Set b

   containers	Data.Set

   The mapMonotonic f s == map f s, but works only when f is strictly increasing. The precondition is not checked. Semi-formally, we have:

   and [x < y ==> f x < f y | x <- ls, y <- ls]
   ==> mapMonotonic f s == map f s
   where ls = toList s
   

3. mapMonotonic :: (a -> b) -> Set a -> Set b

   containers	Data.Set.Internal

   The mapMonotonic f s == map f s, but works only when f is strictly increasing. The precondition is not checked. Semi-formally, we have:

   and [x < y ==> f x < f y | x <- ls, y <- ls]
   ==> mapMonotonic f s == map f s
   where ls = toList s
   

4. mapMaybeT :: (m (Maybe a) -> n (Maybe b)) -> MaybeT m a -> MaybeT n b

   transformers	Control.Monad.Trans.Maybe

   Transform the computation inside a MaybeT.

   • runMaybeT (mapMaybeT f m) = f (runMaybeT
     m)

5. mapMaybe :: (a -> Maybe b) -> KeyMap a -> KeyMap b

   aeson	Data.Aeson.KeyMap

   Map values and collect the Just results.

6. mapMaybeWithKey :: (Key -> v -> Maybe u) -> KeyMap v -> KeyMap u

   aeson	Data.Aeson.KeyMap

   Map values and collect the Just results.

7. mapMaybe :: (v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2

   unordered-containers	Data.HashMap.Internal

   Transform this map by applying a function to every value and retaining only some of them.

8. mapMaybeWithKey :: (k -> v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2

   unordered-containers	Data.HashMap.Internal

   Transform this map by applying a function to every value and retaining only some of them.

9. mapMaybe :: (v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2

   unordered-containers	Data.HashMap.Internal.Strict

   Transform this map by applying a function to every value and retaining only some of them.

10. mapMaybeWithKey :: (k -> v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2

    unordered-containers	Data.HashMap.Internal.Strict

    Transform this map by applying a function to every value and retaining only some of them.

Page 15 of many | Previous | Next