Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. mapM_ :: Monad m => (input -> m ()) -> UnfoldlM m input -> m ()

   deferred-folds	DeferredFolds.UnfoldlM

   A more efficient implementation of mapM_

2. mapMap :: (a -> v) -> LabelMap a -> LabelMap v

   ghc-lib-parser	GHC.Cmm.Dataflow.Label

   No documentation available.

3. mapMapWithKey :: (Label -> a -> v) -> LabelMap a -> LabelMap v

   ghc-lib-parser	GHC.Cmm.Dataflow.Label

   No documentation available.

4. mapMember :: Label -> LabelMap a -> Bool

   ghc-lib-parser	GHC.Cmm.Dataflow.Label

   No documentation available.

5. mapMaybeDTyConEnv :: (a -> Maybe b) -> DTyConEnv a -> DTyConEnv b

   ghc-lib-parser	GHC.Core.TyCon.Env

   No documentation available.

6. mapMaybeBag :: (a -> Maybe b) -> Bag a -> Bag b

   ghc-lib-parser	GHC.Data.Bag

   No documentation available.

7. mapMaybeBagM :: Monad m => (a -> m (Maybe b)) -> Bag a -> m (Bag b)

   ghc-lib-parser	GHC.Data.Bag

   No documentation available.

8. mapMaybeFsEnv :: (elt1 -> Maybe elt2) -> FastStringEnv elt1 -> FastStringEnv elt2

   ghc-lib-parser	GHC.Data.FastString.Env

   No documentation available.

9. mapMaybe :: (a -> Maybe b) -> Word64Map a -> Word64Map b

   ghc-lib-parser	GHC.Data.Word64Map.Internal

   Map values and collect the Just results.

   let f x = if x == "a" then Just "new a" else Nothing
   mapMaybe f (fromList [(5,"a"), (3,"b")]) == singleton 5 "new a"
   

10. mapMaybeMissing :: forall (f :: Type -> Type) x y . Applicative f => (Key -> x -> Maybe y) -> WhenMissing f x y

    ghc-lib-parser	GHC.Data.Word64Map.Internal

    Map over the entries whose keys are missing from the other map, optionally removing some. This is the most powerful SimpleWhenMissing tactic, but others are usually more efficient.

    mapMaybeMissing :: (Key -> x -> Maybe y) -> SimpleWhenMissing x y
    

    mapMaybeMissing f = traverseMaybeMissing (\k x -> pure (f k x))
    

    but mapMaybeMissing uses fewer unnecessary Applicative operations.

Page 34 of many | Previous | Next