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.

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

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

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

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

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

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

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

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

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

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

Page 36 of many | Previous | Next