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.

Exact lookup

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

   conduit	Data.Conduit.Combinators

   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 unknown or untrusted input, this function is unsafe, since it would allow an attacker to form lines of massive length and exhaust memory. Subject to fusion

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

   conduit	Data.Conduit.Combinators

   Same as linesUnbounded, but for ASCII/binary data. Subject to fusion

3. splitOnUnboundedE :: forall (m :: Type -> Type) seq . (Monad m, IsSequence seq) => (Element seq -> Bool) -> ConduitT seq seq m ()

   conduit	Data.Conduit.Combinators

   Split a stream of arbitrarily-chunked data, based on a predicate on elements. Elements that satisfy the predicate will cause chunks to be split, and aren't included in these output chunks. Note that, if you have unknown or untrusted input, this function is unsafe, since it would allow an attacker to form chunks of massive length and exhaust memory.

4. splitOnUnboundedES :: forall (m :: Type -> Type) seq . (Monad m, IsSequence seq) => (Element seq -> Bool) -> StreamConduit seq m seq

   conduit	Data.Conduit.Combinators.Stream

   No documentation available.

5. enumBounded :: (MonadGen m, Enum a, Bounded a) => m a

   hedgehog	Hedgehog.Gen

   Generates a random value from a bounded enumeration. This generator shrinks towards minBound. For example:

   enumBounded :: Gen Bool
   

   This is implemented in terms of the Enum class, and thus may be partial for integral types larger than Int, e.g. Word64.

6. enumBounded :: (MonadGen m, Enum a, Bounded a) => m a

   hedgehog	Hedgehog.Internal.Gen

   Generates a random value from a bounded enumeration. This generator shrinks towards minBound. For example:

   enumBounded :: Gen Bool
   

   This is implemented in terms of the Enum class, and thus may be partial for integral types larger than Int, e.g. Word64.

7. constantBounded :: (Bounded a, Num a) => Range a

   hedgehog	Hedgehog.Internal.Range

   Construct a range which is unaffected by the size parameter using the full range of a data type. A range from -128 to 127, with the origin at 0:

   >>> bounds x (constantBounded :: Range Int8)
   (-128,127)
   

   >>> origin (constantBounded :: Range Int8)
   0
   

8. exponentialBounded :: (Bounded a, Integral a) => Range a

   hedgehog	Hedgehog.Internal.Range

   Construct a range which is scaled exponentially relative to the size parameter and uses the full range of a data type.

   >>> bounds 0 (exponentialBounded :: Range Int8)
   (0,0)
   

   >>> bounds 50 (exponentialBounded :: Range Int8)
   (-11,11)
   

   >>> bounds 99 (exponentialBounded :: Range Int8)
   (-128,127)
   

9. linearBounded :: (Bounded a, Integral a) => Range a

   hedgehog	Hedgehog.Internal.Range

   Construct a range which is scaled relative to the size parameter and uses the full range of a data type.

   >>> bounds 0 (linearBounded :: Range Int8)
   (0,0)
   

   >>> bounds 50 (linearBounded :: Range Int8)
   (-64,64)
   

   >>> bounds 99 (linearBounded :: Range Int8)
   (-128,127)
   

10. constantBounded :: (Bounded a, Num a) => Range a

    hedgehog	Hedgehog.Range

    Construct a range which is unaffected by the size parameter using the full range of a data type. A range from -128 to 127, with the origin at 0:

    >>> bounds x (constantBounded :: Range Int8)
    (-128,127)
    

    >>> origin (constantBounded :: Range Int8)
    0
    

Page 20 of many | Previous | Next