Hoogle Search

Within LTS Haskell 24.10 (ghc-9.10.2)

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

Exact lookup

1. allNewBuffersStrategy :: Int -> BufferAllocStrategy

   conduit	Conduit

   The simplest buffer allocation strategy: whenever a buffer is requested, allocate a new one that is big enough for the next build step to execute. NOTE that this allocation strategy may spill quite some memory upon direct insertion of a bytestring by the builder. Thats no problem for garbage collection, but it may lead to unreasonably high memory consumption in special circumstances.

2. allocateAcquire :: MonadResource m => Acquire a -> m (ReleaseKey, a)

   conduit	Conduit

   Allocate a resource and register an action with the MonadResource to free the resource.

3. allE :: forall (m :: Type -> Type) mono o . (Monad m, MonoFoldable mono) => (Element mono -> Bool) -> ConduitT mono o m Bool

   conduit	Data.Conduit.Combinators

   Check that all elements in the chunked stream return True. Subject to shortcut logic: at the first False, consumption of the stream will stop. Subject to fusion

4. allNewBuffersStrategy :: Int -> BufferAllocStrategy

   conduit	Data.Conduit.Combinators

   The simplest buffer allocation strategy: whenever a buffer is requested, allocate a new one that is big enough for the next build step to execute. NOTE that this allocation strategy may spill quite some memory upon direct insertion of a bytestring by the builder. Thats no problem for garbage collection, but it may lead to unreasonably high memory consumption in special circumstances.

5. allS :: forall (m :: Type -> Type) a . Monad m => (a -> Bool) -> StreamConsumer a m Bool

   conduit	Data.Conduit.Combinators.Stream

   No documentation available.

6. allocate :: MonadResource m => IO a -> (a -> IO ()) -> m (ReleaseKey, a)

   resourcet	Control.Monad.Trans.Resource

   Perform some allocation, and automatically register a cleanup action. This is almost identical to calling the allocation and then registering the release action, but this properly handles masking of asynchronous exceptions. Since 0.3.0

7. allocate_ :: MonadResource m => IO a -> IO () -> m ReleaseKey

   resourcet	Control.Monad.Trans.Resource

   Perform some allocation where the return value is not required, and automatically register a cleanup action. allocate_ is to allocate as bracket_ is to bracket This is almost identical to calling the allocation and then registering the release action, but this properly handles masking of asynchronous exceptions.

8. allocateAcquire :: MonadResource m => Acquire a -> m (ReleaseKey, a)

   resourcet	Data.Acquire

   Allocate a resource and register an action with the MonadResource to free the resource.

9. allocate :: MonadResource m => IO a -> (a -> IO ()) -> m (ReleaseKey, a)

   resourcet	UnliftIO.Resource

   Perform some allocation, and automatically register a cleanup action. This is almost identical to calling the allocation and then registering the release action, but this properly handles masking of asynchronous exceptions. Since 0.3.0

10. allocateU :: (MonadUnliftIO m, MonadResource m) => m a -> (a -> m ()) -> m (ReleaseKey, a)

    resourcet	UnliftIO.Resource

    Unlifted allocate.

Page 76 of many | Previous | Next