Hoogle Search
Within LTS Haskell 24.58 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
foldFixM :: (Monad m, Traversable t) => (t a -> m a) -> Fix t -> m adata-fix Data.Fix Monadic foldFix.
hoistFix :: Functor f => (forall a . () => f a -> g a) -> Fix f -> Fix gdata-fix Data.Fix Change base functor in Fix.
hoistFix' :: Functor g => (forall a . () => f a -> g a) -> Fix f -> Fix gdata-fix Data.Fix unFix :: Fix (f :: Type -> Type) -> f (Fix f)data-fix Data.Fix No documentation available.
unfoldFix :: Functor f => (a -> f a) -> a -> Fix fdata-fix Data.Fix Unfold Fix.
>>> unfoldFix (\i -> if i < 4 then Cons i (i + 1) else Nil) (0 :: Int) Fix (Cons 0 (Fix (Cons 1 (Fix (Cons 2 (Fix (Cons 3 (Fix Nil))))))))
unfoldFixM :: (Monad m, Traversable t) => (a -> m (t a)) -> a -> m (Fix t)data-fix Data.Fix Monadic anamorphism.
unwrapFix :: Fix f -> f (Fix f)data-fix Data.Fix Unwrap Fix.
>>> let x = unfoldFix (\i -> if i < 3 then Cons i (i + 1) else Nil) (0 :: Int) >>> unwrapFix x Cons 0 (Fix (Cons 1 (Fix (Cons 2 (Fix Nil)))))
-
data-fix Data.Fix Wrap Fix.
>>> let x = unfoldFix (\i -> if i < 3 then Cons i (i + 1) else Nil) (0 :: Int) >>> wrapFix (Cons 10 x) Fix (Cons 10 (Fix (Cons 0 (Fix (Cons 1 (Fix (Cons 2 (Fix Nil))))))))
-
ghc-internal GHC.Internal.Base Given the pointer to the first block of a CNF and the address of the root object in the old address space, fix up the internal pointers inside the CNF to account for a different position in memory than when it was serialized. This method must be called exactly once after importing a serialized CNF. It returns the new CNF and the new adjusted root address.
-
ghc-internal GHC.Internal.Control.Exception.Base The exception thrown when an infinite cycle is detected in fixIO.