Hoogle Search
Within LTS Haskell 24.32 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
code-conjure Conjure.Expr > enumFrom' zero enumFrom 0 :: [Int]
Works for Ints, Bools and Chars. enumFromThen' :: Expr -> Expr -> Exprcode-conjure Conjure.Expr enumFromThen lifted over Exprs
> enumFromThen' zero ten enumFromThen 0 10 :: [Int]
enumFromThenTo' :: Expr -> Expr -> Expr -> Exprcode-conjure Conjure.Expr enumFromThenTo lifted over Exprs.
> enumFromThenTo' zero two ten enumFromThenTo 0 2 10 :: [Int]
enumFromTo' :: Expr -> Expr -> Exprcode-conjure Conjure.Expr enumFromTo lifted over Exprs
> enumFromTo' zero four enumFromTo 0 4 :: [Int]
enumerateAppsFor :: Expr -> (Expr -> Bool) -> [Expr] -> [[Expr]]code-conjure Conjure.Expr Enumerate applications between values of the given list of atomic expressions and of the given resulting expressions's type. Arguments:
Result: a potentially infinite list of list of enumerated expressions The enumeration here is type-directed for performance reasons.enumerateFillings :: Expr -> [[Expr]] -> [[Expr]]code-conjure Conjure.Expr Given an expression whose holes are all of the same type and an enumeration of Exprs of this same type, enumerate all possible fillings of the original expression with the Exprs in the enumeration.
enumerateC :: forall (m :: Type -> Type) a . Monad m => ConduitT a (Int, a) m ()conduit-algorithms Data.Conduit.Algorithms.Utils Conduit analogue to Python's enumerate function
enumToGauge :: Enum a => a -> Metricdata-prometheus Data.Prometheus.Monad Convert Enum to Gauge, 0 (typically) meaning Ok status
enumFrom :: Enum a => a -> [a]dimensional Numeric.Units.Dimensional.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]
enumFromThen :: Enum a => a -> a -> [a]dimensional Numeric.Units.Dimensional.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]