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.
writeBoundedChan :: MonadConc m => BoundedChan m a -> a -> m ()concurrency Control.Concurrent.Classy.BoundedChan Write an element to the channel. If the channel is full, this routine will block until it is able to write. Blockers wait in a fair FIFO queue.
writeList2BoundedChan :: MonadConc m => BoundedChan m a -> [a] -> m ()concurrency Control.Concurrent.Classy.BoundedChan Write a list of elements to the channel. If the channel becomes full, this routine will block until it can write. Competing writers may interleave with this one.
cBounded :: (PositionalSystem s, Ord α, Bounded α, Integral α, Monad μ, CharParsing μ) => s -> μ αdata-textual Data.Textual.Integral -
data-textual Data.Textual.Integral Parse a number written in the specified positional numeral system, failing on overflow. The supplied parser is used to determine the sign of the number. Leading zeroes are not allowed.
nnBounded :: (PositionalSystem s, Ord α, Bounded α, Integral α, Monad μ, CharParsing μ) => s -> μ αdata-textual Data.Textual.Integral Parse a non-negative number written in the specified positional numeral system, failing on overflow.
nncBounded :: (PositionalSystem s, Ord α, Bounded α, Integral α, Monad μ, CharParsing μ) => s -> μ αdata-textual Data.Textual.Integral Parse a non-negative number written in the specified positional numeral system, failing on overflow. Leading zeroes are not allowed.
npBounded :: (PositionalSystem s, Ord α, Bounded α, Integral α, Monad μ, CharParsing μ) => s -> μ αdata-textual Data.Textual.Integral Parse a non-positive number written in the specified positional numeral system, failing on overflow.
npcBounded :: (PositionalSystem s, Ord α, Bounded α, Integral α, Monad μ, CharParsing μ) => s -> μ αdata-textual Data.Textual.Integral Parse a non-positive number written in the specified positional numeral system, failing on overflow. Leading zeroes are not allowed.
fakeBoundedEnum :: forall a (m :: Type -> Type) . (Monad m, Enum a, Bounded a) => FakeT m afakedata Faker.Combinators A sumtype can just use this function directly. Defined as fakeBoundedEnum = fakeEnumFromTo minBound maxBound
primBounded :: BoundedPrim a -> a -> Builderfast-builder Data.ByteString.FastBuilder Turn a value of type a into a Builder, using the given BoundedPrim.