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.
enumFromN :: (Storable a, Num a) => a -> Int -> Vector arebase Rebase.Data.Vector.Storable No documentation available.
enumFromStepN :: (Storable a, Num a) => a -> a -> Int -> Vector arebase Rebase.Data.Vector.Storable No documentation available.
enumFromThenTo :: (Storable a, Enum a) => a -> a -> a -> Vector arebase Rebase.Data.Vector.Storable No documentation available.
enumFromTo :: (Storable a, Enum a) => a -> a -> Vector arebase Rebase.Data.Vector.Storable No documentation available.
enumFromN :: (Unbox a, Num a) => a -> Int -> Vector arebase Rebase.Data.Vector.Unboxed No documentation available.
enumFromStepN :: (Unbox a, Num a) => a -> a -> Int -> Vector arebase Rebase.Data.Vector.Unboxed No documentation available.
enumFromThenTo :: (Unbox a, Enum a) => a -> a -> a -> Vector arebase Rebase.Data.Vector.Unboxed No documentation available.
enumFromTo :: (Unbox a, Enum a) => a -> a -> Vector arebase Rebase.Data.Vector.Unboxed No documentation available.
enumFrom :: Enum a => a -> [a]rebase Rebase.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]rebase Rebase.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]