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.
-
chan Control.Concurrent.Chan.Extra No documentation available.
-
chan Control.Concurrent.Chan.Extra No documentation available.
allC :: forall (m :: Type -> Type) a o . Monad m => (a -> Bool) -> ConduitT a o m Boolclassy-prelude-conduit ClassyPrelude.Conduit Check that all values in the stream return True. Subject to shortcut logic: at the first False, consumption of the stream will stop.
-
classy-prelude-conduit ClassyPrelude.Conduit Check that all elements in the chunked stream return True. Subject to shortcut logic: at the first False, consumption of the stream will stop.
allNewBuffersStrategy :: Int -> BufferAllocStrategyclassy-prelude-conduit ClassyPrelude.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.
allocateAcquire :: MonadResource m => Acquire a -> m (ReleaseKey, a)classy-prelude-conduit ClassyPrelude.Conduit Allocate a resource and register an action with the MonadResource to free the resource.
allPossibilities :: CardSet a -> [[a]]combinatorial Combinatorics.CardPairs No documentation available.
allPossibilitiesMedium :: [[Card]]combinatorial Combinatorics.CardPairs No documentation available.
allPossibilitiesSkat :: [[Card]]combinatorial Combinatorics.CardPairs No documentation available.
allPossibilitiesSmall :: [[Card]]combinatorial Combinatorics.CardPairs No documentation available.