Hoogle Search
Within LTS Haskell 24.67 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
binaryen Binaryen.Op No documentation available.
-
blank-canvas Graphics.Blank.Cursor Shorthand for AllScroll.
allEnums :: (Enum a, Bounded a) => [a]board-games Game.Labyrinth No documentation available.
allM :: (Monad m, Foldable f) => (a -> m Bool) -> f a -> m Boolbreakpoint Debug.Breakpoint.GhcFacade Monad version of all, aborts the computation at the first False value
allowDebianSelfBuildDeps :: Lens' DebInfo Boolcabal-debian Debian.Debianize.DebInfo No documentation available.
allTargetSelectors :: TargetsMap -> [TargetSelector]cabal-install Distribution.Client.ProjectOrchestration Get all target selectors.
allPackageSourceFiles :: Verbosity -> FilePath -> IO [FilePath]cabal-install Distribution.Client.SrcDist List all source files of a given add-source dependency. Exits with error if something is wrong (e.g. there is no .cabal file in the given directory). Used in sandbox and projectbuilding. TODO: when sandboxes are removed, move to ProjectBuilding.
-
call-alloy Language.Alloy.Call The currently used Alloy version.
>>> alloyVersion "6.2.0"
allowDepCycles :: forall (m :: Type -> Type) . MonadFix m => Fire mcauldron Cauldron Allow any kind of dependency cycles. Usually comes in handy for creating serializers / deserializers for mutually dependent types. Note that a MonadFix instance is required of the initialization monad. BEWARE: Pattern-matching too eagerly on argument beans during construction will cause infinite loops or, if you are lucky, throw FixIOExceptions.
>>> :{ data U = U data V = V loopyU :: V -> U loopyU _ = U loopyV :: U -> V loopyV _ = V :}>>> :{ mconcat [ recipe @U $ val $ wire loopyU, recipe @V $ val $ wire loopyV :: Cauldron IO ] & cook @U allowDepCycles & \case Left (DependencyCycleError _) -> "oops"; _ -> "cycles are ok" :} "cycles are ok"allowSelfDeps :: forall (m :: Type -> Type) . MonadFix m => Fire mcauldron Cauldron Allow direct self-dependencies. A bean constructor might depend on itself. This can be useful for having decorated self-invocations, because the version of the bean received as argument comes "from the future" and is already decorated. Note that a MonadFix instance is required of the initialization monad. BEWARE: Pattern-matching too eagerly on a "bean from the future" during construction will cause infinite loops or, if you are lucky, throw FixIOExceptions.
>>> :{ data A = A loopyA :: A -> A loopyA _ = A :}>>> :{ (recipe @A $ val $ wire loopyA :: Cauldron IO) & cook @A allowSelfDeps & \case Left (DependencyCycleError _) -> "oops"; _ -> "self dep is ok" :} "self dep is ok">>> :{ data U = U data V = V loopyU :: V -> U loopyU _ = U loopyV :: U -> V loopyV _ = V :}>>> :{ mconcat [ recipe @U $ val $ wire loopyU, recipe @V $ val $ wire loopyV :: Cauldron IO ] & cook @U allowSelfDeps & \case Left (DependencyCycleError _) -> "cycle between 2 deps"; _ -> "oops" :} "cycle between 2 deps"