Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
math-functions Numeric.RootFinding Steps for Newton iterations
NewtonStep :: Double -> Double -> NewtonStepmath-functions Numeric.RootFinding Normal Newton-Raphson update. Parameters are: old guess, new guess
-
math-functions Numeric.RootFinding Single Ridders step. It's a bracket of root
RiddersStep :: Double -> Double -> RiddersStepmath-functions Numeric.RootFinding Ridders step. Parameters are bracket for the root
enumSequenceFromStep :: Num a => a -> a -> Sequence amath-functions Numeric.Series enumSequenceFromStep x d generate sequence: <math>
-
vector-sized Data.Vector.Generic.Sized O(n) Yield a vector of the given length containing the values x, x+y, x+2y, ... x + (n - 1)y. The length is inferred from the type.
-
vector-sized Data.Vector.Generic.Sized O(n) Yield a vector of the given length containing the values x, x+y, x+2y, ..., x + (n - 1)y. The length is given explicitly as a Proxy argument.
enumFromStepN :: forall (n :: Nat) a . (KnownNat n, Prim a, Num a) => a -> a -> Vector n avector-sized Data.Vector.Primitive.Sized O(n) Yield a vector of the given length containing the values x, x+y, x+2y, ..., x + (n - 1)y. The length is inferred from the type.
enumFromStepN' :: forall (n :: Nat) a p . (KnownNat n, Prim a, Num a) => a -> a -> p n -> Vector n avector-sized Data.Vector.Primitive.Sized O(n) Yield a vector of the given length containing the values x, x+y, x+2y, ..., x + (n - 1)y. The length is given explicitly as a Proxy argument.
enumFromStepN :: forall (n :: Nat) a . (KnownNat n, Num a) => a -> a -> Vector n avector-sized Data.Vector.Sized O(n) Yield a vector of the given length containing the values x, x+y, x+2y, ... , x + (n - 1)y. The length is inferred from the type.