Hoogle Search

Within LTS Haskell 24.31 (ghc-9.10.3)

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

  1. class UnboundedStream (i :: Type -> Type) (o :: Type -> Type) | i -> o

    stm-conduit Data.Conduit.Utils

    Class for structures that can handle unbounded stream of values. Such streams break conduit assumptions that constant memory will be used, because if receiver is slower then sender than values will be accumulated.

  2. pairBounded :: forall m (o :: Type -> Type) i a . (MonadIO m, IsConduit m o, BoundedStream i o) => i a -> Int -> m (ConduitT () a m (), ConduitT a Void m ())

    stm-conduit Data.Conduit.Utils

    Create bounded conduit pair, see BoundedStream class description.

  3. shiftBounded :: X -> Y -> Point -> Vector -> Point

    LambdaHack Game.LambdaHack.Common.Vector

    Translate a point by a vector, but only if the result fits in an area.

  4. trajectoryToPathBounded :: X -> Y -> Point -> [Vector] -> [Point]

    LambdaHack Game.LambdaHack.Common.Vector

    A list of points that a list of vectors leads to, bounded by level size.

  5. vicinityBounded :: X -> Y -> Point -> [Point]

    LambdaHack Game.LambdaHack.Common.Vector

    All (8 at most) closest neighbours of a point within an area.

  6. linesUnboundedAsciiC :: forall (m :: Type -> Type) seq . (Monad m, IsSequence seq, Element seq ~ Word8) => ConduitT seq seq m ()

    classy-prelude-conduit ClassyPrelude.Conduit

    Same as linesUnbounded, but for ASCII/binary data.

  7. linesUnboundedC :: forall (m :: Type -> Type) seq . (Monad m, IsSequence seq, Element seq ~ Char) => ConduitT seq seq m ()

    classy-prelude-conduit ClassyPrelude.Conduit

    Convert a stream of arbitrarily-chunked textual data into a stream of data where each chunk represents a single line. Note that, if you have unknownuntrusted input, this function is unsafe/, since it would allow an attacker to form lines of massive length and exhaust memory.

  8. isEmptyBoundedChan :: MonadConc m => BoundedChan m a -> m Bool

    concurrency Control.Concurrent.Classy.BoundedChan

    Deprecated: This isEmptyBoundedChan can block, no non-blocking substitute yet

  9. newBoundedChan :: MonadConc m => Int -> m (BoundedChan m a)

    concurrency Control.Concurrent.Classy.BoundedChan

    newBoundedChan n returns a channel than can contain no more than n elements.

  10. readBoundedChan :: MonadConc m => BoundedChan m a -> m a

    concurrency Control.Concurrent.Classy.BoundedChan

    Read an element from the channel. If the channel is empty, this routine will block until it is able to read. Blockers wait in a fair FIFO queue.

Page 32 of many | Previous | Next