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.

Exact lookup

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

   base	GHC.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]

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

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

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

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

4. enumerate :: Location -> [Location]

   doctest	Test.DocTest.Internal.Location

   Create a list from a location, by repeatedly increasing the line number by one.

5. enumFromToC :: forall (m :: Type -> Type) a i . (Monad m, Enum a, Ord a) => a -> a -> ConduitT i a m ()

   conduit	Conduit

   Enumerate from a value to a final value, inclusive, via succ. This is generally more efficient than using Prelude's enumFromTo and combining with sourceList since this avoids any intermediate data structures.

6. enumFromTo :: forall (m :: Type -> Type) a i . (Monad m, Enum a, Ord a) => a -> a -> ConduitT i a m ()

   conduit	Data.Conduit.Combinators

   Enumerate from a value to a final value, inclusive, via succ. This is generally more efficient than using Prelude's enumFromTo and combining with sourceList since this avoids any intermediate data structures. Subject to fusion

7. enumFromTo :: forall o (m :: Type -> Type) l i u . (Enum o, Eq o, Monad m) => o -> o -> Pipe l i o u m ()

   conduit	Data.Conduit.Internal

   No documentation available.

8. enumFromToS :: forall a (m :: Type -> Type) . (Enum a, Ord a, Monad m) => a -> a -> StreamProducer m a

   conduit	Data.Conduit.Internal.List.Stream

   No documentation available.

9. enumFromToS_int :: forall a (m :: Type -> Type) . (Integral a, Monad m) => a -> a -> StreamProducer m a

   conduit	Data.Conduit.Internal.List.Stream

   No documentation available.

10. enumFromTo :: forall a (m :: Type -> Type) i . (Enum a, Ord a, Monad m) => a -> a -> ConduitT i a m ()

    conduit	Data.Conduit.List

    Enumerate from a value to a final value, inclusive, via succ. This is generally more efficient than using Prelude's enumFromTo and combining with sourceList since this avoids any intermediate data structures. Subject to fusion Since 0.4.2

Page 36 of many | Previous | Next