Hoogle Search

Within LTS Haskell 24.39 (ghc-9.10.3)

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

Exact lookup

1. defaultBuildDoStmt :: Expr -> [LamClause] -> Parser DoStmt

   Agda	Agda.Syntax.Parser.Helpers

   Build a do-statement

2. stPostModuleCheckpoints :: PostScopeState -> !Map ModuleName CheckpointId

   Agda	Agda.TypeChecking.Monad.Base

   For each module remember the checkpoint corresponding to the orignal context of the module parameters.

3. stPostMutualBlocks :: PostScopeState -> !MutualBlocks

   Agda	Agda.TypeChecking.Monad.Base

   No documentation available.

4. caseListM :: Monad m => m [a] -> m b -> (a -> [a] -> m b) -> m b

   Agda	Agda.Utils.List

   Case distinction for lists, with list first. O(1). Cf. ifNull.

5. lastMaybe :: [a] -> Maybe a

   Agda	Agda.Utils.List

   Last element (safe). O(n).

6. fromListMaybe :: [a] -> Maybe (List2 a)

   Agda	Agda.Utils.List2

   Safe. O(1).

7. adjustM :: (Functor f, Ord k) => (v -> f v) -> k -> Map k v -> f (Map k v)

   Agda	Agda.Utils.Map

   Update monadically the value at one position (must exist!).

8. adjustM' :: (Functor f, Ord k) => (v -> f (a, v)) -> k -> Map k v -> f (a, Map k v)

   Agda	Agda.Utils.Map

   Wrapper for adjustM for convenience.

9. allJustM :: Monad m => [m (Maybe a)] -> m (Maybe [a])

   Agda	Agda.Utils.Maybe

   Lazy version of allJust . sequence. (allJust = mapM for the Maybe monad.) Only executes monadic effect while isJust.

10. ifJustM :: Monad m => m (Maybe a) -> (a -> m b) -> m b -> m b

    Agda	Agda.Utils.Maybe

    caseMaybeM with flipped branches.

Page 164 of many | Previous | Next