bigIntDivmod
bigIntDivmod(
dividend,divisor):QuotientRemainder<bigint,bigint>
Defined in: big-int/divmod.ts:13
Euclidean division: the quotient and remainder satisfying dividend = quotient × divisor + remainder with 0 ≤ remainder < |divisor|.
The quotient is derived from the remainder rather than by flooring, because flooring and Euclidean division agree only when the divisor is positive.
Parameters
Section titled “Parameters”dividend
Section titled “dividend”bigint
divisor
Section titled “divisor”bigint
Returns
Section titled “Returns”QuotientRemainder<bigint, bigint>
Throws
Section titled “Throws”When divisor is zero.