Hoogle Search
Within LTS Haskell 24.3 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
unlifted Data.Unlifted Unboxed variant of Maybe.
Maybe# :: forall (r :: RuntimeRep) (a :: TYPE r) . (# (# #) | a #) -> Maybe# aunlifted Data.Unlifted No documentation available.
MaybeType :: String -> ParsedTypeyeshql-core Database.YeshQL.Parser No documentation available.
type family
MaybeToList (a :: Maybe Type) :: [Type]Spock-api Web.Spock.Api No documentation available.
-
folds Data.Fold.Internal Strict Maybe
-
ghc-lib GHC.Iface.Recomp No documentation available.
-
ghc-lib GHC.Tc.Solver.Monad No documentation available.
Maybes :: [Either String (GroverOpt (Maybe Int))] -> Resultmultiarg Multiarg.Examples.Grover No documentation available.
-
A continuation-passing variant of Maybe for short-circuiting at failure. This is based largely on code from the Haskell Wiki (http://www.haskell.org/haskellwiki/Performance/Monads) which was released under a simple permissive license (http://www.haskell.org/haskellwiki/HaskellWiki:Copyrights). However, various changes and extensions have been made, which are subject to the BSD license of this package.
-
unification-fd Control.Monad.MaybeK A continuation-passing encoding of Maybe; also known as Codensity Maybe, if you're familiar with that terminology. N.B., this is not the 2-continuation implementation based on the Church encoding of Maybe. The latter tends to have worse performance than non-continuation based implementations. This is generally more efficient than using Maybe for two reasons. First is that it right associates all binds, ensuring that bad associativity doesn't artificially introduce midpoints in short-circuiting to the nearest handler. Second is that it removes the need for intermediate case expressions. N.B., the Alternative and MonadPlus instances are left-biased in a. Thus, they are not commutative.