Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

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

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

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

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

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

    LambdaHack Game.LambdaHack.Common.Vector

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

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

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

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

    concurrency Control.Concurrent.Classy.BoundedChan

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

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

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

  10. tryreadBoundedChan :: MonadConc m => BoundedChan m a -> m (Maybe a)

    concurrency Control.Concurrent.Classy.BoundedChan

    A variant of readBoundedChan which, instead of blocking when the channel is empty, immediately returns Nothing. Otherwise, tryreadBoundedChan returns Just a where a is the element read from the channel. Note that this routine can still block while waiting for read access to the channel.

Page 32 of many | Previous | Next