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.

Exact lookup

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

2. enumeratePrinters :: (HasCallStack, MonadIO m) => PrinterFunc -> Bool -> m ()

   gi-gtk4	GI.Gtk.Functions

   Calls a function for all GtkPrinters. If func returns True, the enumeration is stopped.

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

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

   hosc	Sound.Osc.Coding.Convert

   Type-specialised fromIntegral of fromEnum.

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

   hosc	Sound.Osc.Coding.Convert

   Type-specialised fromIntegral of fromEnum.

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

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

8. enumFromThenTo :: Enum a => a -> a -> a -> [a]

   incipit-base	Incipit.Base

   Used in Haskell's translation of [n,n'..m] with [n,n'..m] = enumFromThenTo n n' m, a possible implementation being enumFromThenTo n n' m = worker (f x) (c x) n m, x = fromEnum n' - fromEnum n, c x = bool (>=) ((x 0)

   f n y
   | n > 0 = f (n - 1) (succ y)
   | n < 0 = f (n + 1) (pred y)
   | otherwise = y
   
   

   and

   worker s c v m
   | c v m = v : worker s c (s v) m
   | otherwise = []
   
   

   Examples

   • enumFromThenTo 4 2 -6 :: [Integer] =
     [4,2,0,-2,-4,-6]

   • enumFromThenTo 6 8 2 :: [Int] = []

9. enumFromTo :: Enum a => a -> a -> [a]

   incipit-base	Incipit.Base

   Used in Haskell's translation of [n..m] with [n..m] = enumFromTo n m, a possible implementation being

   enumFromTo n m
   | n <= m = n : enumFromTo (succ n) m
   | otherwise = []
   
   

   Examples

   • enumFromTo 6 10 :: [Int] = [6,7,8,9,10]

   • enumFromTo 42 1 :: [Integer] = []

10. enumerate :: forall (m :: Type -> Type) a . (Monad m, Bounded a, Enumerable a) => Stream m a

    streamly-core	Streamly.Data.Stream

    enumerate = enumerateFrom minBound
    

    Enumerate a Bounded type from its minBound to maxBound

Page 69 of many | Previous | Next