simple-squiggle/node_modules/mathjs/lib/esm/function/combinatorics/composition.js

48 lines
1.4 KiB
JavaScript

import { factory } from '../../utils/factory.js';
var name = 'composition';
var dependencies = ['typed', 'addScalar', 'combinations', 'isNegative', 'isPositive', 'isInteger', 'larger'];
export var createComposition = /* #__PURE__ */factory(name, dependencies, _ref => {
var {
typed,
addScalar,
combinations,
isPositive,
isNegative,
isInteger,
larger
} = _ref;
/**
* The composition counts of n into k parts.
*
* composition only takes integer arguments.
* The following condition must be enforced: k <= n.
*
* Syntax:
*
* math.composition(n, k)
*
* Examples:
*
* math.composition(5, 3) // returns 6
*
* See also:
*
* combinations
*
* @param {Number | BigNumber} n Total number of objects in the set
* @param {Number | BigNumber} k Number of objects in the subset
* @return {Number | BigNumber} Returns the composition counts of n into k parts.
*/
return typed(name, {
'number | BigNumber, number | BigNumber': function numberBigNumberNumberBigNumber(n, k) {
if (!isInteger(n) || !isPositive(n) || !isInteger(k) || !isPositive(k)) {
throw new TypeError('Positive integer value expected in function composition');
} else if (larger(k, n)) {
throw new TypeError('k must be less than or equal to n in function composition');
}
return combinations(addScalar(n, -1), addScalar(k, -1));
}
});
});