Hoogle Search
Within LTS Haskell 24.31 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
enumFromThen# :: forall (n :: Nat) . KnownNat n => Unsigned n -> Unsigned n -> [Unsigned n]clash-prelude Clash.Sized.Internal.Unsigned No documentation available.
-
clash-prelude Clash.Sized.Internal.Unsigned No documentation available.
enumFromTo# :: forall (n :: Nat) . KnownNat n => Unsigned n -> Unsigned n -> [Unsigned n]clash-prelude Clash.Sized.Internal.Unsigned No documentation available.
-
classy-prelude-conduit ClassyPrelude.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.
enumerate :: Eq a => Int -> [a] -> [[a]]combinatorial Combinatorics.Permutation.WithoutSomeFixpoints enumerate n xs list all permutations of xs where the first n elements do not keep their position (i.e. are no fixpoints). This is a generalization of derangement. Naive but comprehensible implementation.
enumLaws :: (Enum a, Eq a, Show a) => Gen a -> Lawshedgehog-classes Hedgehog.Classes Tests the following Enum laws:
enum_to_word16 :: Enum e => e -> Word16hosc Sound.Osc.Coding.Convert Type-specialised fromIntegral of fromEnum.
enum_to_word8 :: Enum e => e -> Word8hosc Sound.Osc.Coding.Convert Type-specialised fromIntegral of fromEnum.
enumFrom :: Enum a => a -> [a]incipit-base Incipit.Base 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]incipit-base Incipit.Base 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]