Hoogle Search

Within LTS Haskell 24.10 (ghc-9.10.2)

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

Exact lookup

1. enumTypeFrom :: IsEnumType a => a -> NS (K () :: [Type] -> Type) (Code a)

   generics-sop	Generics.SOP

   Convert from an enum type to its sum representation.

2. enumTypeTo :: IsEnumType a => NS (K () :: [Type] -> Type) (Code a) -> a

   generics-sop	Generics.SOP

   Convert a sum representation to ihe original type.

3. enumTypeFrom :: IsEnumType a => a -> NS (K () :: [Type] -> Type) (Code a)

   generics-sop	Generics.SOP.Universe

   Convert from an enum type to its sum representation.

4. enumTypeTo :: IsEnumType a => NS (K () :: [Type] -> Type) (Code a) -> a

   generics-sop	Generics.SOP.Universe

   Convert a sum representation to ihe original type.

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

   relude	Relude.Enum

   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]

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

   relude	Relude.Enum

   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]

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

   relude	Relude.Enum

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

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

   relude	Relude.Enum

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

9. enumerate :: Enumerable t => [Some t]

   selective	Control.Selective.Multi

   No documentation available.

10. enumFrom :: forall (m :: Type -> Type) n r . (Monad m, Enum n) => n -> Stream (Of n) m r

    streaming	Streaming.Prelude

    An infinite stream of enumerable values, starting from a given value. It is the same as S.iterate succ. Because their return type is polymorphic, enumFrom, enumFromThen and iterate are useful with functions like zip and zipWith, which require the zipped streams to have the same return type. For example, with each [1..] the following bit of connect-and-resume would not compile:

    >>> rest <- S.print $ S.zip (S.enumFrom 1) $ S.splitAt 3 $ S.each ['a'..'z']
    (1,'a')
    (2,'b')
    (3,'c')
    
    >>> S.print $ S.take 3 rest
    'd'
    'e'
    'f'
    

Page 45 of many | Previous | Next