Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

Exact lookup

1. RewriteMaybeNonConfluent :: Term -> Term -> [Doc] -> Warning

   Agda	Agda.TypeChecking.Monad.Base

   Confluence checker got stuck on computing overlap between two rewrite rules

2. primMaybe :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

   Agda	Agda.TypeChecking.Monad.Builtin

   No documentation available.

3. tMaybe :: TCM Term -> TCM Term

   Agda	Agda.TypeChecking.Primitive.Base

   No documentation available.

4. blockedFromMaybe :: Maybe NotBlocked -> Blocked_

   Agda	Agda.TypeChecking.Serialise.Instances.Internal

   No documentation available.

5. blockedToMaybe :: Blocked_ -> Maybe NotBlocked

   Agda	Agda.TypeChecking.Serialise.Instances.Internal

   No documentation available.

6. initMaybe :: [a] -> Maybe [a]

   Agda	Agda.Utils.List

   init, safe. O(n).

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

   Agda	Agda.Utils.List

   Last element (safe). O(n).

8. mapMaybeAndRest :: (a -> Maybe b) -> [a] -> ([b], Suffix a)

   Agda	Agda.Utils.List

   Like mapMaybe, but additionally return the last partition of the list where the function always returns Nothing. O(n).

9. partitionMaybe :: (a -> Maybe b) -> [a] -> ([a], [b])

   Agda	Agda.Utils.List

   Partition a list into Nothings and Justs. O(n).

   partitionMaybe f = partitionEithers . map ( a -> maybe (Left a) Right (f a))
   

   Note: mapMaybe f = snd . partitionMaybe f.

10. tailMaybe :: [a] -> Maybe [a]

    Agda	Agda.Utils.List

    Tail function (safe). O(1).

Page 258 of many | Previous | Next