Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. enumFrom# :: forall (n :: Nat) . KnownNat n => Unsigned n -> [Unsigned n]

   clash-prelude	Clash.Sized.Internal.Unsigned

   No documentation available.

2. enumFromThen# :: forall (n :: Nat) . KnownNat n => Unsigned n -> Unsigned n -> [Unsigned n]

   clash-prelude	Clash.Sized.Internal.Unsigned

   No documentation available.

3. enumFromThenTo# :: forall (n :: Nat) . KnownNat n => Unsigned n -> Unsigned n -> Unsigned n -> [Unsigned n]

   clash-prelude	Clash.Sized.Internal.Unsigned

   No documentation available.

4. enumFromTo# :: forall (n :: Nat) . KnownNat n => Unsigned n -> Unsigned n -> [Unsigned n]

   clash-prelude	Clash.Sized.Internal.Unsigned

   No documentation available.

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

   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.

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

7. enumLaws :: (Enum a, Eq a, Show a) => Gen a -> Laws

   hedgehog-classes	Hedgehog.Classes

   Tests the following Enum laws:

   • Succ-Pred Identity succ . pred ≡ id
   • Pred-Succ Identity pred . succ ≡ id

8. enum_to_word16 :: Enum e => e -> Word16

   hosc	Sound.Osc.Coding.Convert

   Type-specialised fromIntegral of fromEnum.

9. enum_to_word8 :: Enum e => e -> Word8

   hosc	Sound.Osc.Coding.Convert

   Type-specialised fromIntegral of fromEnum.

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

Page 68 of many | Previous | Next