Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

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

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

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

  3. 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] = []

  4. 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] = []

  5. fromEnum :: Enum a => a -> Int

    hedgehog Hedgehog.Internal.Prelude

    Convert to an Int. It is implementation-dependent what fromEnum returns when applied to a value that is too large to fit in an Int.

  6. signum :: Num a => a -> a

    hedgehog Hedgehog.Internal.Prelude

    Sign of a number. The functions abs and signum should satisfy the law: 

    abs x * signum x == x
    For real numbers, the signum is either -1 (negative), 0 (zero) or 1 (positive).

  7. toEnum :: Enum a => Int -> a

    hedgehog Hedgehog.Internal.Prelude

    Convert from an Int.

  8. updateNumCapabilities :: WorkerCount -> IO ()

    hedgehog Hedgehog.Internal.Queue

    Update the number of capabilities but never set it lower than it already is.

  9. alphaNumChar :: (MonadParsec e s m, Token s ~ Word8) => m (Token s)

    megaparsec Text.Megaparsec.Byte

    Parse an alphabetic or digit characters.

  10. alphaNumChar :: (MonadParsec e s m, Token s ~ Char) => m (Token s)

    megaparsec Text.Megaparsec.Char

    Parse an alphabetic or numeric digit Unicode characters. Note that the numeric digits outside the ASCII range are parsed by this parser but not by digitChar. Such digits may be part of identifiers but are not used by the printer and reader to represent numbers.

Page 154 of many | Previous | Next