mirror of
https://github.com/josdejong/mathjs.git
synced 2026-01-18 14:59:29 +00:00
* Add `.js` extension to source file imports * Specify package `exports` in `package.json` Specify package type as `commonjs` (It's good to be specific) * Move all compiled scripts into `lib` directory Remove ./number.js (You can use the compiled ones in `./lib/*`) Tell node that the `esm` directory is type `module` and enable tree shaking. Remove unused files from packages `files` property * Allow importing of package.json * Make library ESM first * - Fix merge conflicts - Refactor `bundleAny` into `defaultInstance.js` and `browserBundle.cjs` - Refactor unit tests to be able to run with plain nodejs (no transpiling) - Fix browser examples * Fix browser and browserstack tests * Fix running unit tests on Node 10 (which has no support for modules) * Fix node.js examples (those are still commonjs) * Remove the need for `browserBundle.cjs` * Generate minified bundle only * [Security] Bump node-fetch from 2.6.0 to 2.6.1 (#1963) Bumps [node-fetch](https://github.com/bitinn/node-fetch) from 2.6.0 to 2.6.1. **This update includes a security fix.** - [Release notes](https://github.com/bitinn/node-fetch/releases) - [Changelog](https://github.com/node-fetch/node-fetch/blob/master/docs/CHANGELOG.md) - [Commits](https://github.com/bitinn/node-fetch/compare/v2.6.0...v2.6.1) Signed-off-by: dependabot-preview[bot] <support@dependabot.com> Co-authored-by: dependabot-preview[bot] <27856297+dependabot-preview[bot]@users.noreply.github.com> * Cleanup console.log * Add integration tests to test the entry points (commonjs/esm, full/number only) * Create backward compatibility error messages in the files moved/removed since v8 * Describe breaking changes in HISTORY.md * Bump karma from 5.2.1 to 5.2.2 (#1965) Bumps [karma](https://github.com/karma-runner/karma) from 5.2.1 to 5.2.2. - [Release notes](https://github.com/karma-runner/karma/releases) - [Changelog](https://github.com/karma-runner/karma/blob/master/CHANGELOG.md) - [Commits](https://github.com/karma-runner/karma/compare/v5.2.1...v5.2.2) Signed-off-by: dependabot-preview[bot] <support@dependabot.com> Co-authored-by: dependabot-preview[bot] <27856297+dependabot-preview[bot]@users.noreply.github.com> Co-authored-by: Lee Langley-Rees <lee@greenimp.co.uk> Co-authored-by: dependabot-preview[bot] <27856297+dependabot-preview[bot]@users.noreply.github.com>
191 lines
5.3 KiB
JavaScript
191 lines
5.3 KiB
JavaScript
import { factory } from '../../utils/factory.js'
|
|
import { isInteger } from '../../utils/number.js'
|
|
import { arraySize as size } from '../../utils/array.js'
|
|
import { powNumber } from '../../plain/number/index.js'
|
|
|
|
const name = 'pow'
|
|
const dependencies = [
|
|
'typed',
|
|
'config',
|
|
'identity',
|
|
'multiply',
|
|
'matrix',
|
|
'fraction',
|
|
'number',
|
|
'Complex'
|
|
]
|
|
|
|
export const createPow = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, identity, multiply, matrix, number, fraction, Complex }) => {
|
|
/**
|
|
* Calculates the power of x to y, `x ^ y`.
|
|
* Matrix exponentiation is supported for square matrices `x`, and positive
|
|
* integer exponents `y`.
|
|
*
|
|
* For cubic roots of negative numbers, the function returns the principal
|
|
* root by default. In order to let the function return the real root,
|
|
* math.js can be configured with `math.config({predictable: true})`.
|
|
* To retrieve all cubic roots of a value, use `math.cbrt(x, true)`.
|
|
*
|
|
* Syntax:
|
|
*
|
|
* math.pow(x, y)
|
|
*
|
|
* Examples:
|
|
*
|
|
* math.pow(2, 3) // returns number 8
|
|
*
|
|
* const a = math.complex(2, 3)
|
|
* math.pow(a, 2) // returns Complex -5 + 12i
|
|
*
|
|
* const b = [[1, 2], [4, 3]]
|
|
* math.pow(b, 2) // returns Array [[9, 8], [16, 17]]
|
|
*
|
|
* See also:
|
|
*
|
|
* multiply, sqrt, cbrt, nthRoot
|
|
*
|
|
* @param {number | BigNumber | Complex | Unit | Array | Matrix} x The base
|
|
* @param {number | BigNumber | Complex} y The exponent
|
|
* @return {number | BigNumber | Complex | Array | Matrix} The value of `x` to the power `y`
|
|
*/
|
|
return typed(name, {
|
|
'number, number': _pow,
|
|
|
|
'Complex, Complex': function (x, y) {
|
|
return x.pow(y)
|
|
},
|
|
|
|
'BigNumber, BigNumber': function (x, y) {
|
|
if (y.isInteger() || x >= 0 || config.predictable) {
|
|
return x.pow(y)
|
|
} else {
|
|
return new Complex(x.toNumber(), 0).pow(y.toNumber(), 0)
|
|
}
|
|
},
|
|
|
|
'Fraction, Fraction': function (x, y) {
|
|
if (y.d !== 1) {
|
|
if (config.predictable) {
|
|
throw new Error('Function pow does not support non-integer exponents for fractions.')
|
|
} else {
|
|
return _pow(x.valueOf(), y.valueOf())
|
|
}
|
|
} else {
|
|
return x.pow(y)
|
|
}
|
|
},
|
|
|
|
'Array, number': _powArray,
|
|
|
|
'Array, BigNumber': function (x, y) {
|
|
return _powArray(x, y.toNumber())
|
|
},
|
|
|
|
'Matrix, number': _powMatrix,
|
|
|
|
'Matrix, BigNumber': function (x, y) {
|
|
return _powMatrix(x, y.toNumber())
|
|
},
|
|
|
|
'Unit, number | BigNumber': function (x, y) {
|
|
return x.pow(y)
|
|
}
|
|
|
|
})
|
|
|
|
/**
|
|
* Calculates the power of x to y, x^y, for two numbers.
|
|
* @param {number} x
|
|
* @param {number} y
|
|
* @return {number | Complex} res
|
|
* @private
|
|
*/
|
|
function _pow (x, y) {
|
|
// Alternatively could define a 'realmode' config option or something, but
|
|
// 'predictable' will work for now
|
|
if (config.predictable && !isInteger(y) && x < 0) {
|
|
// Check to see if y can be represented as a fraction
|
|
try {
|
|
const yFrac = fraction(y)
|
|
const yNum = number(yFrac)
|
|
if (y === yNum || Math.abs((y - yNum) / y) < 1e-14) {
|
|
if (yFrac.d % 2 === 1) {
|
|
return (yFrac.n % 2 === 0 ? 1 : -1) * Math.pow(-x, y)
|
|
}
|
|
}
|
|
} catch (ex) {
|
|
// fraction() throws an error if y is Infinity, etc.
|
|
}
|
|
|
|
// Unable to express y as a fraction, so continue on
|
|
}
|
|
|
|
// **for predictable mode** x^Infinity === NaN if x < -1
|
|
// N.B. this behavour is different from `Math.pow` which gives
|
|
// (-2)^Infinity === Infinity
|
|
if (config.predictable &&
|
|
((x < -1 && y === Infinity) ||
|
|
(x > -1 && x < 0 && y === -Infinity))) {
|
|
return NaN
|
|
}
|
|
|
|
if (isInteger(y) || x >= 0 || config.predictable) {
|
|
return powNumber(x, y)
|
|
} else {
|
|
// TODO: the following infinity checks are duplicated from powNumber. Deduplicate this somehow
|
|
|
|
// x^Infinity === 0 if -1 < x < 1
|
|
// A real number 0 is returned instead of complex(0)
|
|
if ((x * x < 1 && y === Infinity) ||
|
|
(x * x > 1 && y === -Infinity)) {
|
|
return 0
|
|
}
|
|
|
|
return new Complex(x, 0).pow(y, 0)
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Calculate the power of a 2d array
|
|
* @param {Array} x must be a 2 dimensional, square matrix
|
|
* @param {number} y a positive, integer value
|
|
* @returns {Array}
|
|
* @private
|
|
*/
|
|
function _powArray (x, y) {
|
|
if (!isInteger(y) || y < 0) {
|
|
throw new TypeError('For A^b, b must be a positive integer (value is ' + y + ')')
|
|
}
|
|
// verify that A is a 2 dimensional square matrix
|
|
const s = size(x)
|
|
if (s.length !== 2) {
|
|
throw new Error('For A^b, A must be 2 dimensional (A has ' + s.length + ' dimensions)')
|
|
}
|
|
if (s[0] !== s[1]) {
|
|
throw new Error('For A^b, A must be square (size is ' + s[0] + 'x' + s[1] + ')')
|
|
}
|
|
|
|
let res = identity(s[0]).valueOf()
|
|
let px = x
|
|
while (y >= 1) {
|
|
if ((y & 1) === 1) {
|
|
res = multiply(px, res)
|
|
}
|
|
y >>= 1
|
|
px = multiply(px, px)
|
|
}
|
|
return res
|
|
}
|
|
|
|
/**
|
|
* Calculate the power of a 2d matrix
|
|
* @param {Matrix} x must be a 2 dimensional, square matrix
|
|
* @param {number} y a positive, integer value
|
|
* @returns {Matrix}
|
|
* @private
|
|
*/
|
|
function _powMatrix (x, y) {
|
|
return matrix(_powArray(x.valueOf(), y))
|
|
}
|
|
})
|