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

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

  3. enumFrom :: Enum a => a -> [a]

    hedgehog Hedgehog.Internal.Prelude

    Used in Haskell's translation of [n..] with [n..] = enumFrom n, a possible implementation being enumFrom n = n : enumFrom (succ n).

    Examples

    • enumFrom 4 :: [Integer] = [4,5,6,7,...]
    • enumFrom 6 :: [Int] = [6,7,8,9,...,maxBound ::
Int]

  4. enumFromThen :: Enum a => a -> a -> [a]

    hedgehog Hedgehog.Internal.Prelude

    Used in Haskell's translation of [n,n'..] with [n,n'..] = enumFromThen n n', a possible implementation being enumFromThen n n' = n : n' : worker (f x) (f x n'), worker s v = v : worker s (s v), x = fromEnum n' - fromEnum n and 

    f n y
| n > 0 = f (n - 1) (succ y)
| n < 0 = f (n + 1) (pred y)
| otherwise = y

    Examples

    • enumFromThen 4 6 :: [Integer] = [4,6,8,10...]
    • enumFromThen 6 2 :: [Int] = [6,2,-2,-6,...,minBound ::
Int]

  5. enumFromThenTo :: Enum a => a -> a -> a -> [a]

    hedgehog Hedgehog.Internal.Prelude

    Used in Haskell's translation of [n,n'..m] with [n,n'..m] = enumFromThenTo n n' m, a possible implementation being enumFromThenTo n n' m = worker (f x) (c x) n m, x = fromEnum n' - fromEnum n, c x = bool (>=) ((x 0) 

    f n y
| n > 0 = f (n - 1) (succ y)
| n < 0 = f (n + 1) (pred y)
| otherwise = y
    and 
    worker s c v m
| c v m = v : worker s c (s v) m
| otherwise = []

    Examples

    • enumFromThenTo 4 2 -6 :: [Integer] =
[4,2,0,-2,-4,-6]
    • enumFromThenTo 6 8 2 :: [Int] = []

  6. enumFromTo :: Enum a => a -> a -> [a]

    hedgehog Hedgehog.Internal.Prelude

    Used in Haskell's translation of [n..m] with [n..m] = enumFromTo n m, a possible implementation being 

    enumFromTo n m
| n <= m = n : enumFromTo (succ n) m
| otherwise = []

    Examples

    • enumFromTo 6 10 :: [Int] = [6,7,8,9,10]
    • enumFromTo 42 1 :: [Integer] = []

  7. enumerate :: (Enum a, Bounded a) => [a]

    extra Data.List.Extra

    Enumerate all the values of an Enum, from minBound to maxBound. 

    enumerate == [False, True]

  8. enumerate :: (Enum a, Bounded a) => [a]

    extra Extra

    Enumerate all the values of an Enum, from minBound to maxBound. 

    enumerate == [False, True]

  9. enumClassKey :: Unique

    ghc GHC.Builtin.Names

    No documentation available.

  10. enumClassName :: Name

    ghc GHC.Builtin.Names

    No documentation available.

Page 37 of many | Previous | Next