Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

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

   ghc-lib-parser	GHC.Prelude.Basic

   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]

   ghc-lib-parser	GHC.Prelude.Basic

   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]

   ghc-lib-parser	GHC.Prelude.Basic

   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]

   ghc-lib-parser	GHC.Prelude.Basic

   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. enumeration :: Show a => String -> [a] -> TextParser a

   polyparse	Text.Parse

   Parse one of the given nullary constructors (an enumeration). The string argument is the name of the type, and the list argument should contain all of the possible enumeration values.

6. enumeration :: Show a => String -> [a] -> TextParser a

   polyparse	Text.Parse.ByteString

   Parse one of the given nullary constructors (an enumeration). The string argument is the name of the type, and the list argument should contain all of the possible enumeration values.

7. enumerate :: HasTrie a => (a :->: b) -> [(a, b)]

   MemoTrie	Data.MemoTrie

   List the trie elements. Order of keys (:: a) is always the same.

8. enumerateGeneric :: (Generic a, HasTrie (Reg a)) => ((a :->: b) -> Reg a :->: b) -> (a :->: b) -> [(a, b)]

   MemoTrie	Data.MemoTrie

   Generic-friendly default for enumerate

9. enumFromMutableN :: forall (arr :: Type -> Type) a m . (Contiguous arr, Element arr a, PrimMonad m, Enum a) => a -> Int -> m (Mutable arr (PrimState m) a)

   contiguous	Data.Primitive.Contiguous

   Yield a mutable array of the given length containing the values x, succ x, succ (succ x) etc.

10. enumFromN :: (Contiguous arr, Element arr a, Enum a) => a -> Int -> arr a

    contiguous	Data.Primitive.Contiguous

    Yield an array of the given length containing the values x, succ x, succ (succ x) etc.

Page 58 of many | Previous | Next