Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

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

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

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

    LambdaHack Game.LambdaHack.Common.Vector

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

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

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

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

    concurrency Control.Concurrent.Classy.BoundedChan

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

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

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

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

  10. trywriteBoundedChan :: MonadConc m => BoundedChan m a -> a -> m Bool

    concurrency Control.Concurrent.Classy.BoundedChan

    A variant of writeBoundedChan which, instead of blocking when the channel is full, simply aborts and does not write the element. Note that this routine can still block while waiting for write access to the channel.

Page 32 of many | Previous | Next