Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

Exact lookup

1. 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.

2. 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.

3. allocate_heap_zero :: 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. Clear the new stack words. (By writing NIL.) Also save the continuation pointer (CP) on the stack.

4. allocate_zero :: 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. Clear the new stack words. (By writing NIL.) Also save the continuation pointer (CP) on the stack.

5. allParticipants :: Ord p => EventFold o p e -> Set p

   crdt-event-fold	Data.CRDT.EventFold

   Get all known participants. This includes participants that are projected for removal.

6. allCSPSolutions :: CSPResult a1 => CSP (Result a1) a1 -> [Result a1]

   csp	Control.Monad.CSP

   Return all solutions to the CSP. solveCSP running with allValuesT

7. allocateDirReadCache :: IO DirReadCache

   directory-ospath-streaming	System.Directory.OsPath.Streaming.Internal.Raw

   No documentation available.

8. allM :: Monad m => (a -> m Bool) -> [a] -> m Bool

   distribution-opensuse	OpenSuse.Prelude

   A version of all lifted to a monad. Retains the short-circuiting behaviour.

   allM Just [True,False,undefined] == Just False
   allM Just [True,True ,undefined] == undefined
   \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
   

9. allReq :: PhantomFlag t1 -> PhantomFlag t2 -> Bool

   doldol	Data.Flag.Phantom

   No documentation available.

10. allReq :: Flag -> Flag -> Bool

    doldol	Data.Flag.Simple

    Check every positive bit of req matches corresponding bit of obj

Page 131 of many | Previous | Next