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. enumFromStepN1 :: Num a => a -> a -> Int -> NonEmptyVector a

   nonempty-vector	Data.Vector.NonEmpty

   O(n) Yield a non-empty vector of length max n 1 containing the values x, x+y, x+y+y etc. This operations is usually more efficient than enumFromThenTo.

2. enumFromThenTo :: Enum a => a -> a -> a -> Maybe (NonEmptyVector a)

   nonempty-vector	Data.Vector.NonEmpty

   O(n) Enumerate values from x to y with a specific step z. If an enumeration does not use meaningful indices, Nothing is returned, otherwise, Just containing a non-empty vector. WARNING: This operation can be very inefficient. If at all possible, use enumFromStepN instead.

3. enumFromTo :: Enum a => a -> a -> Maybe (NonEmptyVector a)

   nonempty-vector	Data.Vector.NonEmpty

   O(n) Enumerate values from x to y. If an enumeration does not use meaningful indices, Nothing is returned, otherwise, Just containing a non-empty vector. WARNING: This operation can be very inefficient. If at all possible, use enumFromN instead.

4. enumUniform :: forall a (m :: Type -> Type) . Enum a => a -> a -> RVarT m a

   random-fu	Data.Random.Distribution.Uniform

   realFloatUniform a b computes a uniform random value in the range [a,b) for any Enum type

5. enumUniformCDF :: (Enum a, Ord a) => a -> a -> a -> Double

   random-fu	Data.Random.Distribution.Uniform

   No documentation available.

6. enumerate :: LaTeXC l => l -> l

   HaTeX	Text.LaTeX.Base.Commands

   Environment of ordered lists. Use item to start each list item.

7. enumFrom :: Enum a => a -> [a]

   LambdaHack	Game.LambdaHack.Core.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]

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

   LambdaHack	Game.LambdaHack.Core.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]

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

   LambdaHack	Game.LambdaHack.Core.Prelude

   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] = []

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

    LambdaHack	Game.LambdaHack.Core.Prelude

    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] = []

Page 65 of many | Previous | Next