Modulenumeric-prelude-0.4.4Haskell98

Number.Root

datadata T a

The root degree must be positive. This way we can implement multiplication using only multiplication from type a.

Instances4Functor, Eq, Ord, Show

Functor TDefined in numeric-prelude-0.4.4 · Number.Root
When you use fmap you must assert that forall n. fmap f (Cons d x) == fmap f (Cons (n*d) (x^n))
(Eq a, C a) => Eq (T a)Defined in numeric-prelude-0.4.4 · Number.Root
(Ord a, C a) => Ord (T a)Defined in numeric-prelude-0.4.4 · Number.Root
Show a => Show (T a)Defined in numeric-prelude-0.4.4 · Number.Root

valuefromNumber :: a -> T a

valuetoNumber :: C a => T a -> a

valuetoRootSet :: C a => T a -> T a

valuecommonDegree :: C a => T a -> T a -> T (a, a)

valuemul :: C a => T a -> T a -> T a

valuediv :: C a => T a -> T a -> T a

valuerecip :: C a => T a -> T a

valuecardinalPower :: C a => Integer -> T a -> T a

exponent must be non-negative

valueintegerPower :: C a => Integer -> T a -> T a

exponent can be negative

valuerationalPower :: C a => Rational -> T a -> T a

valueroot :: C a => Integer -> T a -> T a

exponent must be positive

valuesqrt :: C a => T a -> T a