Hoogle Search

Within LTS Haskell 24.42 (ghc-9.10.3)

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

Exact lookup

1. alloyVersion :: String

   call-alloy	Language.Alloy.Call

   The currently used Alloy version.

   >>> alloyVersion
   "6.2.0"
   

2. allowDepCycles :: forall (m :: Type -> Type) . MonadFix m => Fire m

   cauldron	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"
   

3. allowSelfDeps :: forall (m :: Type -> Type) . MonadFix m => Fire m

   cauldron	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"
   

4. allocate :: [LetBinding] -> Term -> Machine -> Machine

   clash-ghc	Clash.GHC.Evaluator

   Allocate let-bindings on the heap

5. allR :: Monad m => Transform m -> Transform m

   clash-lib	Clash.Rewrite.Combinators

   Apply a transformation on the subtrees of an term

6. allEqual :: Eq a => [a] -> Bool

   code-conjure	Conjure.Utils

   Checks if all elements of a list are equal.

7. allEqual2 :: Eq a => [a] -> Bool

   code-conjure	Conjure.Utils

   Checks if all elements of a list are equal. Exceptionally this function returns false for an empty or unit list. This returns true when all elements are equal and the list has a length greater than or equal to two.

8. allEqualOn :: Eq b => (a -> b) -> [a] -> Bool

   code-conjure	Conjure.Utils

   No documentation available.

9. allocate :: Int -> Int -> Op

   codec-beam	Codec.Beam.Instructions

   Allocate space for some words on the stack. If a GC is needed during allocation there are a number of live X registers. Also save the continuation pointer (CP) on the stack.

10. allocate_heap :: Int -> Int -> Int -> Op

    codec-beam	Codec.Beam.Instructions

    Allocate space for some words on the stack and ensure there is space for words on the heap. If a GC is needed save Live number of X registers. Also save the continuation pointer (CP) on the stack.

Page 130 of many | Previous | Next