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. enumFromThenTo :: Enum a => a -> a -> a -> [a]

   mixed-types-num	Numeric.MixedTypes.PreludeHiding

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

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

   mixed-types-num	Numeric.MixedTypes.PreludeHiding

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

3. enumFromN :: Num a => a -> Int -> Maybe (NonEmptyVector a)

   nonempty-vector	Data.Vector.NonEmpty

   O(n) Yield a non-emptyvector of the given length containing the values x, x+1 etc. This operation is usually more efficient than enumFromTo. If an enumeration does not use meaningful indices, Nothing is returned, otherwise, Just containing a non-empty vector.

4. enumFromN1 :: Num a => a -> Int -> NonEmptyVector a

   nonempty-vector	Data.Vector.NonEmpty

   O(n) Yield a non-emptyvector of length max n 1 containing the values x, x+1 etc. This operation is usually more efficient than enumFromTo.

5. enumFromStepN :: Num a => a -> a -> Int -> Maybe (NonEmptyVector a)

   nonempty-vector	Data.Vector.NonEmpty

   O(n) Yield a non-empty vector of the given length containing the values x, x+y, x+y+y etc. This operations is usually more efficient than enumFromThenTo. If an enumeration does not use meaningful indices, Nothing is returned, otherwise, Just containing a non-empty vector.

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

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

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

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

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

    random-fu	Data.Random.Distribution.Uniform

    No documentation available.

Page 64 of many | Previous | Next