mod - nodef/extra-bigint GitHub Wiki

Find the remainder of x/y with sign of y (floored division).

Similar: rem, mod, modp.

function mod(x, y)
// x: dividend
// y: divisor

const xbigint = require('extra-bigint');


xbigint.mod(1n, 10n);
// → 1n

xbigint.mod(-1n, 10n);
// → 9n

xbigint.mod(1n, -10n);
// → -9n

References

• Modulo operation: Wikipedia