id -package:brittany -package:base-prelude package:numeric-prelude -is:module

id :: a -> a
numeric-prelude NumericPrelude NumericPrelude.Base
Identity function. 
id x = x
identityLeft :: C u => Mul Scalar u -> u
numeric-prelude Algebra.DimensionTerm
identityRight :: C u => Mul u Scalar -> u
numeric-prelude Algebra.DimensionTerm
identity :: Eq a => (a -> a -> a) -> a -> a -> Bool
numeric-prelude Algebra.Laws
idt :: C a => a
numeric-prelude Algebra.Monoid
identical :: Eq a => T a -> T a -> Bool
numeric-prelude MathObj.LaurentPolynomial
identity :: Ix i => (i, i) -> T i
numeric-prelude MathObj.Permutation.Table
propIdentity :: (Eq a, C a) => a -> Bool
numeric-prelude Algebra.Additive
divides :: (C a, C a) => a -> a -> Bool
numeric-prelude Algebra.IntegralDomain
propSameResidueClass :: (Eq a, C a, C a) => a -> a -> a -> Property
numeric-prelude Algebra.IntegralDomain
sameResidueClass :: (C a, C a) => a -> a -> a -> Bool
numeric-prelude Algebra.IntegralDomain
leftIdentity :: Eq a => (b -> a -> a) -> b -> a -> Bool
numeric-prelude Algebra.Laws
rightIdentity :: Eq a => (a -> b -> a) -> b -> a -> Bool
numeric-prelude Algebra.Laws
euclid :: (C a, C a) => (a -> a -> a) -> a -> a -> a
numeric-prelude Algebra.PrincipalIdealDomain
extendedEuclid :: (C a, C a) => (a -> a -> (a, a)) -> a -> a -> (a, (a, a))
numeric-prelude Algebra.PrincipalIdealDomain
propGCDIdentity :: (Eq a, C a) => a -> Bool
numeric-prelude Algebra.PrincipalIdealDomain
propLeftIdentity :: (Eq a, C a) => a -> Bool
numeric-prelude Algebra.Ring
propRightIdentity :: (Eq a, C a) => a -> Bool
numeric-prelude Algebra.Ring
mulFracStupid :: C a => T a -> T a -> ((T a, T a), T a)
numeric-prelude MathObj.PartialFraction
Works always but simply puts the product into the last fraction.
divide :: C a => [a] -> [a] -> [a]
numeric-prelude MathObj.PowerSeries.Core
Divide two series where the absolute term of the divisor is non-zero. That is, power series with leading non-zero terms are the units in the ring of power series. Knuth: Seminumerical algorithms
divideStripZero :: (C a, C a) => [a] -> [a] -> [a]
numeric-prelude MathObj.PowerSeries.Core
Divide two series also if the divisor has leading zeros.
isValid :: [[a]] -> Bool
numeric-prelude MathObj.PowerSeries2
divide :: C a => T a -> T a -> T a
numeric-prelude MathObj.PowerSeries2.Core
divide :: Integer -> Integer -> Integer -> Integer
numeric-prelude Number.FixedPoint
divide :: Basis -> T -> T -> T
numeric-prelude Number.Positional
Undefined if the divisor is zero - of course. Because it is impossible to assert that a real is zero, the routine will not throw an error in general. ToDo: Rigorously derive the minimal required magnitude of the leading divisor digit.