EuclideanDomain
EuclideanDomain<
T> =Ring<T> &object
Defined in: evidence.ts:30
Euclidean domain evidence for T — a ring that additionally supports
division with remainder, which is what the Euclidean algorithm needs.
ℤ is a Euclidean domain but not a field, so gcd constrains on this rather
than on Field.
Type Declaration
Section titled “Type Declaration”degree()
Section titled “degree()”degree(
a):number
Parameters
Section titled “Parameters”T
Returns
Section titled “Returns”number
divmod()
Section titled “divmod()”divmod(
a,b):QuotientRemainder<T,T>
Parameters
Section titled “Parameters”T
T
Returns
Section titled “Returns”QuotientRemainder<T, T>
Type Parameters
Section titled “Type Parameters”T
The carrier set of the domain.