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.

Exact lookup

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

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

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

   hedgehog	Hedgehog.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)
   

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

   hedgehog	Hedgehog.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)
   

5. Unbounded :: PageWidth

   prettyprinter	Prettyprinter

   Layouters should not introduce line breaks on their own.

6. Unbounded :: PageWidth

   prettyprinter	Prettyprinter.Internal

   Layouters should not introduce line breaks on their own.

7. writePrimBounded :: BoundedPrim a -> a -> Write

   blaze-builder	Blaze.ByteString.Builder.Compat.Write

   No documentation available.

8. maximumBounded :: (Ord a, Bounded a) => [a] -> a

   safe	Safe

   The largest element of a list. The result is bounded by minBound.

9. minimumBounded :: (Ord a, Bounded a) => [a] -> a

   safe	Safe

   The largest element of a list. The result is bounded by maxBound.

10. maximumBounded :: (Foldable f, Ord a, Bounded a) => f a -> a

    safe	Safe.Foldable

    The largest element of a foldable structure. The result is bounded by minBound.

Page 21 of many | Previous | Next