permutations.js 2.6 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283
  1. "use strict";
  2. Object.defineProperty(exports, "__esModule", {
  3. value: true
  4. });
  5. exports.createPermutations = void 0;
  6. var _number = require("../../utils/number.js");
  7. var _product = require("../../utils/product.js");
  8. var _factory = require("../../utils/factory.js");
  9. var name = 'permutations';
  10. var dependencies = ['typed', 'factorial'];
  11. var createPermutations = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
  12. var typed = _ref.typed,
  13. factorial = _ref.factorial;
  14. /**
  15. * Compute the number of ways of obtaining an ordered subset of `k` elements
  16. * from a set of `n` elements.
  17. *
  18. * Permutations only takes integer arguments.
  19. * The following condition must be enforced: k <= n.
  20. *
  21. * Syntax:
  22. *
  23. * math.permutations(n)
  24. * math.permutations(n, k)
  25. *
  26. * Examples:
  27. *
  28. * math.permutations(5) // 120
  29. * math.permutations(5, 3) // 60
  30. *
  31. * See also:
  32. *
  33. * combinations, combinationsWithRep, factorial
  34. *
  35. * @param {number | BigNumber} n The number of objects in total
  36. * @param {number | BigNumber} [k] The number of objects in the subset
  37. * @return {number | BigNumber} The number of permutations
  38. */
  39. return typed(name, {
  40. 'number | BigNumber': factorial,
  41. 'number, number': function numberNumber(n, k) {
  42. if (!(0, _number.isInteger)(n) || n < 0) {
  43. throw new TypeError('Positive integer value expected in function permutations');
  44. }
  45. if (!(0, _number.isInteger)(k) || k < 0) {
  46. throw new TypeError('Positive integer value expected in function permutations');
  47. }
  48. if (k > n) {
  49. throw new TypeError('second argument k must be less than or equal to first argument n');
  50. }
  51. // Permute n objects, k at a time
  52. return (0, _product.product)(n - k + 1, n);
  53. },
  54. 'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {
  55. var result, i;
  56. if (!isPositiveInteger(n) || !isPositiveInteger(k)) {
  57. throw new TypeError('Positive integer value expected in function permutations');
  58. }
  59. if (k.gt(n)) {
  60. throw new TypeError('second argument k must be less than or equal to first argument n');
  61. }
  62. var one = n.mul(0).add(1);
  63. result = one;
  64. for (i = n.minus(k).plus(1); i.lte(n); i = i.plus(1)) {
  65. result = result.times(i);
  66. }
  67. return result;
  68. }
  69. // TODO: implement support for collection in permutations
  70. });
  71. });
  72. /**
  73. * Test whether BigNumber n is a positive integer
  74. * @param {BigNumber} n
  75. * @returns {boolean} isPositiveInteger
  76. */
  77. exports.createPermutations = createPermutations;
  78. function isPositiveInteger(n) {
  79. return n.isInteger() && n.gte(0);
  80. }