mod.js 2.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899
  1. import { factory } from '../../utils/factory.js';
  2. import { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';
  3. import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';
  4. import { createMatAlgo05xSfSf } from '../../type/matrix/utils/matAlgo05xSfSf.js';
  5. import { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';
  6. import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
  7. import { modNumber } from '../../plain/number/index.js';
  8. import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
  9. var name = 'mod';
  10. var dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];
  11. export var createMod = /* #__PURE__ */factory(name, dependencies, _ref => {
  12. var {
  13. typed,
  14. matrix,
  15. equalScalar,
  16. DenseMatrix
  17. } = _ref;
  18. var matAlgo02xDS0 = createMatAlgo02xDS0({
  19. typed,
  20. equalScalar
  21. });
  22. var matAlgo03xDSf = createMatAlgo03xDSf({
  23. typed
  24. });
  25. var matAlgo05xSfSf = createMatAlgo05xSfSf({
  26. typed,
  27. equalScalar
  28. });
  29. var matAlgo11xS0s = createMatAlgo11xS0s({
  30. typed,
  31. equalScalar
  32. });
  33. var matAlgo12xSfs = createMatAlgo12xSfs({
  34. typed,
  35. DenseMatrix
  36. });
  37. var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
  38. typed,
  39. matrix
  40. });
  41. /**
  42. * Calculates the modulus, the remainder of an integer division.
  43. *
  44. * For matrices, the function is evaluated element wise.
  45. *
  46. * The modulus is defined as:
  47. *
  48. * x - y * floor(x / y)
  49. *
  50. * See https://en.wikipedia.org/wiki/Modulo_operation.
  51. *
  52. * Syntax:
  53. *
  54. * math.mod(x, y)
  55. *
  56. * Examples:
  57. *
  58. * math.mod(8, 3) // returns 2
  59. * math.mod(11, 2) // returns 1
  60. *
  61. * function isOdd(x) {
  62. * return math.mod(x, 2) != 0
  63. * }
  64. *
  65. * isOdd(2) // returns false
  66. * isOdd(3) // returns true
  67. *
  68. * See also:
  69. *
  70. * divide
  71. *
  72. * @param {number | BigNumber | Fraction | Array | Matrix} x Dividend
  73. * @param {number | BigNumber | Fraction | Array | Matrix} y Divisor
  74. * @return {number | BigNumber | Fraction | Array | Matrix} Returns the remainder of `x` divided by `y`.
  75. */
  76. return typed(name, {
  77. 'number, number': modNumber,
  78. 'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
  79. if (y.isNeg()) {
  80. throw new Error('Cannot calculate mod for a negative divisor');
  81. }
  82. return y.isZero() ? x : x.mod(y);
  83. },
  84. 'Fraction, Fraction': function FractionFraction(x, y) {
  85. if (y.compare(0) < 0) {
  86. throw new Error('Cannot calculate mod for a negative divisor');
  87. }
  88. // Workaround suggested in Fraction.js library to calculate correct modulo for negative dividend
  89. return x.compare(0) >= 0 ? x.mod(y) : x.mod(y).add(y).mod(y);
  90. }
  91. }, matrixAlgorithmSuite({
  92. SS: matAlgo05xSfSf,
  93. DS: matAlgo03xDSf,
  94. SD: matAlgo02xDS0,
  95. Ss: matAlgo11xS0s,
  96. sS: matAlgo12xSfs
  97. }));
  98. });