mirror
/
digital-filter-designer
kopia lustrzana https://github.com/badra022/digital-filter-designer
1
0
Forkuj 0
Kod Zgłoszenia Projekty Wydania Wiki Aktywność
digital-filter-designer/math.js

61520 wiersze
1.8 MiB
Czysty Bezpośredni odnośnik Wina Historia

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

/**
* math.js
* https://github.com/josdejong/mathjs
*
* Math.js is an extensive math library for JavaScript and Node.js,
* It features real and complex numbers, units, matrices, a large set of
* mathematical functions, and a flexible expression parser.
*
* @version 7.1.0
* @date 2020-07-13
*
* @license
* Copyright (C) 2013-2020 Jos de Jong <wjosdejong@gmail.com>
*
* Licensed under the Apache License, Version 2.0 (the "License"); you may not
* use this file except in compliance with the License. You may obtain a copy
* of the License at
*
* https://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
* License for the specific language governing permissions and limitations under
* the License.
*/
(function webpackUniversalModuleDefinition(root, factory) {
if(typeof exports === 'object' && typeof module === 'object')
module.exports = factory();
else if(typeof define === 'function' && define.amd)
define([], factory);
else if(typeof exports === 'object')
exports["math"] = factory();
else
root["math"] = factory();
})(this, function() {
return /******/ (function(modules) { // webpackBootstrap
/******/ // The module cache
/******/ var installedModules = {};
/******/
/******/ // The require function
/******/ function __webpack_require__(moduleId) {
/******/
/******/ // Check if module is in cache
/******/ if(installedModules[moduleId]) {
/******/ return installedModules[moduleId].exports;
/******/ }
/******/ // Create a new module (and put it into the cache)
/******/ var module = installedModules[moduleId] = {
/******/ i: moduleId,
/******/ l: false,
/******/ exports: {}
/******/ };
/******/
/******/ // Execute the module function
/******/ modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);
/******/
/******/ // Flag the module as loaded
/******/ module.l = true;
/******/
/******/ // Return the exports of the module
/******/ return module.exports;
/******/ }
/******/
/******/
/******/ // expose the modules object (__webpack_modules__)
/******/ __webpack_require__.m = modules;
/******/
/******/ // expose the module cache
/******/ __webpack_require__.c = installedModules;
/******/
/******/ // define getter function for harmony exports
/******/ __webpack_require__.d = function(exports, name, getter) {
/******/ if(!__webpack_require__.o(exports, name)) {
/******/ Object.defineProperty(exports, name, { enumerable: true, get: getter });
/******/ }
/******/ };
/******/
/******/ // define __esModule on exports
/******/ __webpack_require__.r = function(exports) {
/******/ if(typeof Symbol !== 'undefined' && Symbol.toStringTag) {
/******/ Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
/******/ }
/******/ Object.defineProperty(exports, '__esModule', { value: true });
/******/ };
/******/
/******/ // create a fake namespace object
/******/ // mode & 1: value is a module id, require it
/******/ // mode & 2: merge all properties of value into the ns
/******/ // mode & 4: return value when already ns object
/******/ // mode & 8|1: behave like require
/******/ __webpack_require__.t = function(value, mode) {
/******/ if(mode & 1) value = __webpack_require__(value);
/******/ if(mode & 8) return value;
/******/ if((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;
/******/ var ns = Object.create(null);
/******/ __webpack_require__.r(ns);
/******/ Object.defineProperty(ns, 'default', { enumerable: true, value: value });
/******/ if(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));
/******/ return ns;
/******/ };
/******/
/******/ // getDefaultExport function for compatibility with non-harmony modules
/******/ __webpack_require__.n = function(module) {
/******/ var getter = module && module.__esModule ?
/******/ function getDefault() { return module['default']; } :
/******/ function getModuleExports() { return module; };
/******/ __webpack_require__.d(getter, 'a', getter);
/******/ return getter;
/******/ };
/******/
/******/ // Object.prototype.hasOwnProperty.call
/******/ __webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };
/******/
/******/ // __webpack_public_path__
/******/ __webpack_require__.p = "";
/******/
/******/
/******/ // Load entry module and return exports
/******/ return __webpack_require__(__webpack_require__.s = 18);
/******/ })
/************************************************************************/
/******/ ([
/* 0 */
/***/ (function(module, __webpack_exports__, __webpack_require__) {
"use strict";
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "a", function() { return factory; });
/* unused harmony export sortFactories */
/* unused harmony export create */
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "b", function() { return isFactory; });
/* unused harmony export assertDependencies */
/* unused harmony export isOptionalDependency */
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "c", function() { return stripOptionalNotation; });
/* harmony import */ var _array__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(2);
/* harmony import */ var _object__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(3);
/**
* Create a factory function, which can be used to inject dependencies.
*
* The created functions are memoized, a consecutive call of the factory
* with the exact same inputs will return the same function instance.
* The memoized cache is exposed on `factory.cache` and can be cleared
* if needed.
*
* Example:
*
* const name = 'log'
* const dependencies = ['config', 'typed', 'divideScalar', 'Complex']
*
* export const createLog = factory(name, dependencies, ({ typed, config, divideScalar, Complex }) => {
* // ... create the function log here and return it
* }
*
* @param {string} name Name of the function to be created
* @param {string[]} dependencies The names of all required dependencies
* @param {function} create Callback function called with an object with all dependencies
* @param {Object} [meta] Optional object with meta information that will be attached
* to the created factory function as property `meta`.
* @returns {function}
*/
function factory(name, dependencies, create, meta) {
function assertAndCreate(scope) {
// we only pass the requested dependencies to the factory function
// to prevent functions to rely on dependencies that are not explicitly
// requested.
var deps = Object(_object__WEBPACK_IMPORTED_MODULE_1__[/* pickShallow */ "j"])(scope, dependencies.map(stripOptionalNotation));
assertDependencies(name, dependencies, scope);
return create(deps);
}
assertAndCreate.isFactory = true;
assertAndCreate.fn = name;
assertAndCreate.dependencies = dependencies.slice().sort();
if (meta) {
assertAndCreate.meta = meta;
}
return assertAndCreate;
}
/**
* Sort all factories such that when loading in order, the dependencies are resolved.
*
* @param {Array} factories
* @returns {Array} Returns a new array with the sorted factories.
*/
function sortFactories(factories) {
var factoriesByName = {};
factories.forEach(function (factory) {
factoriesByName[factory.fn] = factory;
});
function containsDependency(factory, dependency) {
// TODO: detect circular references
if (isFactory(factory)) {
if (Object(_array__WEBPACK_IMPORTED_MODULE_0__[/* contains */ "b"])(factory.dependencies, dependency.fn || dependency.name)) {
return true;
}
if (factory.dependencies.some(function (d) {
return containsDependency(factoriesByName[d], dependency);
})) {
return true;
}
}
return false;
}
var sorted = [];
function addFactory(factory) {
var index = 0;
while (index < sorted.length && !containsDependency(sorted[index], factory)) {
index++;
}
sorted.splice(index, 0, factory);
} // sort regular factory functions
factories.filter(isFactory).forEach(addFactory); // sort legacy factory functions AFTER the regular factory functions
factories.filter(function (factory) {
return !isFactory(factory);
}).forEach(addFactory);
return sorted;
} // TODO: comment or cleanup if unused in the end
function create(factories) {
var scope = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
sortFactories(factories).forEach(function (factory) {
return factory(scope);
});
return scope;
}
/**
* Test whether an object is a factory. This is the case when it has
* properties name, dependencies, and a function create.
* @param {*} obj
* @returns {boolean}
*/
function isFactory(obj) {
return typeof obj === 'function' && typeof obj.fn === 'string' && Array.isArray(obj.dependencies);
}
/**
* Assert that all dependencies of a list with dependencies are available in the provided scope.
*
* Will throw an exception when there are dependencies missing.
*
* @param {string} name Name for the function to be created. Used to generate a useful error message
* @param {string[]} dependencies
* @param {Object} scope
*/
function assertDependencies(name, dependencies, scope) {
var allDefined = dependencies.filter(function (dependency) {
return !isOptionalDependency(dependency);
}) // filter optionals
.every(function (dependency) {
return scope[dependency] !== undefined;
});
if (!allDefined) {
var missingDependencies = dependencies.filter(function (dependency) {
return scope[dependency] === undefined;
}); // TODO: create a custom error class for this, a MathjsError or something like that
throw new Error("Cannot create function \"".concat(name, "\", ") + "some dependencies are missing: ".concat(missingDependencies.map(function (d) {
return "\"".concat(d, "\"");
}).join(', '), "."));
}
}
function isOptionalDependency(dependency) {
return dependency && dependency[0] === '?';
}
function stripOptionalNotation(dependency) {
return dependency && dependency[0] === '?' ? dependency.slice(1) : dependency;
}
/***/ }),
/* 1 */
/***/ (function(module, __webpack_exports__, __webpack_require__) {
"use strict";
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "y", function() { return isNumber; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "e", function() { return isBigNumber; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "j", function() { return isComplex; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "o", function() { return isFraction; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "L", function() { return isUnit; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "I", function() { return isString; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "b", function() { return isArray; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "v", function() { return isMatrix; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "i", function() { return isCollection; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "n", function() { return isDenseMatrix; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "H", function() { return isSparseMatrix; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "D", function() { return isRange; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "t", function() { return isIndex; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "g", function() { return isBoolean; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "G", function() { return isResultSet; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "s", function() { return isHelp; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "p", function() { return isFunction; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "m", function() { return isDate; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "F", function() { return isRegExp; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "z", function() { return isObject; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "x", function() { return isNull; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "K", function() { return isUndefined; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "a", function() { return isAccessorNode; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "c", function() { return isArrayNode; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "d", function() { return isAssignmentNode; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "f", function() { return isBlockNode; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "k", function() { return isConditionalNode; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "l", function() { return isConstantNode; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "q", function() { return isFunctionAssignmentNode; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "r", function() { return isFunctionNode; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "u", function() { return isIndexNode; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "w", function() { return isNode; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "A", function() { return isObjectNode; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "B", function() { return isOperatorNode; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "C", function() { return isParenthesisNode; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "E", function() { return isRangeNode; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "J", function() { return isSymbolNode; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "h", function() { return isChain; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "M", function() { return typeOf; });
function _typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
// type checks for all known types
//
// note that:
//
// - check by duck-typing on a property like `isUnit`, instead of checking instanceof.
// instanceof cannot be used because that would not allow to pass data from
// one instance of math.js to another since each has it's own instance of Unit.
// - check the `isUnit` property via the constructor, so there will be no
// matches for "fake" instances like plain objects with a property `isUnit`.
// That is important for security reasons.
// - It must not be possible to override the type checks used internally,
// for security reasons, so these functions are not exposed in the expression
// parser.
function isNumber(x) {
return typeof x === 'number';
}
function isBigNumber(x) {
return x && x.constructor.prototype.isBigNumber === true || false;
}
function isComplex(x) {
return x && _typeof(x) === 'object' && Object.getPrototypeOf(x).isComplex === true || false;
}
function isFraction(x) {
return x && _typeof(x) === 'object' && Object.getPrototypeOf(x).isFraction === true || false;
}
function isUnit(x) {
return x && x.constructor.prototype.isUnit === true || false;
}
function isString(x) {
return typeof x === 'string';
}
var isArray = Array.isArray;
function isMatrix(x) {
return x && x.constructor.prototype.isMatrix === true || false;
}
/**
* Test whether a value is a collection: an Array or Matrix
* @param {*} x
* @returns {boolean} isCollection
*/
function isCollection(x) {
return Array.isArray(x) || isMatrix(x);
}
function isDenseMatrix(x) {
return x && x.isDenseMatrix && x.constructor.prototype.isMatrix === true || false;
}
function isSparseMatrix(x) {
return x && x.isSparseMatrix && x.constructor.prototype.isMatrix === true || false;
}
function isRange(x) {
return x && x.constructor.prototype.isRange === true || false;
}
function isIndex(x) {
return x && x.constructor.prototype.isIndex === true || false;
}
function isBoolean(x) {
return typeof x === 'boolean';
}
function isResultSet(x) {
return x && x.constructor.prototype.isResultSet === true || false;
}
function isHelp(x) {
return x && x.constructor.prototype.isHelp === true || false;
}
function isFunction(x) {
return typeof x === 'function';
}
function isDate(x) {
return x instanceof Date;
}
function isRegExp(x) {
return x instanceof RegExp;
}
function isObject(x) {
return !!(x && _typeof(x) === 'object' && x.constructor === Object && !isComplex(x) && !isFraction(x));
}
function isNull(x) {
return x === null;
}
function isUndefined(x) {
return x === undefined;
}
function isAccessorNode(x) {
return x && x.isAccessorNode === true && x.constructor.prototype.isNode === true || false;
}
function isArrayNode(x) {
return x && x.isArrayNode === true && x.constructor.prototype.isNode === true || false;
}
function isAssignmentNode(x) {
return x && x.isAssignmentNode === true && x.constructor.prototype.isNode === true || false;
}
function isBlockNode(x) {
return x && x.isBlockNode === true && x.constructor.prototype.isNode === true || false;
}
function isConditionalNode(x) {
return x && x.isConditionalNode === true && x.constructor.prototype.isNode === true || false;
}
function isConstantNode(x) {
return x && x.isConstantNode === true && x.constructor.prototype.isNode === true || false;
}
function isFunctionAssignmentNode(x) {
return x && x.isFunctionAssignmentNode === true && x.constructor.prototype.isNode === true || false;
}
function isFunctionNode(x) {
return x && x.isFunctionNode === true && x.constructor.prototype.isNode === true || false;
}
function isIndexNode(x) {
return x && x.isIndexNode === true && x.constructor.prototype.isNode === true || false;
}
function isNode(x) {
return x && x.isNode === true && x.constructor.prototype.isNode === true || false;
}
function isObjectNode(x) {
return x && x.isObjectNode === true && x.constructor.prototype.isNode === true || false;
}
function isOperatorNode(x) {
return x && x.isOperatorNode === true && x.constructor.prototype.isNode === true || false;
}
function isParenthesisNode(x) {
return x && x.isParenthesisNode === true && x.constructor.prototype.isNode === true || false;
}
function isRangeNode(x) {
return x && x.isRangeNode === true && x.constructor.prototype.isNode === true || false;
}
function isSymbolNode(x) {
return x && x.isSymbolNode === true && x.constructor.prototype.isNode === true || false;
}
function isChain(x) {
return x && x.constructor.prototype.isChain === true || false;
}
function typeOf(x) {
var t = _typeof(x);
if (t === 'object') {
// JavaScript types
if (x === null) return 'null';
if (Array.isArray(x)) return 'Array';
if (x instanceof Date) return 'Date';
if (x instanceof RegExp) return 'RegExp'; // math.js types
if (isBigNumber(x)) return 'BigNumber';
if (isComplex(x)) return 'Complex';
if (isFraction(x)) return 'Fraction';
if (isMatrix(x)) return 'Matrix';
if (isUnit(x)) return 'Unit';
if (isIndex(x)) return 'Index';
if (isRange(x)) return 'Range';
if (isResultSet(x)) return 'ResultSet';
if (isNode(x)) return x.type;
if (isChain(x)) return 'Chain';
if (isHelp(x)) return 'Help';
return 'Object';
}
if (t === 'function') return 'Function';
return t; // can be 'string', 'number', 'boolean', ...
}
/***/ }),
/* 2 */
/***/ (function(module, __webpack_exports__, __webpack_require__) {
"use strict";
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "a", function() { return arraySize; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "p", function() { return validate; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "q", function() { return validateIndex; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "m", function() { return resize; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "l", function() { return reshape; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "n", function() { return squeeze; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "o", function() { return unsqueeze; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "e", function() { return flatten; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "k", function() { return map; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "f", function() { return forEach; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "c", function() { return filter; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "d", function() { return filterRegExp; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "j", function() { return join; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "i", function() { return identify; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "g", function() { return generalize; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "h", function() { return getArrayDataType; });
/* unused harmony export last */
/* unused harmony export initial */
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "b", function() { return contains; });
/* harmony import */ var _number__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(4);
/* harmony import */ var _is__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(1);
/* harmony import */ var _string__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(5);
/* harmony import */ var _error_DimensionError__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(6);
/* harmony import */ var _error_IndexError__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(9);
/**
* Calculate the size of a multi dimensional array.
* This function checks the size of the first entry, it does not validate
* whether all dimensions match. (use function `validate` for that)
* @param {Array} x
* @Return {Number[]} size
*/
function arraySize(x) {
var s = [];
while (Array.isArray(x)) {
s.push(x.length);
x = x[0];
}
return s;
}
/**
* Recursively validate whether each element in a multi dimensional array
* has a size corresponding to the provided size array.
* @param {Array} array Array to be validated
* @param {number[]} size Array with the size of each dimension
* @param {number} dim Current dimension
* @throws DimensionError
* @private
*/
function _validate(array, size, dim) {
var i;
var len = array.length;
if (len !== size[dim]) {
throw new _error_DimensionError__WEBPACK_IMPORTED_MODULE_3__[/* DimensionError */ "a"](len, size[dim]);
}
if (dim < size.length - 1) {
// recursively validate each child array
var dimNext = dim + 1;
for (i = 0; i < len; i++) {
var child = array[i];
if (!Array.isArray(child)) {
throw new _error_DimensionError__WEBPACK_IMPORTED_MODULE_3__[/* DimensionError */ "a"](size.length - 1, size.length, '<');
}
_validate(array[i], size, dimNext);
}
} else {
// last dimension. none of the childs may be an array
for (i = 0; i < len; i++) {
if (Array.isArray(array[i])) {
throw new _error_DimensionError__WEBPACK_IMPORTED_MODULE_3__[/* DimensionError */ "a"](size.length + 1, size.length, '>');
}
}
}
}
/**
* Validate whether each element in a multi dimensional array has
* a size corresponding to the provided size array.
* @param {Array} array Array to be validated
* @param {number[]} size Array with the size of each dimension
* @throws DimensionError
*/
function validate(array, size) {
var isScalar = size.length === 0;
if (isScalar) {
// scalar
if (Array.isArray(array)) {
throw new _error_DimensionError__WEBPACK_IMPORTED_MODULE_3__[/* DimensionError */ "a"](array.length, 0);
}
} else {
// array
_validate(array, size, 0);
}
}
/**
* Test whether index is an integer number with index >= 0 and index < length
* when length is provided
* @param {number} index Zero-based index
* @param {number} [length] Length of the array
*/
function validateIndex(index, length) {
if (!Object(_is__WEBPACK_IMPORTED_MODULE_1__[/* isNumber */ "y"])(index) || !Object(_number__WEBPACK_IMPORTED_MODULE_0__[/* isInteger */ "i"])(index)) {
throw new TypeError('Index must be an integer (value: ' + index + ')');
}
if (index < 0 || typeof length === 'number' && index >= length) {
throw new _error_IndexError__WEBPACK_IMPORTED_MODULE_4__[/* IndexError */ "a"](index, length);
}
}
/**
* Resize a multi dimensional array. The resized array is returned.
* @param {Array} array Array to be resized
* @param {Array.<number>} size Array with the size of each dimension
* @param {*} [defaultValue=0] Value to be filled in in new entries,
* zero by default. Specify for example `null`,
* to clearly see entries that are not explicitly
* set.
* @return {Array} array The resized array
*/
function resize(array, size, defaultValue) {
// TODO: add support for scalars, having size=[] ?
// check the type of the arguments
if (!Array.isArray(array) || !Array.isArray(size)) {
throw new TypeError('Array expected');
}
if (size.length === 0) {
throw new Error('Resizing to scalar is not supported');
} // check whether size contains positive integers
size.forEach(function (value) {
if (!Object(_is__WEBPACK_IMPORTED_MODULE_1__[/* isNumber */ "y"])(value) || !Object(_number__WEBPACK_IMPORTED_MODULE_0__[/* isInteger */ "i"])(value) || value < 0) {
throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + Object(_string__WEBPACK_IMPORTED_MODULE_2__[/* format */ "d"])(size) + ')');
}
}); // recursively resize the array
var _defaultValue = defaultValue !== undefined ? defaultValue : 0;
_resize(array, size, 0, _defaultValue);
return array;
}
/**
* Recursively resize a multi dimensional array
* @param {Array} array Array to be resized
* @param {number[]} size Array with the size of each dimension
* @param {number} dim Current dimension
* @param {*} [defaultValue] Value to be filled in in new entries,
* undefined by default.
* @private
*/
function _resize(array, size, dim, defaultValue) {
var i;
var elem;
var oldLen = array.length;
var newLen = size[dim];
var minLen = Math.min(oldLen, newLen); // apply new length
array.length = newLen;
if (dim < size.length - 1) {
// non-last dimension
var dimNext = dim + 1; // resize existing child arrays
for (i = 0; i < minLen; i++) {
// resize child array
elem = array[i];
if (!Array.isArray(elem)) {
elem = [elem]; // add a dimension
array[i] = elem;
}
_resize(elem, size, dimNext, defaultValue);
} // create new child arrays
for (i = minLen; i < newLen; i++) {
// get child array
elem = [];
array[i] = elem; // resize new child array
_resize(elem, size, dimNext, defaultValue);
}
} else {
// last dimension
// remove dimensions of existing values
for (i = 0; i < minLen; i++) {
while (Array.isArray(array[i])) {
array[i] = array[i][0];
}
} // fill new elements with the default value
for (i = minLen; i < newLen; i++) {
array[i] = defaultValue;
}
}
}
/**
* Re-shape a multi dimensional array to fit the specified dimensions
* @param {Array} array Array to be reshaped
* @param {Array.<number>} sizes List of sizes for each dimension
* @returns {Array} Array whose data has been formatted to fit the
* specified dimensions
*
* @throws {DimensionError} If the product of the new dimension sizes does
* not equal that of the old ones
*/
function reshape(array, sizes) {
var flatArray = flatten(array);
var newArray;
function product(arr) {
return arr.reduce(function (prev, curr) {
return prev * curr;
});
}
if (!Array.isArray(array) || !Array.isArray(sizes)) {
throw new TypeError('Array expected');
}
if (sizes.length === 0) {
throw new _error_DimensionError__WEBPACK_IMPORTED_MODULE_3__[/* DimensionError */ "a"](0, product(arraySize(array)), '!=');
}
var totalSize = 1;
for (var sizeIndex = 0; sizeIndex < sizes.length; sizeIndex++) {
totalSize *= sizes[sizeIndex];
}
if (flatArray.length !== totalSize) {
throw new _error_DimensionError__WEBPACK_IMPORTED_MODULE_3__[/* DimensionError */ "a"](product(sizes), product(arraySize(array)), '!=');
}
try {
newArray = _reshape(flatArray, sizes);
} catch (e) {
if (e instanceof _error_DimensionError__WEBPACK_IMPORTED_MODULE_3__[/* DimensionError */ "a"]) {
throw new _error_DimensionError__WEBPACK_IMPORTED_MODULE_3__[/* DimensionError */ "a"](product(sizes), product(arraySize(array)), '!=');
}
throw e;
}
return newArray;
}
/**
* Iteratively re-shape a multi dimensional array to fit the specified dimensions
* @param {Array} array Array to be reshaped
* @param {Array.<number>} sizes List of sizes for each dimension
* @returns {Array} Array whose data has been formatted to fit the
* specified dimensions
*/
function _reshape(array, sizes) {
// testing if there are enough elements for the requested shape
var tmpArray = array;
var tmpArray2; // for each dimensions starting by the last one and ignoring the first one
for (var sizeIndex = sizes.length - 1; sizeIndex > 0; sizeIndex--) {
var size = sizes[sizeIndex];
tmpArray2 = []; // aggregate the elements of the current tmpArray in elements of the requested size
var length = tmpArray.length / size;
for (var i = 0; i < length; i++) {
tmpArray2.push(tmpArray.slice(i * size, (i + 1) * size));
} // set it as the new tmpArray for the next loop turn or for return
tmpArray = tmpArray2;
}
return tmpArray;
}
/**
* Squeeze a multi dimensional array
* @param {Array} array
* @param {Array} [size]
* @returns {Array} returns the array itself
*/
function squeeze(array, size) {
var s = size || arraySize(array); // squeeze outer dimensions
while (Array.isArray(array) && array.length === 1) {
array = array[0];
s.shift();
} // find the first dimension to be squeezed
var dims = s.length;
while (s[dims - 1] === 1) {
dims--;
} // squeeze inner dimensions
if (dims < s.length) {
array = _squeeze(array, dims, 0);
s.length = dims;
}
return array;
}
/**
* Recursively squeeze a multi dimensional array
* @param {Array} array
* @param {number} dims Required number of dimensions
* @param {number} dim Current dimension
* @returns {Array | *} Returns the squeezed array
* @private
*/
function _squeeze(array, dims, dim) {
var i, ii;
if (dim < dims) {
var next = dim + 1;
for (i = 0, ii = array.length; i < ii; i++) {
array[i] = _squeeze(array[i], dims, next);
}
} else {
while (Array.isArray(array)) {
array = array[0];
}
}
return array;
}
/**
* Unsqueeze a multi dimensional array: add dimensions when missing
*
* Paramter `size` will be mutated to match the new, unqueezed matrix size.
*
* @param {Array} array
* @param {number} dims Desired number of dimensions of the array
* @param {number} [outer] Number of outer dimensions to be added
* @param {Array} [size] Current size of array.
* @returns {Array} returns the array itself
* @private
*/
function unsqueeze(array, dims, outer, size) {
var s = size || arraySize(array); // unsqueeze outer dimensions
if (outer) {
for (var i = 0; i < outer; i++) {
array = [array];
s.unshift(1);
}
} // unsqueeze inner dimensions
array = _unsqueeze(array, dims, 0);
while (s.length < dims) {
s.push(1);
}
return array;
}
/**
* Recursively unsqueeze a multi dimensional array
* @param {Array} array
* @param {number} dims Required number of dimensions
* @param {number} dim Current dimension
* @returns {Array | *} Returns the squeezed array
* @private
*/
function _unsqueeze(array, dims, dim) {
var i, ii;
if (Array.isArray(array)) {
var next = dim + 1;
for (i = 0, ii = array.length; i < ii; i++) {
array[i] = _unsqueeze(array[i], dims, next);
}
} else {
for (var d = dim; d < dims; d++) {
array = [array];
}
}
return array;
}
/**
* Flatten a multi dimensional array, put all elements in a one dimensional
* array
* @param {Array} array A multi dimensional array
* @return {Array} The flattened array (1 dimensional)
*/
function flatten(array) {
if (!Array.isArray(array)) {
// if not an array, return as is
return array;
}
var flat = [];
array.forEach(function callback(value) {
if (Array.isArray(value)) {
value.forEach(callback); // traverse through sub-arrays recursively
} else {
flat.push(value);
}
});
return flat;
}
/**
* A safe map
* @param {Array} array
* @param {function} callback
*/
function map(array, callback) {
return Array.prototype.map.call(array, callback);
}
/**
* A safe forEach
* @param {Array} array
* @param {function} callback
*/
function forEach(array, callback) {
Array.prototype.forEach.call(array, callback);
}
/**
* A safe filter
* @param {Array} array
* @param {function} callback
*/
function filter(array, callback) {
if (arraySize(array).length !== 1) {
throw new Error('Only one dimensional matrices supported');
}
return Array.prototype.filter.call(array, callback);
}
/**
* Filter values in a callback given a regular expression
* @param {Array} array
* @param {RegExp} regexp
* @return {Array} Returns the filtered array
* @private
*/
function filterRegExp(array, regexp) {
if (arraySize(array).length !== 1) {
throw new Error('Only one dimensional matrices supported');
}
return Array.prototype.filter.call(array, function (entry) {
return regexp.test(entry);
});
}
/**
* A safe join
* @param {Array} array
* @param {string} separator
*/
function join(array, separator) {
return Array.prototype.join.call(array, separator);
}
/**
* Assign a numeric identifier to every element of a sorted array
* @param {Array} a An array
* @return {Array} An array of objects containing the original value and its identifier
*/
function identify(a) {
if (!Array.isArray(a)) {
throw new TypeError('Array input expected');
}
if (a.length === 0) {
return a;
}
var b = [];
var count = 0;
b[0] = {
value: a[0],
identifier: 0
};
for (var i = 1; i < a.length; i++) {
if (a[i] === a[i - 1]) {
count++;
} else {
count = 0;
}
b.push({
value: a[i],
identifier: count
});
}
return b;
}
/**
* Remove the numeric identifier from the elements
* @param {array} a An array
* @return {array} An array of values without identifiers
*/
function generalize(a) {
if (!Array.isArray(a)) {
throw new TypeError('Array input expected');
}
if (a.length === 0) {
return a;
}
var b = [];
for (var i = 0; i < a.length; i++) {
b.push(a[i].value);
}
return b;
}
/**
* Check the datatype of a given object
* This is a low level implementation that should only be used by
* parent Matrix classes such as SparseMatrix or DenseMatrix
* This method does not validate Array Matrix shape
* @param {Array} array
* @param {function} typeOf Callback function to use to determine the type of a value
* @return string
*/
function getArrayDataType(array, typeOf) {
var type; // to hold type info
var length = 0; // to hold length value to ensure it has consistent sizes
for (var i = 0; i < array.length; i++) {
var item = array[i];
var isArray = Array.isArray(item); // Saving the target matrix row size
if (i === 0 && isArray) {
length = item.length;
} // If the current item is an array but the length does not equal the targetVectorSize
if (isArray && item.length !== length) {
return undefined;
}
var itemType = isArray ? getArrayDataType(item, typeOf) // recurse into a nested array
: typeOf(item);
if (type === undefined) {
type = itemType; // first item
} else if (type !== itemType) {
return 'mixed';
} else {// we're good, everything has the same type so far
}
}
return type;
}
/**
* Return the last item from an array
* @param array
* @returns {*}
*/
function last(array) {
return array[array.length - 1];
}
/**
* Get all but the last element of array.
*/
function initial(array) {
return array.slice(0, array.length - 1);
}
/**
* Test whether an array or string contains an item
* @param {Array | string} array
* @param {*} item
* @return {boolean}
*/
function contains(array, item) {
return array.indexOf(item) !== -1;
}
/***/ }),
/* 3 */
/***/ (function(module, __webpack_exports__, __webpack_require__) {
"use strict";
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "a", function() { return clone; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "i", function() { return mapObject; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "e", function() { return extend; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "b", function() { return deepExtend; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "d", function() { return deepStrictEqual; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "c", function() { return deepFlatten; });
/* unused harmony export canDefineProperty */
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "h", function() { return lazy; });
/* unused harmony export traverse */
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "f", function() { return hasOwnProperty; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "g", function() { return isLegacyFactory; });
/* unused harmony export get */
/* unused harmony export set */
/* unused harmony export pick */
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "j", function() { return pickShallow; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "k", function() { return values; });
/* harmony import */ var _is__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(1);
function _typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
/**
* Clone an object
*
* clone(x)
*
* Can clone any primitive type, array, and object.
* If x has a function clone, this function will be invoked to clone the object.
*
* @param {*} x
* @return {*} clone
*/
function clone(x) {
var type = _typeof(x); // immutable primitive types
if (type === 'number' || type === 'string' || type === 'boolean' || x === null || x === undefined) {
return x;
} // use clone function of the object when available
if (typeof x.clone === 'function') {
return x.clone();
} // array
if (Array.isArray(x)) {
return x.map(function (value) {
return clone(value);
});
}
if (x instanceof Date) return new Date(x.valueOf());
if (Object(_is__WEBPACK_IMPORTED_MODULE_0__[/* isBigNumber */ "e"])(x)) return x; // bignumbers are immutable
if (x instanceof RegExp) throw new TypeError('Cannot clone ' + x); // TODO: clone a RegExp
// object
return mapObject(x, clone);
}
/**
* Apply map to all properties of an object
* @param {Object} object
* @param {function} callback
* @return {Object} Returns a copy of the object with mapped properties
*/
function mapObject(object, callback) {
var clone = {};
for (var key in object) {
if (hasOwnProperty(object, key)) {
clone[key] = callback(object[key]);
}
}
return clone;
}
/**
* Extend object a with the properties of object b
* @param {Object} a
* @param {Object} b
* @return {Object} a
*/
function extend(a, b) {
for (var prop in b) {
if (hasOwnProperty(b, prop)) {
a[prop] = b[prop];
}
}
return a;
}
/**
* Deep extend an object a with the properties of object b
* @param {Object} a
* @param {Object} b
* @returns {Object}
*/
function deepExtend(a, b) {
// TODO: add support for Arrays to deepExtend
if (Array.isArray(b)) {
throw new TypeError('Arrays are not supported by deepExtend');
}
for (var prop in b) {
if (hasOwnProperty(b, prop)) {
if (b[prop] && b[prop].constructor === Object) {
if (a[prop] === undefined) {
a[prop] = {};
}
if (a[prop] && a[prop].constructor === Object) {
deepExtend(a[prop], b[prop]);
} else {
a[prop] = b[prop];
}
} else if (Array.isArray(b[prop])) {
throw new TypeError('Arrays are not supported by deepExtend');
} else {
a[prop] = b[prop];
}
}
}
return a;
}
/**
* Deep test equality of all fields in two pairs of arrays or objects.
* Compares values and functions strictly (ie. 2 is not the same as '2').
* @param {Array | Object} a
* @param {Array | Object} b
* @returns {boolean}
*/
function deepStrictEqual(a, b) {
var prop, i, len;
if (Array.isArray(a)) {
if (!Array.isArray(b)) {
return false;
}
if (a.length !== b.length) {
return false;
}
for (i = 0, len = a.length; i < len; i++) {
if (!deepStrictEqual(a[i], b[i])) {
return false;
}
}
return true;
} else if (typeof a === 'function') {
return a === b;
} else if (a instanceof Object) {
if (Array.isArray(b) || !(b instanceof Object)) {
return false;
}
for (prop in a) {
// noinspection JSUnfilteredForInLoop
if (!(prop in b) || !deepStrictEqual(a[prop], b[prop])) {
return false;
}
}
for (prop in b) {
// noinspection JSUnfilteredForInLoop
if (!(prop in a) || !deepStrictEqual(a[prop], b[prop])) {
return false;
}
}
return true;
} else {
return a === b;
}
}
/**
* Recursively flatten a nested object.
* @param {Object} nestedObject
* @return {Object} Returns the flattened object
*/
function deepFlatten(nestedObject) {
var flattenedObject = {};
_deepFlatten(nestedObject, flattenedObject);
return flattenedObject;
} // helper function used by deepFlatten
function _deepFlatten(nestedObject, flattenedObject) {
for (var prop in nestedObject) {
if (hasOwnProperty(nestedObject, prop)) {
var value = nestedObject[prop];
if (_typeof(value) === 'object' && value !== null) {
_deepFlatten(value, flattenedObject);
} else {
flattenedObject[prop] = value;
}
}
}
}
/**
* Test whether the current JavaScript engine supports Object.defineProperty
* @returns {boolean} returns true if supported
*/
function canDefineProperty() {
// test needed for broken IE8 implementation
try {
if (Object.defineProperty) {
Object.defineProperty({}, 'x', {
get: function get() {}
});
return true;
}
} catch (e) {}
return false;
}
/**
* Attach a lazy loading property to a constant.
* The given function `fn` is called once when the property is first requested.
*
* @param {Object} object Object where to add the property
* @param {string} prop Property name
* @param {Function} valueResolver Function returning the property value. Called
* without arguments.
*/
function lazy(object, prop, valueResolver) {
var _uninitialized = true;
var _value;
Object.defineProperty(object, prop, {
get: function get() {
if (_uninitialized) {
_value = valueResolver();
_uninitialized = false;
}
return _value;
},
set: function set(value) {
_value = value;
_uninitialized = false;
},
configurable: true,
enumerable: true
});
}
/**
* Traverse a path into an object.
* When a namespace is missing, it will be created
* @param {Object} object
* @param {string | string[]} path A dot separated string like 'name.space'
* @return {Object} Returns the object at the end of the path
*/
function traverse(object, path) {
if (path && typeof path === 'string') {
return traverse(object, path.split('.'));
}
var obj = object;
if (path) {
for (var i = 0; i < path.length; i++) {
var key = path[i];
if (!(key in obj)) {
obj[key] = {};
}
obj = obj[key];
}
}
return obj;
}
/**
* A safe hasOwnProperty
* @param {Object} object
* @param {string} property
*/
function hasOwnProperty(object, property) {
return object && Object.hasOwnProperty.call(object, property);
}
/**
* Test whether an object is a factory. a factory has fields:
*
* - factory: function (type: Object, config: Object, load: function, typed: function [, math: Object]) (required)
* - name: string (optional)
* - path: string A dot separated path (optional)
* - math: boolean If true (false by default), the math namespace is passed
* as fifth argument of the factory function
*
* @param {*} object
* @returns {boolean}
*/
function isLegacyFactory(object) {
return object && typeof object.factory === 'function';
}
/**
* Get a nested property from an object
* @param {Object} object
* @param {string | string[]} path
* @returns {Object}
*/
function get(object, path) {
if (typeof path === 'string') {
if (isPath(path)) {
return get(object, path.split('.'));
} else {
return object[path];
}
}
var child = object;
for (var i = 0; i < path.length; i++) {
var key = path[i];
child = child ? child[key] : undefined;
}
return child;
}
/**
* Set a nested property in an object
* Mutates the object itself
* If the path doesn't exist, it will be created
* @param {Object} object
* @param {string | string[]} path
* @param {*} value
* @returns {Object}
*/
function set(object, path, value) {
if (typeof path === 'string') {
if (isPath(path)) {
return set(object, path.split('.'), value);
} else {
object[path] = value;
return object;
}
}
var child = object;
for (var i = 0; i < path.length - 1; i++) {
var key = path[i];
if (child[key] === undefined) {
child[key] = {};
}
child = child[key];
}
if (path.length > 0) {
var lastKey = path[path.length - 1];
child[lastKey] = value;
}
return object;
}
/**
* Create an object composed of the picked object properties
* @param {Object} object
* @param {string[]} properties
* @param {function} [transform] Optional value to transform a value when picking it
* @return {Object}
*/
function pick(object, properties, transform) {
var copy = {};
for (var i = 0; i < properties.length; i++) {
var key = properties[i];
var value = get(object, key);
if (value !== undefined) {
set(copy, key, transform ? transform(value, key) : value);
}
}
return copy;
}
/**
* Shallow version of pick, creating an object composed of the picked object properties
* but not for nested properties
* @param {Object} object
* @param {string[]} properties
* @return {Object}
*/
function pickShallow(object, properties) {
var copy = {};
for (var i = 0; i < properties.length; i++) {
var key = properties[i];
var value = object[key];
if (value !== undefined) {
copy[key] = value;
}
}
return copy;
}
function values(object) {
return Object.keys(object).map(function (key) {
return object[key];
});
} // helper function to test whether a string contains a path like 'user.name'
function isPath(str) {
return str.indexOf('.') !== -1;
}
/***/ }),
/* 4 */
/***/ (function(module, __webpack_exports__, __webpack_require__) {
"use strict";
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "i", function() { return isInteger; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "n", function() { return sign; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "l", function() { return log2; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "j", function() { return log10; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "k", function() { return log1p; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "d", function() { return cbrt; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "g", function() { return expm1; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "h", function() { return format; });
/* unused harmony export splitNumber */
/* unused harmony export toEngineering */
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "q", function() { return toFixed; });
/* unused harmony export toExponential */
/* unused harmony export toPrecision */
/* unused harmony export roundDigits */
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "f", function() { return digits; });
/* unused harmony export DBL_EPSILON */
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "m", function() { return nearlyEqual; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "a", function() { return acosh; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "b", function() { return asinh; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "c", function() { return atanh; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "e", function() { return cosh; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "o", function() { return sinh; });
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "p", function() { return tanh; });
/* harmony import */ var _is__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(1);
/**
* @typedef {{sign: '+' | '-' | '', coefficients: number[], exponent: number}} SplitValue
*/
/**
* Check if a number is integer
* @param {number | boolean} value
* @return {boolean} isInteger
*/
function isInteger(value) {
if (typeof value === 'boolean') {
return true;
}
return isFinite(value) ? value === Math.round(value) : false; // Note: we use ==, not ===, as we can have Booleans as well
}
/**
* Calculate the sign of a number
* @param {number} x
* @returns {number}
*/
var sign = /* #__PURE__ */Math.sign || function (x) {
if (x > 0) {
return 1;
} else if (x < 0) {
return -1;
} else {
return 0;
}
};
/**
* Calculate the base-2 logarithm of a number
* @param {number} x
* @returns {number}
*/
var log2 = /* #__PURE__ */Math.log2 || function log2(x) {
return Math.log(x) / Math.LN2;
};
/**
* Calculate the base-10 logarithm of a number
* @param {number} x
* @returns {number}
*/
var log10 = /* #__PURE__ */Math.log10 || function log10(x) {
return Math.log(x) / Math.LN10;
};
/**
* Calculate the natural logarithm of a number + 1
* @param {number} x
* @returns {number}
*/
var log1p = /* #__PURE__ */Math.log1p || function (x) {
return Math.log(x + 1);
};
/**
* Calculate cubic root for a number
*
* Code from es6-shim.js:
* https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1564-L1577
*
* @param {number} x
* @returns {number} Returns the cubic root of x
*/
var cbrt = /* #__PURE__ */Math.cbrt || function cbrt(x) {
if (x === 0) {
return x;
}
var negate = x < 0;
var result;
if (negate) {
x = -x;
}
if (isFinite(x)) {
result = Math.exp(Math.log(x) / 3); // from https://en.wikipedia.org/wiki/Cube_root#Numerical_methods
result = (x / (result * result) + 2 * result) / 3;
} else {
result = x;
}
return negate ? -result : result;
};
/**
* Calculates exponentiation minus 1
* @param {number} x
* @return {number} res
*/
var expm1 = /* #__PURE__ */Math.expm1 || function expm1(x) {
return x >= 2e-4 || x <= -2e-4 ? Math.exp(x) - 1 : x + x * x / 2 + x * x * x / 6;
};
/**
* Convert a number to a formatted string representation.
*
* Syntax:
*
* format(value)
* format(value, options)
* format(value, precision)
* format(value, fn)
*
* Where:
*
* {number} value The value to be formatted
* {Object} options An object with formatting options. Available options:
* {string} notation
* Number notation. Choose from:
* 'fixed' Always use regular number notation.
* For example '123.40' and '14000000'
* 'exponential' Always use exponential notation.
* For example '1.234e+2' and '1.4e+7'
* 'engineering' Always use engineering notation.
* For example '123.4e+0' and '14.0e+6'
* 'auto' (default) Regular number notation for numbers
* having an absolute value between
* `lowerExp` and `upperExp` bounds, and
* uses exponential notation elsewhere.
* Lower bound is included, upper bound
* is excluded.
* For example '123.4' and '1.4e7'.
* {number} precision A number between 0 and 16 to round
* the digits of the number.
* In case of notations 'exponential',
* 'engineering', and 'auto',
* `precision` defines the total
* number of significant digits returned.
* In case of notation 'fixed',
* `precision` defines the number of
* significant digits after the decimal
* point.
* `precision` is undefined by default,
* not rounding any digits.
* {number} lowerExp Exponent determining the lower boundary
* for formatting a value with an exponent
* when `notation='auto`.
* Default value is `-3`.
* {number} upperExp Exponent determining the upper boundary
* for formatting a value with an exponent
* when `notation='auto`.
* Default value is `5`.
* {Function} fn A custom formatting function. Can be used to override the
* built-in notations. Function `fn` is called with `value` as
* parameter and must return a string. Is useful for example to
* format all values inside a matrix in a particular way.
*
* Examples:
*
* format(6.4) // '6.4'
* format(1240000) // '1.24e6'
* format(1/3) // '0.3333333333333333'
* format(1/3, 3) // '0.333'
* format(21385, 2) // '21000'
* format(12.071, {notation: 'fixed'}) // '12'
* format(2.3, {notation: 'fixed', precision: 2}) // '2.30'
* format(52.8, {notation: 'exponential'}) // '5.28e+1'
* format(12345678, {notation: 'engineering'}) // '12.345678e+6'
*
* @param {number} value
* @param {Object | Function | number} [options]
* @return {string} str The formatted value
*/
function format(value, options) {
if (typeof options === 'function') {
// handle format(value, fn)
return options(value);
} // handle special cases
if (value === Infinity) {
return 'Infinity';
} else if (value === -Infinity) {
return '-Infinity';
} else if (isNaN(value)) {
return 'NaN';
} // default values for options
var notation = 'auto';
var precision;
if (options) {
// determine notation from options
if (options.notation) {
notation = options.notation;
} // determine precision from options
if (Object(_is__WEBPACK_IMPORTED_MODULE_0__[/* isNumber */ "y"])(options)) {
precision = options;
} else if (Object(_is__WEBPACK_IMPORTED_MODULE_0__[/* isNumber */ "y"])(options.precision)) {
precision = options.precision;
}
} // handle the various notations
switch (notation) {
case 'fixed':
return toFixed(value, precision);
case 'exponential':
return toExponential(value, precision);
case 'engineering':
return toEngineering(value, precision);
case 'auto':
// remove trailing zeros after the decimal point
return toPrecision(value, precision, options && options).replace(/((\.\d*?)(0+))($|e)/, function () {
var digits = arguments[2];
var e = arguments[4];
return digits !== '.' ? digits + e : e;
});
default:
throw new Error('Unknown notation "' + notation + '". ' + 'Choose "auto", "exponential", or "fixed".');
}
}
/**
* Split a number into sign, coefficients, and exponent
* @param {number | string} value
* @return {SplitValue}
* Returns an object containing sign, coefficients, and exponent
*/
function splitNumber(value) {
// parse the input value
var match = String(value).toLowerCase().match(/^0*?(-?)(\d+\.?\d*)(e([+-]?\d+))?$/);
if (!match) {
throw new SyntaxError('Invalid number ' + value);
}
var sign = match[1];
var digits = match[2];
var exponent = parseFloat(match[4] || '0');
var dot = digits.indexOf('.');
exponent += dot !== -1 ? dot - 1 : digits.length - 1;
var coefficients = digits.replace('.', '') // remove the dot (must be removed before removing leading zeros)
.replace(/^0*/, function (zeros) {
// remove leading zeros, add their count to the exponent
exponent -= zeros.length;
return '';
}).replace(/0*$/, '') // remove trailing zeros
.split('').map(function (d) {
return parseInt(d);
});
if (coefficients.length === 0) {
coefficients.push(0);
exponent++;
}
return {
sign: sign,
coefficients: coefficients,
exponent: exponent
};
}
/**
* Format a number in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'
* @param {number | string} value
* @param {number} [precision] Optional number of significant figures to return.
*/
function toEngineering(value, precision) {
if (isNaN(value) || !isFinite(value)) {
return String(value);
}
var split = splitNumber(value);
var rounded = roundDigits(split, precision);
var e = rounded.exponent;
var c = rounded.coefficients; // find nearest lower multiple of 3 for exponent
var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;
if (Object(_is__WEBPACK_IMPORTED_MODULE_0__[/* isNumber */ "y"])(precision)) {
// add zeroes to give correct sig figs
while (precision > c.length || e - newExp + 1 > c.length) {
c.push(0);
}
} else {
// concatenate coefficients with necessary zeros
// add zeros if necessary (for example: 1e+8 -> 100e+6)
var missingZeros = Math.abs(e - newExp) - (c.length - 1);
for (var i = 0; i < missingZeros; i++) {
c.push(0);
}
} // find difference in exponents
var expDiff = Math.abs(e - newExp);
var decimalIdx = 1; // push decimal index over by expDiff times
while (expDiff > 0) {
decimalIdx++;
expDiff--;
} // if all coefficient values are zero after the decimal point and precision is unset, don't add a decimal value.
// otherwise concat with the rest of the coefficients
var decimals = c.slice(decimalIdx).join('');
var decimalVal = Object(_is__WEBPACK_IMPORTED_MODULE_0__[/* isNumber */ "y"])(precision) && decimals.length || decimals.match(/[1-9]/) ? '.' + decimals : '';
var str = c.slice(0, decimalIdx).join('') + decimalVal + 'e' + (e >= 0 ? '+' : '') + newExp.toString();
return rounded.sign + str;
}
/**
* Format a number with fixed notation.
* @param {number | string} value
* @param {number} [precision=undefined] Optional number of decimals after the
* decimal point. null by default.
*/
function toFixed(value, precision) {
if (isNaN(value) || !isFinite(value)) {
return String(value);
}
var splitValue = splitNumber(value);
var rounded = typeof precision === 'number' ? roundDigits(splitValue, splitValue.exponent + 1 + precision) : splitValue;
var c = rounded.coefficients;
var p = rounded.exponent + 1; // exponent may have changed
// append zeros if needed
var pp = p + (precision || 0);
if (c.length < pp) {
c = c.concat(zeros(pp - c.length));
} // prepend zeros if needed
if (p < 0) {
c = zeros(-p + 1).concat(c);
p = 1;
} // insert a dot if needed
if (p < c.length) {
c.splice(p, 0, p === 0 ? '0.' : '.');
}
return rounded.sign + c.join('');
}
/**
* Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'
* @param {number | string} value
* @param {number} [precision] Number of digits in formatted output.
* If not provided, the maximum available digits
* is used.
*/
function toExponential(value, precision) {
if (isNaN(value) || !isFinite(value)) {
return String(value);
} // round if needed, else create a clone
var split = splitNumber(value);
var rounded = precision ? roundDigits(split, precision) : split;
var c = rounded.coefficients;
var e = rounded.exponent; // append zeros if needed
if (c.length < precision) {
c = c.concat(zeros(precision - c.length));
} // format as `C.CCCe+EEE` or `C.CCCe-EEE`
var first = c.shift();
return rounded.sign + first + (c.length > 0 ? '.' + c.join('') : '') + 'e' + (e >= 0 ? '+' : '') + e;
}
/**
* Format a number with a certain precision
* @param {number | string} value
* @param {number} [precision=undefined] Optional number of digits.
* @param {{lowerExp: number | undefined, upperExp: number | undefined}} [options]
* By default:
* lowerExp = -3 (incl)
* upper = +5 (excl)
* @return {string}
*/
function toPrecision(value, precision, options) {
if (isNaN(value) || !isFinite(value)) {
return String(value);
} // determine lower and upper bound for exponential notation.
var lowerExp = options && options.lowerExp !== undefined ? options.lowerExp : -3;
var upperExp = options && options.upperExp !== undefined ? options.upperExp : 5;
var split = splitNumber(value);
var rounded = precision ? roundDigits(split, precision) : split;
if (rounded.exponent < lowerExp || rounded.exponent >= upperExp) {
// exponential notation
return toExponential(value, precision);
} else {
var c = rounded.coefficients;
var e = rounded.exponent; // append trailing zeros
if (c.length < precision) {
c = c.concat(zeros(precision - c.length));
} // append trailing zeros
// TODO: simplify the next statement
c = c.concat(zeros(e - c.length + 1 + (c.length < precision ? precision - c.length : 0))); // prepend zeros
c = zeros(-e).concat(c);
var dot = e > 0 ? e : 0;
if (dot < c.length - 1) {
c.splice(dot + 1, 0, '.');
}
return rounded.sign + c.join('');
}
}
/**
* Round the number of digits of a number *
* @param {SplitValue} split A value split with .splitNumber(value)
* @param {number} precision A positive integer
* @return {SplitValue}
* Returns an object containing sign, coefficients, and exponent
* with rounded digits
*/
function roundDigits(split, precision) {
// create a clone
var rounded = {
sign: split.sign,
coefficients: split.coefficients,
exponent: split.exponent
};
var c = rounded.coefficients; // prepend zeros if needed
while (precision <= 0) {
c.unshift(0);
rounded.exponent++;
precision++;
}
if (c.length > precision) {
var removed = c.splice(precision, c.length - precision);
if (removed[0] >= 5) {
var i = precision - 1;
c[i]++;
while (c[i] === 10) {
c.pop();
if (i === 0) {
c.unshift(0);
rounded.exponent++;
i++;
}
i--;
c[i]++;
}
}
}
return rounded;
}
/**
* Create an array filled with zeros.
* @param {number} length
* @return {Array}
*/
function zeros(length) {
var arr = [];
for (var i = 0; i < length; i++) {
arr.push(0);
}
return arr;
}
/**
* Count the number of significant digits of a number.
*
* For example:
* 2.34 returns 3
* 0.0034 returns 2
* 120.5e+30 returns 4
*
* @param {number} value
* @return {number} digits Number of significant digits
*/
function digits(value) {
return value.toExponential().replace(/e.*$/, '') // remove exponential notation
.replace(/^0\.?0*|\./, '') // remove decimal point and leading zeros
.length;
}
/**
* Minimum number added to one that makes the result different than one
*/
var DBL_EPSILON = Number.EPSILON || 2.2204460492503130808472633361816E-16;
/**
* Compares two floating point numbers.
* @param {number} x First value to compare
* @param {number} y Second value to compare
* @param {number} [epsilon] The maximum relative difference between x and y
* If epsilon is undefined or null, the function will
* test whether x and y are exactly equal.
* @return {boolean} whether the two numbers are nearly equal
*/
function nearlyEqual(x, y, epsilon) {
// if epsilon is null or undefined, test whether x and y are exactly equal
if (epsilon === null || epsilon === undefined) {
return x === y;
}
if (x === y) {
return true;
} // NaN
if (isNaN(x) || isNaN(y)) {
return false;
} // at this point x and y should be finite
if (isFinite(x) && isFinite(y)) {
// check numbers are very close, needed when comparing numbers near zero
var diff = Math.abs(x - y);
if (diff < DBL_EPSILON) {
return true;
} else {
// use relative error
return diff <= Math.max(Math.abs(x), Math.abs(y)) * epsilon;
}
} // Infinite and Number or negative Infinite and positive Infinite cases
return false;
}
/**
* Calculate the hyperbolic arccos of a number
* @param {number} x
* @return {number}
*/
var acosh = Math.acosh || function (x) {
return Math.log(Math.sqrt(x * x - 1) + x);
};
var asinh = Math.asinh || function (x) {
return Math.log(Math.sqrt(x * x + 1) + x);
};
/**
* Calculate the hyperbolic arctangent of a number
* @param {number} x
* @return {number}
*/
var atanh = Math.atanh || function (x) {
return Math.log((1 + x) / (1 - x)) / 2;
};
/**
* Calculate the hyperbolic cosine of a number
* @param {number} x
* @returns {number}
*/
var cosh = Math.cosh || function (x) {
return (Math.exp(x) + Math.exp(-x)) / 2;
};
/**
* Calculate the hyperbolic sine of a number
* @param {number} x
* @returns {number}
*/
var sinh = Math.sinh || function (x) {
return (Math.exp(x) - Math.exp(-x)) / 2;
};
/**
* Calculate the hyperbolic tangent of a number
* @param {number} x
* @returns {number}
*/
var tanh = Math.tanh || function (x) {
var e = Math.exp(2 * x);
return (e - 1) / (e + 1);
};
/***/ }),
/* 5 */
/***/ (function(module, __webpack_exports__, __webpack_require__) {
"use strict";
// EXPORTS
__webpack_require__.d(__webpack_exports__, "b", function() { return /* binding */ endsWith; });
__webpack_require__.d(__webpack_exports__, "d", function() { return /* binding */ string_format; });
__webpack_require__.d(__webpack_exports__, "e", function() { return /* binding */ stringify; });
__webpack_require__.d(__webpack_exports__, "c", function() { return /* binding */ string_escape; });
__webpack_require__.d(__webpack_exports__, "a", function() { return /* binding */ compareText; });
// EXTERNAL MODULE: ./src/utils/is.js
var is = __webpack_require__(1);
// EXTERNAL MODULE: ./src/utils/number.js
var number = __webpack_require__(4);
// CONCATENATED MODULE: ./src/utils/bignumber/formatter.js
/**
* Convert a BigNumber to a formatted string representation.
*
* Syntax:
*
* format(value)
* format(value, options)
* format(value, precision)
* format(value, fn)
*
* Where:
*
* {number} value The value to be formatted
* {Object} options An object with formatting options. Available options:
* {string} notation
* Number notation. Choose from:
* 'fixed' Always use regular number notation.
* For example '123.40' and '14000000'
* 'exponential' Always use exponential notation.
* For example '1.234e+2' and '1.4e+7'
* 'auto' (default) Regular number notation for numbers
* having an absolute value between
* `lower` and `upper` bounds, and uses
* exponential notation elsewhere.
* Lower bound is included, upper bound
* is excluded.
* For example '123.4' and '1.4e7'.
* {number} precision A number between 0 and 16 to round
* the digits of the number.
* In case of notations 'exponential',
* 'engineering', and 'auto',
* `precision` defines the total
* number of significant digits returned.
* In case of notation 'fixed',
* `precision` defines the number of
* significant digits after the decimal
* point.
* `precision` is undefined by default.
* {number} lowerExp Exponent determining the lower boundary
* for formatting a value with an exponent
* when `notation='auto`.
* Default value is `-3`.
* {number} upperExp Exponent determining the upper boundary
* for formatting a value with an exponent
* when `notation='auto`.
* Default value is `5`.
* {Function} fn A custom formatting function. Can be used to override the
* built-in notations. Function `fn` is called with `value` as
* parameter and must return a string. Is useful for example to
* format all values inside a matrix in a particular way.
*
* Examples:
*
* format(6.4) // '6.4'
* format(1240000) // '1.24e6'
* format(1/3) // '0.3333333333333333'
* format(1/3, 3) // '0.333'
* format(21385, 2) // '21000'
* format(12e8, {notation: 'fixed'}) // returns '1200000000'
* format(2.3, {notation: 'fixed', precision: 4}) // returns '2.3000'
* format(52.8, {notation: 'exponential'}) // returns '5.28e+1'
* format(12400, {notation: 'engineering'}) // returns '12.400e+3'
*
* @param {BigNumber} value
* @param {Object | Function | number} [options]
* @return {string} str The formatted value
*/
function format(value, options) {
if (typeof options === 'function') {
// handle format(value, fn)
return options(value);
} // handle special cases
if (!value.isFinite()) {
return value.isNaN() ? 'NaN' : value.gt(0) ? 'Infinity' : '-Infinity';
} // default values for options
var notation = 'auto';
var precision;
if (options !== undefined) {
// determine notation from options
if (options.notation) {
notation = options.notation;
} // determine precision from options
if (typeof options === 'number') {
precision = options;
} else if (options.precision) {
precision = options.precision;
}
} // handle the various notations
switch (notation) {
case 'fixed':
return toFixed(value, precision);
case 'exponential':
return toExponential(value, precision);
case 'engineering':
return toEngineering(value, precision);
case 'auto':
{
// determine lower and upper bound for exponential notation.
// TODO: implement support for upper and lower to be BigNumbers themselves
var lowerExp = options && options.lowerExp !== undefined ? options.lowerExp : -3;
var upperExp = options && options.upperExp !== undefined ? options.upperExp : 5; // handle special case zero
if (value.isZero()) return '0'; // determine whether or not to output exponential notation
var str;
var rounded = value.toSignificantDigits(precision);
var exp = rounded.e;
if (exp >= lowerExp && exp < upperExp) {
// normal number notation
str = rounded.toFixed();
} else {
// exponential notation
str = toExponential(value, precision);
} // remove trailing zeros after the decimal point
return str.replace(/((\.\d*?)(0+))($|e)/, function () {
var digits = arguments[2];
var e = arguments[4];
return digits !== '.' ? digits + e : e;
});
}
default:
throw new Error('Unknown notation "' + notation + '". ' + 'Choose "auto", "exponential", or "fixed".');
}
}
/**
* Format a BigNumber in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'
* @param {BigNumber | string} value
* @param {number} [precision] Optional number of significant figures to return.
*/
function toEngineering(value, precision) {
// find nearest lower multiple of 3 for exponent
var e = value.e;
var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3; // find difference in exponents, and calculate the value without exponent
var valueWithoutExp = value.mul(Math.pow(10, -newExp));
var valueStr = valueWithoutExp.toPrecision(precision);
if (valueStr.indexOf('e') !== -1) {
valueStr = valueWithoutExp.toString();
}
return valueStr + 'e' + (e >= 0 ? '+' : '') + newExp.toString();
}
/**
* Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'
* @param {BigNumber} value
* @param {number} [precision] Number of digits in formatted output.
* If not provided, the maximum available digits
* is used.
* @returns {string} str
*/
function toExponential(value, precision) {
if (precision !== undefined) {
return value.toExponential(precision - 1); // Note the offset of one
} else {
return value.toExponential();
}
}
/**
* Format a number with fixed notation.
* @param {BigNumber} value
* @param {number} [precision=undefined] Optional number of decimals after the
* decimal point. Undefined by default.
*/
function toFixed(value, precision) {
return value.toFixed(precision);
}
// CONCATENATED MODULE: ./src/utils/string.js
function _typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
/**
* Check if a text ends with a certain string.
* @param {string} text
* @param {string} search
*/
function endsWith(text, search) {
var start = text.length - search.length;
var end = text.length;
return text.substring(start, end) === search;
}
/**
* Format a value of any type into a string.
*
* Usage:
* math.format(value)
* math.format(value, precision)
*
* When value is a function:
*
* - When the function has a property `syntax`, it returns this
* syntax description.
* - In other cases, a string `'function'` is returned.
*
* When `value` is an Object:
*
* - When the object contains a property `format` being a function, this
* function is invoked as `value.format(options)` and the result is returned.
* - When the object has its own `toString` method, this method is invoked
* and the result is returned.
* - In other cases the function will loop over all object properties and
* return JSON object notation like '{"a": 2, "b": 3}'.
*
* Example usage:
* math.format(2/7) // '0.2857142857142857'
* math.format(math.pi, 3) // '3.14'
* math.format(new Complex(2, 3)) // '2 + 3i'
* math.format('hello') // '"hello"'
*
* @param {*} value Value to be stringified
* @param {Object | number | Function} [options] Formatting options. See
* lib/utils/number:format for a
* description of the available
* options.
* @return {string} str
*/
function string_format(value, options) {
if (typeof value === 'number') {
return Object(number["h" /* format */])(value, options);
}
if (Object(is["e" /* isBigNumber */])(value)) {
return format(value, options);
} // note: we use unsafe duck-typing here to check for Fractions, this is
// ok here since we're only invoking toString or concatenating its values
if (looksLikeFraction(value)) {
if (!options || options.fraction !== 'decimal') {
// output as ratio, like '1/3'
return value.s * value.n + '/' + value.d;
} else {
// output as decimal, like '0.(3)'
return value.toString();
}
}
if (Array.isArray(value)) {
return formatArray(value, options);
}
if (Object(is["I" /* isString */])(value)) {
return '"' + value + '"';
}
if (typeof value === 'function') {
return value.syntax ? String(value.syntax) : 'function';
}
if (value && _typeof(value) === 'object') {
if (typeof value.format === 'function') {
return value.format(options);
} else if (value && value.toString(options) !== {}.toString()) {
// this object has a non-native toString method, use that one
return value.toString(options);
} else {
var entries = Object.keys(value).map(function (key) {
return '"' + key + '": ' + string_format(value[key], options);
});
return '{' + entries.join(', ') + '}';
}
}
return String(value);
}
/**
* Stringify a value into a string enclosed in double quotes.
* Unescaped double quotes and backslashes inside the value are escaped.
* @param {*} value
* @return {string}
*/
function stringify(value) {
var text = String(value);
var escaped = '';
var i = 0;
while (i < text.length) {
var c = text.charAt(i);
if (c === '\\') {
escaped += c;
i++;
c = text.charAt(i);
if (c === '' || '"\\/bfnrtu'.indexOf(c) === -1) {
escaped += '\\'; // no valid escape character -> escape it
}
escaped += c;
} else if (c === '"') {
escaped += '\\"';
} else {
escaped += c;
}
i++;
}
return '"' + escaped + '"';
}
/**
* Escape special HTML characters
* @param {*} value
* @return {string}
*/
function string_escape(value) {
var text = String(value);
text = text.replace(/&/g, '&amp;').replace(/"/g, '&quot;').replace(/'/g, '&#39;').replace(/</g, '&lt;').replace(/>/g, '&gt;');
return text;
}
/**
* Recursively format an n-dimensional matrix
* Example output: "[[1, 2], [3, 4]]"
* @param {Array} array
* @param {Object | number | Function} [options] Formatting options. See
* lib/utils/number:format for a
* description of the available
* options.
* @returns {string} str
*/
function formatArray(array, options) {
if (Array.isArray(array)) {
var str = '[';
var len = array.length;
for (var i = 0; i < len; i++) {
if (i !== 0) {
str += ', ';
}
str += formatArray(array[i], options);
}
str += ']';
return str;
} else {
return string_format(array, options);
}
}
/**
* Check whether a value looks like a Fraction (unsafe duck-type check)
* @param {*} value
* @return {boolean}
*/
function looksLikeFraction(value) {
return value && _typeof(value) === 'object' && typeof value.s === 'number' && typeof value.n === 'number' && typeof value.d === 'number' || false;
}
/**
* Compare two strings
* @param {string} x
* @param {string} y
* @returns {number}
*/
function compareText(x, y) {
// we don't want to convert numbers to string, only accept string input
if (!Object(is["I" /* isString */])(x)) {
throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + Object(is["M" /* typeOf */])(x) + ', index: 0)');
}
if (!Object(is["I" /* isString */])(y)) {
throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + Object(is["M" /* typeOf */])(y) + ', index: 1)');
}
return x === y ? 0 : x > y ? 1 : -1;
}
/***/ }),
/* 6 */
/***/ (function(module, __webpack_exports__, __webpack_require__) {
"use strict";
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "a", function() { return DimensionError; });
/**
* Create a range error with the message:
* 'Dimension mismatch (<actual size> != <expected size>)'
* @param {number | number[]} actual The actual size
* @param {number | number[]} expected The expected size
* @param {string} [relation='!='] Optional relation between actual
* and expected size: '!=', '<', etc.
* @extends RangeError
*/
function DimensionError(actual, expected, relation) {
if (!(this instanceof DimensionError)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
this.actual = actual;
this.expected = expected;
this.relation = relation;
this.message = 'Dimension mismatch (' + (Array.isArray(actual) ? '[' + actual.join(', ') + ']' : actual) + ' ' + (this.relation || '!=') + ' ' + (Array.isArray(expected) ? '[' + expected.join(', ') + ']' : expected) + ')';
this.stack = new Error().stack;
}
DimensionError.prototype = new RangeError();
DimensionError.prototype.constructor = RangeError;
DimensionError.prototype.name = 'DimensionError';
DimensionError.prototype.isDimensionError = true;
/***/ }),
/* 7 */,
/* 8 */
/***/ (function(module, exports, __webpack_require__) {
var __WEBPACK_AMD_DEFINE_ARRAY__, __WEBPACK_AMD_DEFINE_RESULT__;/**
* @license Complex.js v2.0.11 11/02/2016
*
* Copyright (c) 2016, Robert Eisele (robert@xarg.org)
* Dual licensed under the MIT or GPL Version 2 licenses.
**/
/**
*
* This class allows the manipulation of complex numbers.
* You can pass a complex number in different formats. Either as object, double, string or two integer parameters.
*
* Object form
* { re: <real>, im: <imaginary> }
* { arg: <angle>, abs: <radius> }
* { phi: <angle>, r: <radius> }
*
* Array / Vector form
* [ real, imaginary ]
*
* Double form
* 99.3 - Single double value
*
* String form
* '23.1337' - Simple real number
* '15+3i' - a simple complex number
* '3-i' - a simple complex number
*
* Example:
*
* var c = new Complex('99.3+8i');
* c.mul({r: 3, i: 9}).div(4.9).sub(3, 2);
*
*/
(function(root) {
'use strict';
var cosh = function(x) {
return (Math.exp(x) + Math.exp(-x)) * 0.5;
};
var sinh = function(x) {
return (Math.exp(x) - Math.exp(-x)) * 0.5;
};
/**
* Calculates cos(x) - 1 using Taylor series if x is small.
*
* @param {number} x
* @returns {number} cos(x) - 1
*/
var cosm1 = function(x) {
var limit = Math.PI/4;
if (x < -limit || x > limit) {
return (Math.cos(x) - 1.0);
}
var xx = x * x;
return xx *
(-0.5 + xx *
(1/24 + xx *
(-1/720 + xx *
(1/40320 + xx *
(-1/3628800 + xx *
(1/4790014600 + xx *
(-1/87178291200 + xx *
(1/20922789888000)
)
)
)
)
)
)
)
};
var hypot = function(x, y) {
var a = Math.abs(x);
var b = Math.abs(y);
if (a < 3000 && b < 3000) {
return Math.sqrt(a * a + b * b);
}
if (a < b) {
a = b;
b = x / y;
} else {
b = y / x;
}
return a * Math.sqrt(1 + b * b);
};
var parser_exit = function() {
throw SyntaxError('Invalid Param');
};
/**
* Calculates log(sqrt(a^2+b^2)) in a way to avoid overflows
*
* @param {number} a
* @param {number} b
* @returns {number}
*/
function logHypot(a, b) {
var _a = Math.abs(a);
var _b = Math.abs(b);
if (a === 0) {
return Math.log(_b);
}
if (b === 0) {
return Math.log(_a);
}
if (_a < 3000 && _b < 3000) {
return Math.log(a * a + b * b) * 0.5;
}
/* I got 4 ideas to compute this property without overflow:
*
* Testing 1000000 times with random samples for a,b ∈ [1, 1000000000] against a big decimal library to get an error estimate
*
* 1. Only eliminate the square root: (OVERALL ERROR: 3.9122483030951116e-11)
Math.log(a * a + b * b) / 2
*
*
* 2. Try to use the non-overflowing pythagoras: (OVERALL ERROR: 8.889760039210159e-10)
var fn = function(a, b) {
a = Math.abs(a);
b = Math.abs(b);
var t = Math.min(a, b);
a = Math.max(a, b);
t = t / a;
return Math.log(a) + Math.log(1 + t * t) / 2;
};
* 3. Abuse the identity cos(atan(y/x) = x / sqrt(x^2+y^2): (OVERALL ERROR: 3.4780178737037204e-10)
Math.log(a / Math.cos(Math.atan2(b, a)))
* 4. Use 3. and apply log rules: (OVERALL ERROR: 1.2014087502620896e-9)
Math.log(a) - Math.log(Math.cos(Math.atan2(b, a)))
*/
return Math.log(a / Math.cos(Math.atan2(b, a)));
}
var parse = function(a, b) {
var z = {'re': 0, 'im': 0};
if (a === undefined || a === null) {
z['re'] =
z['im'] = 0;
} else if (b !== undefined) {
z['re'] = a;
z['im'] = b;
} else
switch (typeof a) {
case 'object':
if ('im' in a && 're' in a) {
z['re'] = a['re'];
z['im'] = a['im'];
} else if ('abs' in a && 'arg' in a) {
if (!Number.isFinite(a['abs']) && Number.isFinite(a['arg'])) {
return Complex['INFINITY'];
}
z['re'] = a['abs'] * Math.cos(a['arg']);
z['im'] = a['abs'] * Math.sin(a['arg']);
} else if ('r' in a && 'phi' in a) {
if (!Number.isFinite(a['r']) && Number.isFinite(a['phi'])) {
return Complex['INFINITY'];
}
z['re'] = a['r'] * Math.cos(a['phi']);
z['im'] = a['r'] * Math.sin(a['phi']);
} else if (a.length === 2) { // Quick array check
z['re'] = a[0];
z['im'] = a[1];
} else {
parser_exit();
}
break;
case 'string':
z['im'] = /* void */
z['re'] = 0;
var tokens = a.match(/\d+\.?\d*e[+-]?\d+|\d+\.?\d*|\.\d+|./g);
var plus = 1;
var minus = 0;
if (tokens === null) {
parser_exit();
}
for (var i = 0; i < tokens.length; i++) {
var c = tokens[i];
if (c === ' ' || c === '\t' || c === '\n') {
/* void */
} else if (c === '+') {
plus++;
} else if (c === '-') {
minus++;
} else if (c === 'i' || c === 'I') {
if (plus + minus === 0) {
parser_exit();
}
if (tokens[i + 1] !== ' ' && !isNaN(tokens[i + 1])) {
z['im'] += parseFloat((minus % 2 ? '-' : '') + tokens[i + 1]);
i++;
} else {
z['im'] += parseFloat((minus % 2 ? '-' : '') + '1');
}
plus = minus = 0;
} else {
if (plus + minus === 0 || isNaN(c)) {
parser_exit();
}
if (tokens[i + 1] === 'i' || tokens[i + 1] === 'I') {
z['im'] += parseFloat((minus % 2 ? '-' : '') + c);
i++;
} else {
z['re'] += parseFloat((minus % 2 ? '-' : '') + c);
}
plus = minus = 0;
}
}
// Still something on the stack
if (plus + minus > 0) {
parser_exit();
}
break;
case 'number':
z['im'] = 0;
z['re'] = a;
break;
default:
parser_exit();
}
if (isNaN(z['re']) || isNaN(z['im'])) {
// If a calculation is NaN, we treat it as NaN and don't throw
//parser_exit();
}
return z;
};
/**
* @constructor
* @returns {Complex}
*/
function Complex(a, b) {
if (!(this instanceof Complex)) {
return new Complex(a, b);
}
var z = parse(a, b);
this['re'] = z['re'];
this['im'] = z['im'];
}
Complex.prototype = {
're': 0,
'im': 0,
/**
* Calculates the sign of a complex number, which is a normalized complex
*
* @returns {Complex}
*/
'sign': function() {
var abs = this['abs']();
return new Complex(
this['re'] / abs,
this['im'] / abs);
},
/**
* Adds two complex numbers
*
* @returns {Complex}
*/
'add': function(a, b) {
var z = new Complex(a, b);
// Infinity + Infinity = NaN
if (this['isInfinite']() && z['isInfinite']()) {
return Complex['NAN'];
}
// Infinity + z = Infinity { where z != Infinity }
if (this['isInfinite']() || z['isInfinite']()) {
return Complex['INFINITY'];
}
return new Complex(
this['re'] + z['re'],
this['im'] + z['im']);
},
/**
* Subtracts two complex numbers
*
* @returns {Complex}
*/
'sub': function(a, b) {
var z = new Complex(a, b);
// Infinity - Infinity = NaN
if (this['isInfinite']() && z['isInfinite']()) {
return Complex['NAN'];
}
// Infinity - z = Infinity { where z != Infinity }
if (this['isInfinite']() || z['isInfinite']()) {
return Complex['INFINITY'];
}
return new Complex(
this['re'] - z['re'],
this['im'] - z['im']);
},
/**
* Multiplies two complex numbers
*
* @returns {Complex}
*/
'mul': function(a, b) {
var z = new Complex(a, b);
// Infinity * 0 = NaN
if ((this['isInfinite']() && z['isZero']()) || (this['isZero']() && z['isInfinite']())) {
return Complex['NAN'];
}
// Infinity * z = Infinity { where z != 0 }
if (this['isInfinite']() || z['isInfinite']()) {
return Complex['INFINITY'];
}
// Short circuit for real values
if (z['im'] === 0 && this['im'] === 0) {
return new Complex(this['re'] * z['re'], 0);
}
return new Complex(
this['re'] * z['re'] - this['im'] * z['im'],
this['re'] * z['im'] + this['im'] * z['re']);
},
/**
* Divides two complex numbers
*
* @returns {Complex}
*/
'div': function(a, b) {
var z = new Complex(a, b);
// 0 / 0 = NaN and Infinity / Infinity = NaN
if ((this['isZero']() && z['isZero']()) || (this['isInfinite']() && z['isInfinite']())) {
return Complex['NAN'];
}
// Infinity / 0 = Infinity
if (this['isInfinite']() || z['isZero']()) {
return Complex['INFINITY'];
}
// 0 / Infinity = 0
if (this['isZero']() || z['isInfinite']()) {
return Complex['ZERO'];
}
a = this['re'];
b = this['im'];
var c = z['re'];
var d = z['im'];
var t, x;
if (0 === d) {
// Divisor is real
return new Complex(a / c, b / c);
}
if (Math.abs(c) < Math.abs(d)) {
x = c / d;
t = c * x + d;
return new Complex(
(a * x + b) / t,
(b * x - a) / t);
} else {
x = d / c;
t = d * x + c;
return new Complex(
(a + b * x) / t,
(b - a * x) / t);
}
},
/**
* Calculate the power of two complex numbers
*
* @returns {Complex}
*/
'pow': function(a, b) {
var z = new Complex(a, b);
a = this['re'];
b = this['im'];
if (z['isZero']()) {
return Complex['ONE'];
}
// If the exponent is real
if (z['im'] === 0) {
if (b === 0 && a >= 0) {
return new Complex(Math.pow(a, z['re']), 0);
} else if (a === 0) { // If base is fully imaginary
switch ((z['re'] % 4 + 4) % 4) {
case 0:
return new Complex(Math.pow(b, z['re']), 0);
case 1:
return new Complex(0, Math.pow(b, z['re']));
case 2:
return new Complex(-Math.pow(b, z['re']), 0);
case 3:
return new Complex(0, -Math.pow(b, z['re']));
}
}
}
/* I couldn't find a good formula, so here is a derivation and optimization
*
* z_1^z_2 = (a + bi)^(c + di)
* = exp((c + di) * log(a + bi)
* = pow(a^2 + b^2, (c + di) / 2) * exp(i(c + di)atan2(b, a))
* =>...
* Re = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * cos(d * log(a^2 + b^2) / 2 + c * atan2(b, a))
* Im = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * sin(d * log(a^2 + b^2) / 2 + c * atan2(b, a))
*
* =>...
* Re = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * cos(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))
* Im = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * sin(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))
*
* =>
* Re = exp(c * logsq2 - d * arg(z_1)) * cos(d * logsq2 + c * arg(z_1))
* Im = exp(c * logsq2 - d * arg(z_1)) * sin(d * logsq2 + c * arg(z_1))
*
*/
if (a === 0 && b === 0 && z['re'] > 0 && z['im'] >= 0) {
return Complex['ZERO'];
}
var arg = Math.atan2(b, a);
var loh = logHypot(a, b);
a = Math.exp(z['re'] * loh - z['im'] * arg);
b = z['im'] * loh + z['re'] * arg;
return new Complex(
a * Math.cos(b),
a * Math.sin(b));
},
/**
* Calculate the complex square root
*
* @returns {Complex}
*/
'sqrt': function() {
var a = this['re'];
var b = this['im'];
var r = this['abs']();
var re, im;
if (a >= 0) {
if (b === 0) {
return new Complex(Math.sqrt(a), 0);
}
re = 0.5 * Math.sqrt(2.0 * (r + a));
} else {
re = Math.abs(b) / Math.sqrt(2 * (r - a));
}
if (a <= 0) {
im = 0.5 * Math.sqrt(2.0 * (r - a));
} else {
im = Math.abs(b) / Math.sqrt(2 * (r + a));
}
return new Complex(re, b < 0 ? -im : im);
},
/**
* Calculate the complex exponent
*
* @returns {Complex}
*/
'exp': function() {
var tmp = Math.exp(this['re']);
if (this['im'] === 0) {
//return new Complex(tmp, 0);
}
return new Complex(
tmp * Math.cos(this['im']),
tmp * Math.sin(this['im']));
},
/**
* Calculate the complex exponent and subtracts one.
*
* This may be more accurate than `Complex(x).exp().sub(1)` if
* `x` is small.
*
* @returns {Complex}
*/
'expm1': function() {
/**
* exp(a + i*b) - 1
= exp(a) * (cos(b) + j*sin(b)) - 1
= expm1(a)*cos(b) + cosm1(b) + j*exp(a)*sin(b)
*/
var a = this['re'];
var b = this['im'];
return new Complex(
Math.expm1(a) * Math.cos(b) + cosm1(b),
Math.exp(a) * Math.sin(b));
},
/**
* Calculate the natural log
*
* @returns {Complex}
*/
'log': function() {
var a = this['re'];
var b = this['im'];
if (b === 0 && a > 0) {
//return new Complex(Math.log(a), 0);
}
return new Complex(
logHypot(a, b),
Math.atan2(b, a));
},
/**
* Calculate the magnitude of the complex number
*
* @returns {number}
*/
'abs': function() {
return hypot(this['re'], this['im']);
},
/**
* Calculate the angle of the complex number
*
* @returns {number}
*/
'arg': function() {
return Math.atan2(this['im'], this['re']);
},
/**
* Calculate the sine of the complex number
*
* @returns {Complex}
*/
'sin': function() {
// sin(c) = (e^b - e^(-b)) / (2i)
var a = this['re'];
var b = this['im'];
return new Complex(
Math.sin(a) * cosh(b),
Math.cos(a) * sinh(b));
},
/**
* Calculate the cosine
*
* @returns {Complex}
*/
'cos': function() {
// cos(z) = (e^b + e^(-b)) / 2
var a = this['re'];
var b = this['im'];
return new Complex(
Math.cos(a) * cosh(b),
-Math.sin(a) * sinh(b));
},
/**
* Calculate the tangent
*
* @returns {Complex}
*/
'tan': function() {
// tan(c) = (e^(ci) - e^(-ci)) / (i(e^(ci) + e^(-ci)))
var a = 2 * this['re'];
var b = 2 * this['im'];
var d = Math.cos(a) + cosh(b);
return new Complex(
Math.sin(a) / d,
sinh(b) / d);
},
/**
* Calculate the cotangent
*
* @returns {Complex}
*/
'cot': function() {
// cot(c) = i(e^(ci) + e^(-ci)) / (e^(ci) - e^(-ci))
var a = 2 * this['re'];
var b = 2 * this['im'];
var d = Math.cos(a) - cosh(b);
return new Complex(
-Math.sin(a) / d,
sinh(b) / d);
},
/**
* Calculate the secant
*
* @returns {Complex}
*/
'sec': function() {
// sec(c) = 2 / (e^(ci) + e^(-ci))
var a = this['re'];
var b = this['im'];
var d = 0.5 * cosh(2 * b) + 0.5 * Math.cos(2 * a);
return new Complex(
Math.cos(a) * cosh(b) / d,
Math.sin(a) * sinh(b) / d);
},
/**
* Calculate the cosecans
*
* @returns {Complex}
*/
'csc': function() {
// csc(c) = 2i / (e^(ci) - e^(-ci))
var a = this['re'];
var b = this['im'];
var d = 0.5 * cosh(2 * b) - 0.5 * Math.cos(2 * a);
return new Complex(
Math.sin(a) * cosh(b) / d,
-Math.cos(a) * sinh(b) / d);
},
/**
* Calculate the complex arcus sinus
*
* @returns {Complex}
*/
'asin': function() {
// asin(c) = -i * log(ci + sqrt(1 - c^2))
var a = this['re'];
var b = this['im'];
var t1 = new Complex(
b * b - a * a + 1,
-2 * a * b)['sqrt']();
var t2 = new Complex(
t1['re'] - b,
t1['im'] + a)['log']();
return new Complex(t2['im'], -t2['re']);
},
/**
* Calculate the complex arcus cosinus
*
* @returns {Complex}
*/
'acos': function() {
// acos(c) = i * log(c - i * sqrt(1 - c^2))
var a = this['re'];
var b = this['im'];
var t1 = new Complex(
b * b - a * a + 1,
-2 * a * b)['sqrt']();
var t2 = new Complex(
t1['re'] - b,
t1['im'] + a)['log']();
return new Complex(Math.PI / 2 - t2['im'], t2['re']);
},
/**
* Calculate the complex arcus tangent
*
* @returns {Complex}
*/
'atan': function() {
// atan(c) = i / 2 log((i + x) / (i - x))
var a = this['re'];
var b = this['im'];
if (a === 0) {
if (b === 1) {
return new Complex(0, Infinity);
}
if (b === -1) {
return new Complex(0, -Infinity);
}
}
var d = a * a + (1.0 - b) * (1.0 - b);
var t1 = new Complex(
(1 - b * b - a * a) / d,
-2 * a / d).log();
return new Complex(-0.5 * t1['im'], 0.5 * t1['re']);
},
/**
* Calculate the complex arcus cotangent
*
* @returns {Complex}
*/
'acot': function() {
// acot(c) = i / 2 log((c - i) / (c + i))
var a = this['re'];
var b = this['im'];
if (b === 0) {
return new Complex(Math.atan2(1, a), 0);
}
var d = a * a + b * b;
return (d !== 0)
? new Complex(
a / d,
-b / d).atan()
: new Complex(
(a !== 0) ? a / 0 : 0,
(b !== 0) ? -b / 0 : 0).atan();
},
/**
* Calculate the complex arcus secant
*
* @returns {Complex}
*/
'asec': function() {
// asec(c) = -i * log(1 / c + sqrt(1 - i / c^2))
var a = this['re'];
var b = this['im'];
if (a === 0 && b === 0) {
return new Complex(0, Infinity);
}
var d = a * a + b * b;
return (d !== 0)
? new Complex(
a / d,
-b / d).acos()
: new Complex(
(a !== 0) ? a / 0 : 0,
(b !== 0) ? -b / 0 : 0).acos();
},
/**
* Calculate the complex arcus cosecans
*
* @returns {Complex}
*/
'acsc': function() {
// acsc(c) = -i * log(i / c + sqrt(1 - 1 / c^2))
var a = this['re'];
var b = this['im'];
if (a === 0 && b === 0) {
return new Complex(Math.PI / 2, Infinity);
}
var d = a * a + b * b;
return (d !== 0)
? new Complex(
a / d,
-b / d).asin()
: new Complex(
(a !== 0) ? a / 0 : 0,
(b !== 0) ? -b / 0 : 0).asin();
},
/**
* Calculate the complex sinh
*
* @returns {Complex}
*/
'sinh': function() {
// sinh(c) = (e^c - e^-c) / 2
var a = this['re'];
var b = this['im'];
return new Complex(
sinh(a) * Math.cos(b),
cosh(a) * Math.sin(b));
},
/**
* Calculate the complex cosh
*
* @returns {Complex}
*/
'cosh': function() {
// cosh(c) = (e^c + e^-c) / 2
var a = this['re'];
var b = this['im'];
return new Complex(
cosh(a) * Math.cos(b),
sinh(a) * Math.sin(b));
},
/**
* Calculate the complex tanh
*
* @returns {Complex}
*/
'tanh': function() {
// tanh(c) = (e^c - e^-c) / (e^c + e^-c)
var a = 2 * this['re'];
var b = 2 * this['im'];
var d = cosh(a) + Math.cos(b);
return new Complex(
sinh(a) / d,
Math.sin(b) / d);
},
/**
* Calculate the complex coth
*
* @returns {Complex}
*/
'coth': function() {
// coth(c) = (e^c + e^-c) / (e^c - e^-c)
var a = 2 * this['re'];
var b = 2 * this['im'];
var d = cosh(a) - Math.cos(b);
return new Complex(
sinh(a) / d,
-Math.sin(b) / d);
},
/**
* Calculate the complex coth
*
* @returns {Complex}
*/
'csch': function() {
// csch(c) = 2 / (e^c - e^-c)
var a = this['re'];
var b = this['im'];
var d = Math.cos(2 * b) - cosh(2 * a);
return new Complex(
-2 * sinh(a) * Math.cos(b) / d,
2 * cosh(a) * Math.sin(b) / d);
},
/**
* Calculate the complex sech
*
* @returns {Complex}
*/
'sech': function() {
// sech(c) = 2 / (e^c + e^-c)
var a = this['re'];
var b = this['im'];
var d = Math.cos(2 * b) + cosh(2 * a);
return new Complex(
2 * cosh(a) * Math.cos(b) / d,
-2 * sinh(a) * Math.sin(b) / d);
},
/**
* Calculate the complex asinh
*
* @returns {Complex}
*/
'asinh': function() {
// asinh(c) = log(c + sqrt(c^2 + 1))
var tmp = this['im'];
this['im'] = -this['re'];
this['re'] = tmp;
var res = this['asin']();
this['re'] = -this['im'];
this['im'] = tmp;
tmp = res['re'];
res['re'] = -res['im'];
res['im'] = tmp;
return res;
},
/**
* Calculate the complex asinh
*
* @returns {Complex}
*/
'acosh': function() {
// acosh(c) = log(c + sqrt(c^2 - 1))
var res = this['acos']();
if (res['im'] <= 0) {
var tmp = res['re'];
res['re'] = -res['im'];
res['im'] = tmp;
} else {
var tmp = res['im'];
res['im'] = -res['re'];
res['re'] = tmp;
}
return res;
},
/**
* Calculate the complex atanh
*
* @returns {Complex}
*/
'atanh': function() {
// atanh(c) = log((1+c) / (1-c)) / 2
var a = this['re'];
var b = this['im'];
var noIM = a > 1 && b === 0;
var oneMinus = 1 - a;
var onePlus = 1 + a;
var d = oneMinus * oneMinus + b * b;
var x = (d !== 0)
? new Complex(
(onePlus * oneMinus - b * b) / d,
(b * oneMinus + onePlus * b) / d)
: new Complex(
(a !== -1) ? (a / 0) : 0,
(b !== 0) ? (b / 0) : 0);
var temp = x['re'];
x['re'] = logHypot(x['re'], x['im']) / 2;
x['im'] = Math.atan2(x['im'], temp) / 2;
if (noIM) {
x['im'] = -x['im'];
}
return x;
},
/**
* Calculate the complex acoth
*
* @returns {Complex}
*/
'acoth': function() {
// acoth(c) = log((c+1) / (c-1)) / 2
var a = this['re'];
var b = this['im'];
if (a === 0 && b === 0) {
return new Complex(0, Math.PI / 2);
}
var d = a * a + b * b;
return (d !== 0)
? new Complex(
a / d,
-b / d).atanh()
: new Complex(
(a !== 0) ? a / 0 : 0,
(b !== 0) ? -b / 0 : 0).atanh();
},
/**
* Calculate the complex acsch
*
* @returns {Complex}
*/
'acsch': function() {
// acsch(c) = log((1+sqrt(1+c^2))/c)
var a = this['re'];
var b = this['im'];
if (b === 0) {
return new Complex(
(a !== 0)
? Math.log(a + Math.sqrt(a * a + 1))
: Infinity, 0);
}
var d = a * a + b * b;
return (d !== 0)
? new Complex(
a / d,
-b / d).asinh()
: new Complex(
(a !== 0) ? a / 0 : 0,
(b !== 0) ? -b / 0 : 0).asinh();
},
/**
* Calculate the complex asech
*
* @returns {Complex}
*/
'asech': function() {
// asech(c) = log((1+sqrt(1-c^2))/c)
var a = this['re'];
var b = this['im'];
if (this['isZero']()) {
return Complex['INFINITY'];
}
var d = a * a + b * b;
return (d !== 0)
? new Complex(
a / d,
-b / d).acosh()
: new Complex(
(a !== 0) ? a / 0 : 0,
(b !== 0) ? -b / 0 : 0).acosh();
},
/**
* Calculate the complex inverse 1/z
*
* @returns {Complex}
*/
'inverse': function() {
// 1 / 0 = Infinity and 1 / Infinity = 0
if (this['isZero']()) {
return Complex['INFINITY'];
}
if (this['isInfinite']()) {
return Complex['ZERO'];
}
var a = this['re'];
var b = this['im'];
var d = a * a + b * b;
return new Complex(a / d, -b / d);
},
/**
* Returns the complex conjugate
*
* @returns {Complex}
*/
'conjugate': function() {
return new Complex(this['re'], -this['im']);
},
/**
* Gets the negated complex number
*
* @returns {Complex}
*/
'neg': function() {
return new Complex(-this['re'], -this['im']);
},
/**
* Ceils the actual complex number
*
* @returns {Complex}
*/
'ceil': function(places) {
places = Math.pow(10, places || 0);
return new Complex(
Math.ceil(this['re'] * places) / places,
Math.ceil(this['im'] * places) / places);
},
/**
* Floors the actual complex number
*
* @returns {Complex}
*/
'floor': function(places) {
places = Math.pow(10, places || 0);
return new Complex(
Math.floor(this['re'] * places) / places,
Math.floor(this['im'] * places) / places);
},
/**
* Ceils the actual complex number
*
* @returns {Complex}
*/
'round': function(places) {
places = Math.pow(10, places || 0);
return new Complex(
Math.round(this['re'] * places) / places,
Math.round(this['im'] * places) / places);
},
/**
* Compares two complex numbers
*
* **Note:** new Complex(Infinity).equals(Infinity) === false
*
* @returns {boolean}
*/
'equals': function(a, b) {
var z = new Complex(a, b);
return Math.abs(z['re'] - this['re']) <= Complex['EPSILON'] &&
Math.abs(z['im'] - this['im']) <= Complex['EPSILON'];
},
/**
* Clones the actual object
*
* @returns {Complex}
*/
'clone': function() {
return new Complex(this['re'], this['im']);
},
/**
* Gets a string of the actual complex number
*
* @returns {string}
*/
'toString': function() {
var a = this['re'];
var b = this['im'];
var ret = '';
if (this['isNaN']()) {
return 'NaN';
}
if (this['isZero']()) {
return '0';
}
if (this['isInfinite']()) {
return 'Infinity';
}
if (a !== 0) {
ret += a;
}
if (b !== 0) {
if (a !== 0) {
ret += b < 0 ? ' - ' : ' + ';
} else if (b < 0) {
ret += '-';
}
b = Math.abs(b);
if (1 !== b) {
ret += b;
}
ret += 'i';
}
if (!ret)
return '0';
return ret;
},
/**
* Returns the actual number as a vector
*
* @returns {Array}
*/
'toVector': function() {
return [this['re'], this['im']];
},
/**
* Returns the actual real value of the current object
*
* @returns {number|null}
*/
'valueOf': function() {
if (this['im'] === 0) {
return this['re'];
}
return null;
},
/**
* Determines whether a complex number is not on the Riemann sphere.
*
* @returns {boolean}
*/
'isNaN': function() {
return isNaN(this['re']) || isNaN(this['im']);
},
/**
* Determines whether or not a complex number is at the zero pole of the
* Riemann sphere.
*
* @returns {boolean}
*/
'isZero': function() {
return (
(this['re'] === 0 || this['re'] === -0) &&
(this['im'] === 0 || this['im'] === -0)
);
},
/**
* Determines whether a complex number is not at the infinity pole of the
* Riemann sphere.
*
* @returns {boolean}
*/
'isFinite': function() {
return isFinite(this['re']) && isFinite(this['im']);
},
/**
* Determines whether or not a complex number is at the infinity pole of the
* Riemann sphere.
*
* @returns {boolean}
*/
'isInfinite': function() {
return !(this['isNaN']() || this['isFinite']());
}
};
Complex['ZERO'] = new Complex(0, 0);
Complex['ONE'] = new Complex(1, 0);
Complex['I'] = new Complex(0, 1);
Complex['PI'] = new Complex(Math.PI, 0);
Complex['E'] = new Complex(Math.E, 0);
Complex['INFINITY'] = new Complex(Infinity, Infinity);
Complex['NAN'] = new Complex(NaN, NaN);
Complex['EPSILON'] = 1e-16;
if (true) {
!(__WEBPACK_AMD_DEFINE_ARRAY__ = [], __WEBPACK_AMD_DEFINE_RESULT__ = (function() {
return Complex;
}).apply(exports, __WEBPACK_AMD_DEFINE_ARRAY__),
__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));
} else {}
})(this);
/***/ }),
/* 9 */
/***/ (function(module, __webpack_exports__, __webpack_require__) {
"use strict";
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "a", function() { return IndexError; });
/**
* Create a range error with the message:
* 'Index out of range (index < min)'
* 'Index out of range (index < max)'
*
* @param {number} index The actual index
* @param {number} [min=0] Minimum index (included)
* @param {number} [max] Maximum index (excluded)
* @extends RangeError
*/
function IndexError(index, min, max) {
if (!(this instanceof IndexError)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
this.index = index;
if (arguments.length < 3) {
this.min = 0;
this.max = min;
} else {
this.min = min;
this.max = max;
}
if (this.min !== undefined && this.index < this.min) {
this.message = 'Index out of range (' + this.index + ' < ' + this.min + ')';
} else if (this.max !== undefined && this.index >= this.max) {
this.message = 'Index out of range (' + this.index + ' > ' + (this.max - 1) + ')';
} else {
this.message = 'Index out of range (' + this.index + ')';
}
this.stack = new Error().stack;
}
IndexError.prototype = new RangeError();
IndexError.prototype.constructor = RangeError;
IndexError.prototype.name = 'IndexError';
IndexError.prototype.isIndexError = true;
/***/ }),
/* 10 */
/***/ (function(module, exports, __webpack_require__) {
var __WEBPACK_AMD_DEFINE_ARRAY__, __WEBPACK_AMD_DEFINE_RESULT__;/**
* @license Fraction.js v4.0.12 09/09/2015
* http://www.xarg.org/2014/03/rational-numbers-in-javascript/
*
* Copyright (c) 2015, Robert Eisele (robert@xarg.org)
* Dual licensed under the MIT or GPL Version 2 licenses.
**/
/**
*
* This class offers the possibility to calculate fractions.
* You can pass a fraction in different formats. Either as array, as double, as string or as an integer.
*
* Array/Object form
* [ 0 => <nominator>, 1 => <denominator> ]
* [ n => <nominator>, d => <denominator> ]
*
* Integer form
* - Single integer value
*
* Double form
* - Single double value
*
* String form
* 123.456 - a simple double
* 123/456 - a string fraction
* 123.'456' - a double with repeating decimal places
* 123.(456) - synonym
* 123.45'6' - a double with repeating last place
* 123.45(6) - synonym
*
* Example:
*
* var f = new Fraction("9.4'31'");
* f.mul([-4, 3]).div(4.9);
*
*/
(function(root) {
"use strict";
// Maximum search depth for cyclic rational numbers. 2000 should be more than enough.
// Example: 1/7 = 0.(142857) has 6 repeating decimal places.
// If MAX_CYCLE_LEN gets reduced, long cycles will not be detected and toString() only gets the first 10 digits
var MAX_CYCLE_LEN = 2000;
// Parsed data to avoid calling "new" all the time
var P = {
"s": 1,
"n": 0,
"d": 1
};
function createError(name) {
function errorConstructor() {
var temp = Error.apply(this, arguments);
temp['name'] = this['name'] = name;
this['stack'] = temp['stack'];
this['message'] = temp['message'];
}
/**
* Error constructor
*
* @constructor
*/
function IntermediateInheritor() {}
IntermediateInheritor.prototype = Error.prototype;
errorConstructor.prototype = new IntermediateInheritor();
return errorConstructor;
}
var DivisionByZero = Fraction['DivisionByZero'] = createError('DivisionByZero');
var InvalidParameter = Fraction['InvalidParameter'] = createError('InvalidParameter');
function assign(n, s) {
if (isNaN(n = parseInt(n, 10))) {
throwInvalidParam();
}
return n * s;
}
function throwInvalidParam() {
throw new InvalidParameter();
}
var parse = function(p1, p2) {
var n = 0, d = 1, s = 1;
var v = 0, w = 0, x = 0, y = 1, z = 1;
var A = 0, B = 1;
var C = 1, D = 1;
var N = 10000000;
var M;
if (p1 === undefined || p1 === null) {
/* void */
} else if (p2 !== undefined) {
n = p1;
d = p2;
s = n * d;
} else
switch (typeof p1) {
case "object":
{
if ("d" in p1 && "n" in p1) {
n = p1["n"];
d = p1["d"];
if ("s" in p1)
n *= p1["s"];
} else if (0 in p1) {
n = p1[0];
if (1 in p1)
d = p1[1];
} else {
throwInvalidParam();
}
s = n * d;
break;
}
case "number":
{
if (p1 < 0) {
s = p1;
p1 = -p1;
}
if (p1 % 1 === 0) {
n = p1;
} else if (p1 > 0) { // check for != 0, scale would become NaN (log(0)), which converges really slow
if (p1 >= 1) {
z = Math.pow(10, Math.floor(1 + Math.log(p1) / Math.LN10));
p1 /= z;
}
// Using Farey Sequences
// http://www.johndcook.com/blog/2010/10/20/best-rational-approximation/
while (B <= N && D <= N) {
M = (A + C) / (B + D);
if (p1 === M) {
if (B + D <= N) {
n = A + C;
d = B + D;
} else if (D > B) {
n = C;
d = D;
} else {
n = A;
d = B;
}
break;
} else {
if (p1 > M) {
A += C;
B += D;
} else {
C += A;
D += B;
}
if (B > N) {
n = C;
d = D;
} else {
n = A;
d = B;
}
}
}
n *= z;
} else if (isNaN(p1) || isNaN(p2)) {
d = n = NaN;
}
break;
}
case "string":
{
B = p1.match(/\d+|./g);
if (B === null)
throwInvalidParam();
if (B[A] === '-') {// Check for minus sign at the beginning
s = -1;
A++;
} else if (B[A] === '+') {// Check for plus sign at the beginning
A++;
}
if (B.length === A + 1) { // Check if it's just a simple number "1234"
w = assign(B[A++], s);
} else if (B[A + 1] === '.' || B[A] === '.') { // Check if it's a decimal number
if (B[A] !== '.') { // Handle 0.5 and .5
v = assign(B[A++], s);
}
A++;
// Check for decimal places
if (A + 1 === B.length || B[A + 1] === '(' && B[A + 3] === ')' || B[A + 1] === "'" && B[A + 3] === "'") {
w = assign(B[A], s);
y = Math.pow(10, B[A].length);
A++;
}
// Check for repeating places
if (B[A] === '(' && B[A + 2] === ')' || B[A] === "'" && B[A + 2] === "'") {
x = assign(B[A + 1], s);
z = Math.pow(10, B[A + 1].length) - 1;
A += 3;
}
} else if (B[A + 1] === '/' || B[A + 1] === ':') { // Check for a simple fraction "123/456" or "123:456"
w = assign(B[A], s);
y = assign(B[A + 2], 1);
A += 3;
} else if (B[A + 3] === '/' && B[A + 1] === ' ') { // Check for a complex fraction "123 1/2"
v = assign(B[A], s);
w = assign(B[A + 2], s);
y = assign(B[A + 4], 1);
A += 5;
}
if (B.length <= A) { // Check for more tokens on the stack
d = y * z;
s = /* void */
n = x + d * v + z * w;
break;
}
/* Fall through on error */
}
default:
throwInvalidParam();
}
if (d === 0) {
throw new DivisionByZero();
}
P["s"] = s < 0 ? -1 : 1;
P["n"] = Math.abs(n);
P["d"] = Math.abs(d);
};
function modpow(b, e, m) {
var r = 1;
for (; e > 0; b = (b * b) % m, e >>= 1) {
if (e & 1) {
r = (r * b) % m;
}
}
return r;
}
function cycleLen(n, d) {
for (; d % 2 === 0;
d /= 2) {
}
for (; d % 5 === 0;
d /= 5) {
}
if (d === 1) // Catch non-cyclic numbers
return 0;
// If we would like to compute really large numbers quicker, we could make use of Fermat's little theorem:
// 10^(d-1) % d == 1
// However, we don't need such large numbers and MAX_CYCLE_LEN should be the capstone,
// as we want to translate the numbers to strings.
var rem = 10 % d;
var t = 1;
for (; rem !== 1; t++) {
rem = rem * 10 % d;
if (t > MAX_CYCLE_LEN)
return 0; // Returning 0 here means that we don't print it as a cyclic number. It's likely that the answer is `d-1`
}
return t;
}
function cycleStart(n, d, len) {
var rem1 = 1;
var rem2 = modpow(10, len, d);
for (var t = 0; t < 300; t++) { // s < ~log10(Number.MAX_VALUE)
// Solve 10^s == 10^(s+t) (mod d)
if (rem1 === rem2)
return t;
rem1 = rem1 * 10 % d;
rem2 = rem2 * 10 % d;
}
return 0;
}
function gcd(a, b) {
if (!a)
return b;
if (!b)
return a;
while (1) {
a %= b;
if (!a)
return b;
b %= a;
if (!b)
return a;
}
};
/**
* Module constructor
*
* @constructor
* @param {number|Fraction=} a
* @param {number=} b
*/
function Fraction(a, b) {
if (!(this instanceof Fraction)) {
return new Fraction(a, b);
}
parse(a, b);
if (Fraction['REDUCE']) {
a = gcd(P["d"], P["n"]); // Abuse a
} else {
a = 1;
}
this["s"] = P["s"];
this["n"] = P["n"] / a;
this["d"] = P["d"] / a;
}
/**
* Boolean global variable to be able to disable automatic reduction of the fraction
*
*/
Fraction['REDUCE'] = 1;
Fraction.prototype = {
"s": 1,
"n": 0,
"d": 1,
/**
* Calculates the absolute value
*
* Ex: new Fraction(-4).abs() => 4
**/
"abs": function() {
return new Fraction(this["n"], this["d"]);
},
/**
* Inverts the sign of the current fraction
*
* Ex: new Fraction(-4).neg() => 4
**/
"neg": function() {
return new Fraction(-this["s"] * this["n"], this["d"]);
},
/**
* Adds two rational numbers
*
* Ex: new Fraction({n: 2, d: 3}).add("14.9") => 467 / 30
**/
"add": function(a, b) {
parse(a, b);
return new Fraction(
this["s"] * this["n"] * P["d"] + P["s"] * this["d"] * P["n"],
this["d"] * P["d"]
);
},
/**
* Subtracts two rational numbers
*
* Ex: new Fraction({n: 2, d: 3}).add("14.9") => -427 / 30
**/
"sub": function(a, b) {
parse(a, b);
return new Fraction(
this["s"] * this["n"] * P["d"] - P["s"] * this["d"] * P["n"],
this["d"] * P["d"]
);
},
/**
* Multiplies two rational numbers
*
* Ex: new Fraction("-17.(345)").mul(3) => 5776 / 111
**/
"mul": function(a, b) {
parse(a, b);
return new Fraction(
this["s"] * P["s"] * this["n"] * P["n"],
this["d"] * P["d"]
);
},
/**
* Divides two rational numbers
*
* Ex: new Fraction("-17.(345)").inverse().div(3)
**/
"div": function(a, b) {
parse(a, b);
return new Fraction(
this["s"] * P["s"] * this["n"] * P["d"],
this["d"] * P["n"]
);
},
/**
* Clones the actual object
*
* Ex: new Fraction("-17.(345)").clone()
**/
"clone": function() {
return new Fraction(this);
},
/**
* Calculates the modulo of two rational numbers - a more precise fmod
*
* Ex: new Fraction('4.(3)').mod([7, 8]) => (13/3) % (7/8) = (5/6)
**/
"mod": function(a, b) {
if (isNaN(this['n']) || isNaN(this['d'])) {
return new Fraction(NaN);
}
if (a === undefined) {
return new Fraction(this["s"] * this["n"] % this["d"], 1);
}
parse(a, b);
if (0 === P["n"] && 0 === this["d"]) {
Fraction(0, 0); // Throw DivisionByZero
}
/*
* First silly attempt, kinda slow
*
return that["sub"]({
"n": num["n"] * Math.floor((this.n / this.d) / (num.n / num.d)),
"d": num["d"],
"s": this["s"]
});*/
/*
* New attempt: a1 / b1 = a2 / b2 * q + r
* => b2 * a1 = a2 * b1 * q + b1 * b2 * r
* => (b2 * a1 % a2 * b1) / (b1 * b2)
*/
return new Fraction(
this["s"] * (P["d"] * this["n"]) % (P["n"] * this["d"]),
P["d"] * this["d"]
);
},
/**
* Calculates the fractional gcd of two rational numbers
*
* Ex: new Fraction(5,8).gcd(3,7) => 1/56
*/
"gcd": function(a, b) {
parse(a, b);
// gcd(a / b, c / d) = gcd(a, c) / lcm(b, d)
return new Fraction(gcd(P["n"], this["n"]) * gcd(P["d"], this["d"]), P["d"] * this["d"]);
},
/**
* Calculates the fractional lcm of two rational numbers
*
* Ex: new Fraction(5,8).lcm(3,7) => 15
*/
"lcm": function(a, b) {
parse(a, b);
// lcm(a / b, c / d) = lcm(a, c) / gcd(b, d)
if (P["n"] === 0 && this["n"] === 0) {
return new Fraction;
}
return new Fraction(P["n"] * this["n"], gcd(P["n"], this["n"]) * gcd(P["d"], this["d"]));
},
/**
* Calculates the ceil of a rational number
*
* Ex: new Fraction('4.(3)').ceil() => (5 / 1)
**/
"ceil": function(places) {
places = Math.pow(10, places || 0);
if (isNaN(this["n"]) || isNaN(this["d"])) {
return new Fraction(NaN);
}
return new Fraction(Math.ceil(places * this["s"] * this["n"] / this["d"]), places);
},
/**
* Calculates the floor of a rational number
*
* Ex: new Fraction('4.(3)').floor() => (4 / 1)
**/
"floor": function(places) {
places = Math.pow(10, places || 0);
if (isNaN(this["n"]) || isNaN(this["d"])) {
return new Fraction(NaN);
}
return new Fraction(Math.floor(places * this["s"] * this["n"] / this["d"]), places);
},
/**
* Rounds a rational numbers
*
* Ex: new Fraction('4.(3)').round() => (4 / 1)
**/
"round": function(places) {
places = Math.pow(10, places || 0);
if (isNaN(this["n"]) || isNaN(this["d"])) {
return new Fraction(NaN);
}
return new Fraction(Math.round(places * this["s"] * this["n"] / this["d"]), places);
},
/**
* Gets the inverse of the fraction, means numerator and denumerator are exchanged
*
* Ex: new Fraction([-3, 4]).inverse() => -4 / 3
**/
"inverse": function() {
return new Fraction(this["s"] * this["d"], this["n"]);
},
/**
* Calculates the fraction to some integer exponent
*
* Ex: new Fraction(-1,2).pow(-3) => -8
*/
"pow": function(m) {
if (m < 0) {
return new Fraction(Math.pow(this['s'] * this["d"], -m), Math.pow(this["n"], -m));
} else {
return new Fraction(Math.pow(this['s'] * this["n"], m), Math.pow(this["d"], m));
}
},
/**
* Check if two rational numbers are the same
*
* Ex: new Fraction(19.6).equals([98, 5]);
**/
"equals": function(a, b) {
parse(a, b);
return this["s"] * this["n"] * P["d"] === P["s"] * P["n"] * this["d"]; // Same as compare() === 0
},
/**
* Check if two rational numbers are the same
*
* Ex: new Fraction(19.6).equals([98, 5]);
**/
"compare": function(a, b) {
parse(a, b);
var t = (this["s"] * this["n"] * P["d"] - P["s"] * P["n"] * this["d"]);
return (0 < t) - (t < 0);
},
"simplify": function(eps) {
// First naive implementation, needs improvement
if (isNaN(this['n']) || isNaN(this['d'])) {
return this;
}
var cont = this['abs']()['toContinued']();
eps = eps || 0.001;
function rec(a) {
if (a.length === 1)
return new Fraction(a[0]);
return rec(a.slice(1))['inverse']()['add'](a[0]);
}
for (var i = 0; i < cont.length; i++) {
var tmp = rec(cont.slice(0, i + 1));
if (tmp['sub'](this['abs']())['abs']().valueOf() < eps) {
return tmp['mul'](this['s']);
}
}
return this;
},
/**
* Check if two rational numbers are divisible
*
* Ex: new Fraction(19.6).divisible(1.5);
*/
"divisible": function(a, b) {
parse(a, b);
return !(!(P["n"] * this["d"]) || ((this["n"] * P["d"]) % (P["n"] * this["d"])));
},
/**
* Returns a decimal representation of the fraction
*
* Ex: new Fraction("100.'91823'").valueOf() => 100.91823918239183
**/
'valueOf': function() {
return this["s"] * this["n"] / this["d"];
},
/**
* Returns a string-fraction representation of a Fraction object
*
* Ex: new Fraction("1.'3'").toFraction() => "4 1/3"
**/
'toFraction': function(excludeWhole) {
var whole, str = "";
var n = this["n"];
var d = this["d"];
if (this["s"] < 0) {
str += '-';
}
if (d === 1) {
str += n;
} else {
if (excludeWhole && (whole = Math.floor(n / d)) > 0) {
str += whole;
str += " ";
n %= d;
}
str += n;
str += '/';
str += d;
}
return str;
},
/**
* Returns a latex representation of a Fraction object
*
* Ex: new Fraction("1.'3'").toLatex() => "\frac{4}{3}"
**/
'toLatex': function(excludeWhole) {
var whole, str = "";
var n = this["n"];
var d = this["d"];
if (this["s"] < 0) {
str += '-';
}
if (d === 1) {
str += n;
} else {
if (excludeWhole && (whole = Math.floor(n / d)) > 0) {
str += whole;
n %= d;
}
str += "\\frac{";
str += n;
str += '}{';
str += d;
str += '}';
}
return str;
},
/**
* Returns an array of continued fraction elements
*
* Ex: new Fraction("7/8").toContinued() => [0,1,7]
*/
'toContinued': function() {
var t;
var a = this['n'];
var b = this['d'];
var res = [];
if (isNaN(this['n']) || isNaN(this['d'])) {
return res;
}
do {
res.push(Math.floor(a / b));
t = a % b;
a = b;
b = t;
} while (a !== 1);
return res;
},
/**
* Creates a string representation of a fraction with all digits
*
* Ex: new Fraction("100.'91823'").toString() => "100.(91823)"
**/
'toString': function(dec) {
var g;
var N = this["n"];
var D = this["d"];
if (isNaN(N) || isNaN(D)) {
return "NaN";
}
if (!Fraction['REDUCE']) {
g = gcd(N, D);
N /= g;
D /= g;
}
dec = dec || 15; // 15 = decimal places when no repitation
var cycLen = cycleLen(N, D); // Cycle length
var cycOff = cycleStart(N, D, cycLen); // Cycle start
var str = this['s'] === -1 ? "-" : "";
str += N / D | 0;
N %= D;
N *= 10;
if (N)
str += ".";
if (cycLen) {
for (var i = cycOff; i--; ) {
str += N / D | 0;
N %= D;
N *= 10;
}
str += "(";
for (var i = cycLen; i--; ) {
str += N / D | 0;
N %= D;
N *= 10;
}
str += ")";
} else {
for (var i = dec; N && i--; ) {
str += N / D | 0;
N %= D;
N *= 10;
}
}
return str;
}
};
if (true) {
!(__WEBPACK_AMD_DEFINE_ARRAY__ = [], __WEBPACK_AMD_DEFINE_RESULT__ = (function() {
return Fraction;
}).apply(exports, __WEBPACK_AMD_DEFINE_ARRAY__),
__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));
} else {}
})(this);
/***/ }),
/* 11 */
/***/ (function(module, exports) {
/*
* Natural Sort algorithm for Javascript - Version 0.7 - Released under MIT license
* Author: Jim Palmer (based on chunking idea from Dave Koelle)
*/
/*jshint unused:false */
module.exports = function naturalSort (a, b) {
"use strict";
var re = /(^([+\-]?(?:0|[1-9]\d*)(?:\.\d*)?(?:[eE][+\-]?\d+)?)?$|^0x[0-9a-f]+$|\d+)/gi,
sre = /(^[ ]*|[ ]*$)/g,
dre = /(^([\w ]+,?[\w ]+)?[\w ]+,?[\w ]+\d+:\d+(:\d+)?[\w ]?|^\d{1,4}[\/\-]\d{1,4}[\/\-]\d{1,4}|^\w+, \w+ \d+, \d{4})/,
hre = /^0x[0-9a-f]+$/i,
ore = /^0/,
i = function(s) { return naturalSort.insensitive && ('' + s).toLowerCase() || '' + s; },
// convert all to strings strip whitespace
x = i(a).replace(sre, '') || '',
y = i(b).replace(sre, '') || '',
// chunk/tokenize
xN = x.replace(re, '\0$1\0').replace(/\0$/,'').replace(/^\0/,'').split('\0'),
yN = y.replace(re, '\0$1\0').replace(/\0$/,'').replace(/^\0/,'').split('\0'),
// numeric, hex or date detection
xD = parseInt(x.match(hre), 16) || (xN.length !== 1 && x.match(dre) && Date.parse(x)),
yD = parseInt(y.match(hre), 16) || xD && y.match(dre) && Date.parse(y) || null,
oFxNcL, oFyNcL;
// first try and sort Hex codes or Dates
if (yD) {
if ( xD < yD ) { return -1; }
else if ( xD > yD ) { return 1; }
}
// natural sorting through split numeric strings and default strings
for(var cLoc=0, numS=Math.max(xN.length, yN.length); cLoc < numS; cLoc++) {
// find floats not starting with '0', string or 0 if not defined (Clint Priest)
oFxNcL = !(xN[cLoc] || '').match(ore) && parseFloat(xN[cLoc]) || xN[cLoc] || 0;
oFyNcL = !(yN[cLoc] || '').match(ore) && parseFloat(yN[cLoc]) || yN[cLoc] || 0;
// handle numeric vs string comparison - number < string - (Kyle Adams)
if (isNaN(oFxNcL) !== isNaN(oFyNcL)) { return (isNaN(oFxNcL)) ? 1 : -1; }
// rely on string comparison if different types - i.e. '02' < 2 != '02' < '2'
else if (typeof oFxNcL !== typeof oFyNcL) {
oFxNcL += '';
oFyNcL += '';
}
if (oFxNcL < oFyNcL) { return -1; }
if (oFxNcL > oFyNcL) { return 1; }
}
return 0;
};
/***/ }),
/* 12 */
/***/ (function(module, __webpack_exports__, __webpack_require__) {
"use strict";
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "a", function() { return ArgumentsError; });
/**
* Create a syntax error with the message:
* 'Wrong number of arguments in function <fn> (<count> provided, <min>-<max> expected)'
* @param {string} fn Function name
* @param {number} count Actual argument count
* @param {number} min Minimum required argument count
* @param {number} [max] Maximum required argument count
* @extends Error
*/
function ArgumentsError(fn, count, min, max) {
if (!(this instanceof ArgumentsError)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
this.fn = fn;
this.count = count;
this.min = min;
this.max = max;
this.message = 'Wrong number of arguments in function ' + fn + ' (' + count + ' provided, ' + min + (max !== undefined && max !== null ? '-' + max : '') + ' expected)';
this.stack = new Error().stack;
}
ArgumentsError.prototype = new Error();
ArgumentsError.prototype.constructor = Error;
ArgumentsError.prototype.name = 'ArgumentsError';
ArgumentsError.prototype.isArgumentsError = true;
/***/ }),
/* 13 */
/***/ (function(module, exports, __webpack_require__) {
"use strict";
var __WEBPACK_AMD_DEFINE_FACTORY__, __WEBPACK_AMD_DEFINE_ARRAY__, __WEBPACK_AMD_DEFINE_RESULT__;/**
* typed-function
*
* Type checking for JavaScript functions
*
* https://github.com/josdejong/typed-function
*/
(function (root, factory) {
if (true) {
// AMD. Register as an anonymous module.
!(__WEBPACK_AMD_DEFINE_ARRAY__ = [], __WEBPACK_AMD_DEFINE_FACTORY__ = (factory),
__WEBPACK_AMD_DEFINE_RESULT__ = (typeof __WEBPACK_AMD_DEFINE_FACTORY__ === 'function' ?
(__WEBPACK_AMD_DEFINE_FACTORY__.apply(exports, __WEBPACK_AMD_DEFINE_ARRAY__)) : __WEBPACK_AMD_DEFINE_FACTORY__),
__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));
} else {}
}(this, function () {
function ok () {
return true;
}
function notOk () {
return false;
}
function undef () {
return undefined;
}
/**
* @typedef {{
* params: Param[],
* fn: function
* }} Signature
*
* @typedef {{
* types: Type[],
* restParam: boolean
* }} Param
*
* @typedef {{
* name: string,
* typeIndex: number,
* test: function,
* conversion?: ConversionDef,
* conversionIndex: number,
* }} Type
*
* @typedef {{
* from: string,
* to: string,
* convert: function (*) : *
* }} ConversionDef
*
* @typedef {{
* name: string,
* test: function(*) : boolean
* }} TypeDef
*/
// create a new instance of typed-function
function create () {
// data type tests
var _types = [
{ name: 'number', test: function (x) { return typeof x === 'number' } },
{ name: 'string', test: function (x) { return typeof x === 'string' } },
{ name: 'boolean', test: function (x) { return typeof x === 'boolean' } },
{ name: 'Function', test: function (x) { return typeof x === 'function'} },
{ name: 'Array', test: Array.isArray },
{ name: 'Date', test: function (x) { return x instanceof Date } },
{ name: 'RegExp', test: function (x) { return x instanceof RegExp } },
{ name: 'Object', test: function (x) {
return typeof x === 'object' && x !== null && x.constructor === Object
}},
{ name: 'null', test: function (x) { return x === null } },
{ name: 'undefined', test: function (x) { return x === undefined } }
];
var anyType = {
name: 'any',
test: ok
}
// types which need to be ignored
var _ignore = [];
// type conversions
var _conversions = [];
// This is a temporary object, will be replaced with a typed function at the end
var typed = {
types: _types,
conversions: _conversions,
ignore: _ignore
};
/**
* Find the test function for a type
* @param {String} typeName
* @return {TypeDef} Returns the type definition when found,
* Throws a TypeError otherwise
*/
function findTypeByName (typeName) {
var entry = findInArray(typed.types, function (entry) {
return entry.name === typeName;
});
if (entry) {
return entry;
}
if (typeName === 'any') { // special baked-in case 'any'
return anyType;
}
var hint = findInArray(typed.types, function (entry) {
return entry.name.toLowerCase() === typeName.toLowerCase();
});
throw new TypeError('Unknown type "' + typeName + '"' +
(hint ? ('. Did you mean "' + hint.name + '"?') : ''));
}
/**
* Find the index of a type definition. Handles special case 'any'
* @param {TypeDef} type
* @return {number}
*/
function findTypeIndex(type) {
if (type === anyType) {
return 999;
}
return typed.types.indexOf(type);
}
/**
* Find a type that matches a value.
* @param {*} value
* @return {string} Returns the name of the first type for which
* the type test matches the value.
*/
function findTypeName(value) {
var entry = findInArray(typed.types, function (entry) {
return entry.test(value);
});
if (entry) {
return entry.name;
}
throw new TypeError('Value has unknown type. Value: ' + value);
}
/**
* Find a specific signature from a (composed) typed function, for example:
*
* typed.find(fn, ['number', 'string'])
* typed.find(fn, 'number, string')
*
* Function find only only works for exact matches.
*
* @param {Function} fn A typed-function
* @param {string | string[]} signature Signature to be found, can be
* an array or a comma separated string.
* @return {Function} Returns the matching signature, or
* throws an error when no signature
* is found.
*/
function find (fn, signature) {
if (!fn.signatures) {
throw new TypeError('Function is no typed-function');
}
// normalize input
var arr;
if (typeof signature === 'string') {
arr = signature.split(',');
for (var i = 0; i < arr.length; i++) {
arr[i] = arr[i].trim();
}
}
else if (Array.isArray(signature)) {
arr = signature;
}
else {
throw new TypeError('String array or a comma separated string expected');
}
var str = arr.join(',');
// find an exact match
var match = fn.signatures[str];
if (match) {
return match;
}
// TODO: extend find to match non-exact signatures
throw new TypeError('Signature not found (signature: ' + (fn.name || 'unnamed') + '(' + arr.join(', ') + '))');
}
/**
* Convert a given value to another data type.
* @param {*} value
* @param {string} type
*/
function convert (value, type) {
var from = findTypeName(value);
// check conversion is needed
if (type === from) {
return value;
}
for (var i = 0; i < typed.conversions.length; i++) {
var conversion = typed.conversions[i];
if (conversion.from === from && conversion.to === type) {
return conversion.convert(value);
}
}
throw new Error('Cannot convert from ' + from + ' to ' + type);
}
/**
* Stringify parameters in a normalized way
* @param {Param[]} params
* @return {string}
*/
function stringifyParams (params) {
return params
.map(function (param) {
var typeNames = param.types.map(getTypeName);
return (param.restParam ? '...' : '') + typeNames.join('|');
})
.join(',');
}
/**
* Parse a parameter, like "...number | boolean"
* @param {string} param
* @param {ConversionDef[]} conversions
* @return {Param} param
*/
function parseParam (param, conversions) {
var restParam = param.indexOf('...') === 0;
var types = (!restParam)
? param
: (param.length > 3)
? param.slice(3)
: 'any';
var typeNames = types.split('|').map(trim)
.filter(notEmpty)
.filter(notIgnore);
var matchingConversions = filterConversions(conversions, typeNames);
var exactTypes = typeNames.map(function (typeName) {
var type = findTypeByName(typeName);
return {
name: typeName,
typeIndex: findTypeIndex(type),
test: type.test,
conversion: null,
conversionIndex: -1
};
});
var convertibleTypes = matchingConversions.map(function (conversion) {
var type = findTypeByName(conversion.from);
return {
name: conversion.from,
typeIndex: findTypeIndex(type),
test: type.test,
conversion: conversion,
conversionIndex: conversions.indexOf(conversion)
};
});
return {
types: exactTypes.concat(convertibleTypes),
restParam: restParam
};
}
/**
* Parse a signature with comma separated parameters,
* like "number | boolean, ...string"
* @param {string} signature
* @param {function} fn
* @param {ConversionDef[]} conversions
* @return {Signature | null} signature
*/
function parseSignature (signature, fn, conversions) {
var params = [];
if (signature.trim() !== '') {
params = signature
.split(',')
.map(trim)
.map(function (param, index, array) {
var parsedParam = parseParam(param, conversions);
if (parsedParam.restParam && (index !== array.length - 1)) {
throw new SyntaxError('Unexpected rest parameter "' + param + '": ' +
'only allowed for the last parameter');
}
return parsedParam;
});
}
if (params.some(isInvalidParam)) {
// invalid signature: at least one parameter has no types
// (they may have been filtered)
return null;
}
return {
params: params,
fn: fn
};
}
/**
* Test whether a set of params contains a restParam
* @param {Param[]} params
* @return {boolean} Returns true when the last parameter is a restParam
*/
function hasRestParam(params) {
var param = last(params)
return param ? param.restParam : false;
}
/**
* Test whether a parameter contains conversions
* @param {Param} param
* @return {boolean} Returns true when at least one of the parameters
* contains a conversion.
*/
function hasConversions(param) {
return param.types.some(function (type) {
return type.conversion != null;
});
}
/**
* Create a type test for a single parameter, which can have one or multiple
* types.
* @param {Param} param
* @return {function(x: *) : boolean} Returns a test function
*/
function compileTest(param) {
if (!param || param.types.length === 0) {
// nothing to do
return ok;
}
else if (param.types.length === 1) {
return findTypeByName(param.types[0].name).test;
}
else if (param.types.length === 2) {
var test0 = findTypeByName(param.types[0].name).test;
var test1 = findTypeByName(param.types[1].name).test;
return function or(x) {
return test0(x) || test1(x);
}
}
else { // param.types.length > 2
var tests = param.types.map(function (type) {
return findTypeByName(type.name).test;
})
return function or(x) {
for (var i = 0; i < tests.length; i++) {
if (tests[i](x)) {
return true;
}
}
return false;
}
}
}
/**
* Create a test for all parameters of a signature
* @param {Param[]} params
* @return {function(args: Array<*>) : boolean}
*/
function compileTests(params) {
var tests, test0, test1;
if (hasRestParam(params)) {
// variable arguments like '...number'
tests = initial(params).map(compileTest);
var varIndex = tests.length;
var lastTest = compileTest(last(params));
var testRestParam = function (args) {
for (var i = varIndex; i < args.length; i++) {
if (!lastTest(args[i])) {
return false;
}
}
return true;
}
return function testArgs(args) {
for (var i = 0; i < tests.length; i++) {
if (!tests[i](args[i])) {
return false;
}
}
return testRestParam(args) && (args.length >= varIndex + 1);
};
}
else {
// no variable arguments
if (params.length === 0) {
return function testArgs(args) {
return args.length === 0;
};
}
else if (params.length === 1) {
test0 = compileTest(params[0]);
return function testArgs(args) {
return test0(args[0]) && args.length === 1;
};
}
else if (params.length === 2) {
test0 = compileTest(params[0]);
test1 = compileTest(params[1]);
return function testArgs(args) {
return test0(args[0]) && test1(args[1]) && args.length === 2;
};
}
else { // arguments.length > 2
tests = params.map(compileTest);
return function testArgs(args) {
for (var i = 0; i < tests.length; i++) {
if (!tests[i](args[i])) {
return false;
}
}
return args.length === tests.length;
};
}
}
}
/**
* Find the parameter at a specific index of a signature.
* Handles rest parameters.
* @param {Signature} signature
* @param {number} index
* @return {Param | null} Returns the matching parameter when found,
* null otherwise.
*/
function getParamAtIndex(signature, index) {
return index < signature.params.length
? signature.params[index]
: hasRestParam(signature.params)
? last(signature.params)
: null
}
/**
* Get all type names of a parameter
* @param {Signature} signature
* @param {number} index
* @param {boolean} excludeConversions
* @return {string[]} Returns an array with type names
*/
function getExpectedTypeNames (signature, index, excludeConversions) {
var param = getParamAtIndex(signature, index);
var types = param
? excludeConversions
? param.types.filter(isExactType)
: param.types
: [];
return types.map(getTypeName);
}
/**
* Returns the name of a type
* @param {Type} type
* @return {string} Returns the type name
*/
function getTypeName(type) {
return type.name;
}
/**
* Test whether a type is an exact type or conversion
* @param {Type} type
* @return {boolean} Returns true when
*/
function isExactType(type) {
return type.conversion === null || type.conversion === undefined;
}
/**
* Helper function for creating error messages: create an array with
* all available types on a specific argument index.
* @param {Signature[]} signatures
* @param {number} index
* @return {string[]} Returns an array with available types
*/
function mergeExpectedParams(signatures, index) {
var typeNames = uniq(flatMap(signatures, function (signature) {
return getExpectedTypeNames(signature, index, false);
}));
return (typeNames.indexOf('any') !== -1) ? ['any'] : typeNames;
}
/**
* Create
* @param {string} name The name of the function
* @param {array.<*>} args The actual arguments passed to the function
* @param {Signature[]} signatures A list with available signatures
* @return {TypeError} Returns a type error with additional data
* attached to it in the property `data`
*/
function createError(name, args, signatures) {
var err, expected;
var _name = name || 'unnamed';
// test for wrong type at some index
var matchingSignatures = signatures;
var index;
for (index = 0; index < args.length; index++) {
var nextMatchingDefs = matchingSignatures.filter(function (signature) {
var test = compileTest(getParamAtIndex(signature, index));
return (index < signature.params.length || hasRestParam(signature.params)) &&
test(args[index]);
});
if (nextMatchingDefs.length === 0) {
// no matching signatures anymore, throw error "wrong type"
expected = mergeExpectedParams(matchingSignatures, index);
if (expected.length > 0) {
var actualType = findTypeName(args[index]);
err = new TypeError('Unexpected type of argument in function ' + _name +
' (expected: ' + expected.join(' or ') +
', actual: ' + actualType + ', index: ' + index + ')');
err.data = {
category: 'wrongType',
fn: _name,
index: index,
actual: actualType,
expected: expected
}
return err;
}
}
else {
matchingSignatures = nextMatchingDefs;
}
}
// test for too few arguments
var lengths = matchingSignatures.map(function (signature) {
return hasRestParam(signature.params) ? Infinity : signature.params.length;
});
if (args.length < Math.min.apply(null, lengths)) {
expected = mergeExpectedParams(matchingSignatures, index);
err = new TypeError('Too few arguments in function ' + _name +
' (expected: ' + expected.join(' or ') +
', index: ' + args.length + ')');
err.data = {
category: 'tooFewArgs',
fn: _name,
index: args.length,
expected: expected
}
return err;
}
// test for too many arguments
var maxLength = Math.max.apply(null, lengths);
if (args.length > maxLength) {
err = new TypeError('Too many arguments in function ' + _name +
' (expected: ' + maxLength + ', actual: ' + args.length + ')');
err.data = {
category: 'tooManyArgs',
fn: _name,
index: args.length,
expectedLength: maxLength
}
return err;
}
err = new TypeError('Arguments of type "' + args.join(', ') +
'" do not match any of the defined signatures of function ' + _name + '.');
err.data = {
category: 'mismatch',
actual: args.map(findTypeName)
}
return err;
}
/**
* Find the lowest index of all exact types of a parameter (no conversions)
* @param {Param} param
* @return {number} Returns the index of the lowest type in typed.types
*/
function getLowestTypeIndex (param) {
var min = 999;
for (var i = 0; i < param.types.length; i++) {
if (isExactType(param.types[i])) {
min = Math.min(min, param.types[i].typeIndex);
}
}
return min;
}
/**
* Find the lowest index of the conversion of all types of the parameter
* having a conversion
* @param {Param} param
* @return {number} Returns the lowest index of the conversions of this type
*/
function getLowestConversionIndex (param) {
var min = 999;
for (var i = 0; i < param.types.length; i++) {
if (!isExactType(param.types[i])) {
min = Math.min(min, param.types[i].conversionIndex);
}
}
return min;
}
/**
* Compare two params
* @param {Param} param1
* @param {Param} param2
* @return {number} returns a negative number when param1 must get a lower
* index than param2, a positive number when the opposite,
* or zero when both are equal
*/
function compareParams (param1, param2) {
var c;
// compare having a rest parameter or not
c = param1.restParam - param2.restParam;
if (c !== 0) {
return c;
}
// compare having conversions or not
c = hasConversions(param1) - hasConversions(param2);
if (c !== 0) {
return c;
}
// compare the index of the types
c = getLowestTypeIndex(param1) - getLowestTypeIndex(param2);
if (c !== 0) {
return c;
}
// compare the index of any conversion
return getLowestConversionIndex(param1) - getLowestConversionIndex(param2);
}
/**
* Compare two signatures
* @param {Signature} signature1
* @param {Signature} signature2
* @return {number} returns a negative number when param1 must get a lower
* index than param2, a positive number when the opposite,
* or zero when both are equal
*/
function compareSignatures (signature1, signature2) {
var len = Math.min(signature1.params.length, signature2.params.length);
var i;
var c;
// compare whether the params have conversions at all or not
c = signature1.params.some(hasConversions) - signature2.params.some(hasConversions)
if (c !== 0) {
return c;
}
// next compare whether the params have conversions one by one
for (i = 0; i < len; i++) {
c = hasConversions(signature1.params[i]) - hasConversions(signature2.params[i]);
if (c !== 0) {
return c;
}
}
// compare the types of the params one by one
for (i = 0; i < len; i++) {
c = compareParams(signature1.params[i], signature2.params[i]);
if (c !== 0) {
return c;
}
}
// compare the number of params
return signature1.params.length - signature2.params.length;
}
/**
* Get params containing all types that can be converted to the defined types.
*
* @param {ConversionDef[]} conversions
* @param {string[]} typeNames
* @return {ConversionDef[]} Returns the conversions that are available
* for every type (if any)
*/
function filterConversions(conversions, typeNames) {
var matches = {};
conversions.forEach(function (conversion) {
if (typeNames.indexOf(conversion.from) === -1 &&
typeNames.indexOf(conversion.to) !== -1 &&
!matches[conversion.from]) {
matches[conversion.from] = conversion;
}
});
return Object.keys(matches).map(function (from) {
return matches[from];
});
}
/**
* Preprocess arguments before calling the original function:
* - if needed convert the parameters
* - in case of rest parameters, move the rest parameters into an Array
* @param {Param[]} params
* @param {function} fn
* @return {function} Returns a wrapped function
*/
function compileArgsPreprocessing(params, fn) {
var fnConvert = fn;
// TODO: can we make this wrapper function smarter/simpler?
if (params.some(hasConversions)) {
var restParam = hasRestParam(params);
var compiledConversions = params.map(compileArgConversion)
fnConvert = function convertArgs() {
var args = [];
var last = restParam ? arguments.length - 1 : arguments.length;
for (var i = 0; i < last; i++) {
args[i] = compiledConversions[i](arguments[i]);
}
if (restParam) {
args[last] = arguments[last].map(compiledConversions[last]);
}
return fn.apply(this, args);
}
}
var fnPreprocess = fnConvert;
if (hasRestParam(params)) {
var offset = params.length - 1;
fnPreprocess = function preprocessRestParams () {
return fnConvert.apply(this,
slice(arguments, 0, offset).concat([slice(arguments, offset)]));
}
}
return fnPreprocess;
}
/**
* Compile conversion for a parameter to the right type
* @param {Param} param
* @return {function} Returns the wrapped function that will convert arguments
*
*/
function compileArgConversion(param) {
var test0, test1, conversion0, conversion1;
var tests = [];
var conversions = [];
param.types.forEach(function (type) {
if (type.conversion) {
tests.push(findTypeByName(type.conversion.from).test);
conversions.push(type.conversion.convert);
}
});
// create optimized conversion functions depending on the number of conversions
switch (conversions.length) {
case 0:
return function convertArg(arg) {
return arg;
}
case 1:
test0 = tests[0]
conversion0 = conversions[0];
return function convertArg(arg) {
if (test0(arg)) {
return conversion0(arg)
}
return arg;
}
case 2:
test0 = tests[0]
test1 = tests[1]
conversion0 = conversions[0];
conversion1 = conversions[1];
return function convertArg(arg) {
if (test0(arg)) {
return conversion0(arg)
}
if (test1(arg)) {
return conversion1(arg)
}
return arg;
}
default:
return function convertArg(arg) {
for (var i = 0; i < conversions.length; i++) {
if (tests[i](arg)) {
return conversions[i](arg);
}
}
return arg;
}
}
}
/**
* Convert an array with signatures into a map with signatures,
* where signatures with union types are split into separate signatures
*
* Throws an error when there are conflicting types
*
* @param {Signature[]} signatures
* @return {Object.<string, function>} Returns a map with signatures
* as key and the original function
* of this signature as value.
*/
function createSignaturesMap(signatures) {
var signaturesMap = {};
signatures.forEach(function (signature) {
if (!signature.params.some(hasConversions)) {
splitParams(signature.params, true).forEach(function (params) {
signaturesMap[stringifyParams(params)] = signature.fn;
});
}
});
return signaturesMap;
}
/**
* Split params with union types in to separate params.
*
* For example:
*
* splitParams([['Array', 'Object'], ['string', 'RegExp'])
* // returns:
* // [
* // ['Array', 'string'],
* // ['Array', 'RegExp'],
* // ['Object', 'string'],
* // ['Object', 'RegExp']
* // ]
*
* @param {Param[]} params
* @param {boolean} ignoreConversionTypes
* @return {Param[]}
*/
function splitParams(params, ignoreConversionTypes) {
function _splitParams(params, index, types) {
if (index < params.length) {
var param = params[index]
var filteredTypes = ignoreConversionTypes
? param.types.filter(isExactType)
: param.types;
var typeGroups
if (param.restParam) {
// split the types of a rest parameter in two:
// one with only exact types, and one with exact types and conversions
var exactTypes = filteredTypes.filter(isExactType)
typeGroups = exactTypes.length < filteredTypes.length
? [exactTypes, filteredTypes]
: [filteredTypes]
}
else {
// split all the types of a regular parameter into one type per group
typeGroups = filteredTypes.map(function (type) {
return [type]
})
}
// recurse over the groups with types
return flatMap(typeGroups, function (typeGroup) {
return _splitParams(params, index + 1, types.concat([typeGroup]));
});
}
else {
// we've reached the end of the parameters. Now build a new Param
var splittedParams = types.map(function (type, typeIndex) {
return {
types: type,
restParam: (typeIndex === params.length - 1) && hasRestParam(params)
}
});
return [splittedParams];
}
}
return _splitParams(params, 0, []);
}
/**
* Test whether two signatures have a conflicting signature
* @param {Signature} signature1
* @param {Signature} signature2
* @return {boolean} Returns true when the signatures conflict, false otherwise.
*/
function hasConflictingParams(signature1, signature2) {
var ii = Math.max(signature1.params.length, signature2.params.length);
for (var i = 0; i < ii; i++) {
var typesNames1 = getExpectedTypeNames(signature1, i, true);
var typesNames2 = getExpectedTypeNames(signature2, i, true);
if (!hasOverlap(typesNames1, typesNames2)) {
return false;
}
}
var len1 = signature1.params.length;
var len2 = signature2.params.length;
var restParam1 = hasRestParam(signature1.params);
var restParam2 = hasRestParam(signature2.params);
return restParam1
? restParam2 ? (len1 === len2) : (len2 >= len1)
: restParam2 ? (len1 >= len2) : (len1 === len2)
}
/**
* Create a typed function
* @param {String} name The name for the typed function
* @param {Object.<string, function>} signaturesMap
* An object with one or
* multiple signatures as key, and the
* function corresponding to the
* signature as value.
* @return {function} Returns the created typed function.
*/
function createTypedFunction(name, signaturesMap) {
if (Object.keys(signaturesMap).length === 0) {
throw new SyntaxError('No signatures provided');
}
// parse the signatures, and check for conflicts
var parsedSignatures = [];
Object.keys(signaturesMap)
.map(function (signature) {
return parseSignature(signature, signaturesMap[signature], typed.conversions);
})
.filter(notNull)
.forEach(function (parsedSignature) {
// check whether this parameter conflicts with already parsed signatures
var conflictingSignature = findInArray(parsedSignatures, function (s) {
return hasConflictingParams(s, parsedSignature)
});
if (conflictingSignature) {
throw new TypeError('Conflicting signatures "' +
stringifyParams(conflictingSignature.params) + '" and "' +
stringifyParams(parsedSignature.params) + '".');
}
parsedSignatures.push(parsedSignature);
});
// split and filter the types of the signatures, and then order them
var signatures = flatMap(parsedSignatures, function (parsedSignature) {
var params = parsedSignature ? splitParams(parsedSignature.params, false) : []
return params.map(function (params) {
return {
params: params,
fn: parsedSignature.fn
};
});
}).filter(notNull);
signatures.sort(compareSignatures);
// we create a highly optimized checks for the first couple of signatures with max 2 arguments
var ok0 = signatures[0] && signatures[0].params.length <= 2 && !hasRestParam(signatures[0].params);
var ok1 = signatures[1] && signatures[1].params.length <= 2 && !hasRestParam(signatures[1].params);
var ok2 = signatures[2] && signatures[2].params.length <= 2 && !hasRestParam(signatures[2].params);
var ok3 = signatures[3] && signatures[3].params.length <= 2 && !hasRestParam(signatures[3].params);
var ok4 = signatures[4] && signatures[4].params.length <= 2 && !hasRestParam(signatures[4].params);
var ok5 = signatures[5] && signatures[5].params.length <= 2 && !hasRestParam(signatures[5].params);
var allOk = ok0 && ok1 && ok2 && ok3 && ok4 && ok5;
// compile the tests
var tests = signatures.map(function (signature) {
return compileTests(signature.params);
});
var test00 = ok0 ? compileTest(signatures[0].params[0]) : notOk;
var test10 = ok1 ? compileTest(signatures[1].params[0]) : notOk;
var test20 = ok2 ? compileTest(signatures[2].params[0]) : notOk;
var test30 = ok3 ? compileTest(signatures[3].params[0]) : notOk;
var test40 = ok4 ? compileTest(signatures[4].params[0]) : notOk;
var test50 = ok5 ? compileTest(signatures[5].params[0]) : notOk;
var test01 = ok0 ? compileTest(signatures[0].params[1]) : notOk;
var test11 = ok1 ? compileTest(signatures[1].params[1]) : notOk;
var test21 = ok2 ? compileTest(signatures[2].params[1]) : notOk;
var test31 = ok3 ? compileTest(signatures[3].params[1]) : notOk;
var test41 = ok4 ? compileTest(signatures[4].params[1]) : notOk;
var test51 = ok5 ? compileTest(signatures[5].params[1]) : notOk;
// compile the functions
var fns = signatures.map(function(signature) {
return compileArgsPreprocessing(signature.params, signature.fn);
});
var fn0 = ok0 ? fns[0] : undef;
var fn1 = ok1 ? fns[1] : undef;
var fn2 = ok2 ? fns[2] : undef;
var fn3 = ok3 ? fns[3] : undef;
var fn4 = ok4 ? fns[4] : undef;
var fn5 = ok5 ? fns[5] : undef;
var len0 = ok0 ? signatures[0].params.length : -1;
var len1 = ok1 ? signatures[1].params.length : -1;
var len2 = ok2 ? signatures[2].params.length : -1;
var len3 = ok3 ? signatures[3].params.length : -1;
var len4 = ok4 ? signatures[4].params.length : -1;
var len5 = ok5 ? signatures[5].params.length : -1;
// simple and generic, but also slow
var iStart = allOk ? 6 : 0;
var iEnd = signatures.length;
var generic = function generic() {
'use strict';
for (var i = iStart; i < iEnd; i++) {
if (tests[i](arguments)) {
return fns[i].apply(this, arguments);
}
}
throw createError(name, arguments, signatures);
}
// create the typed function
// fast, specialized version. Falls back to the slower, generic one if needed
var fn = function fn(arg0, arg1) {
'use strict';
if (arguments.length === len0 && test00(arg0) && test01(arg1)) { return fn0.apply(fn, arguments); }
if (arguments.length === len1 && test10(arg0) && test11(arg1)) { return fn1.apply(fn, arguments); }
if (arguments.length === len2 && test20(arg0) && test21(arg1)) { return fn2.apply(fn, arguments); }
if (arguments.length === len3 && test30(arg0) && test31(arg1)) { return fn3.apply(fn, arguments); }
if (arguments.length === len4 && test40(arg0) && test41(arg1)) { return fn4.apply(fn, arguments); }
if (arguments.length === len5 && test50(arg0) && test51(arg1)) { return fn5.apply(fn, arguments); }
return generic.apply(fn, arguments);
}
// attach name the typed function
try {
Object.defineProperty(fn, 'name', {value: name});
}
catch (err) {
// old browsers do not support Object.defineProperty and some don't support setting the name property
// the function name is not essential for the functioning, it's mostly useful for debugging,
// so it's fine to have unnamed functions.
}
// attach signatures to the function
fn.signatures = createSignaturesMap(signatures);
return fn;
}
/**
* Test whether a type should be NOT be ignored
* @param {string} typeName
* @return {boolean}
*/
function notIgnore(typeName) {
return typed.ignore.indexOf(typeName) === -1;
}
/**
* trim a string
* @param {string} str
* @return {string}
*/
function trim(str) {
return str.trim();
}
/**
* Test whether a string is not empty
* @param {string} str
* @return {boolean}
*/
function notEmpty(str) {
return !!str;
}
/**
* test whether a value is not strict equal to null
* @param {*} value
* @return {boolean}
*/
function notNull(value) {
return value !== null;
}
/**
* Test whether a parameter has no types defined
* @param {Param} param
* @return {boolean}
*/
function isInvalidParam (param) {
return param.types.length === 0;
}
/**
* Return all but the last items of an array
* @param {Array} arr
* @return {Array}
*/
function initial(arr) {
return arr.slice(0, arr.length - 1);
}
/**
* return the last item of an array
* @param {Array} arr
* @return {*}
*/
function last(arr) {
return arr[arr.length - 1];
}
/**
* Slice an array or function Arguments
* @param {Array | Arguments | IArguments} arr
* @param {number} start
* @param {number} [end]
* @return {Array}
*/
function slice(arr, start, end) {
return Array.prototype.slice.call(arr, start, end);
}
/**
* Test whether an array contains some item
* @param {Array} array
* @param {*} item
* @return {boolean} Returns true if array contains item, false if not.
*/
function contains(array, item) {
return array.indexOf(item) !== -1;
}
/**
* Test whether two arrays have overlapping items
* @param {Array} array1
* @param {Array} array2
* @return {boolean} Returns true when at least one item exists in both arrays
*/
function hasOverlap(array1, array2) {
for (var i = 0; i < array1.length; i++) {
if (contains(array2, array1[i])) {
return true;
}
}
return false;
}
/**
* Return the first item from an array for which test(arr[i]) returns true
* @param {Array} arr
* @param {function} test
* @return {* | undefined} Returns the first matching item
* or undefined when there is no match
*/
function findInArray(arr, test) {
for (var i = 0; i < arr.length; i++) {
if (test(arr[i])) {
return arr[i];
}
}
return undefined;
}
/**
* Filter unique items of an array with strings
* @param {string[]} arr
* @return {string[]}
*/
function uniq(arr) {
var entries = {}
for (var i = 0; i < arr.length; i++) {
entries[arr[i]] = true;
}
return Object.keys(entries);
}
/**
* Flat map the result invoking a callback for every item in an array.
* https://gist.github.com/samgiles/762ee337dff48623e729
* @param {Array} arr
* @param {function} callback
* @return {Array}
*/
function flatMap(arr, callback) {
return Array.prototype.concat.apply([], arr.map(callback));
}
/**
* Retrieve the function name from a set of typed functions,
* and check whether the name of all functions match (if given)
* @param {function[]} fns
*/
function getName (fns) {
var name = '';
for (var i = 0; i < fns.length; i++) {
var fn = fns[i];
// check whether the names are the same when defined
if ((typeof fn.signatures === 'object' || typeof fn.signature === 'string') && fn.name !== '') {
if (name === '') {
name = fn.name;
}
else if (name !== fn.name) {
var err = new Error('Function names do not match (expected: ' + name + ', actual: ' + fn.name + ')');
err.data = {
actual: fn.name,
expected: name
};
throw err;
}
}
}
return name;
}
// extract and merge all signatures of a list with typed functions
function extractSignatures(fns) {
var err;
var signaturesMap = {};
function validateUnique(_signature, _fn) {
if (signaturesMap.hasOwnProperty(_signature) && _fn !== signaturesMap[_signature]) {
err = new Error('Signature "' + _signature + '" is defined twice');
err.data = {signature: _signature};
throw err;
// else: both signatures point to the same function, that's fine
}
}
for (var i = 0; i < fns.length; i++) {
var fn = fns[i];
// test whether this is a typed-function
if (typeof fn.signatures === 'object') {
// merge the signatures
for (var signature in fn.signatures) {
if (fn.signatures.hasOwnProperty(signature)) {
validateUnique(signature, fn.signatures[signature]);
signaturesMap[signature] = fn.signatures[signature];
}
}
}
else if (typeof fn.signature === 'string') {
validateUnique(fn.signature, fn);
signaturesMap[fn.signature] = fn;
}
else {
err = new TypeError('Function is no typed-function (index: ' + i + ')');
err.data = {index: i};
throw err;
}
}
return signaturesMap;
}
typed = createTypedFunction('typed', {
'string, Object': createTypedFunction,
'Object': function (signaturesMap) {
// find existing name
var fns = [];
for (var signature in signaturesMap) {
if (signaturesMap.hasOwnProperty(signature)) {
fns.push(signaturesMap[signature]);
}
}
var name = getName(fns);
return createTypedFunction(name, signaturesMap);
},
'...Function': function (fns) {
return createTypedFunction(getName(fns), extractSignatures(fns));
},
'string, ...Function': function (name, fns) {
return createTypedFunction(name, extractSignatures(fns));
}
});
typed.create = create;
typed.types = _types;
typed.conversions = _conversions;
typed.ignore = _ignore;
typed.convert = convert;
typed.find = find;
/**
* add a type
* @param {{name: string, test: function}} type
* @param {boolean} [beforeObjectTest=true]
* If true, the new test will be inserted before
* the test with name 'Object' (if any), since
* tests for Object match Array and classes too.
*/
typed.addType = function (type, beforeObjectTest) {
if (!type || typeof type.name !== 'string' || typeof type.test !== 'function') {
throw new TypeError('Object with properties {name: string, test: function} expected');
}
if (beforeObjectTest !== false) {
for (var i = 0; i < typed.types.length; i++) {
if (typed.types[i].name === 'Object') {
typed.types.splice(i, 0, type);
return
}
}
}
typed.types.push(type);
};
// add a conversion
typed.addConversion = function (conversion) {
if (!conversion
|| typeof conversion.from !== 'string'
|| typeof conversion.to !== 'string'
|| typeof conversion.convert !== 'function') {
throw new TypeError('Object with properties {from: string, to: string, convert: function} expected');
}
typed.conversions.push(conversion);
};
return typed;
}
return create();
}));
/***/ }),
/* 14 */
/***/ (function(module, exports, __webpack_require__) {
"use strict";
/* WEBPACK VAR INJECTION */(function(global) {
var width = 256;// each RC4 output is 0 <= x < 256
var chunks = 6;// at least six RC4 outputs for each double
var digits = 52;// there are 52 significant digits in a double
var pool = [];// pool: entropy pool starts empty
var GLOBAL = typeof global === 'undefined' ? window : global;
//
// The following constants are related to IEEE 754 limits.
//
var startdenom = Math.pow(width, chunks),
significance = Math.pow(2, digits),
overflow = significance * 2,
mask = width - 1;
var oldRandom = Math.random;
//
// seedrandom()
// This is the seedrandom function described above.
//
module.exports = function(seed, options) {
if (options && options.global === true) {
options.global = false;
Math.random = module.exports(seed, options);
options.global = true;
return Math.random;
}
var use_entropy = (options && options.entropy) || false;
var key = [];
// Flatten the seed string or build one from local entropy if needed.
var shortseed = mixkey(flatten(
use_entropy ? [seed, tostring(pool)] :
0 in arguments ? seed : autoseed(), 3), key);
// Use the seed to initialize an ARC4 generator.
var arc4 = new ARC4(key);
// Mix the randomness into accumulated entropy.
mixkey(tostring(arc4.S), pool);
// Override Math.random
// This function returns a random double in [0, 1) that contains
// randomness in every bit of the mantissa of the IEEE 754 value.
return function() { // Closure to return a random double:
var n = arc4.g(chunks), // Start with a numerator n < 2 ^ 48
d = startdenom, // and denominator d = 2 ^ 48.
x = 0; // and no 'extra last byte'.
while (n < significance) { // Fill up all significant digits by
n = (n + x) * width; // shifting numerator and
d *= width; // denominator and generating a
x = arc4.g(1); // new least-significant-byte.
}
while (n >= overflow) { // To avoid rounding up, before adding
n /= 2; // last byte, shift everything
d /= 2; // right using integer Math until
x >>>= 1; // we have exactly the desired bits.
}
return (n + x) / d; // Form the number within [0, 1).
};
};
module.exports.resetGlobal = function () {
Math.random = oldRandom;
};
//
// ARC4
//
// An ARC4 implementation. The constructor takes a key in the form of
// an array of at most (width) integers that should be 0 <= x < (width).
//
// The g(count) method returns a pseudorandom integer that concatenates
// the next (count) outputs from ARC4. Its return value is a number x
// that is in the range 0 <= x < (width ^ count).
//
/** @constructor */
function ARC4(key) {
var t, keylen = key.length,
me = this, i = 0, j = me.i = me.j = 0, s = me.S = [];
// The empty key [] is treated as [0].
if (!keylen) { key = [keylen++]; }
// Set up S using the standard key scheduling algorithm.
while (i < width) {
s[i] = i++;
}
for (i = 0; i < width; i++) {
s[i] = s[j = mask & (j + key[i % keylen] + (t = s[i]))];
s[j] = t;
}
// The "g" method returns the next (count) outputs as one number.
(me.g = function(count) {
// Using instance members instead of closure state nearly doubles speed.
var t, r = 0,
i = me.i, j = me.j, s = me.S;
while (count--) {
t = s[i = mask & (i + 1)];
r = r * width + s[mask & ((s[i] = s[j = mask & (j + t)]) + (s[j] = t))];
}
me.i = i; me.j = j;
return r;
// For robust unpredictability discard an initial batch of values.
// See http://www.rsa.com/rsalabs/node.asp?id=2009
})(width);
}
//
// flatten()
// Converts an object tree to nested arrays of strings.
//
function flatten(obj, depth) {
var result = [], typ = (typeof obj)[0], prop;
if (depth && typ == 'o') {
for (prop in obj) {
try { result.push(flatten(obj[prop], depth - 1)); } catch (e) {}
}
}
return (result.length ? result : typ == 's' ? obj : obj + '\0');
}
//
// mixkey()
// Mixes a string seed into a key that is an array of integers, and
// returns a shortened string seed that is equivalent to the result key.
//
function mixkey(seed, key) {
var stringseed = seed + '', smear, j = 0;
while (j < stringseed.length) {
key[mask & j] =
mask & ((smear ^= key[mask & j] * 19) + stringseed.charCodeAt(j++));
}
return tostring(key);
}
//
// autoseed()
// Returns an object for autoseeding, using window.crypto if available.
//
/** @param {Uint8Array=} seed */
function autoseed(seed) {
try {
GLOBAL.crypto.getRandomValues(seed = new Uint8Array(width));
return tostring(seed);
} catch (e) {
return [+new Date, GLOBAL, GLOBAL.navigator && GLOBAL.navigator.plugins,
GLOBAL.screen, tostring(pool)];
}
}
//
// tostring()
// Converts an array of charcodes to a string
//
function tostring(a) {
return String.fromCharCode.apply(0, a);
}
//
// When seedrandom.js is loaded, we immediately mix a few bits
// from the built-in RNG into the entropy pool. Because we do
// not want to intefere with determinstic PRNG state later,
// seedrandom will not call Math.random on its own again after
// initialization.
//
mixkey(Math.random(), pool);
/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(19)))
/***/ }),
/* 15 */
/***/ (function(module, exports, __webpack_require__) {
var __WEBPACK_AMD_DEFINE_RESULT__;;(function (globalScope) {
'use strict';
/*
* decimal.js v10.2.0
* An arbitrary-precision Decimal type for JavaScript.
* https://github.com/MikeMcl/decimal.js
* Copyright (c) 2019 Michael Mclaughlin <M8ch88l@gmail.com>
* MIT Licence
*/
// ----------------------------------- EDITABLE DEFAULTS ------------------------------------ //
// The maximum exponent magnitude.
// The limit on the value of `toExpNeg`, `toExpPos`, `minE` and `maxE`.
var EXP_LIMIT = 9e15, // 0 to 9e15
// The limit on the value of `precision`, and on the value of the first argument to
// `toDecimalPlaces`, `toExponential`, `toFixed`, `toPrecision` and `toSignificantDigits`.
MAX_DIGITS = 1e9, // 0 to 1e9
// Base conversion alphabet.
NUMERALS = '0123456789abcdef',
// The natural logarithm of 10 (1025 digits).
LN10 = '2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058',
// Pi (1025 digits).
PI = '3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789',
// The initial configuration properties of the Decimal constructor.
DEFAULTS = {
// These values must be integers within the stated ranges (inclusive).
// Most of these values can be changed at run-time using the `Decimal.config` method.
// The maximum number of significant digits of the result of a calculation or base conversion.
// E.g. `Decimal.config({ precision: 20 });`
precision: 20, // 1 to MAX_DIGITS
// The rounding mode used when rounding to `precision`.
//
// ROUND_UP 0 Away from zero.
// ROUND_DOWN 1 Towards zero.
// ROUND_CEIL 2 Towards +Infinity.
// ROUND_FLOOR 3 Towards -Infinity.
// ROUND_HALF_UP 4 Towards nearest neighbour. If equidistant, up.
// ROUND_HALF_DOWN 5 Towards nearest neighbour. If equidistant, down.
// ROUND_HALF_EVEN 6 Towards nearest neighbour. If equidistant, towards even neighbour.
// ROUND_HALF_CEIL 7 Towards nearest neighbour. If equidistant, towards +Infinity.
// ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.
//
// E.g.
// `Decimal.rounding = 4;`
// `Decimal.rounding = Decimal.ROUND_HALF_UP;`
rounding: 4, // 0 to 8
// The modulo mode used when calculating the modulus: a mod n.
// The quotient (q = a / n) is calculated according to the corresponding rounding mode.
// The remainder (r) is calculated as: r = a - n * q.
//
// UP 0 The remainder is positive if the dividend is negative, else is negative.
// DOWN 1 The remainder has the same sign as the dividend (JavaScript %).
// FLOOR 3 The remainder has the same sign as the divisor (Python %).
// HALF_EVEN 6 The IEEE 754 remainder function.
// EUCLID 9 Euclidian division. q = sign(n) * floor(a / abs(n)). Always positive.
//
// Truncated division (1), floored division (3), the IEEE 754 remainder (6), and Euclidian
// division (9) are commonly used for the modulus operation. The other rounding modes can also
// be used, but they may not give useful results.
modulo: 1, // 0 to 9
// The exponent value at and beneath which `toString` returns exponential notation.
// JavaScript numbers: -7
toExpNeg: -7, // 0 to -EXP_LIMIT
// The exponent value at and above which `toString` returns exponential notation.
// JavaScript numbers: 21
toExpPos: 21, // 0 to EXP_LIMIT
// The minimum exponent value, beneath which underflow to zero occurs.
// JavaScript numbers: -324 (5e-324)
minE: -EXP_LIMIT, // -1 to -EXP_LIMIT
// The maximum exponent value, above which overflow to Infinity occurs.
// JavaScript numbers: 308 (1.7976931348623157e+308)
maxE: EXP_LIMIT, // 1 to EXP_LIMIT
// Whether to use cryptographically-secure random number generation, if available.
crypto: false // true/false
},
// ----------------------------------- END OF EDITABLE DEFAULTS ------------------------------- //
Decimal, inexact, noConflict, quadrant,
external = true,
decimalError = '[DecimalError] ',
invalidArgument = decimalError + 'Invalid argument: ',
precisionLimitExceeded = decimalError + 'Precision limit exceeded',
cryptoUnavailable = decimalError + 'crypto unavailable',
mathfloor = Math.floor,
mathpow = Math.pow,
isBinary = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i,
isHex = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i,
isOctal = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i,
isDecimal = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i,
BASE = 1e7,
LOG_BASE = 7,
MAX_SAFE_INTEGER = 9007199254740991,
LN10_PRECISION = LN10.length - 1,
PI_PRECISION = PI.length - 1,
// Decimal.prototype object
P = { name: '[object Decimal]' };
// Decimal prototype methods
/*
* absoluteValue abs
* ceil
* comparedTo cmp
* cosine cos
* cubeRoot cbrt
* decimalPlaces dp
* dividedBy div
* dividedToIntegerBy divToInt
* equals eq
* floor
* greaterThan gt
* greaterThanOrEqualTo gte
* hyperbolicCosine cosh
* hyperbolicSine sinh
* hyperbolicTangent tanh
* inverseCosine acos
* inverseHyperbolicCosine acosh
* inverseHyperbolicSine asinh
* inverseHyperbolicTangent atanh
* inverseSine asin
* inverseTangent atan
* isFinite
* isInteger isInt
* isNaN
* isNegative isNeg
* isPositive isPos
* isZero
* lessThan lt
* lessThanOrEqualTo lte
* logarithm log
* [maximum] [max]
* [minimum] [min]
* minus sub
* modulo mod
* naturalExponential exp
* naturalLogarithm ln
* negated neg
* plus add
* precision sd
* round
* sine sin
* squareRoot sqrt
* tangent tan
* times mul
* toBinary
* toDecimalPlaces toDP
* toExponential
* toFixed
* toFraction
* toHexadecimal toHex
* toNearest
* toNumber
* toOctal
* toPower pow
* toPrecision
* toSignificantDigits toSD
* toString
* truncated trunc
* valueOf toJSON
*/
/*
* Return a new Decimal whose value is the absolute value of this Decimal.
*
*/
P.absoluteValue = P.abs = function () {
var x = new this.constructor(this);
if (x.s < 0) x.s = 1;
return finalise(x);
};
/*
* Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the
* direction of positive Infinity.
*
*/
P.ceil = function () {
return finalise(new this.constructor(this), this.e + 1, 2);
};
/*
* Return
* 1 if the value of this Decimal is greater than the value of `y`,
* -1 if the value of this Decimal is less than the value of `y`,
* 0 if they have the same value,
* NaN if the value of either Decimal is NaN.
*
*/
P.comparedTo = P.cmp = function (y) {
var i, j, xdL, ydL,
x = this,
xd = x.d,
yd = (y = new x.constructor(y)).d,
xs = x.s,
ys = y.s;
// Either NaN or ±Infinity?
if (!xd || !yd) {
return !xs || !ys ? NaN : xs !== ys ? xs : xd === yd ? 0 : !xd ^ xs < 0 ? 1 : -1;
}
// Either zero?
if (!xd[0] || !yd[0]) return xd[0] ? xs : yd[0] ? -ys : 0;
// Signs differ?
if (xs !== ys) return xs;
// Compare exponents.
if (x.e !== y.e) return x.e > y.e ^ xs < 0 ? 1 : -1;
xdL = xd.length;
ydL = yd.length;
// Compare digit by digit.
for (i = 0, j = xdL < ydL ? xdL : ydL; i < j; ++i) {
if (xd[i] !== yd[i]) return xd[i] > yd[i] ^ xs < 0 ? 1 : -1;
}
// Compare lengths.
return xdL === ydL ? 0 : xdL > ydL ^ xs < 0 ? 1 : -1;
};
/*
* Return a new Decimal whose value is the cosine of the value in radians of this Decimal.
*
* Domain: [-Infinity, Infinity]
* Range: [-1, 1]
*
* cos(0) = 1
* cos(-0) = 1
* cos(Infinity) = NaN
* cos(-Infinity) = NaN
* cos(NaN) = NaN
*
*/
P.cosine = P.cos = function () {
var pr, rm,
x = this,
Ctor = x.constructor;
if (!x.d) return new Ctor(NaN);
// cos(0) = cos(-0) = 1
if (!x.d[0]) return new Ctor(1);
pr = Ctor.precision;
rm = Ctor.rounding;
Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;
Ctor.rounding = 1;
x = cosine(Ctor, toLessThanHalfPi(Ctor, x));
Ctor.precision = pr;
Ctor.rounding = rm;
return finalise(quadrant == 2 || quadrant == 3 ? x.neg() : x, pr, rm, true);
};
/*
*
* Return a new Decimal whose value is the cube root of the value of this Decimal, rounded to
* `precision` significant digits using rounding mode `rounding`.
*
* cbrt(0) = 0
* cbrt(-0) = -0
* cbrt(1) = 1
* cbrt(-1) = -1
* cbrt(N) = N
* cbrt(-I) = -I
* cbrt(I) = I
*
* Math.cbrt(x) = (x < 0 ? -Math.pow(-x, 1/3) : Math.pow(x, 1/3))
*
*/
P.cubeRoot = P.cbrt = function () {
var e, m, n, r, rep, s, sd, t, t3, t3plusx,
x = this,
Ctor = x.constructor;
if (!x.isFinite() || x.isZero()) return new Ctor(x);
external = false;
// Initial estimate.
s = x.s * mathpow(x.s * x, 1 / 3);
// Math.cbrt underflow/overflow?
// Pass x to Math.pow as integer, then adjust the exponent of the result.
if (!s || Math.abs(s) == 1 / 0) {
n = digitsToString(x.d);
e = x.e;
// Adjust n exponent so it is a multiple of 3 away from x exponent.
if (s = (e - n.length + 1) % 3) n += (s == 1 || s == -2 ? '0' : '00');
s = mathpow(n, 1 / 3);
// Rarely, e may be one less than the result exponent value.
e = mathfloor((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2));
if (s == 1 / 0) {
n = '5e' + e;
} else {
n = s.toExponential();
n = n.slice(0, n.indexOf('e') + 1) + e;
}
r = new Ctor(n);
r.s = x.s;
} else {
r = new Ctor(s.toString());
}
sd = (e = Ctor.precision) + 3;
// Halley's method.
// TODO? Compare Newton's method.
for (;;) {
t = r;
t3 = t.times(t).times(t);
t3plusx = t3.plus(x);
r = divide(t3plusx.plus(x).times(t), t3plusx.plus(t3), sd + 2, 1);
// TODO? Replace with for-loop and checkRoundingDigits.
if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {
n = n.slice(sd - 3, sd + 1);
// The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or 4999
// , i.e. approaching a rounding boundary, continue the iteration.
if (n == '9999' || !rep && n == '4999') {
// On the first iteration only, check to see if rounding up gives the exact result as the
// nines may infinitely repeat.
if (!rep) {
finalise(t, e + 1, 0);
if (t.times(t).times(t).eq(x)) {
r = t;
break;
}
}
sd += 4;
rep = 1;
} else {
// If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.
// If not, then there are further digits and m will be truthy.
if (!+n || !+n.slice(1) && n.charAt(0) == '5') {
// Truncate to the first rounding digit.
finalise(r, e + 1, 1);
m = !r.times(r).times(r).eq(x);
}
break;
}
}
}
external = true;
return finalise(r, e, Ctor.rounding, m);
};
/*
* Return the number of decimal places of the value of this Decimal.
*
*/
P.decimalPlaces = P.dp = function () {
var w,
d = this.d,
n = NaN;
if (d) {
w = d.length - 1;
n = (w - mathfloor(this.e / LOG_BASE)) * LOG_BASE;
// Subtract the number of trailing zeros of the last word.
w = d[w];
if (w) for (; w % 10 == 0; w /= 10) n--;
if (n < 0) n = 0;
}
return n;
};
/*
* n / 0 = I
* n / N = N
* n / I = 0
* 0 / n = 0
* 0 / 0 = N
* 0 / N = N
* 0 / I = 0
* N / n = N
* N / 0 = N
* N / N = N
* N / I = N
* I / n = I
* I / 0 = I
* I / N = N
* I / I = N
*
* Return a new Decimal whose value is the value of this Decimal divided by `y`, rounded to
* `precision` significant digits using rounding mode `rounding`.
*
*/
P.dividedBy = P.div = function (y) {
return divide(this, new this.constructor(y));
};
/*
* Return a new Decimal whose value is the integer part of dividing the value of this Decimal
* by the value of `y`, rounded to `precision` significant digits using rounding mode `rounding`.
*
*/
P.dividedToIntegerBy = P.divToInt = function (y) {
var x = this,
Ctor = x.constructor;
return finalise(divide(x, new Ctor(y), 0, 1, 1), Ctor.precision, Ctor.rounding);
};
/*
* Return true if the value of this Decimal is equal to the value of `y`, otherwise return false.
*
*/
P.equals = P.eq = function (y) {
return this.cmp(y) === 0;
};
/*
* Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the
* direction of negative Infinity.
*
*/
P.floor = function () {
return finalise(new this.constructor(this), this.e + 1, 3);
};
/*
* Return true if the value of this Decimal is greater than the value of `y`, otherwise return
* false.
*
*/
P.greaterThan = P.gt = function (y) {
return this.cmp(y) > 0;
};
/*
* Return true if the value of this Decimal is greater than or equal to the value of `y`,
* otherwise return false.
*
*/
P.greaterThanOrEqualTo = P.gte = function (y) {
var k = this.cmp(y);
return k == 1 || k === 0;
};
/*
* Return a new Decimal whose value is the hyperbolic cosine of the value in radians of this
* Decimal.
*
* Domain: [-Infinity, Infinity]
* Range: [1, Infinity]
*
* cosh(x) = 1 + x^2/2! + x^4/4! + x^6/6! + ...
*
* cosh(0) = 1
* cosh(-0) = 1
* cosh(Infinity) = Infinity
* cosh(-Infinity) = Infinity
* cosh(NaN) = NaN
*
* x time taken (ms) result
* 1000 9 9.8503555700852349694e+433
* 10000 25 4.4034091128314607936e+4342
* 100000 171 1.4033316802130615897e+43429
* 1000000 3817 1.5166076984010437725e+434294
* 10000000 abandoned after 2 minute wait
*
* TODO? Compare performance of cosh(x) = 0.5 * (exp(x) + exp(-x))
*
*/
P.hyperbolicCosine = P.cosh = function () {
var k, n, pr, rm, len,
x = this,
Ctor = x.constructor,
one = new Ctor(1);
if (!x.isFinite()) return new Ctor(x.s ? 1 / 0 : NaN);
if (x.isZero()) return one;
pr = Ctor.precision;
rm = Ctor.rounding;
Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;
Ctor.rounding = 1;
len = x.d.length;
// Argument reduction: cos(4x) = 1 - 8cos^2(x) + 8cos^4(x) + 1
// i.e. cos(x) = 1 - cos^2(x/4)(8 - 8cos^2(x/4))
// Estimate the optimum number of times to use the argument reduction.
// TODO? Estimation reused from cosine() and may not be optimal here.
if (len < 32) {
k = Math.ceil(len / 3);
n = (1 / tinyPow(4, k)).toString();
} else {
k = 16;
n = '2.3283064365386962890625e-10';
}
x = taylorSeries(Ctor, 1, x.times(n), new Ctor(1), true);
// Reverse argument reduction
var cosh2_x,
i = k,
d8 = new Ctor(8);
for (; i--;) {
cosh2_x = x.times(x);
x = one.minus(cosh2_x.times(d8.minus(cosh2_x.times(d8))));
}
return finalise(x, Ctor.precision = pr, Ctor.rounding = rm, true);
};
/*
* Return a new Decimal whose value is the hyperbolic sine of the value in radians of this
* Decimal.
*
* Domain: [-Infinity, Infinity]
* Range: [-Infinity, Infinity]
*
* sinh(x) = x + x^3/3! + x^5/5! + x^7/7! + ...
*
* sinh(0) = 0
* sinh(-0) = -0
* sinh(Infinity) = Infinity
* sinh(-Infinity) = -Infinity
* sinh(NaN) = NaN
*
* x time taken (ms)
* 10 2 ms
* 100 5 ms
* 1000 14 ms
* 10000 82 ms
* 100000 886 ms 1.4033316802130615897e+43429
* 200000 2613 ms
* 300000 5407 ms
* 400000 8824 ms
* 500000 13026 ms 8.7080643612718084129e+217146
* 1000000 48543 ms
*
* TODO? Compare performance of sinh(x) = 0.5 * (exp(x) - exp(-x))
*
*/
P.hyperbolicSine = P.sinh = function () {
var k, pr, rm, len,
x = this,
Ctor = x.constructor;
if (!x.isFinite() || x.isZero()) return new Ctor(x);
pr = Ctor.precision;
rm = Ctor.rounding;
Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;
Ctor.rounding = 1;
len = x.d.length;
if (len < 3) {
x = taylorSeries(Ctor, 2, x, x, true);
} else {
// Alternative argument reduction: sinh(3x) = sinh(x)(3 + 4sinh^2(x))
// i.e. sinh(x) = sinh(x/3)(3 + 4sinh^2(x/3))
// 3 multiplications and 1 addition
// Argument reduction: sinh(5x) = sinh(x)(5 + sinh^2(x)(20 + 16sinh^2(x)))
// i.e. sinh(x) = sinh(x/5)(5 + sinh^2(x/5)(20 + 16sinh^2(x/5)))
// 4 multiplications and 2 additions
// Estimate the optimum number of times to use the argument reduction.
k = 1.4 * Math.sqrt(len);
k = k > 16 ? 16 : k | 0;
x = x.times(1 / tinyPow(5, k));
x = taylorSeries(Ctor, 2, x, x, true);
// Reverse argument reduction
var sinh2_x,
d5 = new Ctor(5),
d16 = new Ctor(16),
d20 = new Ctor(20);
for (; k--;) {
sinh2_x = x.times(x);
x = x.times(d5.plus(sinh2_x.times(d16.times(sinh2_x).plus(d20))));
}
}
Ctor.precision = pr;
Ctor.rounding = rm;
return finalise(x, pr, rm, true);
};
/*
* Return a new Decimal whose value is the hyperbolic tangent of the value in radians of this
* Decimal.
*
* Domain: [-Infinity, Infinity]
* Range: [-1, 1]
*
* tanh(x) = sinh(x) / cosh(x)
*
* tanh(0) = 0
* tanh(-0) = -0
* tanh(Infinity) = 1
* tanh(-Infinity) = -1
* tanh(NaN) = NaN
*
*/
P.hyperbolicTangent = P.tanh = function () {
var pr, rm,
x = this,
Ctor = x.constructor;
if (!x.isFinite()) return new Ctor(x.s);
if (x.isZero()) return new Ctor(x);
pr = Ctor.precision;
rm = Ctor.rounding;
Ctor.precision = pr + 7;
Ctor.rounding = 1;
return divide(x.sinh(), x.cosh(), Ctor.precision = pr, Ctor.rounding = rm);
};
/*
* Return a new Decimal whose value is the arccosine (inverse cosine) in radians of the value of
* this Decimal.
*
* Domain: [-1, 1]
* Range: [0, pi]
*
* acos(x) = pi/2 - asin(x)
*
* acos(0) = pi/2
* acos(-0) = pi/2
* acos(1) = 0
* acos(-1) = pi
* acos(1/2) = pi/3
* acos(-1/2) = 2*pi/3
* acos(|x| > 1) = NaN
* acos(NaN) = NaN
*
*/
P.inverseCosine = P.acos = function () {
var halfPi,
x = this,
Ctor = x.constructor,
k = x.abs().cmp(1),
pr = Ctor.precision,
rm = Ctor.rounding;
if (k !== -1) {
return k === 0
// |x| is 1
? x.isNeg() ? getPi(Ctor, pr, rm) : new Ctor(0)
// |x| > 1 or x is NaN
: new Ctor(NaN);
}
if (x.isZero()) return getPi(Ctor, pr + 4, rm).times(0.5);
// TODO? Special case acos(0.5) = pi/3 and acos(-0.5) = 2*pi/3
Ctor.precision = pr + 6;
Ctor.rounding = 1;
x = x.asin();
halfPi = getPi(Ctor, pr + 4, rm).times(0.5);
Ctor.precision = pr;
Ctor.rounding = rm;
return halfPi.minus(x);
};
/*
* Return a new Decimal whose value is the inverse of the hyperbolic cosine in radians of the
* value of this Decimal.
*
* Domain: [1, Infinity]
* Range: [0, Infinity]
*
* acosh(x) = ln(x + sqrt(x^2 - 1))
*
* acosh(x < 1) = NaN
* acosh(NaN) = NaN
* acosh(Infinity) = Infinity
* acosh(-Infinity) = NaN
* acosh(0) = NaN
* acosh(-0) = NaN
* acosh(1) = 0
* acosh(-1) = NaN
*
*/
P.inverseHyperbolicCosine = P.acosh = function () {
var pr, rm,
x = this,
Ctor = x.constructor;
if (x.lte(1)) return new Ctor(x.eq(1) ? 0 : NaN);
if (!x.isFinite()) return new Ctor(x);
pr = Ctor.precision;
rm = Ctor.rounding;
Ctor.precision = pr + Math.max(Math.abs(x.e), x.sd()) + 4;
Ctor.rounding = 1;
external = false;
x = x.times(x).minus(1).sqrt().plus(x);
external = true;
Ctor.precision = pr;
Ctor.rounding = rm;
return x.ln();
};
/*
* Return a new Decimal whose value is the inverse of the hyperbolic sine in radians of the value
* of this Decimal.
*
* Domain: [-Infinity, Infinity]
* Range: [-Infinity, Infinity]
*
* asinh(x) = ln(x + sqrt(x^2 + 1))
*
* asinh(NaN) = NaN
* asinh(Infinity) = Infinity
* asinh(-Infinity) = -Infinity
* asinh(0) = 0
* asinh(-0) = -0
*
*/
P.inverseHyperbolicSine = P.asinh = function () {
var pr, rm,
x = this,
Ctor = x.constructor;
if (!x.isFinite() || x.isZero()) return new Ctor(x);
pr = Ctor.precision;
rm = Ctor.rounding;
Ctor.precision = pr + 2 * Math.max(Math.abs(x.e), x.sd()) + 6;
Ctor.rounding = 1;
external = false;
x = x.times(x).plus(1).sqrt().plus(x);
external = true;
Ctor.precision = pr;
Ctor.rounding = rm;
return x.ln();
};
/*
* Return a new Decimal whose value is the inverse of the hyperbolic tangent in radians of the
* value of this Decimal.
*
* Domain: [-1, 1]
* Range: [-Infinity, Infinity]
*
* atanh(x) = 0.5 * ln((1 + x) / (1 - x))
*
* atanh(|x| > 1) = NaN
* atanh(NaN) = NaN
* atanh(Infinity) = NaN
* atanh(-Infinity) = NaN
* atanh(0) = 0
* atanh(-0) = -0
* atanh(1) = Infinity
* atanh(-1) = -Infinity
*
*/
P.inverseHyperbolicTangent = P.atanh = function () {
var pr, rm, wpr, xsd,
x = this,
Ctor = x.constructor;
if (!x.isFinite()) return new Ctor(NaN);
if (x.e >= 0) return new Ctor(x.abs().eq(1) ? x.s / 0 : x.isZero() ? x : NaN);
pr = Ctor.precision;
rm = Ctor.rounding;
xsd = x.sd();
if (Math.max(xsd, pr) < 2 * -x.e - 1) return finalise(new Ctor(x), pr, rm, true);
Ctor.precision = wpr = xsd - x.e;
x = divide(x.plus(1), new Ctor(1).minus(x), wpr + pr, 1);
Ctor.precision = pr + 4;
Ctor.rounding = 1;
x = x.ln();
Ctor.precision = pr;
Ctor.rounding = rm;
return x.times(0.5);
};
/*
* Return a new Decimal whose value is the arcsine (inverse sine) in radians of the value of this
* Decimal.
*
* Domain: [-Infinity, Infinity]
* Range: [-pi/2, pi/2]
*
* asin(x) = 2*atan(x/(1 + sqrt(1 - x^2)))
*
* asin(0) = 0
* asin(-0) = -0
* asin(1/2) = pi/6
* asin(-1/2) = -pi/6
* asin(1) = pi/2
* asin(-1) = -pi/2
* asin(|x| > 1) = NaN
* asin(NaN) = NaN
*
* TODO? Compare performance of Taylor series.
*
*/
P.inverseSine = P.asin = function () {
var halfPi, k,
pr, rm,
x = this,
Ctor = x.constructor;
if (x.isZero()) return new Ctor(x);
k = x.abs().cmp(1);
pr = Ctor.precision;
rm = Ctor.rounding;
if (k !== -1) {
// |x| is 1
if (k === 0) {
halfPi = getPi(Ctor, pr + 4, rm).times(0.5);
halfPi.s = x.s;
return halfPi;
}
// |x| > 1 or x is NaN
return new Ctor(NaN);
}
// TODO? Special case asin(1/2) = pi/6 and asin(-1/2) = -pi/6
Ctor.precision = pr + 6;
Ctor.rounding = 1;
x = x.div(new Ctor(1).minus(x.times(x)).sqrt().plus(1)).atan();
Ctor.precision = pr;
Ctor.rounding = rm;
return x.times(2);
};
/*
* Return a new Decimal whose value is the arctangent (inverse tangent) in radians of the value
* of this Decimal.
*
* Domain: [-Infinity, Infinity]
* Range: [-pi/2, pi/2]
*
* atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...
*
* atan(0) = 0
* atan(-0) = -0
* atan(1) = pi/4
* atan(-1) = -pi/4
* atan(Infinity) = pi/2
* atan(-Infinity) = -pi/2
* atan(NaN) = NaN
*
*/
P.inverseTangent = P.atan = function () {
var i, j, k, n, px, t, r, wpr, x2,
x = this,
Ctor = x.constructor,
pr = Ctor.precision,
rm = Ctor.rounding;
if (!x.isFinite()) {
if (!x.s) return new Ctor(NaN);
if (pr + 4 <= PI_PRECISION) {
r = getPi(Ctor, pr + 4, rm).times(0.5);
r.s = x.s;
return r;
}
} else if (x.isZero()) {
return new Ctor(x);
} else if (x.abs().eq(1) && pr + 4 <= PI_PRECISION) {
r = getPi(Ctor, pr + 4, rm).times(0.25);
r.s = x.s;
return r;
}
Ctor.precision = wpr = pr + 10;
Ctor.rounding = 1;
// TODO? if (x >= 1 && pr <= PI_PRECISION) atan(x) = halfPi * x.s - atan(1 / x);
// Argument reduction
// Ensure |x| < 0.42
// atan(x) = 2 * atan(x / (1 + sqrt(1 + x^2)))
k = Math.min(28, wpr / LOG_BASE + 2 | 0);
for (i = k; i; --i) x = x.div(x.times(x).plus(1).sqrt().plus(1));
external = false;
j = Math.ceil(wpr / LOG_BASE);
n = 1;
x2 = x.times(x);
r = new Ctor(x);
px = x;
// atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...
for (; i !== -1;) {
px = px.times(x2);
t = r.minus(px.div(n += 2));
px = px.times(x2);
r = t.plus(px.div(n += 2));
if (r.d[j] !== void 0) for (i = j; r.d[i] === t.d[i] && i--;);
}
if (k) r = r.times(2 << (k - 1));
external = true;
return finalise(r, Ctor.precision = pr, Ctor.rounding = rm, true);
};
/*
* Return true if the value of this Decimal is a finite number, otherwise return false.
*
*/
P.isFinite = function () {
return !!this.d;
};
/*
* Return true if the value of this Decimal is an integer, otherwise return false.
*
*/
P.isInteger = P.isInt = function () {
return !!this.d && mathfloor(this.e / LOG_BASE) > this.d.length - 2;
};
/*
* Return true if the value of this Decimal is NaN, otherwise return false.
*
*/
P.isNaN = function () {
return !this.s;
};
/*
* Return true if the value of this Decimal is negative, otherwise return false.
*
*/
P.isNegative = P.isNeg = function () {
return this.s < 0;
};
/*
* Return true if the value of this Decimal is positive, otherwise return false.
*
*/
P.isPositive = P.isPos = function () {
return this.s > 0;
};
/*
* Return true if the value of this Decimal is 0 or -0, otherwise return false.
*
*/
P.isZero = function () {
return !!this.d && this.d[0] === 0;
};
/*
* Return true if the value of this Decimal is less than `y`, otherwise return false.
*
*/
P.lessThan = P.lt = function (y) {
return this.cmp(y) < 0;
};
/*
* Return true if the value of this Decimal is less than or equal to `y`, otherwise return false.
*
*/
P.lessThanOrEqualTo = P.lte = function (y) {
return this.cmp(y) < 1;
};
/*
* Return the logarithm of the value of this Decimal to the specified base, rounded to `precision`
* significant digits using rounding mode `rounding`.
*
* If no base is specified, return log[10](arg).
*
* log[base](arg) = ln(arg) / ln(base)
*
* The result will always be correctly rounded if the base of the log is 10, and 'almost always'
* otherwise:
*
* Depending on the rounding mode, the result may be incorrectly rounded if the first fifteen
* rounding digits are [49]99999999999999 or [50]00000000000000. In that case, the maximum error
* between the result and the correctly rounded result will be one ulp (unit in the last place).
*
* log[-b](a) = NaN
* log[0](a) = NaN
* log[1](a) = NaN
* log[NaN](a) = NaN
* log[Infinity](a) = NaN
* log[b](0) = -Infinity
* log[b](-0) = -Infinity
* log[b](-a) = NaN
* log[b](1) = 0
* log[b](Infinity) = Infinity
* log[b](NaN) = NaN
*
* [base] {number|string|Decimal} The base of the logarithm.
*
*/
P.logarithm = P.log = function (base) {
var isBase10, d, denominator, k, inf, num, sd, r,
arg = this,
Ctor = arg.constructor,
pr = Ctor.precision,
rm = Ctor.rounding,
guard = 5;
// Default base is 10.
if (base == null) {
base = new Ctor(10);
isBase10 = true;
} else {
base = new Ctor(base);
d = base.d;
// Return NaN if base is negative, or non-finite, or is 0 or 1.
if (base.s < 0 || !d || !d[0] || base.eq(1)) return new Ctor(NaN);
isBase10 = base.eq(10);
}
d = arg.d;
// Is arg negative, non-finite, 0 or 1?
if (arg.s < 0 || !d || !d[0] || arg.eq(1)) {
return new Ctor(d && !d[0] ? -1 / 0 : arg.s != 1 ? NaN : d ? 0 : 1 / 0);
}
// The result will have a non-terminating decimal expansion if base is 10 and arg is not an
// integer power of 10.
if (isBase10) {
if (d.length > 1) {
inf = true;
} else {
for (k = d[0]; k % 10 === 0;) k /= 10;
inf = k !== 1;
}
}
external = false;
sd = pr + guard;
num = naturalLogarithm(arg, sd);
denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);
// The result will have 5 rounding digits.
r = divide(num, denominator, sd, 1);
// If at a rounding boundary, i.e. the result's rounding digits are [49]9999 or [50]0000,
// calculate 10 further digits.
//
// If the result is known to have an infinite decimal expansion, repeat this until it is clear
// that the result is above or below the boundary. Otherwise, if after calculating the 10
// further digits, the last 14 are nines, round up and assume the result is exact.
// Also assume the result is exact if the last 14 are zero.
//
// Example of a result that will be incorrectly rounded:
// log[1048576](4503599627370502) = 2.60000000000000009610279511444746...
// The above result correctly rounded using ROUND_CEIL to 1 decimal place should be 2.7, but it
// will be given as 2.6 as there are 15 zeros immediately after the requested decimal place, so
// the exact result would be assumed to be 2.6, which rounded using ROUND_CEIL to 1 decimal
// place is still 2.6.
if (checkRoundingDigits(r.d, k = pr, rm)) {
do {
sd += 10;
num = naturalLogarithm(arg, sd);
denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);
r = divide(num, denominator, sd, 1);
if (!inf) {
// Check for 14 nines from the 2nd rounding digit, as the first may be 4.
if (+digitsToString(r.d).slice(k + 1, k + 15) + 1 == 1e14) {
r = finalise(r, pr + 1, 0);
}
break;
}
} while (checkRoundingDigits(r.d, k += 10, rm));
}
external = true;
return finalise(r, pr, rm);
};
/*
* Return a new Decimal whose value is the maximum of the arguments and the value of this Decimal.
*
* arguments {number|string|Decimal}
*
P.max = function () {
Array.prototype.push.call(arguments, this);
return maxOrMin(this.constructor, arguments, 'lt');
};
*/
/*
* Return a new Decimal whose value is the minimum of the arguments and the value of this Decimal.
*
* arguments {number|string|Decimal}
*
P.min = function () {
Array.prototype.push.call(arguments, this);
return maxOrMin(this.constructor, arguments, 'gt');
};
*/
/*
* n - 0 = n
* n - N = N
* n - I = -I
* 0 - n = -n
* 0 - 0 = 0
* 0 - N = N
* 0 - I = -I
* N - n = N
* N - 0 = N
* N - N = N
* N - I = N
* I - n = I
* I - 0 = I
* I - N = N
* I - I = N
*
* Return a new Decimal whose value is the value of this Decimal minus `y`, rounded to `precision`
* significant digits using rounding mode `rounding`.
*
*/
P.minus = P.sub = function (y) {
var d, e, i, j, k, len, pr, rm, xd, xe, xLTy, yd,
x = this,
Ctor = x.constructor;
y = new Ctor(y);
// If either is not finite...
if (!x.d || !y.d) {
// Return NaN if either is NaN.
if (!x.s || !y.s) y = new Ctor(NaN);
// Return y negated if x is finite and y is ±Infinity.
else if (x.d) y.s = -y.s;
// Return x if y is finite and x is ±Infinity.
// Return x if both are ±Infinity with different signs.
// Return NaN if both are ±Infinity with the same sign.
else y = new Ctor(y.d || x.s !== y.s ? x : NaN);
return y;
}
// If signs differ...
if (x.s != y.s) {
y.s = -y.s;
return x.plus(y);
}
xd = x.d;
yd = y.d;
pr = Ctor.precision;
rm = Ctor.rounding;
// If either is zero...
if (!xd[0] || !yd[0]) {
// Return y negated if x is zero and y is non-zero.
if (yd[0]) y.s = -y.s;
// Return x if y is zero and x is non-zero.
else if (xd[0]) y = new Ctor(x);
// Return zero if both are zero.
// From IEEE 754 (2008) 6.3: 0 - 0 = -0 - -0 = -0 when rounding to -Infinity.
else return new Ctor(rm === 3 ? -0 : 0);
return external ? finalise(y, pr, rm) : y;
}
// x and y are finite, non-zero numbers with the same sign.
// Calculate base 1e7 exponents.
e = mathfloor(y.e / LOG_BASE);
xe = mathfloor(x.e / LOG_BASE);
xd = xd.slice();
k = xe - e;
// If base 1e7 exponents differ...
if (k) {
xLTy = k < 0;
if (xLTy) {
d = xd;
k = -k;
len = yd.length;
} else {
d = yd;
e = xe;
len = xd.length;
}
// Numbers with massively different exponents would result in a very high number of
// zeros needing to be prepended, but this can be avoided while still ensuring correct
// rounding by limiting the number of zeros to `Math.ceil(pr / LOG_BASE) + 2`.
i = Math.max(Math.ceil(pr / LOG_BASE), len) + 2;
if (k > i) {
k = i;
d.length = 1;
}
// Prepend zeros to equalise exponents.
d.reverse();
for (i = k; i--;) d.push(0);
d.reverse();
// Base 1e7 exponents equal.
} else {
// Check digits to determine which is the bigger number.
i = xd.length;
len = yd.length;
xLTy = i < len;
if (xLTy) len = i;
for (i = 0; i < len; i++) {
if (xd[i] != yd[i]) {
xLTy = xd[i] < yd[i];
break;
}
}
k = 0;
}
if (xLTy) {
d = xd;
xd = yd;
yd = d;
y.s = -y.s;
}
len = xd.length;
// Append zeros to `xd` if shorter.
// Don't add zeros to `yd` if shorter as subtraction only needs to start at `yd` length.
for (i = yd.length - len; i > 0; --i) xd[len++] = 0;
// Subtract yd from xd.
for (i = yd.length; i > k;) {
if (xd[--i] < yd[i]) {
for (j = i; j && xd[--j] === 0;) xd[j] = BASE - 1;
--xd[j];
xd[i] += BASE;
}
xd[i] -= yd[i];
}
// Remove trailing zeros.
for (; xd[--len] === 0;) xd.pop();
// Remove leading zeros and adjust exponent accordingly.
for (; xd[0] === 0; xd.shift()) --e;
// Zero?
if (!xd[0]) return new Ctor(rm === 3 ? -0 : 0);
y.d = xd;
y.e = getBase10Exponent(xd, e);
return external ? finalise(y, pr, rm) : y;
};
/*
* n % 0 = N
* n % N = N
* n % I = n
* 0 % n = 0
* -0 % n = -0
* 0 % 0 = N
* 0 % N = N
* 0 % I = 0
* N % n = N
* N % 0 = N
* N % N = N
* N % I = N
* I % n = N
* I % 0 = N
* I % N = N
* I % I = N
*
* Return a new Decimal whose value is the value of this Decimal modulo `y`, rounded to
* `precision` significant digits using rounding mode `rounding`.
*
* The result depends on the modulo mode.
*
*/
P.modulo = P.mod = function (y) {
var q,
x = this,
Ctor = x.constructor;
y = new Ctor(y);
// Return NaN if x is ±Infinity or NaN, or y is NaN or ±0.
if (!x.d || !y.s || y.d && !y.d[0]) return new Ctor(NaN);
// Return x if y is ±Infinity or x is ±0.
if (!y.d || x.d && !x.d[0]) {
return finalise(new Ctor(x), Ctor.precision, Ctor.rounding);
}
// Prevent rounding of intermediate calculations.
external = false;
if (Ctor.modulo == 9) {
// Euclidian division: q = sign(y) * floor(x / abs(y))
// result = x - q * y where 0 <= result < abs(y)
q = divide(x, y.abs(), 0, 3, 1);
q.s *= y.s;
} else {
q = divide(x, y, 0, Ctor.modulo, 1);
}
q = q.times(y);
external = true;
return x.minus(q);
};
/*
* Return a new Decimal whose value is the natural exponential of the value of this Decimal,
* i.e. the base e raised to the power the value of this Decimal, rounded to `precision`
* significant digits using rounding mode `rounding`.
*
*/
P.naturalExponential = P.exp = function () {
return naturalExponential(this);
};
/*
* Return a new Decimal whose value is the natural logarithm of the value of this Decimal,
* rounded to `precision` significant digits using rounding mode `rounding`.
*
*/
P.naturalLogarithm = P.ln = function () {
return naturalLogarithm(this);
};
/*
* Return a new Decimal whose value is the value of this Decimal negated, i.e. as if multiplied by
* -1.
*
*/
P.negated = P.neg = function () {
var x = new this.constructor(this);
x.s = -x.s;
return finalise(x);
};
/*
* n + 0 = n
* n + N = N
* n + I = I
* 0 + n = n
* 0 + 0 = 0
* 0 + N = N
* 0 + I = I
* N + n = N
* N + 0 = N
* N + N = N
* N + I = N
* I + n = I
* I + 0 = I
* I + N = N
* I + I = I
*
* Return a new Decimal whose value is the value of this Decimal plus `y`, rounded to `precision`
* significant digits using rounding mode `rounding`.
*
*/
P.plus = P.add = function (y) {
var carry, d, e, i, k, len, pr, rm, xd, yd,
x = this,
Ctor = x.constructor;
y = new Ctor(y);
// If either is not finite...
if (!x.d || !y.d) {
// Return NaN if either is NaN.
if (!x.s || !y.s) y = new Ctor(NaN);
// Return x if y is finite and x is ±Infinity.
// Return x if both are ±Infinity with the same sign.
// Return NaN if both are ±Infinity with different signs.
// Return y if x is finite and y is ±Infinity.
else if (!x.d) y = new Ctor(y.d || x.s === y.s ? x : NaN);
return y;
}
// If signs differ...
if (x.s != y.s) {
y.s = -y.s;
return x.minus(y);
}
xd = x.d;
yd = y.d;
pr = Ctor.precision;
rm = Ctor.rounding;
// If either is zero...
if (!xd[0] || !yd[0]) {
// Return x if y is zero.
// Return y if y is non-zero.
if (!yd[0]) y = new Ctor(x);
return external ? finalise(y, pr, rm) : y;
}
// x and y are finite, non-zero numbers with the same sign.
// Calculate base 1e7 exponents.
k = mathfloor(x.e / LOG_BASE);
e = mathfloor(y.e / LOG_BASE);
xd = xd.slice();
i = k - e;
// If base 1e7 exponents differ...
if (i) {
if (i < 0) {
d = xd;
i = -i;
len = yd.length;
} else {
d = yd;
e = k;
len = xd.length;
}
// Limit number of zeros prepended to max(ceil(pr / LOG_BASE), len) + 1.
k = Math.ceil(pr / LOG_BASE);
len = k > len ? k + 1 : len + 1;
if (i > len) {
i = len;
d.length = 1;
}
// Prepend zeros to equalise exponents. Note: Faster to use reverse then do unshifts.
d.reverse();
for (; i--;) d.push(0);
d.reverse();
}
len = xd.length;
i = yd.length;
// If yd is longer than xd, swap xd and yd so xd points to the longer array.
if (len - i < 0) {
i = len;
d = yd;
yd = xd;
xd = d;
}
// Only start adding at yd.length - 1 as the further digits of xd can be left as they are.
for (carry = 0; i;) {
carry = (xd[--i] = xd[i] + yd[i] + carry) / BASE | 0;
xd[i] %= BASE;
}
if (carry) {
xd.unshift(carry);
++e;
}
// Remove trailing zeros.
// No need to check for zero, as +x + +y != 0 && -x + -y != 0
for (len = xd.length; xd[--len] == 0;) xd.pop();
y.d = xd;
y.e = getBase10Exponent(xd, e);
return external ? finalise(y, pr, rm) : y;
};
/*
* Return the number of significant digits of the value of this Decimal.
*
* [z] {boolean|number} Whether to count integer-part trailing zeros: true, false, 1 or 0.
*
*/
P.precision = P.sd = function (z) {
var k,
x = this;
if (z !== void 0 && z !== !!z && z !== 1 && z !== 0) throw Error(invalidArgument + z);
if (x.d) {
k = getPrecision(x.d);
if (z && x.e + 1 > k) k = x.e + 1;
} else {
k = NaN;
}
return k;
};
/*
* Return a new Decimal whose value is the value of this Decimal rounded to a whole number using
* rounding mode `rounding`.
*
*/
P.round = function () {
var x = this,
Ctor = x.constructor;
return finalise(new Ctor(x), x.e + 1, Ctor.rounding);
};
/*
* Return a new Decimal whose value is the sine of the value in radians of this Decimal.
*
* Domain: [-Infinity, Infinity]
* Range: [-1, 1]
*
* sin(x) = x - x^3/3! + x^5/5! - ...
*
* sin(0) = 0
* sin(-0) = -0
* sin(Infinity) = NaN
* sin(-Infinity) = NaN
* sin(NaN) = NaN
*
*/
P.sine = P.sin = function () {
var pr, rm,
x = this,
Ctor = x.constructor;
if (!x.isFinite()) return new Ctor(NaN);
if (x.isZero()) return new Ctor(x);
pr = Ctor.precision;
rm = Ctor.rounding;
Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;
Ctor.rounding = 1;
x = sine(Ctor, toLessThanHalfPi(Ctor, x));
Ctor.precision = pr;
Ctor.rounding = rm;
return finalise(quadrant > 2 ? x.neg() : x, pr, rm, true);
};
/*
* Return a new Decimal whose value is the square root of this Decimal, rounded to `precision`
* significant digits using rounding mode `rounding`.
*
* sqrt(-n) = N
* sqrt(N) = N
* sqrt(-I) = N
* sqrt(I) = I
* sqrt(0) = 0
* sqrt(-0) = -0
*
*/
P.squareRoot = P.sqrt = function () {
var m, n, sd, r, rep, t,
x = this,
d = x.d,
e = x.e,
s = x.s,
Ctor = x.constructor;
// Negative/NaN/Infinity/zero?
if (s !== 1 || !d || !d[0]) {
return new Ctor(!s || s < 0 && (!d || d[0]) ? NaN : d ? x : 1 / 0);
}
external = false;
// Initial estimate.
s = Math.sqrt(+x);
// Math.sqrt underflow/overflow?
// Pass x to Math.sqrt as integer, then adjust the exponent of the result.
if (s == 0 || s == 1 / 0) {
n = digitsToString(d);
if ((n.length + e) % 2 == 0) n += '0';
s = Math.sqrt(n);
e = mathfloor((e + 1) / 2) - (e < 0 || e % 2);
if (s == 1 / 0) {
n = '1e' + e;
} else {
n = s.toExponential();
n = n.slice(0, n.indexOf('e') + 1) + e;
}
r = new Ctor(n);
} else {
r = new Ctor(s.toString());
}
sd = (e = Ctor.precision) + 3;
// Newton-Raphson iteration.
for (;;) {
t = r;
r = t.plus(divide(x, t, sd + 2, 1)).times(0.5);
// TODO? Replace with for-loop and checkRoundingDigits.
if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {
n = n.slice(sd - 3, sd + 1);
// The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or
// 4999, i.e. approaching a rounding boundary, continue the iteration.
if (n == '9999' || !rep && n == '4999') {
// On the first iteration only, check to see if rounding up gives the exact result as the
// nines may infinitely repeat.
if (!rep) {
finalise(t, e + 1, 0);
if (t.times(t).eq(x)) {
r = t;
break;
}
}
sd += 4;
rep = 1;
} else {
// If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.
// If not, then there are further digits and m will be truthy.
if (!+n || !+n.slice(1) && n.charAt(0) == '5') {
// Truncate to the first rounding digit.
finalise(r, e + 1, 1);
m = !r.times(r).eq(x);
}
break;
}
}
}
external = true;
return finalise(r, e, Ctor.rounding, m);
};
/*
* Return a new Decimal whose value is the tangent of the value in radians of this Decimal.
*
* Domain: [-Infinity, Infinity]
* Range: [-Infinity, Infinity]
*
* tan(0) = 0
* tan(-0) = -0
* tan(Infinity) = NaN
* tan(-Infinity) = NaN
* tan(NaN) = NaN
*
*/
P.tangent = P.tan = function () {
var pr, rm,
x = this,
Ctor = x.constructor;
if (!x.isFinite()) return new Ctor(NaN);
if (x.isZero()) return new Ctor(x);
pr = Ctor.precision;
rm = Ctor.rounding;
Ctor.precision = pr + 10;
Ctor.rounding = 1;
x = x.sin();
x.s = 1;
x = divide(x, new Ctor(1).minus(x.times(x)).sqrt(), pr + 10, 0);
Ctor.precision = pr;
Ctor.rounding = rm;
return finalise(quadrant == 2 || quadrant == 4 ? x.neg() : x, pr, rm, true);
};
/*
* n * 0 = 0
* n * N = N
* n * I = I
* 0 * n = 0
* 0 * 0 = 0
* 0 * N = N
* 0 * I = N
* N * n = N
* N * 0 = N
* N * N = N
* N * I = N
* I * n = I
* I * 0 = N
* I * N = N
* I * I = I
*
* Return a new Decimal whose value is this Decimal times `y`, rounded to `precision` significant
* digits using rounding mode `rounding`.
*
*/
P.times = P.mul = function (y) {
var carry, e, i, k, r, rL, t, xdL, ydL,
x = this,
Ctor = x.constructor,
xd = x.d,
yd = (y = new Ctor(y)).d;
y.s *= x.s;
// If either is NaN, ±Infinity or ±0...
if (!xd || !xd[0] || !yd || !yd[0]) {
return new Ctor(!y.s || xd && !xd[0] && !yd || yd && !yd[0] && !xd
// Return NaN if either is NaN.
// Return NaN if x is ±0 and y is ±Infinity, or y is ±0 and x is ±Infinity.
? NaN
// Return ±Infinity if either is ±Infinity.
// Return ±0 if either is ±0.
: !xd || !yd ? y.s / 0 : y.s * 0);
}
e = mathfloor(x.e / LOG_BASE) + mathfloor(y.e / LOG_BASE);
xdL = xd.length;
ydL = yd.length;
// Ensure xd points to the longer array.
if (xdL < ydL) {
r = xd;
xd = yd;
yd = r;
rL = xdL;
xdL = ydL;
ydL = rL;
}
// Initialise the result array with zeros.
r = [];
rL = xdL + ydL;
for (i = rL; i--;) r.push(0);
// Multiply!
for (i = ydL; --i >= 0;) {
carry = 0;
for (k = xdL + i; k > i;) {
t = r[k] + yd[i] * xd[k - i - 1] + carry;
r[k--] = t % BASE | 0;
carry = t / BASE | 0;
}
r[k] = (r[k] + carry) % BASE | 0;
}
// Remove trailing zeros.
for (; !r[--rL];) r.pop();
if (carry) ++e;
else r.shift();
y.d = r;
y.e = getBase10Exponent(r, e);
return external ? finalise(y, Ctor.precision, Ctor.rounding) : y;
};
/*
* Return a string representing the value of this Decimal in base 2, round to `sd` significant
* digits using rounding mode `rm`.
*
* If the optional `sd` argument is present then return binary exponential notation.
*
* [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
*
*/
P.toBinary = function (sd, rm) {
return toStringBinary(this, 2, sd, rm);
};
/*
* Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `dp`
* decimal places using rounding mode `rm` or `rounding` if `rm` is omitted.
*
* If `dp` is omitted, return a new Decimal whose value is the value of this Decimal.
*
* [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
*
*/
P.toDecimalPlaces = P.toDP = function (dp, rm) {
var x = this,
Ctor = x.constructor;
x = new Ctor(x);
if (dp === void 0) return x;
checkInt32(dp, 0, MAX_DIGITS);
if (rm === void 0) rm = Ctor.rounding;
else checkInt32(rm, 0, 8);
return finalise(x, dp + x.e + 1, rm);
};
/*
* Return a string representing the value of this Decimal in exponential notation rounded to
* `dp` fixed decimal places using rounding mode `rounding`.
*
* [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
*
*/
P.toExponential = function (dp, rm) {
var str,
x = this,
Ctor = x.constructor;
if (dp === void 0) {
str = finiteToString(x, true);
} else {
checkInt32(dp, 0, MAX_DIGITS);
if (rm === void 0) rm = Ctor.rounding;
else checkInt32(rm, 0, 8);
x = finalise(new Ctor(x), dp + 1, rm);
str = finiteToString(x, true, dp + 1);
}
return x.isNeg() && !x.isZero() ? '-' + str : str;
};
/*
* Return a string representing the value of this Decimal in normal (fixed-point) notation to
* `dp` fixed decimal places and rounded using rounding mode `rm` or `rounding` if `rm` is
* omitted.
*
* As with JavaScript numbers, (-0).toFixed(0) is '0', but e.g. (-0.00001).toFixed(0) is '-0'.
*
* [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
*
* (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.
* (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.
* (-0).toFixed(3) is '0.000'.
* (-0.5).toFixed(0) is '-0'.
*
*/
P.toFixed = function (dp, rm) {
var str, y,
x = this,
Ctor = x.constructor;
if (dp === void 0) {
str = finiteToString(x);
} else {
checkInt32(dp, 0, MAX_DIGITS);
if (rm === void 0) rm = Ctor.rounding;
else checkInt32(rm, 0, 8);
y = finalise(new Ctor(x), dp + x.e + 1, rm);
str = finiteToString(y, false, dp + y.e + 1);
}
// To determine whether to add the minus sign look at the value before it was rounded,
// i.e. look at `x` rather than `y`.
return x.isNeg() && !x.isZero() ? '-' + str : str;
};
/*
* Return an array representing the value of this Decimal as a simple fraction with an integer
* numerator and an integer denominator.
*
* The denominator will be a positive non-zero value less than or equal to the specified maximum
* denominator. If a maximum denominator is not specified, the denominator will be the lowest
* value necessary to represent the number exactly.
*
* [maxD] {number|string|Decimal} Maximum denominator. Integer >= 1 and < Infinity.
*
*/
P.toFraction = function (maxD) {
var d, d0, d1, d2, e, k, n, n0, n1, pr, q, r,
x = this,
xd = x.d,
Ctor = x.constructor;
if (!xd) return new Ctor(x);
n1 = d0 = new Ctor(1);
d1 = n0 = new Ctor(0);
d = new Ctor(d1);
e = d.e = getPrecision(xd) - x.e - 1;
k = e % LOG_BASE;
d.d[0] = mathpow(10, k < 0 ? LOG_BASE + k : k);
if (maxD == null) {
// d is 10**e, the minimum max-denominator needed.
maxD = e > 0 ? d : n1;
} else {
n = new Ctor(maxD);
if (!n.isInt() || n.lt(n1)) throw Error(invalidArgument + n);
maxD = n.gt(d) ? (e > 0 ? d : n1) : n;
}
external = false;
n = new Ctor(digitsToString(xd));
pr = Ctor.precision;
Ctor.precision = e = xd.length * LOG_BASE * 2;
for (;;) {
q = divide(n, d, 0, 1, 1);
d2 = d0.plus(q.times(d1));
if (d2.cmp(maxD) == 1) break;
d0 = d1;
d1 = d2;
d2 = n1;
n1 = n0.plus(q.times(d2));
n0 = d2;
d2 = d;
d = n.minus(q.times(d2));
n = d2;
}
d2 = divide(maxD.minus(d0), d1, 0, 1, 1);
n0 = n0.plus(d2.times(n1));
d0 = d0.plus(d2.times(d1));
n0.s = n1.s = x.s;
// Determine which fraction is closer to x, n0/d0 or n1/d1?
r = divide(n1, d1, e, 1).minus(x).abs().cmp(divide(n0, d0, e, 1).minus(x).abs()) < 1
? [n1, d1] : [n0, d0];
Ctor.precision = pr;
external = true;
return r;
};
/*
* Return a string representing the value of this Decimal in base 16, round to `sd` significant
* digits using rounding mode `rm`.
*
* If the optional `sd` argument is present then return binary exponential notation.
*
* [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
*
*/
P.toHexadecimal = P.toHex = function (sd, rm) {
return toStringBinary(this, 16, sd, rm);
};
/*
* Returns a new Decimal whose value is the nearest multiple of `y` in the direction of rounding
* mode `rm`, or `Decimal.rounding` if `rm` is omitted, to the value of this Decimal.
*
* The return value will always have the same sign as this Decimal, unless either this Decimal
* or `y` is NaN, in which case the return value will be also be NaN.
*
* The return value is not affected by the value of `precision`.
*
* y {number|string|Decimal} The magnitude to round to a multiple of.
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
*
* 'toNearest() rounding mode not an integer: {rm}'
* 'toNearest() rounding mode out of range: {rm}'
*
*/
P.toNearest = function (y, rm) {
var x = this,
Ctor = x.constructor;
x = new Ctor(x);
if (y == null) {
// If x is not finite, return x.
if (!x.d) return x;
y = new Ctor(1);
rm = Ctor.rounding;
} else {
y = new Ctor(y);
if (rm === void 0) {
rm = Ctor.rounding;
} else {
checkInt32(rm, 0, 8);
}
// If x is not finite, return x if y is not NaN, else NaN.
if (!x.d) return y.s ? x : y;
// If y is not finite, return Infinity with the sign of x if y is Infinity, else NaN.
if (!y.d) {
if (y.s) y.s = x.s;
return y;
}
}
// If y is not zero, calculate the nearest multiple of y to x.
if (y.d[0]) {
external = false;
x = divide(x, y, 0, rm, 1).times(y);
external = true;
finalise(x);
// If y is zero, return zero with the sign of x.
} else {
y.s = x.s;
x = y;
}
return x;
};
/*
* Return the value of this Decimal converted to a number primitive.
* Zero keeps its sign.
*
*/
P.toNumber = function () {
return +this;
};
/*
* Return a string representing the value of this Decimal in base 8, round to `sd` significant
* digits using rounding mode `rm`.
*
* If the optional `sd` argument is present then return binary exponential notation.
*
* [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
*
*/
P.toOctal = function (sd, rm) {
return toStringBinary(this, 8, sd, rm);
};
/*
* Return a new Decimal whose value is the value of this Decimal raised to the power `y`, rounded
* to `precision` significant digits using rounding mode `rounding`.
*
* ECMAScript compliant.
*
* pow(x, NaN) = NaN
* pow(x, ±0) = 1
* pow(NaN, non-zero) = NaN
* pow(abs(x) > 1, +Infinity) = +Infinity
* pow(abs(x) > 1, -Infinity) = +0
* pow(abs(x) == 1, ±Infinity) = NaN
* pow(abs(x) < 1, +Infinity) = +0
* pow(abs(x) < 1, -Infinity) = +Infinity
* pow(+Infinity, y > 0) = +Infinity
* pow(+Infinity, y < 0) = +0
* pow(-Infinity, odd integer > 0) = -Infinity
* pow(-Infinity, even integer > 0) = +Infinity
* pow(-Infinity, odd integer < 0) = -0
* pow(-Infinity, even integer < 0) = +0
* pow(+0, y > 0) = +0
* pow(+0, y < 0) = +Infinity
* pow(-0, odd integer > 0) = -0
* pow(-0, even integer > 0) = +0
* pow(-0, odd integer < 0) = -Infinity
* pow(-0, even integer < 0) = +Infinity
* pow(finite x < 0, finite non-integer) = NaN
*
* For non-integer or very large exponents pow(x, y) is calculated using
*
* x^y = exp(y*ln(x))
*
* Assuming the first 15 rounding digits are each equally likely to be any digit 0-9, the
* probability of an incorrectly rounded result
* P([49]9{14} | [50]0{14}) = 2 * 0.2 * 10^-14 = 4e-15 = 1/2.5e+14
* i.e. 1 in 250,000,000,000,000
*
* If a result is incorrectly rounded the maximum error will be 1 ulp (unit in last place).
*
* y {number|string|Decimal} The power to which to raise this Decimal.
*
*/
P.toPower = P.pow = function (y) {
var e, k, pr, r, rm, s,
x = this,
Ctor = x.constructor,
yn = +(y = new Ctor(y));
// Either ±Infinity, NaN or ±0?
if (!x.d || !y.d || !x.d[0] || !y.d[0]) return new Ctor(mathpow(+x, yn));
x = new Ctor(x);
if (x.eq(1)) return x;
pr = Ctor.precision;
rm = Ctor.rounding;
if (y.eq(1)) return finalise(x, pr, rm);
// y exponent
e = mathfloor(y.e / LOG_BASE);
// If y is a small integer use the 'exponentiation by squaring' algorithm.
if (e >= y.d.length - 1 && (k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {
r = intPow(Ctor, x, k, pr);
return y.s < 0 ? new Ctor(1).div(r) : finalise(r, pr, rm);
}
s = x.s;
// if x is negative
if (s < 0) {
// if y is not an integer
if (e < y.d.length - 1) return new Ctor(NaN);
// Result is positive if x is negative and the last digit of integer y is even.
if ((y.d[e] & 1) == 0) s = 1;
// if x.eq(-1)
if (x.e == 0 && x.d[0] == 1 && x.d.length == 1) {
x.s = s;
return x;
}
}
// Estimate result exponent.
// x^y = 10^e, where e = y * log10(x)
// log10(x) = log10(x_significand) + x_exponent
// log10(x_significand) = ln(x_significand) / ln(10)
k = mathpow(+x, yn);
e = k == 0 || !isFinite(k)
? mathfloor(yn * (Math.log('0.' + digitsToString(x.d)) / Math.LN10 + x.e + 1))
: new Ctor(k + '').e;
// Exponent estimate may be incorrect e.g. x: 0.999999999999999999, y: 2.29, e: 0, r.e: -1.
// Overflow/underflow?
if (e > Ctor.maxE + 1 || e < Ctor.minE - 1) return new Ctor(e > 0 ? s / 0 : 0);
external = false;
Ctor.rounding = x.s = 1;
// Estimate the extra guard digits needed to ensure five correct rounding digits from
// naturalLogarithm(x). Example of failure without these extra digits (precision: 10):
// new Decimal(2.32456).pow('2087987436534566.46411')
// should be 1.162377823e+764914905173815, but is 1.162355823e+764914905173815
k = Math.min(12, (e + '').length);
// r = x^y = exp(y*ln(x))
r = naturalExponential(y.times(naturalLogarithm(x, pr + k)), pr);
// r may be Infinity, e.g. (0.9999999999999999).pow(-1e+40)
if (r.d) {
// Truncate to the required precision plus five rounding digits.
r = finalise(r, pr + 5, 1);
// If the rounding digits are [49]9999 or [50]0000 increase the precision by 10 and recalculate
// the result.
if (checkRoundingDigits(r.d, pr, rm)) {
e = pr + 10;
// Truncate to the increased precision plus five rounding digits.
r = finalise(naturalExponential(y.times(naturalLogarithm(x, e + k)), e), e + 5, 1);
// Check for 14 nines from the 2nd rounding digit (the first rounding digit may be 4 or 9).
if (+digitsToString(r.d).slice(pr + 1, pr + 15) + 1 == 1e14) {
r = finalise(r, pr + 1, 0);
}
}
}
r.s = s;
external = true;
Ctor.rounding = rm;
return finalise(r, pr, rm);
};
/*
* Return a string representing the value of this Decimal rounded to `sd` significant digits
* using rounding mode `rounding`.
*
* Return exponential notation if `sd` is less than the number of digits necessary to represent
* the integer part of the value in normal notation.
*
* [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
*
*/
P.toPrecision = function (sd, rm) {
var str,
x = this,
Ctor = x.constructor;
if (sd === void 0) {
str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);
} else {
checkInt32(sd, 1, MAX_DIGITS);
if (rm === void 0) rm = Ctor.rounding;
else checkInt32(rm, 0, 8);
x = finalise(new Ctor(x), sd, rm);
str = finiteToString(x, sd <= x.e || x.e <= Ctor.toExpNeg, sd);
}
return x.isNeg() && !x.isZero() ? '-' + str : str;
};
/*
* Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `sd`
* significant digits using rounding mode `rm`, or to `precision` and `rounding` respectively if
* omitted.
*
* [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
*
* 'toSD() digits out of range: {sd}'
* 'toSD() digits not an integer: {sd}'
* 'toSD() rounding mode not an integer: {rm}'
* 'toSD() rounding mode out of range: {rm}'
*
*/
P.toSignificantDigits = P.toSD = function (sd, rm) {
var x = this,
Ctor = x.constructor;
if (sd === void 0) {
sd = Ctor.precision;
rm = Ctor.rounding;
} else {
checkInt32(sd, 1, MAX_DIGITS);
if (rm === void 0) rm = Ctor.rounding;
else checkInt32(rm, 0, 8);
}
return finalise(new Ctor(x), sd, rm);
};
/*
* Return a string representing the value of this Decimal.
*
* Return exponential notation if this Decimal has a positive exponent equal to or greater than
* `toExpPos`, or a negative exponent equal to or less than `toExpNeg`.
*
*/
P.toString = function () {
var x = this,
Ctor = x.constructor,
str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);
return x.isNeg() && !x.isZero() ? '-' + str : str;
};
/*
* Return a new Decimal whose value is the value of this Decimal truncated to a whole number.
*
*/
P.truncated = P.trunc = function () {
return finalise(new this.constructor(this), this.e + 1, 1);
};
/*
* Return a string representing the value of this Decimal.
* Unlike `toString`, negative zero will include the minus sign.
*
*/
P.valueOf = P.toJSON = function () {
var x = this,
Ctor = x.constructor,
str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);
return x.isNeg() ? '-' + str : str;
};
/*
// Add aliases to match BigDecimal method names.
// P.add = P.plus;
P.subtract = P.minus;
P.multiply = P.times;
P.divide = P.div;
P.remainder = P.mod;
P.compareTo = P.cmp;
P.negate = P.neg;
*/
// Helper functions for Decimal.prototype (P) and/or Decimal methods, and their callers.
/*
* digitsToString P.cubeRoot, P.logarithm, P.squareRoot, P.toFraction, P.toPower,
* finiteToString, naturalExponential, naturalLogarithm
* checkInt32 P.toDecimalPlaces, P.toExponential, P.toFixed, P.toNearest,
* P.toPrecision, P.toSignificantDigits, toStringBinary, random
* checkRoundingDigits P.logarithm, P.toPower, naturalExponential, naturalLogarithm
* convertBase toStringBinary, parseOther
* cos P.cos
* divide P.atanh, P.cubeRoot, P.dividedBy, P.dividedToIntegerBy,
* P.logarithm, P.modulo, P.squareRoot, P.tan, P.tanh, P.toFraction,
* P.toNearest, toStringBinary, naturalExponential, naturalLogarithm,
* taylorSeries, atan2, parseOther
* finalise P.absoluteValue, P.atan, P.atanh, P.ceil, P.cos, P.cosh,
* P.cubeRoot, P.dividedToIntegerBy, P.floor, P.logarithm, P.minus,
* P.modulo, P.negated, P.plus, P.round, P.sin, P.sinh, P.squareRoot,
* P.tan, P.times, P.toDecimalPlaces, P.toExponential, P.toFixed,
* P.toNearest, P.toPower, P.toPrecision, P.toSignificantDigits,
* P.truncated, divide, getLn10, getPi, naturalExponential,
* naturalLogarithm, ceil, floor, round, trunc
* finiteToString P.toExponential, P.toFixed, P.toPrecision, P.toString, P.valueOf,
* toStringBinary
* getBase10Exponent P.minus, P.plus, P.times, parseOther
* getLn10 P.logarithm, naturalLogarithm
* getPi P.acos, P.asin, P.atan, toLessThanHalfPi, atan2
* getPrecision P.precision, P.toFraction
* getZeroString digitsToString, finiteToString
* intPow P.toPower, parseOther
* isOdd toLessThanHalfPi
* maxOrMin max, min
* naturalExponential P.naturalExponential, P.toPower
* naturalLogarithm P.acosh, P.asinh, P.atanh, P.logarithm, P.naturalLogarithm,
* P.toPower, naturalExponential
* nonFiniteToString finiteToString, toStringBinary
* parseDecimal Decimal
* parseOther Decimal
* sin P.sin
* taylorSeries P.cosh, P.sinh, cos, sin
* toLessThanHalfPi P.cos, P.sin
* toStringBinary P.toBinary, P.toHexadecimal, P.toOctal
* truncate intPow
*
* Throws: P.logarithm, P.precision, P.toFraction, checkInt32, getLn10, getPi,
* naturalLogarithm, config, parseOther, random, Decimal
*/
function digitsToString(d) {
var i, k, ws,
indexOfLastWord = d.length - 1,
str = '',
w = d[0];
if (indexOfLastWord > 0) {
str += w;
for (i = 1; i < indexOfLastWord; i++) {
ws = d[i] + '';
k = LOG_BASE - ws.length;
if (k) str += getZeroString(k);
str += ws;
}
w = d[i];
ws = w + '';
k = LOG_BASE - ws.length;
if (k) str += getZeroString(k);
} else if (w === 0) {
return '0';
}
// Remove trailing zeros of last w.
for (; w % 10 === 0;) w /= 10;
return str + w;
}
function checkInt32(i, min, max) {
if (i !== ~~i || i < min || i > max) {
throw Error(invalidArgument + i);
}
}
/*
* Check 5 rounding digits if `repeating` is null, 4 otherwise.
* `repeating == null` if caller is `log` or `pow`,
* `repeating != null` if caller is `naturalLogarithm` or `naturalExponential`.
*/
function checkRoundingDigits(d, i, rm, repeating) {
var di, k, r, rd;
// Get the length of the first word of the array d.
for (k = d[0]; k >= 10; k /= 10) --i;
// Is the rounding digit in the first word of d?
if (--i < 0) {
i += LOG_BASE;
di = 0;
} else {
di = Math.ceil((i + 1) / LOG_BASE);
i %= LOG_BASE;
}
// i is the index (0 - 6) of the rounding digit.
// E.g. if within the word 3487563 the first rounding digit is 5,
// then i = 4, k = 1000, rd = 3487563 % 1000 = 563
k = mathpow(10, LOG_BASE - i);
rd = d[di] % k | 0;
if (repeating == null) {
if (i < 3) {
if (i == 0) rd = rd / 100 | 0;
else if (i == 1) rd = rd / 10 | 0;
r = rm < 4 && rd == 99999 || rm > 3 && rd == 49999 || rd == 50000 || rd == 0;
} else {
r = (rm < 4 && rd + 1 == k || rm > 3 && rd + 1 == k / 2) &&
(d[di + 1] / k / 100 | 0) == mathpow(10, i - 2) - 1 ||
(rd == k / 2 || rd == 0) && (d[di + 1] / k / 100 | 0) == 0;
}
} else {
if (i < 4) {
if (i == 0) rd = rd / 1000 | 0;
else if (i == 1) rd = rd / 100 | 0;
else if (i == 2) rd = rd / 10 | 0;
r = (repeating || rm < 4) && rd == 9999 || !repeating && rm > 3 && rd == 4999;
} else {
r = ((repeating || rm < 4) && rd + 1 == k ||
(!repeating && rm > 3) && rd + 1 == k / 2) &&
(d[di + 1] / k / 1000 | 0) == mathpow(10, i - 3) - 1;
}
}
return r;
}
// Convert string of `baseIn` to an array of numbers of `baseOut`.
// Eg. convertBase('255', 10, 16) returns [15, 15].
// Eg. convertBase('ff', 16, 10) returns [2, 5, 5].
function convertBase(str, baseIn, baseOut) {
var j,
arr = [0],
arrL,
i = 0,
strL = str.length;
for (; i < strL;) {
for (arrL = arr.length; arrL--;) arr[arrL] *= baseIn;
arr[0] += NUMERALS.indexOf(str.charAt(i++));
for (j = 0; j < arr.length; j++) {
if (arr[j] > baseOut - 1) {
if (arr[j + 1] === void 0) arr[j + 1] = 0;
arr[j + 1] += arr[j] / baseOut | 0;
arr[j] %= baseOut;
}
}
}
return arr.reverse();
}
/*
* cos(x) = 1 - x^2/2! + x^4/4! - ...
* |x| < pi/2
*
*/
function cosine(Ctor, x) {
var k, y,
len = x.d.length;
// Argument reduction: cos(4x) = 8*(cos^4(x) - cos^2(x)) + 1
// i.e. cos(x) = 8*(cos^4(x/4) - cos^2(x/4)) + 1
// Estimate the optimum number of times to use the argument reduction.
if (len < 32) {
k = Math.ceil(len / 3);
y = (1 / tinyPow(4, k)).toString();
} else {
k = 16;
y = '2.3283064365386962890625e-10';
}
Ctor.precision += k;
x = taylorSeries(Ctor, 1, x.times(y), new Ctor(1));
// Reverse argument reduction
for (var i = k; i--;) {
var cos2x = x.times(x);
x = cos2x.times(cos2x).minus(cos2x).times(8).plus(1);
}
Ctor.precision -= k;
return x;
}
/*
* Perform division in the specified base.
*/
var divide = (function () {
// Assumes non-zero x and k, and hence non-zero result.
function multiplyInteger(x, k, base) {
var temp,
carry = 0,
i = x.length;
for (x = x.slice(); i--;) {
temp = x[i] * k + carry;
x[i] = temp % base | 0;
carry = temp / base | 0;
}
if (carry) x.unshift(carry);
return x;
}
function compare(a, b, aL, bL) {
var i, r;
if (aL != bL) {
r = aL > bL ? 1 : -1;
} else {
for (i = r = 0; i < aL; i++) {
if (a[i] != b[i]) {
r = a[i] > b[i] ? 1 : -1;
break;
}
}
}
return r;
}
function subtract(a, b, aL, base) {
var i = 0;
// Subtract b from a.
for (; aL--;) {
a[aL] -= i;
i = a[aL] < b[aL] ? 1 : 0;
a[aL] = i * base + a[aL] - b[aL];
}
// Remove leading zeros.
for (; !a[0] && a.length > 1;) a.shift();
}
return function (x, y, pr, rm, dp, base) {
var cmp, e, i, k, logBase, more, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0,
yL, yz,
Ctor = x.constructor,
sign = x.s == y.s ? 1 : -1,
xd = x.d,
yd = y.d;
// Either NaN, Infinity or 0?
if (!xd || !xd[0] || !yd || !yd[0]) {
return new Ctor(// Return NaN if either NaN, or both Infinity or 0.
!x.s || !y.s || (xd ? yd && xd[0] == yd[0] : !yd) ? NaN :
// Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.
xd && xd[0] == 0 || !yd ? sign * 0 : sign / 0);
}
if (base) {
logBase = 1;
e = x.e - y.e;
} else {
base = BASE;
logBase = LOG_BASE;
e = mathfloor(x.e / logBase) - mathfloor(y.e / logBase);
}
yL = yd.length;
xL = xd.length;
q = new Ctor(sign);
qd = q.d = [];
// Result exponent may be one less than e.
// The digit array of a Decimal from toStringBinary may have trailing zeros.
for (i = 0; yd[i] == (xd[i] || 0); i++);
if (yd[i] > (xd[i] || 0)) e--;
if (pr == null) {
sd = pr = Ctor.precision;
rm = Ctor.rounding;
} else if (dp) {
sd = pr + (x.e - y.e) + 1;
} else {
sd = pr;
}
if (sd < 0) {
qd.push(1);
more = true;
} else {
// Convert precision in number of base 10 digits to base 1e7 digits.
sd = sd / logBase + 2 | 0;
i = 0;
// divisor < 1e7
if (yL == 1) {
k = 0;
yd = yd[0];
sd++;
// k is the carry.
for (; (i < xL || k) && sd--; i++) {
t = k * base + (xd[i] || 0);
qd[i] = t / yd | 0;
k = t % yd | 0;
}
more = k || i < xL;
// divisor >= 1e7
} else {
// Normalise xd and yd so highest order digit of yd is >= base/2
k = base / (yd[0] + 1) | 0;
if (k > 1) {
yd = multiplyInteger(yd, k, base);
xd = multiplyInteger(xd, k, base);
yL = yd.length;
xL = xd.length;
}
xi = yL;
rem = xd.slice(0, yL);
remL = rem.length;
// Add zeros to make remainder as long as divisor.
for (; remL < yL;) rem[remL++] = 0;
yz = yd.slice();
yz.unshift(0);
yd0 = yd[0];
if (yd[1] >= base / 2) ++yd0;
do {
k = 0;
// Compare divisor and remainder.
cmp = compare(yd, rem, yL, remL);
// If divisor < remainder.
if (cmp < 0) {
// Calculate trial digit, k.
rem0 = rem[0];
if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);
// k will be how many times the divisor goes into the current remainder.
k = rem0 / yd0 | 0;
// Algorithm:
// 1. product = divisor * trial digit (k)
// 2. if product > remainder: product -= divisor, k--
// 3. remainder -= product
// 4. if product was < remainder at 2:
// 5. compare new remainder and divisor
// 6. If remainder > divisor: remainder -= divisor, k++
if (k > 1) {
if (k >= base) k = base - 1;
// product = divisor * trial digit.
prod = multiplyInteger(yd, k, base);
prodL = prod.length;
remL = rem.length;
// Compare product and remainder.
cmp = compare(prod, rem, prodL, remL);
// product > remainder.
if (cmp == 1) {
k--;
// Subtract divisor from product.
subtract(prod, yL < prodL ? yz : yd, prodL, base);
}
} else {
// cmp is -1.
// If k is 0, there is no need to compare yd and rem again below, so change cmp to 1
// to avoid it. If k is 1 there is a need to compare yd and rem again below.
if (k == 0) cmp = k = 1;
prod = yd.slice();
}
prodL = prod.length;
if (prodL < remL) prod.unshift(0);
// Subtract product from remainder.
subtract(rem, prod, remL, base);
// If product was < previous remainder.
if (cmp == -1) {
remL = rem.length;
// Compare divisor and new remainder.
cmp = compare(yd, rem, yL, remL);
// If divisor < new remainder, subtract divisor from remainder.
if (cmp < 1) {
k++;
// Subtract divisor from remainder.
subtract(rem, yL < remL ? yz : yd, remL, base);
}
}
remL = rem.length;
} else if (cmp === 0) {
k++;
rem = [0];
} // if cmp === 1, k will be 0
// Add the next digit, k, to the result array.
qd[i++] = k;
// Update the remainder.
if (cmp && rem[0]) {
rem[remL++] = xd[xi] || 0;
} else {
rem = [xd[xi]];
remL = 1;
}
} while ((xi++ < xL || rem[0] !== void 0) && sd--);
more = rem[0] !== void 0;
}
// Leading zero?
if (!qd[0]) qd.shift();
}
// logBase is 1 when divide is being used for base conversion.
if (logBase == 1) {
q.e = e;
inexact = more;
} else {
// To calculate q.e, first get the number of digits of qd[0].
for (i = 1, k = qd[0]; k >= 10; k /= 10) i++;
q.e = i + e * logBase - 1;
finalise(q, dp ? pr + q.e + 1 : pr, rm, more);
}
return q;
};
})();
/*
* Round `x` to `sd` significant digits using rounding mode `rm`.
* Check for over/under-flow.
*/
function finalise(x, sd, rm, isTruncated) {
var digits, i, j, k, rd, roundUp, w, xd, xdi,
Ctor = x.constructor;
// Don't round if sd is null or undefined.
out: if (sd != null) {
xd = x.d;
// Infinity/NaN.
if (!xd) return x;
// rd: the rounding digit, i.e. the digit after the digit that may be rounded up.
// w: the word of xd containing rd, a base 1e7 number.
// xdi: the index of w within xd.
// digits: the number of digits of w.
// i: what would be the index of rd within w if all the numbers were 7 digits long (i.e. if
// they had leading zeros)
// j: if > 0, the actual index of rd within w (if < 0, rd is a leading zero).
// Get the length of the first word of the digits array xd.
for (digits = 1, k = xd[0]; k >= 10; k /= 10) digits++;
i = sd - digits;
// Is the rounding digit in the first word of xd?
if (i < 0) {
i += LOG_BASE;
j = sd;
w = xd[xdi = 0];
// Get the rounding digit at index j of w.
rd = w / mathpow(10, digits - j - 1) % 10 | 0;
} else {
xdi = Math.ceil((i + 1) / LOG_BASE);
k = xd.length;
if (xdi >= k) {
if (isTruncated) {
// Needed by `naturalExponential`, `naturalLogarithm` and `squareRoot`.
for (; k++ <= xdi;) xd.push(0);
w = rd = 0;
digits = 1;
i %= LOG_BASE;
j = i - LOG_BASE + 1;
} else {
break out;
}
} else {
w = k = xd[xdi];
// Get the number of digits of w.
for (digits = 1; k >= 10; k /= 10) digits++;
// Get the index of rd within w.
i %= LOG_BASE;
// Get the index of rd within w, adjusted for leading zeros.
// The number of leading zeros of w is given by LOG_BASE - digits.
j = i - LOG_BASE + digits;
// Get the rounding digit at index j of w.
rd = j < 0 ? 0 : w / mathpow(10, digits - j - 1) % 10 | 0;
}
}
// Are there any non-zero digits after the rounding digit?
isTruncated = isTruncated || sd < 0 ||
xd[xdi + 1] !== void 0 || (j < 0 ? w : w % mathpow(10, digits - j - 1));
// The expression `w % mathpow(10, digits - j - 1)` returns all the digits of w to the right
// of the digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression
// will give 714.
roundUp = rm < 4
? (rd || isTruncated) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))
: rd > 5 || rd == 5 && (rm == 4 || isTruncated || rm == 6 &&
// Check whether the digit to the left of the rounding digit is odd.
((i > 0 ? j > 0 ? w / mathpow(10, digits - j) : 0 : xd[xdi - 1]) % 10) & 1 ||
rm == (x.s < 0 ? 8 : 7));
if (sd < 1 || !xd[0]) {
xd.length = 0;
if (roundUp) {
// Convert sd to decimal places.
sd -= x.e + 1;
// 1, 0.1, 0.01, 0.001, 0.0001 etc.
xd[0] = mathpow(10, (LOG_BASE - sd % LOG_BASE) % LOG_BASE);
x.e = -sd || 0;
} else {
// Zero.
xd[0] = x.e = 0;
}
return x;
}
// Remove excess digits.
if (i == 0) {
xd.length = xdi;
k = 1;
xdi--;
} else {
xd.length = xdi + 1;
k = mathpow(10, LOG_BASE - i);
// E.g. 56700 becomes 56000 if 7 is the rounding digit.
// j > 0 means i > number of leading zeros of w.
xd[xdi] = j > 0 ? (w / mathpow(10, digits - j) % mathpow(10, j) | 0) * k : 0;
}
if (roundUp) {
for (;;) {
// Is the digit to be rounded up in the first word of xd?
if (xdi == 0) {
// i will be the length of xd[0] before k is added.
for (i = 1, j = xd[0]; j >= 10; j /= 10) i++;
j = xd[0] += k;
for (k = 1; j >= 10; j /= 10) k++;
// if i != k the length has increased.
if (i != k) {
x.e++;
if (xd[0] == BASE) xd[0] = 1;
}
break;
} else {
xd[xdi] += k;
if (xd[xdi] != BASE) break;
xd[xdi--] = 0;
k = 1;
}
}
}
// Remove trailing zeros.
for (i = xd.length; xd[--i] === 0;) xd.pop();
}
if (external) {
// Overflow?
if (x.e > Ctor.maxE) {
// Infinity.
x.d = null;
x.e = NaN;
// Underflow?
} else if (x.e < Ctor.minE) {
// Zero.
x.e = 0;
x.d = [0];
// Ctor.underflow = true;
} // else Ctor.underflow = false;
}
return x;
}
function finiteToString(x, isExp, sd) {
if (!x.isFinite()) return nonFiniteToString(x);
var k,
e = x.e,
str = digitsToString(x.d),
len = str.length;
if (isExp) {
if (sd && (k = sd - len) > 0) {
str = str.charAt(0) + '.' + str.slice(1) + getZeroString(k);
} else if (len > 1) {
str = str.charAt(0) + '.' + str.slice(1);
}
str = str + (x.e < 0 ? 'e' : 'e+') + x.e;
} else if (e < 0) {
str = '0.' + getZeroString(-e - 1) + str;
if (sd && (k = sd - len) > 0) str += getZeroString(k);
} else if (e >= len) {
str += getZeroString(e + 1 - len);
if (sd && (k = sd - e - 1) > 0) str = str + '.' + getZeroString(k);
} else {
if ((k = e + 1) < len) str = str.slice(0, k) + '.' + str.slice(k);
if (sd && (k = sd - len) > 0) {
if (e + 1 === len) str += '.';
str += getZeroString(k);
}
}
return str;
}
// Calculate the base 10 exponent from the base 1e7 exponent.
function getBase10Exponent(digits, e) {
var w = digits[0];
// Add the number of digits of the first word of the digits array.
for ( e *= LOG_BASE; w >= 10; w /= 10) e++;
return e;
}
function getLn10(Ctor, sd, pr) {
if (sd > LN10_PRECISION) {
// Reset global state in case the exception is caught.
external = true;
if (pr) Ctor.precision = pr;
throw Error(precisionLimitExceeded);
}
return finalise(new Ctor(LN10), sd, 1, true);
}
function getPi(Ctor, sd, rm) {
if (sd > PI_PRECISION) throw Error(precisionLimitExceeded);
return finalise(new Ctor(PI), sd, rm, true);
}
function getPrecision(digits) {
var w = digits.length - 1,
len = w * LOG_BASE + 1;
w = digits[w];
// If non-zero...
if (w) {
// Subtract the number of trailing zeros of the last word.
for (; w % 10 == 0; w /= 10) len--;
// Add the number of digits of the first word.
for (w = digits[0]; w >= 10; w /= 10) len++;
}
return len;
}
function getZeroString(k) {
var zs = '';
for (; k--;) zs += '0';
return zs;
}
/*
* Return a new Decimal whose value is the value of Decimal `x` to the power `n`, where `n` is an
* integer of type number.
*
* Implements 'exponentiation by squaring'. Called by `pow` and `parseOther`.
*
*/
function intPow(Ctor, x, n, pr) {
var isTruncated,
r = new Ctor(1),
// Max n of 9007199254740991 takes 53 loop iterations.
// Maximum digits array length; leaves [28, 34] guard digits.
k = Math.ceil(pr / LOG_BASE + 4);
external = false;
for (;;) {
if (n % 2) {
r = r.times(x);
if (truncate(r.d, k)) isTruncated = true;
}
n = mathfloor(n / 2);
if (n === 0) {
// To ensure correct rounding when r.d is truncated, increment the last word if it is zero.
n = r.d.length - 1;
if (isTruncated && r.d[n] === 0) ++r.d[n];
break;
}
x = x.times(x);
truncate(x.d, k);
}
external = true;
return r;
}
function isOdd(n) {
return n.d[n.d.length - 1] & 1;
}
/*
* Handle `max` and `min`. `ltgt` is 'lt' or 'gt'.
*/
function maxOrMin(Ctor, args, ltgt) {
var y,
x = new Ctor(args[0]),
i = 0;
for (; ++i < args.length;) {
y = new Ctor(args[i]);
if (!y.s) {
x = y;
break;
} else if (x[ltgt](y)) {
x = y;
}
}
return x;
}
/*
* Return a new Decimal whose value is the natural exponential of `x` rounded to `sd` significant
* digits.
*
* Taylor/Maclaurin series.
*
* exp(x) = x^0/0! + x^1/1! + x^2/2! + x^3/3! + ...
*
* Argument reduction:
* Repeat x = x / 32, k += 5, until |x| < 0.1
* exp(x) = exp(x / 2^k)^(2^k)
*
* Previously, the argument was initially reduced by
* exp(x) = exp(r) * 10^k where r = x - k * ln10, k = floor(x / ln10)
* to first put r in the range [0, ln10], before dividing by 32 until |x| < 0.1, but this was
* found to be slower than just dividing repeatedly by 32 as above.
*
* Max integer argument: exp('20723265836946413') = 6.3e+9000000000000000
* Min integer argument: exp('-20723265836946411') = 1.2e-9000000000000000
* (Math object integer min/max: Math.exp(709) = 8.2e+307, Math.exp(-745) = 5e-324)
*
* exp(Infinity) = Infinity
* exp(-Infinity) = 0
* exp(NaN) = NaN
* exp(±0) = 1
*
* exp(x) is non-terminating for any finite, non-zero x.
*
* The result will always be correctly rounded.
*
*/
function naturalExponential(x, sd) {
var denominator, guard, j, pow, sum, t, wpr,
rep = 0,
i = 0,
k = 0,
Ctor = x.constructor,
rm = Ctor.rounding,
pr = Ctor.precision;
// 0/NaN/Infinity?
if (!x.d || !x.d[0] || x.e > 17) {
return new Ctor(x.d
? !x.d[0] ? 1 : x.s < 0 ? 0 : 1 / 0
: x.s ? x.s < 0 ? 0 : x : 0 / 0);
}
if (sd == null) {
external = false;
wpr = pr;
} else {
wpr = sd;
}
t = new Ctor(0.03125);
// while abs(x) >= 0.1
while (x.e > -2) {
// x = x / 2^5
x = x.times(t);
k += 5;
}
// Use 2 * log10(2^k) + 5 (empirically derived) to estimate the increase in precision
// necessary to ensure the first 4 rounding digits are correct.
guard = Math.log(mathpow(2, k)) / Math.LN10 * 2 + 5 | 0;
wpr += guard;
denominator = pow = sum = new Ctor(1);
Ctor.precision = wpr;
for (;;) {
pow = finalise(pow.times(x), wpr, 1);
denominator = denominator.times(++i);
t = sum.plus(divide(pow, denominator, wpr, 1));
if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {
j = k;
while (j--) sum = finalise(sum.times(sum), wpr, 1);
// Check to see if the first 4 rounding digits are [49]999.
// If so, repeat the summation with a higher precision, otherwise
// e.g. with precision: 18, rounding: 1
// exp(18.404272462595034083567793919843761) = 98372560.1229999999 (should be 98372560.123)
// `wpr - guard` is the index of first rounding digit.
if (sd == null) {
if (rep < 3 && checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {
Ctor.precision = wpr += 10;
denominator = pow = t = new Ctor(1);
i = 0;
rep++;
} else {
return finalise(sum, Ctor.precision = pr, rm, external = true);
}
} else {
Ctor.precision = pr;
return sum;
}
}
sum = t;
}
}
/*
* Return a new Decimal whose value is the natural logarithm of `x` rounded to `sd` significant
* digits.
*
* ln(-n) = NaN
* ln(0) = -Infinity
* ln(-0) = -Infinity
* ln(1) = 0
* ln(Infinity) = Infinity
* ln(-Infinity) = NaN
* ln(NaN) = NaN
*
* ln(n) (n != 1) is non-terminating.
*
*/
function naturalLogarithm(y, sd) {
var c, c0, denominator, e, numerator, rep, sum, t, wpr, x1, x2,
n = 1,
guard = 10,
x = y,
xd = x.d,
Ctor = x.constructor,
rm = Ctor.rounding,
pr = Ctor.precision;
// Is x negative or Infinity, NaN, 0 or 1?
if (x.s < 0 || !xd || !xd[0] || !x.e && xd[0] == 1 && xd.length == 1) {
return new Ctor(xd && !xd[0] ? -1 / 0 : x.s != 1 ? NaN : xd ? 0 : x);
}
if (sd == null) {
external = false;
wpr = pr;
} else {
wpr = sd;
}
Ctor.precision = wpr += guard;
c = digitsToString(xd);
c0 = c.charAt(0);
if (Math.abs(e = x.e) < 1.5e15) {
// Argument reduction.
// The series converges faster the closer the argument is to 1, so using
// ln(a^b) = b * ln(a), ln(a) = ln(a^b) / b
// multiply the argument by itself until the leading digits of the significand are 7, 8, 9,
// 10, 11, 12 or 13, recording the number of multiplications so the sum of the series can
// later be divided by this number, then separate out the power of 10 using
// ln(a*10^b) = ln(a) + b*ln(10).
// max n is 21 (gives 0.9, 1.0 or 1.1) (9e15 / 21 = 4.2e14).
//while (c0 < 9 && c0 != 1 || c0 == 1 && c.charAt(1) > 1) {
// max n is 6 (gives 0.7 - 1.3)
while (c0 < 7 && c0 != 1 || c0 == 1 && c.charAt(1) > 3) {
x = x.times(y);
c = digitsToString(x.d);
c0 = c.charAt(0);
n++;
}
e = x.e;
if (c0 > 1) {
x = new Ctor('0.' + c);
e++;
} else {
x = new Ctor(c0 + '.' + c.slice(1));
}
} else {
// The argument reduction method above may result in overflow if the argument y is a massive
// number with exponent >= 1500000000000000 (9e15 / 6 = 1.5e15), so instead recall this
// function using ln(x*10^e) = ln(x) + e*ln(10).
t = getLn10(Ctor, wpr + 2, pr).times(e + '');
x = naturalLogarithm(new Ctor(c0 + '.' + c.slice(1)), wpr - guard).plus(t);
Ctor.precision = pr;
return sd == null ? finalise(x, pr, rm, external = true) : x;
}
// x1 is x reduced to a value near 1.
x1 = x;
// Taylor series.
// ln(y) = ln((1 + x)/(1 - x)) = 2(x + x^3/3 + x^5/5 + x^7/7 + ...)
// where x = (y - 1)/(y + 1) (|x| < 1)
sum = numerator = x = divide(x.minus(1), x.plus(1), wpr, 1);
x2 = finalise(x.times(x), wpr, 1);
denominator = 3;
for (;;) {
numerator = finalise(numerator.times(x2), wpr, 1);
t = sum.plus(divide(numerator, new Ctor(denominator), wpr, 1));
if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {
sum = sum.times(2);
// Reverse the argument reduction. Check that e is not 0 because, besides preventing an
// unnecessary calculation, -0 + 0 = +0 and to ensure correct rounding -0 needs to stay -0.
if (e !== 0) sum = sum.plus(getLn10(Ctor, wpr + 2, pr).times(e + ''));
sum = divide(sum, new Ctor(n), wpr, 1);
// Is rm > 3 and the first 4 rounding digits 4999, or rm < 4 (or the summation has
// been repeated previously) and the first 4 rounding digits 9999?
// If so, restart the summation with a higher precision, otherwise
// e.g. with precision: 12, rounding: 1
// ln(135520028.6126091714265381533) = 18.7246299999 when it should be 18.72463.
// `wpr - guard` is the index of first rounding digit.
if (sd == null) {
if (checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {
Ctor.precision = wpr += guard;
t = numerator = x = divide(x1.minus(1), x1.plus(1), wpr, 1);
x2 = finalise(x.times(x), wpr, 1);
denominator = rep = 1;
} else {
return finalise(sum, Ctor.precision = pr, rm, external = true);
}
} else {
Ctor.precision = pr;
return sum;
}
}
sum = t;
denominator += 2;
}
}
// ±Infinity, NaN.
function nonFiniteToString(x) {
// Unsigned.
return String(x.s * x.s / 0);
}
/*
* Parse the value of a new Decimal `x` from string `str`.
*/
function parseDecimal(x, str) {
var e, i, len;
// Decimal point?
if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');
// Exponential form?
if ((i = str.search(/e/i)) > 0) {
// Determine exponent.
if (e < 0) e = i;
e += +str.slice(i + 1);
str = str.substring(0, i);
} else if (e < 0) {
// Integer.
e = str.length;
}
// Determine leading zeros.
for (i = 0; str.charCodeAt(i) === 48; i++);
// Determine trailing zeros.
for (len = str.length; str.charCodeAt(len - 1) === 48; --len);
str = str.slice(i, len);
if (str) {
len -= i;
x.e = e = e - i - 1;
x.d = [];
// Transform base
// e is the base 10 exponent.
// i is where to slice str to get the first word of the digits array.
i = (e + 1) % LOG_BASE;
if (e < 0) i += LOG_BASE;
if (i < len) {
if (i) x.d.push(+str.slice(0, i));
for (len -= LOG_BASE; i < len;) x.d.push(+str.slice(i, i += LOG_BASE));
str = str.slice(i);
i = LOG_BASE - str.length;
} else {
i -= len;
}
for (; i--;) str += '0';
x.d.push(+str);
if (external) {
// Overflow?
if (x.e > x.constructor.maxE) {
// Infinity.
x.d = null;
x.e = NaN;
// Underflow?
} else if (x.e < x.constructor.minE) {
// Zero.
x.e = 0;
x.d = [0];
// x.constructor.underflow = true;
} // else x.constructor.underflow = false;
}
} else {
// Zero.
x.e = 0;
x.d = [0];
}
return x;
}
/*
* Parse the value of a new Decimal `x` from a string `str`, which is not a decimal value.
*/
function parseOther(x, str) {
var base, Ctor, divisor, i, isFloat, len, p, xd, xe;
if (str === 'Infinity' || str === 'NaN') {
if (!+str) x.s = NaN;
x.e = NaN;
x.d = null;
return x;
}
if (isHex.test(str)) {
base = 16;
str = str.toLowerCase();
} else if (isBinary.test(str)) {
base = 2;
} else if (isOctal.test(str)) {
base = 8;
} else {
throw Error(invalidArgument + str);
}
// Is there a binary exponent part?
i = str.search(/p/i);
if (i > 0) {
p = +str.slice(i + 1);
str = str.substring(2, i);
} else {
str = str.slice(2);
}
// Convert `str` as an integer then divide the result by `base` raised to a power such that the
// fraction part will be restored.
i = str.indexOf('.');
isFloat = i >= 0;
Ctor = x.constructor;
if (isFloat) {
str = str.replace('.', '');
len = str.length;
i = len - i;
// log[10](16) = 1.2041... , log[10](88) = 1.9444....
divisor = intPow(Ctor, new Ctor(base), i, i * 2);
}
xd = convertBase(str, base, BASE);
xe = xd.length - 1;
// Remove trailing zeros.
for (i = xe; xd[i] === 0; --i) xd.pop();
if (i < 0) return new Ctor(x.s * 0);
x.e = getBase10Exponent(xd, xe);
x.d = xd;
external = false;
// At what precision to perform the division to ensure exact conversion?
// maxDecimalIntegerPartDigitCount = ceil(log[10](b) * otherBaseIntegerPartDigitCount)
// log[10](2) = 0.30103, log[10](8) = 0.90309, log[10](16) = 1.20412
// E.g. ceil(1.2 * 3) = 4, so up to 4 decimal digits are needed to represent 3 hex int digits.
// maxDecimalFractionPartDigitCount = {Hex:4|Oct:3|Bin:1} * otherBaseFractionPartDigitCount
// Therefore using 4 * the number of digits of str will always be enough.
if (isFloat) x = divide(x, divisor, len * 4);
// Multiply by the binary exponent part if present.
if (p) x = x.times(Math.abs(p) < 54 ? mathpow(2, p) : Decimal.pow(2, p));
external = true;
return x;
}
/*
* sin(x) = x - x^3/3! + x^5/5! - ...
* |x| < pi/2
*
*/
function sine(Ctor, x) {
var k,
len = x.d.length;
if (len < 3) return taylorSeries(Ctor, 2, x, x);
// Argument reduction: sin(5x) = 16*sin^5(x) - 20*sin^3(x) + 5*sin(x)
// i.e. sin(x) = 16*sin^5(x/5) - 20*sin^3(x/5) + 5*sin(x/5)
// and sin(x) = sin(x/5)(5 + sin^2(x/5)(16sin^2(x/5) - 20))
// Estimate the optimum number of times to use the argument reduction.
k = 1.4 * Math.sqrt(len);
k = k > 16 ? 16 : k | 0;
x = x.times(1 / tinyPow(5, k));
x = taylorSeries(Ctor, 2, x, x);
// Reverse argument reduction
var sin2_x,
d5 = new Ctor(5),
d16 = new Ctor(16),
d20 = new Ctor(20);
for (; k--;) {
sin2_x = x.times(x);
x = x.times(d5.plus(sin2_x.times(d16.times(sin2_x).minus(d20))));
}
return x;
}
// Calculate Taylor series for `cos`, `cosh`, `sin` and `sinh`.
function taylorSeries(Ctor, n, x, y, isHyperbolic) {
var j, t, u, x2,
i = 1,
pr = Ctor.precision,
k = Math.ceil(pr / LOG_BASE);
external = false;
x2 = x.times(x);
u = new Ctor(y);
for (;;) {
t = divide(u.times(x2), new Ctor(n++ * n++), pr, 1);
u = isHyperbolic ? y.plus(t) : y.minus(t);
y = divide(t.times(x2), new Ctor(n++ * n++), pr, 1);
t = u.plus(y);
if (t.d[k] !== void 0) {
for (j = k; t.d[j] === u.d[j] && j--;);
if (j == -1) break;
}
j = u;
u = y;
y = t;
t = j;
i++;
}
external = true;
t.d.length = k + 1;
return t;
}
// Exponent e must be positive and non-zero.
function tinyPow(b, e) {
var n = b;
while (--e) n *= b;
return n;
}
// Return the absolute value of `x` reduced to less than or equal to half pi.
function toLessThanHalfPi(Ctor, x) {
var t,
isNeg = x.s < 0,
pi = getPi(Ctor, Ctor.precision, 1),
halfPi = pi.times(0.5);
x = x.abs();
if (x.lte(halfPi)) {
quadrant = isNeg ? 4 : 1;
return x;
}
t = x.divToInt(pi);
if (t.isZero()) {
quadrant = isNeg ? 3 : 2;
} else {
x = x.minus(t.times(pi));
// 0 <= x < pi
if (x.lte(halfPi)) {
quadrant = isOdd(t) ? (isNeg ? 2 : 3) : (isNeg ? 4 : 1);
return x;
}
quadrant = isOdd(t) ? (isNeg ? 1 : 4) : (isNeg ? 3 : 2);
}
return x.minus(pi).abs();
}
/*
* Return the value of Decimal `x` as a string in base `baseOut`.
*
* If the optional `sd` argument is present include a binary exponent suffix.
*/
function toStringBinary(x, baseOut, sd, rm) {
var base, e, i, k, len, roundUp, str, xd, y,
Ctor = x.constructor,
isExp = sd !== void 0;
if (isExp) {
checkInt32(sd, 1, MAX_DIGITS);
if (rm === void 0) rm = Ctor.rounding;
else checkInt32(rm, 0, 8);
} else {
sd = Ctor.precision;
rm = Ctor.rounding;
}
if (!x.isFinite()) {
str = nonFiniteToString(x);
} else {
str = finiteToString(x);
i = str.indexOf('.');
// Use exponential notation according to `toExpPos` and `toExpNeg`? No, but if required:
// maxBinaryExponent = floor((decimalExponent + 1) * log[2](10))
// minBinaryExponent = floor(decimalExponent * log[2](10))
// log[2](10) = 3.321928094887362347870319429489390175864
if (isExp) {
base = 2;
if (baseOut == 16) {
sd = sd * 4 - 3;
} else if (baseOut == 8) {
sd = sd * 3 - 2;
}
} else {
base = baseOut;
}
// Convert the number as an integer then divide the result by its base raised to a power such
// that the fraction part will be restored.
// Non-integer.
if (i >= 0) {
str = str.replace('.', '');
y = new Ctor(1);
y.e = str.length - i;
y.d = convertBase(finiteToString(y), 10, base);
y.e = y.d.length;
}
xd = convertBase(str, 10, base);
e = len = xd.length;
// Remove trailing zeros.
for (; xd[--len] == 0;) xd.pop();
if (!xd[0]) {
str = isExp ? '0p+0' : '0';
} else {
if (i < 0) {
e--;
} else {
x = new Ctor(x);
x.d = xd;
x.e = e;
x = divide(x, y, sd, rm, 0, base);
xd = x.d;
e = x.e;
roundUp = inexact;
}
// The rounding digit, i.e. the digit after the digit that may be rounded up.
i = xd[sd];
k = base / 2;
roundUp = roundUp || xd[sd + 1] !== void 0;
roundUp = rm < 4
? (i !== void 0 || roundUp) && (rm === 0 || rm === (x.s < 0 ? 3 : 2))
: i > k || i === k && (rm === 4 || roundUp || rm === 6 && xd[sd - 1] & 1 ||
rm === (x.s < 0 ? 8 : 7));
xd.length = sd;
if (roundUp) {
// Rounding up may mean the previous digit has to be rounded up and so on.
for (; ++xd[--sd] > base - 1;) {
xd[sd] = 0;
if (!sd) {
++e;
xd.unshift(1);
}
}
}
// Determine trailing zeros.
for (len = xd.length; !xd[len - 1]; --len);
// E.g. [4, 11, 15] becomes 4bf.
for (i = 0, str = ''; i < len; i++) str += NUMERALS.charAt(xd[i]);
// Add binary exponent suffix?
if (isExp) {
if (len > 1) {
if (baseOut == 16 || baseOut == 8) {
i = baseOut == 16 ? 4 : 3;
for (--len; len % i; len++) str += '0';
xd = convertBase(str, base, baseOut);
for (len = xd.length; !xd[len - 1]; --len);
// xd[0] will always be be 1
for (i = 1, str = '1.'; i < len; i++) str += NUMERALS.charAt(xd[i]);
} else {
str = str.charAt(0) + '.' + str.slice(1);
}
}
str = str + (e < 0 ? 'p' : 'p+') + e;
} else if (e < 0) {
for (; ++e;) str = '0' + str;
str = '0.' + str;
} else {
if (++e > len) for (e -= len; e-- ;) str += '0';
else if (e < len) str = str.slice(0, e) + '.' + str.slice(e);
}
}
str = (baseOut == 16 ? '0x' : baseOut == 2 ? '0b' : baseOut == 8 ? '0o' : '') + str;
}
return x.s < 0 ? '-' + str : str;
}
// Does not strip trailing zeros.
function truncate(arr, len) {
if (arr.length > len) {
arr.length = len;
return true;
}
}
// Decimal methods
/*
* abs
* acos
* acosh
* add
* asin
* asinh
* atan
* atanh
* atan2
* cbrt
* ceil
* clone
* config
* cos
* cosh
* div
* exp
* floor
* hypot
* ln
* log
* log2
* log10
* max
* min
* mod
* mul
* pow
* random
* round
* set
* sign
* sin
* sinh
* sqrt
* sub
* tan
* tanh
* trunc
*/
/*
* Return a new Decimal whose value is the absolute value of `x`.
*
* x {number|string|Decimal}
*
*/
function abs(x) {
return new this(x).abs();
}
/*
* Return a new Decimal whose value is the arccosine in radians of `x`.
*
* x {number|string|Decimal}
*
*/
function acos(x) {
return new this(x).acos();
}
/*
* Return a new Decimal whose value is the inverse of the hyperbolic cosine of `x`, rounded to
* `precision` significant digits using rounding mode `rounding`.
*
* x {number|string|Decimal} A value in radians.
*
*/
function acosh(x) {
return new this(x).acosh();
}
/*
* Return a new Decimal whose value is the sum of `x` and `y`, rounded to `precision` significant
* digits using rounding mode `rounding`.
*
* x {number|string|Decimal}
* y {number|string|Decimal}
*
*/
function add(x, y) {
return new this(x).plus(y);
}
/*
* Return a new Decimal whose value is the arcsine in radians of `x`, rounded to `precision`
* significant digits using rounding mode `rounding`.
*
* x {number|string|Decimal}
*
*/
function asin(x) {
return new this(x).asin();
}
/*
* Return a new Decimal whose value is the inverse of the hyperbolic sine of `x`, rounded to
* `precision` significant digits using rounding mode `rounding`.
*
* x {number|string|Decimal} A value in radians.
*
*/
function asinh(x) {
return new this(x).asinh();
}
/*
* Return a new Decimal whose value is the arctangent in radians of `x`, rounded to `precision`
* significant digits using rounding mode `rounding`.
*
* x {number|string|Decimal}
*
*/
function atan(x) {
return new this(x).atan();
}
/*
* Return a new Decimal whose value is the inverse of the hyperbolic tangent of `x`, rounded to
* `precision` significant digits using rounding mode `rounding`.
*
* x {number|string|Decimal} A value in radians.
*
*/
function atanh(x) {
return new this(x).atanh();
}
/*
* Return a new Decimal whose value is the arctangent in radians of `y/x` in the range -pi to pi
* (inclusive), rounded to `precision` significant digits using rounding mode `rounding`.
*
* Domain: [-Infinity, Infinity]
* Range: [-pi, pi]
*
* y {number|string|Decimal} The y-coordinate.
* x {number|string|Decimal} The x-coordinate.
*
* atan2(±0, -0) = ±pi
* atan2(±0, +0) = ±0
* atan2(±0, -x) = ±pi for x > 0
* atan2(±0, x) = ±0 for x > 0
* atan2(-y, ±0) = -pi/2 for y > 0
* atan2(y, ±0) = pi/2 for y > 0
* atan2(±y, -Infinity) = ±pi for finite y > 0
* atan2(±y, +Infinity) = ±0 for finite y > 0
* atan2(±Infinity, x) = ±pi/2 for finite x
* atan2(±Infinity, -Infinity) = ±3*pi/4
* atan2(±Infinity, +Infinity) = ±pi/4
* atan2(NaN, x) = NaN
* atan2(y, NaN) = NaN
*
*/
function atan2(y, x) {
y = new this(y);
x = new this(x);
var r,
pr = this.precision,
rm = this.rounding,
wpr = pr + 4;
// Either NaN
if (!y.s || !x.s) {
r = new this(NaN);
// Both ±Infinity
} else if (!y.d && !x.d) {
r = getPi(this, wpr, 1).times(x.s > 0 ? 0.25 : 0.75);
r.s = y.s;
// x is ±Infinity or y is ±0
} else if (!x.d || y.isZero()) {
r = x.s < 0 ? getPi(this, pr, rm) : new this(0);
r.s = y.s;
// y is ±Infinity or x is ±0
} else if (!y.d || x.isZero()) {
r = getPi(this, wpr, 1).times(0.5);
r.s = y.s;
// Both non-zero and finite
} else if (x.s < 0) {
this.precision = wpr;
this.rounding = 1;
r = this.atan(divide(y, x, wpr, 1));
x = getPi(this, wpr, 1);
this.precision = pr;
this.rounding = rm;
r = y.s < 0 ? r.minus(x) : r.plus(x);
} else {
r = this.atan(divide(y, x, wpr, 1));
}
return r;
}
/*
* Return a new Decimal whose value is the cube root of `x`, rounded to `precision` significant
* digits using rounding mode `rounding`.
*
* x {number|string|Decimal}
*
*/
function cbrt(x) {
return new this(x).cbrt();
}
/*
* Return a new Decimal whose value is `x` rounded to an integer using `ROUND_CEIL`.
*
* x {number|string|Decimal}
*
*/
function ceil(x) {
return finalise(x = new this(x), x.e + 1, 2);
}
/*
* Configure global settings for a Decimal constructor.
*
* `obj` is an object with one or more of the following properties,
*
* precision {number}
* rounding {number}
* toExpNeg {number}
* toExpPos {number}
* maxE {number}
* minE {number}
* modulo {number}
* crypto {boolean|number}
* defaults {true}
*
* E.g. Decimal.config({ precision: 20, rounding: 4 })
*
*/
function config(obj) {
if (!obj || typeof obj !== 'object') throw Error(decimalError + 'Object expected');
var i, p, v,
useDefaults = obj.defaults === true,
ps = [
'precision', 1, MAX_DIGITS,
'rounding', 0, 8,
'toExpNeg', -EXP_LIMIT, 0,
'toExpPos', 0, EXP_LIMIT,
'maxE', 0, EXP_LIMIT,
'minE', -EXP_LIMIT, 0,
'modulo', 0, 9
];
for (i = 0; i < ps.length; i += 3) {
if (p = ps[i], useDefaults) this[p] = DEFAULTS[p];
if ((v = obj[p]) !== void 0) {
if (mathfloor(v) === v && v >= ps[i + 1] && v <= ps[i + 2]) this[p] = v;
else throw Error(invalidArgument + p + ': ' + v);
}
}
if (p = 'crypto', useDefaults) this[p] = DEFAULTS[p];
if ((v = obj[p]) !== void 0) {
if (v === true || v === false || v === 0 || v === 1) {
if (v) {
if (typeof crypto != 'undefined' && crypto &&
(crypto.getRandomValues || crypto.randomBytes)) {
this[p] = true;
} else {
throw Error(cryptoUnavailable);
}
} else {
this[p] = false;
}
} else {
throw Error(invalidArgument + p + ': ' + v);
}
}
return this;
}
/*
* Return a new Decimal whose value is the cosine of `x`, rounded to `precision` significant
* digits using rounding mode `rounding`.
*
* x {number|string|Decimal} A value in radians.
*
*/
function cos(x) {
return new this(x).cos();
}
/*
* Return a new Decimal whose value is the hyperbolic cosine of `x`, rounded to precision
* significant digits using rounding mode `rounding`.
*
* x {number|string|Decimal} A value in radians.
*
*/
function cosh(x) {
return new this(x).cosh();
}
/*
* Create and return a Decimal constructor with the same configuration properties as this Decimal
* constructor.
*
*/
function clone(obj) {
var i, p, ps;
/*
* The Decimal constructor and exported function.
* Return a new Decimal instance.
*
* v {number|string|Decimal} A numeric value.
*
*/
function Decimal(v) {
var e, i, t,
x = this;
// Decimal called without new.
if (!(x instanceof Decimal)) return new Decimal(v);
// Retain a reference to this Decimal constructor, and shadow Decimal.prototype.constructor
// which points to Object.
x.constructor = Decimal;
// Duplicate.
if (v instanceof Decimal) {
x.s = v.s;
if (external) {
if (!v.d || v.e > Decimal.maxE) {
// Infinity.
x.e = NaN;
x.d = null;
} else if (v.e < Decimal.minE) {
// Zero.
x.e = 0;
x.d = [0];
} else {
x.e = v.e;
x.d = v.d.slice();
}
} else {
x.e = v.e;
x.d = v.d ? v.d.slice() : v.d;
}
return;
}
t = typeof v;
if (t === 'number') {
if (v === 0) {
x.s = 1 / v < 0 ? -1 : 1;
x.e = 0;
x.d = [0];
return;
}
if (v < 0) {
v = -v;
x.s = -1;
} else {
x.s = 1;
}
// Fast path for small integers.
if (v === ~~v && v < 1e7) {
for (e = 0, i = v; i >= 10; i /= 10) e++;
if (external) {
if (e > Decimal.maxE) {
x.e = NaN;
x.d = null;
} else if (e < Decimal.minE) {
x.e = 0;
x.d = [0];
} else {
x.e = e;
x.d = [v];
}
} else {
x.e = e;
x.d = [v];
}
return;
// Infinity, NaN.
} else if (v * 0 !== 0) {
if (!v) x.s = NaN;
x.e = NaN;
x.d = null;
return;
}
return parseDecimal(x, v.toString());
} else if (t !== 'string') {
throw Error(invalidArgument + v);
}
// Minus sign?
if ((i = v.charCodeAt(0)) === 45) {
v = v.slice(1);
x.s = -1;
} else {
// Plus sign?
if (i === 43) v = v.slice(1);
x.s = 1;
}
return isDecimal.test(v) ? parseDecimal(x, v) : parseOther(x, v);
}
Decimal.prototype = P;
Decimal.ROUND_UP = 0;
Decimal.ROUND_DOWN = 1;
Decimal.ROUND_CEIL = 2;
Decimal.ROUND_FLOOR = 3;
Decimal.ROUND_HALF_UP = 4;
Decimal.ROUND_HALF_DOWN = 5;
Decimal.ROUND_HALF_EVEN = 6;
Decimal.ROUND_HALF_CEIL = 7;
Decimal.ROUND_HALF_FLOOR = 8;
Decimal.EUCLID = 9;
Decimal.config = Decimal.set = config;
Decimal.clone = clone;
Decimal.isDecimal = isDecimalInstance;
Decimal.abs = abs;
Decimal.acos = acos;
Decimal.acosh = acosh; // ES6
Decimal.add = add;
Decimal.asin = asin;
Decimal.asinh = asinh; // ES6
Decimal.atan = atan;
Decimal.atanh = atanh; // ES6
Decimal.atan2 = atan2;
Decimal.cbrt = cbrt; // ES6
Decimal.ceil = ceil;
Decimal.cos = cos;
Decimal.cosh = cosh; // ES6
Decimal.div = div;
Decimal.exp = exp;
Decimal.floor = floor;
Decimal.hypot = hypot; // ES6
Decimal.ln = ln;
Decimal.log = log;
Decimal.log10 = log10; // ES6
Decimal.log2 = log2; // ES6
Decimal.max = max;
Decimal.min = min;
Decimal.mod = mod;
Decimal.mul = mul;
Decimal.pow = pow;
Decimal.random = random;
Decimal.round = round;
Decimal.sign = sign; // ES6
Decimal.sin = sin;
Decimal.sinh = sinh; // ES6
Decimal.sqrt = sqrt;
Decimal.sub = sub;
Decimal.tan = tan;
Decimal.tanh = tanh; // ES6
Decimal.trunc = trunc; // ES6
if (obj === void 0) obj = {};
if (obj) {
if (obj.defaults !== true) {
ps = ['precision', 'rounding', 'toExpNeg', 'toExpPos', 'maxE', 'minE', 'modulo', 'crypto'];
for (i = 0; i < ps.length;) if (!obj.hasOwnProperty(p = ps[i++])) obj[p] = this[p];
}
}
Decimal.config(obj);
return Decimal;
}
/*
* Return a new Decimal whose value is `x` divided by `y`, rounded to `precision` significant
* digits using rounding mode `rounding`.
*
* x {number|string|Decimal}
* y {number|string|Decimal}
*
*/
function div(x, y) {
return new this(x).div(y);
}
/*
* Return a new Decimal whose value is the natural exponential of `x`, rounded to `precision`
* significant digits using rounding mode `rounding`.
*
* x {number|string|Decimal} The power to which to raise the base of the natural log.
*
*/
function exp(x) {
return new this(x).exp();
}
/*
* Return a new Decimal whose value is `x` round to an integer using `ROUND_FLOOR`.
*
* x {number|string|Decimal}
*
*/
function floor(x) {
return finalise(x = new this(x), x.e + 1, 3);
}
/*
* Return a new Decimal whose value is the square root of the sum of the squares of the arguments,
* rounded to `precision` significant digits using rounding mode `rounding`.
*
* hypot(a, b, ...) = sqrt(a^2 + b^2 + ...)
*
* arguments {number|string|Decimal}
*
*/
function hypot() {
var i, n,
t = new this(0);
external = false;
for (i = 0; i < arguments.length;) {
n = new this(arguments[i++]);
if (!n.d) {
if (n.s) {
external = true;
return new this(1 / 0);
}
t = n;
} else if (t.d) {
t = t.plus(n.times(n));
}
}
external = true;
return t.sqrt();
}
/*
* Return true if object is a Decimal instance (where Decimal is any Decimal constructor),
* otherwise return false.
*
*/
function isDecimalInstance(obj) {
return obj instanceof Decimal || obj && obj.name === '[object Decimal]' || false;
}
/*
* Return a new Decimal whose value is the natural logarithm of `x`, rounded to `precision`
* significant digits using rounding mode `rounding`.
*
* x {number|string|Decimal}
*
*/
function ln(x) {
return new this(x).ln();
}
/*
* Return a new Decimal whose value is the log of `x` to the base `y`, or to base 10 if no base
* is specified, rounded to `precision` significant digits using rounding mode `rounding`.
*
* log[y](x)
*
* x {number|string|Decimal} The argument of the logarithm.
* y {number|string|Decimal} The base of the logarithm.
*
*/
function log(x, y) {
return new this(x).log(y);
}
/*
* Return a new Decimal whose value is the base 2 logarithm of `x`, rounded to `precision`
* significant digits using rounding mode `rounding`.
*
* x {number|string|Decimal}
*
*/
function log2(x) {
return new this(x).log(2);
}
/*
* Return a new Decimal whose value is the base 10 logarithm of `x`, rounded to `precision`
* significant digits using rounding mode `rounding`.
*
* x {number|string|Decimal}
*
*/
function log10(x) {
return new this(x).log(10);
}
/*
* Return a new Decimal whose value is the maximum of the arguments.
*
* arguments {number|string|Decimal}
*
*/
function max() {
return maxOrMin(this, arguments, 'lt');
}
/*
* Return a new Decimal whose value is the minimum of the arguments.
*
* arguments {number|string|Decimal}
*
*/
function min() {
return maxOrMin(this, arguments, 'gt');
}
/*
* Return a new Decimal whose value is `x` modulo `y`, rounded to `precision` significant digits
* using rounding mode `rounding`.
*
* x {number|string|Decimal}
* y {number|string|Decimal}
*
*/
function mod(x, y) {
return new this(x).mod(y);
}
/*
* Return a new Decimal whose value is `x` multiplied by `y`, rounded to `precision` significant
* digits using rounding mode `rounding`.
*
* x {number|string|Decimal}
* y {number|string|Decimal}
*
*/
function mul(x, y) {
return new this(x).mul(y);
}
/*
* Return a new Decimal whose value is `x` raised to the power `y`, rounded to precision
* significant digits using rounding mode `rounding`.
*
* x {number|string|Decimal} The base.
* y {number|string|Decimal} The exponent.
*
*/
function pow(x, y) {
return new this(x).pow(y);
}
/*
* Returns a new Decimal with a random value equal to or greater than 0 and less than 1, and with
* `sd`, or `Decimal.precision` if `sd` is omitted, significant digits (or less if trailing zeros
* are produced).
*
* [sd] {number} Significant digits. Integer, 0 to MAX_DIGITS inclusive.
*
*/
function random(sd) {
var d, e, k, n,
i = 0,
r = new this(1),
rd = [];
if (sd === void 0) sd = this.precision;
else checkInt32(sd, 1, MAX_DIGITS);
k = Math.ceil(sd / LOG_BASE);
if (!this.crypto) {
for (; i < k;) rd[i++] = Math.random() * 1e7 | 0;
// Browsers supporting crypto.getRandomValues.
} else if (crypto.getRandomValues) {
d = crypto.getRandomValues(new Uint32Array(k));
for (; i < k;) {
n = d[i];
// 0 <= n < 4294967296
// Probability n >= 4.29e9, is 4967296 / 4294967296 = 0.00116 (1 in 865).
if (n >= 4.29e9) {
d[i] = crypto.getRandomValues(new Uint32Array(1))[0];
} else {
// 0 <= n <= 4289999999
// 0 <= (n % 1e7) <= 9999999
rd[i++] = n % 1e7;
}
}
// Node.js supporting crypto.randomBytes.
} else if (crypto.randomBytes) {
// buffer
d = crypto.randomBytes(k *= 4);
for (; i < k;) {
// 0 <= n < 2147483648
n = d[i] + (d[i + 1] << 8) + (d[i + 2] << 16) + ((d[i + 3] & 0x7f) << 24);
// Probability n >= 2.14e9, is 7483648 / 2147483648 = 0.0035 (1 in 286).
if (n >= 2.14e9) {
crypto.randomBytes(4).copy(d, i);
} else {
// 0 <= n <= 2139999999
// 0 <= (n % 1e7) <= 9999999
rd.push(n % 1e7);
i += 4;
}
}
i = k / 4;
} else {
throw Error(cryptoUnavailable);
}
k = rd[--i];
sd %= LOG_BASE;
// Convert trailing digits to zeros according to sd.
if (k && sd) {
n = mathpow(10, LOG_BASE - sd);
rd[i] = (k / n | 0) * n;
}
// Remove trailing words which are zero.
for (; rd[i] === 0; i--) rd.pop();
// Zero?
if (i < 0) {
e = 0;
rd = [0];
} else {
e = -1;
// Remove leading words which are zero and adjust exponent accordingly.
for (; rd[0] === 0; e -= LOG_BASE) rd.shift();
// Count the digits of the first word of rd to determine leading zeros.
for (k = 1, n = rd[0]; n >= 10; n /= 10) k++;
// Adjust the exponent for leading zeros of the first word of rd.
if (k < LOG_BASE) e -= LOG_BASE - k;
}
r.e = e;
r.d = rd;
return r;
}
/*
* Return a new Decimal whose value is `x` rounded to an integer using rounding mode `rounding`.
*
* To emulate `Math.round`, set rounding to 7 (ROUND_HALF_CEIL).
*
* x {number|string|Decimal}
*
*/
function round(x) {
return finalise(x = new this(x), x.e + 1, this.rounding);
}
/*
* Return
* 1 if x > 0,
* -1 if x < 0,
* 0 if x is 0,
* -0 if x is -0,
* NaN otherwise
*
* x {number|string|Decimal}
*
*/
function sign(x) {
x = new this(x);
return x.d ? (x.d[0] ? x.s : 0 * x.s) : x.s || NaN;
}
/*
* Return a new Decimal whose value is the sine of `x`, rounded to `precision` significant digits
* using rounding mode `rounding`.
*
* x {number|string|Decimal} A value in radians.
*
*/
function sin(x) {
return new this(x).sin();
}
/*
* Return a new Decimal whose value is the hyperbolic sine of `x`, rounded to `precision`
* significant digits using rounding mode `rounding`.
*
* x {number|string|Decimal} A value in radians.
*
*/
function sinh(x) {
return new this(x).sinh();
}
/*
* Return a new Decimal whose value is the square root of `x`, rounded to `precision` significant
* digits using rounding mode `rounding`.
*
* x {number|string|Decimal}
*
*/
function sqrt(x) {
return new this(x).sqrt();
}
/*
* Return a new Decimal whose value is `x` minus `y`, rounded to `precision` significant digits
* using rounding mode `rounding`.
*
* x {number|string|Decimal}
* y {number|string|Decimal}
*
*/
function sub(x, y) {
return new this(x).sub(y);
}
/*
* Return a new Decimal whose value is the tangent of `x`, rounded to `precision` significant
* digits using rounding mode `rounding`.
*
* x {number|string|Decimal} A value in radians.
*
*/
function tan(x) {
return new this(x).tan();
}
/*
* Return a new Decimal whose value is the hyperbolic tangent of `x`, rounded to `precision`
* significant digits using rounding mode `rounding`.
*
* x {number|string|Decimal} A value in radians.
*
*/
function tanh(x) {
return new this(x).tanh();
}
/*
* Return a new Decimal whose value is `x` truncated to an integer.
*
* x {number|string|Decimal}
*
*/
function trunc(x) {
return finalise(x = new this(x), x.e + 1, 1);
}
// Create and configure initial Decimal constructor.
Decimal = clone(DEFAULTS);
Decimal['default'] = Decimal.Decimal = Decimal;
// Create the internal constants from their string values.
LN10 = new Decimal(LN10);
PI = new Decimal(PI);
// Export.
// AMD.
if (true) {
!(__WEBPACK_AMD_DEFINE_RESULT__ = (function () {
return Decimal;
}).call(exports, __webpack_require__, exports, module),
__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));
// Node and other environments that support module.exports.
} else {}
})(this);
/***/ }),
/* 16 */
/***/ (function(module, exports, __webpack_require__) {
"use strict";
// Map the characters to escape to their escaped values. The list is derived
// from http://www.cespedes.org/blog/85/how-to-escape-latex-special-characters
var _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };
var defaultEscapes = {
"{": "\\{",
"}": "\\}",
"\\": "\\textbackslash{}",
"#": "\\#",
$: "\\$",
"%": "\\%",
"&": "\\&",
"^": "\\textasciicircum{}",
_: "\\_",
"~": "\\textasciitilde{}"
};
var formatEscapes = {
"\u2013": "\\--",
"\u2014": "\\---",
" ": "~",
"\t": "\\qquad{}",
"\r\n": "\\newline{}",
"\n": "\\newline{}"
};
var defaultEscapeMapFn = function defaultEscapeMapFn(defaultEscapes, formatEscapes) {
return _extends({}, defaultEscapes, formatEscapes);
};
/**
* Escape a string to be used in LaTeX documents.
* @param {string} str the string to be escaped.
* @param {boolean} params.preserveFormatting whether formatting escapes should
* be performed (default: false).
* @param {function} params.escapeMapFn the function to modify the escape maps.
* @return {string} the escaped string, ready to be used in LaTeX.
*/
module.exports = function (str) {
var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},
_ref$preserveFormatti = _ref.preserveFormatting,
preserveFormatting = _ref$preserveFormatti === undefined ? false : _ref$preserveFormatti,
_ref$escapeMapFn = _ref.escapeMapFn,
escapeMapFn = _ref$escapeMapFn === undefined ? defaultEscapeMapFn : _ref$escapeMapFn;
var runningStr = String(str);
var result = "";
var escapes = escapeMapFn(_extends({}, defaultEscapes), preserveFormatting ? _extends({}, formatEscapes) : {});
var escapeKeys = Object.keys(escapes); // as it is reused later on
// Algorithm: Go through the string character by character, if it matches
// with one of the special characters then we'll replace it with the escaped
// version.
var _loop = function _loop() {
var specialCharFound = false;
escapeKeys.forEach(function (key, index) {
if (specialCharFound) {
return;
}
if (runningStr.length >= key.length && runningStr.slice(0, key.length) === key) {
result += escapes[escapeKeys[index]];
runningStr = runningStr.slice(key.length, runningStr.length);
specialCharFound = true;
}
});
if (!specialCharFound) {
result += runningStr.slice(0, 1);
runningStr = runningStr.slice(1, runningStr.length);
}
};
while (runningStr) {
_loop();
}
return result;
};
/***/ }),
/* 17 */
/***/ (function(module, exports) {
function E () {
// Keep this empty so it's easier to inherit from
// (via https://github.com/lipsmack from https://github.com/scottcorgan/tiny-emitter/issues/3)
}
E.prototype = {
on: function (name, callback, ctx) {
var e = this.e || (this.e = {});
(e[name] || (e[name] = [])).push({
fn: callback,
ctx: ctx
});
return this;
},
once: function (name, callback, ctx) {
var self = this;
function listener () {
self.off(name, listener);
callback.apply(ctx, arguments);
};
listener._ = callback
return this.on(name, listener, ctx);
},
emit: function (name) {
var data = [].slice.call(arguments, 1);
var evtArr = ((this.e || (this.e = {}))[name] || []).slice();
var i = 0;
var len = evtArr.length;
for (i; i < len; i++) {
evtArr[i].fn.apply(evtArr[i].ctx, data);
}
return this;
},
off: function (name, callback) {
var e = this.e || (this.e = {});
var evts = e[name];
var liveEvents = [];
if (evts && callback) {
for (var i = 0, len = evts.length; i < len; i++) {
if (evts[i].fn !== callback && evts[i].fn._ !== callback)
liveEvents.push(evts[i]);
}
}
// Remove event from queue to prevent memory leak
// Suggested by https://github.com/lazd
// Ref: https://github.com/scottcorgan/tiny-emitter/commit/c6ebfaa9bc973b33d110a84a307742b7cf94c953#commitcomment-5024910
(liveEvents.length)
? e[name] = liveEvents
: delete e[name];
return this;
}
};
module.exports = E;
module.exports.TinyEmitter = E;
/***/ }),
/* 18 */
/***/ (function(module, exports, __webpack_require__) {
var all = __webpack_require__(20);
var _require = __webpack_require__(21),
create = _require.create;
var defaultInstance = create(all); // TODO: not nice having to revert to CommonJS, find an ES6 solution
module.exports = /* #__PURE__ */defaultInstance;
/***/ }),
/* 19 */
/***/ (function(module, exports) {
var g;
// This works in non-strict mode
g = (function() {
return this;
})();
try {
// This works if eval is allowed (see CSP)
g = g || new Function("return this")();
} catch (e) {
// This works if the window reference is available
if (typeof window === "object") g = window;
}
// g can still be undefined, but nothing to do about it...
// We return undefined, instead of nothing here, so it's
// easier to handle this case. if(!global) { ...}
module.exports = g;
/***/ }),
/* 20 */
/***/ (function(module, __webpack_exports__, __webpack_require__) {
"use strict";
// ESM COMPAT FLAG
__webpack_require__.r(__webpack_exports__);
// EXPORTS
__webpack_require__.d(__webpack_exports__, "createTyped", function() { return /* reexport */ typed_createTyped; });
__webpack_require__.d(__webpack_exports__, "createResultSet", function() { return /* reexport */ createResultSet; });
__webpack_require__.d(__webpack_exports__, "createBigNumberClass", function() { return /* reexport */ createBigNumberClass; });
__webpack_require__.d(__webpack_exports__, "createComplexClass", function() { return /* reexport */ createComplexClass; });
__webpack_require__.d(__webpack_exports__, "createFractionClass", function() { return /* reexport */ createFractionClass; });
__webpack_require__.d(__webpack_exports__, "createRangeClass", function() { return /* reexport */ createRangeClass; });
__webpack_require__.d(__webpack_exports__, "createMatrixClass", function() { return /* reexport */ createMatrixClass; });
__webpack_require__.d(__webpack_exports__, "createDenseMatrixClass", function() { return /* reexport */ createDenseMatrixClass; });
__webpack_require__.d(__webpack_exports__, "createClone", function() { return /* reexport */ createClone; });
__webpack_require__.d(__webpack_exports__, "createIsInteger", function() { return /* reexport */ createIsInteger; });
__webpack_require__.d(__webpack_exports__, "createIsNegative", function() { return /* reexport */ createIsNegative; });
__webpack_require__.d(__webpack_exports__, "createIsNumeric", function() { return /* reexport */ createIsNumeric; });
__webpack_require__.d(__webpack_exports__, "createHasNumericValue", function() { return /* reexport */ createHasNumericValue; });
__webpack_require__.d(__webpack_exports__, "createIsPositive", function() { return /* reexport */ createIsPositive; });
__webpack_require__.d(__webpack_exports__, "createIsZero", function() { return /* reexport */ createIsZero; });
__webpack_require__.d(__webpack_exports__, "createIsNaN", function() { return /* reexport */ createIsNaN; });
__webpack_require__.d(__webpack_exports__, "createTypeOf", function() { return /* reexport */ createTypeOf; });
__webpack_require__.d(__webpack_exports__, "createEqualScalar", function() { return /* reexport */ createEqualScalar; });
__webpack_require__.d(__webpack_exports__, "createSparseMatrixClass", function() { return /* reexport */ createSparseMatrixClass; });
__webpack_require__.d(__webpack_exports__, "createNumber", function() { return /* reexport */ createNumber; });
__webpack_require__.d(__webpack_exports__, "createString", function() { return /* reexport */ createString; });
__webpack_require__.d(__webpack_exports__, "createBoolean", function() { return /* reexport */ createBoolean; });
__webpack_require__.d(__webpack_exports__, "createBignumber", function() { return /* reexport */ createBignumber; });
__webpack_require__.d(__webpack_exports__, "createComplex", function() { return /* reexport */ createComplex; });
__webpack_require__.d(__webpack_exports__, "createFraction", function() { return /* reexport */ createFraction; });
__webpack_require__.d(__webpack_exports__, "createMatrix", function() { return /* reexport */ createMatrix; });
__webpack_require__.d(__webpack_exports__, "createSplitUnit", function() { return /* reexport */ createSplitUnit; });
__webpack_require__.d(__webpack_exports__, "createUnaryMinus", function() { return /* reexport */ createUnaryMinus; });
__webpack_require__.d(__webpack_exports__, "createUnaryPlus", function() { return /* reexport */ createUnaryPlus; });
__webpack_require__.d(__webpack_exports__, "createAbs", function() { return /* reexport */ createAbs; });
__webpack_require__.d(__webpack_exports__, "createApply", function() { return /* reexport */ createApply; });
__webpack_require__.d(__webpack_exports__, "createAddScalar", function() { return /* reexport */ createAddScalar; });
__webpack_require__.d(__webpack_exports__, "createCbrt", function() { return /* reexport */ createCbrt; });
__webpack_require__.d(__webpack_exports__, "createCeil", function() { return /* reexport */ createCeil; });
__webpack_require__.d(__webpack_exports__, "createCube", function() { return /* reexport */ createCube; });
__webpack_require__.d(__webpack_exports__, "createExp", function() { return /* reexport */ createExp; });
__webpack_require__.d(__webpack_exports__, "createExpm1", function() { return /* reexport */ createExpm1; });
__webpack_require__.d(__webpack_exports__, "createFix", function() { return /* reexport */ createFix; });
__webpack_require__.d(__webpack_exports__, "createFloor", function() { return /* reexport */ createFloor; });
__webpack_require__.d(__webpack_exports__, "createGcd", function() { return /* reexport */ createGcd; });
__webpack_require__.d(__webpack_exports__, "createLcm", function() { return /* reexport */ createLcm; });
__webpack_require__.d(__webpack_exports__, "createLog10", function() { return /* reexport */ createLog10; });
__webpack_require__.d(__webpack_exports__, "createLog2", function() { return /* reexport */ createLog2; });
__webpack_require__.d(__webpack_exports__, "createMod", function() { return /* reexport */ createMod; });
__webpack_require__.d(__webpack_exports__, "createMultiplyScalar", function() { return /* reexport */ createMultiplyScalar; });
__webpack_require__.d(__webpack_exports__, "createMultiply", function() { return /* reexport */ createMultiply; });
__webpack_require__.d(__webpack_exports__, "createNthRoot", function() { return /* reexport */ createNthRoot; });
__webpack_require__.d(__webpack_exports__, "createSign", function() { return /* reexport */ createSign; });
__webpack_require__.d(__webpack_exports__, "createSqrt", function() { return /* reexport */ createSqrt; });
__webpack_require__.d(__webpack_exports__, "createSquare", function() { return /* reexport */ createSquare; });
__webpack_require__.d(__webpack_exports__, "createSubtract", function() { return /* reexport */ createSubtract; });
__webpack_require__.d(__webpack_exports__, "createXgcd", function() { return /* reexport */ createXgcd; });
__webpack_require__.d(__webpack_exports__, "createDotMultiply", function() { return /* reexport */ createDotMultiply; });
__webpack_require__.d(__webpack_exports__, "createBitAnd", function() { return /* reexport */ createBitAnd; });
__webpack_require__.d(__webpack_exports__, "createBitNot", function() { return /* reexport */ createBitNot; });
__webpack_require__.d(__webpack_exports__, "createBitOr", function() { return /* reexport */ createBitOr; });
__webpack_require__.d(__webpack_exports__, "createBitXor", function() { return /* reexport */ createBitXor; });
__webpack_require__.d(__webpack_exports__, "createArg", function() { return /* reexport */ createArg; });
__webpack_require__.d(__webpack_exports__, "createConj", function() { return /* reexport */ createConj; });
__webpack_require__.d(__webpack_exports__, "createIm", function() { return /* reexport */ createIm; });
__webpack_require__.d(__webpack_exports__, "createRe", function() { return /* reexport */ createRe; });
__webpack_require__.d(__webpack_exports__, "createNot", function() { return /* reexport */ createNot; });
__webpack_require__.d(__webpack_exports__, "createOr", function() { return /* reexport */ createOr; });
__webpack_require__.d(__webpack_exports__, "createXor", function() { return /* reexport */ createXor; });
__webpack_require__.d(__webpack_exports__, "createConcat", function() { return /* reexport */ createConcat; });
__webpack_require__.d(__webpack_exports__, "createColumn", function() { return /* reexport */ createColumn; });
__webpack_require__.d(__webpack_exports__, "createCross", function() { return /* reexport */ createCross; });
__webpack_require__.d(__webpack_exports__, "createDiag", function() { return /* reexport */ createDiag; });
__webpack_require__.d(__webpack_exports__, "createFilter", function() { return /* reexport */ createFilter; });
__webpack_require__.d(__webpack_exports__, "createFlatten", function() { return /* reexport */ createFlatten; });
__webpack_require__.d(__webpack_exports__, "createForEach", function() { return /* reexport */ createForEach; });
__webpack_require__.d(__webpack_exports__, "createGetMatrixDataType", function() { return /* reexport */ createGetMatrixDataType; });
__webpack_require__.d(__webpack_exports__, "createIdentity", function() { return /* reexport */ createIdentity; });
__webpack_require__.d(__webpack_exports__, "createKron", function() { return /* reexport */ createKron; });
__webpack_require__.d(__webpack_exports__, "createMap", function() { return /* reexport */ createMap; });
__webpack_require__.d(__webpack_exports__, "createOnes", function() { return /* reexport */ createOnes; });
__webpack_require__.d(__webpack_exports__, "createRange", function() { return /* reexport */ range_createRange; });
__webpack_require__.d(__webpack_exports__, "createReshape", function() { return /* reexport */ createReshape; });
__webpack_require__.d(__webpack_exports__, "createResize", function() { return /* reexport */ createResize; });
__webpack_require__.d(__webpack_exports__, "createRow", function() { return /* reexport */ createRow; });
__webpack_require__.d(__webpack_exports__, "createSize", function() { return /* reexport */ createSize; });
__webpack_require__.d(__webpack_exports__, "createSqueeze", function() { return /* reexport */ createSqueeze; });
__webpack_require__.d(__webpack_exports__, "createSubset", function() { return /* reexport */ createSubset; });
__webpack_require__.d(__webpack_exports__, "createTranspose", function() { return /* reexport */ createTranspose; });
__webpack_require__.d(__webpack_exports__, "createCtranspose", function() { return /* reexport */ createCtranspose; });
__webpack_require__.d(__webpack_exports__, "createZeros", function() { return /* reexport */ createZeros; });
__webpack_require__.d(__webpack_exports__, "createErf", function() { return /* reexport */ createErf; });
__webpack_require__.d(__webpack_exports__, "createMode", function() { return /* reexport */ createMode; });
__webpack_require__.d(__webpack_exports__, "createProd", function() { return /* reexport */ createProd; });
__webpack_require__.d(__webpack_exports__, "createFormat", function() { return /* reexport */ createFormat; });
__webpack_require__.d(__webpack_exports__, "createPrint", function() { return /* reexport */ createPrint; });
__webpack_require__.d(__webpack_exports__, "createTo", function() { return /* reexport */ createTo; });
__webpack_require__.d(__webpack_exports__, "createIsPrime", function() { return /* reexport */ createIsPrime; });
__webpack_require__.d(__webpack_exports__, "createNumeric", function() { return /* reexport */ createNumeric; });
__webpack_require__.d(__webpack_exports__, "createDivideScalar", function() { return /* reexport */ createDivideScalar; });
__webpack_require__.d(__webpack_exports__, "createPow", function() { return /* reexport */ createPow; });
__webpack_require__.d(__webpack_exports__, "createRound", function() { return /* reexport */ createRound; });
__webpack_require__.d(__webpack_exports__, "createLog", function() { return /* reexport */ createLog; });
__webpack_require__.d(__webpack_exports__, "createLog1p", function() { return /* reexport */ createLog1p; });
__webpack_require__.d(__webpack_exports__, "createNthRoots", function() { return /* reexport */ createNthRoots; });
__webpack_require__.d(__webpack_exports__, "createDotPow", function() { return /* reexport */ createDotPow; });
__webpack_require__.d(__webpack_exports__, "createDotDivide", function() { return /* reexport */ createDotDivide; });
__webpack_require__.d(__webpack_exports__, "createLsolve", function() { return /* reexport */ createLsolve; });
__webpack_require__.d(__webpack_exports__, "createUsolve", function() { return /* reexport */ createUsolve; });
__webpack_require__.d(__webpack_exports__, "createLeftShift", function() { return /* reexport */ createLeftShift; });
__webpack_require__.d(__webpack_exports__, "createRightArithShift", function() { return /* reexport */ createRightArithShift; });
__webpack_require__.d(__webpack_exports__, "createRightLogShift", function() { return /* reexport */ createRightLogShift; });
__webpack_require__.d(__webpack_exports__, "createAnd", function() { return /* reexport */ createAnd; });
__webpack_require__.d(__webpack_exports__, "createCompare", function() { return /* reexport */ createCompare; });
__webpack_require__.d(__webpack_exports__, "createCompareNatural", function() { return /* reexport */ createCompareNatural; });
__webpack_require__.d(__webpack_exports__, "createCompareText", function() { return /* reexport */ createCompareText; });
__webpack_require__.d(__webpack_exports__, "createEqual", function() { return /* reexport */ createEqual; });
__webpack_require__.d(__webpack_exports__, "createEqualText", function() { return /* reexport */ createEqualText; });
__webpack_require__.d(__webpack_exports__, "createSmaller", function() { return /* reexport */ createSmaller; });
__webpack_require__.d(__webpack_exports__, "createSmallerEq", function() { return /* reexport */ createSmallerEq; });
__webpack_require__.d(__webpack_exports__, "createLarger", function() { return /* reexport */ createLarger; });
__webpack_require__.d(__webpack_exports__, "createLargerEq", function() { return /* reexport */ createLargerEq; });
__webpack_require__.d(__webpack_exports__, "createDeepEqual", function() { return /* reexport */ createDeepEqual; });
__webpack_require__.d(__webpack_exports__, "createUnequal", function() { return /* reexport */ createUnequal; });
__webpack_require__.d(__webpack_exports__, "createPartitionSelect", function() { return /* reexport */ createPartitionSelect; });
__webpack_require__.d(__webpack_exports__, "createSort", function() { return /* reexport */ createSort; });
__webpack_require__.d(__webpack_exports__, "createMax", function() { return /* reexport */ createMax; });
__webpack_require__.d(__webpack_exports__, "createMin", function() { return /* reexport */ createMin; });
__webpack_require__.d(__webpack_exports__, "createImmutableDenseMatrixClass", function() { return /* reexport */ createImmutableDenseMatrixClass; });
__webpack_require__.d(__webpack_exports__, "createIndexClass", function() { return /* reexport */ createIndexClass; });
__webpack_require__.d(__webpack_exports__, "createFibonacciHeapClass", function() { return /* reexport */ createFibonacciHeapClass; });
__webpack_require__.d(__webpack_exports__, "createSpaClass", function() { return /* reexport */ createSpaClass; });
__webpack_require__.d(__webpack_exports__, "createUnitClass", function() { return /* reexport */ createUnitClass; });
__webpack_require__.d(__webpack_exports__, "createUnitFunction", function() { return /* reexport */ createUnitFunction; });
__webpack_require__.d(__webpack_exports__, "createSparse", function() { return /* reexport */ createSparse; });
__webpack_require__.d(__webpack_exports__, "createCreateUnit", function() { return /* reexport */ createCreateUnit; });
__webpack_require__.d(__webpack_exports__, "createAcos", function() { return /* reexport */ createAcos; });
__webpack_require__.d(__webpack_exports__, "createAcosh", function() { return /* reexport */ createAcosh; });
__webpack_require__.d(__webpack_exports__, "createAcot", function() { return /* reexport */ createAcot; });
__webpack_require__.d(__webpack_exports__, "createAcoth", function() { return /* reexport */ createAcoth; });
__webpack_require__.d(__webpack_exports__, "createAcsc", function() { return /* reexport */ createAcsc; });
__webpack_require__.d(__webpack_exports__, "createAcsch", function() { return /* reexport */ createAcsch; });
__webpack_require__.d(__webpack_exports__, "createAsec", function() { return /* reexport */ createAsec; });
__webpack_require__.d(__webpack_exports__, "createAsech", function() { return /* reexport */ createAsech; });
__webpack_require__.d(__webpack_exports__, "createAsin", function() { return /* reexport */ createAsin; });
__webpack_require__.d(__webpack_exports__, "createAsinh", function() { return /* reexport */ createAsinh; });
__webpack_require__.d(__webpack_exports__, "createAtan", function() { return /* reexport */ createAtan; });
__webpack_require__.d(__webpack_exports__, "createAtan2", function() { return /* reexport */ createAtan2; });
__webpack_require__.d(__webpack_exports__, "createAtanh", function() { return /* reexport */ createAtanh; });
__webpack_require__.d(__webpack_exports__, "createCos", function() { return /* reexport */ createCos; });
__webpack_require__.d(__webpack_exports__, "createCosh", function() { return /* reexport */ createCosh; });
__webpack_require__.d(__webpack_exports__, "createCot", function() { return /* reexport */ createCot; });
__webpack_require__.d(__webpack_exports__, "createCoth", function() { return /* reexport */ createCoth; });
__webpack_require__.d(__webpack_exports__, "createCsc", function() { return /* reexport */ createCsc; });
__webpack_require__.d(__webpack_exports__, "createCsch", function() { return /* reexport */ createCsch; });
__webpack_require__.d(__webpack_exports__, "createSec", function() { return /* reexport */ createSec; });
__webpack_require__.d(__webpack_exports__, "createSech", function() { return /* reexport */ createSech; });
__webpack_require__.d(__webpack_exports__, "createSin", function() { return /* reexport */ createSin; });
__webpack_require__.d(__webpack_exports__, "createSinh", function() { return /* reexport */ createSinh; });
__webpack_require__.d(__webpack_exports__, "createTan", function() { return /* reexport */ createTan; });
__webpack_require__.d(__webpack_exports__, "createTanh", function() { return /* reexport */ createTanh; });
__webpack_require__.d(__webpack_exports__, "createSetCartesian", function() { return /* reexport */ createSetCartesian; });
__webpack_require__.d(__webpack_exports__, "createSetDifference", function() { return /* reexport */ createSetDifference; });
__webpack_require__.d(__webpack_exports__, "createSetDistinct", function() { return /* reexport */ createSetDistinct; });
__webpack_require__.d(__webpack_exports__, "createSetIntersect", function() { return /* reexport */ createSetIntersect; });
__webpack_require__.d(__webpack_exports__, "createSetIsSubset", function() { return /* reexport */ createSetIsSubset; });
__webpack_require__.d(__webpack_exports__, "createSetMultiplicity", function() { return /* reexport */ createSetMultiplicity; });
__webpack_require__.d(__webpack_exports__, "createSetPowerset", function() { return /* reexport */ createSetPowerset; });
__webpack_require__.d(__webpack_exports__, "createSetSize", function() { return /* reexport */ createSetSize; });
__webpack_require__.d(__webpack_exports__, "createSetSymDifference", function() { return /* reexport */ createSetSymDifference; });
__webpack_require__.d(__webpack_exports__, "createSetUnion", function() { return /* reexport */ createSetUnion; });
__webpack_require__.d(__webpack_exports__, "createAdd", function() { return /* reexport */ createAdd; });
__webpack_require__.d(__webpack_exports__, "createHypot", function() { return /* reexport */ createHypot; });
__webpack_require__.d(__webpack_exports__, "createNorm", function() { return /* reexport */ createNorm; });
__webpack_require__.d(__webpack_exports__, "createDot", function() { return /* reexport */ createDot; });
__webpack_require__.d(__webpack_exports__, "createTrace", function() { return /* reexport */ createTrace; });
__webpack_require__.d(__webpack_exports__, "createIndex", function() { return /* reexport */ createIndex; });
__webpack_require__.d(__webpack_exports__, "createNode", function() { return /* reexport */ createNode; });
__webpack_require__.d(__webpack_exports__, "createAccessorNode", function() { return /* reexport */ createAccessorNode; });
__webpack_require__.d(__webpack_exports__, "createArrayNode", function() { return /* reexport */ createArrayNode; });
__webpack_require__.d(__webpack_exports__, "createAssignmentNode", function() { return /* reexport */ createAssignmentNode; });
__webpack_require__.d(__webpack_exports__, "createBlockNode", function() { return /* reexport */ createBlockNode; });
__webpack_require__.d(__webpack_exports__, "createConditionalNode", function() { return /* reexport */ createConditionalNode; });
__webpack_require__.d(__webpack_exports__, "createConstantNode", function() { return /* reexport */ ConstantNode_createConstantNode; });
__webpack_require__.d(__webpack_exports__, "createFunctionAssignmentNode", function() { return /* reexport */ createFunctionAssignmentNode; });
__webpack_require__.d(__webpack_exports__, "createIndexNode", function() { return /* reexport */ createIndexNode; });
__webpack_require__.d(__webpack_exports__, "createObjectNode", function() { return /* reexport */ createObjectNode; });
__webpack_require__.d(__webpack_exports__, "createOperatorNode", function() { return /* reexport */ createOperatorNode; });
__webpack_require__.d(__webpack_exports__, "createParenthesisNode", function() { return /* reexport */ createParenthesisNode; });
__webpack_require__.d(__webpack_exports__, "createRangeNode", function() { return /* reexport */ createRangeNode; });
__webpack_require__.d(__webpack_exports__, "createRelationalNode", function() { return /* reexport */ createRelationalNode; });
__webpack_require__.d(__webpack_exports__, "createSymbolNode", function() { return /* reexport */ createSymbolNode; });
__webpack_require__.d(__webpack_exports__, "createFunctionNode", function() { return /* reexport */ createFunctionNode; });
__webpack_require__.d(__webpack_exports__, "createParse", function() { return /* reexport */ createParse; });
__webpack_require__.d(__webpack_exports__, "createCompile", function() { return /* reexport */ createCompile; });
__webpack_require__.d(__webpack_exports__, "createEvaluate", function() { return /* reexport */ createEvaluate; });
__webpack_require__.d(__webpack_exports__, "createParserClass", function() { return /* reexport */ createParserClass; });
__webpack_require__.d(__webpack_exports__, "createParser", function() { return /* reexport */ createParser; });
__webpack_require__.d(__webpack_exports__, "createLup", function() { return /* reexport */ createLup; });
__webpack_require__.d(__webpack_exports__, "createQr", function() { return /* reexport */ createQr; });
__webpack_require__.d(__webpack_exports__, "createSlu", function() { return /* reexport */ createSlu; });
__webpack_require__.d(__webpack_exports__, "createLusolve", function() { return /* reexport */ createLusolve; });
__webpack_require__.d(__webpack_exports__, "createHelpClass", function() { return /* reexport */ createHelpClass; });
__webpack_require__.d(__webpack_exports__, "createChainClass", function() { return /* reexport */ createChainClass; });
__webpack_require__.d(__webpack_exports__, "createHelp", function() { return /* reexport */ createHelp; });
__webpack_require__.d(__webpack_exports__, "createChain", function() { return /* reexport */ createChain; });
__webpack_require__.d(__webpack_exports__, "createDet", function() { return /* reexport */ createDet; });
__webpack_require__.d(__webpack_exports__, "createInv", function() { return /* reexport */ createInv; });
__webpack_require__.d(__webpack_exports__, "createEigs", function() { return /* reexport */ createEigs; });
__webpack_require__.d(__webpack_exports__, "createExpm", function() { return /* reexport */ createExpm; });
__webpack_require__.d(__webpack_exports__, "createSqrtm", function() { return /* reexport */ createSqrtm; });
__webpack_require__.d(__webpack_exports__, "createDivide", function() { return /* reexport */ createDivide; });
__webpack_require__.d(__webpack_exports__, "createDistance", function() { return /* reexport */ createDistance; });
__webpack_require__.d(__webpack_exports__, "createIntersect", function() { return /* reexport */ createIntersect; });
__webpack_require__.d(__webpack_exports__, "createSum", function() { return /* reexport */ createSum; });
__webpack_require__.d(__webpack_exports__, "createMean", function() { return /* reexport */ createMean; });
__webpack_require__.d(__webpack_exports__, "createMedian", function() { return /* reexport */ createMedian; });
__webpack_require__.d(__webpack_exports__, "createMad", function() { return /* reexport */ createMad; });
__webpack_require__.d(__webpack_exports__, "createVariance", function() { return /* reexport */ createVariance; });
__webpack_require__.d(__webpack_exports__, "createQuantileSeq", function() { return /* reexport */ createQuantileSeq; });
__webpack_require__.d(__webpack_exports__, "createStd", function() { return /* reexport */ createStd; });
__webpack_require__.d(__webpack_exports__, "createCombinations", function() { return /* reexport */ createCombinations; });
__webpack_require__.d(__webpack_exports__, "createCombinationsWithRep", function() { return /* reexport */ createCombinationsWithRep; });
__webpack_require__.d(__webpack_exports__, "createGamma", function() { return /* reexport */ createGamma; });
__webpack_require__.d(__webpack_exports__, "createFactorial", function() { return /* reexport */ createFactorial; });
__webpack_require__.d(__webpack_exports__, "createKldivergence", function() { return /* reexport */ createKldivergence; });
__webpack_require__.d(__webpack_exports__, "createMultinomial", function() { return /* reexport */ createMultinomial; });
__webpack_require__.d(__webpack_exports__, "createPermutations", function() { return /* reexport */ createPermutations; });
__webpack_require__.d(__webpack_exports__, "createPickRandom", function() { return /* reexport */ createPickRandom; });
__webpack_require__.d(__webpack_exports__, "createRandom", function() { return /* reexport */ createRandom; });
__webpack_require__.d(__webpack_exports__, "createRandomInt", function() { return /* reexport */ createRandomInt; });
__webpack_require__.d(__webpack_exports__, "createStirlingS2", function() { return /* reexport */ createStirlingS2; });
__webpack_require__.d(__webpack_exports__, "createBellNumbers", function() { return /* reexport */ createBellNumbers; });
__webpack_require__.d(__webpack_exports__, "createCatalan", function() { return /* reexport */ createCatalan; });
__webpack_require__.d(__webpack_exports__, "createComposition", function() { return /* reexport */ createComposition; });
__webpack_require__.d(__webpack_exports__, "createSimplify", function() { return /* reexport */ createSimplify; });
__webpack_require__.d(__webpack_exports__, "createDerivative", function() { return /* reexport */ createDerivative; });
__webpack_require__.d(__webpack_exports__, "createRationalize", function() { return /* reexport */ createRationalize; });
__webpack_require__.d(__webpack_exports__, "createReviver", function() { return /* reexport */ createReviver; });
__webpack_require__.d(__webpack_exports__, "createReplacer", function() { return /* reexport */ createReplacer; });
__webpack_require__.d(__webpack_exports__, "createE", function() { return /* reexport */ createE; });
__webpack_require__.d(__webpack_exports__, "createUppercaseE", function() { return /* reexport */ createUppercaseE; });
__webpack_require__.d(__webpack_exports__, "createFalse", function() { return /* reexport */ createFalse; });
__webpack_require__.d(__webpack_exports__, "createI", function() { return /* reexport */ createI; });
__webpack_require__.d(__webpack_exports__, "createInfinity", function() { return /* reexport */ createInfinity; });
__webpack_require__.d(__webpack_exports__, "createLN10", function() { return /* reexport */ createLN10; });
__webpack_require__.d(__webpack_exports__, "createLN2", function() { return /* reexport */ createLN2; });
__webpack_require__.d(__webpack_exports__, "createLOG10E", function() { return /* reexport */ createLOG10E; });
__webpack_require__.d(__webpack_exports__, "createLOG2E", function() { return /* reexport */ createLOG2E; });
__webpack_require__.d(__webpack_exports__, "createNaN", function() { return /* reexport */ createNaN; });
__webpack_require__.d(__webpack_exports__, "createNull", function() { return /* reexport */ createNull; });
__webpack_require__.d(__webpack_exports__, "createPhi", function() { return /* reexport */ createPhi; });
__webpack_require__.d(__webpack_exports__, "createPi", function() { return /* reexport */ createPi; });
__webpack_require__.d(__webpack_exports__, "createUppercasePi", function() { return /* reexport */ createUppercasePi; });
__webpack_require__.d(__webpack_exports__, "createSQRT1_2", function() { return /* reexport */ createSQRT1_2; });
__webpack_require__.d(__webpack_exports__, "createSQRT2", function() { return /* reexport */ createSQRT2; });
__webpack_require__.d(__webpack_exports__, "createTau", function() { return /* reexport */ createTau; });
__webpack_require__.d(__webpack_exports__, "createTrue", function() { return /* reexport */ createTrue; });
__webpack_require__.d(__webpack_exports__, "createVersion", function() { return /* reexport */ createVersion; });
__webpack_require__.d(__webpack_exports__, "createAtomicMass", function() { return /* reexport */ createAtomicMass; });
__webpack_require__.d(__webpack_exports__, "createAvogadro", function() { return /* reexport */ createAvogadro; });
__webpack_require__.d(__webpack_exports__, "createBohrMagneton", function() { return /* reexport */ createBohrMagneton; });
__webpack_require__.d(__webpack_exports__, "createBohrRadius", function() { return /* reexport */ createBohrRadius; });
__webpack_require__.d(__webpack_exports__, "createBoltzmann", function() { return /* reexport */ createBoltzmann; });
__webpack_require__.d(__webpack_exports__, "createClassicalElectronRadius", function() { return /* reexport */ createClassicalElectronRadius; });
__webpack_require__.d(__webpack_exports__, "createConductanceQuantum", function() { return /* reexport */ createConductanceQuantum; });
__webpack_require__.d(__webpack_exports__, "createCoulomb", function() { return /* reexport */ createCoulomb; });
__webpack_require__.d(__webpack_exports__, "createDeuteronMass", function() { return /* reexport */ createDeuteronMass; });
__webpack_require__.d(__webpack_exports__, "createEfimovFactor", function() { return /* reexport */ createEfimovFactor; });
__webpack_require__.d(__webpack_exports__, "createElectricConstant", function() { return /* reexport */ createElectricConstant; });
__webpack_require__.d(__webpack_exports__, "createElectronMass", function() { return /* reexport */ createElectronMass; });
__webpack_require__.d(__webpack_exports__, "createElementaryCharge", function() { return /* reexport */ createElementaryCharge; });
__webpack_require__.d(__webpack_exports__, "createFaraday", function() { return /* reexport */ createFaraday; });
__webpack_require__.d(__webpack_exports__, "createFermiCoupling", function() { return /* reexport */ createFermiCoupling; });
__webpack_require__.d(__webpack_exports__, "createFineStructure", function() { return /* reexport */ createFineStructure; });
__webpack_require__.d(__webpack_exports__, "createFirstRadiation", function() { return /* reexport */ createFirstRadiation; });
__webpack_require__.d(__webpack_exports__, "createGasConstant", function() { return /* reexport */ createGasConstant; });
__webpack_require__.d(__webpack_exports__, "createGravitationConstant", function() { return /* reexport */ createGravitationConstant; });
__webpack_require__.d(__webpack_exports__, "createGravity", function() { return /* reexport */ createGravity; });
__webpack_require__.d(__webpack_exports__, "createHartreeEnergy", function() { return /* reexport */ createHartreeEnergy; });
__webpack_require__.d(__webpack_exports__, "createInverseConductanceQuantum", function() { return /* reexport */ createInverseConductanceQuantum; });
__webpack_require__.d(__webpack_exports__, "createKlitzing", function() { return /* reexport */ createKlitzing; });
__webpack_require__.d(__webpack_exports__, "createLoschmidt", function() { return /* reexport */ createLoschmidt; });
__webpack_require__.d(__webpack_exports__, "createMagneticConstant", function() { return /* reexport */ createMagneticConstant; });
__webpack_require__.d(__webpack_exports__, "createMagneticFluxQuantum", function() { return /* reexport */ createMagneticFluxQuantum; });
__webpack_require__.d(__webpack_exports__, "createMolarMass", function() { return /* reexport */ createMolarMass; });
__webpack_require__.d(__webpack_exports__, "createMolarMassC12", function() { return /* reexport */ createMolarMassC12; });
__webpack_require__.d(__webpack_exports__, "createMolarPlanckConstant", function() { return /* reexport */ createMolarPlanckConstant; });
__webpack_require__.d(__webpack_exports__, "createMolarVolume", function() { return /* reexport */ createMolarVolume; });
__webpack_require__.d(__webpack_exports__, "createNeutronMass", function() { return /* reexport */ createNeutronMass; });
__webpack_require__.d(__webpack_exports__, "createNuclearMagneton", function() { return /* reexport */ createNuclearMagneton; });
__webpack_require__.d(__webpack_exports__, "createPlanckCharge", function() { return /* reexport */ createPlanckCharge; });
__webpack_require__.d(__webpack_exports__, "createPlanckConstant", function() { return /* reexport */ createPlanckConstant; });
__webpack_require__.d(__webpack_exports__, "createPlanckLength", function() { return /* reexport */ createPlanckLength; });
__webpack_require__.d(__webpack_exports__, "createPlanckMass", function() { return /* reexport */ createPlanckMass; });
__webpack_require__.d(__webpack_exports__, "createPlanckTemperature", function() { return /* reexport */ createPlanckTemperature; });
__webpack_require__.d(__webpack_exports__, "createPlanckTime", function() { return /* reexport */ createPlanckTime; });
__webpack_require__.d(__webpack_exports__, "createProtonMass", function() { return /* reexport */ createProtonMass; });
__webpack_require__.d(__webpack_exports__, "createQuantumOfCirculation", function() { return /* reexport */ createQuantumOfCirculation; });
__webpack_require__.d(__webpack_exports__, "createReducedPlanckConstant", function() { return /* reexport */ createReducedPlanckConstant; });
__webpack_require__.d(__webpack_exports__, "createRydberg", function() { return /* reexport */ createRydberg; });
__webpack_require__.d(__webpack_exports__, "createSackurTetrode", function() { return /* reexport */ createSackurTetrode; });
__webpack_require__.d(__webpack_exports__, "createSecondRadiation", function() { return /* reexport */ createSecondRadiation; });
__webpack_require__.d(__webpack_exports__, "createSpeedOfLight", function() { return /* reexport */ createSpeedOfLight; });
__webpack_require__.d(__webpack_exports__, "createStefanBoltzmann", function() { return /* reexport */ createStefanBoltzmann; });
__webpack_require__.d(__webpack_exports__, "createThomsonCrossSection", function() { return /* reexport */ createThomsonCrossSection; });
__webpack_require__.d(__webpack_exports__, "createVacuumImpedance", function() { return /* reexport */ createVacuumImpedance; });
__webpack_require__.d(__webpack_exports__, "createWeakMixingAngle", function() { return /* reexport */ createWeakMixingAngle; });
__webpack_require__.d(__webpack_exports__, "createWienDisplacement", function() { return /* reexport */ createWienDisplacement; });
__webpack_require__.d(__webpack_exports__, "createApplyTransform", function() { return /* reexport */ createApplyTransform; });
__webpack_require__.d(__webpack_exports__, "createColumnTransform", function() { return /* reexport */ createColumnTransform; });
__webpack_require__.d(__webpack_exports__, "createFilterTransform", function() { return /* reexport */ createFilterTransform; });
__webpack_require__.d(__webpack_exports__, "createForEachTransform", function() { return /* reexport */ createForEachTransform; });
__webpack_require__.d(__webpack_exports__, "createIndexTransform", function() { return /* reexport */ createIndexTransform; });
__webpack_require__.d(__webpack_exports__, "createMapTransform", function() { return /* reexport */ createMapTransform; });
__webpack_require__.d(__webpack_exports__, "createMaxTransform", function() { return /* reexport */ createMaxTransform; });
__webpack_require__.d(__webpack_exports__, "createMeanTransform", function() { return /* reexport */ createMeanTransform; });
__webpack_require__.d(__webpack_exports__, "createMinTransform", function() { return /* reexport */ createMinTransform; });
__webpack_require__.d(__webpack_exports__, "createRangeTransform", function() { return /* reexport */ createRangeTransform; });
__webpack_require__.d(__webpack_exports__, "createRowTransform", function() { return /* reexport */ createRowTransform; });
__webpack_require__.d(__webpack_exports__, "createSubsetTransform", function() { return /* reexport */ createSubsetTransform; });
__webpack_require__.d(__webpack_exports__, "createConcatTransform", function() { return /* reexport */ createConcatTransform; });
__webpack_require__.d(__webpack_exports__, "createStdTransform", function() { return /* reexport */ createStdTransform; });
__webpack_require__.d(__webpack_exports__, "createSumTransform", function() { return /* reexport */ createSumTransform; });
__webpack_require__.d(__webpack_exports__, "createVarianceTransform", function() { return /* reexport */ createVarianceTransform; });
// EXTERNAL MODULE: ./src/utils/is.js
var is = __webpack_require__(1);
// EXTERNAL MODULE: ./node_modules/typed-function/typed-function.js
var typed_function = __webpack_require__(13);
var typed_function_default = /*#__PURE__*/__webpack_require__.n(typed_function);
// EXTERNAL MODULE: ./src/utils/number.js
var utils_number = __webpack_require__(4);
// EXTERNAL MODULE: ./src/utils/factory.js
var factory = __webpack_require__(0);
// CONCATENATED MODULE: ./src/core/function/typed.js
/**
* Create a typed-function which checks the types of the arguments and
* can match them against multiple provided signatures. The typed-function
* automatically converts inputs in order to find a matching signature.
* Typed functions throw informative errors in case of wrong input arguments.
*
* See the library [typed-function](https://github.com/josdejong/typed-function)
* for detailed documentation.
*
* Syntax:
*
* math.typed(name, signatures) : function
* math.typed(signatures) : function
*
* Examples:
*
* // create a typed function with multiple types per argument (type union)
* const fn2 = typed({
* 'number | boolean': function (b) {
* return 'b is a number or boolean'
* },
* 'string, number | boolean': function (a, b) {
* return 'a is a string, b is a number or boolean'
* }
* })
*
* // create a typed function with an any type argument
* const log = typed({
* 'string, any': function (event, data) {
* console.log('event: ' + event + ', data: ' + JSON.stringify(data))
* }
* })
*
* @param {string} [name] Optional name for the typed-function
* @param {Object<string, function>} signatures Object with one or multiple function signatures
* @returns {function} The created typed-function.
*/
// returns a new instance of typed-function
var _createTyped2 = function _createTyped() {
// initially, return the original instance of typed-function
// consecutively, return a new instance from typed.create.
_createTyped2 = typed_function_default.a.create;
return typed_function_default.a;
};
var typed_dependencies = ['?BigNumber', '?Complex', '?DenseMatrix', '?Fraction'];
/**
* Factory function for creating a new typed instance
* @param {Object} dependencies Object with data types like Complex and BigNumber
* @returns {Function}
*/
var typed_createTyped = /* #__PURE__ */Object(factory["a" /* factory */])('typed', typed_dependencies, function createTyped(_ref) {
var BigNumber = _ref.BigNumber,
Complex = _ref.Complex,
DenseMatrix = _ref.DenseMatrix,
Fraction = _ref.Fraction;
// TODO: typed-function must be able to silently ignore signatures with unknown data types
// get a new instance of typed-function
var typed = _createTyped2(); // define all types. The order of the types determines in which order function
// arguments are type-checked (so for performance it's important to put the
// most used types first).
typed.types = [{
name: 'number',
test: is["y" /* isNumber */]
}, {
name: 'Complex',
test: is["j" /* isComplex */]
}, {
name: 'BigNumber',
test: is["e" /* isBigNumber */]
}, {
name: 'Fraction',
test: is["o" /* isFraction */]
}, {
name: 'Unit',
test: is["L" /* isUnit */]
}, {
name: 'string',
test: is["I" /* isString */]
}, {
name: 'Chain',
test: is["h" /* isChain */]
}, {
name: 'Array',
test: is["b" /* isArray */]
}, {
name: 'Matrix',
test: is["v" /* isMatrix */]
}, {
name: 'DenseMatrix',
test: is["n" /* isDenseMatrix */]
}, {
name: 'SparseMatrix',
test: is["H" /* isSparseMatrix */]
}, {
name: 'Range',
test: is["D" /* isRange */]
}, {
name: 'Index',
test: is["t" /* isIndex */]
}, {
name: 'boolean',
test: is["g" /* isBoolean */]
}, {
name: 'ResultSet',
test: is["G" /* isResultSet */]
}, {
name: 'Help',
test: is["s" /* isHelp */]
}, {
name: 'function',
test: is["p" /* isFunction */]
}, {
name: 'Date',
test: is["m" /* isDate */]
}, {
name: 'RegExp',
test: is["F" /* isRegExp */]
}, {
name: 'null',
test: is["x" /* isNull */]
}, {
name: 'undefined',
test: is["K" /* isUndefined */]
}, {
name: 'AccessorNode',
test: is["a" /* isAccessorNode */]
}, {
name: 'ArrayNode',
test: is["c" /* isArrayNode */]
}, {
name: 'AssignmentNode',
test: is["d" /* isAssignmentNode */]
}, {
name: 'BlockNode',
test: is["f" /* isBlockNode */]
}, {
name: 'ConditionalNode',
test: is["k" /* isConditionalNode */]
}, {
name: 'ConstantNode',
test: is["l" /* isConstantNode */]
}, {
name: 'FunctionNode',
test: is["r" /* isFunctionNode */]
}, {
name: 'FunctionAssignmentNode',
test: is["q" /* isFunctionAssignmentNode */]
}, {
name: 'IndexNode',
test: is["u" /* isIndexNode */]
}, {
name: 'Node',
test: is["w" /* isNode */]
}, {
name: 'ObjectNode',
test: is["A" /* isObjectNode */]
}, {
name: 'OperatorNode',
test: is["B" /* isOperatorNode */]
}, {
name: 'ParenthesisNode',
test: is["C" /* isParenthesisNode */]
}, {
name: 'RangeNode',
test: is["E" /* isRangeNode */]
}, {
name: 'SymbolNode',
test: is["J" /* isSymbolNode */]
}, {
name: 'Object',
test: is["z" /* isObject */]
} // order 'Object' last, it matches on other classes too
];
typed.conversions = [{
from: 'number',
to: 'BigNumber',
convert: function convert(x) {
if (!BigNumber) {
throwNoBignumber(x);
} // note: conversion from number to BigNumber can fail if x has >15 digits
if (Object(utils_number["f" /* digits */])(x) > 15) {
throw new TypeError('Cannot implicitly convert a number with >15 significant digits to BigNumber ' + '(value: ' + x + '). ' + 'Use function bignumber(x) to convert to BigNumber.');
}
return new BigNumber(x);
}
}, {
from: 'number',
to: 'Complex',
convert: function convert(x) {
if (!Complex) {
throwNoComplex(x);
}
return new Complex(x, 0);
}
}, {
from: 'number',
to: 'string',
convert: function convert(x) {
return x + '';
}
}, {
from: 'BigNumber',
to: 'Complex',
convert: function convert(x) {
if (!Complex) {
throwNoComplex(x);
}
return new Complex(x.toNumber(), 0);
}
}, {
from: 'Fraction',
to: 'BigNumber',
convert: function convert(x) {
throw new TypeError('Cannot implicitly convert a Fraction to BigNumber or vice versa. ' + 'Use function bignumber(x) to convert to BigNumber or fraction(x) to convert to Fraction.');
}
}, {
from: 'Fraction',
to: 'Complex',
convert: function convert(x) {
if (!Complex) {
throwNoComplex(x);
}
return new Complex(x.valueOf(), 0);
}
}, {
from: 'number',
to: 'Fraction',
convert: function convert(x) {
if (!Fraction) {
throwNoFraction(x);
}
var f = new Fraction(x);
if (f.valueOf() !== x) {
throw new TypeError('Cannot implicitly convert a number to a Fraction when there will be a loss of precision ' + '(value: ' + x + '). ' + 'Use function fraction(x) to convert to Fraction.');
}
return f;
}
}, {
// FIXME: add conversion from Fraction to number, for example for `sqrt(fraction(1,3))`
// from: 'Fraction',
// to: 'number',
// convert: function (x) {
// return x.valueOf()
// }
// }, {
from: 'string',
to: 'number',
convert: function convert(x) {
var n = Number(x);
if (isNaN(n)) {
throw new Error('Cannot convert "' + x + '" to a number');
}
return n;
}
}, {
from: 'string',
to: 'BigNumber',
convert: function convert(x) {
if (!BigNumber) {
throwNoBignumber(x);
}
try {
return new BigNumber(x);
} catch (err) {
throw new Error('Cannot convert "' + x + '" to BigNumber');
}
}
}, {
from: 'string',
to: 'Fraction',
convert: function convert(x) {
if (!Fraction) {
throwNoFraction(x);
}
try {
return new Fraction(x);
} catch (err) {
throw new Error('Cannot convert "' + x + '" to Fraction');
}
}
}, {
from: 'string',
to: 'Complex',
convert: function convert(x) {
if (!Complex) {
throwNoComplex(x);
}
try {
return new Complex(x);
} catch (err) {
throw new Error('Cannot convert "' + x + '" to Complex');
}
}
}, {
from: 'boolean',
to: 'number',
convert: function convert(x) {
return +x;
}
}, {
from: 'boolean',
to: 'BigNumber',
convert: function convert(x) {
if (!BigNumber) {
throwNoBignumber(x);
}
return new BigNumber(+x);
}
}, {
from: 'boolean',
to: 'Fraction',
convert: function convert(x) {
if (!Fraction) {
throwNoFraction(x);
}
return new Fraction(+x);
}
}, {
from: 'boolean',
to: 'string',
convert: function convert(x) {
return String(x);
}
}, {
from: 'Array',
to: 'Matrix',
convert: function convert(array) {
if (!DenseMatrix) {
throwNoMatrix();
}
return new DenseMatrix(array);
}
}, {
from: 'Matrix',
to: 'Array',
convert: function convert(matrix) {
return matrix.valueOf();
}
}];
return typed;
});
function throwNoBignumber(x) {
throw new Error("Cannot convert value ".concat(x, " into a BigNumber: no class 'BigNumber' provided"));
}
function throwNoComplex(x) {
throw new Error("Cannot convert value ".concat(x, " into a Complex number: no class 'Complex' provided"));
}
function throwNoMatrix() {
throw new Error('Cannot convert array into a Matrix: no class \'DenseMatrix\' provided');
}
function throwNoFraction(x) {
throw new Error("Cannot convert value ".concat(x, " into a Fraction, no class 'Fraction' provided."));
}
// CONCATENATED MODULE: ./src/type/resultset/ResultSet.js
var ResultSet_name = 'ResultSet';
var ResultSet_dependencies = [];
var createResultSet = /* #__PURE__ */Object(factory["a" /* factory */])(ResultSet_name, ResultSet_dependencies, function () {
/**
* A ResultSet contains a list or results
* @class ResultSet
* @param {Array} entries
* @constructor ResultSet
*/
function ResultSet(entries) {
if (!(this instanceof ResultSet)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
this.entries = entries || [];
}
/**
* Attach type information
*/
ResultSet.prototype.type = 'ResultSet';
ResultSet.prototype.isResultSet = true;
/**
* Returns the array with results hold by this ResultSet
* @memberof ResultSet
* @returns {Array} entries
*/
ResultSet.prototype.valueOf = function () {
return this.entries;
};
/**
* Returns the stringified results of the ResultSet
* @memberof ResultSet
* @returns {string} string
*/
ResultSet.prototype.toString = function () {
return '[' + this.entries.join(', ') + ']';
};
/**
* Get a JSON representation of the ResultSet
* @memberof ResultSet
* @returns {Object} Returns a JSON object structured as:
* `{"mathjs": "ResultSet", "entries": [...]}`
*/
ResultSet.prototype.toJSON = function () {
return {
mathjs: 'ResultSet',
entries: this.entries
};
};
/**
* Instantiate a ResultSet from a JSON object
* @memberof ResultSet
* @param {Object} json A JSON object structured as:
* `{"mathjs": "ResultSet", "entries": [...]}`
* @return {ResultSet}
*/
ResultSet.fromJSON = function (json) {
return new ResultSet(json.entries);
};
return ResultSet;
}, {
isClass: true
});
// EXTERNAL MODULE: ./node_modules/decimal.js/decimal.js
var decimal = __webpack_require__(15);
var decimal_default = /*#__PURE__*/__webpack_require__.n(decimal);
// CONCATENATED MODULE: ./src/type/bignumber/BigNumber.js
var BigNumber_name = 'BigNumber';
var BigNumber_dependencies = ['?on', 'config'];
var createBigNumberClass = /* #__PURE__ */Object(factory["a" /* factory */])(BigNumber_name, BigNumber_dependencies, function (_ref) {
var on = _ref.on,
config = _ref.config;
var BigNumber = decimal_default.a.clone({
precision: config.precision
});
/**
* Attach type information
*/
BigNumber.prototype.type = 'BigNumber';
BigNumber.prototype.isBigNumber = true;
/**
* Get a JSON representation of a BigNumber containing
* type information
* @returns {Object} Returns a JSON object structured as:
* `{"mathjs": "BigNumber", "value": "0.2"}`
*/
BigNumber.prototype.toJSON = function () {
return {
mathjs: 'BigNumber',
value: this.toString()
};
};
/**
* Instantiate a BigNumber from a JSON object
* @param {Object} json a JSON object structured as:
* `{"mathjs": "BigNumber", "value": "0.2"}`
* @return {BigNumber}
*/
BigNumber.fromJSON = function (json) {
return new BigNumber(json.value);
};
if (on) {
// listen for changed in the configuration, automatically apply changed precision
on('config', function (curr, prev) {
if (curr.precision !== prev.precision) {
BigNumber.config({
precision: curr.precision
});
}
});
}
return BigNumber;
}, {
isClass: true
});
// EXTERNAL MODULE: ./node_modules/complex.js/complex.js
var complex_js_complex = __webpack_require__(8);
var complex_default = /*#__PURE__*/__webpack_require__.n(complex_js_complex);
// CONCATENATED MODULE: ./src/type/complex/Complex.js
function _typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
var Complex_name = 'Complex';
var Complex_dependencies = [];
var createComplexClass = /* #__PURE__ */Object(factory["a" /* factory */])(Complex_name, Complex_dependencies, function () {
/**
* Attach type information
*/
complex_default.a.prototype.type = 'Complex';
complex_default.a.prototype.isComplex = true;
/**
* Get a JSON representation of the complex number
* @returns {Object} Returns a JSON object structured as:
* `{"mathjs": "Complex", "re": 2, "im": 3}`
*/
complex_default.a.prototype.toJSON = function () {
return {
mathjs: 'Complex',
re: this.re,
im: this.im
};
};
/*
* Return the value of the complex number in polar notation
* The angle phi will be set in the interval of [-pi, pi].
* @return {{r: number, phi: number}} Returns and object with properties r and phi.
*/
complex_default.a.prototype.toPolar = function () {
return {
r: this.abs(),
phi: this.arg()
};
};
/**
* Get a string representation of the complex number,
* with optional formatting options.
* @param {Object | number | Function} [options] Formatting options. See
* lib/utils/number:format for a
* description of the available
* options.
* @return {string} str
*/
complex_default.a.prototype.format = function (options) {
var str = '';
var im = this.im;
var re = this.re;
var strRe = Object(utils_number["h" /* format */])(this.re, options);
var strIm = Object(utils_number["h" /* format */])(this.im, options); // round either re or im when smaller than the configured precision
var precision = Object(is["y" /* isNumber */])(options) ? options : options ? options.precision : null;
if (precision !== null) {
var epsilon = Math.pow(10, -precision);
if (Math.abs(re / im) < epsilon) {
re = 0;
}
if (Math.abs(im / re) < epsilon) {
im = 0;
}
}
if (im === 0) {
// real value
str = strRe;
} else if (re === 0) {
// purely complex value
if (im === 1) {
str = 'i';
} else if (im === -1) {
str = '-i';
} else {
str = strIm + 'i';
}
} else {
// complex value
if (im < 0) {
if (im === -1) {
str = strRe + ' - i';
} else {
str = strRe + ' - ' + strIm.substring(1) + 'i';
}
} else {
if (im === 1) {
str = strRe + ' + i';
} else {
str = strRe + ' + ' + strIm + 'i';
}
}
}
return str;
};
/**
* Create a complex number from polar coordinates
*
* Usage:
*
* Complex.fromPolar(r: number, phi: number) : Complex
* Complex.fromPolar({r: number, phi: number}) : Complex
*
* @param {*} args...
* @return {Complex}
*/
complex_default.a.fromPolar = function (args) {
switch (arguments.length) {
case 1:
{
var arg = arguments[0];
if (_typeof(arg) === 'object') {
return complex_default()(arg);
} else {
throw new TypeError('Input has to be an object with r and phi keys.');
}
}
case 2:
{
var r = arguments[0];
var phi = arguments[1];
if (Object(is["y" /* isNumber */])(r)) {
if (Object(is["L" /* isUnit */])(phi) && phi.hasBase('ANGLE')) {
// convert unit to a number in radians
phi = phi.toNumber('rad');
}
if (Object(is["y" /* isNumber */])(phi)) {
return new complex_default.a({
r: r,
phi: phi
});
}
throw new TypeError('Phi is not a number nor an angle unit.');
} else {
throw new TypeError('Radius r is not a number.');
}
}
default:
throw new SyntaxError('Wrong number of arguments in function fromPolar');
}
};
complex_default.a.prototype.valueOf = complex_default.a.prototype.toString;
/**
* Create a Complex number from a JSON object
* @param {Object} json A JSON Object structured as
* {"mathjs": "Complex", "re": 2, "im": 3}
* All properties are optional, default values
* for `re` and `im` are 0.
* @return {Complex} Returns a new Complex number
*/
complex_default.a.fromJSON = function (json) {
return new complex_default.a(json);
};
/**
* Compare two complex numbers, `a` and `b`:
*
* - Returns 1 when the real part of `a` is larger than the real part of `b`
* - Returns -1 when the real part of `a` is smaller than the real part of `b`
* - Returns 1 when the real parts are equal
* and the imaginary part of `a` is larger than the imaginary part of `b`
* - Returns -1 when the real parts are equal
* and the imaginary part of `a` is smaller than the imaginary part of `b`
* - Returns 0 when both real and imaginary parts are equal.
*
* @params {Complex} a
* @params {Complex} b
* @returns {number} Returns the comparison result: -1, 0, or 1
*/
complex_default.a.compare = function (a, b) {
if (a.re > b.re) {
return 1;
}
if (a.re < b.re) {
return -1;
}
if (a.im > b.im) {
return 1;
}
if (a.im < b.im) {
return -1;
}
return 0;
};
return complex_default.a;
}, {
isClass: true
});
// EXTERNAL MODULE: ./node_modules/fraction.js/fraction.js
var fraction_js_fraction = __webpack_require__(10);
var fraction_default = /*#__PURE__*/__webpack_require__.n(fraction_js_fraction);
// CONCATENATED MODULE: ./src/type/fraction/Fraction.js
var Fraction_name = 'Fraction';
var Fraction_dependencies = [];
var createFractionClass = /* #__PURE__ */Object(factory["a" /* factory */])(Fraction_name, Fraction_dependencies, function () {
/**
* Attach type information
*/
fraction_default.a.prototype.type = 'Fraction';
fraction_default.a.prototype.isFraction = true;
/**
* Get a JSON representation of a Fraction containing type information
* @returns {Object} Returns a JSON object structured as:
* `{"mathjs": "Fraction", "n": 3, "d": 8}`
*/
fraction_default.a.prototype.toJSON = function () {
return {
mathjs: 'Fraction',
n: this.s * this.n,
d: this.d
};
};
/**
* Instantiate a Fraction from a JSON object
* @param {Object} json a JSON object structured as:
* `{"mathjs": "Fraction", "n": 3, "d": 8}`
* @return {BigNumber}
*/
fraction_default.a.fromJSON = function (json) {
return new fraction_default.a(json);
};
return fraction_default.a;
}, {
isClass: true
});
// CONCATENATED MODULE: ./src/type/matrix/Range.js
var Range_name = 'Range';
var Range_dependencies = [];
var createRangeClass = /* #__PURE__ */Object(factory["a" /* factory */])(Range_name, Range_dependencies, function () {
/**
* Create a range. A range has a start, step, and end, and contains functions
* to iterate over the range.
*
* A range can be constructed as:
*
* const range = new Range(start, end)
* const range = new Range(start, end, step)
*
* To get the result of the range:
* range.forEach(function (x) {
* console.log(x)
* })
* range.map(function (x) {
* return math.sin(x)
* })
* range.toArray()
*
* Example usage:
*
* const c = new Range(2, 6) // 2:1:5
* c.toArray() // [2, 3, 4, 5]
* const d = new Range(2, -3, -1) // 2:-1:-2
* d.toArray() // [2, 1, 0, -1, -2]
*
* @class Range
* @constructor Range
* @param {number} start included lower bound
* @param {number} end excluded upper bound
* @param {number} [step] step size, default value is 1
*/
function Range(start, end, step) {
if (!(this instanceof Range)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
var hasStart = start !== null && start !== undefined;
var hasEnd = end !== null && end !== undefined;
var hasStep = step !== null && step !== undefined;
if (hasStart) {
if (Object(is["e" /* isBigNumber */])(start)) {
start = start.toNumber();
} else if (typeof start !== 'number') {
throw new TypeError('Parameter start must be a number');
}
}
if (hasEnd) {
if (Object(is["e" /* isBigNumber */])(end)) {
end = end.toNumber();
} else if (typeof end !== 'number') {
throw new TypeError('Parameter end must be a number');
}
}
if (hasStep) {
if (Object(is["e" /* isBigNumber */])(step)) {
step = step.toNumber();
} else if (typeof step !== 'number') {
throw new TypeError('Parameter step must be a number');
}
}
this.start = hasStart ? parseFloat(start) : 0;
this.end = hasEnd ? parseFloat(end) : 0;
this.step = hasStep ? parseFloat(step) : 1;
}
/**
* Attach type information
*/
Range.prototype.type = 'Range';
Range.prototype.isRange = true;
/**
* Parse a string into a range,
* The string contains the start, optional step, and end, separated by a colon.
* If the string does not contain a valid range, null is returned.
* For example str='0:2:11'.
* @memberof Range
* @param {string} str
* @return {Range | null} range
*/
Range.parse = function (str) {
if (typeof str !== 'string') {
return null;
}
var args = str.split(':');
var nums = args.map(function (arg) {
return parseFloat(arg);
});
var invalid = nums.some(function (num) {
return isNaN(num);
});
if (invalid) {
return null;
}
switch (nums.length) {
case 2:
return new Range(nums[0], nums[1]);
case 3:
return new Range(nums[0], nums[2], nums[1]);
default:
return null;
}
};
/**
* Create a clone of the range
* @return {Range} clone
*/
Range.prototype.clone = function () {
return new Range(this.start, this.end, this.step);
};
/**
* Retrieve the size of the range.
* Returns an array containing one number, the number of elements in the range.
* @memberof Range
* @returns {number[]} size
*/
Range.prototype.size = function () {
var len = 0;
var start = this.start;
var step = this.step;
var end = this.end;
var diff = end - start;
if (Object(utils_number["n" /* sign */])(step) === Object(utils_number["n" /* sign */])(diff)) {
len = Math.ceil(diff / step);
} else if (diff === 0) {
len = 0;
}
if (isNaN(len)) {
len = 0;
}
return [len];
};
/**
* Calculate the minimum value in the range
* @memberof Range
* @return {number | undefined} min
*/
Range.prototype.min = function () {
var size = this.size()[0];
if (size > 0) {
if (this.step > 0) {
// positive step
return this.start;
} else {
// negative step
return this.start + (size - 1) * this.step;
}
} else {
return undefined;
}
};
/**
* Calculate the maximum value in the range
* @memberof Range
* @return {number | undefined} max
*/
Range.prototype.max = function () {
var size = this.size()[0];
if (size > 0) {
if (this.step > 0) {
// positive step
return this.start + (size - 1) * this.step;
} else {
// negative step
return this.start;
}
} else {
return undefined;
}
};
/**
* Execute a callback function for each value in the range.
* @memberof Range
* @param {function} callback The callback method is invoked with three
* parameters: the value of the element, the index
* of the element, and the Range being traversed.
*/
Range.prototype.forEach = function (callback) {
var x = this.start;
var step = this.step;
var end = this.end;
var i = 0;
if (step > 0) {
while (x < end) {
callback(x, [i], this);
x += step;
i++;
}
} else if (step < 0) {
while (x > end) {
callback(x, [i], this);
x += step;
i++;
}
}
};
/**
* Execute a callback function for each value in the Range, and return the
* results as an array
* @memberof Range
* @param {function} callback The callback method is invoked with three
* parameters: the value of the element, the index
* of the element, and the Matrix being traversed.
* @returns {Array} array
*/
Range.prototype.map = function (callback) {
var array = [];
this.forEach(function (value, index, obj) {
array[index[0]] = callback(value, index, obj);
});
return array;
};
/**
* Create an Array with a copy of the Ranges data
* @memberof Range
* @returns {Array} array
*/
Range.prototype.toArray = function () {
var array = [];
this.forEach(function (value, index) {
array[index[0]] = value;
});
return array;
};
/**
* Get the primitive value of the Range, a one dimensional array
* @memberof Range
* @returns {Array} array
*/
Range.prototype.valueOf = function () {
// TODO: implement a caching mechanism for range.valueOf()
return this.toArray();
};
/**
* Get a string representation of the range, with optional formatting options.
* Output is formatted as 'start:step:end', for example '2:6' or '0:0.2:11'
* @memberof Range
* @param {Object | number | function} [options] Formatting options. See
* lib/utils/number:format for a
* description of the available
* options.
* @returns {string} str
*/
Range.prototype.format = function (options) {
var str = Object(utils_number["h" /* format */])(this.start, options);
if (this.step !== 1) {
str += ':' + Object(utils_number["h" /* format */])(this.step, options);
}
str += ':' + Object(utils_number["h" /* format */])(this.end, options);
return str;
};
/**
* Get a string representation of the range.
* @memberof Range
* @returns {string}
*/
Range.prototype.toString = function () {
return this.format();
};
/**
* Get a JSON representation of the range
* @memberof Range
* @returns {Object} Returns a JSON object structured as:
* `{"mathjs": "Range", "start": 2, "end": 4, "step": 1}`
*/
Range.prototype.toJSON = function () {
return {
mathjs: 'Range',
start: this.start,
end: this.end,
step: this.step
};
};
/**
* Instantiate a Range from a JSON object
* @memberof Range
* @param {Object} json A JSON object structured as:
* `{"mathjs": "Range", "start": 2, "end": 4, "step": 1}`
* @return {Range}
*/
Range.fromJSON = function (json) {
return new Range(json.start, json.end, json.step);
};
return Range;
}, {
isClass: true
});
// CONCATENATED MODULE: ./src/type/matrix/Matrix.js
var Matrix_name = 'Matrix';
var Matrix_dependencies = [];
var createMatrixClass = /* #__PURE__ */Object(factory["a" /* factory */])(Matrix_name, Matrix_dependencies, function () {
/**
* @constructor Matrix
*
* A Matrix is a wrapper around an Array. A matrix can hold a multi dimensional
* array. A matrix can be constructed as:
*
* let matrix = math.matrix(data)
*
* Matrix contains the functions to resize, get and set values, get the size,
* clone the matrix and to convert the matrix to a vector, array, or scalar.
* Furthermore, one can iterate over the matrix using map and forEach.
* The internal Array of the Matrix can be accessed using the function valueOf.
*
* Example usage:
*
* let matrix = math.matrix([[1, 2], [3, 4]])
* matix.size() // [2, 2]
* matrix.resize([3, 2], 5)
* matrix.valueOf() // [[1, 2], [3, 4], [5, 5]]
* matrix.subset([1,2]) // 3 (indexes are zero-based)
*
*/
function Matrix() {
if (!(this instanceof Matrix)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
}
/**
* Attach type information
*/
Matrix.prototype.type = 'Matrix';
Matrix.prototype.isMatrix = true;
/**
* Get the storage format used by the matrix.
*
* Usage:
* const format = matrix.storage() // retrieve storage format
*
* @return {string} The storage format.
*/
Matrix.prototype.storage = function () {
// must be implemented by each of the Matrix implementations
throw new Error('Cannot invoke storage on a Matrix interface');
};
/**
* Get the datatype of the data stored in the matrix.
*
* Usage:
* const format = matrix.datatype() // retrieve matrix datatype
*
* @return {string} The datatype.
*/
Matrix.prototype.datatype = function () {
// must be implemented by each of the Matrix implementations
throw new Error('Cannot invoke datatype on a Matrix interface');
};
/**
* Create a new Matrix With the type of the current matrix instance
* @param {Array | Object} data
* @param {string} [datatype]
*/
Matrix.prototype.create = function (data, datatype) {
throw new Error('Cannot invoke create on a Matrix interface');
};
/**
* Get a subset of the matrix, or replace a subset of the matrix.
*
* Usage:
* const subset = matrix.subset(index) // retrieve subset
* const value = matrix.subset(index, replacement) // replace subset
*
* @param {Index} index
* @param {Array | Matrix | *} [replacement]
* @param {*} [defaultValue=0] Default value, filled in on new entries when
* the matrix is resized. If not provided,
* new matrix elements will be filled with zeros.
*/
Matrix.prototype.subset = function (index, replacement, defaultValue) {
// must be implemented by each of the Matrix implementations
throw new Error('Cannot invoke subset on a Matrix interface');
};
/**
* Get a single element from the matrix.
* @param {number[]} index Zero-based index
* @return {*} value
*/
Matrix.prototype.get = function (index) {
// must be implemented by each of the Matrix implementations
throw new Error('Cannot invoke get on a Matrix interface');
};
/**
* Replace a single element in the matrix.
* @param {number[]} index Zero-based index
* @param {*} value
* @param {*} [defaultValue] Default value, filled in on new entries when
* the matrix is resized. If not provided,
* new matrix elements will be left undefined.
* @return {Matrix} self
*/
Matrix.prototype.set = function (index, value, defaultValue) {
// must be implemented by each of the Matrix implementations
throw new Error('Cannot invoke set on a Matrix interface');
};
/**
* Resize the matrix to the given size. Returns a copy of the matrix when
* `copy=true`, otherwise return the matrix itself (resize in place).
*
* @param {number[]} size The new size the matrix should have.
* @param {*} [defaultValue=0] Default value, filled in on new entries.
* If not provided, the matrix elements will
* be filled with zeros.
* @param {boolean} [copy] Return a resized copy of the matrix
*
* @return {Matrix} The resized matrix
*/
Matrix.prototype.resize = function (size, defaultValue) {
// must be implemented by each of the Matrix implementations
throw new Error('Cannot invoke resize on a Matrix interface');
};
/**
* Reshape the matrix to the given size. Returns a copy of the matrix when
* `copy=true`, otherwise return the matrix itself (reshape in place).
*
* @param {number[]} size The new size the matrix should have.
* @param {boolean} [copy] Return a reshaped copy of the matrix
*
* @return {Matrix} The reshaped matrix
*/
Matrix.prototype.reshape = function (size, defaultValue) {
// must be implemented by each of the Matrix implementations
throw new Error('Cannot invoke reshape on a Matrix interface');
};
/**
* Create a clone of the matrix
* @return {Matrix} clone
*/
Matrix.prototype.clone = function () {
// must be implemented by each of the Matrix implementations
throw new Error('Cannot invoke clone on a Matrix interface');
};
/**
* Retrieve the size of the matrix.
* @returns {number[]} size
*/
Matrix.prototype.size = function () {
// must be implemented by each of the Matrix implementations
throw new Error('Cannot invoke size on a Matrix interface');
};
/**
* Create a new matrix with the results of the callback function executed on
* each entry of the matrix.
* @param {Function} callback The callback function is invoked with three
* parameters: the value of the element, the index
* of the element, and the Matrix being traversed.
* @param {boolean} [skipZeros] Invoke callback function for non-zero values only.
*
* @return {Matrix} matrix
*/
Matrix.prototype.map = function (callback, skipZeros) {
// must be implemented by each of the Matrix implementations
throw new Error('Cannot invoke map on a Matrix interface');
};
/**
* Execute a callback function on each entry of the matrix.
* @param {Function} callback The callback function is invoked with three
* parameters: the value of the element, the index
* of the element, and the Matrix being traversed.
*/
Matrix.prototype.forEach = function (callback) {
// must be implemented by each of the Matrix implementations
throw new Error('Cannot invoke forEach on a Matrix interface');
};
/**
* Create an Array with a copy of the data of the Matrix
* @returns {Array} array
*/
Matrix.prototype.toArray = function () {
// must be implemented by each of the Matrix implementations
throw new Error('Cannot invoke toArray on a Matrix interface');
};
/**
* Get the primitive value of the Matrix: a multidimensional array
* @returns {Array} array
*/
Matrix.prototype.valueOf = function () {
// must be implemented by each of the Matrix implementations
throw new Error('Cannot invoke valueOf on a Matrix interface');
};
/**
* Get a string representation of the matrix, with optional formatting options.
* @param {Object | number | Function} [options] Formatting options. See
* lib/utils/number:format for a
* description of the available
* options.
* @returns {string} str
*/
Matrix.prototype.format = function (options) {
// must be implemented by each of the Matrix implementations
throw new Error('Cannot invoke format on a Matrix interface');
};
/**
* Get a string representation of the matrix
* @returns {string} str
*/
Matrix.prototype.toString = function () {
// must be implemented by each of the Matrix implementations
throw new Error('Cannot invoke toString on a Matrix interface');
};
return Matrix;
}, {
isClass: true
});
// EXTERNAL MODULE: ./src/utils/array.js
var utils_array = __webpack_require__(2);
// EXTERNAL MODULE: ./src/utils/string.js + 1 modules
var utils_string = __webpack_require__(5);
// EXTERNAL MODULE: ./src/utils/object.js
var utils_object = __webpack_require__(3);
// EXTERNAL MODULE: ./src/error/DimensionError.js
var DimensionError = __webpack_require__(6);
// CONCATENATED MODULE: ./src/type/matrix/DenseMatrix.js
var DenseMatrix_name = 'DenseMatrix';
var DenseMatrix_dependencies = ['Matrix'];
var createDenseMatrixClass = /* #__PURE__ */Object(factory["a" /* factory */])(DenseMatrix_name, DenseMatrix_dependencies, function (_ref) {
var Matrix = _ref.Matrix;
/**
* Dense Matrix implementation. A regular, dense matrix, supporting multi-dimensional matrices. This is the default matrix type.
* @class DenseMatrix
*/
function DenseMatrix(data, datatype) {
if (!(this instanceof DenseMatrix)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
if (datatype && !Object(is["I" /* isString */])(datatype)) {
throw new Error('Invalid datatype: ' + datatype);
}
if (Object(is["v" /* isMatrix */])(data)) {
// check data is a DenseMatrix
if (data.type === 'DenseMatrix') {
// clone data & size
this._data = Object(utils_object["a" /* clone */])(data._data);
this._size = Object(utils_object["a" /* clone */])(data._size);
this._datatype = datatype || data._datatype;
} else {
// build data from existing matrix
this._data = data.toArray();
this._size = data.size();
this._datatype = datatype || data._datatype;
}
} else if (data && Object(is["b" /* isArray */])(data.data) && Object(is["b" /* isArray */])(data.size)) {
// initialize fields from JSON representation
this._data = data.data;
this._size = data.size; // verify the dimensions of the array
Object(utils_array["p" /* validate */])(this._data, this._size);
this._datatype = datatype || data.datatype;
} else if (Object(is["b" /* isArray */])(data)) {
// replace nested Matrices with Arrays
this._data = preprocess(data); // get the dimensions of the array
this._size = Object(utils_array["a" /* arraySize */])(this._data); // verify the dimensions of the array, TODO: compute size while processing array
Object(utils_array["p" /* validate */])(this._data, this._size); // data type unknown
this._datatype = datatype;
} else if (data) {
// unsupported type
throw new TypeError('Unsupported type of data (' + Object(is["M" /* typeOf */])(data) + ')');
} else {
// nothing provided
this._data = [];
this._size = [0];
this._datatype = datatype;
}
}
DenseMatrix.prototype = new Matrix();
/**
* Create a new DenseMatrix
*/
DenseMatrix.prototype.createDenseMatrix = function (data, datatype) {
return new DenseMatrix(data, datatype);
};
/**
* Attach type information
*/
DenseMatrix.prototype.type = 'DenseMatrix';
DenseMatrix.prototype.isDenseMatrix = true;
/**
* Get the matrix type
*
* Usage:
* const matrixType = matrix.getDataType() // retrieves the matrix type
*
* @memberOf DenseMatrix
* @return {string} type information; if multiple types are found from the Matrix, it will return "mixed"
*/
DenseMatrix.prototype.getDataType = function () {
return Object(utils_array["h" /* getArrayDataType */])(this._data, is["M" /* typeOf */]);
};
/**
* Get the storage format used by the matrix.
*
* Usage:
* const format = matrix.storage() // retrieve storage format
*
* @memberof DenseMatrix
* @return {string} The storage format.
*/
DenseMatrix.prototype.storage = function () {
return 'dense';
};
/**
* Get the datatype of the data stored in the matrix.
*
* Usage:
* const format = matrix.datatype() // retrieve matrix datatype
*
* @memberof DenseMatrix
* @return {string} The datatype.
*/
DenseMatrix.prototype.datatype = function () {
return this._datatype;
};
/**
* Create a new DenseMatrix
* @memberof DenseMatrix
* @param {Array} data
* @param {string} [datatype]
*/
DenseMatrix.prototype.create = function (data, datatype) {
return new DenseMatrix(data, datatype);
};
/**
* Get a subset of the matrix, or replace a subset of the matrix.
*
* Usage:
* const subset = matrix.subset(index) // retrieve subset
* const value = matrix.subset(index, replacement) // replace subset
*
* @memberof DenseMatrix
* @param {Index} index
* @param {Array | Matrix | *} [replacement]
* @param {*} [defaultValue=0] Default value, filled in on new entries when
* the matrix is resized. If not provided,
* new matrix elements will be filled with zeros.
*/
DenseMatrix.prototype.subset = function (index, replacement, defaultValue) {
switch (arguments.length) {
case 1:
return _get(this, index);
// intentional fall through
case 2:
case 3:
return _set(this, index, replacement, defaultValue);
default:
throw new SyntaxError('Wrong number of arguments');
}
};
/**
* Get a single element from the matrix.
* @memberof DenseMatrix
* @param {number[]} index Zero-based index
* @return {*} value
*/
DenseMatrix.prototype.get = function (index) {
if (!Object(is["b" /* isArray */])(index)) {
throw new TypeError('Array expected');
}
if (index.length !== this._size.length) {
throw new DimensionError["a" /* DimensionError */](index.length, this._size.length);
} // check index
for (var x = 0; x < index.length; x++) {
Object(utils_array["q" /* validateIndex */])(index[x], this._size[x]);
}
var data = this._data;
for (var i = 0, ii = index.length; i < ii; i++) {
var indexI = index[i];
Object(utils_array["q" /* validateIndex */])(indexI, data.length);
data = data[indexI];
}
return data;
};
/**
* Replace a single element in the matrix.
* @memberof DenseMatrix
* @param {number[]} index Zero-based index
* @param {*} value
* @param {*} [defaultValue] Default value, filled in on new entries when
* the matrix is resized. If not provided,
* new matrix elements will be left undefined.
* @return {DenseMatrix} self
*/
DenseMatrix.prototype.set = function (index, value, defaultValue) {
if (!Object(is["b" /* isArray */])(index)) {
throw new TypeError('Array expected');
}
if (index.length < this._size.length) {
throw new DimensionError["a" /* DimensionError */](index.length, this._size.length, '<');
}
var i, ii, indexI; // enlarge matrix when needed
var size = index.map(function (i) {
return i + 1;
});
_fit(this, size, defaultValue); // traverse over the dimensions
var data = this._data;
for (i = 0, ii = index.length - 1; i < ii; i++) {
indexI = index[i];
Object(utils_array["q" /* validateIndex */])(indexI, data.length);
data = data[indexI];
} // set new value
indexI = index[index.length - 1];
Object(utils_array["q" /* validateIndex */])(indexI, data.length);
data[indexI] = value;
return this;
};
/**
* Get a submatrix of this matrix
* @memberof DenseMatrix
* @param {DenseMatrix} matrix
* @param {Index} index Zero-based index
* @private
*/
function _get(matrix, index) {
if (!Object(is["t" /* isIndex */])(index)) {
throw new TypeError('Invalid index');
}
var isScalar = index.isScalar();
if (isScalar) {
// return a scalar
return matrix.get(index.min());
} else {
// validate dimensions
var size = index.size();
if (size.length !== matrix._size.length) {
throw new DimensionError["a" /* DimensionError */](size.length, matrix._size.length);
} // validate if any of the ranges in the index is out of range
var min = index.min();
var max = index.max();
for (var i = 0, ii = matrix._size.length; i < ii; i++) {
Object(utils_array["q" /* validateIndex */])(min[i], matrix._size[i]);
Object(utils_array["q" /* validateIndex */])(max[i], matrix._size[i]);
} // retrieve submatrix
// TODO: more efficient when creating an empty matrix and setting _data and _size manually
return new DenseMatrix(_getSubmatrix(matrix._data, index, size.length, 0), matrix._datatype);
}
}
/**
* Recursively get a submatrix of a multi dimensional matrix.
* Index is not checked for correct number or length of dimensions.
* @memberof DenseMatrix
* @param {Array} data
* @param {Index} index
* @param {number} dims Total number of dimensions
* @param {number} dim Current dimension
* @return {Array} submatrix
* @private
*/
function _getSubmatrix(data, index, dims, dim) {
var last = dim === dims - 1;
var range = index.dimension(dim);
if (last) {
return range.map(function (i) {
Object(utils_array["q" /* validateIndex */])(i, data.length);
return data[i];
}).valueOf();
} else {
return range.map(function (i) {
Object(utils_array["q" /* validateIndex */])(i, data.length);
var child = data[i];
return _getSubmatrix(child, index, dims, dim + 1);
}).valueOf();
}
}
/**
* Replace a submatrix in this matrix
* Indexes are zero-based.
* @memberof DenseMatrix
* @param {DenseMatrix} matrix
* @param {Index} index
* @param {DenseMatrix | Array | *} submatrix
* @param {*} defaultValue Default value, filled in on new entries when
* the matrix is resized.
* @return {DenseMatrix} matrix
* @private
*/
function _set(matrix, index, submatrix, defaultValue) {
if (!index || index.isIndex !== true) {
throw new TypeError('Invalid index');
} // get index size and check whether the index contains a single value
var iSize = index.size();
var isScalar = index.isScalar(); // calculate the size of the submatrix, and convert it into an Array if needed
var sSize;
if (Object(is["v" /* isMatrix */])(submatrix)) {
sSize = submatrix.size();
submatrix = submatrix.valueOf();
} else {
sSize = Object(utils_array["a" /* arraySize */])(submatrix);
}
if (isScalar) {
// set a scalar
// check whether submatrix is a scalar
if (sSize.length !== 0) {
throw new TypeError('Scalar expected');
}
matrix.set(index.min(), submatrix, defaultValue);
} else {
// set a submatrix
// validate dimensions
if (iSize.length < matrix._size.length) {
throw new DimensionError["a" /* DimensionError */](iSize.length, matrix._size.length, '<');
}
if (sSize.length < iSize.length) {
// calculate number of missing outer dimensions
var i = 0;
var outer = 0;
while (iSize[i] === 1 && sSize[i] === 1) {
i++;
}
while (iSize[i] === 1) {
outer++;
i++;
} // unsqueeze both outer and inner dimensions
submatrix = Object(utils_array["o" /* unsqueeze */])(submatrix, iSize.length, outer, sSize);
} // check whether the size of the submatrix matches the index size
if (!Object(utils_object["d" /* deepStrictEqual */])(iSize, sSize)) {
throw new DimensionError["a" /* DimensionError */](iSize, sSize, '>');
} // enlarge matrix when needed
var size = index.max().map(function (i) {
return i + 1;
});
_fit(matrix, size, defaultValue); // insert the sub matrix
var dims = iSize.length;
var dim = 0;
_setSubmatrix(matrix._data, index, submatrix, dims, dim);
}
return matrix;
}
/**
* Replace a submatrix of a multi dimensional matrix.
* @memberof DenseMatrix
* @param {Array} data
* @param {Index} index
* @param {Array} submatrix
* @param {number} dims Total number of dimensions
* @param {number} dim
* @private
*/
function _setSubmatrix(data, index, submatrix, dims, dim) {
var last = dim === dims - 1;
var range = index.dimension(dim);
if (last) {
range.forEach(function (dataIndex, subIndex) {
Object(utils_array["q" /* validateIndex */])(dataIndex);
data[dataIndex] = submatrix[subIndex[0]];
});
} else {
range.forEach(function (dataIndex, subIndex) {
Object(utils_array["q" /* validateIndex */])(dataIndex);
_setSubmatrix(data[dataIndex], index, submatrix[subIndex[0]], dims, dim + 1);
});
}
}
/**
* Resize the matrix to the given size. Returns a copy of the matrix when
* `copy=true`, otherwise return the matrix itself (resize in place).
*
* @memberof DenseMatrix
* @param {number[] || Matrix} size The new size the matrix should have.
* @param {*} [defaultValue=0] Default value, filled in on new entries.
* If not provided, the matrix elements will
* be filled with zeros.
* @param {boolean} [copy] Return a resized copy of the matrix
*
* @return {Matrix} The resized matrix
*/
DenseMatrix.prototype.resize = function (size, defaultValue, copy) {
// validate arguments
if (!Object(is["i" /* isCollection */])(size)) {
throw new TypeError('Array or Matrix expected');
} // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector
var sizeArray = size.valueOf().map(function (value) {
return Array.isArray(value) && value.length === 1 ? value[0] : value;
}); // matrix to resize
var m = copy ? this.clone() : this; // resize matrix
return _resize(m, sizeArray, defaultValue);
};
function _resize(matrix, size, defaultValue) {
// check size
if (size.length === 0) {
// first value in matrix
var v = matrix._data; // go deep
while (Object(is["b" /* isArray */])(v)) {
v = v[0];
}
return v;
} // resize matrix
matrix._size = size.slice(0); // copy the array
matrix._data = Object(utils_array["m" /* resize */])(matrix._data, matrix._size, defaultValue); // return matrix
return matrix;
}
/**
* Reshape the matrix to the given size. Returns a copy of the matrix when
* `copy=true`, otherwise return the matrix itself (reshape in place).
*
* NOTE: This might be better suited to copy by default, instead of modifying
* in place. For now, it operates in place to remain consistent with
* resize().
*
* @memberof DenseMatrix
* @param {number[]} size The new size the matrix should have.
* @param {boolean} [copy] Return a reshaped copy of the matrix
*
* @return {Matrix} The reshaped matrix
*/
DenseMatrix.prototype.reshape = function (size, copy) {
var m = copy ? this.clone() : this;
m._data = Object(utils_array["l" /* reshape */])(m._data, size);
m._size = size.slice(0);
return m;
};
/**
* Enlarge the matrix when it is smaller than given size.
* If the matrix is larger or equal sized, nothing is done.
* @memberof DenseMatrix
* @param {DenseMatrix} matrix The matrix to be resized
* @param {number[]} size
* @param {*} defaultValue Default value, filled in on new entries.
* @private
*/
function _fit(matrix, size, defaultValue) {
var // copy the array
newSize = matrix._size.slice(0);
var changed = false; // add dimensions when needed
while (newSize.length < size.length) {
newSize.push(0);
changed = true;
} // enlarge size when needed
for (var i = 0, ii = size.length; i < ii; i++) {
if (size[i] > newSize[i]) {
newSize[i] = size[i];
changed = true;
}
}
if (changed) {
// resize only when size is changed
_resize(matrix, newSize, defaultValue);
}
}
/**
* Create a clone of the matrix
* @memberof DenseMatrix
* @return {DenseMatrix} clone
*/
DenseMatrix.prototype.clone = function () {
var m = new DenseMatrix({
data: Object(utils_object["a" /* clone */])(this._data),
size: Object(utils_object["a" /* clone */])(this._size),
datatype: this._datatype
});
return m;
};
/**
* Retrieve the size of the matrix.
* @memberof DenseMatrix
* @returns {number[]} size
*/
DenseMatrix.prototype.size = function () {
return this._size.slice(0); // return a clone of _size
};
/**
* Create a new matrix with the results of the callback function executed on
* each entry of the matrix.
* @memberof DenseMatrix
* @param {Function} callback The callback function is invoked with three
* parameters: the value of the element, the index
* of the element, and the Matrix being traversed.
*
* @return {DenseMatrix} matrix
*/
DenseMatrix.prototype.map = function (callback) {
// matrix instance
var me = this;
var recurse = function recurse(value, index) {
if (Object(is["b" /* isArray */])(value)) {
return value.map(function (child, i) {
return recurse(child, index.concat(i));
});
} else {
return callback(value, index, me);
}
}; // determine the new datatype when the original matrix has datatype defined
// TODO: should be done in matrix constructor instead
var data = recurse(this._data, []);
var datatype = this._datatype !== undefined ? Object(utils_array["h" /* getArrayDataType */])(data, is["M" /* typeOf */]) : undefined;
return new DenseMatrix(data, datatype);
};
/**
* Execute a callback function on each entry of the matrix.
* @memberof DenseMatrix
* @param {Function} callback The callback function is invoked with three
* parameters: the value of the element, the index
* of the element, and the Matrix being traversed.
*/
DenseMatrix.prototype.forEach = function (callback) {
// matrix instance
var me = this;
var recurse = function recurse(value, index) {
if (Object(is["b" /* isArray */])(value)) {
value.forEach(function (child, i) {
recurse(child, index.concat(i));
});
} else {
callback(value, index, me);
}
};
recurse(this._data, []);
};
/**
* Create an Array with a copy of the data of the DenseMatrix
* @memberof DenseMatrix
* @returns {Array} array
*/
DenseMatrix.prototype.toArray = function () {
return Object(utils_object["a" /* clone */])(this._data);
};
/**
* Get the primitive value of the DenseMatrix: a multidimensional array
* @memberof DenseMatrix
* @returns {Array} array
*/
DenseMatrix.prototype.valueOf = function () {
return this._data;
};
/**
* Get a string representation of the matrix, with optional formatting options.
* @memberof DenseMatrix
* @param {Object | number | Function} [options] Formatting options. See
* lib/utils/number:format for a
* description of the available
* options.
* @returns {string} str
*/
DenseMatrix.prototype.format = function (options) {
return Object(utils_string["d" /* format */])(this._data, options);
};
/**
* Get a string representation of the matrix
* @memberof DenseMatrix
* @returns {string} str
*/
DenseMatrix.prototype.toString = function () {
return Object(utils_string["d" /* format */])(this._data);
};
/**
* Get a JSON representation of the matrix
* @memberof DenseMatrix
* @returns {Object}
*/
DenseMatrix.prototype.toJSON = function () {
return {
mathjs: 'DenseMatrix',
data: this._data,
size: this._size,
datatype: this._datatype
};
};
/**
* Get the kth Matrix diagonal.
*
* @memberof DenseMatrix
* @param {number | BigNumber} [k=0] The kth diagonal where the vector will retrieved.
*
* @returns {Matrix} The matrix with the diagonal values.
*/
DenseMatrix.prototype.diagonal = function (k) {
// validate k if any
if (k) {
// convert BigNumber to a number
if (Object(is["e" /* isBigNumber */])(k)) {
k = k.toNumber();
} // is must be an integer
if (!Object(is["y" /* isNumber */])(k) || !Object(utils_number["i" /* isInteger */])(k)) {
throw new TypeError('The parameter k must be an integer number');
}
} else {
// default value
k = 0;
}
var kSuper = k > 0 ? k : 0;
var kSub = k < 0 ? -k : 0; // rows & columns
var rows = this._size[0];
var columns = this._size[1]; // number diagonal values
var n = Math.min(rows - kSub, columns - kSuper); // x is a matrix get diagonal from matrix
var data = []; // loop rows
for (var i = 0; i < n; i++) {
data[i] = this._data[i + kSub][i + kSuper];
} // create DenseMatrix
return new DenseMatrix({
data: data,
size: [n],
datatype: this._datatype
});
};
/**
* Create a diagonal matrix.
*
* @memberof DenseMatrix
* @param {Array} size The matrix size.
* @param {number | Matrix | Array } value The values for the diagonal.
* @param {number | BigNumber} [k=0] The kth diagonal where the vector will be filled in.
* @param {number} [defaultValue] The default value for non-diagonal
* @param {string} [datatype] The datatype for the diagonal
*
* @returns {DenseMatrix}
*/
DenseMatrix.diagonal = function (size, value, k, defaultValue) {
if (!Object(is["b" /* isArray */])(size)) {
throw new TypeError('Array expected, size parameter');
}
if (size.length !== 2) {
throw new Error('Only two dimensions matrix are supported');
} // map size & validate
size = size.map(function (s) {
// check it is a big number
if (Object(is["e" /* isBigNumber */])(s)) {
// convert it
s = s.toNumber();
} // validate arguments
if (!Object(is["y" /* isNumber */])(s) || !Object(utils_number["i" /* isInteger */])(s) || s < 1) {
throw new Error('Size values must be positive integers');
}
return s;
}); // validate k if any
if (k) {
// convert BigNumber to a number
if (Object(is["e" /* isBigNumber */])(k)) {
k = k.toNumber();
} // is must be an integer
if (!Object(is["y" /* isNumber */])(k) || !Object(utils_number["i" /* isInteger */])(k)) {
throw new TypeError('The parameter k must be an integer number');
}
} else {
// default value
k = 0;
}
var kSuper = k > 0 ? k : 0;
var kSub = k < 0 ? -k : 0; // rows and columns
var rows = size[0];
var columns = size[1]; // number of non-zero items
var n = Math.min(rows - kSub, columns - kSuper); // value extraction function
var _value; // check value
if (Object(is["b" /* isArray */])(value)) {
// validate array
if (value.length !== n) {
// number of values in array must be n
throw new Error('Invalid value array length');
} // define function
_value = function _value(i) {
// return value @ i
return value[i];
};
} else if (Object(is["v" /* isMatrix */])(value)) {
// matrix size
var ms = value.size(); // validate matrix
if (ms.length !== 1 || ms[0] !== n) {
// number of values in array must be n
throw new Error('Invalid matrix length');
} // define function
_value = function _value(i) {
// return value @ i
return value.get([i]);
};
} else {
// define function
_value = function _value() {
// return value
return value;
};
} // discover default value if needed
if (!defaultValue) {
// check first value in array
defaultValue = Object(is["e" /* isBigNumber */])(_value(0)) ? _value(0).mul(0) // trick to create a BigNumber with value zero
: 0;
} // empty array
var data = []; // check we need to resize array
if (size.length > 0) {
// resize array
data = Object(utils_array["m" /* resize */])(data, size, defaultValue); // fill diagonal
for (var d = 0; d < n; d++) {
data[d + kSub][d + kSuper] = _value(d);
}
} // create DenseMatrix
return new DenseMatrix({
data: data,
size: [rows, columns]
});
};
/**
* Generate a matrix from a JSON object
* @memberof DenseMatrix
* @param {Object} json An object structured like
* `{"mathjs": "DenseMatrix", data: [], size: []}`,
* where mathjs is optional
* @returns {DenseMatrix}
*/
DenseMatrix.fromJSON = function (json) {
return new DenseMatrix(json);
};
/**
* Swap rows i and j in Matrix.
*
* @memberof DenseMatrix
* @param {number} i Matrix row index 1
* @param {number} j Matrix row index 2
*
* @return {Matrix} The matrix reference
*/
DenseMatrix.prototype.swapRows = function (i, j) {
// check index
if (!Object(is["y" /* isNumber */])(i) || !Object(utils_number["i" /* isInteger */])(i) || !Object(is["y" /* isNumber */])(j) || !Object(utils_number["i" /* isInteger */])(j)) {
throw new Error('Row index must be positive integers');
} // check dimensions
if (this._size.length !== 2) {
throw new Error('Only two dimensional matrix is supported');
} // validate index
Object(utils_array["q" /* validateIndex */])(i, this._size[0]);
Object(utils_array["q" /* validateIndex */])(j, this._size[0]); // swap rows
DenseMatrix._swapRows(i, j, this._data); // return current instance
return this;
};
/**
* Swap rows i and j in Dense Matrix data structure.
*
* @param {number} i Matrix row index 1
* @param {number} j Matrix row index 2
* @param {Array} data Matrix data
*/
DenseMatrix._swapRows = function (i, j, data) {
// swap values i <-> j
var vi = data[i];
data[i] = data[j];
data[j] = vi;
};
/**
* Preprocess data, which can be an Array or DenseMatrix with nested Arrays and
* Matrices. Replaces all nested Matrices with Arrays
* @memberof DenseMatrix
* @param {Array} data
* @return {Array} data
*/
function preprocess(data) {
for (var i = 0, ii = data.length; i < ii; i++) {
var elem = data[i];
if (Object(is["b" /* isArray */])(elem)) {
data[i] = preprocess(elem);
} else if (elem && elem.isMatrix === true) {
data[i] = preprocess(elem.valueOf());
}
}
return data;
}
return DenseMatrix;
}, {
isClass: true
});
// CONCATENATED MODULE: ./src/function/utils/clone.js
var clone_name = 'clone';
var clone_dependencies = ['typed'];
var createClone = /* #__PURE__ */Object(factory["a" /* factory */])(clone_name, clone_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Clone an object.
*
* Syntax:
*
* math.clone(x)
*
* Examples:
*
* math.clone(3.5) // returns number 3.5
* math.clone(math.complex('2-4i') // returns Complex 2 - 4i
* math.clone(math.unit(45, 'deg')) // returns Unit 45 deg
* math.clone([[1, 2], [3, 4]]) // returns Array [[1, 2], [3, 4]]
* math.clone("hello world") // returns string "hello world"
*
* @param {*} x Object to be cloned
* @return {*} A clone of object x
*/
return typed(clone_name, {
any: utils_object["a" /* clone */]
});
});
// EXTERNAL MODULE: ./src/error/IndexError.js
var IndexError = __webpack_require__(9);
// CONCATENATED MODULE: ./src/utils/collection.js
/**
* Test whether an array contains collections
* @param {Array} array
* @returns {boolean} Returns true when the array contains one or multiple
* collections (Arrays or Matrices). Returns false otherwise.
*/
function containsCollections(array) {
for (var i = 0; i < array.length; i++) {
if (Object(is["i" /* isCollection */])(array[i])) {
return true;
}
}
return false;
}
/**
* Recursively loop over all elements in a given multi dimensional array
* and invoke the callback on each of the elements.
* @param {Array | Matrix} array
* @param {Function} callback The callback method is invoked with one
* parameter: the current element in the array
*/
function deepForEach(array, callback) {
if (Object(is["v" /* isMatrix */])(array)) {
array = array.valueOf();
}
for (var i = 0, ii = array.length; i < ii; i++) {
var value = array[i];
if (Array.isArray(value)) {
deepForEach(value, callback);
} else {
callback(value);
}
}
}
/**
* Execute the callback function element wise for each element in array and any
* nested array
* Returns an array with the results
* @param {Array | Matrix} array
* @param {Function} callback The callback is called with two parameters:
* value1 and value2, which contain the current
* element of both arrays.
* @param {boolean} [skipZeros] Invoke callback function for non-zero values only.
*
* @return {Array | Matrix} res
*/
function deepMap(array, callback, skipZeros) {
if (array && typeof array.map === 'function') {
// TODO: replace array.map with a for loop to improve performance
return array.map(function (x) {
return deepMap(x, callback, skipZeros);
});
} else {
return callback(array);
}
}
/**
* Reduce a given matrix or array to a new matrix or
* array with one less dimension, applying the given
* callback in the selected dimension.
* @param {Array | Matrix} mat
* @param {number} dim
* @param {Function} callback
* @return {Array | Matrix} res
*/
function reduce(mat, dim, callback) {
var size = Array.isArray(mat) ? Object(utils_array["a" /* arraySize */])(mat) : mat.size();
if (dim < 0 || dim >= size.length) {
// TODO: would be more clear when throwing a DimensionError here
throw new IndexError["a" /* IndexError */](dim, size.length);
}
if (Object(is["v" /* isMatrix */])(mat)) {
return mat.create(_reduce(mat.valueOf(), dim, callback));
} else {
return _reduce(mat, dim, callback);
}
}
/**
* Recursively reduce a matrix
* @param {Array} mat
* @param {number} dim
* @param {Function} callback
* @returns {Array} ret
* @private
*/
function _reduce(mat, dim, callback) {
var i, ret, val, tran;
if (dim <= 0) {
if (!Array.isArray(mat[0])) {
val = mat[0];
for (i = 1; i < mat.length; i++) {
val = callback(val, mat[i]);
}
return val;
} else {
tran = _switch(mat);
ret = [];
for (i = 0; i < tran.length; i++) {
ret[i] = _reduce(tran[i], dim - 1, callback);
}
return ret;
}
} else {
ret = [];
for (i = 0; i < mat.length; i++) {
ret[i] = _reduce(mat[i], dim - 1, callback);
}
return ret;
}
}
/**
* Transpose a matrix
* @param {Array} mat
* @returns {Array} ret
* @private
*/
function _switch(mat) {
var I = mat.length;
var J = mat[0].length;
var i, j;
var ret = [];
for (j = 0; j < J; j++) {
var tmp = [];
for (i = 0; i < I; i++) {
tmp.push(mat[i][j]);
}
ret.push(tmp);
}
return ret;
} // TODO: document function scatter
function scatter(a, j, w, x, u, mark, cindex, f, inverse, update, value) {
// a arrays
var avalues = a._values;
var aindex = a._index;
var aptr = a._ptr; // vars
var k, k0, k1, i; // check we need to process values (pattern matrix)
if (x) {
// values in j
for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
// row
i = aindex[k]; // check value exists in current j
if (w[i] !== mark) {
// i is new entry in j
w[i] = mark; // add i to pattern of C
cindex.push(i); // x(i) = A, check we need to call function this time
if (update) {
// copy value to workspace calling callback function
x[i] = inverse ? f(avalues[k], value) : f(value, avalues[k]); // function was called on current row
u[i] = mark;
} else {
// copy value to workspace
x[i] = avalues[k];
}
} else {
// i exists in C already
x[i] = inverse ? f(avalues[k], x[i]) : f(x[i], avalues[k]); // function was called on current row
u[i] = mark;
}
}
} else {
// values in j
for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
// row
i = aindex[k]; // check value exists in current j
if (w[i] !== mark) {
// i is new entry in j
w[i] = mark; // add i to pattern of C
cindex.push(i);
} else {
// indicate function was called on current row
u[i] = mark;
}
}
}
}
// CONCATENATED MODULE: ./src/function/utils/isInteger.js
var isInteger_name = 'isInteger';
var isInteger_dependencies = ['typed'];
var createIsInteger = /* #__PURE__ */Object(factory["a" /* factory */])(isInteger_name, isInteger_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Test whether a value is an integer number.
* The function supports `number`, `BigNumber`, and `Fraction`.
*
* The function is evaluated element-wise in case of Array or Matrix input.
*
* Syntax:
*
* math.isInteger(x)
*
* Examples:
*
* math.isInteger(2) // returns true
* math.isInteger(0) // returns true
* math.isInteger(0.5) // returns false
* math.isInteger(math.bignumber(500)) // returns true
* math.isInteger(math.fraction(4)) // returns true
* math.isInteger('3') // returns true
* math.isInteger([3, 0.5, -2]) // returns [true, false, true]
* math.isInteger(math.complex('2-4i') // throws an error
*
* See also:
*
* isNumeric, isPositive, isNegative, isZero
*
* @param {number | BigNumber | Fraction | Array | Matrix} x Value to be tested
* @return {boolean} Returns true when `x` contains a numeric, integer value.
* Throws an error in case of an unknown data type.
*/
return typed(isInteger_name, {
number: utils_number["i" /* isInteger */],
// TODO: what to do with isInteger(add(0.1, 0.2)) ?
BigNumber: function BigNumber(x) {
return x.isInt();
},
Fraction: function Fraction(x) {
return x.d === 1 && isFinite(x.n);
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/plain/number/utils.js
var utils_n1 = 'number';
function isIntegerNumber(x) {
return Object(utils_number["i" /* isInteger */])(x);
}
isIntegerNumber.signature = utils_n1;
function isNegativeNumber(x) {
return x < 0;
}
isNegativeNumber.signature = utils_n1;
function isPositiveNumber(x) {
return x > 0;
}
isPositiveNumber.signature = utils_n1;
function isZeroNumber(x) {
return x === 0;
}
isZeroNumber.signature = utils_n1;
function isNaNNumber(x) {
return Number.isNaN(x);
}
isNaNNumber.signature = utils_n1;
// CONCATENATED MODULE: ./src/function/utils/isNegative.js
var isNegative_name = 'isNegative';
var isNegative_dependencies = ['typed'];
var createIsNegative = /* #__PURE__ */Object(factory["a" /* factory */])(isNegative_name, isNegative_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Test whether a value is negative: smaller than zero.
* The function supports types `number`, `BigNumber`, `Fraction`, and `Unit`.
*
* The function is evaluated element-wise in case of Array or Matrix input.
*
* Syntax:
*
* math.isNegative(x)
*
* Examples:
*
* math.isNegative(3) // returns false
* math.isNegative(-2) // returns true
* math.isNegative(0) // returns false
* math.isNegative(-0) // returns false
* math.isNegative(math.bignumber(2)) // returns false
* math.isNegative(math.fraction(-2, 5)) // returns true
* math.isNegative('-2') // returns true
* math.isNegative([2, 0, -3]') // returns [false, false, true]
*
* See also:
*
* isNumeric, isPositive, isZero, isInteger
*
* @param {number | BigNumber | Fraction | Unit | Array | Matrix} x Value to be tested
* @return {boolean} Returns true when `x` is larger than zero.
* Throws an error in case of an unknown data type.
*/
return typed(isNegative_name, {
number: isNegativeNumber,
BigNumber: function BigNumber(x) {
return x.isNeg() && !x.isZero() && !x.isNaN();
},
Fraction: function Fraction(x) {
return x.s < 0; // It's enough to decide on the sign
},
Unit: function Unit(x) {
return this(x.value);
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/utils/isNumeric.js
var isNumeric_name = 'isNumeric';
var isNumeric_dependencies = ['typed'];
var createIsNumeric = /* #__PURE__ */Object(factory["a" /* factory */])(isNumeric_name, isNumeric_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Test whether a value is an numeric value.
*
* The function is evaluated element-wise in case of Array or Matrix input.
*
* Syntax:
*
* math.isNumeric(x)
*
* Examples:
*
* math.isNumeric(2) // returns true
* math.isNumeric('2') // returns false
* math.hasNumericValue('2') // returns true
* math.isNumeric(0) // returns true
* math.isNumeric(math.bignumber(500)) // returns true
* math.isNumeric(math.fraction(4)) // returns true
* math.isNumeric(math.complex('2-4i') // returns false
* math.isNumeric([2.3, 'foo', false]) // returns [true, false, true]
*
* See also:
*
* isZero, isPositive, isNegative, isInteger, hasNumericValue
*
* @param {*} x Value to be tested
* @return {boolean} Returns true when `x` is a `number`, `BigNumber`,
* `Fraction`, or `boolean`. Returns false for other types.
* Throws an error in case of unknown types.
*/
return typed(isNumeric_name, {
'number | BigNumber | Fraction | boolean': function numberBigNumberFractionBoolean() {
return true;
},
'Complex | Unit | string | null | undefined | Node': function ComplexUnitStringNullUndefinedNode() {
return false;
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/utils/hasNumericValue.js
var hasNumericValue_name = 'hasNumericValue';
var hasNumericValue_dependencies = ['typed', 'isNumeric'];
var createHasNumericValue = /* #__PURE__ */Object(factory["a" /* factory */])(hasNumericValue_name, hasNumericValue_dependencies, function (_ref) {
var typed = _ref.typed,
isNumeric = _ref.isNumeric;
/**
* Test whether a value is an numeric value.
*
* In case of a string, true is returned if the string contains a numeric value.
*
* Syntax:
*
* math.hasNumericValue(x)
*
* Examples:
*
* math.hasNumericValue(2) // returns true
* math.hasNumericValue('2') // returns true
* math.isNumeric('2') // returns false
* math.hasNumericValue(0) // returns true
* math.hasNumericValue(math.bignumber(500)) // returns true
* math.hasNumericValue(math.fraction(4)) // returns true
* math.hasNumericValue(math.complex('2-4i') // returns false
* math.hasNumericValue([2.3, 'foo', false]) // returns [true, false, true]
*
* See also:
*
* isZero, isPositive, isNegative, isInteger, isNumeric
*
* @param {*} x Value to be tested
* @return {boolean} Returns true when `x` is a `number`, `BigNumber`,
* `Fraction`, `Boolean`, or a `String` containing number. Returns false for other types.
* Throws an error in case of unknown types.
*/
return typed(hasNumericValue_name, {
string: function string(x) {
return x.trim().length > 0 && !isNaN(Number(x));
},
any: function any(x) {
return isNumeric(x);
}
});
});
// CONCATENATED MODULE: ./src/function/utils/isPositive.js
var isPositive_name = 'isPositive';
var isPositive_dependencies = ['typed'];
var createIsPositive = /* #__PURE__ */Object(factory["a" /* factory */])(isPositive_name, isPositive_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Test whether a value is positive: larger than zero.
* The function supports types `number`, `BigNumber`, `Fraction`, and `Unit`.
*
* The function is evaluated element-wise in case of Array or Matrix input.
*
* Syntax:
*
* math.isPositive(x)
*
* Examples:
*
* math.isPositive(3) // returns true
* math.isPositive(-2) // returns false
* math.isPositive(0) // returns false
* math.isPositive(-0) // returns false
* math.isPositive(0.5) // returns true
* math.isPositive(math.bignumber(2)) // returns true
* math.isPositive(math.fraction(-2, 5)) // returns false
* math.isPositive(math.fraction(1,3)) // returns false
* math.isPositive('2') // returns true
* math.isPositive([2, 0, -3]) // returns [true, false, false]
*
* See also:
*
* isNumeric, isZero, isNegative, isInteger
*
* @param {number | BigNumber | Fraction | Unit | Array | Matrix} x Value to be tested
* @return {boolean} Returns true when `x` is larger than zero.
* Throws an error in case of an unknown data type.
*/
return typed(isPositive_name, {
number: isPositiveNumber,
BigNumber: function BigNumber(x) {
return !x.isNeg() && !x.isZero() && !x.isNaN();
},
Fraction: function Fraction(x) {
return x.s > 0 && x.n > 0;
},
Unit: function Unit(x) {
return this(x.value);
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/utils/isZero.js
var isZero_name = 'isZero';
var isZero_dependencies = ['typed'];
var createIsZero = /* #__PURE__ */Object(factory["a" /* factory */])(isZero_name, isZero_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Test whether a value is zero.
* The function can check for zero for types `number`, `BigNumber`, `Fraction`,
* `Complex`, and `Unit`.
*
* The function is evaluated element-wise in case of Array or Matrix input.
*
* Syntax:
*
* math.isZero(x)
*
* Examples:
*
* math.isZero(0) // returns true
* math.isZero(2) // returns false
* math.isZero(0.5) // returns false
* math.isZero(math.bignumber(0)) // returns true
* math.isZero(math.fraction(0)) // returns true
* math.isZero(math.fraction(1,3)) // returns false
* math.isZero(math.complex('2 - 4i') // returns false
* math.isZero(math.complex('0i') // returns true
* math.isZero('0') // returns true
* math.isZero('2') // returns false
* math.isZero([2, 0, -3]') // returns [false, true, false]
*
* See also:
*
* isNumeric, isPositive, isNegative, isInteger
*
* @param {number | BigNumber | Complex | Fraction | Unit | Array | Matrix} x Value to be tested
* @return {boolean} Returns true when `x` is zero.
* Throws an error in case of an unknown data type.
*/
return typed(isZero_name, {
number: isZeroNumber,
BigNumber: function BigNumber(x) {
return x.isZero();
},
Complex: function Complex(x) {
return x.re === 0 && x.im === 0;
},
Fraction: function Fraction(x) {
return x.d === 1 && x.n === 0;
},
Unit: function Unit(x) {
return this(x.value);
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/utils/isNaN.js
var isNaN_name = 'isNaN';
var isNaN_dependencies = ['typed'];
var createIsNaN = /* #__PURE__ */Object(factory["a" /* factory */])(isNaN_name, isNaN_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Test whether a value is NaN (not a number).
* The function supports types `number`, `BigNumber`, `Fraction`, `Unit` and `Complex`.
*
* The function is evaluated element-wise in case of Array or Matrix input.
*
* Syntax:
*
* math.isNaN(x)
*
* Examples:
*
* math.isNaN(3) // returns false
* math.isNaN(NaN) // returns true
* math.isNaN(0) // returns false
* math.isNaN(math.bignumber(NaN)) // returns true
* math.isNaN(math.bignumber(0)) // returns false
* math.isNaN(math.fraction(-2, 5)) // returns false
* math.isNaN('-2') // returns false
* math.isNaN([2, 0, -3, NaN]') // returns [false, false, false, true]
*
* See also:
*
* isNumeric, isNegative, isPositive, isZero, isInteger
*
* @param {number | BigNumber | Fraction | Unit | Array | Matrix} x Value to be tested
* @return {boolean} Returns true when `x` is NaN.
* Throws an error in case of an unknown data type.
*/
return typed(isNaN_name, {
number: isNaNNumber,
BigNumber: function BigNumber(x) {
return x.isNaN();
},
Fraction: function Fraction(x) {
return false;
},
Complex: function Complex(x) {
return x.isNaN();
},
Unit: function Unit(x) {
return Number.isNaN(x.value);
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, Number.isNaN);
}
});
});
// CONCATENATED MODULE: ./src/function/utils/typeOf.js
var typeOf_name = 'typeOf';
var typeOf_dependencies = ['typed'];
var createTypeOf = /* #__PURE__ */Object(factory["a" /* factory */])(typeOf_name, typeOf_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Determine the type of a variable.
*
* Function `typeOf` recognizes the following types of objects:
*
* Object | Returns | Example
* ---------------------- | ------------- | ------------------------------------------
* null | `'null'` | `math.typeOf(null)`
* number | `'number'` | `math.typeOf(3.5)`
* boolean | `'boolean'` | `math.typeOf(true)`
* string | `'string'` | `math.typeOf('hello world')`
* Array | `'Array'` | `math.typeOf([1, 2, 3])`
* Date | `'Date'` | `math.typeOf(new Date())`
* Function | `'Function'` | `math.typeOf(function () {})`
* Object | `'Object'` | `math.typeOf({a: 2, b: 3})`
* RegExp | `'RegExp'` | `math.typeOf(/a regexp/)`
* undefined | `'undefined'` | `math.typeOf(undefined)`
* math.BigNumber | `'BigNumber'` | `math.typeOf(math.bignumber('2.3e500'))`
* math.Chain | `'Chain'` | `math.typeOf(math.chain(2))`
* math.Complex | `'Complex'` | `math.typeOf(math.complex(2, 3))`
* math.Fraction | `'Fraction'` | `math.typeOf(math.fraction(1, 3))`
* math.Help | `'Help'` | `math.typeOf(math.help('sqrt'))`
* math.Help | `'Help'` | `math.typeOf(math.help('sqrt'))`
* math.Index | `'Index'` | `math.typeOf(math.index(1, 3))`
* math.Matrix | `'Matrix'` | `math.typeOf(math.matrix([[1,2], [3, 4]]))`
* math.Range | `'Range'` | `math.typeOf(math.range(0, 10))`
* math.ResultSet | `'ResultSet'` | `math.typeOf(math.evaluate('a=2\nb=3'))`
* math.Unit | `'Unit'` | `math.typeOf(math.unit('45 deg'))`
* math.AccessorNode | `'AccessorNode'` | `math.typeOf(math.parse('A[2]'))`
* math.ArrayNode | `'ArrayNode'` | `math.typeOf(math.parse('[1,2,3]'))`
* math.AssignmentNode | `'AssignmentNode'` | `math.typeOf(math.parse('x=2'))`
* math.BlockNode | `'BlockNode'` | `math.typeOf(math.parse('a=2; b=3'))`
* math.ConditionalNode | `'ConditionalNode'` | `math.typeOf(math.parse('x<0 ? -x : x'))`
* math.ConstantNode | `'ConstantNode'` | `math.typeOf(math.parse('2.3'))`
* math.FunctionAssignmentNode | `'FunctionAssignmentNode'` | `math.typeOf(math.parse('f(x)=x^2'))`
* math.FunctionNode | `'FunctionNode'` | `math.typeOf(math.parse('sqrt(4)'))`
* math.IndexNode | `'IndexNode'` | `math.typeOf(math.parse('A[2]').index)`
* math.ObjectNode | `'ObjectNode'` | `math.typeOf(math.parse('{a:2}'))`
* math.ParenthesisNode | `'ParenthesisNode'` | `math.typeOf(math.parse('(2+3)'))`
* math.RangeNode | `'RangeNode'` | `math.typeOf(math.parse('1:10'))`
* math.SymbolNode | `'SymbolNode'` | `math.typeOf(math.parse('x'))`
*
* Syntax:
*
* math.typeOf(x)
*
* Examples:
*
* math.typeOf(3.5) // returns 'number'
* math.typeOf(math.complex('2-4i')) // returns 'Complex'
* math.typeOf(math.unit('45 deg')) // returns 'Unit'
* math.typeOf('hello world') // returns 'string'
*
* @param {*} x The variable for which to test the type.
* @return {string} Returns the name of the type. Primitive types are lower case,
* non-primitive types are upper-camel-case.
* For example 'number', 'string', 'Array', 'Date'.
*/
return typed(typeOf_name, {
any: is["M" /* typeOf */]
});
});
// CONCATENATED MODULE: ./src/utils/bignumber/nearlyEqual.js
/**
* Compares two BigNumbers.
* @param {BigNumber} x First value to compare
* @param {BigNumber} y Second value to compare
* @param {number} [epsilon] The maximum relative difference between x and y
* If epsilon is undefined or null, the function will
* test whether x and y are exactly equal.
* @return {boolean} whether the two numbers are nearly equal
*/
function nearlyEqual(x, y, epsilon) {
// if epsilon is null or undefined, test whether x and y are exactly equal
if (epsilon === null || epsilon === undefined) {
return x.eq(y);
} // use "==" operator, handles infinities
if (x.eq(y)) {
return true;
} // NaN
if (x.isNaN() || y.isNaN()) {
return false;
} // at this point x and y should be finite
if (x.isFinite() && y.isFinite()) {
// check numbers are very close, needed when comparing numbers near zero
var diff = x.minus(y).abs();
if (diff.isZero()) {
return true;
} else {
// use relative error
var max = x.constructor.max(x.abs(), y.abs());
return diff.lte(max.times(epsilon));
}
} // Infinite and Number or negative Infinite and positive Infinite cases
return false;
}
// CONCATENATED MODULE: ./src/utils/complex.js
/**
* Test whether two complex values are equal provided a given epsilon.
* Does not use or change the global Complex.EPSILON setting
* @param {Complex} x
* @param {Complex} y
* @param {number} epsilon
* @returns {boolean}
*/
function complexEquals(x, y, epsilon) {
return Object(utils_number["m" /* nearlyEqual */])(x.re, y.re, epsilon) && Object(utils_number["m" /* nearlyEqual */])(x.im, y.im, epsilon);
}
// CONCATENATED MODULE: ./src/function/relational/equalScalar.js
var equalScalar_name = 'equalScalar';
var equalScalar_dependencies = ['typed', 'config'];
var createEqualScalar = /* #__PURE__ */Object(factory["a" /* factory */])(equalScalar_name, equalScalar_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config;
/**
* Test whether two scalar values are nearly equal.
*
* @param {number | BigNumber | Fraction | boolean | Complex | Unit} x First value to compare
* @param {number | BigNumber | Fraction | boolean | Complex} y Second value to compare
* @return {boolean} Returns true when the compared values are equal, else returns false
* @private
*/
return typed(equalScalar_name, {
'boolean, boolean': function booleanBoolean(x, y) {
return x === y;
},
'number, number': function numberNumber(x, y) {
return Object(utils_number["m" /* nearlyEqual */])(x, y, config.epsilon);
},
'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
return x.eq(y) || nearlyEqual(x, y, config.epsilon);
},
'Fraction, Fraction': function FractionFraction(x, y) {
return x.equals(y);
},
'Complex, Complex': function ComplexComplex(x, y) {
return complexEquals(x, y, config.epsilon);
},
'Unit, Unit': function UnitUnit(x, y) {
if (!x.equalBase(y)) {
throw new Error('Cannot compare units with different base');
}
return this(x.value, y.value);
}
});
});
var createEqualScalarNumber = Object(factory["a" /* factory */])(equalScalar_name, ['typed', 'config'], function (_ref2) {
var typed = _ref2.typed,
config = _ref2.config;
return typed(equalScalar_name, {
'number, number': function numberNumber(x, y) {
return Object(utils_number["m" /* nearlyEqual */])(x, y, config.epsilon);
}
});
});
// CONCATENATED MODULE: ./src/type/matrix/SparseMatrix.js
var SparseMatrix_name = 'SparseMatrix';
var SparseMatrix_dependencies = ['typed', 'equalScalar', 'Matrix'];
var createSparseMatrixClass = /* #__PURE__ */Object(factory["a" /* factory */])(SparseMatrix_name, SparseMatrix_dependencies, function (_ref) {
var typed = _ref.typed,
equalScalar = _ref.equalScalar,
Matrix = _ref.Matrix;
/**
* Sparse Matrix implementation. This type implements a Compressed Column Storage format
* for sparse matrices.
* @class SparseMatrix
*/
function SparseMatrix(data, datatype) {
if (!(this instanceof SparseMatrix)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
if (datatype && !Object(is["I" /* isString */])(datatype)) {
throw new Error('Invalid datatype: ' + datatype);
}
if (Object(is["v" /* isMatrix */])(data)) {
// create from matrix
_createFromMatrix(this, data, datatype);
} else if (data && Object(is["b" /* isArray */])(data.index) && Object(is["b" /* isArray */])(data.ptr) && Object(is["b" /* isArray */])(data.size)) {
// initialize fields
this._values = data.values;
this._index = data.index;
this._ptr = data.ptr;
this._size = data.size;
this._datatype = datatype || data.datatype;
} else if (Object(is["b" /* isArray */])(data)) {
// create from array
_createFromArray(this, data, datatype);
} else if (data) {
// unsupported type
throw new TypeError('Unsupported type of data (' + Object(is["M" /* typeOf */])(data) + ')');
} else {
// nothing provided
this._values = [];
this._index = [];
this._ptr = [0];
this._size = [0, 0];
this._datatype = datatype;
}
}
function _createFromMatrix(matrix, source, datatype) {
// check matrix type
if (source.type === 'SparseMatrix') {
// clone arrays
matrix._values = source._values ? Object(utils_object["a" /* clone */])(source._values) : undefined;
matrix._index = Object(utils_object["a" /* clone */])(source._index);
matrix._ptr = Object(utils_object["a" /* clone */])(source._ptr);
matrix._size = Object(utils_object["a" /* clone */])(source._size);
matrix._datatype = datatype || source._datatype;
} else {
// build from matrix data
_createFromArray(matrix, source.valueOf(), datatype || source._datatype);
}
}
function _createFromArray(matrix, data, datatype) {
// initialize fields
matrix._values = [];
matrix._index = [];
matrix._ptr = [];
matrix._datatype = datatype; // discover rows & columns, do not use math.size() to avoid looping array twice
var rows = data.length;
var columns = 0; // equal signature to use
var eq = equalScalar; // zero value
var zero = 0;
if (Object(is["I" /* isString */])(datatype)) {
// find signature that matches (datatype, datatype)
eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar; // convert 0 to the same datatype
zero = typed.convert(0, datatype);
} // check we have rows (empty array)
if (rows > 0) {
// column index
var j = 0;
do {
// store pointer to values index
matrix._ptr.push(matrix._index.length); // loop rows
for (var i = 0; i < rows; i++) {
// current row
var row = data[i]; // check row is an array
if (Object(is["b" /* isArray */])(row)) {
// update columns if needed (only on first column)
if (j === 0 && columns < row.length) {
columns = row.length;
} // check row has column
if (j < row.length) {
// value
var v = row[j]; // check value != 0
if (!eq(v, zero)) {
// store value
matrix._values.push(v); // index
matrix._index.push(i);
}
}
} else {
// update columns if needed (only on first column)
if (j === 0 && columns < 1) {
columns = 1;
} // check value != 0 (row is a scalar)
if (!eq(row, zero)) {
// store value
matrix._values.push(row); // index
matrix._index.push(i);
}
}
} // increment index
j++;
} while (j < columns);
} // store number of values in ptr
matrix._ptr.push(matrix._index.length); // size
matrix._size = [rows, columns];
}
SparseMatrix.prototype = new Matrix();
/**
* Create a new SparseMatrix
*/
SparseMatrix.prototype.createSparseMatrix = function (data, datatype) {
return new SparseMatrix(data, datatype);
};
/**
* Attach type information
*/
SparseMatrix.prototype.type = 'SparseMatrix';
SparseMatrix.prototype.isSparseMatrix = true;
/**
* Get the matrix type
*
* Usage:
* const matrixType = matrix.getDataType() // retrieves the matrix type
*
* @memberOf SparseMatrix
* @return {string} type information; if multiple types are found from the Matrix, it will return "mixed"
*/
SparseMatrix.prototype.getDataType = function () {
return Object(utils_array["h" /* getArrayDataType */])(this._values, is["M" /* typeOf */]);
};
/**
* Get the storage format used by the matrix.
*
* Usage:
* const format = matrix.storage() // retrieve storage format
*
* @memberof SparseMatrix
* @return {string} The storage format.
*/
SparseMatrix.prototype.storage = function () {
return 'sparse';
};
/**
* Get the datatype of the data stored in the matrix.
*
* Usage:
* const format = matrix.datatype() // retrieve matrix datatype
*
* @memberof SparseMatrix
* @return {string} The datatype.
*/
SparseMatrix.prototype.datatype = function () {
return this._datatype;
};
/**
* Create a new SparseMatrix
* @memberof SparseMatrix
* @param {Array} data
* @param {string} [datatype]
*/
SparseMatrix.prototype.create = function (data, datatype) {
return new SparseMatrix(data, datatype);
};
/**
* Get the matrix density.
*
* Usage:
* const density = matrix.density() // retrieve matrix density
*
* @memberof SparseMatrix
* @return {number} The matrix density.
*/
SparseMatrix.prototype.density = function () {
// rows & columns
var rows = this._size[0];
var columns = this._size[1]; // calculate density
return rows !== 0 && columns !== 0 ? this._index.length / (rows * columns) : 0;
};
/**
* Get a subset of the matrix, or replace a subset of the matrix.
*
* Usage:
* const subset = matrix.subset(index) // retrieve subset
* const value = matrix.subset(index, replacement) // replace subset
*
* @memberof SparseMatrix
* @param {Index} index
* @param {Array | Matrix | *} [replacement]
* @param {*} [defaultValue=0] Default value, filled in on new entries when
* the matrix is resized. If not provided,
* new matrix elements will be filled with zeros.
*/
SparseMatrix.prototype.subset = function (index, replacement, defaultValue) {
// check it is a pattern matrix
if (!this._values) {
throw new Error('Cannot invoke subset on a Pattern only matrix');
} // check arguments
switch (arguments.length) {
case 1:
return _getsubset(this, index);
// intentional fall through
case 2:
case 3:
return _setsubset(this, index, replacement, defaultValue);
default:
throw new SyntaxError('Wrong number of arguments');
}
};
function _getsubset(matrix, idx) {
// check idx
if (!Object(is["t" /* isIndex */])(idx)) {
throw new TypeError('Invalid index');
}
var isScalar = idx.isScalar();
if (isScalar) {
// return a scalar
return matrix.get(idx.min());
} // validate dimensions
var size = idx.size();
if (size.length !== matrix._size.length) {
throw new DimensionError["a" /* DimensionError */](size.length, matrix._size.length);
} // vars
var i, ii, k, kk; // validate if any of the ranges in the index is out of range
var min = idx.min();
var max = idx.max();
for (i = 0, ii = matrix._size.length; i < ii; i++) {
Object(utils_array["q" /* validateIndex */])(min[i], matrix._size[i]);
Object(utils_array["q" /* validateIndex */])(max[i], matrix._size[i]);
} // matrix arrays
var mvalues = matrix._values;
var mindex = matrix._index;
var mptr = matrix._ptr; // rows & columns dimensions for result matrix
var rows = idx.dimension(0);
var columns = idx.dimension(1); // workspace & permutation vector
var w = [];
var pv = []; // loop rows in resulting matrix
rows.forEach(function (i, r) {
// update permutation vector
pv[i] = r[0]; // mark i in workspace
w[i] = true;
}); // result matrix arrays
var values = mvalues ? [] : undefined;
var index = [];
var ptr = []; // loop columns in result matrix
columns.forEach(function (j) {
// update ptr
ptr.push(index.length); // loop values in column j
for (k = mptr[j], kk = mptr[j + 1]; k < kk; k++) {
// row
i = mindex[k]; // check row is in result matrix
if (w[i] === true) {
// push index
index.push(pv[i]); // check we need to process values
if (values) {
values.push(mvalues[k]);
}
}
}
}); // update ptr
ptr.push(index.length); // return matrix
return new SparseMatrix({
values: values,
index: index,
ptr: ptr,
size: size,
datatype: matrix._datatype
});
}
function _setsubset(matrix, index, submatrix, defaultValue) {
// check index
if (!index || index.isIndex !== true) {
throw new TypeError('Invalid index');
} // get index size and check whether the index contains a single value
var iSize = index.size();
var isScalar = index.isScalar(); // calculate the size of the submatrix, and convert it into an Array if needed
var sSize;
if (Object(is["v" /* isMatrix */])(submatrix)) {
// submatrix size
sSize = submatrix.size(); // use array representation
submatrix = submatrix.toArray();
} else {
// get submatrix size (array, scalar)
sSize = Object(utils_array["a" /* arraySize */])(submatrix);
} // check index is a scalar
if (isScalar) {
// verify submatrix is a scalar
if (sSize.length !== 0) {
throw new TypeError('Scalar expected');
} // set value
matrix.set(index.min(), submatrix, defaultValue);
} else {
// validate dimensions, index size must be one or two dimensions
if (iSize.length !== 1 && iSize.length !== 2) {
throw new DimensionError["a" /* DimensionError */](iSize.length, matrix._size.length, '<');
} // check submatrix and index have the same dimensions
if (sSize.length < iSize.length) {
// calculate number of missing outer dimensions
var i = 0;
var outer = 0;
while (iSize[i] === 1 && sSize[i] === 1) {
i++;
}
while (iSize[i] === 1) {
outer++;
i++;
} // unsqueeze both outer and inner dimensions
submatrix = Object(utils_array["o" /* unsqueeze */])(submatrix, iSize.length, outer, sSize);
} // check whether the size of the submatrix matches the index size
if (!Object(utils_object["d" /* deepStrictEqual */])(iSize, sSize)) {
throw new DimensionError["a" /* DimensionError */](iSize, sSize, '>');
} // offsets
var x0 = index.min()[0];
var y0 = index.min()[1]; // submatrix rows and columns
var m = sSize[0];
var n = sSize[1]; // loop submatrix
for (var x = 0; x < m; x++) {
// loop columns
for (var y = 0; y < n; y++) {
// value at i, j
var v = submatrix[x][y]; // invoke set (zero value will remove entry from matrix)
matrix.set([x + x0, y + y0], v, defaultValue);
}
}
}
return matrix;
}
/**
* Get a single element from the matrix.
* @memberof SparseMatrix
* @param {number[]} index Zero-based index
* @return {*} value
*/
SparseMatrix.prototype.get = function (index) {
if (!Object(is["b" /* isArray */])(index)) {
throw new TypeError('Array expected');
}
if (index.length !== this._size.length) {
throw new DimensionError["a" /* DimensionError */](index.length, this._size.length);
} // check it is a pattern matrix
if (!this._values) {
throw new Error('Cannot invoke get on a Pattern only matrix');
} // row and column
var i = index[0];
var j = index[1]; // check i, j are valid
Object(utils_array["q" /* validateIndex */])(i, this._size[0]);
Object(utils_array["q" /* validateIndex */])(j, this._size[1]); // find value index
var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index); // check k is prior to next column k and it is in the correct row
if (k < this._ptr[j + 1] && this._index[k] === i) {
return this._values[k];
}
return 0;
};
/**
* Replace a single element in the matrix.
* @memberof SparseMatrix
* @param {number[]} index Zero-based index
* @param {*} v
* @param {*} [defaultValue] Default value, filled in on new entries when
* the matrix is resized. If not provided,
* new matrix elements will be set to zero.
* @return {SparseMatrix} self
*/
SparseMatrix.prototype.set = function (index, v, defaultValue) {
if (!Object(is["b" /* isArray */])(index)) {
throw new TypeError('Array expected');
}
if (index.length !== this._size.length) {
throw new DimensionError["a" /* DimensionError */](index.length, this._size.length);
} // check it is a pattern matrix
if (!this._values) {
throw new Error('Cannot invoke set on a Pattern only matrix');
} // row and column
var i = index[0];
var j = index[1]; // rows & columns
var rows = this._size[0];
var columns = this._size[1]; // equal signature to use
var eq = equalScalar; // zero value
var zero = 0;
if (Object(is["I" /* isString */])(this._datatype)) {
// find signature that matches (datatype, datatype)
eq = typed.find(equalScalar, [this._datatype, this._datatype]) || equalScalar; // convert 0 to the same datatype
zero = typed.convert(0, this._datatype);
} // check we need to resize matrix
if (i > rows - 1 || j > columns - 1) {
// resize matrix
_resize(this, Math.max(i + 1, rows), Math.max(j + 1, columns), defaultValue); // update rows & columns
rows = this._size[0];
columns = this._size[1];
} // check i, j are valid
Object(utils_array["q" /* validateIndex */])(i, rows);
Object(utils_array["q" /* validateIndex */])(j, columns); // find value index
var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index); // check k is prior to next column k and it is in the correct row
if (k < this._ptr[j + 1] && this._index[k] === i) {
// check value != 0
if (!eq(v, zero)) {
// update value
this._values[k] = v;
} else {
// remove value from matrix
_remove(k, j, this._values, this._index, this._ptr);
}
} else {
// insert value @ (i, j)
_insert(k, i, j, v, this._values, this._index, this._ptr);
}
return this;
};
function _getValueIndex(i, top, bottom, index) {
// check row is on the bottom side
if (bottom - top === 0) {
return bottom;
} // loop rows [top, bottom[
for (var r = top; r < bottom; r++) {
// check we found value index
if (index[r] === i) {
return r;
}
} // we did not find row
return top;
}
function _remove(k, j, values, index, ptr) {
// remove value @ k
values.splice(k, 1);
index.splice(k, 1); // update pointers
for (var x = j + 1; x < ptr.length; x++) {
ptr[x]--;
}
}
function _insert(k, i, j, v, values, index, ptr) {
// insert value
values.splice(k, 0, v); // update row for k
index.splice(k, 0, i); // update column pointers
for (var x = j + 1; x < ptr.length; x++) {
ptr[x]++;
}
}
/**
* Resize the matrix to the given size. Returns a copy of the matrix when
* `copy=true`, otherwise return the matrix itself (resize in place).
*
* @memberof SparseMatrix
* @param {number[] | Matrix} size The new size the matrix should have.
* @param {*} [defaultValue=0] Default value, filled in on new entries.
* If not provided, the matrix elements will
* be filled with zeros.
* @param {boolean} [copy] Return a resized copy of the matrix
*
* @return {Matrix} The resized matrix
*/
SparseMatrix.prototype.resize = function (size, defaultValue, copy) {
// validate arguments
if (!Object(is["i" /* isCollection */])(size)) {
throw new TypeError('Array or Matrix expected');
} // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector
var sizeArray = size.valueOf().map(function (value) {
return Array.isArray(value) && value.length === 1 ? value[0] : value;
});
if (sizeArray.length !== 2) {
throw new Error('Only two dimensions matrix are supported');
} // check sizes
sizeArray.forEach(function (value) {
if (!Object(is["y" /* isNumber */])(value) || !Object(utils_number["i" /* isInteger */])(value) || value < 0) {
throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + Object(utils_string["d" /* format */])(sizeArray) + ')');
}
}); // matrix to resize
var m = copy ? this.clone() : this; // resize matrix
return _resize(m, sizeArray[0], sizeArray[1], defaultValue);
};
function _resize(matrix, rows, columns, defaultValue) {
// value to insert at the time of growing matrix
var value = defaultValue || 0; // equal signature to use
var eq = equalScalar; // zero value
var zero = 0;
if (Object(is["I" /* isString */])(matrix._datatype)) {
// find signature that matches (datatype, datatype)
eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar; // convert 0 to the same datatype
zero = typed.convert(0, matrix._datatype); // convert value to the same datatype
value = typed.convert(value, matrix._datatype);
} // should we insert the value?
var ins = !eq(value, zero); // old columns and rows
var r = matrix._size[0];
var c = matrix._size[1];
var i, j, k; // check we need to increase columns
if (columns > c) {
// loop new columns
for (j = c; j < columns; j++) {
// update matrix._ptr for current column
matrix._ptr[j] = matrix._values.length; // check we need to insert matrix._values
if (ins) {
// loop rows
for (i = 0; i < r; i++) {
// add new matrix._values
matrix._values.push(value); // update matrix._index
matrix._index.push(i);
}
}
} // store number of matrix._values in matrix._ptr
matrix._ptr[columns] = matrix._values.length;
} else if (columns < c) {
// truncate matrix._ptr
matrix._ptr.splice(columns + 1, c - columns); // truncate matrix._values and matrix._index
matrix._values.splice(matrix._ptr[columns], matrix._values.length);
matrix._index.splice(matrix._ptr[columns], matrix._index.length);
} // update columns
c = columns; // check we need to increase rows
if (rows > r) {
// check we have to insert values
if (ins) {
// inserts
var n = 0; // loop columns
for (j = 0; j < c; j++) {
// update matrix._ptr for current column
matrix._ptr[j] = matrix._ptr[j] + n; // where to insert matrix._values
k = matrix._ptr[j + 1] + n; // pointer
var p = 0; // loop new rows, initialize pointer
for (i = r; i < rows; i++, p++) {
// add value
matrix._values.splice(k + p, 0, value); // update matrix._index
matrix._index.splice(k + p, 0, i); // increment inserts
n++;
}
} // store number of matrix._values in matrix._ptr
matrix._ptr[c] = matrix._values.length;
}
} else if (rows < r) {
// deletes
var d = 0; // loop columns
for (j = 0; j < c; j++) {
// update matrix._ptr for current column
matrix._ptr[j] = matrix._ptr[j] - d; // where matrix._values start for next column
var k0 = matrix._ptr[j];
var k1 = matrix._ptr[j + 1] - d; // loop matrix._index
for (k = k0; k < k1; k++) {
// row
i = matrix._index[k]; // check we need to delete value and matrix._index
if (i > rows - 1) {
// remove value
matrix._values.splice(k, 1); // remove item from matrix._index
matrix._index.splice(k, 1); // increase deletes
d++;
}
}
} // update matrix._ptr for current column
matrix._ptr[j] = matrix._values.length;
} // update matrix._size
matrix._size[0] = rows;
matrix._size[1] = columns; // return matrix
return matrix;
}
/**
* Reshape the matrix to the given size. Returns a copy of the matrix when
* `copy=true`, otherwise return the matrix itself (reshape in place).
*
* NOTE: This might be better suited to copy by default, instead of modifying
* in place. For now, it operates in place to remain consistent with
* resize().
*
* @memberof SparseMatrix
* @param {number[]} size The new size the matrix should have.
* @param {boolean} [copy] Return a reshaped copy of the matrix
*
* @return {Matrix} The reshaped matrix
*/
SparseMatrix.prototype.reshape = function (size, copy) {
// validate arguments
if (!Object(is["b" /* isArray */])(size)) {
throw new TypeError('Array expected');
}
if (size.length !== 2) {
throw new Error('Sparse matrices can only be reshaped in two dimensions');
} // check sizes
size.forEach(function (value) {
if (!Object(is["y" /* isNumber */])(value) || !Object(utils_number["i" /* isInteger */])(value) || value < 0) {
throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + Object(utils_string["d" /* format */])(size) + ')');
}
}); // m * n must not change
if (this._size[0] * this._size[1] !== size[0] * size[1]) {
throw new Error('Reshaping sparse matrix will result in the wrong number of elements');
} // matrix to reshape
var m = copy ? this.clone() : this; // return unchanged if the same shape
if (this._size[0] === size[0] && this._size[1] === size[1]) {
return m;
} // Convert to COO format (generate a column index)
var colIndex = [];
for (var i = 0; i < m._ptr.length; i++) {
for (var j = 0; j < m._ptr[i + 1] - m._ptr[i]; j++) {
colIndex.push(i);
}
} // Clone the values array
var values = m._values.slice(); // Clone the row index array
var rowIndex = m._index.slice(); // Transform the (row, column) indices
for (var _i = 0; _i < m._index.length; _i++) {
var r1 = rowIndex[_i];
var c1 = colIndex[_i];
var flat = r1 * m._size[1] + c1;
colIndex[_i] = flat % size[1];
rowIndex[_i] = Math.floor(flat / size[1]);
} // Now reshaping is supposed to preserve the row-major order, BUT these sparse matrices are stored
// in column-major order, so we have to reorder the value array now. One option is to use a multisort,
// sorting several arrays based on some other array.
// OR, we could easily just:
// 1. Remove all values from the matrix
m._values.length = 0;
m._index.length = 0;
m._ptr.length = size[1] + 1;
m._size = size.slice();
for (var _i2 = 0; _i2 < m._ptr.length; _i2++) {
m._ptr[_i2] = 0;
} // 2. Re-insert all elements in the proper order (simplified code from SparseMatrix.prototype.set)
// This step is probably the most time-consuming
for (var h = 0; h < values.length; h++) {
var _i3 = rowIndex[h];
var _j = colIndex[h];
var v = values[h];
var k = _getValueIndex(_i3, m._ptr[_j], m._ptr[_j + 1], m._index);
_insert(k, _i3, _j, v, m._values, m._index, m._ptr);
} // The value indices are inserted out of order, but apparently that's... still OK?
return m;
};
/**
* Create a clone of the matrix
* @memberof SparseMatrix
* @return {SparseMatrix} clone
*/
SparseMatrix.prototype.clone = function () {
var m = new SparseMatrix({
values: this._values ? Object(utils_object["a" /* clone */])(this._values) : undefined,
index: Object(utils_object["a" /* clone */])(this._index),
ptr: Object(utils_object["a" /* clone */])(this._ptr),
size: Object(utils_object["a" /* clone */])(this._size),
datatype: this._datatype
});
return m;
};
/**
* Retrieve the size of the matrix.
* @memberof SparseMatrix
* @returns {number[]} size
*/
SparseMatrix.prototype.size = function () {
return this._size.slice(0); // copy the Array
};
/**
* Create a new matrix with the results of the callback function executed on
* each entry of the matrix.
* @memberof SparseMatrix
* @param {Function} callback The callback function is invoked with three
* parameters: the value of the element, the index
* of the element, and the Matrix being traversed.
* @param {boolean} [skipZeros] Invoke callback function for non-zero values only.
*
* @return {SparseMatrix} matrix
*/
SparseMatrix.prototype.map = function (callback, skipZeros) {
// check it is a pattern matrix
if (!this._values) {
throw new Error('Cannot invoke map on a Pattern only matrix');
} // matrix instance
var me = this; // rows and columns
var rows = this._size[0];
var columns = this._size[1]; // invoke callback
var invoke = function invoke(v, i, j) {
// invoke callback
return callback(v, [i, j], me);
}; // invoke _map
return _map(this, 0, rows - 1, 0, columns - 1, invoke, skipZeros);
};
/**
* Create a new matrix with the results of the callback function executed on the interval
* [minRow..maxRow, minColumn..maxColumn].
*/
function _map(matrix, minRow, maxRow, minColumn, maxColumn, callback, skipZeros) {
// result arrays
var values = [];
var index = [];
var ptr = []; // equal signature to use
var eq = equalScalar; // zero value
var zero = 0;
if (Object(is["I" /* isString */])(matrix._datatype)) {
// find signature that matches (datatype, datatype)
eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar; // convert 0 to the same datatype
zero = typed.convert(0, matrix._datatype);
} // invoke callback
var invoke = function invoke(v, x, y) {
// invoke callback
v = callback(v, x, y); // check value != 0
if (!eq(v, zero)) {
// store value
values.push(v); // index
index.push(x);
}
}; // loop columns
for (var j = minColumn; j <= maxColumn; j++) {
// store pointer to values index
ptr.push(values.length); // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
var k0 = matrix._ptr[j];
var k1 = matrix._ptr[j + 1];
if (skipZeros) {
// loop k within [k0, k1[
for (var k = k0; k < k1; k++) {
// row index
var i = matrix._index[k]; // check i is in range
if (i >= minRow && i <= maxRow) {
// value @ k
invoke(matrix._values[k], i - minRow, j - minColumn);
}
}
} else {
// create a cache holding all defined values
var _values = {};
for (var _k = k0; _k < k1; _k++) {
var _i4 = matrix._index[_k];
_values[_i4] = matrix._values[_k];
} // loop over all rows (indexes can be unordered so we can't use that),
// and either read the value or zero
for (var _i5 = minRow; _i5 <= maxRow; _i5++) {
var value = _i5 in _values ? _values[_i5] : 0;
invoke(value, _i5 - minRow, j - minColumn);
}
}
} // store number of values in ptr
ptr.push(values.length); // return sparse matrix
return new SparseMatrix({
values: values,
index: index,
ptr: ptr,
size: [maxRow - minRow + 1, maxColumn - minColumn + 1]
});
}
/**
* Execute a callback function on each entry of the matrix.
* @memberof SparseMatrix
* @param {Function} callback The callback function is invoked with three
* parameters: the value of the element, the index
* of the element, and the Matrix being traversed.
* @param {boolean} [skipZeros] Invoke callback function for non-zero values only.
*/
SparseMatrix.prototype.forEach = function (callback, skipZeros) {
// check it is a pattern matrix
if (!this._values) {
throw new Error('Cannot invoke forEach on a Pattern only matrix');
} // matrix instance
var me = this; // rows and columns
var rows = this._size[0];
var columns = this._size[1]; // loop columns
for (var j = 0; j < columns; j++) {
// k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
var k0 = this._ptr[j];
var k1 = this._ptr[j + 1];
if (skipZeros) {
// loop k within [k0, k1[
for (var k = k0; k < k1; k++) {
// row index
var i = this._index[k]; // value @ k
callback(this._values[k], [i, j], me);
}
} else {
// create a cache holding all defined values
var values = {};
for (var _k2 = k0; _k2 < k1; _k2++) {
var _i6 = this._index[_k2];
values[_i6] = this._values[_k2];
} // loop over all rows (indexes can be unordered so we can't use that),
// and either read the value or zero
for (var _i7 = 0; _i7 < rows; _i7++) {
var value = _i7 in values ? values[_i7] : 0;
callback(value, [_i7, j], me);
}
}
}
};
/**
* Create an Array with a copy of the data of the SparseMatrix
* @memberof SparseMatrix
* @returns {Array} array
*/
SparseMatrix.prototype.toArray = function () {
return _toArray(this._values, this._index, this._ptr, this._size, true);
};
/**
* Get the primitive value of the SparseMatrix: a two dimensions array
* @memberof SparseMatrix
* @returns {Array} array
*/
SparseMatrix.prototype.valueOf = function () {
return _toArray(this._values, this._index, this._ptr, this._size, false);
};
function _toArray(values, index, ptr, size, copy) {
// rows and columns
var rows = size[0];
var columns = size[1]; // result
var a = []; // vars
var i, j; // initialize array
for (i = 0; i < rows; i++) {
a[i] = [];
for (j = 0; j < columns; j++) {
a[i][j] = 0;
}
} // loop columns
for (j = 0; j < columns; j++) {
// k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
var k0 = ptr[j];
var k1 = ptr[j + 1]; // loop k within [k0, k1[
for (var k = k0; k < k1; k++) {
// row index
i = index[k]; // set value (use one for pattern matrix)
a[i][j] = values ? copy ? Object(utils_object["a" /* clone */])(values[k]) : values[k] : 1;
}
}
return a;
}
/**
* Get a string representation of the matrix, with optional formatting options.
* @memberof SparseMatrix
* @param {Object | number | Function} [options] Formatting options. See
* lib/utils/number:format for a
* description of the available
* options.
* @returns {string} str
*/
SparseMatrix.prototype.format = function (options) {
// rows and columns
var rows = this._size[0];
var columns = this._size[1]; // density
var density = this.density(); // rows & columns
var str = 'Sparse Matrix [' + Object(utils_string["d" /* format */])(rows, options) + ' x ' + Object(utils_string["d" /* format */])(columns, options) + '] density: ' + Object(utils_string["d" /* format */])(density, options) + '\n'; // loop columns
for (var j = 0; j < columns; j++) {
// k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
var k0 = this._ptr[j];
var k1 = this._ptr[j + 1]; // loop k within [k0, k1[
for (var k = k0; k < k1; k++) {
// row index
var i = this._index[k]; // append value
str += '\n (' + Object(utils_string["d" /* format */])(i, options) + ', ' + Object(utils_string["d" /* format */])(j, options) + ') ==> ' + (this._values ? Object(utils_string["d" /* format */])(this._values[k], options) : 'X');
}
}
return str;
};
/**
* Get a string representation of the matrix
* @memberof SparseMatrix
* @returns {string} str
*/
SparseMatrix.prototype.toString = function () {
return Object(utils_string["d" /* format */])(this.toArray());
};
/**
* Get a JSON representation of the matrix
* @memberof SparseMatrix
* @returns {Object}
*/
SparseMatrix.prototype.toJSON = function () {
return {
mathjs: 'SparseMatrix',
values: this._values,
index: this._index,
ptr: this._ptr,
size: this._size,
datatype: this._datatype
};
};
/**
* Get the kth Matrix diagonal.
*
* @memberof SparseMatrix
* @param {number | BigNumber} [k=0] The kth diagonal where the vector will retrieved.
*
* @returns {Matrix} The matrix vector with the diagonal values.
*/
SparseMatrix.prototype.diagonal = function (k) {
// validate k if any
if (k) {
// convert BigNumber to a number
if (Object(is["e" /* isBigNumber */])(k)) {
k = k.toNumber();
} // is must be an integer
if (!Object(is["y" /* isNumber */])(k) || !Object(utils_number["i" /* isInteger */])(k)) {
throw new TypeError('The parameter k must be an integer number');
}
} else {
// default value
k = 0;
}
var kSuper = k > 0 ? k : 0;
var kSub = k < 0 ? -k : 0; // rows & columns
var rows = this._size[0];
var columns = this._size[1]; // number diagonal values
var n = Math.min(rows - kSub, columns - kSuper); // diagonal arrays
var values = [];
var index = [];
var ptr = []; // initial ptr value
ptr[0] = 0; // loop columns
for (var j = kSuper; j < columns && values.length < n; j++) {
// k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
var k0 = this._ptr[j];
var k1 = this._ptr[j + 1]; // loop x within [k0, k1[
for (var x = k0; x < k1; x++) {
// row index
var i = this._index[x]; // check row
if (i === j - kSuper + kSub) {
// value on this column
values.push(this._values[x]); // store row
index[values.length - 1] = i - kSub; // exit loop
break;
}
}
} // close ptr
ptr.push(values.length); // return matrix
return new SparseMatrix({
values: values,
index: index,
ptr: ptr,
size: [n, 1]
});
};
/**
* Generate a matrix from a JSON object
* @memberof SparseMatrix
* @param {Object} json An object structured like
* `{"mathjs": "SparseMatrix", "values": [], "index": [], "ptr": [], "size": []}`,
* where mathjs is optional
* @returns {SparseMatrix}
*/
SparseMatrix.fromJSON = function (json) {
return new SparseMatrix(json);
};
/**
* Create a diagonal matrix.
*
* @memberof SparseMatrix
* @param {Array} size The matrix size.
* @param {number | Array | Matrix } value The values for the diagonal.
* @param {number | BigNumber} [k=0] The kth diagonal where the vector will be filled in.
* @param {number} [defaultValue] The default value for non-diagonal
* @param {string} [datatype] The Matrix datatype, values must be of this datatype.
*
* @returns {SparseMatrix}
*/
SparseMatrix.diagonal = function (size, value, k, defaultValue, datatype) {
if (!Object(is["b" /* isArray */])(size)) {
throw new TypeError('Array expected, size parameter');
}
if (size.length !== 2) {
throw new Error('Only two dimensions matrix are supported');
} // map size & validate
size = size.map(function (s) {
// check it is a big number
if (Object(is["e" /* isBigNumber */])(s)) {
// convert it
s = s.toNumber();
} // validate arguments
if (!Object(is["y" /* isNumber */])(s) || !Object(utils_number["i" /* isInteger */])(s) || s < 1) {
throw new Error('Size values must be positive integers');
}
return s;
}); // validate k if any
if (k) {
// convert BigNumber to a number
if (Object(is["e" /* isBigNumber */])(k)) {
k = k.toNumber();
} // is must be an integer
if (!Object(is["y" /* isNumber */])(k) || !Object(utils_number["i" /* isInteger */])(k)) {
throw new TypeError('The parameter k must be an integer number');
}
} else {
// default value
k = 0;
} // equal signature to use
var eq = equalScalar; // zero value
var zero = 0;
if (Object(is["I" /* isString */])(datatype)) {
// find signature that matches (datatype, datatype)
eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar; // convert 0 to the same datatype
zero = typed.convert(0, datatype);
}
var kSuper = k > 0 ? k : 0;
var kSub = k < 0 ? -k : 0; // rows and columns
var rows = size[0];
var columns = size[1]; // number of non-zero items
var n = Math.min(rows - kSub, columns - kSuper); // value extraction function
var _value; // check value
if (Object(is["b" /* isArray */])(value)) {
// validate array
if (value.length !== n) {
// number of values in array must be n
throw new Error('Invalid value array length');
} // define function
_value = function _value(i) {
// return value @ i
return value[i];
};
} else if (Object(is["v" /* isMatrix */])(value)) {
// matrix size
var ms = value.size(); // validate matrix
if (ms.length !== 1 || ms[0] !== n) {
// number of values in array must be n
throw new Error('Invalid matrix length');
} // define function
_value = function _value(i) {
// return value @ i
return value.get([i]);
};
} else {
// define function
_value = function _value() {
// return value
return value;
};
} // create arrays
var values = [];
var index = [];
var ptr = []; // loop items
for (var j = 0; j < columns; j++) {
// number of rows with value
ptr.push(values.length); // diagonal index
var i = j - kSuper; // check we need to set diagonal value
if (i >= 0 && i < n) {
// get value @ i
var v = _value(i); // check for zero
if (!eq(v, zero)) {
// column
index.push(i + kSub); // add value
values.push(v);
}
}
} // last value should be number of values
ptr.push(values.length); // create SparseMatrix
return new SparseMatrix({
values: values,
index: index,
ptr: ptr,
size: [rows, columns]
});
};
/**
* Swap rows i and j in Matrix.
*
* @memberof SparseMatrix
* @param {number} i Matrix row index 1
* @param {number} j Matrix row index 2
*
* @return {Matrix} The matrix reference
*/
SparseMatrix.prototype.swapRows = function (i, j) {
// check index
if (!Object(is["y" /* isNumber */])(i) || !Object(utils_number["i" /* isInteger */])(i) || !Object(is["y" /* isNumber */])(j) || !Object(utils_number["i" /* isInteger */])(j)) {
throw new Error('Row index must be positive integers');
} // check dimensions
if (this._size.length !== 2) {
throw new Error('Only two dimensional matrix is supported');
} // validate index
Object(utils_array["q" /* validateIndex */])(i, this._size[0]);
Object(utils_array["q" /* validateIndex */])(j, this._size[0]); // swap rows
SparseMatrix._swapRows(i, j, this._size[1], this._values, this._index, this._ptr); // return current instance
return this;
};
/**
* Loop rows with data in column j.
*
* @param {number} j Column
* @param {Array} values Matrix values
* @param {Array} index Matrix row indeces
* @param {Array} ptr Matrix column pointers
* @param {Function} callback Callback function invoked for every row in column j
*/
SparseMatrix._forEachRow = function (j, values, index, ptr, callback) {
// indeces for column j
var k0 = ptr[j];
var k1 = ptr[j + 1]; // loop
for (var k = k0; k < k1; k++) {
// invoke callback
callback(index[k], values[k]);
}
};
/**
* Swap rows x and y in Sparse Matrix data structures.
*
* @param {number} x Matrix row index 1
* @param {number} y Matrix row index 2
* @param {number} columns Number of columns in matrix
* @param {Array} values Matrix values
* @param {Array} index Matrix row indeces
* @param {Array} ptr Matrix column pointers
*/
SparseMatrix._swapRows = function (x, y, columns, values, index, ptr) {
// loop columns
for (var j = 0; j < columns; j++) {
// k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
var k0 = ptr[j];
var k1 = ptr[j + 1]; // find value index @ x
var kx = _getValueIndex(x, k0, k1, index); // find value index @ x
var ky = _getValueIndex(y, k0, k1, index); // check both rows exist in matrix
if (kx < k1 && ky < k1 && index[kx] === x && index[ky] === y) {
// swap values (check for pattern matrix)
if (values) {
var v = values[kx];
values[kx] = values[ky];
values[ky] = v;
} // next column
continue;
} // check x row exist & no y row
if (kx < k1 && index[kx] === x && (ky >= k1 || index[ky] !== y)) {
// value @ x (check for pattern matrix)
var vx = values ? values[kx] : undefined; // insert value @ y
index.splice(ky, 0, y);
if (values) {
values.splice(ky, 0, vx);
} // remove value @ x (adjust array index if needed)
index.splice(ky <= kx ? kx + 1 : kx, 1);
if (values) {
values.splice(ky <= kx ? kx + 1 : kx, 1);
} // next column
continue;
} // check y row exist & no x row
if (ky < k1 && index[ky] === y && (kx >= k1 || index[kx] !== x)) {
// value @ y (check for pattern matrix)
var vy = values ? values[ky] : undefined; // insert value @ x
index.splice(kx, 0, x);
if (values) {
values.splice(kx, 0, vy);
} // remove value @ y (adjust array index if needed)
index.splice(kx <= ky ? ky + 1 : ky, 1);
if (values) {
values.splice(kx <= ky ? ky + 1 : ky, 1);
}
}
}
};
return SparseMatrix;
}, {
isClass: true
});
// CONCATENATED MODULE: ./src/type/number.js
var number_name = 'number';
var number_dependencies = ['typed'];
var createNumber = /* #__PURE__ */Object(factory["a" /* factory */])(number_name, number_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Create a number or convert a string, boolean, or unit to a number.
* When value is a matrix, all elements will be converted to number.
*
* Syntax:
*
* math.number(value)
* math.number(unit, valuelessUnit)
*
* Examples:
*
* math.number(2) // returns number 2
* math.number('7.2') // returns number 7.2
* math.number(true) // returns number 1
* math.number([true, false, true, true]) // returns [1, 0, 1, 1]
* math.number(math.unit('52cm'), 'm') // returns 0.52
*
* See also:
*
* bignumber, boolean, complex, index, matrix, string, unit
*
* @param {string | number | BigNumber | Fraction | boolean | Array | Matrix | Unit | null} [value] Value to be converted
* @param {Unit | string} [valuelessUnit] A valueless unit, used to convert a unit to a number
* @return {number | Array | Matrix} The created number
*/
var number = typed('number', {
'': function _() {
return 0;
},
number: function number(x) {
return x;
},
string: function string(x) {
if (x === 'NaN') return NaN;
var num = Number(x);
if (isNaN(num)) {
throw new SyntaxError('String "' + x + '" is no valid number');
}
return num;
},
BigNumber: function BigNumber(x) {
return x.toNumber();
},
Fraction: function Fraction(x) {
return x.valueOf();
},
Unit: function Unit(x) {
throw new Error('Second argument with valueless unit expected');
},
"null": function _null(x) {
return 0;
},
'Unit, string | Unit': function UnitStringUnit(unit, valuelessUnit) {
return unit.toNumber(valuelessUnit);
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
}); // reviver function to parse a JSON object like:
//
// {"mathjs":"number","value":"2.3"}
//
// into a number 2.3
number.fromJSON = function (json) {
return parseFloat(json.value);
};
return number;
});
// CONCATENATED MODULE: ./src/type/string.js
var string_name = 'string';
var string_dependencies = ['typed'];
var createString = /* #__PURE__ */Object(factory["a" /* factory */])(string_name, string_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Create a string or convert any object into a string.
* Elements of Arrays and Matrices are processed element wise.
*
* Syntax:
*
* math.string(value)
*
* Examples:
*
* math.string(4.2) // returns string '4.2'
* math.string(math.complex(3, 2) // returns string '3 + 2i'
*
* const u = math.unit(5, 'km')
* math.string(u.to('m')) // returns string '5000 m'
*
* math.string([true, false]) // returns ['true', 'false']
*
* See also:
*
* bignumber, boolean, complex, index, matrix, number, unit
*
* @param {* | Array | Matrix | null} [value] A value to convert to a string
* @return {string | Array | Matrix} The created string
*/
return typed(string_name, {
'': function _() {
return '';
},
number: utils_number["h" /* format */],
"null": function _null(x) {
return 'null';
},
"boolean": function boolean(x) {
return x + '';
},
string: function string(x) {
return x;
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
},
any: function any(x) {
return String(x);
}
});
});
// CONCATENATED MODULE: ./src/type/boolean.js
var boolean_name = 'boolean';
var boolean_dependencies = ['typed'];
var createBoolean = /* #__PURE__ */Object(factory["a" /* factory */])(boolean_name, boolean_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Create a boolean or convert a string or number to a boolean.
* In case of a number, `true` is returned for non-zero numbers, and `false` in
* case of zero.
* Strings can be `'true'` or `'false'`, or can contain a number.
* When value is a matrix, all elements will be converted to boolean.
*
* Syntax:
*
* math.boolean(x)
*
* Examples:
*
* math.boolean(0) // returns false
* math.boolean(1) // returns true
* math.boolean(-3) // returns true
* math.boolean('true') // returns true
* math.boolean('false') // returns false
* math.boolean([1, 0, 1, 1]) // returns [true, false, true, true]
*
* See also:
*
* bignumber, complex, index, matrix, string, unit
*
* @param {string | number | boolean | Array | Matrix | null} value A value of any type
* @return {boolean | Array | Matrix} The boolean value
*/
return typed(boolean_name, {
'': function _() {
return false;
},
"boolean": function boolean(x) {
return x;
},
number: function number(x) {
return !!x;
},
"null": function _null(x) {
return false;
},
BigNumber: function BigNumber(x) {
return !x.isZero();
},
string: function string(x) {
// try case insensitive
var lcase = x.toLowerCase();
if (lcase === 'true') {
return true;
} else if (lcase === 'false') {
return false;
} // test whether value is a valid number
var num = Number(x);
if (x !== '' && !isNaN(num)) {
return !!num;
}
throw new Error('Cannot convert "' + x + '" to a boolean');
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/type/bignumber/function/bignumber.js
var bignumber_name = 'bignumber';
var bignumber_dependencies = ['typed', 'BigNumber'];
var createBignumber = /* #__PURE__ */Object(factory["a" /* factory */])(bignumber_name, bignumber_dependencies, function (_ref) {
var typed = _ref.typed,
BigNumber = _ref.BigNumber;
/**
* Create a BigNumber, which can store numbers with arbitrary precision.
* When a matrix is provided, all elements will be converted to BigNumber.
*
* Syntax:
*
* math.bignumber(x)
*
* Examples:
*
* 0.1 + 0.2 // returns number 0.30000000000000004
* math.bignumber(0.1) + math.bignumber(0.2) // returns BigNumber 0.3
*
*
* 7.2e500 // returns number Infinity
* math.bignumber('7.2e500') // returns BigNumber 7.2e500
*
* See also:
*
* boolean, complex, index, matrix, string, unit
*
* @param {number | string | Fraction | BigNumber | Array | Matrix | boolean | null} [value] Value for the big number,
* 0 by default.
* @returns {BigNumber} The created bignumber
*/
return typed('bignumber', {
'': function _() {
return new BigNumber(0);
},
number: function number(x) {
// convert to string to prevent errors in case of >15 digits
return new BigNumber(x + '');
},
string: function string(x) {
return new BigNumber(x);
},
BigNumber: function BigNumber(x) {
// we assume a BigNumber is immutable
return x;
},
Fraction: function Fraction(x) {
return new BigNumber(x.n).div(x.d).times(x.s);
},
"null": function _null(x) {
return new BigNumber(0);
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/type/complex/function/complex.js
var complex_name = 'complex';
var complex_dependencies = ['typed', 'Complex'];
var createComplex = /* #__PURE__ */Object(factory["a" /* factory */])(complex_name, complex_dependencies, function (_ref) {
var typed = _ref.typed,
Complex = _ref.Complex;
/**
* Create a complex value or convert a value to a complex value.
*
* Syntax:
*
* math.complex() // creates a complex value with zero
* // as real and imaginary part.
* math.complex(re : number, im : string) // creates a complex value with provided
* // values for real and imaginary part.
* math.complex(re : number) // creates a complex value with provided
* // real value and zero imaginary part.
* math.complex(complex : Complex) // clones the provided complex value.
* math.complex(arg : string) // parses a string into a complex value.
* math.complex(array : Array) // converts the elements of the array
* // or matrix element wise into a
* // complex value.
* math.complex({re: number, im: number}) // creates a complex value with provided
* // values for real an imaginary part.
* math.complex({r: number, phi: number}) // creates a complex value with provided
* // polar coordinates
*
* Examples:
*
* const a = math.complex(3, -4) // a = Complex 3 - 4i
* a.re = 5 // a = Complex 5 - 4i
* const i = a.im // Number -4
* const b = math.complex('2 + 6i') // Complex 2 + 6i
* const c = math.complex() // Complex 0 + 0i
* const d = math.add(a, b) // Complex 5 + 2i
*
* See also:
*
* bignumber, boolean, index, matrix, number, string, unit
*
* @param {* | Array | Matrix} [args]
* Arguments specifying the real and imaginary part of the complex number
* @return {Complex | Array | Matrix} Returns a complex value
*/
return typed('complex', {
'': function _() {
return Complex.ZERO;
},
number: function number(x) {
return new Complex(x, 0);
},
'number, number': function numberNumber(re, im) {
return new Complex(re, im);
},
// TODO: this signature should be redundant
'BigNumber, BigNumber': function BigNumberBigNumber(re, im) {
return new Complex(re.toNumber(), im.toNumber());
},
Fraction: function Fraction(x) {
return new Complex(x.valueOf(), 0);
},
Complex: function Complex(x) {
return x.clone();
},
string: function string(x) {
return Complex(x); // for example '2 + 3i'
},
"null": function _null(x) {
return Complex(0);
},
Object: function Object(x) {
if ('re' in x && 'im' in x) {
return new Complex(x.re, x.im);
}
if ('r' in x && 'phi' in x || 'abs' in x && 'arg' in x) {
return new Complex(x);
}
throw new Error('Expected object with properties (re and im) or (r and phi) or (abs and arg)');
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/type/fraction/function/fraction.js
var fraction_name = 'fraction';
var fraction_dependencies = ['typed', 'Fraction'];
var createFraction = /* #__PURE__ */Object(factory["a" /* factory */])(fraction_name, fraction_dependencies, function (_ref) {
var typed = _ref.typed,
Fraction = _ref.Fraction;
/**
* Create a fraction convert a value to a fraction.
*
* Syntax:
* math.fraction(numerator, denominator)
* math.fraction({n: numerator, d: denominator})
* math.fraction(matrix: Array | Matrix) Turn all matrix entries
* into fractions
*
* Examples:
*
* math.fraction(1, 3)
* math.fraction('2/3')
* math.fraction({n: 2, d: 3})
* math.fraction([0.2, 0.25, 1.25])
*
* See also:
*
* bignumber, number, string, unit
*
* @param {number | string | Fraction | BigNumber | Array | Matrix} [args]
* Arguments specifying the numerator and denominator of
* the fraction
* @return {Fraction | Array | Matrix} Returns a fraction
*/
return typed('fraction', {
number: function number(x) {
if (!isFinite(x) || isNaN(x)) {
throw new Error(x + ' cannot be represented as a fraction');
}
return new Fraction(x);
},
string: function string(x) {
return new Fraction(x);
},
'number, number': function numberNumber(numerator, denominator) {
return new Fraction(numerator, denominator);
},
"null": function _null(x) {
return new Fraction(0);
},
BigNumber: function BigNumber(x) {
return new Fraction(x.toString());
},
Fraction: function Fraction(x) {
return x; // fractions are immutable
},
Object: function Object(x) {
return new Fraction(x);
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/type/matrix/function/matrix.js
var matrix_name = 'matrix';
var matrix_dependencies = ['typed', 'Matrix', 'DenseMatrix', 'SparseMatrix'];
var createMatrix = /* #__PURE__ */Object(factory["a" /* factory */])(matrix_name, matrix_dependencies, function (_ref) {
var typed = _ref.typed,
Matrix = _ref.Matrix,
DenseMatrix = _ref.DenseMatrix,
SparseMatrix = _ref.SparseMatrix;
/**
* Create a Matrix. The function creates a new `math.Matrix` object from
* an `Array`. A Matrix has utility functions to manipulate the data in the
* matrix, like getting the size and getting or setting values in the matrix.
* Supported storage formats are 'dense' and 'sparse'.
*
* Syntax:
*
* math.matrix() // creates an empty matrix using default storage format (dense).
* math.matrix(data) // creates a matrix with initial data using default storage format (dense).
* math.matrix('dense') // creates an empty matrix using the given storage format.
* math.matrix(data, 'dense') // creates a matrix with initial data using the given storage format.
* math.matrix(data, 'sparse') // creates a sparse matrix with initial data.
* math.matrix(data, 'sparse', 'number') // creates a sparse matrix with initial data, number data type.
*
* Examples:
*
* let m = math.matrix([[1, 2], [3, 4]])
* m.size() // Array [2, 2]
* m.resize([3, 2], 5)
* m.valueOf() // Array [[1, 2], [3, 4], [5, 5]]
* m.get([1, 0]) // number 3
*
* See also:
*
* bignumber, boolean, complex, index, number, string, unit, sparse
*
* @param {Array | Matrix} [data] A multi dimensional array
* @param {string} [format] The Matrix storage format
*
* @return {Matrix} The created matrix
*/
return typed(matrix_name, {
'': function _() {
return _create([]);
},
string: function string(format) {
return _create([], format);
},
'string, string': function stringString(format, datatype) {
return _create([], format, datatype);
},
Array: function Array(data) {
return _create(data);
},
Matrix: function Matrix(data) {
return _create(data, data.storage());
},
'Array | Matrix, string': _create,
'Array | Matrix, string, string': _create
});
/**
* Create a new Matrix with given storage format
* @param {Array} data
* @param {string} [format]
* @param {string} [datatype]
* @returns {Matrix} Returns a new Matrix
* @private
*/
function _create(data, format, datatype) {
// get storage format constructor
if (format === 'dense' || format === 'default' || format === undefined) {
return new DenseMatrix(data, datatype);
}
if (format === 'sparse') {
return new SparseMatrix(data, datatype);
}
throw new TypeError('Unknown matrix type ' + JSON.stringify(format) + '.');
}
});
// CONCATENATED MODULE: ./src/type/unit/function/splitUnit.js
var splitUnit_name = 'splitUnit';
var splitUnit_dependencies = ['typed'];
var createSplitUnit = /* #__PURE__ */Object(factory["a" /* factory */])(splitUnit_name, splitUnit_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Split a unit in an array of units whose sum is equal to the original unit.
*
* Syntax:
*
* splitUnit(unit: Unit, parts: Array.<Unit>)
*
* Example:
*
* math.splitUnit(new Unit(1, 'm'), ['feet', 'inch'])
* // [ 3 feet, 3.3700787401575 inch ]
*
* See also:
*
* unit
*
* @param {Array} [parts] An array of strings or valueless units.
* @return {Array} An array of units.
*/
return typed(splitUnit_name, {
'Unit, Array': function UnitArray(unit, parts) {
return unit.splitUnit(parts);
}
});
});
// CONCATENATED MODULE: ./src/plain/number/arithmetic.js
var arithmetic_n1 = 'number';
var arithmetic_n2 = 'number, number';
function absNumber(a) {
return Math.abs(a);
}
absNumber.signature = arithmetic_n1;
function addNumber(a, b) {
return a + b;
}
addNumber.signature = arithmetic_n2;
function subtractNumber(a, b) {
return a - b;
}
subtractNumber.signature = arithmetic_n2;
function multiplyNumber(a, b) {
return a * b;
}
multiplyNumber.signature = arithmetic_n2;
function divideNumber(a, b) {
return a / b;
}
divideNumber.signature = arithmetic_n2;
function unaryMinusNumber(x) {
return -x;
}
unaryMinusNumber.signature = arithmetic_n1;
function unaryPlusNumber(x) {
return x;
}
unaryPlusNumber.signature = arithmetic_n1;
function cbrtNumber(x) {
return Object(utils_number["d" /* cbrt */])(x);
}
cbrtNumber.signature = arithmetic_n1;
function ceilNumber(x) {
return Math.ceil(x);
}
ceilNumber.signature = arithmetic_n1;
function cubeNumber(x) {
return x * x * x;
}
cubeNumber.signature = arithmetic_n1;
function expNumber(x) {
return Math.exp(x);
}
expNumber.signature = arithmetic_n1;
function expm1Number(x) {
return Object(utils_number["g" /* expm1 */])(x);
}
expm1Number.signature = arithmetic_n1;
function fixNumber(x) {
return x > 0 ? Math.floor(x) : Math.ceil(x);
}
fixNumber.signature = arithmetic_n1;
function floorNumber(x) {
return Math.floor(x);
}
floorNumber.signature = arithmetic_n1;
/**
* Calculate gcd for numbers
* @param {number} a
* @param {number} b
* @returns {number} Returns the greatest common denominator of a and b
*/
function gcdNumber(a, b) {
if (!Object(utils_number["i" /* isInteger */])(a) || !Object(utils_number["i" /* isInteger */])(b)) {
throw new Error('Parameters in function gcd must be integer numbers');
} // https://en.wikipedia.org/wiki/Euclidean_algorithm
var r;
while (b !== 0) {
r = a % b;
a = b;
b = r;
}
return a < 0 ? -a : a;
}
gcdNumber.signature = arithmetic_n2;
/**
* Calculate lcm for two numbers
* @param {number} a
* @param {number} b
* @returns {number} Returns the least common multiple of a and b
*/
function lcmNumber(a, b) {
if (!Object(utils_number["i" /* isInteger */])(a) || !Object(utils_number["i" /* isInteger */])(b)) {
throw new Error('Parameters in function lcm must be integer numbers');
}
if (a === 0 || b === 0) {
return 0;
} // https://en.wikipedia.org/wiki/Euclidean_algorithm
// evaluate lcm here inline to reduce overhead
var t;
var prod = a * b;
while (b !== 0) {
t = b;
b = a % t;
a = t;
}
return Math.abs(prod / a);
}
lcmNumber.signature = arithmetic_n2;
/**
* Calculate the logarithm of a value.
* @param {number} x
* @return {number}
*/
function logNumber(x) {
return Math.log(x);
}
logNumber.signature = arithmetic_n1;
/**
* Calculate the 10-base logarithm of a number
* @param {number} x
* @return {number}
*/
function log10Number(x) {
return Object(utils_number["j" /* log10 */])(x);
}
log10Number.signature = arithmetic_n1;
/**
* Calculate the 2-base logarithm of a number
* @param {number} x
* @return {number}
*/
function log2Number(x) {
return Object(utils_number["l" /* log2 */])(x);
}
log2Number.signature = arithmetic_n1;
/**
* Calculate the natural logarithm of a `number+1`
* @param {number} x
* @returns {number}
*/
function log1pNumber(x) {
return Object(utils_number["k" /* log1p */])(x);
}
log1pNumber.signature = arithmetic_n1;
/**
* Calculate the modulus of two numbers
* @param {number} x
* @param {number} y
* @returns {number} res
* @private
*/
function modNumber(x, y) {
if (y > 0) {
// We don't use JavaScript's % operator here as this doesn't work
// correctly for x < 0 and x === 0
// see https://en.wikipedia.org/wiki/Modulo_operation
return x - y * Math.floor(x / y);
} else if (y === 0) {
return x;
} else {
// y < 0
// TODO: implement mod for a negative divisor
throw new Error('Cannot calculate mod for a negative divisor');
}
}
modNumber.signature = arithmetic_n2;
/**
* Calculate the nth root of a, solve x^root == a
* http://rosettacode.org/wiki/Nth_root#JavaScript
* @param {number} a
* @param {number} root
* @private
*/
function nthRootNumber(a, root) {
var inv = root < 0;
if (inv) {
root = -root;
}
if (root === 0) {
throw new Error('Root must be non-zero');
}
if (a < 0 && Math.abs(root) % 2 !== 1) {
throw new Error('Root must be odd when a is negative.');
} // edge cases zero and infinity
if (a === 0) {
return inv ? Infinity : 0;
}
if (!isFinite(a)) {
return inv ? 0 : a;
}
var x = Math.pow(Math.abs(a), 1 / root); // If a < 0, we require that root is an odd integer,
// so (-1) ^ (1/root) = -1
x = a < 0 ? -x : x;
return inv ? 1 / x : x; // Very nice algorithm, but fails with nthRoot(-2, 3).
// Newton's method has some well-known problems at times:
// https://en.wikipedia.org/wiki/Newton%27s_method#Failure_analysis
/*
let x = 1 // Initial guess
let xPrev = 1
let i = 0
const iMax = 10000
do {
const delta = (a / Math.pow(x, root - 1) - x) / root
xPrev = x
x = x + delta
i++
}
while (xPrev !== x && i < iMax)
if (xPrev !== x) {
throw new Error('Function nthRoot failed to converge')
}
return inv ? 1 / x : x
*/
}
nthRootNumber.signature = arithmetic_n2;
function signNumber(x) {
return Object(utils_number["n" /* sign */])(x);
}
signNumber.signature = arithmetic_n1;
function sqrtNumber(x) {
return Math.sqrt(x);
}
sqrtNumber.signature = arithmetic_n1;
function squareNumber(x) {
return x * x;
}
squareNumber.signature = arithmetic_n1;
/**
* Calculate xgcd for two numbers
* @param {number} a
* @param {number} b
* @return {number} result
* @private
*/
function xgcdNumber(a, b) {
// source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm
var t; // used to swap two variables
var q; // quotient
var r; // remainder
var x = 0;
var lastx = 1;
var y = 1;
var lasty = 0;
if (!Object(utils_number["i" /* isInteger */])(a) || !Object(utils_number["i" /* isInteger */])(b)) {
throw new Error('Parameters in function xgcd must be integer numbers');
}
while (b) {
q = Math.floor(a / b);
r = a - q * b;
t = x;
x = lastx - q * x;
lastx = t;
t = y;
y = lasty - q * y;
lasty = t;
a = b;
b = r;
}
var res;
if (a < 0) {
res = [-a, -lastx, -lasty];
} else {
res = [a, a ? lastx : 0, lasty];
}
return res;
}
xgcdNumber.signature = arithmetic_n2;
/**
* Calculates the power of x to y, x^y, for two numbers.
* @param {number} x
* @param {number} y
* @return {number} res
*/
function powNumber(x, y) {
// 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 Math.pow(x, y);
}
powNumber.signature = arithmetic_n2;
/**
* round a number to the given number of decimals, or to zero if decimals is
* not provided
* @param {number} value
* @param {number} decimals number of decimals, between 0 and 15 (0 by default)
* @return {number} roundedValue
*/
function roundNumber(value) {
var decimals = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
return parseFloat(Object(utils_number["q" /* toFixed */])(value, decimals));
}
roundNumber.signature = arithmetic_n2;
/**
* Calculate the norm of a number, the absolute value.
* @param {number} x
* @return {number}
*/
function normNumber(x) {
return Math.abs(x);
}
normNumber.signature = arithmetic_n1;
// CONCATENATED MODULE: ./src/function/arithmetic/unaryMinus.js
var unaryMinus_name = 'unaryMinus';
var unaryMinus_dependencies = ['typed'];
var createUnaryMinus = /* #__PURE__ */Object(factory["a" /* factory */])(unaryMinus_name, unaryMinus_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Inverse the sign of a value, apply a unary minus operation.
*
* For matrices, the function is evaluated element wise. Boolean values and
* strings will be converted to a number. For complex numbers, both real and
* complex value are inverted.
*
* Syntax:
*
* math.unaryMinus(x)
*
* Examples:
*
* math.unaryMinus(3.5) // returns -3.5
* math.unaryMinus(-4.2) // returns 4.2
*
* See also:
*
* add, subtract, unaryPlus
*
* @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Number to be inverted.
* @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Returns the value with inverted sign.
*/
return typed(unaryMinus_name, {
number: unaryMinusNumber,
Complex: function Complex(x) {
return x.neg();
},
BigNumber: function BigNumber(x) {
return x.neg();
},
Fraction: function Fraction(x) {
return x.neg();
},
Unit: function Unit(x) {
var res = x.clone();
res.value = this(x.value);
return res;
},
'Array | Matrix': function ArrayMatrix(x) {
// deep map collection, skip zeros since unaryMinus(0) = 0
return deepMap(x, this, true);
} // TODO: add support for string
});
});
// CONCATENATED MODULE: ./src/function/arithmetic/unaryPlus.js
var unaryPlus_name = 'unaryPlus';
var unaryPlus_dependencies = ['typed', 'config', 'BigNumber'];
var createUnaryPlus = /* #__PURE__ */Object(factory["a" /* factory */])(unaryPlus_name, unaryPlus_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
BigNumber = _ref.BigNumber;
/**
* Unary plus operation.
* Boolean values and strings will be converted to a number, numeric values will be returned as is.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.unaryPlus(x)
*
* Examples:
*
* math.unaryPlus(3.5) // returns 3.5
* math.unaryPlus(1) // returns 1
*
* See also:
*
* unaryMinus, add, subtract
*
* @param {number | BigNumber | Fraction | string | Complex | Unit | Array | Matrix} x
* Input value
* @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}
* Returns the input value when numeric, converts to a number when input is non-numeric.
*/
return typed(unaryPlus_name, {
number: unaryPlusNumber,
Complex: function Complex(x) {
return x; // complex numbers are immutable
},
BigNumber: function BigNumber(x) {
return x; // bignumbers are immutable
},
Fraction: function Fraction(x) {
return x; // fractions are immutable
},
Unit: function Unit(x) {
return x.clone();
},
'Array | Matrix': function ArrayMatrix(x) {
// deep map collection, skip zeros since unaryPlus(0) = 0
return deepMap(x, this, true);
},
'boolean | string': function booleanString(x) {
// convert to a number or bignumber
return config.number === 'BigNumber' ? new BigNumber(+x) : +x;
}
});
});
// CONCATENATED MODULE: ./src/function/arithmetic/abs.js
var abs_name = 'abs';
var abs_dependencies = ['typed'];
var createAbs = /* #__PURE__ */Object(factory["a" /* factory */])(abs_name, abs_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Calculate the absolute value of a number. For matrices, the function is
* evaluated element wise.
*
* Syntax:
*
* math.abs(x)
*
* Examples:
*
* math.abs(3.5) // returns number 3.5
* math.abs(-4.2) // returns number 4.2
*
* math.abs([3, -5, -1, 0, 2]) // returns Array [3, 5, 1, 0, 2]
*
* See also:
*
* sign
*
* @param {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x
* A number or matrix for which to get the absolute value
* @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit}
* Absolute value of `x`
*/
return typed(abs_name, {
number: absNumber,
Complex: function Complex(x) {
return x.abs();
},
BigNumber: function BigNumber(x) {
return x.abs();
},
Fraction: function Fraction(x) {
return x.abs();
},
'Array | Matrix': function ArrayMatrix(x) {
// deep map collection, skip zeros since abs(0) = 0
return deepMap(x, this, true);
},
Unit: function Unit(x) {
return x.abs();
}
});
});
// CONCATENATED MODULE: ./src/function/matrix/apply.js
var apply_name = 'apply';
var apply_dependencies = ['typed', 'isInteger'];
var createApply = /* #__PURE__ */Object(factory["a" /* factory */])(apply_name, apply_dependencies, function (_ref) {
var typed = _ref.typed,
isInteger = _ref.isInteger;
/**
* Apply a function that maps an array to a scalar
* along a given axis of a matrix or array.
* Returns a new matrix or array with one less dimension than the input.
*
* Syntax:
*
* math.apply(A, dim, callback)
*
* Where:
*
* - `dim: number` is a zero-based dimension over which to concatenate the matrices.
*
* Examples:
*
* const A = [[1, 2], [3, 4]]
* const sum = math.sum
*
* math.apply(A, 0, sum) // returns [4, 6]
* math.apply(A, 1, sum) // returns [3, 7]
*
* See also:
*
* map, filter, forEach
*
* @param {Array | Matrix} array The input Matrix
* @param {number} dim The dimension along which the callback is applied
* @param {Function} callback The callback function that is applied. This Function
* should take an array or 1-d matrix as an input and
* return a number.
* @return {Array | Matrix} res The residual matrix with the function applied over some dimension.
*/
return typed(apply_name, {
'Array | Matrix, number | BigNumber, function': function ArrayMatrixNumberBigNumberFunction(mat, dim, callback) {
if (!isInteger(dim)) {
throw new TypeError('Integer number expected for dimension');
}
var size = Array.isArray(mat) ? Object(utils_array["a" /* arraySize */])(mat) : mat.size();
if (dim < 0 || dim >= size.length) {
throw new IndexError["a" /* IndexError */](dim, size.length);
}
if (Object(is["v" /* isMatrix */])(mat)) {
return mat.create(_apply(mat.valueOf(), dim, callback));
} else {
return _apply(mat, dim, callback);
}
}
});
});
/**
* Recursively reduce a matrix
* @param {Array} mat
* @param {number} dim
* @param {Function} callback
* @returns {Array} ret
* @private
*/
function _apply(mat, dim, callback) {
var i, ret, tran;
if (dim <= 0) {
if (!Array.isArray(mat[0])) {
return callback(mat);
} else {
tran = apply_switch(mat);
ret = [];
for (i = 0; i < tran.length; i++) {
ret[i] = _apply(tran[i], dim - 1, callback);
}
return ret;
}
} else {
ret = [];
for (i = 0; i < mat.length; i++) {
ret[i] = _apply(mat[i], dim - 1, callback);
}
return ret;
}
}
/**
* Transpose a matrix
* @param {Array} mat
* @returns {Array} ret
* @private
*/
function apply_switch(mat) {
var I = mat.length;
var J = mat[0].length;
var i, j;
var ret = [];
for (j = 0; j < J; j++) {
var tmp = [];
for (i = 0; i < I; i++) {
tmp.push(mat[i][j]);
}
ret.push(tmp);
}
return ret;
}
// CONCATENATED MODULE: ./src/function/arithmetic/addScalar.js
var addScalar_name = 'addScalar';
var addScalar_dependencies = ['typed'];
var createAddScalar = /* #__PURE__ */Object(factory["a" /* factory */])(addScalar_name, addScalar_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Add two scalar values, `x + y`.
* This function is meant for internal use: it is used by the public function
* `add`
*
* This function does not support collections (Array or Matrix).
*
* @param {number | BigNumber | Fraction | Complex | Unit} x First value to add
* @param {number | BigNumber | Fraction | Complex} y Second value to add
* @return {number | BigNumber | Fraction | Complex | Unit} Sum of `x` and `y`
* @private
*/
return typed(addScalar_name, {
'number, number': addNumber,
'Complex, Complex': function ComplexComplex(x, y) {
return x.add(y);
},
'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
return x.plus(y);
},
'Fraction, Fraction': function FractionFraction(x, y) {
return x.add(y);
},
'Unit, Unit': function UnitUnit(x, y) {
if (x.value === null || x.value === undefined) throw new Error('Parameter x contains a unit with undefined value');
if (y.value === null || y.value === undefined) throw new Error('Parameter y contains a unit with undefined value');
if (!x.equalBase(y)) throw new Error('Units do not match');
var res = x.clone();
res.value = this(res.value, y.value);
res.fixPrefix = false;
return res;
}
});
});
// CONCATENATED MODULE: ./src/function/arithmetic/cbrt.js
var cbrt_name = 'cbrt';
var cbrt_dependencies = ['config', 'typed', 'isNegative', 'unaryMinus', 'matrix', 'Complex', 'BigNumber', 'Fraction'];
var createCbrt = /* #__PURE__ */Object(factory["a" /* factory */])(cbrt_name, cbrt_dependencies, function (_ref) {
var config = _ref.config,
typed = _ref.typed,
isNegative = _ref.isNegative,
unaryMinus = _ref.unaryMinus,
matrix = _ref.matrix,
Complex = _ref.Complex,
BigNumber = _ref.BigNumber,
Fraction = _ref.Fraction;
/**
* Calculate the cubic root of a value.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.cbrt(x)
* math.cbrt(x, allRoots)
*
* Examples:
*
* math.cbrt(27) // returns 3
* math.cube(3) // returns 27
* math.cbrt(-64) // returns -4
* math.cbrt(math.unit('27 m^3')) // returns Unit 3 m
* math.cbrt([27, 64, 125]) // returns [3, 4, 5]
*
* const x = math.complex('8i')
* math.cbrt(x) // returns Complex 1.7320508075689 + i
* math.cbrt(x, true) // returns Matrix [
* // 1.7320508075689 + i
* // -1.7320508075689 + i
* // -2i
* // ]
*
* See also:
*
* square, sqrt, cube
*
* @param {number | BigNumber | Complex | Unit | Array | Matrix} x
* Value for which to calculate the cubic root.
* @param {boolean} [allRoots] Optional, false by default. Only applicable
* when `x` is a number or complex number. If true, all complex
* roots are returned, if false (default) the principal root is
* returned.
* @return {number | BigNumber | Complex | Unit | Array | Matrix}
* Returns the cubic root of `x`
*/
return typed(cbrt_name, {
number: cbrtNumber,
// note: signature 'number, boolean' is also supported,
// created by typed as it knows how to convert number to Complex
Complex: _cbrtComplex,
'Complex, boolean': _cbrtComplex,
BigNumber: function BigNumber(x) {
return x.cbrt();
},
Unit: _cbrtUnit,
'Array | Matrix': function ArrayMatrix(x) {
// deep map collection, skip zeros since cbrt(0) = 0
return deepMap(x, this, true);
}
});
/**
* Calculate the cubic root for a complex number
* @param {Complex} x
* @param {boolean} [allRoots] If true, the function will return an array
* with all three roots. If false or undefined,
* the principal root is returned.
* @returns {Complex | Array.<Complex> | Matrix.<Complex>} Returns the cubic root(s) of x
* @private
*/
function _cbrtComplex(x, allRoots) {
// https://www.wikiwand.com/en/Cube_root#/Complex_numbers
var arg3 = x.arg() / 3;
var abs = x.abs(); // principal root:
var principal = new Complex(cbrtNumber(abs), 0).mul(new Complex(0, arg3).exp());
if (allRoots) {
var all = [principal, new Complex(cbrtNumber(abs), 0).mul(new Complex(0, arg3 + Math.PI * 2 / 3).exp()), new Complex(cbrtNumber(abs), 0).mul(new Complex(0, arg3 - Math.PI * 2 / 3).exp())];
return config.matrix === 'Array' ? all : matrix(all);
} else {
return principal;
}
}
/**
* Calculate the cubic root for a Unit
* @param {Unit} x
* @return {Unit} Returns the cubic root of x
* @private
*/
function _cbrtUnit(x) {
if (x.value && Object(is["j" /* isComplex */])(x.value)) {
var result = x.clone();
result.value = 1.0;
result = result.pow(1.0 / 3); // Compute the units
result.value = _cbrtComplex(x.value); // Compute the value
return result;
} else {
var negate = isNegative(x.value);
if (negate) {
x.value = unaryMinus(x.value);
} // TODO: create a helper function for this
var third;
if (Object(is["e" /* isBigNumber */])(x.value)) {
third = new BigNumber(1).div(3);
} else if (Object(is["o" /* isFraction */])(x.value)) {
third = new Fraction(1, 3);
} else {
third = 1 / 3;
}
var _result = x.pow(third);
if (negate) {
_result.value = unaryMinus(_result.value);
}
return _result;
}
}
});
// CONCATENATED MODULE: ./src/function/arithmetic/ceil.js
var ceil_name = 'ceil';
var ceil_dependencies = ['typed', 'config', 'round'];
var createCeil = /* #__PURE__ */Object(factory["a" /* factory */])(ceil_name, ceil_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
round = _ref.round;
/**
* Round a value towards plus infinity
* If `x` is complex, both real and imaginary part are rounded towards plus infinity.
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.ceil(x)
*
* Examples:
*
* math.ceil(3.2) // returns number 4
* math.ceil(3.8) // returns number 4
* math.ceil(-4.2) // returns number -4
* math.ceil(-4.7) // returns number -4
*
* const c = math.complex(3.2, -2.7)
* math.ceil(c) // returns Complex 4 - 2i
*
* math.ceil([3.2, 3.8, -4.7]) // returns Array [4, 4, -4]
*
* See also:
*
* floor, fix, round
*
* @param {number | BigNumber | Fraction | Complex | Array | Matrix} x Number to be rounded
* @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value
*/
return typed('ceil', {
number: function number(x) {
if (Object(utils_number["m" /* nearlyEqual */])(x, round(x), config.epsilon)) {
return round(x);
} else {
return ceilNumber(x);
}
},
Complex: function Complex(x) {
return x.ceil();
},
BigNumber: function BigNumber(x) {
if (nearlyEqual(x, round(x), config.epsilon)) {
return round(x);
} else {
return x.ceil();
}
},
Fraction: function Fraction(x) {
return x.ceil();
},
'Array | Matrix': function ArrayMatrix(x) {
// deep map collection, skip zeros since ceil(0) = 0
return deepMap(x, this, true);
}
});
});
// CONCATENATED MODULE: ./src/function/arithmetic/cube.js
var cube_name = 'cube';
var cube_dependencies = ['typed'];
var createCube = /* #__PURE__ */Object(factory["a" /* factory */])(cube_name, cube_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Compute the cube of a value, `x * x * x`.
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.cube(x)
*
* Examples:
*
* math.cube(2) // returns number 8
* math.pow(2, 3) // returns number 8
* math.cube(4) // returns number 64
* 4 * 4 * 4 // returns number 64
*
* math.cube([1, 2, 3, 4]) // returns Array [1, 8, 27, 64]
*
* See also:
*
* multiply, square, pow, cbrt
*
* @param {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x Number for which to calculate the cube
* @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} Cube of x
*/
return typed(cube_name, {
number: cubeNumber,
Complex: function Complex(x) {
return x.mul(x).mul(x); // Is faster than pow(x, 3)
},
BigNumber: function BigNumber(x) {
return x.times(x).times(x);
},
Fraction: function Fraction(x) {
return x.pow(3); // Is faster than mul()mul()mul()
},
'Array | Matrix': function ArrayMatrix(x) {
// deep map collection, skip zeros since cube(0) = 0
return deepMap(x, this, true);
},
Unit: function Unit(x) {
return x.pow(3);
}
});
});
// CONCATENATED MODULE: ./src/function/arithmetic/exp.js
var exp_name = 'exp';
var exp_dependencies = ['typed'];
var createExp = /* #__PURE__ */Object(factory["a" /* factory */])(exp_name, exp_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Calculate the exponent of a value.
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.exp(x)
*
* Examples:
*
* math.exp(2) // returns number 7.3890560989306495
* math.pow(math.e, 2) // returns number 7.3890560989306495
* math.log(math.exp(2)) // returns number 2
*
* math.exp([1, 2, 3])
* // returns Array [
* // 2.718281828459045,
* // 7.3890560989306495,
* // 20.085536923187668
* // ]
*
* See also:
*
* expm1, log, pow
*
* @param {number | BigNumber | Complex | Array | Matrix} x A number or matrix to exponentiate
* @return {number | BigNumber | Complex | Array | Matrix} Exponent of `x`
*/
return typed(exp_name, {
number: expNumber,
Complex: function Complex(x) {
return x.exp();
},
BigNumber: function BigNumber(x) {
return x.exp();
},
'Array | Matrix': function ArrayMatrix(x) {
// TODO: exp(sparse) should return a dense matrix since exp(0)==1
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/arithmetic/expm1.js
var expm1_name = 'expm1';
var expm1_dependencies = ['typed', 'Complex'];
var createExpm1 = /* #__PURE__ */Object(factory["a" /* factory */])(expm1_name, expm1_dependencies, function (_ref) {
var typed = _ref.typed,
_Complex = _ref.Complex;
/**
* Calculate the value of subtracting 1 from the exponential value.
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.expm1(x)
*
* Examples:
*
* math.expm1(2) // returns number 6.38905609893065
* math.pow(math.e, 2) - 1 // returns number 6.3890560989306495
* math.log(math.expm1(2) + 1) // returns number 2
*
* math.expm1([1, 2, 3])
* // returns Array [
* // 1.718281828459045,
* // 6.3890560989306495,
* // 19.085536923187668
* // ]
*
* See also:
*
* exp, log, pow
*
* @param {number | BigNumber | Complex | Array | Matrix} x A number or matrix to apply expm1
* @return {number | BigNumber | Complex | Array | Matrix} Exponent of `x`
*/
return typed(expm1_name, {
number: expm1Number,
Complex: function Complex(x) {
var r = Math.exp(x.re);
return new _Complex(r * Math.cos(x.im) - 1, r * Math.sin(x.im));
},
BigNumber: function BigNumber(x) {
return x.exp().minus(1);
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/arithmetic/fix.js
var fix_name = 'fix';
var fix_dependencies = ['typed', 'Complex', 'ceil', 'floor'];
var createFix = /* #__PURE__ */Object(factory["a" /* factory */])(fix_name, fix_dependencies, function (_ref) {
var typed = _ref.typed,
_Complex = _ref.Complex,
ceil = _ref.ceil,
floor = _ref.floor;
/**
* Round a value towards zero.
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.fix(x)
*
* Examples:
*
* math.fix(3.2) // returns number 3
* math.fix(3.8) // returns number 3
* math.fix(-4.2) // returns number -4
* math.fix(-4.7) // returns number -4
*
* const c = math.complex(3.2, -2.7)
* math.fix(c) // returns Complex 3 - 2i
*
* math.fix([3.2, 3.8, -4.7]) // returns Array [3, 3, -4]
*
* See also:
*
* ceil, floor, round
*
* @param {number | BigNumber | Fraction | Complex | Array | Matrix} x Number to be rounded
* @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value
*/
return typed('fix', {
number: function number(x) {
return x > 0 ? floor(x) : ceil(x);
},
Complex: function Complex(x) {
return new _Complex(x.re > 0 ? Math.floor(x.re) : Math.ceil(x.re), x.im > 0 ? Math.floor(x.im) : Math.ceil(x.im));
},
BigNumber: function BigNumber(x) {
return x.isNegative() ? ceil(x) : floor(x);
},
Fraction: function Fraction(x) {
return x.s < 0 ? x.ceil() : x.floor();
},
'Array | Matrix': function ArrayMatrix(x) {
// deep map collection, skip zeros since fix(0) = 0
return deepMap(x, this, true);
}
});
});
// CONCATENATED MODULE: ./src/function/arithmetic/floor.js
var floor_name = 'floor';
var floor_dependencies = ['typed', 'config', 'round'];
var createFloor = /* #__PURE__ */Object(factory["a" /* factory */])(floor_name, floor_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
round = _ref.round;
/**
* Round a value towards minus infinity.
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.floor(x)
*
* Examples:
*
* math.floor(3.2) // returns number 3
* math.floor(3.8) // returns number 3
* math.floor(-4.2) // returns number -5
* math.floor(-4.7) // returns number -5
*
* const c = math.complex(3.2, -2.7)
* math.floor(c) // returns Complex 3 - 3i
*
* math.floor([3.2, 3.8, -4.7]) // returns Array [3, 3, -5]
*
* See also:
*
* ceil, fix, round
*
* @param {number | BigNumber | Fraction | Complex | Array | Matrix} x Number to be rounded
* @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value
*/
return typed('floor', {
number: function number(x) {
if (Object(utils_number["m" /* nearlyEqual */])(x, round(x), config.epsilon)) {
return round(x);
} else {
return Math.floor(x);
}
},
Complex: function Complex(x) {
return x.floor();
},
BigNumber: function BigNumber(x) {
if (nearlyEqual(x, round(x), config.epsilon)) {
return round(x);
} else {
return x.floor();
}
},
Fraction: function Fraction(x) {
return x.floor();
},
'Array | Matrix': function ArrayMatrix(x) {
// deep map collection, skip zeros since floor(0) = 0
return deepMap(x, this, true);
}
});
});
// CONCATENATED MODULE: ./src/type/matrix/utils/algorithm01.js
var algorithm01_name = 'algorithm01';
var algorithm01_dependencies = ['typed'];
var createAlgorithm01 = /* #__PURE__ */Object(factory["a" /* factory */])(algorithm01_name, algorithm01_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Iterates over SparseMatrix nonzero items and invokes the callback function f(Dij, Sij).
* Callback function invoked NNZ times (number of nonzero items in SparseMatrix).
*
*
* ┌ f(Dij, Sij) ; S(i,j) !== 0
* C(i,j) = ┤
* └ Dij ; otherwise
*
*
* @param {Matrix} denseMatrix The DenseMatrix instance (D)
* @param {Matrix} sparseMatrix The SparseMatrix instance (S)
* @param {Function} callback The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)
* @param {boolean} inverse A true value indicates callback should be invoked f(Sij,Dij)
*
* @return {Matrix} DenseMatrix (C)
*
* see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571
*/
return function algorithm1(denseMatrix, sparseMatrix, callback, inverse) {
// dense matrix arrays
var adata = denseMatrix._data;
var asize = denseMatrix._size;
var adt = denseMatrix._datatype; // sparse matrix arrays
var bvalues = sparseMatrix._values;
var bindex = sparseMatrix._index;
var bptr = sparseMatrix._ptr;
var bsize = sparseMatrix._size;
var bdt = sparseMatrix._datatype; // validate dimensions
if (asize.length !== bsize.length) {
throw new DimensionError["a" /* DimensionError */](asize.length, bsize.length);
} // check rows & columns
if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
} // sparse matrix cannot be a Pattern matrix
if (!bvalues) {
throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');
} // rows & columns
var rows = asize[0];
var columns = asize[1]; // process data types
var dt = typeof adt === 'string' && adt === bdt ? adt : undefined; // callback function
var cf = dt ? typed.find(callback, [dt, dt]) : callback; // vars
var i, j; // result (DenseMatrix)
var cdata = []; // initialize c
for (i = 0; i < rows; i++) {
cdata[i] = [];
} // workspace
var x = []; // marks indicating we have a value in x for a given column
var w = []; // loop columns in b
for (j = 0; j < columns; j++) {
// column mark
var mark = j + 1; // values in column j
for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
// row
i = bindex[k]; // update workspace
x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]); // mark i as updated
w[i] = mark;
} // loop rows
for (i = 0; i < rows; i++) {
// check row is in workspace
if (w[i] === mark) {
// c[i][j] was already calculated
cdata[i][j] = x[i];
} else {
// item does not exist in S
cdata[i][j] = adata[i][j];
}
}
} // return dense matrix
return denseMatrix.createDenseMatrix({
data: cdata,
size: [rows, columns],
datatype: dt
});
};
});
// CONCATENATED MODULE: ./src/type/matrix/utils/algorithm04.js
var algorithm04_name = 'algorithm04';
var algorithm04_dependencies = ['typed', 'equalScalar'];
var createAlgorithm04 = /* #__PURE__ */Object(factory["a" /* factory */])(algorithm04_name, algorithm04_dependencies, function (_ref) {
var typed = _ref.typed,
equalScalar = _ref.equalScalar;
/**
* Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).
* Callback function invoked MAX(NNZA, NNZB) times
*
*
* ┌ f(Aij, Bij) ; A(i,j) !== 0 && B(i,j) !== 0
* C(i,j) = ┤ A(i,j) ; A(i,j) !== 0
* └ B(i,j) ; B(i,j) !== 0
*
*
* @param {Matrix} a The SparseMatrix instance (A)
* @param {Matrix} b The SparseMatrix instance (B)
* @param {Function} callback The f(Aij,Bij) operation to invoke
*
* @return {Matrix} SparseMatrix (C)
*
* see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
*/
return function algorithm04(a, b, callback) {
// sparse matrix arrays
var avalues = a._values;
var aindex = a._index;
var aptr = a._ptr;
var asize = a._size;
var adt = a._datatype; // sparse matrix arrays
var bvalues = b._values;
var bindex = b._index;
var bptr = b._ptr;
var bsize = b._size;
var bdt = b._datatype; // validate dimensions
if (asize.length !== bsize.length) {
throw new DimensionError["a" /* DimensionError */](asize.length, bsize.length);
} // check rows & columns
if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
} // rows & columns
var rows = asize[0];
var columns = asize[1]; // datatype
var dt; // equal signature to use
var eq = equalScalar; // zero value
var zero = 0; // callback signature to use
var cf = callback; // process data types
if (typeof adt === 'string' && adt === bdt) {
// datatype
dt = adt; // find signature that matches (dt, dt)
eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
zero = typed.convert(0, dt); // callback
cf = typed.find(callback, [dt, dt]);
} // result arrays
var cvalues = avalues && bvalues ? [] : undefined;
var cindex = [];
var cptr = []; // workspace
var xa = avalues && bvalues ? [] : undefined;
var xb = avalues && bvalues ? [] : undefined; // marks indicating we have a value in x for a given column
var wa = [];
var wb = []; // vars
var i, j, k, k0, k1; // loop columns
for (j = 0; j < columns; j++) {
// update cptr
cptr[j] = cindex.length; // columns mark
var mark = j + 1; // loop A(:,j)
for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
// row
i = aindex[k]; // update c
cindex.push(i); // update workspace
wa[i] = mark; // check we need to process values
if (xa) {
xa[i] = avalues[k];
}
} // loop B(:,j)
for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
// row
i = bindex[k]; // check row exists in A
if (wa[i] === mark) {
// update record in xa @ i
if (xa) {
// invoke callback
var v = cf(xa[i], bvalues[k]); // check for zero
if (!eq(v, zero)) {
// update workspace
xa[i] = v;
} else {
// remove mark (index will be removed later)
wa[i] = null;
}
}
} else {
// update c
cindex.push(i); // update workspace
wb[i] = mark; // check we need to process values
if (xb) {
xb[i] = bvalues[k];
}
}
} // check we need to process values (non pattern matrix)
if (xa && xb) {
// initialize first index in j
k = cptr[j]; // loop index in j
while (k < cindex.length) {
// row
i = cindex[k]; // check workspace has value @ i
if (wa[i] === mark) {
// push value (Aij != 0 || (Aij != 0 && Bij != 0))
cvalues[k] = xa[i]; // increment pointer
k++;
} else if (wb[i] === mark) {
// push value (bij != 0)
cvalues[k] = xb[i]; // increment pointer
k++;
} else {
// remove index @ k
cindex.splice(k, 1);
}
}
}
} // update cptr
cptr[columns] = cindex.length; // return sparse matrix
return a.createSparseMatrix({
values: cvalues,
index: cindex,
ptr: cptr,
size: [rows, columns],
datatype: dt
});
};
});
// CONCATENATED MODULE: ./src/type/matrix/utils/algorithm10.js
var algorithm10_name = 'algorithm10';
var algorithm10_dependencies = ['typed', 'DenseMatrix'];
var createAlgorithm10 = /* #__PURE__ */Object(factory["a" /* factory */])(algorithm10_name, algorithm10_dependencies, function (_ref) {
var typed = _ref.typed,
DenseMatrix = _ref.DenseMatrix;
/**
* Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).
* Callback function invoked NZ times (number of nonzero items in S).
*
*
* ┌ f(Sij, b) ; S(i,j) !== 0
* C(i,j) = ┤
* └ b ; otherwise
*
*
* @param {Matrix} s The SparseMatrix instance (S)
* @param {Scalar} b The Scalar value
* @param {Function} callback The f(Aij,b) operation to invoke
* @param {boolean} inverse A true value indicates callback should be invoked f(b,Sij)
*
* @return {Matrix} DenseMatrix (C)
*
* https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813
*/
return function algorithm10(s, b, callback, inverse) {
// sparse matrix arrays
var avalues = s._values;
var aindex = s._index;
var aptr = s._ptr;
var asize = s._size;
var adt = s._datatype; // sparse matrix cannot be a Pattern matrix
if (!avalues) {
throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');
} // rows & columns
var rows = asize[0];
var columns = asize[1]; // datatype
var dt; // callback signature to use
var cf = callback; // process data types
if (typeof adt === 'string') {
// datatype
dt = adt; // convert b to the same datatype
b = typed.convert(b, dt); // callback
cf = typed.find(callback, [dt, dt]);
} // result arrays
var cdata = []; // workspaces
var x = []; // marks indicating we have a value in x for a given column
var w = []; // loop columns
for (var j = 0; j < columns; j++) {
// columns mark
var mark = j + 1; // values in j
for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
// row
var r = aindex[k]; // update workspace
x[r] = avalues[k];
w[r] = mark;
} // loop rows
for (var i = 0; i < rows; i++) {
// initialize C on first column
if (j === 0) {
// create row array
cdata[i] = [];
} // check sparse matrix has a value @ i,j
if (w[i] === mark) {
// invoke callback, update C
cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b);
} else {
// dense matrix value @ i, j
cdata[i][j] = b;
}
}
} // return dense matrix
return new DenseMatrix({
data: cdata,
size: [rows, columns],
datatype: dt
});
};
});
// CONCATENATED MODULE: ./src/type/matrix/utils/algorithm13.js
var algorithm13_name = 'algorithm13';
var algorithm13_dependencies = ['typed'];
var createAlgorithm13 = /* #__PURE__ */Object(factory["a" /* factory */])(algorithm13_name, algorithm13_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Iterates over DenseMatrix items and invokes the callback function f(Aij..z, Bij..z).
* Callback function invoked MxN times.
*
* C(i,j,...z) = f(Aij..z, Bij..z)
*
* @param {Matrix} a The DenseMatrix instance (A)
* @param {Matrix} b The DenseMatrix instance (B)
* @param {Function} callback The f(Aij..z,Bij..z) operation to invoke
*
* @return {Matrix} DenseMatrix (C)
*
* https://github.com/josdejong/mathjs/pull/346#issuecomment-97658658
*/
return function algorithm13(a, b, callback) {
// a arrays
var adata = a._data;
var asize = a._size;
var adt = a._datatype; // b arrays
var bdata = b._data;
var bsize = b._size;
var bdt = b._datatype; // c arrays
var csize = []; // validate dimensions
if (asize.length !== bsize.length) {
throw new DimensionError["a" /* DimensionError */](asize.length, bsize.length);
} // validate each one of the dimension sizes
for (var s = 0; s < asize.length; s++) {
// must match
if (asize[s] !== bsize[s]) {
throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
} // update dimension in c
csize[s] = asize[s];
} // datatype
var dt; // callback signature to use
var cf = callback; // process data types
if (typeof adt === 'string' && adt === bdt) {
// datatype
dt = adt; // callback
cf = typed.find(callback, [dt, dt]);
} // populate cdata, iterate through dimensions
var cdata = csize.length > 0 ? _iterate(cf, 0, csize, csize[0], adata, bdata) : []; // c matrix
return a.createDenseMatrix({
data: cdata,
size: csize,
datatype: dt
});
}; // recursive function
function _iterate(f, level, s, n, av, bv) {
// initialize array for this level
var cv = []; // check we reach the last level
if (level === s.length - 1) {
// loop arrays in last level
for (var i = 0; i < n; i++) {
// invoke callback and store value
cv[i] = f(av[i], bv[i]);
}
} else {
// iterate current level
for (var j = 0; j < n; j++) {
// iterate next level
cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv[j]);
}
}
return cv;
}
});
// CONCATENATED MODULE: ./src/type/matrix/utils/algorithm14.js
var algorithm14_name = 'algorithm14';
var algorithm14_dependencies = ['typed'];
var createAlgorithm14 = /* #__PURE__ */Object(factory["a" /* factory */])(algorithm14_name, algorithm14_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Iterates over DenseMatrix items and invokes the callback function f(Aij..z, b).
* Callback function invoked MxN times.
*
* C(i,j,...z) = f(Aij..z, b)
*
* @param {Matrix} a The DenseMatrix instance (A)
* @param {Scalar} b The Scalar value
* @param {Function} callback The f(Aij..z,b) operation to invoke
* @param {boolean} inverse A true value indicates callback should be invoked f(b,Aij..z)
*
* @return {Matrix} DenseMatrix (C)
*
* https://github.com/josdejong/mathjs/pull/346#issuecomment-97659042
*/
return function algorithm14(a, b, callback, inverse) {
// a arrays
var adata = a._data;
var asize = a._size;
var adt = a._datatype; // datatype
var dt; // callback signature to use
var cf = callback; // process data types
if (typeof adt === 'string') {
// datatype
dt = adt; // convert b to the same datatype
b = typed.convert(b, dt); // callback
cf = typed.find(callback, [dt, dt]);
} // populate cdata, iterate through dimensions
var cdata = asize.length > 0 ? _iterate(cf, 0, asize, asize[0], adata, b, inverse) : []; // c matrix
return a.createDenseMatrix({
data: cdata,
size: Object(utils_object["a" /* clone */])(asize),
datatype: dt
});
}; // recursive function
function _iterate(f, level, s, n, av, bv, inverse) {
// initialize array for this level
var cv = []; // check we reach the last level
if (level === s.length - 1) {
// loop arrays in last level
for (var i = 0; i < n; i++) {
// invoke callback and store value
cv[i] = inverse ? f(bv, av[i]) : f(av[i], bv);
}
} else {
// iterate current level
for (var j = 0; j < n; j++) {
// iterate next level
cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv, inverse);
}
}
return cv;
}
});
// CONCATENATED MODULE: ./src/function/arithmetic/gcd.js
var gcd_name = 'gcd';
var gcd_dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'DenseMatrix'];
var createGcd = /* #__PURE__ */Object(factory["a" /* factory */])(gcd_name, gcd_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
equalScalar = _ref.equalScalar,
BigNumber = _ref.BigNumber,
DenseMatrix = _ref.DenseMatrix;
var algorithm01 = createAlgorithm01({
typed: typed
});
var algorithm04 = createAlgorithm04({
typed: typed,
equalScalar: equalScalar
});
var algorithm10 = createAlgorithm10({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Calculate the greatest common divisor for two or more values or arrays.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.gcd(a, b)
* math.gcd(a, b, c, ...)
*
* Examples:
*
* math.gcd(8, 12) // returns 4
* math.gcd(-4, 6) // returns 2
* math.gcd(25, 15, -10) // returns 5
*
* math.gcd([8, -4], [12, 6]) // returns [4, 2]
*
* See also:
*
* lcm, xgcd
*
* @param {... number | BigNumber | Fraction | Array | Matrix} args Two or more integer numbers
* @return {number | BigNumber | Fraction | Array | Matrix} The greatest common divisor
*/
return typed(gcd_name, {
'number, number': gcdNumber,
'BigNumber, BigNumber': _gcdBigNumber,
'Fraction, Fraction': function FractionFraction(x, y) {
return x.gcd(y);
},
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm04(x, y, this);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm01(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm01(x, y, this, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
return algorithm10(x, y, this, false);
},
'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
return algorithm14(x, y, this, false);
},
'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
return algorithm10(y, x, this, true);
},
'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
return algorithm14(y, x, this, true);
},
'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, this, false).valueOf();
},
'number | BigNumber, Array': function numberBigNumberArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, this, true).valueOf();
},
// TODO: need a smarter notation here
'Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber': function ArrayMatrixNumberBigNumberArrayMatrixNumberBigNumberArrayMatrixNumberBigNumber(a, b, args) {
var res = this(a, b);
for (var i = 0; i < args.length; i++) {
res = this(res, args[i]);
}
return res;
}
});
/**
* Calculate gcd for BigNumbers
* @param {BigNumber} a
* @param {BigNumber} b
* @returns {BigNumber} Returns greatest common denominator of a and b
* @private
*/
function _gcdBigNumber(a, b) {
if (!a.isInt() || !b.isInt()) {
throw new Error('Parameters in function gcd must be integer numbers');
} // https://en.wikipedia.org/wiki/Euclidean_algorithm
var zero = new BigNumber(0);
while (!b.isZero()) {
var r = a.mod(b);
a = b;
b = r;
}
return a.lt(zero) ? a.neg() : a;
}
});
// CONCATENATED MODULE: ./src/type/matrix/utils/algorithm02.js
var algorithm02_name = 'algorithm02';
var algorithm02_dependencies = ['typed', 'equalScalar'];
var createAlgorithm02 = /* #__PURE__ */Object(factory["a" /* factory */])(algorithm02_name, algorithm02_dependencies, function (_ref) {
var typed = _ref.typed,
equalScalar = _ref.equalScalar;
/**
* Iterates over SparseMatrix nonzero items and invokes the callback function f(Dij, Sij).
* Callback function invoked NNZ times (number of nonzero items in SparseMatrix).
*
*
* ┌ f(Dij, Sij) ; S(i,j) !== 0
* C(i,j) = ┤
* └ 0 ; otherwise
*
*
* @param {Matrix} denseMatrix The DenseMatrix instance (D)
* @param {Matrix} sparseMatrix The SparseMatrix instance (S)
* @param {Function} callback The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)
* @param {boolean} inverse A true value indicates callback should be invoked f(Sij,Dij)
*
* @return {Matrix} SparseMatrix (C)
*
* see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571
*/
return function algorithm02(denseMatrix, sparseMatrix, callback, inverse) {
// dense matrix arrays
var adata = denseMatrix._data;
var asize = denseMatrix._size;
var adt = denseMatrix._datatype; // sparse matrix arrays
var bvalues = sparseMatrix._values;
var bindex = sparseMatrix._index;
var bptr = sparseMatrix._ptr;
var bsize = sparseMatrix._size;
var bdt = sparseMatrix._datatype; // validate dimensions
if (asize.length !== bsize.length) {
throw new DimensionError["a" /* DimensionError */](asize.length, bsize.length);
} // check rows & columns
if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
} // sparse matrix cannot be a Pattern matrix
if (!bvalues) {
throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');
} // rows & columns
var rows = asize[0];
var columns = asize[1]; // datatype
var dt; // equal signature to use
var eq = equalScalar; // zero value
var zero = 0; // callback signature to use
var cf = callback; // process data types
if (typeof adt === 'string' && adt === bdt) {
// datatype
dt = adt; // find signature that matches (dt, dt)
eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
zero = typed.convert(0, dt); // callback
cf = typed.find(callback, [dt, dt]);
} // result (SparseMatrix)
var cvalues = [];
var cindex = [];
var cptr = []; // loop columns in b
for (var j = 0; j < columns; j++) {
// update cptr
cptr[j] = cindex.length; // values in column j
for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
// row
var i = bindex[k]; // update C(i,j)
var cij = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]); // check for nonzero
if (!eq(cij, zero)) {
// push i & v
cindex.push(i);
cvalues.push(cij);
}
}
} // update cptr
cptr[columns] = cindex.length; // return sparse matrix
return sparseMatrix.createSparseMatrix({
values: cvalues,
index: cindex,
ptr: cptr,
size: [rows, columns],
datatype: dt
});
};
});
// CONCATENATED MODULE: ./src/type/matrix/utils/algorithm06.js
var algorithm06_name = 'algorithm06';
var algorithm06_dependencies = ['typed', 'equalScalar'];
var createAlgorithm06 = /* #__PURE__ */Object(factory["a" /* factory */])(algorithm06_name, algorithm06_dependencies, function (_ref) {
var typed = _ref.typed,
equalScalar = _ref.equalScalar;
/**
* Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).
* Callback function invoked (Anz U Bnz) times, where Anz and Bnz are the nonzero elements in both matrices.
*
*
* ┌ f(Aij, Bij) ; A(i,j) !== 0 && B(i,j) !== 0
* C(i,j) = ┤
* └ 0 ; otherwise
*
*
* @param {Matrix} a The SparseMatrix instance (A)
* @param {Matrix} b The SparseMatrix instance (B)
* @param {Function} callback The f(Aij,Bij) operation to invoke
*
* @return {Matrix} SparseMatrix (C)
*
* see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
*/
return function algorithm06(a, b, callback) {
// sparse matrix arrays
var avalues = a._values;
var asize = a._size;
var adt = a._datatype; // sparse matrix arrays
var bvalues = b._values;
var bsize = b._size;
var bdt = b._datatype; // validate dimensions
if (asize.length !== bsize.length) {
throw new DimensionError["a" /* DimensionError */](asize.length, bsize.length);
} // check rows & columns
if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
} // rows & columns
var rows = asize[0];
var columns = asize[1]; // datatype
var dt; // equal signature to use
var eq = equalScalar; // zero value
var zero = 0; // callback signature to use
var cf = callback; // process data types
if (typeof adt === 'string' && adt === bdt) {
// datatype
dt = adt; // find signature that matches (dt, dt)
eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
zero = typed.convert(0, dt); // callback
cf = typed.find(callback, [dt, dt]);
} // result arrays
var cvalues = avalues && bvalues ? [] : undefined;
var cindex = [];
var cptr = []; // workspaces
var x = cvalues ? [] : undefined; // marks indicating we have a value in x for a given column
var w = []; // marks indicating value in a given row has been updated
var u = []; // loop columns
for (var j = 0; j < columns; j++) {
// update cptr
cptr[j] = cindex.length; // columns mark
var mark = j + 1; // scatter the values of A(:,j) into workspace
scatter(a, j, w, x, u, mark, cindex, cf); // scatter the values of B(:,j) into workspace
scatter(b, j, w, x, u, mark, cindex, cf); // check we need to process values (non pattern matrix)
if (x) {
// initialize first index in j
var k = cptr[j]; // loop index in j
while (k < cindex.length) {
// row
var i = cindex[k]; // check function was invoked on current row (Aij !=0 && Bij != 0)
if (u[i] === mark) {
// value @ i
var v = x[i]; // check for zero value
if (!eq(v, zero)) {
// push value
cvalues.push(v); // increment pointer
k++;
} else {
// remove value @ i, do not increment pointer
cindex.splice(k, 1);
}
} else {
// remove value @ i, do not increment pointer
cindex.splice(k, 1);
}
}
} else {
// initialize first index in j
var p = cptr[j]; // loop index in j
while (p < cindex.length) {
// row
var r = cindex[p]; // check function was invoked on current row (Aij !=0 && Bij != 0)
if (u[r] !== mark) {
// remove value @ i, do not increment pointer
cindex.splice(p, 1);
} else {
// increment pointer
p++;
}
}
}
} // update cptr
cptr[columns] = cindex.length; // return sparse matrix
return a.createSparseMatrix({
values: cvalues,
index: cindex,
ptr: cptr,
size: [rows, columns],
datatype: dt
});
};
});
// CONCATENATED MODULE: ./src/type/matrix/utils/algorithm11.js
var algorithm11_name = 'algorithm11';
var algorithm11_dependencies = ['typed', 'equalScalar'];
var createAlgorithm11 = /* #__PURE__ */Object(factory["a" /* factory */])(algorithm11_name, algorithm11_dependencies, function (_ref) {
var typed = _ref.typed,
equalScalar = _ref.equalScalar;
/**
* Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).
* Callback function invoked NZ times (number of nonzero items in S).
*
*
* ┌ f(Sij, b) ; S(i,j) !== 0
* C(i,j) = ┤
* └ 0 ; otherwise
*
*
* @param {Matrix} s The SparseMatrix instance (S)
* @param {Scalar} b The Scalar value
* @param {Function} callback The f(Aij,b) operation to invoke
* @param {boolean} inverse A true value indicates callback should be invoked f(b,Sij)
*
* @return {Matrix} SparseMatrix (C)
*
* https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813
*/
return function algorithm11(s, b, callback, inverse) {
// sparse matrix arrays
var avalues = s._values;
var aindex = s._index;
var aptr = s._ptr;
var asize = s._size;
var adt = s._datatype; // sparse matrix cannot be a Pattern matrix
if (!avalues) {
throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');
} // rows & columns
var rows = asize[0];
var columns = asize[1]; // datatype
var dt; // equal signature to use
var eq = equalScalar; // zero value
var zero = 0; // callback signature to use
var cf = callback; // process data types
if (typeof adt === 'string') {
// datatype
dt = adt; // find signature that matches (dt, dt)
eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
zero = typed.convert(0, dt); // convert b to the same datatype
b = typed.convert(b, dt); // callback
cf = typed.find(callback, [dt, dt]);
} // result arrays
var cvalues = [];
var cindex = [];
var cptr = []; // loop columns
for (var j = 0; j < columns; j++) {
// initialize ptr
cptr[j] = cindex.length; // values in j
for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
// row
var i = aindex[k]; // invoke callback
var v = inverse ? cf(b, avalues[k]) : cf(avalues[k], b); // check value is zero
if (!eq(v, zero)) {
// push index & value
cindex.push(i);
cvalues.push(v);
}
}
} // update ptr
cptr[columns] = cindex.length; // return sparse matrix
return s.createSparseMatrix({
values: cvalues,
index: cindex,
ptr: cptr,
size: [rows, columns],
datatype: dt
});
};
});
// CONCATENATED MODULE: ./src/function/arithmetic/lcm.js
var lcm_name = 'lcm';
var lcm_dependencies = ['typed', 'matrix', 'equalScalar'];
var createLcm = /* #__PURE__ */Object(factory["a" /* factory */])(lcm_name, lcm_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
equalScalar = _ref.equalScalar;
var algorithm02 = createAlgorithm02({
typed: typed,
equalScalar: equalScalar
});
var algorithm06 = createAlgorithm06({
typed: typed,
equalScalar: equalScalar
});
var algorithm11 = createAlgorithm11({
typed: typed,
equalScalar: equalScalar
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Calculate the least common multiple for two or more values or arrays.
*
* lcm is defined as:
*
* lcm(a, b) = abs(a * b) / gcd(a, b)
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.lcm(a, b)
* math.lcm(a, b, c, ...)
*
* Examples:
*
* math.lcm(4, 6) // returns 12
* math.lcm(6, 21) // returns 42
* math.lcm(6, 21, 5) // returns 210
*
* math.lcm([4, 6], [6, 21]) // returns [12, 42]
*
* See also:
*
* gcd, xgcd
*
* @param {... number | BigNumber | Array | Matrix} args Two or more integer numbers
* @return {number | BigNumber | Array | Matrix} The least common multiple
*/
return typed(lcm_name, {
'number, number': lcmNumber,
'BigNumber, BigNumber': _lcmBigNumber,
'Fraction, Fraction': function FractionFraction(x, y) {
return x.lcm(y);
},
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm06(x, y, this);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm02(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm02(x, y, this, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
return algorithm11(x, y, this, false);
},
'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
return algorithm14(x, y, this, false);
},
'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
return algorithm11(y, x, this, true);
},
'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
return algorithm14(y, x, this, true);
},
'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, this, false).valueOf();
},
'number | BigNumber, Array': function numberBigNumberArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, this, true).valueOf();
},
// TODO: need a smarter notation here
'Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber': function ArrayMatrixNumberBigNumberArrayMatrixNumberBigNumberArrayMatrixNumberBigNumber(a, b, args) {
var res = this(a, b);
for (var i = 0; i < args.length; i++) {
res = this(res, args[i]);
}
return res;
}
});
/**
* Calculate lcm for two BigNumbers
* @param {BigNumber} a
* @param {BigNumber} b
* @returns {BigNumber} Returns the least common multiple of a and b
* @private
*/
function _lcmBigNumber(a, b) {
if (!a.isInt() || !b.isInt()) {
throw new Error('Parameters in function lcm must be integer numbers');
}
if (a.isZero()) {
return a;
}
if (b.isZero()) {
return b;
} // https://en.wikipedia.org/wiki/Euclidean_algorithm
// evaluate lcm here inline to reduce overhead
var prod = a.times(b);
while (!b.isZero()) {
var t = b;
b = a.mod(t);
a = t;
}
return prod.div(a).abs();
}
});
// CONCATENATED MODULE: ./src/function/arithmetic/log10.js
var log10_name = 'log10';
var log10_dependencies = ['typed', 'config', 'Complex'];
var createLog10 = /* #__PURE__ */Object(factory["a" /* factory */])(log10_name, log10_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
_Complex = _ref.Complex;
/**
* Calculate the 10-base logarithm of a value. This is the same as calculating `log(x, 10)`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.log10(x)
*
* Examples:
*
* math.log10(0.00001) // returns -5
* math.log10(10000) // returns 4
* math.log(10000) / math.log(10) // returns 4
* math.pow(10, 4) // returns 10000
*
* See also:
*
* exp, log, log1p, log2
*
* @param {number | BigNumber | Complex | Array | Matrix} x
* Value for which to calculate the logarithm.
* @return {number | BigNumber | Complex | Array | Matrix}
* Returns the 10-base logarithm of `x`
*/
return typed(log10_name, {
number: function number(x) {
if (x >= 0 || config.predictable) {
return log10Number(x);
} else {
// negative value -> complex value computation
return new _Complex(x, 0).log().div(Math.LN10);
}
},
Complex: function Complex(x) {
return new _Complex(x).log().div(Math.LN10);
},
BigNumber: function BigNumber(x) {
if (!x.isNegative() || config.predictable) {
return x.log();
} else {
// downgrade to number, return Complex valued result
return new _Complex(x.toNumber(), 0).log().div(Math.LN10);
}
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/arithmetic/log2.js
var log2_name = 'log2';
var log2_dependencies = ['typed', 'config', 'Complex'];
var createLog2 = /* #__PURE__ */Object(factory["a" /* factory */])(log2_name, log2_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
Complex = _ref.Complex;
/**
* Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.log2(x)
*
* Examples:
*
* math.log2(0.03125) // returns -5
* math.log2(16) // returns 4
* math.log2(16) / math.log2(2) // returns 4
* math.pow(2, 4) // returns 16
*
* See also:
*
* exp, log, log1p, log10
*
* @param {number | BigNumber | Complex | Array | Matrix} x
* Value for which to calculate the logarithm.
* @return {number | BigNumber | Complex | Array | Matrix}
* Returns the 2-base logarithm of `x`
*/
return typed(log2_name, {
number: function number(x) {
if (x >= 0 || config.predictable) {
return log2Number(x);
} else {
// negative value -> complex value computation
return _log2Complex(new Complex(x, 0));
}
},
Complex: _log2Complex,
BigNumber: function BigNumber(x) {
if (!x.isNegative() || config.predictable) {
return x.log(2);
} else {
// downgrade to number, return Complex valued result
return _log2Complex(new Complex(x.toNumber(), 0));
}
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
/**
* Calculate log2 for a complex value
* @param {Complex} x
* @returns {Complex}
* @private
*/
function _log2Complex(x) {
var newX = Math.sqrt(x.re * x.re + x.im * x.im);
return new Complex(Math.log2 ? Math.log2(newX) : Math.log(newX) / Math.LN2, Math.atan2(x.im, x.re) / Math.LN2);
}
});
// CONCATENATED MODULE: ./src/type/matrix/utils/algorithm03.js
var algorithm03_name = 'algorithm03';
var algorithm03_dependencies = ['typed'];
var createAlgorithm03 = /* #__PURE__ */Object(factory["a" /* factory */])(algorithm03_name, algorithm03_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Iterates over SparseMatrix items and invokes the callback function f(Dij, Sij).
* Callback function invoked M*N times.
*
*
* ┌ f(Dij, Sij) ; S(i,j) !== 0
* C(i,j) = ┤
* └ f(Dij, 0) ; otherwise
*
*
* @param {Matrix} denseMatrix The DenseMatrix instance (D)
* @param {Matrix} sparseMatrix The SparseMatrix instance (C)
* @param {Function} callback The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)
* @param {boolean} inverse A true value indicates callback should be invoked f(Sij,Dij)
*
* @return {Matrix} DenseMatrix (C)
*
* see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571
*/
return function algorithm03(denseMatrix, sparseMatrix, callback, inverse) {
// dense matrix arrays
var adata = denseMatrix._data;
var asize = denseMatrix._size;
var adt = denseMatrix._datatype; // sparse matrix arrays
var bvalues = sparseMatrix._values;
var bindex = sparseMatrix._index;
var bptr = sparseMatrix._ptr;
var bsize = sparseMatrix._size;
var bdt = sparseMatrix._datatype; // validate dimensions
if (asize.length !== bsize.length) {
throw new DimensionError["a" /* DimensionError */](asize.length, bsize.length);
} // check rows & columns
if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
} // sparse matrix cannot be a Pattern matrix
if (!bvalues) {
throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');
} // rows & columns
var rows = asize[0];
var columns = asize[1]; // datatype
var dt; // zero value
var zero = 0; // callback signature to use
var cf = callback; // process data types
if (typeof adt === 'string' && adt === bdt) {
// datatype
dt = adt; // convert 0 to the same datatype
zero = typed.convert(0, dt); // callback
cf = typed.find(callback, [dt, dt]);
} // result (DenseMatrix)
var cdata = []; // initialize dense matrix
for (var z = 0; z < rows; z++) {
// initialize row
cdata[z] = [];
} // workspace
var x = []; // marks indicating we have a value in x for a given column
var w = []; // loop columns in b
for (var j = 0; j < columns; j++) {
// column mark
var mark = j + 1; // values in column j
for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
// row
var i = bindex[k]; // update workspace
x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);
w[i] = mark;
} // process workspace
for (var y = 0; y < rows; y++) {
// check we have a calculated value for current row
if (w[y] === mark) {
// use calculated value
cdata[y][j] = x[y];
} else {
// calculate value
cdata[y][j] = inverse ? cf(zero, adata[y][j]) : cf(adata[y][j], zero);
}
}
} // return dense matrix
return denseMatrix.createDenseMatrix({
data: cdata,
size: [rows, columns],
datatype: dt
});
};
});
// CONCATENATED MODULE: ./src/type/matrix/utils/algorithm05.js
var algorithm05_name = 'algorithm05';
var algorithm05_dependencies = ['typed', 'equalScalar'];
var createAlgorithm05 = /* #__PURE__ */Object(factory["a" /* factory */])(algorithm05_name, algorithm05_dependencies, function (_ref) {
var typed = _ref.typed,
equalScalar = _ref.equalScalar;
/**
* Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).
* Callback function invoked MAX(NNZA, NNZB) times
*
*
* ┌ f(Aij, Bij) ; A(i,j) !== 0 || B(i,j) !== 0
* C(i,j) = ┤
* └ 0 ; otherwise
*
*
* @param {Matrix} a The SparseMatrix instance (A)
* @param {Matrix} b The SparseMatrix instance (B)
* @param {Function} callback The f(Aij,Bij) operation to invoke
*
* @return {Matrix} SparseMatrix (C)
*
* see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
*/
return function algorithm05(a, b, callback) {
// sparse matrix arrays
var avalues = a._values;
var aindex = a._index;
var aptr = a._ptr;
var asize = a._size;
var adt = a._datatype; // sparse matrix arrays
var bvalues = b._values;
var bindex = b._index;
var bptr = b._ptr;
var bsize = b._size;
var bdt = b._datatype; // validate dimensions
if (asize.length !== bsize.length) {
throw new DimensionError["a" /* DimensionError */](asize.length, bsize.length);
} // check rows & columns
if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
} // rows & columns
var rows = asize[0];
var columns = asize[1]; // datatype
var dt; // equal signature to use
var eq = equalScalar; // zero value
var zero = 0; // callback signature to use
var cf = callback; // process data types
if (typeof adt === 'string' && adt === bdt) {
// datatype
dt = adt; // find signature that matches (dt, dt)
eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
zero = typed.convert(0, dt); // callback
cf = typed.find(callback, [dt, dt]);
} // result arrays
var cvalues = avalues && bvalues ? [] : undefined;
var cindex = [];
var cptr = []; // workspaces
var xa = cvalues ? [] : undefined;
var xb = cvalues ? [] : undefined; // marks indicating we have a value in x for a given column
var wa = [];
var wb = []; // vars
var i, j, k, k1; // loop columns
for (j = 0; j < columns; j++) {
// update cptr
cptr[j] = cindex.length; // columns mark
var mark = j + 1; // loop values A(:,j)
for (k = aptr[j], k1 = aptr[j + 1]; k < k1; k++) {
// row
i = aindex[k]; // push index
cindex.push(i); // update workspace
wa[i] = mark; // check we need to process values
if (xa) {
xa[i] = avalues[k];
}
} // loop values B(:,j)
for (k = bptr[j], k1 = bptr[j + 1]; k < k1; k++) {
// row
i = bindex[k]; // check row existed in A
if (wa[i] !== mark) {
// push index
cindex.push(i);
} // update workspace
wb[i] = mark; // check we need to process values
if (xb) {
xb[i] = bvalues[k];
}
} // check we need to process values (non pattern matrix)
if (cvalues) {
// initialize first index in j
k = cptr[j]; // loop index in j
while (k < cindex.length) {
// row
i = cindex[k]; // marks
var wai = wa[i];
var wbi = wb[i]; // check Aij or Bij are nonzero
if (wai === mark || wbi === mark) {
// matrix values @ i,j
var va = wai === mark ? xa[i] : zero;
var vb = wbi === mark ? xb[i] : zero; // Cij
var vc = cf(va, vb); // check for zero
if (!eq(vc, zero)) {
// push value
cvalues.push(vc); // increment pointer
k++;
} else {
// remove value @ i, do not increment pointer
cindex.splice(k, 1);
}
}
}
}
} // update cptr
cptr[columns] = cindex.length; // return sparse matrix
return a.createSparseMatrix({
values: cvalues,
index: cindex,
ptr: cptr,
size: [rows, columns],
datatype: dt
});
};
});
// CONCATENATED MODULE: ./src/type/matrix/utils/algorithm12.js
var algorithm12_name = 'algorithm12';
var algorithm12_dependencies = ['typed', 'DenseMatrix'];
var createAlgorithm12 = /* #__PURE__ */Object(factory["a" /* factory */])(algorithm12_name, algorithm12_dependencies, function (_ref) {
var typed = _ref.typed,
DenseMatrix = _ref.DenseMatrix;
/**
* Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).
* Callback function invoked MxN times.
*
*
* ┌ f(Sij, b) ; S(i,j) !== 0
* C(i,j) = ┤
* └ f(0, b) ; otherwise
*
*
* @param {Matrix} s The SparseMatrix instance (S)
* @param {Scalar} b The Scalar value
* @param {Function} callback The f(Aij,b) operation to invoke
* @param {boolean} inverse A true value indicates callback should be invoked f(b,Sij)
*
* @return {Matrix} DenseMatrix (C)
*
* https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813
*/
return function algorithm12(s, b, callback, inverse) {
// sparse matrix arrays
var avalues = s._values;
var aindex = s._index;
var aptr = s._ptr;
var asize = s._size;
var adt = s._datatype; // sparse matrix cannot be a Pattern matrix
if (!avalues) {
throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');
} // rows & columns
var rows = asize[0];
var columns = asize[1]; // datatype
var dt; // callback signature to use
var cf = callback; // process data types
if (typeof adt === 'string') {
// datatype
dt = adt; // convert b to the same datatype
b = typed.convert(b, dt); // callback
cf = typed.find(callback, [dt, dt]);
} // result arrays
var cdata = []; // workspaces
var x = []; // marks indicating we have a value in x for a given column
var w = []; // loop columns
for (var j = 0; j < columns; j++) {
// columns mark
var mark = j + 1; // values in j
for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
// row
var r = aindex[k]; // update workspace
x[r] = avalues[k];
w[r] = mark;
} // loop rows
for (var i = 0; i < rows; i++) {
// initialize C on first column
if (j === 0) {
// create row array
cdata[i] = [];
} // check sparse matrix has a value @ i,j
if (w[i] === mark) {
// invoke callback, update C
cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b);
} else {
// dense matrix value @ i, j
cdata[i][j] = inverse ? cf(b, 0) : cf(0, b);
}
}
} // return dense matrix
return new DenseMatrix({
data: cdata,
size: [rows, columns],
datatype: dt
});
};
});
// CONCATENATED MODULE: ./src/function/arithmetic/mod.js
var mod_name = 'mod';
var mod_dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];
var createMod = /* #__PURE__ */Object(factory["a" /* factory */])(mod_name, mod_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
equalScalar = _ref.equalScalar,
DenseMatrix = _ref.DenseMatrix;
var algorithm02 = createAlgorithm02({
typed: typed,
equalScalar: equalScalar
});
var algorithm03 = createAlgorithm03({
typed: typed
});
var algorithm05 = createAlgorithm05({
typed: typed,
equalScalar: equalScalar
});
var algorithm11 = createAlgorithm11({
typed: typed,
equalScalar: equalScalar
});
var algorithm12 = createAlgorithm12({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Calculates the modulus, the remainder of an integer division.
*
* For matrices, the function is evaluated element wise.
*
* The modulus is defined as:
*
* x - y * floor(x / y)
*
* See https://en.wikipedia.org/wiki/Modulo_operation.
*
* Syntax:
*
* math.mod(x, y)
*
* Examples:
*
* math.mod(8, 3) // returns 2
* math.mod(11, 2) // returns 1
*
* function isOdd(x) {
* return math.mod(x, 2) != 0
* }
*
* isOdd(2) // returns false
* isOdd(3) // returns true
*
* See also:
*
* divide
*
* @param {number | BigNumber | Fraction | Array | Matrix} x Dividend
* @param {number | BigNumber | Fraction | Array | Matrix} y Divisor
* @return {number | BigNumber | Fraction | Array | Matrix} Returns the remainder of `x` divided by `y`.
*/
return typed(mod_name, {
'number, number': modNumber,
'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
return y.isZero() ? x : x.mod(y);
},
'Fraction, Fraction': function FractionFraction(x, y) {
return x.mod(y);
},
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm05(x, y, this, false);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm02(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm03(x, y, this, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
return algorithm11(x, y, this, false);
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, this, false);
},
'any, SparseMatrix': function anySparseMatrix(x, y) {
return algorithm12(y, x, this, true);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
return algorithm14(y, x, this, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, this, false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, this, true).valueOf();
}
});
});
// CONCATENATED MODULE: ./src/function/arithmetic/multiplyScalar.js
var multiplyScalar_name = 'multiplyScalar';
var multiplyScalar_dependencies = ['typed'];
var createMultiplyScalar = /* #__PURE__ */Object(factory["a" /* factory */])(multiplyScalar_name, multiplyScalar_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Multiply two scalar values, `x * y`.
* This function is meant for internal use: it is used by the public function
* `multiply`
*
* This function does not support collections (Array or Matrix).
*
* @param {number | BigNumber | Fraction | Complex | Unit} x First value to multiply
* @param {number | BigNumber | Fraction | Complex} y Second value to multiply
* @return {number | BigNumber | Fraction | Complex | Unit} Multiplication of `x` and `y`
* @private
*/
return typed('multiplyScalar', {
'number, number': multiplyNumber,
'Complex, Complex': function ComplexComplex(x, y) {
return x.mul(y);
},
'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
return x.times(y);
},
'Fraction, Fraction': function FractionFraction(x, y) {
return x.mul(y);
},
'number | Fraction | BigNumber | Complex, Unit': function numberFractionBigNumberComplexUnit(x, y) {
var res = y.clone();
res.value = res.value === null ? res._normalize(x) : this(res.value, x);
return res;
},
'Unit, number | Fraction | BigNumber | Complex': function UnitNumberFractionBigNumberComplex(x, y) {
var res = x.clone();
res.value = res.value === null ? res._normalize(y) : this(res.value, y);
return res;
},
'Unit, Unit': function UnitUnit(x, y) {
return x.multiply(y);
}
});
});
// CONCATENATED MODULE: ./src/function/arithmetic/multiply.js
var multiply_name = 'multiply';
var multiply_dependencies = ['typed', 'matrix', 'addScalar', 'multiplyScalar', 'equalScalar', 'dot'];
var createMultiply = /* #__PURE__ */Object(factory["a" /* factory */])(multiply_name, multiply_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
addScalar = _ref.addScalar,
multiplyScalar = _ref.multiplyScalar,
equalScalar = _ref.equalScalar,
dot = _ref.dot;
var algorithm11 = createAlgorithm11({
typed: typed,
equalScalar: equalScalar
});
var algorithm14 = createAlgorithm14({
typed: typed
});
function _validateMatrixDimensions(size1, size2) {
// check left operand dimensions
switch (size1.length) {
case 1:
// check size2
switch (size2.length) {
case 1:
// Vector x Vector
if (size1[0] !== size2[0]) {
// throw error
throw new RangeError('Dimension mismatch in multiplication. Vectors must have the same length');
}
break;
case 2:
// Vector x Matrix
if (size1[0] !== size2[0]) {
// throw error
throw new RangeError('Dimension mismatch in multiplication. Vector length (' + size1[0] + ') must match Matrix rows (' + size2[0] + ')');
}
break;
default:
throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');
}
break;
case 2:
// check size2
switch (size2.length) {
case 1:
// Matrix x Vector
if (size1[1] !== size2[0]) {
// throw error
throw new RangeError('Dimension mismatch in multiplication. Matrix columns (' + size1[1] + ') must match Vector length (' + size2[0] + ')');
}
break;
case 2:
// Matrix x Matrix
if (size1[1] !== size2[0]) {
// throw error
throw new RangeError('Dimension mismatch in multiplication. Matrix A columns (' + size1[1] + ') must match Matrix B rows (' + size2[0] + ')');
}
break;
default:
throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');
}
break;
default:
throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix A has ' + size1.length + ' dimensions)');
}
}
/**
* C = A * B
*
* @param {Matrix} a Dense Vector (N)
* @param {Matrix} b Dense Vector (N)
*
* @return {number} Scalar value
*/
function _multiplyVectorVector(a, b, n) {
// check empty vector
if (n === 0) {
throw new Error('Cannot multiply two empty vectors');
}
return dot(a, b);
}
/**
* C = A * B
*
* @param {Matrix} a Dense Vector (M)
* @param {Matrix} b Matrix (MxN)
*
* @return {Matrix} Dense Vector (N)
*/
function _multiplyVectorMatrix(a, b) {
// process storage
if (b.storage() !== 'dense') {
throw new Error('Support for SparseMatrix not implemented');
}
return _multiplyVectorDenseMatrix(a, b);
}
/**
* C = A * B
*
* @param {Matrix} a Dense Vector (M)
* @param {Matrix} b Dense Matrix (MxN)
*
* @return {Matrix} Dense Vector (N)
*/
function _multiplyVectorDenseMatrix(a, b) {
// a dense
var adata = a._data;
var asize = a._size;
var adt = a._datatype; // b dense
var bdata = b._data;
var bsize = b._size;
var bdt = b._datatype; // rows & columns
var alength = asize[0];
var bcolumns = bsize[1]; // datatype
var dt; // addScalar signature to use
var af = addScalar; // multiplyScalar signature to use
var mf = multiplyScalar; // process data types
if (adt && bdt && adt === bdt && typeof adt === 'string') {
// datatype
dt = adt; // find signatures that matches (dt, dt)
af = typed.find(addScalar, [dt, dt]);
mf = typed.find(multiplyScalar, [dt, dt]);
} // result
var c = []; // loop matrix columns
for (var j = 0; j < bcolumns; j++) {
// sum (do not initialize it with zero)
var sum = mf(adata[0], bdata[0][j]); // loop vector
for (var i = 1; i < alength; i++) {
// multiply & accumulate
sum = af(sum, mf(adata[i], bdata[i][j]));
}
c[j] = sum;
} // return matrix
return a.createDenseMatrix({
data: c,
size: [bcolumns],
datatype: dt
});
}
/**
* C = A * B
*
* @param {Matrix} a Matrix (MxN)
* @param {Matrix} b Dense Vector (N)
*
* @return {Matrix} Dense Vector (M)
*/
var _multiplyMatrixVector = typed('_multiplyMatrixVector', {
'DenseMatrix, any': _multiplyDenseMatrixVector,
'SparseMatrix, any': _multiplySparseMatrixVector
});
/**
* C = A * B
*
* @param {Matrix} a Matrix (MxN)
* @param {Matrix} b Matrix (NxC)
*
* @return {Matrix} Matrix (MxC)
*/
var _multiplyMatrixMatrix = typed('_multiplyMatrixMatrix', {
'DenseMatrix, DenseMatrix': _multiplyDenseMatrixDenseMatrix,
'DenseMatrix, SparseMatrix': _multiplyDenseMatrixSparseMatrix,
'SparseMatrix, DenseMatrix': _multiplySparseMatrixDenseMatrix,
'SparseMatrix, SparseMatrix': _multiplySparseMatrixSparseMatrix
});
/**
* C = A * B
*
* @param {Matrix} a DenseMatrix (MxN)
* @param {Matrix} b Dense Vector (N)
*
* @return {Matrix} Dense Vector (M)
*/
function _multiplyDenseMatrixVector(a, b) {
// a dense
var adata = a._data;
var asize = a._size;
var adt = a._datatype; // b dense
var bdata = b._data;
var bdt = b._datatype; // rows & columns
var arows = asize[0];
var acolumns = asize[1]; // datatype
var dt; // addScalar signature to use
var af = addScalar; // multiplyScalar signature to use
var mf = multiplyScalar; // process data types
if (adt && bdt && adt === bdt && typeof adt === 'string') {
// datatype
dt = adt; // find signatures that matches (dt, dt)
af = typed.find(addScalar, [dt, dt]);
mf = typed.find(multiplyScalar, [dt, dt]);
} // result
var c = []; // loop matrix a rows
for (var i = 0; i < arows; i++) {
// current row
var row = adata[i]; // sum (do not initialize it with zero)
var sum = mf(row[0], bdata[0]); // loop matrix a columns
for (var j = 1; j < acolumns; j++) {
// multiply & accumulate
sum = af(sum, mf(row[j], bdata[j]));
}
c[i] = sum;
} // return matrix
return a.createDenseMatrix({
data: c,
size: [arows],
datatype: dt
});
}
/**
* C = A * B
*
* @param {Matrix} a DenseMatrix (MxN)
* @param {Matrix} b DenseMatrix (NxC)
*
* @return {Matrix} DenseMatrix (MxC)
*/
function _multiplyDenseMatrixDenseMatrix(a, b) {
// a dense
var adata = a._data;
var asize = a._size;
var adt = a._datatype; // b dense
var bdata = b._data;
var bsize = b._size;
var bdt = b._datatype; // rows & columns
var arows = asize[0];
var acolumns = asize[1];
var bcolumns = bsize[1]; // datatype
var dt; // addScalar signature to use
var af = addScalar; // multiplyScalar signature to use
var mf = multiplyScalar; // process data types
if (adt && bdt && adt === bdt && typeof adt === 'string') {
// datatype
dt = adt; // find signatures that matches (dt, dt)
af = typed.find(addScalar, [dt, dt]);
mf = typed.find(multiplyScalar, [dt, dt]);
} // result
var c = []; // loop matrix a rows
for (var i = 0; i < arows; i++) {
// current row
var row = adata[i]; // initialize row array
c[i] = []; // loop matrix b columns
for (var j = 0; j < bcolumns; j++) {
// sum (avoid initializing sum to zero)
var sum = mf(row[0], bdata[0][j]); // loop matrix a columns
for (var x = 1; x < acolumns; x++) {
// multiply & accumulate
sum = af(sum, mf(row[x], bdata[x][j]));
}
c[i][j] = sum;
}
} // return matrix
return a.createDenseMatrix({
data: c,
size: [arows, bcolumns],
datatype: dt
});
}
/**
* C = A * B
*
* @param {Matrix} a DenseMatrix (MxN)
* @param {Matrix} b SparseMatrix (NxC)
*
* @return {Matrix} SparseMatrix (MxC)
*/
function _multiplyDenseMatrixSparseMatrix(a, b) {
// a dense
var adata = a._data;
var asize = a._size;
var adt = a._datatype; // b sparse
var bvalues = b._values;
var bindex = b._index;
var bptr = b._ptr;
var bsize = b._size;
var bdt = b._datatype; // validate b matrix
if (!bvalues) {
throw new Error('Cannot multiply Dense Matrix times Pattern only Matrix');
} // rows & columns
var arows = asize[0];
var bcolumns = bsize[1]; // datatype
var dt; // addScalar signature to use
var af = addScalar; // multiplyScalar signature to use
var mf = multiplyScalar; // equalScalar signature to use
var eq = equalScalar; // zero value
var zero = 0; // process data types
if (adt && bdt && adt === bdt && typeof adt === 'string') {
// datatype
dt = adt; // find signatures that matches (dt, dt)
af = typed.find(addScalar, [dt, dt]);
mf = typed.find(multiplyScalar, [dt, dt]);
eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
zero = typed.convert(0, dt);
} // result
var cvalues = [];
var cindex = [];
var cptr = []; // c matrix
var c = b.createSparseMatrix({
values: cvalues,
index: cindex,
ptr: cptr,
size: [arows, bcolumns],
datatype: dt
}); // loop b columns
for (var jb = 0; jb < bcolumns; jb++) {
// update ptr
cptr[jb] = cindex.length; // indeces in column jb
var kb0 = bptr[jb];
var kb1 = bptr[jb + 1]; // do not process column jb if no data exists
if (kb1 > kb0) {
// last row mark processed
var last = 0; // loop a rows
for (var i = 0; i < arows; i++) {
// column mark
var mark = i + 1; // C[i, jb]
var cij = void 0; // values in b column j
for (var kb = kb0; kb < kb1; kb++) {
// row
var ib = bindex[kb]; // check value has been initialized
if (last !== mark) {
// first value in column jb
cij = mf(adata[i][ib], bvalues[kb]); // update mark
last = mark;
} else {
// accumulate value
cij = af(cij, mf(adata[i][ib], bvalues[kb]));
}
} // check column has been processed and value != 0
if (last === mark && !eq(cij, zero)) {
// push row & value
cindex.push(i);
cvalues.push(cij);
}
}
}
} // update ptr
cptr[bcolumns] = cindex.length; // return sparse matrix
return c;
}
/**
* C = A * B
*
* @param {Matrix} a SparseMatrix (MxN)
* @param {Matrix} b Dense Vector (N)
*
* @return {Matrix} SparseMatrix (M, 1)
*/
function _multiplySparseMatrixVector(a, b) {
// a sparse
var avalues = a._values;
var aindex = a._index;
var aptr = a._ptr;
var adt = a._datatype; // validate a matrix
if (!avalues) {
throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');
} // b dense
var bdata = b._data;
var bdt = b._datatype; // rows & columns
var arows = a._size[0];
var brows = b._size[0]; // result
var cvalues = [];
var cindex = [];
var cptr = []; // datatype
var dt; // addScalar signature to use
var af = addScalar; // multiplyScalar signature to use
var mf = multiplyScalar; // equalScalar signature to use
var eq = equalScalar; // zero value
var zero = 0; // process data types
if (adt && bdt && adt === bdt && typeof adt === 'string') {
// datatype
dt = adt; // find signatures that matches (dt, dt)
af = typed.find(addScalar, [dt, dt]);
mf = typed.find(multiplyScalar, [dt, dt]);
eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
zero = typed.convert(0, dt);
} // workspace
var x = []; // vector with marks indicating a value x[i] exists in a given column
var w = []; // update ptr
cptr[0] = 0; // rows in b
for (var ib = 0; ib < brows; ib++) {
// b[ib]
var vbi = bdata[ib]; // check b[ib] != 0, avoid loops
if (!eq(vbi, zero)) {
// A values & index in ib column
for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {
// a row
var ia = aindex[ka]; // check value exists in current j
if (!w[ia]) {
// ia is new entry in j
w[ia] = true; // add i to pattern of C
cindex.push(ia); // x(ia) = A
x[ia] = mf(vbi, avalues[ka]);
} else {
// i exists in C already
x[ia] = af(x[ia], mf(vbi, avalues[ka]));
}
}
}
} // copy values from x to column jb of c
for (var p1 = cindex.length, p = 0; p < p1; p++) {
// row
var ic = cindex[p]; // copy value
cvalues[p] = x[ic];
} // update ptr
cptr[1] = cindex.length; // return sparse matrix
return a.createSparseMatrix({
values: cvalues,
index: cindex,
ptr: cptr,
size: [arows, 1],
datatype: dt
});
}
/**
* C = A * B
*
* @param {Matrix} a SparseMatrix (MxN)
* @param {Matrix} b DenseMatrix (NxC)
*
* @return {Matrix} SparseMatrix (MxC)
*/
function _multiplySparseMatrixDenseMatrix(a, b) {
// a sparse
var avalues = a._values;
var aindex = a._index;
var aptr = a._ptr;
var adt = a._datatype; // validate a matrix
if (!avalues) {
throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');
} // b dense
var bdata = b._data;
var bdt = b._datatype; // rows & columns
var arows = a._size[0];
var brows = b._size[0];
var bcolumns = b._size[1]; // datatype
var dt; // addScalar signature to use
var af = addScalar; // multiplyScalar signature to use
var mf = multiplyScalar; // equalScalar signature to use
var eq = equalScalar; // zero value
var zero = 0; // process data types
if (adt && bdt && adt === bdt && typeof adt === 'string') {
// datatype
dt = adt; // find signatures that matches (dt, dt)
af = typed.find(addScalar, [dt, dt]);
mf = typed.find(multiplyScalar, [dt, dt]);
eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
zero = typed.convert(0, dt);
} // result
var cvalues = [];
var cindex = [];
var cptr = []; // c matrix
var c = a.createSparseMatrix({
values: cvalues,
index: cindex,
ptr: cptr,
size: [arows, bcolumns],
datatype: dt
}); // workspace
var x = []; // vector with marks indicating a value x[i] exists in a given column
var w = []; // loop b columns
for (var jb = 0; jb < bcolumns; jb++) {
// update ptr
cptr[jb] = cindex.length; // mark in workspace for current column
var mark = jb + 1; // rows in jb
for (var ib = 0; ib < brows; ib++) {
// b[ib, jb]
var vbij = bdata[ib][jb]; // check b[ib, jb] != 0, avoid loops
if (!eq(vbij, zero)) {
// A values & index in ib column
for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {
// a row
var ia = aindex[ka]; // check value exists in current j
if (w[ia] !== mark) {
// ia is new entry in j
w[ia] = mark; // add i to pattern of C
cindex.push(ia); // x(ia) = A
x[ia] = mf(vbij, avalues[ka]);
} else {
// i exists in C already
x[ia] = af(x[ia], mf(vbij, avalues[ka]));
}
}
}
} // copy values from x to column jb of c
for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {
// row
var ic = cindex[p]; // copy value
cvalues[p] = x[ic];
}
} // update ptr
cptr[bcolumns] = cindex.length; // return sparse matrix
return c;
}
/**
* C = A * B
*
* @param {Matrix} a SparseMatrix (MxN)
* @param {Matrix} b SparseMatrix (NxC)
*
* @return {Matrix} SparseMatrix (MxC)
*/
function _multiplySparseMatrixSparseMatrix(a, b) {
// a sparse
var avalues = a._values;
var aindex = a._index;
var aptr = a._ptr;
var adt = a._datatype; // b sparse
var bvalues = b._values;
var bindex = b._index;
var bptr = b._ptr;
var bdt = b._datatype; // rows & columns
var arows = a._size[0];
var bcolumns = b._size[1]; // flag indicating both matrices (a & b) contain data
var values = avalues && bvalues; // datatype
var dt; // addScalar signature to use
var af = addScalar; // multiplyScalar signature to use
var mf = multiplyScalar; // process data types
if (adt && bdt && adt === bdt && typeof adt === 'string') {
// datatype
dt = adt; // find signatures that matches (dt, dt)
af = typed.find(addScalar, [dt, dt]);
mf = typed.find(multiplyScalar, [dt, dt]);
} // result
var cvalues = values ? [] : undefined;
var cindex = [];
var cptr = []; // c matrix
var c = a.createSparseMatrix({
values: cvalues,
index: cindex,
ptr: cptr,
size: [arows, bcolumns],
datatype: dt
}); // workspace
var x = values ? [] : undefined; // vector with marks indicating a value x[i] exists in a given column
var w = []; // variables
var ka, ka0, ka1, kb, kb0, kb1, ia, ib; // loop b columns
for (var jb = 0; jb < bcolumns; jb++) {
// update ptr
cptr[jb] = cindex.length; // mark in workspace for current column
var mark = jb + 1; // B values & index in j
for (kb0 = bptr[jb], kb1 = bptr[jb + 1], kb = kb0; kb < kb1; kb++) {
// b row
ib = bindex[kb]; // check we need to process values
if (values) {
// loop values in a[:,ib]
for (ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {
// row
ia = aindex[ka]; // check value exists in current j
if (w[ia] !== mark) {
// ia is new entry in j
w[ia] = mark; // add i to pattern of C
cindex.push(ia); // x(ia) = A
x[ia] = mf(bvalues[kb], avalues[ka]);
} else {
// i exists in C already
x[ia] = af(x[ia], mf(bvalues[kb], avalues[ka]));
}
}
} else {
// loop values in a[:,ib]
for (ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {
// row
ia = aindex[ka]; // check value exists in current j
if (w[ia] !== mark) {
// ia is new entry in j
w[ia] = mark; // add i to pattern of C
cindex.push(ia);
}
}
}
} // check we need to process matrix values (pattern matrix)
if (values) {
// copy values from x to column jb of c
for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {
// row
var ic = cindex[p]; // copy value
cvalues[p] = x[ic];
}
}
} // update ptr
cptr[bcolumns] = cindex.length; // return sparse matrix
return c;
}
/**
* Multiply two or more values, `x * y`.
* For matrices, the matrix product is calculated.
*
* Syntax:
*
* math.multiply(x, y)
* math.multiply(x, y, z, ...)
*
* Examples:
*
* math.multiply(4, 5.2) // returns number 20.8
* math.multiply(2, 3, 4) // returns number 24
*
* const a = math.complex(2, 3)
* const b = math.complex(4, 1)
* math.multiply(a, b) // returns Complex 5 + 14i
*
* const c = [[1, 2], [4, 3]]
* const d = [[1, 2, 3], [3, -4, 7]]
* math.multiply(c, d) // returns Array [[7, -6, 17], [13, -4, 33]]
*
* const e = math.unit('2.1 km')
* math.multiply(3, e) // returns Unit 6.3 km
*
* See also:
*
* divide, prod, cross, dot
*
* @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First value to multiply
* @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second value to multiply
* @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Multiplication of `x` and `y`
*/
return typed(multiply_name, Object(utils_object["e" /* extend */])({
// we extend the signatures of multiplyScalar with signatures dealing with matrices
'Array, Array': function ArrayArray(x, y) {
// check dimensions
_validateMatrixDimensions(Object(utils_array["a" /* arraySize */])(x), Object(utils_array["a" /* arraySize */])(y)); // use dense matrix implementation
var m = this(matrix(x), matrix(y)); // return array or scalar
return Object(is["v" /* isMatrix */])(m) ? m.valueOf() : m;
},
'Matrix, Matrix': function MatrixMatrix(x, y) {
// dimensions
var xsize = x.size();
var ysize = y.size(); // check dimensions
_validateMatrixDimensions(xsize, ysize); // process dimensions
if (xsize.length === 1) {
// process y dimensions
if (ysize.length === 1) {
// Vector * Vector
return _multiplyVectorVector(x, y, xsize[0]);
} // Vector * Matrix
return _multiplyVectorMatrix(x, y);
} // process y dimensions
if (ysize.length === 1) {
// Matrix * Vector
return _multiplyMatrixVector(x, y);
} // Matrix * Matrix
return _multiplyMatrixMatrix(x, y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use Matrix * Matrix implementation
return this(x, matrix(y));
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use Matrix * Matrix implementation
return this(matrix(x, y.storage()), y);
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
return algorithm11(x, y, multiplyScalar, false);
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, multiplyScalar, false);
},
'any, SparseMatrix': function anySparseMatrix(x, y) {
return algorithm11(y, x, multiplyScalar, true);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
return algorithm14(y, x, multiplyScalar, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, multiplyScalar, false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, multiplyScalar, true).valueOf();
},
'any, any': multiplyScalar,
'any, any, ...any': function anyAnyAny(x, y, rest) {
var result = this(x, y);
for (var i = 0; i < rest.length; i++) {
result = this(result, rest[i]);
}
return result;
}
}, multiplyScalar.signatures));
});
// CONCATENATED MODULE: ./src/function/arithmetic/nthRoot.js
var nthRoot_name = 'nthRoot';
var nthRoot_dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber'];
var createNthRoot = /* #__PURE__ */Object(factory["a" /* factory */])(nthRoot_name, nthRoot_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
equalScalar = _ref.equalScalar,
_BigNumber = _ref.BigNumber;
var algorithm01 = createAlgorithm01({
typed: typed
});
var algorithm02 = createAlgorithm02({
typed: typed,
equalScalar: equalScalar
});
var algorithm06 = createAlgorithm06({
typed: typed,
equalScalar: equalScalar
});
var algorithm11 = createAlgorithm11({
typed: typed,
equalScalar: equalScalar
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Calculate the nth root of a value.
* The principal nth root of a positive real number A, is the positive real
* solution of the equation
*
* x^root = A
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.nthRoot(a)
* math.nthRoot(a, root)
*
* Examples:
*
* math.nthRoot(9, 2) // returns 3, as 3^2 == 9
* math.sqrt(9) // returns 3, as 3^2 == 9
* math.nthRoot(64, 3) // returns 4, as 4^3 == 64
*
* See also:
*
* sqrt, pow
*
* @param {number | BigNumber | Array | Matrix | Complex} a
* Value for which to calculate the nth root
* @param {number | BigNumber} [root=2] The root.
* @return {number | Complex | Array | Matrix} Returns the nth root of `a`
*/
var complexErr = '' + 'Complex number not supported in function nthRoot. ' + 'Use nthRoots instead.';
return typed(nthRoot_name, {
number: function number(x) {
return nthRootNumber(x, 2);
},
'number, number': nthRootNumber,
BigNumber: function BigNumber(x) {
return _bigNthRoot(x, new _BigNumber(2));
},
Complex: function Complex(x) {
throw new Error(complexErr);
},
'Complex, number': function ComplexNumber(x, y) {
throw new Error(complexErr);
},
'BigNumber, BigNumber': _bigNthRoot,
'Array | Matrix': function ArrayMatrix(x) {
return this(x, 2);
},
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
// density must be one (no zeros in matrix)
if (y.density() === 1) {
// sparse + sparse
return algorithm06(x, y, this);
} else {
// throw exception
throw new Error('Root must be non-zero');
}
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm02(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
// density must be one (no zeros in matrix)
if (y.density() === 1) {
// dense + sparse
return algorithm01(x, y, this, false);
} else {
// throw exception
throw new Error('Root must be non-zero');
}
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
return algorithm11(x, y, this, false);
},
'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
return algorithm14(x, y, this, false);
},
'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
// density must be one (no zeros in matrix)
if (y.density() === 1) {
// sparse - scalar
return algorithm11(y, x, this, true);
} else {
// throw exception
throw new Error('Root must be non-zero');
}
},
'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
return algorithm14(y, x, this, true);
},
'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
// use matrix implementation
return this(matrix(x), y).valueOf();
},
'number | BigNumber, Array': function numberBigNumberArray(x, y) {
// use matrix implementation
return this(x, matrix(y)).valueOf();
}
});
/**
* Calculate the nth root of a for BigNumbers, solve x^root == a
* https://rosettacode.org/wiki/Nth_root#JavaScript
* @param {BigNumber} a
* @param {BigNumber} root
* @private
*/
function _bigNthRoot(a, root) {
var precision = _BigNumber.precision;
var Big = _BigNumber.clone({
precision: precision + 2
});
var zero = new _BigNumber(0);
var one = new Big(1);
var inv = root.isNegative();
if (inv) {
root = root.neg();
}
if (root.isZero()) {
throw new Error('Root must be non-zero');
}
if (a.isNegative() && !root.abs().mod(2).equals(1)) {
throw new Error('Root must be odd when a is negative.');
} // edge cases zero and infinity
if (a.isZero()) {
return inv ? new Big(Infinity) : 0;
}
if (!a.isFinite()) {
return inv ? zero : a;
}
var x = a.abs().pow(one.div(root)); // If a < 0, we require that root is an odd integer,
// so (-1) ^ (1/root) = -1
x = a.isNeg() ? x.neg() : x;
return new _BigNumber((inv ? one.div(x) : x).toPrecision(precision));
}
});
var createNthRootNumber = /* #__PURE__ */Object(factory["a" /* factory */])(nthRoot_name, ['typed'], function (_ref2) {
var typed = _ref2.typed;
return typed(nthRoot_name, {
number: nthRootNumber,
'number, number': nthRootNumber
});
});
// CONCATENATED MODULE: ./src/function/arithmetic/sign.js
var sign_name = 'sign';
var sign_dependencies = ['typed', 'BigNumber', 'Fraction', 'complex'];
var createSign = /* #__PURE__ */Object(factory["a" /* factory */])(sign_name, sign_dependencies, function (_ref) {
var typed = _ref.typed,
_BigNumber = _ref.BigNumber,
complex = _ref.complex,
_Fraction = _ref.Fraction;
/**
* Compute the sign of a value. The sign of a value x is:
*
* - 1 when x > 0
* - -1 when x < 0
* - 0 when x == 0
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.sign(x)
*
* Examples:
*
* math.sign(3.5) // returns 1
* math.sign(-4.2) // returns -1
* math.sign(0) // returns 0
*
* math.sign([3, 5, -2, 0, 2]) // returns [1, 1, -1, 0, 1]
*
* See also:
*
* abs
*
* @param {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x
* The number for which to determine the sign
* @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit}e
* The sign of `x`
*/
return typed(sign_name, {
number: signNumber,
Complex: function Complex(x) {
return x.im === 0 ? complex(signNumber(x.re)) : x.sign();
},
BigNumber: function BigNumber(x) {
return new _BigNumber(x.cmp(0));
},
Fraction: function Fraction(x) {
return new _Fraction(x.s, 1);
},
'Array | Matrix': function ArrayMatrix(x) {
// deep map collection, skip zeros since sign(0) = 0
return deepMap(x, this, true);
},
Unit: function Unit(x) {
return this(x.value);
}
});
});
// CONCATENATED MODULE: ./src/function/arithmetic/sqrt.js
var sqrt_name = 'sqrt';
var sqrt_dependencies = ['config', 'typed', 'Complex'];
var createSqrt = /* #__PURE__ */Object(factory["a" /* factory */])(sqrt_name, sqrt_dependencies, function (_ref) {
var config = _ref.config,
typed = _ref.typed,
Complex = _ref.Complex;
/**
* Calculate the square root of a value.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.sqrt(x)
*
* Examples:
*
* math.sqrt(25) // returns 5
* math.square(5) // returns 25
* math.sqrt(-4) // returns Complex 2i
*
* See also:
*
* square, multiply, cube, cbrt, sqrtm
*
* @param {number | BigNumber | Complex | Array | Matrix | Unit} x
* Value for which to calculate the square root.
* @return {number | BigNumber | Complex | Array | Matrix | Unit}
* Returns the square root of `x`
*/
return typed('sqrt', {
number: _sqrtNumber,
Complex: function Complex(x) {
return x.sqrt();
},
BigNumber: function BigNumber(x) {
if (!x.isNegative() || config.predictable) {
return x.sqrt();
} else {
// negative value -> downgrade to number to do complex value computation
return _sqrtNumber(x.toNumber());
}
},
'Array | Matrix': function ArrayMatrix(x) {
// deep map collection, skip zeros since sqrt(0) = 0
return deepMap(x, this, true);
},
Unit: function Unit(x) {
// Someday will work for complex units when they are implemented
return x.pow(0.5);
}
});
/**
* Calculate sqrt for a number
* @param {number} x
* @returns {number | Complex} Returns the square root of x
* @private
*/
function _sqrtNumber(x) {
if (isNaN(x)) {
return NaN;
} else if (x >= 0 || config.predictable) {
return Math.sqrt(x);
} else {
return new Complex(x, 0).sqrt();
}
}
});
// CONCATENATED MODULE: ./src/function/arithmetic/square.js
var square_name = 'square';
var square_dependencies = ['typed'];
var createSquare = /* #__PURE__ */Object(factory["a" /* factory */])(square_name, square_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Compute the square of a value, `x * x`.
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.square(x)
*
* Examples:
*
* math.square(2) // returns number 4
* math.square(3) // returns number 9
* math.pow(3, 2) // returns number 9
* math.multiply(3, 3) // returns number 9
*
* math.square([1, 2, 3, 4]) // returns Array [1, 4, 9, 16]
*
* See also:
*
* multiply, cube, sqrt, pow
*
* @param {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x
* Number for which to calculate the square
* @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit}
* Squared value
*/
return typed(square_name, {
number: squareNumber,
Complex: function Complex(x) {
return x.mul(x);
},
BigNumber: function BigNumber(x) {
return x.times(x);
},
Fraction: function Fraction(x) {
return x.mul(x);
},
'Array | Matrix': function ArrayMatrix(x) {
// deep map collection, skip zeros since square(0) = 0
return deepMap(x, this, true);
},
Unit: function Unit(x) {
return x.pow(2);
}
});
});
// CONCATENATED MODULE: ./src/function/arithmetic/subtract.js
var subtract_name = 'subtract';
var subtract_dependencies = ['typed', 'matrix', 'equalScalar', 'addScalar', 'unaryMinus', 'DenseMatrix'];
var createSubtract = /* #__PURE__ */Object(factory["a" /* factory */])(subtract_name, subtract_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
equalScalar = _ref.equalScalar,
addScalar = _ref.addScalar,
unaryMinus = _ref.unaryMinus,
DenseMatrix = _ref.DenseMatrix;
// TODO: split function subtract in two: subtract and subtractScalar
var algorithm01 = createAlgorithm01({
typed: typed
});
var algorithm03 = createAlgorithm03({
typed: typed
});
var algorithm05 = createAlgorithm05({
typed: typed,
equalScalar: equalScalar
});
var algorithm10 = createAlgorithm10({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Subtract two values, `x - y`.
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.subtract(x, y)
*
* Examples:
*
* math.subtract(5.3, 2) // returns number 3.3
*
* const a = math.complex(2, 3)
* const b = math.complex(4, 1)
* math.subtract(a, b) // returns Complex -2 + 2i
*
* math.subtract([5, 7, 4], 4) // returns Array [1, 3, 0]
*
* const c = math.unit('2.1 km')
* const d = math.unit('500m')
* math.subtract(c, d) // returns Unit 1.6 km
*
* See also:
*
* add
*
* @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x
* Initial value
* @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y
* Value to subtract from `x`
* @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}
* Subtraction of `x` and `y`
*/
return typed(subtract_name, {
'number, number': function numberNumber(x, y) {
return x - y;
},
'Complex, Complex': function ComplexComplex(x, y) {
return x.sub(y);
},
'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
return x.minus(y);
},
'Fraction, Fraction': function FractionFraction(x, y) {
return x.sub(y);
},
'Unit, Unit': function UnitUnit(x, y) {
if (x.value === null) {
throw new Error('Parameter x contains a unit with undefined value');
}
if (y.value === null) {
throw new Error('Parameter y contains a unit with undefined value');
}
if (!x.equalBase(y)) {
throw new Error('Units do not match');
}
var res = x.clone();
res.value = this(res.value, y.value);
res.fixPrefix = false;
return res;
},
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
checkEqualDimensions(x, y);
return algorithm05(x, y, this);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
checkEqualDimensions(x, y);
return algorithm03(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
checkEqualDimensions(x, y);
return algorithm01(x, y, this, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
checkEqualDimensions(x, y);
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
return algorithm10(x, unaryMinus(y), addScalar);
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, this);
},
'any, SparseMatrix': function anySparseMatrix(x, y) {
return algorithm10(y, x, this, true);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
return algorithm14(y, x, this, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, this, false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, this, true).valueOf();
}
});
});
/**
* Check whether matrix x and y have the same number of dimensions.
* Throws a DimensionError when dimensions are not equal
* @param {Matrix} x
* @param {Matrix} y
*/
function checkEqualDimensions(x, y) {
var xsize = x.size();
var ysize = y.size();
if (xsize.length !== ysize.length) {
throw new DimensionError["a" /* DimensionError */](xsize.length, ysize.length);
}
}
// CONCATENATED MODULE: ./src/function/arithmetic/xgcd.js
var xgcd_name = 'xgcd';
var xgcd_dependencies = ['typed', 'config', 'matrix', 'BigNumber'];
var createXgcd = /* #__PURE__ */Object(factory["a" /* factory */])(xgcd_name, xgcd_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
matrix = _ref.matrix,
BigNumber = _ref.BigNumber;
/**
* Calculate the extended greatest common divisor for two values.
* See https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm.
*
* Syntax:
*
* math.xgcd(a, b)
*
* Examples:
*
* math.xgcd(8, 12) // returns [4, -1, 1]
* math.gcd(8, 12) // returns 4
* math.xgcd(36163, 21199) // returns [1247, -7, 12]
*
* See also:
*
* gcd, lcm
*
* @param {number | BigNumber} a An integer number
* @param {number | BigNumber} b An integer number
* @return {Array} Returns an array containing 3 integers `[div, m, n]`
* where `div = gcd(a, b)` and `a*m + b*n = div`
*/
return typed(xgcd_name, {
'number, number': function numberNumber(a, b) {
var res = xgcdNumber(a, b);
return config.matrix === 'Array' ? res : matrix(res);
},
'BigNumber, BigNumber': _xgcdBigNumber // TODO: implement support for Fraction
});
/**
* Calculate xgcd for two BigNumbers
* @param {BigNumber} a
* @param {BigNumber} b
* @return {BigNumber[]} result
* @private
*/
function _xgcdBigNumber(a, b) {
// source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm
var // used to swap two variables
t;
var // quotient
q;
var // remainder
r;
var zero = new BigNumber(0);
var one = new BigNumber(1);
var x = zero;
var lastx = one;
var y = one;
var lasty = zero;
if (!a.isInt() || !b.isInt()) {
throw new Error('Parameters in function xgcd must be integer numbers');
}
while (!b.isZero()) {
q = a.div(b).floor();
r = a.mod(b);
t = x;
x = lastx.minus(q.times(x));
lastx = t;
t = y;
y = lasty.minus(q.times(y));
lasty = t;
a = b;
b = r;
}
var res;
if (a.lt(zero)) {
res = [a.neg(), lastx.neg(), lasty.neg()];
} else {
res = [a, !a.isZero() ? lastx : 0, lasty];
}
return config.matrix === 'Array' ? res : matrix(res);
}
});
// CONCATENATED MODULE: ./src/type/matrix/utils/algorithm09.js
var algorithm09_name = 'algorithm09';
var algorithm09_dependencies = ['typed', 'equalScalar'];
var createAlgorithm09 = /* #__PURE__ */Object(factory["a" /* factory */])(algorithm09_name, algorithm09_dependencies, function (_ref) {
var typed = _ref.typed,
equalScalar = _ref.equalScalar;
/**
* Iterates over SparseMatrix A and invokes the callback function f(Aij, Bij).
* Callback function invoked NZA times, number of nonzero elements in A.
*
*
* ┌ f(Aij, Bij) ; A(i,j) !== 0
* C(i,j) = ┤
* └ 0 ; otherwise
*
*
* @param {Matrix} a The SparseMatrix instance (A)
* @param {Matrix} b The SparseMatrix instance (B)
* @param {Function} callback The f(Aij,Bij) operation to invoke
*
* @return {Matrix} SparseMatrix (C)
*
* see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
*/
return function algorithm09(a, b, callback) {
// sparse matrix arrays
var avalues = a._values;
var aindex = a._index;
var aptr = a._ptr;
var asize = a._size;
var adt = a._datatype; // sparse matrix arrays
var bvalues = b._values;
var bindex = b._index;
var bptr = b._ptr;
var bsize = b._size;
var bdt = b._datatype; // validate dimensions
if (asize.length !== bsize.length) {
throw new DimensionError["a" /* DimensionError */](asize.length, bsize.length);
} // check rows & columns
if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
} // rows & columns
var rows = asize[0];
var columns = asize[1]; // datatype
var dt; // equal signature to use
var eq = equalScalar; // zero value
var zero = 0; // callback signature to use
var cf = callback; // process data types
if (typeof adt === 'string' && adt === bdt) {
// datatype
dt = adt; // find signature that matches (dt, dt)
eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
zero = typed.convert(0, dt); // callback
cf = typed.find(callback, [dt, dt]);
} // result arrays
var cvalues = avalues && bvalues ? [] : undefined;
var cindex = [];
var cptr = []; // workspaces
var x = cvalues ? [] : undefined; // marks indicating we have a value in x for a given column
var w = []; // vars
var i, j, k, k0, k1; // loop columns
for (j = 0; j < columns; j++) {
// update cptr
cptr[j] = cindex.length; // column mark
var mark = j + 1; // check we need to process values
if (x) {
// loop B(:,j)
for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
// row
i = bindex[k]; // update workspace
w[i] = mark;
x[i] = bvalues[k];
}
} // loop A(:,j)
for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
// row
i = aindex[k]; // check we need to process values
if (x) {
// b value @ i,j
var vb = w[i] === mark ? x[i] : zero; // invoke f
var vc = cf(avalues[k], vb); // check zero value
if (!eq(vc, zero)) {
// push index
cindex.push(i); // push value
cvalues.push(vc);
}
} else {
// push index
cindex.push(i);
}
}
} // update cptr
cptr[columns] = cindex.length; // return sparse matrix
return a.createSparseMatrix({
values: cvalues,
index: cindex,
ptr: cptr,
size: [rows, columns],
datatype: dt
});
};
});
// CONCATENATED MODULE: ./src/function/arithmetic/dotMultiply.js
var dotMultiply_name = 'dotMultiply';
var dotMultiply_dependencies = ['typed', 'matrix', 'equalScalar', 'multiplyScalar'];
var createDotMultiply = /* #__PURE__ */Object(factory["a" /* factory */])(dotMultiply_name, dotMultiply_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
equalScalar = _ref.equalScalar,
multiplyScalar = _ref.multiplyScalar;
var algorithm02 = createAlgorithm02({
typed: typed,
equalScalar: equalScalar
});
var algorithm09 = createAlgorithm09({
typed: typed,
equalScalar: equalScalar
});
var algorithm11 = createAlgorithm11({
typed: typed,
equalScalar: equalScalar
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Multiply two matrices element wise. The function accepts both matrices and
* scalar values.
*
* Syntax:
*
* math.dotMultiply(x, y)
*
* Examples:
*
* math.dotMultiply(2, 4) // returns 8
*
* a = [[9, 5], [6, 1]]
* b = [[3, 2], [5, 2]]
*
* math.dotMultiply(a, b) // returns [[27, 10], [30, 2]]
* math.multiply(a, b) // returns [[52, 28], [23, 14]]
*
* See also:
*
* multiply, divide, dotDivide
*
* @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Left hand value
* @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Right hand value
* @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Multiplication of `x` and `y`
*/
return typed(dotMultiply_name, {
'any, any': multiplyScalar,
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm09(x, y, multiplyScalar, false);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm02(y, x, multiplyScalar, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm02(x, y, multiplyScalar, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, multiplyScalar);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
return algorithm11(x, y, multiplyScalar, false);
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, multiplyScalar, false);
},
'any, SparseMatrix': function anySparseMatrix(x, y) {
return algorithm11(y, x, multiplyScalar, true);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
return algorithm14(y, x, multiplyScalar, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, multiplyScalar, false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, multiplyScalar, true).valueOf();
}
});
});
// CONCATENATED MODULE: ./src/utils/bignumber/bitwise.js
/**
* Bitwise and for Bignumbers
*
* Special Cases:
* N & n = N
* n & 0 = 0
* n & -1 = n
* n & n = n
* I & I = I
* -I & -I = -I
* I & -I = 0
* I & n = n
* I & -n = I
* -I & n = 0
* -I & -n = -I
*
* @param {BigNumber} x
* @param {BigNumber} y
* @return {BigNumber} Result of `x` & `y`, is fully precise
* @private
*/
function bitAndBigNumber(x, y) {
if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
throw new Error('Integers expected in function bitAnd');
}
var BigNumber = x.constructor;
if (x.isNaN() || y.isNaN()) {
return new BigNumber(NaN);
}
if (x.isZero() || y.eq(-1) || x.eq(y)) {
return x;
}
if (y.isZero() || x.eq(-1)) {
return y;
}
if (!x.isFinite() || !y.isFinite()) {
if (!x.isFinite() && !y.isFinite()) {
if (x.isNegative() === y.isNegative()) {
return x;
}
return new BigNumber(0);
}
if (!x.isFinite()) {
if (y.isNegative()) {
return x;
}
if (x.isNegative()) {
return new BigNumber(0);
}
return y;
}
if (!y.isFinite()) {
if (x.isNegative()) {
return y;
}
if (y.isNegative()) {
return new BigNumber(0);
}
return x;
}
}
return bitwise(x, y, function (a, b) {
return a & b;
});
}
/**
* Bitwise not
* @param {BigNumber} x
* @return {BigNumber} Result of ~`x`, fully precise
*
*/
function bitNotBigNumber(x) {
if (x.isFinite() && !x.isInteger()) {
throw new Error('Integer expected in function bitNot');
}
var BigNumber = x.constructor;
var prevPrec = BigNumber.precision;
BigNumber.config({
precision: 1E9
});
var result = x.plus(new BigNumber(1));
result.s = -result.s || null;
BigNumber.config({
precision: prevPrec
});
return result;
}
/**
* Bitwise OR for BigNumbers
*
* Special Cases:
* N | n = N
* n | 0 = n
* n | -1 = -1
* n | n = n
* I | I = I
* -I | -I = -I
* I | -n = -1
* I | -I = -1
* I | n = I
* -I | n = -I
* -I | -n = -n
*
* @param {BigNumber} x
* @param {BigNumber} y
* @return {BigNumber} Result of `x` | `y`, fully precise
*/
function bitOrBigNumber(x, y) {
if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
throw new Error('Integers expected in function bitOr');
}
var BigNumber = x.constructor;
if (x.isNaN() || y.isNaN()) {
return new BigNumber(NaN);
}
var negOne = new BigNumber(-1);
if (x.isZero() || y.eq(negOne) || x.eq(y)) {
return y;
}
if (y.isZero() || x.eq(negOne)) {
return x;
}
if (!x.isFinite() || !y.isFinite()) {
if (!x.isFinite() && !x.isNegative() && y.isNegative() || x.isNegative() && !y.isNegative() && !y.isFinite()) {
return negOne;
}
if (x.isNegative() && y.isNegative()) {
return x.isFinite() ? x : y;
}
return x.isFinite() ? y : x;
}
return bitwise(x, y, function (a, b) {
return a | b;
});
}
/**
* Applies bitwise function to numbers
* @param {BigNumber} x
* @param {BigNumber} y
* @param {function (a, b)} func
* @return {BigNumber}
*/
function bitwise(x, y, func) {
var BigNumber = x.constructor;
var xBits, yBits;
var xSign = +(x.s < 0);
var ySign = +(y.s < 0);
if (xSign) {
xBits = decCoefficientToBinaryString(bitNotBigNumber(x));
for (var i = 0; i < xBits.length; ++i) {
xBits[i] ^= 1;
}
} else {
xBits = decCoefficientToBinaryString(x);
}
if (ySign) {
yBits = decCoefficientToBinaryString(bitNotBigNumber(y));
for (var _i = 0; _i < yBits.length; ++_i) {
yBits[_i] ^= 1;
}
} else {
yBits = decCoefficientToBinaryString(y);
}
var minBits, maxBits, minSign;
if (xBits.length <= yBits.length) {
minBits = xBits;
maxBits = yBits;
minSign = xSign;
} else {
minBits = yBits;
maxBits = xBits;
minSign = ySign;
}
var shortLen = minBits.length;
var longLen = maxBits.length;
var expFuncVal = func(xSign, ySign) ^ 1;
var outVal = new BigNumber(expFuncVal ^ 1);
var twoPower = new BigNumber(1);
var two = new BigNumber(2);
var prevPrec = BigNumber.precision;
BigNumber.config({
precision: 1E9
});
while (shortLen > 0) {
if (func(minBits[--shortLen], maxBits[--longLen]) === expFuncVal) {
outVal = outVal.plus(twoPower);
}
twoPower = twoPower.times(two);
}
while (longLen > 0) {
if (func(minSign, maxBits[--longLen]) === expFuncVal) {
outVal = outVal.plus(twoPower);
}
twoPower = twoPower.times(two);
}
BigNumber.config({
precision: prevPrec
});
if (expFuncVal === 0) {
outVal.s = -outVal.s;
}
return outVal;
}
/* Extracted from decimal.js, and edited to specialize. */
function decCoefficientToBinaryString(x) {
// Convert to string
var a = x.d; // array with digits
var r = a[0] + '';
for (var i = 1; i < a.length; ++i) {
var s = a[i] + '';
for (var z = 7 - s.length; z--;) {
s = '0' + s;
}
r += s;
}
var j = r.length;
while (r.charAt(j) === '0') {
j--;
}
var xe = x.e;
var str = r.slice(0, j + 1 || 1);
var strL = str.length;
if (xe > 0) {
if (++xe > strL) {
// Append zeros.
xe -= strL;
while (xe--) {
str += '0';
}
} else if (xe < strL) {
str = str.slice(0, xe) + '.' + str.slice(xe);
}
} // Convert from base 10 (decimal) to base 2
var arr = [0];
for (var _i2 = 0; _i2 < str.length;) {
var arrL = arr.length;
while (arrL--) {
arr[arrL] *= 10;
}
arr[0] += parseInt(str.charAt(_i2++)); // convert to int
for (var _j = 0; _j < arr.length; ++_j) {
if (arr[_j] > 1) {
if (arr[_j + 1] === null || arr[_j + 1] === undefined) {
arr[_j + 1] = 0;
}
arr[_j + 1] += arr[_j] >> 1;
arr[_j] &= 1;
}
}
}
return arr.reverse();
}
/**
* Bitwise XOR for BigNumbers
*
* Special Cases:
* N ^ n = N
* n ^ 0 = n
* n ^ n = 0
* n ^ -1 = ~n
* I ^ n = I
* I ^ -n = -I
* I ^ -I = -1
* -I ^ n = -I
* -I ^ -n = I
*
* @param {BigNumber} x
* @param {BigNumber} y
* @return {BigNumber} Result of `x` ^ `y`, fully precise
*
*/
function bitXor(x, y) {
if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
throw new Error('Integers expected in function bitXor');
}
var BigNumber = x.constructor;
if (x.isNaN() || y.isNaN()) {
return new BigNumber(NaN);
}
if (x.isZero()) {
return y;
}
if (y.isZero()) {
return x;
}
if (x.eq(y)) {
return new BigNumber(0);
}
var negOne = new BigNumber(-1);
if (x.eq(negOne)) {
return bitNotBigNumber(y);
}
if (y.eq(negOne)) {
return bitNotBigNumber(x);
}
if (!x.isFinite() || !y.isFinite()) {
if (!x.isFinite() && !y.isFinite()) {
return negOne;
}
return new BigNumber(x.isNegative() === y.isNegative() ? Infinity : -Infinity);
}
return bitwise(x, y, function (a, b) {
return a ^ b;
});
}
/**
* Bitwise left shift
*
* Special Cases:
* n << -n = N
* n << N = N
* N << n = N
* n << 0 = n
* 0 << n = 0
* I << I = N
* I << n = I
* n << I = I
*
* @param {BigNumber} x
* @param {BigNumber} y
* @return {BigNumber} Result of `x` << `y`
*
*/
function leftShiftBigNumber(x, y) {
if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
throw new Error('Integers expected in function leftShift');
}
var BigNumber = x.constructor;
if (x.isNaN() || y.isNaN() || y.isNegative() && !y.isZero()) {
return new BigNumber(NaN);
}
if (x.isZero() || y.isZero()) {
return x;
}
if (!x.isFinite() && !y.isFinite()) {
return new BigNumber(NaN);
} // Math.pow(2, y) is fully precise for y < 55, and fast
if (y.lt(55)) {
return x.times(Math.pow(2, y.toNumber()) + '');
}
return x.times(new BigNumber(2).pow(y));
}
/*
* Special Cases:
* n >> -n = N
* n >> N = N
* N >> n = N
* I >> I = N
* n >> 0 = n
* I >> n = I
* -I >> n = -I
* -I >> I = -I
* n >> I = I
* -n >> I = -1
* 0 >> n = 0
*
* @param {BigNumber} value
* @param {BigNumber} value
* @return {BigNumber} Result of `x` >> `y`
*
*/
function rightArithShiftBigNumber(x, y) {
if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
throw new Error('Integers expected in function rightArithShift');
}
var BigNumber = x.constructor;
if (x.isNaN() || y.isNaN() || y.isNegative() && !y.isZero()) {
return new BigNumber(NaN);
}
if (x.isZero() || y.isZero()) {
return x;
}
if (!y.isFinite()) {
if (x.isNegative()) {
return new BigNumber(-1);
}
if (!x.isFinite()) {
return new BigNumber(NaN);
}
return new BigNumber(0);
} // Math.pow(2, y) is fully precise for y < 55, and fast
if (y.lt(55)) {
return x.div(Math.pow(2, y.toNumber()) + '').floor();
}
return x.div(new BigNumber(2).pow(y)).floor();
}
// CONCATENATED MODULE: ./src/plain/number/bitwise.js
var bitwise_n1 = 'number';
var bitwise_n2 = 'number, number';
function bitAndNumber(x, y) {
if (!Object(utils_number["i" /* isInteger */])(x) || !Object(utils_number["i" /* isInteger */])(y)) {
throw new Error('Integers expected in function bitAnd');
}
return x & y;
}
bitAndNumber.signature = bitwise_n2;
function bitNotNumber(x) {
if (!Object(utils_number["i" /* isInteger */])(x)) {
throw new Error('Integer expected in function bitNot');
}
return ~x;
}
bitNotNumber.signature = bitwise_n1;
function bitOrNumber(x, y) {
if (!Object(utils_number["i" /* isInteger */])(x) || !Object(utils_number["i" /* isInteger */])(y)) {
throw new Error('Integers expected in function bitOr');
}
return x | y;
}
bitOrNumber.signature = bitwise_n2;
function bitXorNumber(x, y) {
if (!Object(utils_number["i" /* isInteger */])(x) || !Object(utils_number["i" /* isInteger */])(y)) {
throw new Error('Integers expected in function bitXor');
}
return x ^ y;
}
bitXorNumber.signature = bitwise_n2;
function leftShiftNumber(x, y) {
if (!Object(utils_number["i" /* isInteger */])(x) || !Object(utils_number["i" /* isInteger */])(y)) {
throw new Error('Integers expected in function leftShift');
}
return x << y;
}
leftShiftNumber.signature = bitwise_n2;
function rightArithShiftNumber(x, y) {
if (!Object(utils_number["i" /* isInteger */])(x) || !Object(utils_number["i" /* isInteger */])(y)) {
throw new Error('Integers expected in function rightArithShift');
}
return x >> y;
}
rightArithShiftNumber.signature = bitwise_n2;
function rightLogShiftNumber(x, y) {
if (!Object(utils_number["i" /* isInteger */])(x) || !Object(utils_number["i" /* isInteger */])(y)) {
throw new Error('Integers expected in function rightLogShift');
}
return x >>> y;
}
rightLogShiftNumber.signature = bitwise_n2;
// CONCATENATED MODULE: ./src/function/bitwise/bitAnd.js
var bitAnd_name = 'bitAnd';
var bitAnd_dependencies = ['typed', 'matrix', 'equalScalar'];
var createBitAnd = /* #__PURE__ */Object(factory["a" /* factory */])(bitAnd_name, bitAnd_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
equalScalar = _ref.equalScalar;
var algorithm02 = createAlgorithm02({
typed: typed,
equalScalar: equalScalar
});
var algorithm06 = createAlgorithm06({
typed: typed,
equalScalar: equalScalar
});
var algorithm11 = createAlgorithm11({
typed: typed,
equalScalar: equalScalar
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Bitwise AND two values, `x & y`.
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.bitAnd(x, y)
*
* Examples:
*
* math.bitAnd(53, 131) // returns number 1
*
* math.bitAnd([1, 12, 31], 42) // returns Array [0, 8, 10]
*
* See also:
*
* bitNot, bitOr, bitXor, leftShift, rightArithShift, rightLogShift
*
* @param {number | BigNumber | Array | Matrix} x First value to and
* @param {number | BigNumber | Array | Matrix} y Second value to and
* @return {number | BigNumber | Array | Matrix} AND of `x` and `y`
*/
return typed(bitAnd_name, {
'number, number': bitAndNumber,
'BigNumber, BigNumber': bitAndBigNumber,
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm06(x, y, this, false);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm02(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm02(x, y, this, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
return algorithm11(x, y, this, false);
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, this, false);
},
'any, SparseMatrix': function anySparseMatrix(x, y) {
return algorithm11(y, x, this, true);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
return algorithm14(y, x, this, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, this, false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, this, true).valueOf();
}
});
});
// CONCATENATED MODULE: ./src/function/bitwise/bitNot.js
var bitNot_name = 'bitNot';
var bitNot_dependencies = ['typed'];
var createBitNot = /* #__PURE__ */Object(factory["a" /* factory */])(bitNot_name, bitNot_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Bitwise NOT value, `~x`.
* For matrices, the function is evaluated element wise.
* For units, the function is evaluated on the best prefix base.
*
* Syntax:
*
* math.bitNot(x)
*
* Examples:
*
* math.bitNot(1) // returns number -2
*
* math.bitNot([2, -3, 4]) // returns Array [-3, 2, 5]
*
* See also:
*
* bitAnd, bitOr, bitXor, leftShift, rightArithShift, rightLogShift
*
* @param {number | BigNumber | Array | Matrix} x Value to not
* @return {number | BigNumber | Array | Matrix} NOT of `x`
*/
return typed(bitNot_name, {
number: bitNotNumber,
BigNumber: bitNotBigNumber,
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/bitwise/bitOr.js
var bitOr_name = 'bitOr';
var bitOr_dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];
var createBitOr = /* #__PURE__ */Object(factory["a" /* factory */])(bitOr_name, bitOr_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
equalScalar = _ref.equalScalar,
DenseMatrix = _ref.DenseMatrix;
var algorithm01 = createAlgorithm01({
typed: typed
});
var algorithm04 = createAlgorithm04({
typed: typed,
equalScalar: equalScalar
});
var algorithm10 = createAlgorithm10({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Bitwise OR two values, `x | y`.
* For matrices, the function is evaluated element wise.
* For units, the function is evaluated on the lowest print base.
*
* Syntax:
*
* math.bitOr(x, y)
*
* Examples:
*
* math.bitOr(1, 2) // returns number 3
*
* math.bitOr([1, 2, 3], 4) // returns Array [5, 6, 7]
*
* See also:
*
* bitAnd, bitNot, bitXor, leftShift, rightArithShift, rightLogShift
*
* @param {number | BigNumber | Array | Matrix} x First value to or
* @param {number | BigNumber | Array | Matrix} y Second value to or
* @return {number | BigNumber | Array | Matrix} OR of `x` and `y`
*/
return typed(bitOr_name, {
'number, number': bitOrNumber,
'BigNumber, BigNumber': bitOrBigNumber,
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm04(x, y, this);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm01(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm01(x, y, this, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
return algorithm10(x, y, this, false);
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, this, false);
},
'any, SparseMatrix': function anySparseMatrix(x, y) {
return algorithm10(y, x, this, true);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
return algorithm14(y, x, this, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, this, false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, this, true).valueOf();
}
});
});
// CONCATENATED MODULE: ./src/type/matrix/utils/algorithm07.js
var algorithm07_name = 'algorithm07';
var algorithm07_dependencies = ['typed', 'DenseMatrix'];
var createAlgorithm07 = /* #__PURE__ */Object(factory["a" /* factory */])(algorithm07_name, algorithm07_dependencies, function (_ref) {
var typed = _ref.typed,
DenseMatrix = _ref.DenseMatrix;
/**
* Iterates over SparseMatrix A and SparseMatrix B items (zero and nonzero) and invokes the callback function f(Aij, Bij).
* Callback function invoked MxN times.
*
* C(i,j) = f(Aij, Bij)
*
* @param {Matrix} a The SparseMatrix instance (A)
* @param {Matrix} b The SparseMatrix instance (B)
* @param {Function} callback The f(Aij,Bij) operation to invoke
*
* @return {Matrix} DenseMatrix (C)
*
* see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
*/
return function algorithm07(a, b, callback) {
// sparse matrix arrays
var asize = a._size;
var adt = a._datatype; // sparse matrix arrays
var bsize = b._size;
var bdt = b._datatype; // validate dimensions
if (asize.length !== bsize.length) {
throw new DimensionError["a" /* DimensionError */](asize.length, bsize.length);
} // check rows & columns
if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
} // rows & columns
var rows = asize[0];
var columns = asize[1]; // datatype
var dt; // zero value
var zero = 0; // callback signature to use
var cf = callback; // process data types
if (typeof adt === 'string' && adt === bdt) {
// datatype
dt = adt; // convert 0 to the same datatype
zero = typed.convert(0, dt); // callback
cf = typed.find(callback, [dt, dt]);
} // vars
var i, j; // result arrays
var cdata = []; // initialize c
for (i = 0; i < rows; i++) {
cdata[i] = [];
} // workspaces
var xa = [];
var xb = []; // marks indicating we have a value in x for a given column
var wa = [];
var wb = []; // loop columns
for (j = 0; j < columns; j++) {
// columns mark
var mark = j + 1; // scatter the values of A(:,j) into workspace
_scatter(a, j, wa, xa, mark); // scatter the values of B(:,j) into workspace
_scatter(b, j, wb, xb, mark); // loop rows
for (i = 0; i < rows; i++) {
// matrix values @ i,j
var va = wa[i] === mark ? xa[i] : zero;
var vb = wb[i] === mark ? xb[i] : zero; // invoke callback
cdata[i][j] = cf(va, vb);
}
} // return dense matrix
return new DenseMatrix({
data: cdata,
size: [rows, columns],
datatype: dt
});
};
function _scatter(m, j, w, x, mark) {
// a arrays
var values = m._values;
var index = m._index;
var ptr = m._ptr; // loop values in column j
for (var k = ptr[j], k1 = ptr[j + 1]; k < k1; k++) {
// row
var i = index[k]; // update workspace
w[i] = mark;
x[i] = values[k];
}
}
});
// CONCATENATED MODULE: ./src/function/bitwise/bitXor.js
var bitXor_name = 'bitXor';
var bitXor_dependencies = ['typed', 'matrix', 'DenseMatrix'];
var createBitXor = /* #__PURE__ */Object(factory["a" /* factory */])(bitXor_name, bitXor_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
DenseMatrix = _ref.DenseMatrix;
var algorithm03 = createAlgorithm03({
typed: typed
});
var algorithm07 = createAlgorithm07({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm12 = createAlgorithm12({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Bitwise XOR two values, `x ^ y`.
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.bitXor(x, y)
*
* Examples:
*
* math.bitXor(1, 2) // returns number 3
*
* math.bitXor([2, 3, 4], 4) // returns Array [6, 7, 0]
*
* See also:
*
* bitAnd, bitNot, bitOr, leftShift, rightArithShift, rightLogShift
*
* @param {number | BigNumber | Array | Matrix} x First value to xor
* @param {number | BigNumber | Array | Matrix} y Second value to xor
* @return {number | BigNumber | Array | Matrix} XOR of `x` and `y`
*/
return typed(bitXor_name, {
'number, number': bitXorNumber,
'BigNumber, BigNumber': bitXor,
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm07(x, y, this);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm03(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm03(x, y, this, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
return algorithm12(x, y, this, false);
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, this, false);
},
'any, SparseMatrix': function anySparseMatrix(x, y) {
return algorithm12(y, x, this, true);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
return algorithm14(y, x, this, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, this, false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, this, true).valueOf();
}
});
});
// CONCATENATED MODULE: ./src/function/complex/arg.js
var arg_name = 'arg';
var arg_dependencies = ['typed'];
var createArg = /* #__PURE__ */Object(factory["a" /* factory */])(arg_name, arg_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Compute the argument of a complex value.
* For a complex number `a + bi`, the argument is computed as `atan2(b, a)`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.arg(x)
*
* Examples:
*
* const a = math.complex(2, 2)
* math.arg(a) / math.pi // returns number 0.25
*
* const b = math.complex('2 + 3i')
* math.arg(b) // returns number 0.982793723247329
* math.atan2(3, 2) // returns number 0.982793723247329
*
* See also:
*
* re, im, conj, abs
*
* @param {number | BigNumber | Complex | Array | Matrix} x
* A complex number or array with complex numbers
* @return {number | BigNumber | Array | Matrix} The argument of x
*/
return typed(arg_name, {
number: function number(x) {
return Math.atan2(0, x);
},
BigNumber: function BigNumber(x) {
return x.constructor.atan2(0, x);
},
Complex: function Complex(x) {
return x.arg();
},
// TODO: implement BigNumber support for function arg
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/complex/conj.js
var conj_name = 'conj';
var conj_dependencies = ['typed'];
var createConj = /* #__PURE__ */Object(factory["a" /* factory */])(conj_name, conj_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Compute the complex conjugate of a complex value.
* If `x = a+bi`, the complex conjugate of `x` is `a - bi`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.conj(x)
*
* Examples:
*
* math.conj(math.complex('2 + 3i')) // returns Complex 2 - 3i
* math.conj(math.complex('2 - 3i')) // returns Complex 2 + 3i
* math.conj(math.complex('-5.2i')) // returns Complex 5.2i
*
* See also:
*
* re, im, arg, abs
*
* @param {number | BigNumber | Complex | Array | Matrix} x
* A complex number or array with complex numbers
* @return {number | BigNumber | Complex | Array | Matrix}
* The complex conjugate of x
*/
return typed(conj_name, {
number: function number(x) {
return x;
},
BigNumber: function BigNumber(x) {
return x;
},
Complex: function Complex(x) {
return x.conjugate();
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/complex/im.js
var im_name = 'im';
var im_dependencies = ['typed'];
var createIm = /* #__PURE__ */Object(factory["a" /* factory */])(im_name, im_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Get the imaginary part of a complex number.
* For a complex number `a + bi`, the function returns `b`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.im(x)
*
* Examples:
*
* const a = math.complex(2, 3)
* math.re(a) // returns number 2
* math.im(a) // returns number 3
*
* math.re(math.complex('-5.2i')) // returns number -5.2
* math.re(math.complex(2.4)) // returns number 0
*
* See also:
*
* re, conj, abs, arg
*
* @param {number | BigNumber | Complex | Array | Matrix} x
* A complex number or array with complex numbers
* @return {number | BigNumber | Array | Matrix} The imaginary part of x
*/
return typed(im_name, {
number: function number(x) {
return 0;
},
BigNumber: function BigNumber(x) {
return x.mul(0);
},
Complex: function Complex(x) {
return x.im;
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/complex/re.js
var re_name = 're';
var re_dependencies = ['typed'];
var createRe = /* #__PURE__ */Object(factory["a" /* factory */])(re_name, re_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Get the real part of a complex number.
* For a complex number `a + bi`, the function returns `a`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.re(x)
*
* Examples:
*
* const a = math.complex(2, 3)
* math.re(a) // returns number 2
* math.im(a) // returns number 3
*
* math.re(math.complex('-5.2i')) // returns number 0
* math.re(math.complex(2.4)) // returns number 2.4
*
* See also:
*
* im, conj, abs, arg
*
* @param {number | BigNumber | Complex | Array | Matrix} x
* A complex number or array with complex numbers
* @return {number | BigNumber | Array | Matrix} The real part of x
*/
return typed(re_name, {
number: function number(x) {
return x;
},
BigNumber: function BigNumber(x) {
return x;
},
Complex: function Complex(x) {
return x.re;
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/plain/number/logical.js
var logical_n1 = 'number';
var logical_n2 = 'number, number';
function notNumber(x) {
return !x;
}
notNumber.signature = logical_n1;
function orNumber(x, y) {
return !!(x || y);
}
orNumber.signature = logical_n2;
function xorNumber(x, y) {
return !!x !== !!y;
}
xorNumber.signature = logical_n2;
function andNumber(x, y) {
return !!(x && y);
}
andNumber.signature = logical_n2;
// CONCATENATED MODULE: ./src/function/logical/not.js
var not_name = 'not';
var not_dependencies = ['typed'];
var createNot = /* #__PURE__ */Object(factory["a" /* factory */])(not_name, not_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Logical `not`. Flips boolean value of a given parameter.
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.not(x)
*
* Examples:
*
* math.not(2) // returns false
* math.not(0) // returns true
* math.not(true) // returns false
*
* a = [2, -7, 0]
* math.not(a) // returns [false, false, true]
*
* See also:
*
* and, or, xor
*
* @param {number | BigNumber | Complex | Unit | Array | Matrix} x First value to check
* @return {boolean | Array | Matrix}
* Returns true when input is a zero or empty value.
*/
return typed(not_name, {
number: notNumber,
Complex: function Complex(x) {
return x.re === 0 && x.im === 0;
},
BigNumber: function BigNumber(x) {
return x.isZero() || x.isNaN();
},
Unit: function Unit(x) {
return x.value !== null ? this(x.value) : true;
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/logical/or.js
var or_name = 'or';
var or_dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];
var createOr = /* #__PURE__ */Object(factory["a" /* factory */])(or_name, or_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
equalScalar = _ref.equalScalar,
DenseMatrix = _ref.DenseMatrix;
var algorithm03 = createAlgorithm03({
typed: typed
});
var algorithm05 = createAlgorithm05({
typed: typed,
equalScalar: equalScalar
});
var algorithm12 = createAlgorithm12({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Logical `or`. Test if at least one value is defined with a nonzero/nonempty value.
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.or(x, y)
*
* Examples:
*
* math.or(2, 4) // returns true
*
* a = [2, 5, 0]
* b = [0, 22, 0]
* c = 0
*
* math.or(a, b) // returns [true, true, false]
* math.or(b, c) // returns [false, true, false]
*
* See also:
*
* and, not, xor
*
* @param {number | BigNumber | Complex | Unit | Array | Matrix} x First value to check
* @param {number | BigNumber | Complex | Unit | Array | Matrix} y Second value to check
* @return {boolean | Array | Matrix}
* Returns true when one of the inputs is defined with a nonzero/nonempty value.
*/
return typed(or_name, {
'number, number': orNumber,
'Complex, Complex': function ComplexComplex(x, y) {
return x.re !== 0 || x.im !== 0 || y.re !== 0 || y.im !== 0;
},
'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
return !x.isZero() && !x.isNaN() || !y.isZero() && !y.isNaN();
},
'Unit, Unit': function UnitUnit(x, y) {
return this(x.value || 0, y.value || 0);
},
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm05(x, y, this);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm03(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm03(x, y, this, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
return algorithm12(x, y, this, false);
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, this, false);
},
'any, SparseMatrix': function anySparseMatrix(x, y) {
return algorithm12(y, x, this, true);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
return algorithm14(y, x, this, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, this, false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, this, true).valueOf();
}
});
});
// CONCATENATED MODULE: ./src/function/logical/xor.js
var xor_name = 'xor';
var xor_dependencies = ['typed', 'matrix', 'DenseMatrix'];
var createXor = /* #__PURE__ */Object(factory["a" /* factory */])(xor_name, xor_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
DenseMatrix = _ref.DenseMatrix;
var algorithm03 = createAlgorithm03({
typed: typed
});
var algorithm07 = createAlgorithm07({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm12 = createAlgorithm12({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Logical `xor`. Test whether one and only one value is defined with a nonzero/nonempty value.
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.xor(x, y)
*
* Examples:
*
* math.xor(2, 4) // returns false
*
* a = [2, 0, 0]
* b = [2, 7, 0]
* c = 0
*
* math.xor(a, b) // returns [false, true, false]
* math.xor(a, c) // returns [true, false, false]
*
* See also:
*
* and, not, or
*
* @param {number | BigNumber | Complex | Unit | Array | Matrix} x First value to check
* @param {number | BigNumber | Complex | Unit | Array | Matrix} y Second value to check
* @return {boolean | Array | Matrix}
* Returns true when one and only one input is defined with a nonzero/nonempty value.
*/
return typed(xor_name, {
'number, number': xorNumber,
'Complex, Complex': function ComplexComplex(x, y) {
return (x.re !== 0 || x.im !== 0) !== (y.re !== 0 || y.im !== 0);
},
'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
return (!x.isZero() && !x.isNaN()) !== (!y.isZero() && !y.isNaN());
},
'Unit, Unit': function UnitUnit(x, y) {
return this(x.value || 0, y.value || 0);
},
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm07(x, y, this);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm03(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm03(x, y, this, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
return algorithm12(x, y, this, false);
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, this, false);
},
'any, SparseMatrix': function anySparseMatrix(x, y) {
return algorithm12(y, x, this, true);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
return algorithm14(y, x, this, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, this, false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, this, true).valueOf();
}
});
});
// CONCATENATED MODULE: ./src/function/matrix/concat.js
var concat_name = 'concat';
var concat_dependencies = ['typed', 'matrix', 'isInteger'];
var createConcat = /* #__PURE__ */Object(factory["a" /* factory */])(concat_name, concat_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
isInteger = _ref.isInteger;
/**
* Concatenate two or more matrices.
*
* Syntax:
*
* math.concat(A, B, C, ...)
* math.concat(A, B, C, ..., dim)
*
* Where:
*
* - `dim: number` is a zero-based dimension over which to concatenate the matrices.
* By default the last dimension of the matrices.
*
* Examples:
*
* const A = [[1, 2], [5, 6]]
* const B = [[3, 4], [7, 8]]
*
* math.concat(A, B) // returns [[1, 2, 3, 4], [5, 6, 7, 8]]
* math.concat(A, B, 0) // returns [[1, 2], [5, 6], [3, 4], [7, 8]]
* math.concat('hello', ' ', 'world') // returns 'hello world'
*
* See also:
*
* size, squeeze, subset, transpose
*
* @param {... Array | Matrix} args Two or more matrices
* @return {Array | Matrix} Concatenated matrix
*/
return typed(concat_name, {
// TODO: change signature to '...Array | Matrix, dim?' when supported
'...Array | Matrix | number | BigNumber': function ArrayMatrixNumberBigNumber(args) {
var i;
var len = args.length;
var dim = -1; // zero-based dimension
var prevDim;
var asMatrix = false;
var matrices = []; // contains multi dimensional arrays
for (i = 0; i < len; i++) {
var arg = args[i]; // test whether we need to return a Matrix (if not we return an Array)
if (Object(is["v" /* isMatrix */])(arg)) {
asMatrix = true;
}
if (Object(is["y" /* isNumber */])(arg) || Object(is["e" /* isBigNumber */])(arg)) {
if (i !== len - 1) {
throw new Error('Dimension must be specified as last argument');
} // last argument contains the dimension on which to concatenate
prevDim = dim;
dim = arg.valueOf(); // change BigNumber to number
if (!isInteger(dim)) {
throw new TypeError('Integer number expected for dimension');
}
if (dim < 0 || i > 0 && dim > prevDim) {
// TODO: would be more clear when throwing a DimensionError here
throw new IndexError["a" /* IndexError */](dim, prevDim + 1);
}
} else {
// this is a matrix or array
var m = Object(utils_object["a" /* clone */])(arg).valueOf();
var size = Object(utils_array["a" /* arraySize */])(m);
matrices[i] = m;
prevDim = dim;
dim = size.length - 1; // verify whether each of the matrices has the same number of dimensions
if (i > 0 && dim !== prevDim) {
throw new DimensionError["a" /* DimensionError */](prevDim + 1, dim + 1);
}
}
}
if (matrices.length === 0) {
throw new SyntaxError('At least one matrix expected');
}
var res = matrices.shift();
while (matrices.length) {
res = _concat(res, matrices.shift(), dim, 0);
}
return asMatrix ? matrix(res) : res;
},
'...string': function string(args) {
return args.join('');
}
});
});
/**
* Recursively concatenate two matrices.
* The contents of the matrices is not cloned.
* @param {Array} a Multi dimensional array
* @param {Array} b Multi dimensional array
* @param {number} concatDim The dimension on which to concatenate (zero-based)
* @param {number} dim The current dim (zero-based)
* @return {Array} c The concatenated matrix
* @private
*/
function _concat(a, b, concatDim, dim) {
if (dim < concatDim) {
// recurse into next dimension
if (a.length !== b.length) {
throw new DimensionError["a" /* DimensionError */](a.length, b.length);
}
var c = [];
for (var i = 0; i < a.length; i++) {
c[i] = _concat(a[i], b[i], concatDim, dim + 1);
}
return c;
} else {
// concatenate this dimension
return a.concat(b);
}
}
// CONCATENATED MODULE: ./src/function/matrix/column.js
var column_name = 'column';
var column_dependencies = ['typed', 'Index', 'matrix', 'range'];
var createColumn = /* #__PURE__ */Object(factory["a" /* factory */])(column_name, column_dependencies, function (_ref) {
var typed = _ref.typed,
Index = _ref.Index,
matrix = _ref.matrix,
range = _ref.range;
/**
* Return a column from a Matrix.
*
* Syntax:
*
* math.column(value, index)
*
* Example:
*
* // get a column
* const d = [[1, 2], [3, 4]]
* math.column(d, 1) // returns [[2], [4]]
*
* See also:
*
* row
*
* @param {Array | Matrix } value An array or matrix
* @param {number} column The index of the column
* @return {Array | Matrix} The retrieved column
*/
return typed(column_name, {
'Matrix, number': _column,
'Array, number': function ArrayNumber(value, column) {
return _column(matrix(Object(utils_object["a" /* clone */])(value)), column).valueOf();
}
});
/**
* Retrieve a column of a matrix
* @param {Matrix } value A matrix
* @param {number} column The index of the column
* @return {Matrix} The retrieved column
*/
function _column(value, column) {
// check dimensions
if (value.size().length !== 2) {
throw new Error('Only two dimensional matrix is supported');
}
Object(utils_array["q" /* validateIndex */])(column, value.size()[1]);
var rowRange = range(0, value.size()[0]);
var index = new Index(rowRange, column);
return value.subset(index);
}
});
// CONCATENATED MODULE: ./src/function/matrix/cross.js
var cross_name = 'cross';
var cross_dependencies = ['typed', 'matrix', 'subtract', 'multiply'];
var createCross = /* #__PURE__ */Object(factory["a" /* factory */])(cross_name, cross_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
subtract = _ref.subtract,
multiply = _ref.multiply;
/**
* Calculate the cross product for two vectors in three dimensional space.
* The cross product of `A = [a1, a2, a3]` and `B = [b1, b2, b3]` is defined
* as:
*
* cross(A, B) = [
* a2 * b3 - a3 * b2,
* a3 * b1 - a1 * b3,
* a1 * b2 - a2 * b1
* ]
*
* If one of the input vectors has a dimension greater than 1, the output
* vector will be a 1x3 (2-dimensional) matrix.
*
* Syntax:
*
* math.cross(x, y)
*
* Examples:
*
* math.cross([1, 1, 0], [0, 1, 1]) // Returns [1, -1, 1]
* math.cross([3, -3, 1], [4, 9, 2]) // Returns [-15, -2, 39]
* math.cross([2, 3, 4], [5, 6, 7]) // Returns [-3, 6, -3]
* math.cross([[1, 2, 3]], [[4], [5], [6]]) // Returns [[-3, 6, -3]]
*
* See also:
*
* dot, multiply
*
* @param {Array | Matrix} x First vector
* @param {Array | Matrix} y Second vector
* @return {Array | Matrix} Returns the cross product of `x` and `y`
*/
return typed(cross_name, {
'Matrix, Matrix': function MatrixMatrix(x, y) {
return matrix(_cross(x.toArray(), y.toArray()));
},
'Matrix, Array': function MatrixArray(x, y) {
return matrix(_cross(x.toArray(), y));
},
'Array, Matrix': function ArrayMatrix(x, y) {
return matrix(_cross(x, y.toArray()));
},
'Array, Array': _cross
});
/**
* Calculate the cross product for two arrays
* @param {Array} x First vector
* @param {Array} y Second vector
* @returns {Array} Returns the cross product of x and y
* @private
*/
function _cross(x, y) {
var highestDimension = Math.max(Object(utils_array["a" /* arraySize */])(x).length, Object(utils_array["a" /* arraySize */])(y).length);
x = Object(utils_array["n" /* squeeze */])(x);
y = Object(utils_array["n" /* squeeze */])(y);
var xSize = Object(utils_array["a" /* arraySize */])(x);
var ySize = Object(utils_array["a" /* arraySize */])(y);
if (xSize.length !== 1 || ySize.length !== 1 || xSize[0] !== 3 || ySize[0] !== 3) {
throw new RangeError('Vectors with length 3 expected ' + '(Size A = [' + xSize.join(', ') + '], B = [' + ySize.join(', ') + '])');
}
var product = [subtract(multiply(x[1], y[2]), multiply(x[2], y[1])), subtract(multiply(x[2], y[0]), multiply(x[0], y[2])), subtract(multiply(x[0], y[1]), multiply(x[1], y[0]))];
if (highestDimension > 1) {
return [product];
} else {
return product;
}
}
});
// CONCATENATED MODULE: ./src/function/matrix/diag.js
var diag_name = 'diag';
var diag_dependencies = ['typed', 'matrix', 'DenseMatrix', 'SparseMatrix'];
var createDiag = /* #__PURE__ */Object(factory["a" /* factory */])(diag_name, diag_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
DenseMatrix = _ref.DenseMatrix,
SparseMatrix = _ref.SparseMatrix;
/**
* Create a diagonal matrix or retrieve the diagonal of a matrix
*
* When `x` is a vector, a matrix with vector `x` on the diagonal will be returned.
* When `x` is a two dimensional matrix, the matrixes `k`th diagonal will be returned as vector.
* When k is positive, the values are placed on the super diagonal.
* When k is negative, the values are placed on the sub diagonal.
*
* Syntax:
*
* math.diag(X)
* math.diag(X, format)
* math.diag(X, k)
* math.diag(X, k, format)
*
* Examples:
*
* // create a diagonal matrix
* math.diag([1, 2, 3]) // returns [[1, 0, 0], [0, 2, 0], [0, 0, 3]]
* math.diag([1, 2, 3], 1) // returns [[0, 1, 0, 0], [0, 0, 2, 0], [0, 0, 0, 3]]
* math.diag([1, 2, 3], -1) // returns [[0, 0, 0], [1, 0, 0], [0, 2, 0], [0, 0, 3]]
*
* // retrieve the diagonal from a matrix
* const a = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
* math.diag(a) // returns [1, 5, 9]
*
* See also:
*
* ones, zeros, identity
*
* @param {Matrix | Array} x A two dimensional matrix or a vector
* @param {number | BigNumber} [k=0] The diagonal where the vector will be filled
* in or retrieved.
* @param {string} [format='dense'] The matrix storage format.
*
* @returns {Matrix | Array} Diagonal matrix from input vector, or diagonal from input matrix.
*/
return typed(diag_name, {
// FIXME: simplify this huge amount of signatures as soon as typed-function supports optional arguments
Array: function Array(x) {
return _diag(x, 0, Object(utils_array["a" /* arraySize */])(x), null);
},
'Array, number': function ArrayNumber(x, k) {
return _diag(x, k, Object(utils_array["a" /* arraySize */])(x), null);
},
'Array, BigNumber': function ArrayBigNumber(x, k) {
return _diag(x, k.toNumber(), Object(utils_array["a" /* arraySize */])(x), null);
},
'Array, string': function ArrayString(x, format) {
return _diag(x, 0, Object(utils_array["a" /* arraySize */])(x), format);
},
'Array, number, string': function ArrayNumberString(x, k, format) {
return _diag(x, k, Object(utils_array["a" /* arraySize */])(x), format);
},
'Array, BigNumber, string': function ArrayBigNumberString(x, k, format) {
return _diag(x, k.toNumber(), Object(utils_array["a" /* arraySize */])(x), format);
},
Matrix: function Matrix(x) {
return _diag(x, 0, x.size(), x.storage());
},
'Matrix, number': function MatrixNumber(x, k) {
return _diag(x, k, x.size(), x.storage());
},
'Matrix, BigNumber': function MatrixBigNumber(x, k) {
return _diag(x, k.toNumber(), x.size(), x.storage());
},
'Matrix, string': function MatrixString(x, format) {
return _diag(x, 0, x.size(), format);
},
'Matrix, number, string': function MatrixNumberString(x, k, format) {
return _diag(x, k, x.size(), format);
},
'Matrix, BigNumber, string': function MatrixBigNumberString(x, k, format) {
return _diag(x, k.toNumber(), x.size(), format);
}
});
/**
* Creeate diagonal matrix from a vector or vice versa
* @param {Array | Matrix} x
* @param {number} k
* @param {string} format Storage format for matrix. If null,
* an Array is returned
* @returns {Array | Matrix}
* @private
*/
function _diag(x, k, size, format) {
if (!Object(utils_number["i" /* isInteger */])(k)) {
throw new TypeError('Second parameter in function diag must be an integer');
}
var kSuper = k > 0 ? k : 0;
var kSub = k < 0 ? -k : 0; // check dimensions
switch (size.length) {
case 1:
return _createDiagonalMatrix(x, k, format, size[0], kSub, kSuper);
case 2:
return _getDiagonal(x, k, format, size, kSub, kSuper);
}
throw new RangeError('Matrix for function diag must be 2 dimensional');
}
function _createDiagonalMatrix(x, k, format, l, kSub, kSuper) {
// matrix size
var ms = [l + kSub, l + kSuper];
if (format && format !== 'sparse' && format !== 'dense') {
throw new TypeError("Unknown matrix type ".concat(format, "\""));
} // create diagonal matrix
var m = format === 'sparse' ? SparseMatrix.diagonal(ms, x, k) : DenseMatrix.diagonal(ms, x, k); // check we need to return a matrix
return format !== null ? m : m.valueOf();
}
function _getDiagonal(x, k, format, s, kSub, kSuper) {
// check x is a Matrix
if (Object(is["v" /* isMatrix */])(x)) {
// get diagonal matrix
var dm = x.diagonal(k); // check we need to return a matrix
if (format !== null) {
// check we need to change matrix format
if (format !== dm.storage()) {
return matrix(dm, format);
}
return dm;
}
return dm.valueOf();
} // vector size
var n = Math.min(s[0] - kSub, s[1] - kSuper); // diagonal values
var vector = []; // loop diagonal
for (var i = 0; i < n; i++) {
vector[i] = x[i + kSub][i + kSuper];
} // check we need to return a matrix
return format !== null ? matrix(vector) : vector;
}
});
// CONCATENATED MODULE: ./src/utils/function.js
function function_typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { function_typeof = function _typeof(obj) { return typeof obj; }; } else { function_typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return function_typeof(obj); }
// function utils
/**
* Memoize a given function by caching the computed result.
* The cache of a memoized function can be cleared by deleting the `cache`
* property of the function.
*
* @param {function} fn The function to be memoized.
* Must be a pure function.
* @param {function(args: Array)} [hasher] A custom hash builder.
* Is JSON.stringify by default.
* @return {function} Returns the memoized function
*/
function memoize(fn, hasher) {
return function memoize() {
if (function_typeof(memoize.cache) !== 'object') {
memoize.cache = {};
}
var args = [];
for (var i = 0; i < arguments.length; i++) {
args[i] = arguments[i];
}
var hash = hasher ? hasher(args) : JSON.stringify(args);
if (!(hash in memoize.cache)) {
memoize.cache[hash] = fn.apply(fn, args);
}
return memoize.cache[hash];
};
}
/**
* Memoize a given function by caching all results and the arguments,
* and comparing against the arguments of previous results before
* executing again.
* This is less performant than `memoize` which calculates a hash,
* which is very fast to compare. Use `memoizeCompare` only when it is
* not possible to create a unique serializable hash from the function
* arguments.
* The isEqual function must compare two sets of arguments
* and return true when equal (can be a deep equality check for example).
* @param {function} fn
* @param {function(a: *, b: *) : boolean} isEqual
* @returns {function}
*/
function memoizeCompare(fn, isEqual) {
var memoize = function memoize() {
var args = [];
for (var i = 0; i < arguments.length; i++) {
args[i] = arguments[i];
}
for (var c = 0; c < memoize.cache.length; c++) {
var cached = memoize.cache[c];
if (isEqual(args, cached.args)) {
// TODO: move this cache entry to the top so recently used entries move up?
return cached.res;
}
}
var res = fn.apply(fn, args);
memoize.cache.unshift({
args: args,
res: res
});
return res;
};
memoize.cache = [];
return memoize;
}
/**
* Find the maximum number of arguments expected by a typed function.
* @param {function} fn A typed function
* @return {number} Returns the maximum number of expected arguments.
* Returns -1 when no signatures where found on the function.
*/
function maxArgumentCount(fn) {
return Object.keys(fn.signatures || {}).reduce(function (args, signature) {
var count = (signature.match(/,/g) || []).length + 1;
return Math.max(args, count);
}, -1);
}
// CONCATENATED MODULE: ./src/function/matrix/filter.js
var filter_name = 'filter';
var filter_dependencies = ['typed'];
var createFilter = /* #__PURE__ */Object(factory["a" /* factory */])(filter_name, filter_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Filter the items in an array or one dimensional matrix.
*
* Syntax:
*
* math.filter(x, test)
*
* Examples:
*
* function isPositive (x) {
* return x > 0
* }
* math.filter([6, -2, -1, 4, 3], isPositive) // returns [6, 4, 3]
*
* math.filter(["23", "foo", "100", "55", "bar"], /[0-9]+/) // returns ["23", "100", "55"]
*
* See also:
*
* forEach, map, sort
*
* @param {Matrix | Array} x A one dimensional matrix or array to filter
* @param {Function | RegExp} test
* A function or regular expression to test items.
* All entries for which `test` returns true are returned.
* When `test` is a function, it is invoked with three parameters:
* the value of the element, the index of the element, and the
* matrix/array being traversed. The function must return a boolean.
* @return {Matrix | Array} Returns the filtered matrix.
*/
return typed('filter', {
'Array, function': _filterCallback,
'Matrix, function': function MatrixFunction(x, test) {
return x.create(_filterCallback(x.toArray(), test));
},
'Array, RegExp': utils_array["d" /* filterRegExp */],
'Matrix, RegExp': function MatrixRegExp(x, test) {
return x.create(Object(utils_array["d" /* filterRegExp */])(x.toArray(), test));
}
});
});
/**
* Filter values in a callback given a callback function
* @param {Array} x
* @param {Function} callback
* @return {Array} Returns the filtered array
* @private
*/
function _filterCallback(x, callback) {
// figure out what number of arguments the callback function expects
var args = maxArgumentCount(callback);
return Object(utils_array["c" /* filter */])(x, function (value, index, array) {
// invoke the callback function with the right number of arguments
if (args === 1) {
return callback(value);
} else if (args === 2) {
return callback(value, [index]);
} else {
// 3 or -1
return callback(value, [index], array);
}
});
}
// CONCATENATED MODULE: ./src/function/matrix/flatten.js
var flatten_name = 'flatten';
var flatten_dependencies = ['typed', 'matrix'];
var createFlatten = /* #__PURE__ */Object(factory["a" /* factory */])(flatten_name, flatten_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix;
/**
* Flatten a multi dimensional matrix into a single dimensional matrix.
*
* Syntax:
*
* math.flatten(x)
*
* Examples:
*
* math.flatten([[1,2], [3,4]]) // returns [1, 2, 3, 4]
*
* See also:
*
* concat, resize, size, squeeze
*
* @param {Matrix | Array} x Matrix to be flattened
* @return {Matrix | Array} Returns the flattened matrix
*/
return typed(flatten_name, {
Array: function Array(x) {
return Object(utils_array["e" /* flatten */])(Object(utils_object["a" /* clone */])(x));
},
Matrix: function Matrix(x) {
var flat = Object(utils_array["e" /* flatten */])(Object(utils_object["a" /* clone */])(x.toArray())); // TODO: return the same matrix type as x
return matrix(flat);
}
});
});
// CONCATENATED MODULE: ./src/function/matrix/forEach.js
var forEach_name = 'forEach';
var forEach_dependencies = ['typed'];
var createForEach = /* #__PURE__ */Object(factory["a" /* factory */])(forEach_name, forEach_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Iterate over all elements of a matrix/array, and executes the given callback function.
*
* Syntax:
*
* math.forEach(x, callback)
*
* Examples:
*
* math.forEach([1, 2, 3], function(value) {
* console.log(value)
* })
* // outputs 1, 2, 3
*
* See also:
*
* filter, map, sort
*
* @param {Matrix | Array} x The matrix to iterate on.
* @param {Function} callback The callback function is invoked with three
* parameters: the value of the element, the index
* of the element, and the Matrix/array being traversed.
*/
return typed(forEach_name, {
'Array, function': forEach_forEach,
'Matrix, function': function MatrixFunction(x, callback) {
return x.forEach(callback);
}
});
});
/**
* forEach for a multi dimensional array
* @param {Array} array
* @param {Function} callback
* @private
*/
function forEach_forEach(array, callback) {
// figure out what number of arguments the callback function expects
var args = maxArgumentCount(callback);
var recurse = function recurse(value, index) {
if (Array.isArray(value)) {
Object(utils_array["f" /* forEach */])(value, function (child, i) {
// we create a copy of the index array and append the new index value
recurse(child, index.concat(i));
});
} else {
// invoke the callback function with the right number of arguments
if (args === 1) {
callback(value);
} else if (args === 2) {
callback(value, index);
} else {
// 3 or -1
callback(value, index, array);
}
}
};
recurse(array, []);
}
// CONCATENATED MODULE: ./src/function/matrix/getMatrixDataType.js
var getMatrixDataType_name = 'getMatrixDataType';
var getMatrixDataType_dependencies = ['typed'];
var createGetMatrixDataType = /* #__PURE__ */Object(factory["a" /* factory */])(getMatrixDataType_name, getMatrixDataType_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Find the data type of all elements in a matrix or array,
* for example 'number' if all items are a number and 'Complex' if all values
* are complex numbers.
* If a matrix contains more than one data type, it will return 'mixed'.
*
* Syntax:
*
* math.getMatrixDataType(x)
*
* Examples:
*
* const x = [ [1, 2, 3], [4, 5, 6] ]
* const mixedX = [ [1, true], [2, 3] ]
* const fractionX = [ [math.fraction(1, 3)], [math.fraction(1, 3] ]
* const unitX = [ [math.unit('5cm')], [math.unit('5cm')] ]
* const bigNumberX = [ [math.bignumber(1)], [math.bignumber(0)] ]
* const sparse = math.sparse(x)
* const dense = math.matrix(x)
* math.getMatrixDataType(x) // returns 'number'
* math.getMatrixDataType(sparse) // returns 'number'
* math.getMatrixDataType(dense) // returns 'number'
* math.getMatrixDataType(mixedX) // returns 'mixed'
* math.getMatrixDataType(fractionX) // returns 'Fraction'
* math.getMatrixDataType(unitX) // returns 'Unit'
* math.getMatrixDataType(bigNumberX) // return 'BigNumber'
*
* See also:
* SparseMatrix, DenseMatrix
*
* @param {...Matrix | Array} x The Matrix with values.
*
* @return {string} A string representation of the matrix type
*/
return typed(getMatrixDataType_name, {
Array: function Array(x) {
return Object(utils_array["h" /* getArrayDataType */])(x, is["M" /* typeOf */]);
},
Matrix: function Matrix(x) {
return x.getDataType();
}
});
});
// CONCATENATED MODULE: ./src/function/matrix/identity.js
var identity_name = 'identity';
var identity_dependencies = ['typed', 'config', 'matrix', 'BigNumber', 'DenseMatrix', 'SparseMatrix'];
var createIdentity = /* #__PURE__ */Object(factory["a" /* factory */])(identity_name, identity_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
matrix = _ref.matrix,
BigNumber = _ref.BigNumber,
DenseMatrix = _ref.DenseMatrix,
SparseMatrix = _ref.SparseMatrix;
/**
* Create a 2-dimensional identity matrix with size m x n or n x n.
* The matrix has ones on the diagonal and zeros elsewhere.
*
* Syntax:
*
* math.identity(n)
* math.identity(n, format)
* math.identity(m, n)
* math.identity(m, n, format)
* math.identity([m, n])
* math.identity([m, n], format)
*
* Examples:
*
* math.identity(3) // returns [[1, 0, 0], [0, 1, 0], [0, 0, 1]]
* math.identity(3, 2) // returns [[1, 0], [0, 1], [0, 0]]
*
* const A = [[1, 2, 3], [4, 5, 6]]
* math.identity(math.size(A)) // returns [[1, 0, 0], [0, 1, 0]]
*
* See also:
*
* diag, ones, zeros, size, range
*
* @param {...number | Matrix | Array} size The size for the matrix
* @param {string} [format] The Matrix storage format
*
* @return {Matrix | Array | number} A matrix with ones on the diagonal.
*/
return typed(identity_name, {
'': function _() {
return config.matrix === 'Matrix' ? matrix([]) : [];
},
string: function string(format) {
return matrix(format);
},
'number | BigNumber': function numberBigNumber(rows) {
return _identity(rows, rows, config.matrix === 'Matrix' ? 'dense' : undefined);
},
'number | BigNumber, string': function numberBigNumberString(rows, format) {
return _identity(rows, rows, format);
},
'number | BigNumber, number | BigNumber': function numberBigNumberNumberBigNumber(rows, cols) {
return _identity(rows, cols, config.matrix === 'Matrix' ? 'dense' : undefined);
},
'number | BigNumber, number | BigNumber, string': function numberBigNumberNumberBigNumberString(rows, cols, format) {
return _identity(rows, cols, format);
},
Array: function Array(size) {
return _identityVector(size);
},
'Array, string': function ArrayString(size, format) {
return _identityVector(size, format);
},
Matrix: function Matrix(size) {
return _identityVector(size.valueOf(), size.storage());
},
'Matrix, string': function MatrixString(size, format) {
return _identityVector(size.valueOf(), format);
}
});
function _identityVector(size, format) {
switch (size.length) {
case 0:
return format ? matrix(format) : [];
case 1:
return _identity(size[0], size[0], format);
case 2:
return _identity(size[0], size[1], format);
default:
throw new Error('Vector containing two values expected');
}
}
/**
* Create an identity matrix
* @param {number | BigNumber} rows
* @param {number | BigNumber} cols
* @param {string} [format]
* @returns {Matrix}
* @private
*/
function _identity(rows, cols, format) {
// BigNumber constructor with the right precision
var Big = Object(is["e" /* isBigNumber */])(rows) || Object(is["e" /* isBigNumber */])(cols) ? BigNumber : null;
if (Object(is["e" /* isBigNumber */])(rows)) rows = rows.toNumber();
if (Object(is["e" /* isBigNumber */])(cols)) cols = cols.toNumber();
if (!Object(utils_number["i" /* isInteger */])(rows) || rows < 1) {
throw new Error('Parameters in function identity must be positive integers');
}
if (!Object(utils_number["i" /* isInteger */])(cols) || cols < 1) {
throw new Error('Parameters in function identity must be positive integers');
}
var one = Big ? new BigNumber(1) : 1;
var defaultValue = Big ? new Big(0) : 0;
var size = [rows, cols]; // check we need to return a matrix
if (format) {
// create diagonal matrix (use optimized implementation for storage format)
if (format === 'sparse') {
return SparseMatrix.diagonal(size, one, 0, defaultValue);
}
if (format === 'dense') {
return DenseMatrix.diagonal(size, one, 0, defaultValue);
}
throw new TypeError("Unknown matrix type \"".concat(format, "\""));
} // create and resize array
var res = Object(utils_array["m" /* resize */])([], size, defaultValue); // fill in ones on the diagonal
var minimum = rows < cols ? rows : cols; // fill diagonal
for (var d = 0; d < minimum; d++) {
res[d][d] = one;
}
return res;
}
});
// CONCATENATED MODULE: ./src/function/matrix/kron.js
var kron_name = 'kron';
var kron_dependencies = ['typed', 'matrix', 'multiplyScalar'];
var createKron = /* #__PURE__ */Object(factory["a" /* factory */])(kron_name, kron_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
multiplyScalar = _ref.multiplyScalar;
/**
* Calculates the kronecker product of 2 matrices or vectors.
*
* NOTE: If a one dimensional vector / matrix is given, it will be
* wrapped so its two dimensions.
* See the examples.
*
* Syntax:
*
* math.kron(x, y)
*
* Examples:
*
* math.kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])
* // returns [ [ 1, 2, 0, 0 ], [ 3, 4, 0, 0 ], [ 0, 0, 1, 2 ], [ 0, 0, 3, 4 ] ]
*
* math.kron([1,1], [2,3,4])
* // returns [ [ 2, 3, 4, 2, 3, 4 ] ]
*
* See also:
*
* multiply, dot, cross
*
* @param {Array | Matrix} x First vector
* @param {Array | Matrix} y Second vector
* @return {Array | Matrix} Returns the kronecker product of `x` and `y`
*/
return typed(kron_name, {
'Matrix, Matrix': function MatrixMatrix(x, y) {
return matrix(_kron(x.toArray(), y.toArray()));
},
'Matrix, Array': function MatrixArray(x, y) {
return matrix(_kron(x.toArray(), y));
},
'Array, Matrix': function ArrayMatrix(x, y) {
return matrix(_kron(x, y.toArray()));
},
'Array, Array': _kron
});
/**
* Calculate the kronecker product of two matrices / vectors
* @param {Array} a First vector
* @param {Array} b Second vector
* @returns {Array} Returns the kronecker product of x and y
* @private
*/
function _kron(a, b) {
// Deal with the dimensions of the matricies.
if (Object(utils_array["a" /* arraySize */])(a).length === 1) {
// Wrap it in a 2D Matrix
a = [a];
}
if (Object(utils_array["a" /* arraySize */])(b).length === 1) {
// Wrap it in a 2D Matrix
b = [b];
}
if (Object(utils_array["a" /* arraySize */])(a).length > 2 || Object(utils_array["a" /* arraySize */])(b).length > 2) {
throw new RangeError('Vectors with dimensions greater then 2 are not supported expected ' + '(Size x = ' + JSON.stringify(a.length) + ', y = ' + JSON.stringify(b.length) + ')');
}
var t = [];
var r = [];
return a.map(function (a) {
return b.map(function (b) {
r = [];
t.push(r);
return a.map(function (y) {
return b.map(function (x) {
return r.push(multiplyScalar(y, x));
});
});
});
}) && t;
}
});
// CONCATENATED MODULE: ./src/function/matrix/map.js
var map_name = 'map';
var map_dependencies = ['typed'];
var createMap = /* #__PURE__ */Object(factory["a" /* factory */])(map_name, map_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Create a new matrix or array with the results of the callback function executed on
* each entry of the matrix/array.
*
* Syntax:
*
* math.map(x, callback)
*
* Examples:
*
* math.map([1, 2, 3], function(value) {
* return value * value
* }) // returns [1, 4, 9]
*
* See also:
*
* filter, forEach, sort
*
* @param {Matrix | Array} x The matrix to iterate on.
* @param {Function} callback The callback method is invoked with three
* parameters: the value of the element, the index
* of the element, and the matrix being traversed.
* @return {Matrix | array} Transformed map of x
*/
return typed(map_name, {
'Array, function': map_map,
'Matrix, function': function MatrixFunction(x, callback) {
return x.map(callback);
}
});
});
/**
* Map for a multi dimensional array
* @param {Array} array
* @param {Function} callback
* @return {Array}
* @private
*/
function map_map(array, callback) {
// figure out what number of arguments the callback function expects
var args = maxArgumentCount(callback);
var recurse = function recurse(value, index) {
if (Array.isArray(value)) {
return value.map(function (child, i) {
// we create a copy of the index array and append the new index value
return recurse(child, index.concat(i));
});
} else {
// invoke the callback function with the right number of arguments
if (args === 1) {
return callback(value);
} else if (args === 2) {
return callback(value, index);
} else {
// 3 or -1
return callback(value, index, array);
}
}
};
return recurse(array, []);
}
// CONCATENATED MODULE: ./src/function/matrix/ones.js
var ones_name = 'ones';
var ones_dependencies = ['typed', 'config', 'matrix', 'BigNumber'];
var createOnes = /* #__PURE__ */Object(factory["a" /* factory */])(ones_name, ones_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
matrix = _ref.matrix,
BigNumber = _ref.BigNumber;
/**
* Create a matrix filled with ones. The created matrix can have one or
* multiple dimensions.
*
* Syntax:
*
* math.ones(m)
* math.ones(m, format)
* math.ones(m, n)
* math.ones(m, n, format)
* math.ones([m, n])
* math.ones([m, n], format)
* math.ones([m, n, p, ...])
* math.ones([m, n, p, ...], format)
*
* Examples:
*
* math.ones(3) // returns [1, 1, 1]
* math.ones(3, 2) // returns [[1, 1], [1, 1], [1, 1]]
* math.ones(3, 2, 'dense') // returns Dense Matrix [[1, 1], [1, 1], [1, 1]]
*
* const A = [[1, 2, 3], [4, 5, 6]]
* math.ones(math.size(A)) // returns [[1, 1, 1], [1, 1, 1]]
*
* See also:
*
* zeros, identity, size, range
*
* @param {...number | Array} size The size of each dimension of the matrix
* @param {string} [format] The Matrix storage format
*
* @return {Array | Matrix | number} A matrix filled with ones
*/
return typed('ones', {
'': function _() {
return config.matrix === 'Array' ? _ones([]) : _ones([], 'default');
},
// math.ones(m, n, p, ..., format)
// TODO: more accurate signature '...number | BigNumber, string' as soon as typed-function supports this
'...number | BigNumber | string': function numberBigNumberString(size) {
var last = size[size.length - 1];
if (typeof last === 'string') {
var format = size.pop();
return _ones(size, format);
} else if (config.matrix === 'Array') {
return _ones(size);
} else {
return _ones(size, 'default');
}
},
Array: _ones,
Matrix: function Matrix(size) {
var format = size.storage();
return _ones(size.valueOf(), format);
},
'Array | Matrix, string': function ArrayMatrixString(size, format) {
return _ones(size.valueOf(), format);
}
});
/**
* Create an Array or Matrix with ones
* @param {Array} size
* @param {string} [format='default']
* @return {Array | Matrix}
* @private
*/
function _ones(size, format) {
var hasBigNumbers = _normalize(size);
var defaultValue = hasBigNumbers ? new BigNumber(1) : 1;
_validate(size);
if (format) {
// return a matrix
var m = matrix(format);
if (size.length > 0) {
return m.resize(size, defaultValue);
}
return m;
} else {
// return an Array
var arr = [];
if (size.length > 0) {
return Object(utils_array["m" /* resize */])(arr, size, defaultValue);
}
return arr;
}
} // replace BigNumbers with numbers, returns true if size contained BigNumbers
function _normalize(size) {
var hasBigNumbers = false;
size.forEach(function (value, index, arr) {
if (Object(is["e" /* isBigNumber */])(value)) {
hasBigNumbers = true;
arr[index] = value.toNumber();
}
});
return hasBigNumbers;
} // validate arguments
function _validate(size) {
size.forEach(function (value) {
if (typeof value !== 'number' || !Object(utils_number["i" /* isInteger */])(value) || value < 0) {
throw new Error('Parameters in function ones must be positive integers');
}
});
}
});
// CONCATENATED MODULE: ./src/utils/noop.js
function noBignumber() {
throw new Error('No "bignumber" implementation available');
}
function noFraction() {
throw new Error('No "fraction" implementation available');
}
function noMatrix() {
throw new Error('No "matrix" implementation available');
}
function noIndex() {
throw new Error('No "index" implementation available');
}
function noSubset() {
throw new Error('No "matrix" implementation available');
}
// CONCATENATED MODULE: ./src/function/matrix/range.js
var range_name = 'range';
var range_dependencies = ['typed', 'config', '?matrix', '?bignumber', 'smaller', 'smallerEq', 'larger', 'largerEq'];
var range_createRange = /* #__PURE__ */Object(factory["a" /* factory */])(range_name, range_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
matrix = _ref.matrix,
bignumber = _ref.bignumber,
smaller = _ref.smaller,
smallerEq = _ref.smallerEq,
larger = _ref.larger,
largerEq = _ref.largerEq;
/**
* Create an array from a range.
* By default, the range end is excluded. This can be customized by providing
* an extra parameter `includeEnd`.
*
* Syntax:
*
* math.range(str [, includeEnd]) // Create a range from a string,
* // where the string contains the
* // start, optional step, and end,
* // separated by a colon.
* math.range(start, end [, includeEnd]) // Create a range with start and
* // end and a step size of 1.
* math.range(start, end, step [, includeEnd]) // Create a range with start, step,
* // and end.
*
* Where:
*
* - `str: string`
* A string 'start:end' or 'start:step:end'
* - `start: {number | BigNumber}`
* Start of the range
* - `end: number | BigNumber`
* End of the range, excluded by default, included when parameter includeEnd=true
* - `step: number | BigNumber`
* Step size. Default value is 1.
* - `includeEnd: boolean`
* Option to specify whether to include the end or not. False by default.
*
* Examples:
*
* math.range(2, 6) // [2, 3, 4, 5]
* math.range(2, -3, -1) // [2, 1, 0, -1, -2]
* math.range('2:1:6') // [2, 3, 4, 5]
* math.range(2, 6, true) // [2, 3, 4, 5, 6]
*
* See also:
*
* ones, zeros, size, subset
*
* @param {*} args Parameters describing the ranges `start`, `end`, and optional `step`.
* @return {Array | Matrix} range
*/
return typed(range_name, {
// TODO: simplify signatures when typed-function supports default values and optional arguments
// TODO: a number or boolean should not be converted to string here
string: _strRange,
'string, boolean': _strRange,
'number, number': function numberNumber(start, end) {
return _out(_rangeEx(start, end, 1));
},
'number, number, number': function numberNumberNumber(start, end, step) {
return _out(_rangeEx(start, end, step));
},
'number, number, boolean': function numberNumberBoolean(start, end, includeEnd) {
return includeEnd ? _out(_rangeInc(start, end, 1)) : _out(_rangeEx(start, end, 1));
},
'number, number, number, boolean': function numberNumberNumberBoolean(start, end, step, includeEnd) {
return includeEnd ? _out(_rangeInc(start, end, step)) : _out(_rangeEx(start, end, step));
},
'BigNumber, BigNumber': function BigNumberBigNumber(start, end) {
var BigNumber = start.constructor;
return _out(_bigRangeEx(start, end, new BigNumber(1)));
},
'BigNumber, BigNumber, BigNumber': function BigNumberBigNumberBigNumber(start, end, step) {
return _out(_bigRangeEx(start, end, step));
},
'BigNumber, BigNumber, boolean': function BigNumberBigNumberBoolean(start, end, includeEnd) {
var BigNumber = start.constructor;
return includeEnd ? _out(_bigRangeInc(start, end, new BigNumber(1))) : _out(_bigRangeEx(start, end, new BigNumber(1)));
},
'BigNumber, BigNumber, BigNumber, boolean': function BigNumberBigNumberBigNumberBoolean(start, end, step, includeEnd) {
return includeEnd ? _out(_bigRangeInc(start, end, step)) : _out(_bigRangeEx(start, end, step));
}
});
function _out(arr) {
if (config.matrix === 'Matrix') {
return matrix ? matrix(arr) : noMatrix();
}
return arr;
}
function _strRange(str, includeEnd) {
var r = _parse(str);
if (!r) {
throw new SyntaxError('String "' + str + '" is no valid range');
}
var fn;
if (config.number === 'BigNumber') {
if (bignumber === undefined) {
noBignumber();
}
fn = includeEnd ? _bigRangeInc : _bigRangeEx;
return _out(fn(bignumber(r.start), bignumber(r.end), bignumber(r.step)));
} else {
fn = includeEnd ? _rangeInc : _rangeEx;
return _out(fn(r.start, r.end, r.step));
}
}
/**
* Create a range with numbers. End is excluded
* @param {number} start
* @param {number} end
* @param {number} step
* @returns {Array} range
* @private
*/
function _rangeEx(start, end, step) {
var array = [];
var x = start;
if (step > 0) {
while (smaller(x, end)) {
array.push(x);
x += step;
}
} else if (step < 0) {
while (larger(x, end)) {
array.push(x);
x += step;
}
}
return array;
}
/**
* Create a range with numbers. End is included
* @param {number} start
* @param {number} end
* @param {number} step
* @returns {Array} range
* @private
*/
function _rangeInc(start, end, step) {
var array = [];
var x = start;
if (step > 0) {
while (smallerEq(x, end)) {
array.push(x);
x += step;
}
} else if (step < 0) {
while (largerEq(x, end)) {
array.push(x);
x += step;
}
}
return array;
}
/**
* Create a range with big numbers. End is excluded
* @param {BigNumber} start
* @param {BigNumber} end
* @param {BigNumber} step
* @returns {Array} range
* @private
*/
function _bigRangeEx(start, end, step) {
var zero = bignumber(0);
var array = [];
var x = start;
if (step.gt(zero)) {
while (smaller(x, end)) {
array.push(x);
x = x.plus(step);
}
} else if (step.lt(zero)) {
while (larger(x, end)) {
array.push(x);
x = x.plus(step);
}
}
return array;
}
/**
* Create a range with big numbers. End is included
* @param {BigNumber} start
* @param {BigNumber} end
* @param {BigNumber} step
* @returns {Array} range
* @private
*/
function _bigRangeInc(start, end, step) {
var zero = bignumber(0);
var array = [];
var x = start;
if (step.gt(zero)) {
while (smallerEq(x, end)) {
array.push(x);
x = x.plus(step);
}
} else if (step.lt(zero)) {
while (largerEq(x, end)) {
array.push(x);
x = x.plus(step);
}
}
return array;
}
/**
* Parse a string into a range,
* The string contains the start, optional step, and end, separated by a colon.
* If the string does not contain a valid range, null is returned.
* For example str='0:2:11'.
* @param {string} str
* @return {{start: number, end: number, step: number} | null} range Object containing properties start, end, step
* @private
*/
function _parse(str) {
var args = str.split(':'); // number
var nums = args.map(function (arg) {
// use Number and not parseFloat as Number returns NaN on invalid garbage in the string
return Number(arg);
});
var invalid = nums.some(function (num) {
return isNaN(num);
});
if (invalid) {
return null;
}
switch (nums.length) {
case 2:
return {
start: nums[0],
end: nums[1],
step: 1
};
case 3:
return {
start: nums[0],
end: nums[2],
step: nums[1]
};
default:
return null;
}
}
});
// CONCATENATED MODULE: ./src/function/matrix/reshape.js
var reshape_name = 'reshape';
var reshape_dependencies = ['typed', 'isInteger', 'matrix'];
var createReshape = /* #__PURE__ */Object(factory["a" /* factory */])(reshape_name, reshape_dependencies, function (_ref) {
var typed = _ref.typed,
isInteger = _ref.isInteger,
matrix = _ref.matrix;
/**
* Reshape a multi dimensional array to fit the specified dimensions
*
* Syntax:
*
* math.reshape(x, sizes)
*
* Examples:
*
* math.reshape([1, 2, 3, 4, 5, 6], [2, 3])
* // returns Array [[1, 2, 3], [4, 5, 6]]
*
* math.reshape([[1, 2], [3, 4]], [1, 4])
* // returns Array [[1, 2, 3, 4]]
*
* math.reshape([[1, 2], [3, 4]], [4])
* // returns Array [1, 2, 3, 4]
*
* const x = math.matrix([1, 2, 3, 4, 5, 6, 7, 8])
* math.reshape(x, [2, 2, 2])
* // returns Matrix [[[1, 2], [3, 4]], [[5, 6], [7, 8]]]
*
* See also:
*
* size, squeeze, resize
*
* @param {Array | Matrix | *} x Matrix to be reshaped
* @param {number[]} sizes One dimensional array with integral sizes for
* each dimension
*
* @return {* | Array | Matrix} A reshaped clone of matrix `x`
*
* @throws {TypeError} If `sizes` does not contain solely integers
* @throws {DimensionError} If the product of the new dimension sizes does
* not equal that of the old ones
*/
return typed(reshape_name, {
'Matrix, Array': function MatrixArray(x, sizes) {
if (x.reshape) {
return x.reshape(sizes);
} else {
return matrix(Object(utils_array["l" /* reshape */])(x.valueOf(), sizes));
}
},
'Array, Array': function ArrayArray(x, sizes) {
sizes.forEach(function (size) {
if (!isInteger(size)) {
throw new TypeError('Invalid size for dimension: ' + size);
}
});
return Object(utils_array["l" /* reshape */])(x, sizes);
}
});
});
// EXTERNAL MODULE: ./src/error/ArgumentsError.js
var ArgumentsError = __webpack_require__(12);
// CONCATENATED MODULE: ./src/function/matrix/resize.js
var resize_name = 'resize';
var resize_dependencies = ['config', 'matrix'];
var createResize = /* #__PURE__ */Object(factory["a" /* factory */])(resize_name, resize_dependencies, function (_ref) {
var config = _ref.config,
matrix = _ref.matrix;
/**
* Resize a matrix
*
* Syntax:
*
* math.resize(x, size)
* math.resize(x, size, defaultValue)
*
* Examples:
*
* math.resize([1, 2, 3, 4, 5], [3]) // returns Array [1, 2, 3]
* math.resize([1, 2, 3], [5], 0) // returns Array [1, 2, 3, 0, 0]
* math.resize(2, [2, 3], 0) // returns Matrix [[2, 0, 0], [0, 0, 0]]
* math.resize("hello", [8], "!") // returns string 'hello!!!'
*
* See also:
*
* size, squeeze, subset, reshape
*
* @param {Array | Matrix | *} x Matrix to be resized
* @param {Array | Matrix} size One dimensional array with numbers
* @param {number | string} [defaultValue=0] Zero by default, except in
* case of a string, in that case
* defaultValue = ' '
* @return {* | Array | Matrix} A resized clone of matrix `x`
*/
// TODO: rework resize to a typed-function
return function resize(x, size, defaultValue) {
if (arguments.length !== 2 && arguments.length !== 3) {
throw new ArgumentsError["a" /* ArgumentsError */]('resize', arguments.length, 2, 3);
}
if (Object(is["v" /* isMatrix */])(size)) {
size = size.valueOf(); // get Array
}
if (Object(is["e" /* isBigNumber */])(size[0])) {
// convert bignumbers to numbers
size = size.map(function (value) {
return !Object(is["e" /* isBigNumber */])(value) ? value : value.toNumber();
});
} // check x is a Matrix
if (Object(is["v" /* isMatrix */])(x)) {
// use optimized matrix implementation, return copy
return x.resize(size, defaultValue, true);
}
if (typeof x === 'string') {
// resize string
return _resizeString(x, size, defaultValue);
} // check result should be a matrix
var asMatrix = Array.isArray(x) ? false : config.matrix !== 'Array';
if (size.length === 0) {
// output a scalar
while (Array.isArray(x)) {
x = x[0];
}
return Object(utils_object["a" /* clone */])(x);
} else {
// output an array/matrix
if (!Array.isArray(x)) {
x = [x];
}
x = Object(utils_object["a" /* clone */])(x);
var res = Object(utils_array["m" /* resize */])(x, size, defaultValue);
return asMatrix ? matrix(res) : res;
}
};
/**
* Resize a string
* @param {string} str
* @param {number[]} size
* @param {string} [defaultChar=' ']
* @private
*/
function _resizeString(str, size, defaultChar) {
if (defaultChar !== undefined) {
if (typeof defaultChar !== 'string' || defaultChar.length !== 1) {
throw new TypeError('Single character expected as defaultValue');
}
} else {
defaultChar = ' ';
}
if (size.length !== 1) {
throw new DimensionError["a" /* DimensionError */](size.length, 1);
}
var len = size[0];
if (typeof len !== 'number' || !Object(utils_number["i" /* isInteger */])(len)) {
throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + Object(utils_string["d" /* format */])(size) + ')');
}
if (str.length > len) {
return str.substring(0, len);
} else if (str.length < len) {
var res = str;
for (var i = 0, ii = len - str.length; i < ii; i++) {
res += defaultChar;
}
return res;
} else {
return str;
}
}
});
// CONCATENATED MODULE: ./src/function/matrix/row.js
var row_name = 'row';
var row_dependencies = ['typed', 'Index', 'matrix', 'range'];
var createRow = /* #__PURE__ */Object(factory["a" /* factory */])(row_name, row_dependencies, function (_ref) {
var typed = _ref.typed,
Index = _ref.Index,
matrix = _ref.matrix,
range = _ref.range;
/**
* Return a row from a Matrix.
*
* Syntax:
*
* math.row(value, index)
*
* Example:
*
* // get a row
* const d = [[1, 2], [3, 4]]
* math.row(d, 1) // returns [[3, 4]]
*
* See also:
*
* column
*
* @param {Array | Matrix } value An array or matrix
* @param {number} row The index of the row
* @return {Array | Matrix} The retrieved row
*/
return typed(row_name, {
'Matrix, number': _row,
'Array, number': function ArrayNumber(value, row) {
return _row(matrix(Object(utils_object["a" /* clone */])(value)), row).valueOf();
}
});
/**
* Retrieve a row of a matrix
* @param {Matrix } value A matrix
* @param {number} row The index of the row
* @return {Matrix} The retrieved row
*/
function _row(value, row) {
// check dimensions
if (value.size().length !== 2) {
throw new Error('Only two dimensional matrix is supported');
}
Object(utils_array["q" /* validateIndex */])(row, value.size()[0]);
var columnRange = range(0, value.size()[1]);
var index = new Index(row, columnRange);
return value.subset(index);
}
});
// CONCATENATED MODULE: ./src/function/matrix/size.js
var size_name = 'size';
var size_dependencies = ['typed', 'config', '?matrix'];
var createSize = /* #__PURE__ */Object(factory["a" /* factory */])(size_name, size_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
matrix = _ref.matrix;
/**
* Calculate the size of a matrix or scalar.
*
* Syntax:
*
* math.size(x)
*
* Examples:
*
* math.size(2.3) // returns []
* math.size('hello world') // returns [11]
*
* const A = [[1, 2, 3], [4, 5, 6]]
* math.size(A) // returns [2, 3]
* math.size(math.range(1,6)) // returns [5]
*
* See also:
*
* resize, squeeze, subset
*
* @param {boolean | number | Complex | Unit | string | Array | Matrix} x A matrix
* @return {Array | Matrix} A vector with size of `x`.
*/
return typed(size_name, {
Matrix: function Matrix(x) {
return x.create(x.size());
},
Array: utils_array["a" /* arraySize */],
string: function string(x) {
return config.matrix === 'Array' ? [x.length] : matrix([x.length]);
},
'number | Complex | BigNumber | Unit | boolean | null': function numberComplexBigNumberUnitBooleanNull(x) {
// scalar
return config.matrix === 'Array' ? [] : matrix ? matrix([]) : noMatrix();
}
});
});
// CONCATENATED MODULE: ./src/function/matrix/squeeze.js
var squeeze_name = 'squeeze';
var squeeze_dependencies = ['typed', 'matrix'];
var createSqueeze = /* #__PURE__ */Object(factory["a" /* factory */])(squeeze_name, squeeze_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix;
/**
* Squeeze a matrix, remove inner and outer singleton dimensions from a matrix.
*
* Syntax:
*
* math.squeeze(x)
*
* Examples:
*
* math.squeeze([3]) // returns 3
* math.squeeze([[3]]) // returns 3
*
* const A = math.zeros(3, 1) // returns [[0], [0], [0]] (size 3x1)
* math.squeeze(A) // returns [0, 0, 0] (size 3)
*
* const B = math.zeros(1, 3) // returns [[0, 0, 0]] (size 1x3)
* math.squeeze(B) // returns [0, 0, 0] (size 3)
*
* // only inner and outer dimensions are removed
* const C = math.zeros(2, 1, 3) // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3)
* math.squeeze(C) // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3)
*
* See also:
*
* subset
*
* @param {Matrix | Array} x Matrix to be squeezed
* @return {Matrix | Array} Squeezed matrix
*/
return typed(squeeze_name, {
Array: function Array(x) {
return Object(utils_array["n" /* squeeze */])(Object(utils_object["a" /* clone */])(x));
},
Matrix: function Matrix(x) {
var res = Object(utils_array["n" /* squeeze */])(x.toArray()); // FIXME: return the same type of matrix as the input
return Array.isArray(res) ? matrix(res) : res;
},
any: function any(x) {
// scalar
return Object(utils_object["a" /* clone */])(x);
}
});
});
// CONCATENATED MODULE: ./src/utils/customs.js
function customs_typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { customs_typeof = function _typeof(obj) { return typeof obj; }; } else { customs_typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return customs_typeof(obj); }
/**
* Get a property of a plain object
* Throws an error in case the object is not a plain object or the
* property is not defined on the object itself
* @param {Object} object
* @param {string} prop
* @return {*} Returns the property value when safe
*/
function getSafeProperty(object, prop) {
// only allow getting safe properties of a plain object
if (isPlainObject(object) && isSafeProperty(object, prop)) {
return object[prop];
}
if (typeof object[prop] === 'function' && isSafeMethod(object, prop)) {
throw new Error('Cannot access method "' + prop + '" as a property');
}
throw new Error('No access to property "' + prop + '"');
}
/**
* Set a property on a plain object.
* Throws an error in case the object is not a plain object or the
* property would override an inherited property like .constructor or .toString
* @param {Object} object
* @param {string} prop
* @param {*} value
* @return {*} Returns the value
*/
// TODO: merge this function into access.js?
function setSafeProperty(object, prop, value) {
// only allow setting safe properties of a plain object
if (isPlainObject(object) && isSafeProperty(object, prop)) {
object[prop] = value;
return value;
}
throw new Error('No access to property "' + prop + '"');
}
/**
* Test whether a property is safe to use for an object.
* For example .toString and .constructor are not safe
* @param {string} prop
* @return {boolean} Returns true when safe
*/
function isSafeProperty(object, prop) {
if (!object || customs_typeof(object) !== 'object') {
return false;
} // SAFE: whitelisted
// e.g length
if (Object(utils_object["f" /* hasOwnProperty */])(safeNativeProperties, prop)) {
return true;
} // UNSAFE: inherited from Object prototype
// e.g constructor
if (prop in Object.prototype) {
// 'in' is used instead of hasOwnProperty for nodejs v0.10
// which is inconsistent on root prototypes. It is safe
// here because Object.prototype is a root object
return false;
} // UNSAFE: inherited from Function prototype
// e.g call, apply
if (prop in Function.prototype) {
// 'in' is used instead of hasOwnProperty for nodejs v0.10
// which is inconsistent on root prototypes. It is safe
// here because Function.prototype is a root object
return false;
}
return true;
}
/**
* Validate whether a method is safe.
* Throws an error when that's not the case.
* @param {Object} object
* @param {string} method
*/
// TODO: merge this function into assign.js?
function validateSafeMethod(object, method) {
if (!isSafeMethod(object, method)) {
throw new Error('No access to method "' + method + '"');
}
}
/**
* Check whether a method is safe.
* Throws an error when that's not the case (for example for `constructor`).
* @param {Object} object
* @param {string} method
* @return {boolean} Returns true when safe, false otherwise
*/
function isSafeMethod(object, method) {
if (object === null || object === undefined || typeof object[method] !== 'function') {
return false;
} // UNSAFE: ghosted
// e.g overridden toString
// Note that IE10 doesn't support __proto__ and we can't do this check there.
if (Object(utils_object["f" /* hasOwnProperty */])(object, method) && Object.getPrototypeOf && method in Object.getPrototypeOf(object)) {
return false;
} // SAFE: whitelisted
// e.g toString
if (Object(utils_object["f" /* hasOwnProperty */])(safeNativeMethods, method)) {
return true;
} // UNSAFE: inherited from Object prototype
// e.g constructor
if (method in Object.prototype) {
// 'in' is used instead of hasOwnProperty for nodejs v0.10
// which is inconsistent on root prototypes. It is safe
// here because Object.prototype is a root object
return false;
} // UNSAFE: inherited from Function prototype
// e.g call, apply
if (method in Function.prototype) {
// 'in' is used instead of hasOwnProperty for nodejs v0.10
// which is inconsistent on root prototypes. It is safe
// here because Function.prototype is a root object
return false;
}
return true;
}
function isPlainObject(object) {
return customs_typeof(object) === 'object' && object && object.constructor === Object;
}
var safeNativeProperties = {
length: true,
name: true
};
var safeNativeMethods = {
toString: true,
valueOf: true,
toLocaleString: true
};
// CONCATENATED MODULE: ./src/function/matrix/subset.js
var subset_name = 'subset';
var subset_dependencies = ['typed', 'matrix'];
var createSubset = /* #__PURE__ */Object(factory["a" /* factory */])(subset_name, subset_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix;
/**
* Get or set a subset of a matrix or string.
*
* Syntax:
* math.subset(value, index) // retrieve a subset
* math.subset(value, index, replacement [, defaultValue]) // replace a subset
*
* Examples:
*
* // get a subset
* const d = [[1, 2], [3, 4]]
* math.subset(d, math.index(1, 0)) // returns 3
* math.subset(d, math.index([0, 1], 1)) // returns [[2], [4]]
*
* // replace a subset
* const e = []
* const f = math.subset(e, math.index(0, [0, 2]), [5, 6]) // f = [[5, 6]]
* const g = math.subset(f, math.index(1, 1), 7, 0) // g = [[5, 6], [0, 7]]
*
* See also:
*
* size, resize, squeeze, index
*
* @param {Array | Matrix | string} matrix An array, matrix, or string
* @param {Index} index An index containing ranges for each
* dimension
* @param {*} [replacement] An array, matrix, or scalar.
* If provided, the subset is replaced with replacement.
* If not provided, the subset is returned
* @param {*} [defaultValue=undefined] Default value, filled in on new entries when
* the matrix is resized. If not provided,
* math.matrix elements will be left undefined.
* @return {Array | Matrix | string} Either the retrieved subset or the updated matrix.
*/
return typed(subset_name, {
// get subset
'Array, Index': function ArrayIndex(value, index) {
var m = matrix(value);
var subset = m.subset(index); // returns a Matrix
return index.isScalar() ? subset : subset.valueOf(); // return an Array (like the input)
},
'Matrix, Index': function MatrixIndex(value, index) {
return value.subset(index);
},
'Object, Index': _getObjectProperty,
'string, Index': _getSubstring,
// set subset
'Array, Index, any': function ArrayIndexAny(value, index, replacement) {
return matrix(Object(utils_object["a" /* clone */])(value)).subset(index, replacement, undefined).valueOf();
},
'Array, Index, any, any': function ArrayIndexAnyAny(value, index, replacement, defaultValue) {
return matrix(Object(utils_object["a" /* clone */])(value)).subset(index, replacement, defaultValue).valueOf();
},
'Matrix, Index, any': function MatrixIndexAny(value, index, replacement) {
return value.clone().subset(index, replacement);
},
'Matrix, Index, any, any': function MatrixIndexAnyAny(value, index, replacement, defaultValue) {
return value.clone().subset(index, replacement, defaultValue);
},
'string, Index, string': _setSubstring,
'string, Index, string, string': _setSubstring,
'Object, Index, any': _setObjectProperty
});
});
/**
* Retrieve a subset of a string
* @param {string} str string from which to get a substring
* @param {Index} index An index containing ranges for each dimension
* @returns {string} substring
* @private
*/
function _getSubstring(str, index) {
if (!Object(is["t" /* isIndex */])(index)) {
// TODO: better error message
throw new TypeError('Index expected');
}
if (index.size().length !== 1) {
throw new DimensionError["a" /* DimensionError */](index.size().length, 1);
} // validate whether the range is out of range
var strLen = str.length;
Object(utils_array["q" /* validateIndex */])(index.min()[0], strLen);
Object(utils_array["q" /* validateIndex */])(index.max()[0], strLen);
var range = index.dimension(0);
var substr = '';
range.forEach(function (v) {
substr += str.charAt(v);
});
return substr;
}
/**
* Replace a substring in a string
* @param {string} str string to be replaced
* @param {Index} index An index containing ranges for each dimension
* @param {string} replacement Replacement string
* @param {string} [defaultValue] Default value to be uses when resizing
* the string. is ' ' by default
* @returns {string} result
* @private
*/
function _setSubstring(str, index, replacement, defaultValue) {
if (!index || index.isIndex !== true) {
// TODO: better error message
throw new TypeError('Index expected');
}
if (index.size().length !== 1) {
throw new DimensionError["a" /* DimensionError */](index.size().length, 1);
}
if (defaultValue !== undefined) {
if (typeof defaultValue !== 'string' || defaultValue.length !== 1) {
throw new TypeError('Single character expected as defaultValue');
}
} else {
defaultValue = ' ';
}
var range = index.dimension(0);
var len = range.size()[0];
if (len !== replacement.length) {
throw new DimensionError["a" /* DimensionError */](range.size()[0], replacement.length);
} // validate whether the range is out of range
var strLen = str.length;
Object(utils_array["q" /* validateIndex */])(index.min()[0]);
Object(utils_array["q" /* validateIndex */])(index.max()[0]); // copy the string into an array with characters
var chars = [];
for (var i = 0; i < strLen; i++) {
chars[i] = str.charAt(i);
}
range.forEach(function (v, i) {
chars[v] = replacement.charAt(i[0]);
}); // initialize undefined characters with a space
if (chars.length > strLen) {
for (var _i = strLen - 1, _len = chars.length; _i < _len; _i++) {
if (!chars[_i]) {
chars[_i] = defaultValue;
}
}
}
return chars.join('');
}
/**
* Retrieve a property from an object
* @param {Object} object
* @param {Index} index
* @return {*} Returns the value of the property
* @private
*/
function _getObjectProperty(object, index) {
if (index.size().length !== 1) {
throw new DimensionError["a" /* DimensionError */](index.size(), 1);
}
var key = index.dimension(0);
if (typeof key !== 'string') {
throw new TypeError('String expected as index to retrieve an object property');
}
return getSafeProperty(object, key);
}
/**
* Set a property on an object
* @param {Object} object
* @param {Index} index
* @param {*} replacement
* @return {*} Returns the updated object
* @private
*/
function _setObjectProperty(object, index, replacement) {
if (index.size().length !== 1) {
throw new DimensionError["a" /* DimensionError */](index.size(), 1);
}
var key = index.dimension(0);
if (typeof key !== 'string') {
throw new TypeError('String expected as index to retrieve an object property');
} // clone the object, and apply the property to the clone
var updated = Object(utils_object["a" /* clone */])(object);
setSafeProperty(updated, key, replacement);
return updated;
}
// CONCATENATED MODULE: ./src/function/matrix/transpose.js
var transpose_name = 'transpose';
var transpose_dependencies = ['typed', 'matrix'];
var createTranspose = /* #__PURE__ */Object(factory["a" /* factory */])(transpose_name, transpose_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix;
/**
* Transpose a matrix. All values of the matrix are reflected over its
* main diagonal. Only applicable to two dimensional matrices containing
* a vector (i.e. having size `[1,n]` or `[n,1]`). One dimensional
* vectors and scalars return the input unchanged.
*
* Syntax:
*
* math.transpose(x)
*
* Examples:
*
* const A = [[1, 2, 3], [4, 5, 6]]
* math.transpose(A) // returns [[1, 4], [2, 5], [3, 6]]
*
* See also:
*
* diag, inv, subset, squeeze
*
* @param {Array | Matrix} x Matrix to be transposed
* @return {Array | Matrix} The transposed matrix
*/
return typed('transpose', {
Array: function Array(x) {
// use dense matrix implementation
return this(matrix(x)).valueOf();
},
Matrix: function Matrix(x) {
// matrix size
var size = x.size(); // result
var c; // process dimensions
switch (size.length) {
case 1:
// vector
c = x.clone();
break;
case 2:
{
// rows and columns
var rows = size[0];
var columns = size[1]; // check columns
if (columns === 0) {
// throw exception
throw new RangeError('Cannot transpose a 2D matrix with no columns (size: ' + Object(utils_string["d" /* format */])(size) + ')');
} // process storage format
switch (x.storage()) {
case 'dense':
c = _denseTranspose(x, rows, columns);
break;
case 'sparse':
c = _sparseTranspose(x, rows, columns);
break;
}
}
break;
default:
// multi dimensional
throw new RangeError('Matrix must be a vector or two dimensional (size: ' + Object(utils_string["d" /* format */])(this._size) + ')');
}
return c;
},
// scalars
any: function any(x) {
return Object(utils_object["a" /* clone */])(x);
}
});
function _denseTranspose(m, rows, columns) {
// matrix array
var data = m._data; // transposed matrix data
var transposed = [];
var transposedRow; // loop columns
for (var j = 0; j < columns; j++) {
// initialize row
transposedRow = transposed[j] = []; // loop rows
for (var i = 0; i < rows; i++) {
// set data
transposedRow[i] = Object(utils_object["a" /* clone */])(data[i][j]);
}
} // return matrix
return m.createDenseMatrix({
data: transposed,
size: [columns, rows],
datatype: m._datatype
});
}
function _sparseTranspose(m, rows, columns) {
// matrix arrays
var values = m._values;
var index = m._index;
var ptr = m._ptr; // result matrices
var cvalues = values ? [] : undefined;
var cindex = [];
var cptr = []; // row counts
var w = [];
for (var x = 0; x < rows; x++) {
w[x] = 0;
} // vars
var p, l, j; // loop values in matrix
for (p = 0, l = index.length; p < l; p++) {
// number of values in row
w[index[p]]++;
} // cumulative sum
var sum = 0; // initialize cptr with the cummulative sum of row counts
for (var i = 0; i < rows; i++) {
// update cptr
cptr.push(sum); // update sum
sum += w[i]; // update w
w[i] = cptr[i];
} // update cptr
cptr.push(sum); // loop columns
for (j = 0; j < columns; j++) {
// values & index in column
for (var k0 = ptr[j], k1 = ptr[j + 1], k = k0; k < k1; k++) {
// C values & index
var q = w[index[k]]++; // C[j, i] = A[i, j]
cindex[q] = j; // check we need to process values (pattern matrix)
if (values) {
cvalues[q] = Object(utils_object["a" /* clone */])(values[k]);
}
}
} // return matrix
return m.createSparseMatrix({
values: cvalues,
index: cindex,
ptr: cptr,
size: [columns, rows],
datatype: m._datatype
});
}
});
// CONCATENATED MODULE: ./src/function/matrix/ctranspose.js
var ctranspose_name = 'ctranspose';
var ctranspose_dependencies = ['typed', 'transpose', 'conj'];
var createCtranspose = /* #__PURE__ */Object(factory["a" /* factory */])(ctranspose_name, ctranspose_dependencies, function (_ref) {
var typed = _ref.typed,
transpose = _ref.transpose,
conj = _ref.conj;
/**
* Transpose and complex conjugate a matrix. All values of the matrix are
* reflected over its main diagonal and then the complex conjugate is
* taken. This is equivalent to complex conjugation for scalars and
* vectors.
*
* Syntax:
*
* math.ctranspose(x)
*
* Examples:
*
* const A = [[1, 2, 3], [4, 5, math.complex(6,7)]]
* math.ctranspose(A) // returns [[1, 4], [2, 5], [3, {re:6,im:7}]]
*
* See also:
*
* transpose, diag, inv, subset, squeeze
*
* @param {Array | Matrix} x Matrix to be ctransposed
* @return {Array | Matrix} The ctransposed matrix
*/
return typed(ctranspose_name, {
any: function any(x) {
return conj(transpose(x));
}
});
});
// CONCATENATED MODULE: ./src/function/matrix/zeros.js
var zeros_name = 'zeros';
var zeros_dependencies = ['typed', 'config', 'matrix', 'BigNumber'];
var createZeros = /* #__PURE__ */Object(factory["a" /* factory */])(zeros_name, zeros_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
matrix = _ref.matrix,
BigNumber = _ref.BigNumber;
/**
* Create a matrix filled with zeros. The created matrix can have one or
* multiple dimensions.
*
* Syntax:
*
* math.zeros(m)
* math.zeros(m, format)
* math.zeros(m, n)
* math.zeros(m, n, format)
* math.zeros([m, n])
* math.zeros([m, n], format)
*
* Examples:
*
* math.zeros(3) // returns [0, 0, 0]
* math.zeros(3, 2) // returns [[0, 0], [0, 0], [0, 0]]
* math.zeros(3, 'dense') // returns [0, 0, 0]
*
* const A = [[1, 2, 3], [4, 5, 6]]
* math.zeros(math.size(A)) // returns [[0, 0, 0], [0, 0, 0]]
*
* See also:
*
* ones, identity, size, range
*
* @param {...number | Array} size The size of each dimension of the matrix
* @param {string} [format] The Matrix storage format
*
* @return {Array | Matrix} A matrix filled with zeros
*/
return typed(zeros_name, {
'': function _() {
return config.matrix === 'Array' ? _zeros([]) : _zeros([], 'default');
},
// math.zeros(m, n, p, ..., format)
// TODO: more accurate signature '...number | BigNumber, string' as soon as typed-function supports this
'...number | BigNumber | string': function numberBigNumberString(size) {
var last = size[size.length - 1];
if (typeof last === 'string') {
var format = size.pop();
return _zeros(size, format);
} else if (config.matrix === 'Array') {
return _zeros(size);
} else {
return _zeros(size, 'default');
}
},
Array: _zeros,
Matrix: function Matrix(size) {
var format = size.storage();
return _zeros(size.valueOf(), format);
},
'Array | Matrix, string': function ArrayMatrixString(size, format) {
return _zeros(size.valueOf(), format);
}
});
/**
* Create an Array or Matrix with zeros
* @param {Array} size
* @param {string} [format='default']
* @return {Array | Matrix}
* @private
*/
function _zeros(size, format) {
var hasBigNumbers = _normalize(size);
var defaultValue = hasBigNumbers ? new BigNumber(0) : 0;
_validate(size);
if (format) {
// return a matrix
var m = matrix(format);
if (size.length > 0) {
return m.resize(size, defaultValue);
}
return m;
} else {
// return an Array
var arr = [];
if (size.length > 0) {
return Object(utils_array["m" /* resize */])(arr, size, defaultValue);
}
return arr;
}
} // replace BigNumbers with numbers, returns true if size contained BigNumbers
function _normalize(size) {
var hasBigNumbers = false;
size.forEach(function (value, index, arr) {
if (Object(is["e" /* isBigNumber */])(value)) {
hasBigNumbers = true;
arr[index] = value.toNumber();
}
});
return hasBigNumbers;
} // validate arguments
function _validate(size) {
size.forEach(function (value) {
if (typeof value !== 'number' || !Object(utils_number["i" /* isInteger */])(value) || value < 0) {
throw new Error('Parameters in function zeros must be positive integers');
}
});
}
}); // TODO: zeros contains almost the same code as ones. Reuse this?
// CONCATENATED MODULE: ./src/function/special/erf.js
var erf_name = 'erf';
var erf_dependencies = ['typed'];
var createErf = /* #__PURE__ */Object(factory["a" /* factory */])(erf_name, erf_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Compute the erf function of a value using a rational Chebyshev
* approximations for different intervals of x.
*
* This is a translation of W. J. Cody's Fortran implementation from 1987
* ( https://www.netlib.org/specfun/erf ). See the AMS publication
* "Rational Chebyshev Approximations for the Error Function" by W. J. Cody
* for an explanation of this process.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.erf(x)
*
* Examples:
*
* math.erf(0.2) // returns 0.22270258921047847
* math.erf(-0.5) // returns -0.5204998778130465
* math.erf(4) // returns 0.9999999845827421
*
* @param {number | Array | Matrix} x A real number
* @return {number | Array | Matrix} The erf of `x`
*/
return typed('name', {
number: function number(x) {
var y = Math.abs(x);
if (y >= MAX_NUM) {
return Object(utils_number["n" /* sign */])(x);
}
if (y <= THRESH) {
return Object(utils_number["n" /* sign */])(x) * erf1(y);
}
if (y <= 4.0) {
return Object(utils_number["n" /* sign */])(x) * (1 - erfc2(y));
}
return Object(utils_number["n" /* sign */])(x) * (1 - erfc3(y));
},
'Array | Matrix': function ArrayMatrix(n) {
return deepMap(n, this);
} // TODO: For complex numbers, use the approximation for the Faddeeva function
// from "More Efficient Computation of the Complex Error Function" (AMS)
});
/**
* Approximates the error function erf() for x <= 0.46875 using this function:
* n
* erf(x) = x * sum (p_j * x^(2j)) / (q_j * x^(2j))
* j=0
*/
function erf1(y) {
var ysq = y * y;
var xnum = erf_P[0][4] * ysq;
var xden = ysq;
var i;
for (i = 0; i < 3; i += 1) {
xnum = (xnum + erf_P[0][i]) * ysq;
xden = (xden + Q[0][i]) * ysq;
}
return y * (xnum + erf_P[0][3]) / (xden + Q[0][3]);
}
/**
* Approximates the complement of the error function erfc() for
* 0.46875 <= x <= 4.0 using this function:
* n
* erfc(x) = e^(-x^2) * sum (p_j * x^j) / (q_j * x^j)
* j=0
*/
function erfc2(y) {
var xnum = erf_P[1][8] * y;
var xden = y;
var i;
for (i = 0; i < 7; i += 1) {
xnum = (xnum + erf_P[1][i]) * y;
xden = (xden + Q[1][i]) * y;
}
var result = (xnum + erf_P[1][7]) / (xden + Q[1][7]);
var ysq = parseInt(y * 16) / 16;
var del = (y - ysq) * (y + ysq);
return Math.exp(-ysq * ysq) * Math.exp(-del) * result;
}
/**
* Approximates the complement of the error function erfc() for x > 4.0 using
* this function:
*
* erfc(x) = (e^(-x^2) / x) * [ 1/sqrt(pi) +
* n
* 1/(x^2) * sum (p_j * x^(-2j)) / (q_j * x^(-2j)) ]
* j=0
*/
function erfc3(y) {
var ysq = 1 / (y * y);
var xnum = erf_P[2][5] * ysq;
var xden = ysq;
var i;
for (i = 0; i < 4; i += 1) {
xnum = (xnum + erf_P[2][i]) * ysq;
xden = (xden + Q[2][i]) * ysq;
}
var result = ysq * (xnum + erf_P[2][4]) / (xden + Q[2][4]);
result = (SQRPI - result) / y;
ysq = parseInt(y * 16) / 16;
var del = (y - ysq) * (y + ysq);
return Math.exp(-ysq * ysq) * Math.exp(-del) * result;
}
});
/**
* Upper bound for the first approximation interval, 0 <= x <= THRESH
* @constant
*/
var THRESH = 0.46875;
/**
* Constant used by W. J. Cody's Fortran77 implementation to denote sqrt(pi)
* @constant
*/
var SQRPI = 5.6418958354775628695e-1;
/**
* Coefficients for each term of the numerator sum (p_j) for each approximation
* interval (see W. J. Cody's paper for more details)
* @constant
*/
var erf_P = [[3.16112374387056560e00, 1.13864154151050156e02, 3.77485237685302021e02, 3.20937758913846947e03, 1.85777706184603153e-1], [5.64188496988670089e-1, 8.88314979438837594e00, 6.61191906371416295e01, 2.98635138197400131e02, 8.81952221241769090e02, 1.71204761263407058e03, 2.05107837782607147e03, 1.23033935479799725e03, 2.15311535474403846e-8], [3.05326634961232344e-1, 3.60344899949804439e-1, 1.25781726111229246e-1, 1.60837851487422766e-2, 6.58749161529837803e-4, 1.63153871373020978e-2]];
/**
* Coefficients for each term of the denominator sum (q_j) for each approximation
* interval (see W. J. Cody's paper for more details)
* @constant
*/
var Q = [[2.36012909523441209e01, 2.44024637934444173e02, 1.28261652607737228e03, 2.84423683343917062e03], [1.57449261107098347e01, 1.17693950891312499e02, 5.37181101862009858e02, 1.62138957456669019e03, 3.29079923573345963e03, 4.36261909014324716e03, 3.43936767414372164e03, 1.23033935480374942e03], [2.56852019228982242e00, 1.87295284992346047e00, 5.27905102951428412e-1, 6.05183413124413191e-2, 2.33520497626869185e-3]];
/**
* Maximum/minimum safe numbers to input to erf() (in ES6+, this number is
* Number.[MAX|MIN]_SAFE_INTEGER). erf() for all numbers beyond this limit will
* return 1
*/
var MAX_NUM = Math.pow(2, 53);
// CONCATENATED MODULE: ./src/function/statistics/mode.js
var mode_name = 'mode';
var mode_dependencies = ['typed', 'isNaN', 'isNumeric'];
var createMode = /* #__PURE__ */Object(factory["a" /* factory */])(mode_name, mode_dependencies, function (_ref) {
var typed = _ref.typed,
isNaN = _ref.isNaN,
isNumeric = _ref.isNumeric;
/**
* Computes the mode of a set of numbers or a list with values(numbers or characters).
* If there are more than one modes, it returns a list of those values.
*
* Syntax:
*
* math.mode(a, b, c, ...)
* math.mode(A)
*
* Examples:
*
* math.mode(2, 1, 4, 3, 1) // returns [1]
* math.mode([1, 2.7, 3.2, 4, 2.7]) // returns [2.7]
* math.mode(1, 4, 6, 1, 6) // returns [1, 6]
* math.mode('a','a','b','c') // returns ["a"]
* math.mode(1, 1.5, 'abc') // returns [1, 1.5, "abc"]
*
* See also:
*
* median,
* mean
*
* @param {... *} args A single matrix
* @return {*} The mode of all values
*/
return typed(mode_name, {
'Array | Matrix': _mode,
'...': function _(args) {
return _mode(args);
}
});
/**
* Calculates the mode in an 1-dimensional array
* @param {Array} values
* @return {Array} mode
* @private
*/
function _mode(values) {
values = Object(utils_array["e" /* flatten */])(values.valueOf());
var num = values.length;
if (num === 0) {
throw new Error('Cannot calculate mode of an empty array');
}
var count = {};
var mode = [];
var max = 0;
for (var i = 0; i < values.length; i++) {
var value = values[i];
if (isNumeric(value) && isNaN(value)) {
throw new Error('Cannot calculate mode of an array containing NaN values');
}
if (!(value in count)) {
count[value] = 0;
}
count[value]++;
if (count[value] === max) {
mode.push(value);
} else if (count[value] > max) {
max = count[value];
mode = [value];
}
}
return mode;
}
});
// CONCATENATED MODULE: ./src/function/statistics/utils/improveErrorMessage.js
/**
* Improve error messages for statistics functions. Errors are typically
* thrown in an internally used function like larger, causing the error
* not to mention the function (like max) which is actually used by the user.
*
* @param {Error} err
* @param {String} fnName
* @param {*} [value]
* @return {Error}
*/
function improveErrorMessage(err, fnName, value) {
// TODO: add information with the index (also needs transform in expression parser)
var details;
if (String(err).indexOf('Unexpected type') !== -1) {
details = arguments.length > 2 ? ' (type: ' + Object(is["M" /* typeOf */])(value) + ', value: ' + JSON.stringify(value) + ')' : ' (type: ' + err.data.actual + ')';
return new TypeError('Cannot calculate ' + fnName + ', unexpected type of argument' + details);
}
if (String(err).indexOf('complex numbers') !== -1) {
details = arguments.length > 2 ? ' (type: ' + Object(is["M" /* typeOf */])(value) + ', value: ' + JSON.stringify(value) + ')' : '';
return new TypeError('Cannot calculate ' + fnName + ', no ordering relation is defined for complex numbers' + details);
}
return err;
}
// CONCATENATED MODULE: ./src/function/statistics/prod.js
var prod_name = 'prod';
var prod_dependencies = ['typed', 'config', 'multiplyScalar', 'numeric'];
var createProd = /* #__PURE__ */Object(factory["a" /* factory */])(prod_name, prod_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
multiplyScalar = _ref.multiplyScalar,
numeric = _ref.numeric;
/**
* Compute the product of a matrix or a list with values.
* In case of a (multi dimensional) array or matrix, the sum of all
* elements will be calculated.
*
* Syntax:
*
* math.prod(a, b, c, ...)
* math.prod(A)
*
* Examples:
*
* math.multiply(2, 3) // returns 6
* math.prod(2, 3) // returns 6
* math.prod(2, 3, 4) // returns 24
* math.prod([2, 3, 4]) // returns 24
* math.prod([[2, 5], [4, 3]]) // returns 120
*
* See also:
*
* mean, median, min, max, sum, std, variance
*
* @param {... *} args A single matrix or or multiple scalar values
* @return {*} The product of all values
*/
return typed(prod_name, {
// prod([a, b, c, d, ...])
'Array | Matrix': _prod,
// prod([a, b, c, d, ...], dim)
'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {
// TODO: implement prod(A, dim)
throw new Error('prod(A, dim) is not yet supported'); // return reduce(arguments[0], arguments[1], math.prod)
},
// prod(a, b, c, d, ...)
'...': function _(args) {
return _prod(args);
}
});
/**
* Recursively calculate the product of an n-dimensional array
* @param {Array} array
* @return {number} prod
* @private
*/
function _prod(array) {
var prod;
deepForEach(array, function (value) {
try {
prod = prod === undefined ? value : multiplyScalar(prod, value);
} catch (err) {
throw improveErrorMessage(err, 'prod', value);
}
}); // make sure returning numeric value: parse a string into a numeric value
if (typeof prod === 'string') {
prod = numeric(prod, config.number);
}
if (prod === undefined) {
throw new Error('Cannot calculate prod of an empty array');
}
return prod;
}
});
// CONCATENATED MODULE: ./src/function/string/format.js
var format_name = 'format';
var format_dependencies = ['typed'];
var createFormat = /* #__PURE__ */Object(factory["a" /* factory */])(format_name, format_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Format a value of any type into a string.
*
* Syntax:
*
* math.format(value)
* math.format(value, options)
* math.format(value, precision)
* math.format(value, callback)
*
* Where:
*
* - `value: *`
* The value to be formatted
* - `options: Object`
* An object with formatting options. Available options:
* - `notation: string`
* Number notation. Choose from:
* - 'fixed'
* Always use regular number notation.
* For example '123.40' and '14000000'
* - 'exponential'
* Always use exponential notation.
* For example '1.234e+2' and '1.4e+7'
* - 'engineering'
* Always use engineering notation: always have exponential notation,
* and select the exponent to be a multiple of 3.
* For example '123.4e+0' and '14.0e+6'
* - 'auto' (default)
* Regular number notation for numbers having an absolute value between
* `lower` and `upper` bounds, and uses exponential notation elsewhere.
* Lower bound is included, upper bound is excluded.
* For example '123.4' and '1.4e7'.
* - `precision: number`
* A number between 0 and 16 to round the digits of the number. In case
* of notations 'exponential', 'engineering', and 'auto', `precision`
* defines the total number of significant digits returned.
* In case of notation 'fixed', `precision` defines the number of
* significant digits after the decimal point.
* `precision` is undefined by default.
* - `lowerExp: number`
* Exponent determining the lower boundary for formatting a value with
* an exponent when `notation='auto`. Default value is `-3`.
* - `upperExp: number`
* Exponent determining the upper boundary for formatting a value with
* an exponent when `notation='auto`. Default value is `5`.
* - `fraction: string`. Available values: 'ratio' (default) or 'decimal'.
* For example `format(fraction(1, 3))` will output '1/3' when 'ratio' is
* configured, and will output `0.(3)` when 'decimal' is configured.
* - `callback: function`
* A custom formatting function, invoked for all numeric elements in `value`,
* for example all elements of a matrix, or the real and imaginary
* parts of a complex number. This callback can be used to override the
* built-in numeric notation with any type of formatting. Function `callback`
* is called with `value` as parameter and must return a string.
*
* When `value` is an Object:
*
* - When the object contains a property `format` being a function, this function
* is invoked as `value.format(options)` and the result is returned.
* - When the object has its own `toString` method, this method is invoked
* and the result is returned.
* - In other cases the function will loop over all object properties and
* return JSON object notation like '{"a": 2, "b": 3}'.
*
* When value is a function:
*
* - When the function has a property `syntax`, it returns this
* syntax description.
* - In other cases, a string `'function'` is returned.
*
* Examples:
*
* math.format(6.4) // returns '6.4'
* math.format(1240000) // returns '1.24e6'
* math.format(1/3) // returns '0.3333333333333333'
* math.format(1/3, 3) // returns '0.333'
* math.format(21385, 2) // returns '21000'
* math.format(12e8, {notation: 'fixed'}) // returns '1200000000'
* math.format(2.3, {notation: 'fixed', precision: 4}) // returns '2.3000'
* math.format(52.8, {notation: 'exponential'}) // returns '5.28e+1'
* math.format(12400,{notation: 'engineering'}) // returns '12.400e+3'
* math.format(2000, {lowerExp: -2, upperExp: 2}) // returns '2e+3'
*
* function formatCurrency(value) {
* // return currency notation with two digits:
* return '$' + value.toFixed(2)
*
* // you could also use math.format inside the callback:
* // return '$' + math.format(value, {notation: 'fixed', precision: 2})
* }
* math.format([2.1, 3, 0.016], formatCurrency} // returns '[$2.10, $3.00, $0.02]'
*
* See also:
*
* print
*
* @param {*} value Value to be stringified
* @param {Object | Function | number} [options] Formatting options
* @return {string} The formatted value
*/
return typed(format_name, {
any: utils_string["d" /* format */],
'any, Object | function | number': utils_string["d" /* format */]
});
});
// CONCATENATED MODULE: ./src/function/string/print.js
var print_name = 'print';
var print_dependencies = ['typed'];
var createPrint = /* #__PURE__ */Object(factory["a" /* factory */])(print_name, print_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Interpolate values into a string template.
*
* Syntax:
*
* math.print(template, values)
* math.print(template, values, precision)
* math.print(template, values, options)
*
* Example usage:
*
* // the following outputs: 'Lucy is 5 years old'
* math.print('Lucy is $age years old', {age: 5})
*
* // the following outputs: 'The value of pi is 3.141592654'
* math.print('The value of pi is $pi', {pi: math.pi}, 10)
*
* // the following outputs: 'hello Mary! The date is 2013-03-23'
* math.print('Hello $user.name! The date is $date', {
* user: {
* name: 'Mary',
* },
* date: new Date(2013, 2, 23).toISOString().substring(0, 10)
* })
*
* // the following outputs: 'My favorite fruits are apples and bananas !'
* math.print('My favorite fruits are $0 and $1 !', [
* 'apples',
* 'bananas'
* ])
*
* See also:
*
* format
*
* @param {string} template A string containing variable placeholders.
* @param {Object | Array | Matrix} values An object or array containing variables
* which will be filled in in the template.
* @param {number | Object} [options] Formatting options,
* or the number of digits to format numbers.
* See function math.format for a description
* of all options.
* @return {string} Interpolated string
*/
return typed(print_name, {
// note: Matrix will be converted automatically to an Array
'string, Object | Array': _print,
'string, Object | Array, number | Object': _print
});
});
/**
* Interpolate values into a string template.
* @param {string} template
* @param {Object} values
* @param {number | Object} [options]
* @returns {string} Interpolated string
* @private
*/
function _print(template, values, options) {
return template.replace(/\$([\w.]+)/g, function (original, key) {
var keys = key.split('.');
var value = values[keys.shift()];
while (keys.length && value !== undefined) {
var k = keys.shift();
value = k ? value[k] : value + '.';
}
if (value !== undefined) {
if (!Object(is["I" /* isString */])(value)) {
return Object(utils_string["d" /* format */])(value, options);
} else {
return value;
}
}
return original;
});
}
// CONCATENATED MODULE: ./src/function/unit/to.js
var to_name = 'to';
var to_dependencies = ['typed', 'matrix'];
var createTo = /* #__PURE__ */Object(factory["a" /* factory */])(to_name, to_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix;
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Change the unit of a value.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.to(x, unit)
*
* Examples:
*
* math.to(math.unit('2 inch'), 'cm') // returns Unit 5.08 cm
* math.to(math.unit('2 inch'), math.unit(null, 'cm')) // returns Unit 5.08 cm
* math.to(math.unit(16, 'bytes'), 'bits') // returns Unit 128 bits
*
* See also:
*
* unit
*
* @param {Unit | Array | Matrix} x The unit to be converted.
* @param {Unit | Array | Matrix} unit New unit. Can be a string like "cm"
* or a unit without value.
* @return {Unit | Array | Matrix} value with changed, fixed unit.
*/
return typed(to_name, {
'Unit, Unit | string': function UnitUnitString(x, unit) {
return x.to(unit);
},
'Matrix, Matrix': function MatrixMatrix(x, y) {
// SparseMatrix does not support Units
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'Matrix, any': function MatrixAny(x, y) {
// SparseMatrix does not support Units
return algorithm14(x, y, this, false);
},
'any, Matrix': function anyMatrix(x, y) {
// SparseMatrix does not support Units
return algorithm14(y, x, this, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, this, false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, this, true).valueOf();
}
});
});
// CONCATENATED MODULE: ./src/function/utils/isPrime.js
var isPrime_name = 'isPrime';
var isPrime_dependencies = ['typed'];
var createIsPrime = /* #__PURE__ */Object(factory["a" /* factory */])(isPrime_name, isPrime_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Test whether a value is prime: has no divisors other than itself and one.
* The function supports type `number`, `bignumber`.
*
* The function is evaluated element-wise in case of Array or Matrix input.
*
* Syntax:
*
* math.isPrime(x)
*
* Examples:
*
* math.isPrime(3) // returns true
* math.isPrime(-2) // returns false
* math.isPrime(0) // returns false
* math.isPrime(-0) // returns false
* math.isPrime(0.5) // returns false
* math.isPrime('2') // returns true
* math.isPrime([2, 17, 100]) // returns [true, true, false]
*
* See also:
*
* isNumeric, isZero, isNegative, isInteger
*
* @param {number | BigNumber | Array | Matrix} x Value to be tested
* @return {boolean} Returns true when `x` is larger than zero.
* Throws an error in case of an unknown data type.
*/
return typed(isPrime_name, {
number: function number(x) {
if (x * 0 !== 0) {
return false;
}
if (x <= 3) {
return x > 1;
}
if (x % 2 === 0 || x % 3 === 0) {
return false;
}
for (var i = 5; i * i <= x; i += 6) {
if (x % i === 0 || x % (i + 2) === 0) {
return false;
}
}
return true;
},
BigNumber: function BigNumber(n) {
if (n.toNumber() * 0 !== 0) {
return false;
}
if (n.lte(3)) return n.gt(1);
if (n.mod(2).eq(0) || n.mod(3).eq(0)) return false;
for (var i = 5; n.gte(i * i); i += 6) {
if (n.mod(i).eq(0) || n.mod(i + 2).eq(0)) {
return false;
}
}
return true;
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/utils/numeric.js
var numeric_name = 'numeric';
var numeric_dependencies = ['number', '?bignumber', '?fraction'];
var createNumeric = /* #__PURE__ */Object(factory["a" /* factory */])(numeric_name, numeric_dependencies, function (_ref) {
var _number = _ref.number,
bignumber = _ref.bignumber,
fraction = _ref.fraction;
var validInputTypes = {
string: true,
number: true,
BigNumber: true,
Fraction: true
}; // Load the conversion functions for each output type
var validOutputTypes = {
number: function number(x) {
return _number(x);
},
BigNumber: bignumber ? function (x) {
return bignumber(x);
} : noBignumber,
Fraction: fraction ? function (x) {
return fraction(x);
} : noFraction
};
/**
* Convert a numeric input to a specific numeric type: number, BigNumber, or Fraction.
*
* Syntax:
*
* math.numeric(x)
*
* Examples:
*
* math.numeric('4') // returns number 4
* math.numeric('4', 'number') // returns number 4
* math.numeric('4', 'BigNumber') // returns BigNumber 4
* math.numeric('4', 'Fraction') // returns Fraction 4
* math.numeric(4, 'Fraction') // returns Fraction 4
* math.numeric(math.fraction(2, 5), 'number') // returns number 0.4
*
* See also:
*
* number, fraction, bignumber, string, format
*
* @param {string | number | BigNumber | Fraction } value
* A numeric value or a string containing a numeric value
* @param {string} outputType
* Desired numeric output type.
* Available values: 'number', 'BigNumber', or 'Fraction'
* @return {number | BigNumber | Fraction}
* Returns an instance of the numeric in the requested type
*/
return function numeric(value, outputType) {
var inputType = Object(is["M" /* typeOf */])(value);
if (!(inputType in validInputTypes)) {
throw new TypeError('Cannot convert ' + value + ' of type "' + inputType + '"; valid input types are ' + Object.keys(validInputTypes).join(', '));
}
if (!(outputType in validOutputTypes)) {
throw new TypeError('Cannot convert ' + value + ' to type "' + outputType + '"; valid output types are ' + Object.keys(validOutputTypes).join(', '));
}
if (outputType === inputType) {
return value;
} else {
return validOutputTypes[outputType](value);
}
};
});
// CONCATENATED MODULE: ./src/function/arithmetic/divideScalar.js
var divideScalar_name = 'divideScalar';
var divideScalar_dependencies = ['typed', 'numeric'];
var createDivideScalar = /* #__PURE__ */Object(factory["a" /* factory */])(divideScalar_name, divideScalar_dependencies, function (_ref) {
var typed = _ref.typed,
numeric = _ref.numeric;
/**
* Divide two scalar values, `x / y`.
* This function is meant for internal use: it is used by the public functions
* `divide` and `inv`.
*
* This function does not support collections (Array or Matrix).
*
* @param {number | BigNumber | Fraction | Complex | Unit} x Numerator
* @param {number | BigNumber | Fraction | Complex} y Denominator
* @return {number | BigNumber | Fraction | Complex | Unit} Quotient, `x / y`
* @private
*/
return typed(divideScalar_name, {
'number, number': function numberNumber(x, y) {
return x / y;
},
'Complex, Complex': function ComplexComplex(x, y) {
return x.div(y);
},
'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
return x.div(y);
},
'Fraction, Fraction': function FractionFraction(x, y) {
return x.div(y);
},
'Unit, number | Fraction | BigNumber': function UnitNumberFractionBigNumber(x, y) {
var res = x.clone(); // TODO: move the divide function to Unit.js, it uses internals of Unit
var one = numeric(1, Object(is["M" /* typeOf */])(y));
res.value = this(res.value === null ? res._normalize(one) : res.value, y);
return res;
},
'number | Fraction | BigNumber, Unit': function numberFractionBigNumberUnit(x, y) {
var res = y.clone();
res = res.pow(-1); // TODO: move the divide function to Unit.js, it uses internals of Unit
var one = numeric(1, Object(is["M" /* typeOf */])(x));
res.value = this(x, y.value === null ? y._normalize(one) : y.value);
return res;
},
'Unit, Unit': function UnitUnit(x, y) {
return x.divide(y);
}
});
});
// CONCATENATED MODULE: ./src/function/arithmetic/pow.js
var pow_name = 'pow';
var pow_dependencies = ['typed', 'config', 'identity', 'multiply', 'matrix', 'fraction', 'number', 'Complex'];
var createPow = /* #__PURE__ */Object(factory["a" /* factory */])(pow_name, pow_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
identity = _ref.identity,
multiply = _ref.multiply,
matrix = _ref.matrix,
number = _ref.number,
fraction = _ref.fraction,
Complex = _ref.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(pow_name, {
'number, number': _pow,
'Complex, Complex': function ComplexComplex(x, y) {
return x.pow(y);
},
'BigNumber, BigNumber': function BigNumberBigNumber(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 FractionFraction(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 ArrayBigNumber(x, y) {
return _powArray(x, y.toNumber());
},
'Matrix, number': _powMatrix,
'Matrix, BigNumber': function MatrixBigNumber(x, y) {
return _powMatrix(x, y.toNumber());
},
'Unit, number | BigNumber': function UnitNumberBigNumber(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 && !Object(utils_number["i" /* isInteger */])(y) && x < 0) {
// Check to see if y can be represented as a fraction
try {
var yFrac = fraction(y);
var 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 (Object(utils_number["i" /* 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 (!Object(utils_number["i" /* 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
var s = Object(utils_array["a" /* arraySize */])(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] + ')');
}
var res = identity(s[0]).valueOf();
var 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));
}
});
// CONCATENATED MODULE: ./src/function/arithmetic/round.js
function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; }
function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }
function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
var NO_INT = 'Number of decimals in function round must be an integer';
var round_name = 'round';
var round_dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'BigNumber', 'DenseMatrix'];
var createRound = /* #__PURE__ */Object(factory["a" /* factory */])(round_name, round_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
equalScalar = _ref.equalScalar,
zeros = _ref.zeros,
BigNumber = _ref.BigNumber,
DenseMatrix = _ref.DenseMatrix;
var algorithm11 = createAlgorithm11({
typed: typed,
equalScalar: equalScalar
});
var algorithm12 = createAlgorithm12({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Round a value towards the nearest integer.
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.round(x)
* math.round(x, n)
*
* Examples:
*
* math.round(3.2) // returns number 3
* math.round(3.8) // returns number 4
* math.round(-4.2) // returns number -4
* math.round(-4.7) // returns number -5
* math.round(math.pi, 3) // returns number 3.142
* math.round(123.45678, 2) // returns number 123.46
*
* const c = math.complex(3.2, -2.7)
* math.round(c) // returns Complex 3 - 3i
*
* math.round([3.2, 3.8, -4.7]) // returns Array [3, 4, -5]
*
* See also:
*
* ceil, fix, floor
*
* @param {number | BigNumber | Fraction | Complex | Array | Matrix} x Number to be rounded
* @param {number | BigNumber | Array} [n=0] Number of decimals
* @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value
*/
return typed(round_name, _objectSpread(_objectSpread({}, roundNumberSignatures), {}, {
Complex: function Complex(x) {
return x.round();
},
'Complex, number': function ComplexNumber(x, n) {
if (n % 1) {
throw new TypeError(NO_INT);
}
return x.round(n);
},
'Complex, BigNumber': function ComplexBigNumber(x, n) {
if (!n.isInteger()) {
throw new TypeError(NO_INT);
}
var _n = n.toNumber();
return x.round(_n);
},
'number, BigNumber': function numberBigNumber(x, n) {
if (!n.isInteger()) {
throw new TypeError(NO_INT);
}
return new BigNumber(x).toDecimalPlaces(n.toNumber());
},
BigNumber: function BigNumber(x) {
return x.toDecimalPlaces(0);
},
'BigNumber, BigNumber': function BigNumberBigNumber(x, n) {
if (!n.isInteger()) {
throw new TypeError(NO_INT);
}
return x.toDecimalPlaces(n.toNumber());
},
Fraction: function Fraction(x) {
return x.round();
},
'Fraction, number': function FractionNumber(x, n) {
if (n % 1) {
throw new TypeError(NO_INT);
}
return x.round(n);
},
'Array | Matrix': function ArrayMatrix(x) {
// deep map collection, skip zeros since round(0) = 0
return deepMap(x, this, true);
},
'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
return algorithm11(x, y, this, false);
},
'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
return algorithm14(x, y, this, false);
},
'number | Complex | BigNumber, SparseMatrix': function numberComplexBigNumberSparseMatrix(x, y) {
// check scalar is zero
if (equalScalar(x, 0)) {
// do not execute algorithm, result will be a zero matrix
return zeros(y.size(), y.storage());
}
return algorithm12(y, x, this, true);
},
'number | Complex | BigNumber, DenseMatrix': function numberComplexBigNumberDenseMatrix(x, y) {
// check scalar is zero
if (equalScalar(x, 0)) {
// do not execute algorithm, result will be a zero matrix
return zeros(y.size(), y.storage());
}
return algorithm14(y, x, this, true);
},
'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, this, false).valueOf();
},
'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, this, true).valueOf();
}
}));
});
var roundNumberSignatures = {
number: roundNumber,
'number, number': function numberNumber(x, n) {
if (!Object(utils_number["i" /* isInteger */])(n)) {
throw new TypeError(NO_INT);
}
if (n < 0 || n > 15) {
throw new Error('Number of decimals in function round must be in te range of 0-15');
}
return roundNumber(x, n);
}
};
var createRoundNumber = /* #__PURE__ */Object(factory["a" /* factory */])(round_name, ['typed'], function (_ref2) {
var typed = _ref2.typed;
return typed(round_name, roundNumberSignatures);
});
// CONCATENATED MODULE: ./src/function/arithmetic/log.js
var log_name = 'log';
var log_dependencies = ['config', 'typed', 'divideScalar', 'Complex'];
var createLog = /* #__PURE__ */Object(factory["a" /* factory */])(log_name, log_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
divideScalar = _ref.divideScalar,
Complex = _ref.Complex;
/**
* Calculate the logarithm of a value.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.log(x)
* math.log(x, base)
*
* Examples:
*
* math.log(3.5) // returns 1.252762968495368
* math.exp(math.log(2.4)) // returns 2.4
*
* math.pow(10, 4) // returns 10000
* math.log(10000, 10) // returns 4
* math.log(10000) / math.log(10) // returns 4
*
* math.log(1024, 2) // returns 10
* math.pow(2, 10) // returns 1024
*
* See also:
*
* exp, log2, log10, log1p
*
* @param {number | BigNumber | Complex | Array | Matrix} x
* Value for which to calculate the logarithm.
* @param {number | BigNumber | Complex} [base=e]
* Optional base for the logarithm. If not provided, the natural
* logarithm of `x` is calculated.
* @return {number | BigNumber | Complex | Array | Matrix}
* Returns the logarithm of `x`
*/
return typed(log_name, {
number: function number(x) {
if (x >= 0 || config.predictable) {
return logNumber(x);
} else {
// negative value -> complex value computation
return new Complex(x, 0).log();
}
},
Complex: function Complex(x) {
return x.log();
},
BigNumber: function BigNumber(x) {
if (!x.isNegative() || config.predictable) {
return x.ln();
} else {
// downgrade to number, return Complex valued result
return new Complex(x.toNumber(), 0).log();
}
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
},
'any, any': function anyAny(x, base) {
// calculate logarithm for a specified base, log(x, base)
return divideScalar(this(x), this(base));
}
});
});
// CONCATENATED MODULE: ./src/function/arithmetic/log1p.js
var log1p_name = 'log1p';
var log1p_dependencies = ['typed', 'config', 'divideScalar', 'log', 'Complex'];
var createLog1p = /* #__PURE__ */Object(factory["a" /* factory */])(log1p_name, log1p_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
divideScalar = _ref.divideScalar,
log = _ref.log,
Complex = _ref.Complex;
/**
* Calculate the logarithm of a `value+1`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.log1p(x)
* math.log1p(x, base)
*
* Examples:
*
* math.log1p(2.5) // returns 1.252762968495368
* math.exp(math.log1p(1.4)) // returns 2.4
*
* math.pow(10, 4) // returns 10000
* math.log1p(9999, 10) // returns 4
* math.log1p(9999) / math.log(10) // returns 4
*
* See also:
*
* exp, log, log2, log10
*
* @param {number | BigNumber | Complex | Array | Matrix} x
* Value for which to calculate the logarithm of `x+1`.
* @param {number | BigNumber | Complex} [base=e]
* Optional base for the logarithm. If not provided, the natural
* logarithm of `x+1` is calculated.
* @return {number | BigNumber | Complex | Array | Matrix}
* Returns the logarithm of `x+1`
*/
return typed(log1p_name, {
number: function number(x) {
if (x >= -1 || config.predictable) {
return Object(utils_number["k" /* log1p */])(x);
} else {
// negative value -> complex value computation
return _log1pComplex(new Complex(x, 0));
}
},
Complex: _log1pComplex,
BigNumber: function BigNumber(x) {
var y = x.plus(1);
if (!y.isNegative() || config.predictable) {
return y.ln();
} else {
// downgrade to number, return Complex valued result
return _log1pComplex(new Complex(x.toNumber(), 0));
}
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
},
'any, any': function anyAny(x, base) {
// calculate logarithm for a specified base, log1p(x, base)
return divideScalar(this(x), log(base));
}
});
/**
* Calculate the natural logarithm of a complex number + 1
* @param {Complex} x
* @returns {Complex}
* @private
*/
function _log1pComplex(x) {
var xRe1p = x.re + 1;
return new Complex(Math.log(Math.sqrt(xRe1p * xRe1p + x.im * x.im)), Math.atan2(x.im, xRe1p));
}
});
// CONCATENATED MODULE: ./src/function/arithmetic/nthRoots.js
var nthRoots_name = 'nthRoots';
var nthRoots_dependencies = ['config', 'typed', 'divideScalar', 'Complex'];
var createNthRoots = /* #__PURE__ */Object(factory["a" /* factory */])(nthRoots_name, nthRoots_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
divideScalar = _ref.divideScalar,
Complex = _ref.Complex;
/**
* Each function here returns a real multiple of i as a Complex value.
* @param {number} val
* @return {Complex} val, i*val, -val or -i*val for index 0, 1, 2, 3
*/
// This is used to fix float artifacts for zero-valued components.
var _calculateExactResult = [function realPos(val) {
return new Complex(val, 0);
}, function imagPos(val) {
return new Complex(0, val);
}, function realNeg(val) {
return new Complex(-val, 0);
}, function imagNeg(val) {
return new Complex(0, -val);
}];
/**
* Calculate the nth root of a Complex Number a using De Movire's Theorem.
* @param {Complex} a
* @param {number} root
* @return {Array} array of n Complex Roots
*/
function _nthComplexRoots(a, root) {
if (root < 0) throw new Error('Root must be greater than zero');
if (root === 0) throw new Error('Root must be non-zero');
if (root % 1 !== 0) throw new Error('Root must be an integer');
if (a === 0 || a.abs() === 0) return [new Complex(0, 0)];
var aIsNumeric = typeof a === 'number';
var offset; // determine the offset (argument of a)/(pi/2)
if (aIsNumeric || a.re === 0 || a.im === 0) {
if (aIsNumeric) {
offset = 2 * +(a < 0); // numeric value on the real axis
} else if (a.im === 0) {
offset = 2 * +(a.re < 0); // complex value on the real axis
} else {
offset = 2 * +(a.im < 0) + 1; // complex value on the imaginary axis
}
}
var arg = a.arg();
var abs = a.abs();
var roots = [];
var r = Math.pow(abs, 1 / root);
for (var k = 0; k < root; k++) {
var halfPiFactor = (offset + 4 * k) / root;
/**
* If (offset + 4*k)/root is an integral multiple of pi/2
* then we can produce a more exact result.
*/
if (halfPiFactor === Math.round(halfPiFactor)) {
roots.push(_calculateExactResult[halfPiFactor % 4](r));
continue;
}
roots.push(new Complex({
r: r,
phi: (arg + 2 * Math.PI * k) / root
}));
}
return roots;
}
/**
* Calculate the nth roots of a value.
* An nth root of a positive real number A,
* is a positive real solution of the equation "x^root = A".
* This function returns an array of complex values.
*
* Syntax:
*
* math.nthRoots(x)
* math.nthRoots(x, root)
*
* Examples:
*
* math.nthRoots(1)
* // returns [
* // {re: 1, im: 0},
* // {re: -1, im: 0}
* // ]
* nthRoots(1, 3)
* // returns [
* // { re: 1, im: 0 },
* // { re: -0.4999999999999998, im: 0.8660254037844387 },
* // { re: -0.5000000000000004, im: -0.8660254037844385 }
* ]
*
* See also:
*
* nthRoot, pow, sqrt
*
* @param {number | BigNumber | Fraction | Complex} x Number to be rounded
* @return {number | BigNumber | Fraction | Complex} Rounded value
*/
return typed(nthRoots_name, {
Complex: function Complex(x) {
return _nthComplexRoots(x, 2);
},
'Complex, number': _nthComplexRoots
});
});
// CONCATENATED MODULE: ./src/function/arithmetic/dotPow.js
var dotPow_name = 'dotPow';
var dotPow_dependencies = ['typed', 'equalScalar', 'matrix', 'pow', 'DenseMatrix'];
var createDotPow = /* #__PURE__ */Object(factory["a" /* factory */])(dotPow_name, dotPow_dependencies, function (_ref) {
var typed = _ref.typed,
equalScalar = _ref.equalScalar,
matrix = _ref.matrix,
pow = _ref.pow,
DenseMatrix = _ref.DenseMatrix;
var algorithm03 = createAlgorithm03({
typed: typed
});
var algorithm07 = createAlgorithm07({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm11 = createAlgorithm11({
typed: typed,
equalScalar: equalScalar
});
var algorithm12 = createAlgorithm12({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Calculates the power of x to y element wise.
*
* Syntax:
*
* math.dotPow(x, y)
*
* Examples:
*
* math.dotPow(2, 3) // returns number 8
*
* const a = [[1, 2], [4, 3]]
* math.dotPow(a, 2) // returns Array [[1, 4], [16, 9]]
* math.pow(a, 2) // returns Array [[9, 8], [16, 17]]
*
* See also:
*
* pow, sqrt, multiply
*
* @param {number | BigNumber | Complex | Unit | Array | Matrix} x The base
* @param {number | BigNumber | Complex | Unit | Array | Matrix} y The exponent
* @return {number | BigNumber | Complex | Unit | Array | Matrix} The value of `x` to the power `y`
*/
return typed(dotPow_name, {
'any, any': pow,
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm07(x, y, pow, false);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm03(y, x, pow, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm03(x, y, pow, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, pow);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
return algorithm11(x, y, this, false);
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, this, false);
},
'any, SparseMatrix': function anySparseMatrix(x, y) {
return algorithm12(y, x, this, true);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
return algorithm14(y, x, this, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, this, false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, this, true).valueOf();
}
});
});
// CONCATENATED MODULE: ./src/function/arithmetic/dotDivide.js
var dotDivide_name = 'dotDivide';
var dotDivide_dependencies = ['typed', 'matrix', 'equalScalar', 'divideScalar', 'DenseMatrix'];
var createDotDivide = /* #__PURE__ */Object(factory["a" /* factory */])(dotDivide_name, dotDivide_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
equalScalar = _ref.equalScalar,
divideScalar = _ref.divideScalar,
DenseMatrix = _ref.DenseMatrix;
var algorithm02 = createAlgorithm02({
typed: typed,
equalScalar: equalScalar
});
var algorithm03 = createAlgorithm03({
typed: typed
});
var algorithm07 = createAlgorithm07({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm11 = createAlgorithm11({
typed: typed,
equalScalar: equalScalar
});
var algorithm12 = createAlgorithm12({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Divide two matrices element wise. The function accepts both matrices and
* scalar values.
*
* Syntax:
*
* math.dotDivide(x, y)
*
* Examples:
*
* math.dotDivide(2, 4) // returns 0.5
*
* a = [[9, 5], [6, 1]]
* b = [[3, 2], [5, 2]]
*
* math.dotDivide(a, b) // returns [[3, 2.5], [1.2, 0.5]]
* math.divide(a, b) // returns [[1.75, 0.75], [-1.75, 2.25]]
*
* See also:
*
* divide, multiply, dotMultiply
*
* @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Numerator
* @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Denominator
* @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Quotient, `x ./ y`
*/
return typed(dotDivide_name, {
'any, any': divideScalar,
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm07(x, y, divideScalar, false);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm02(y, x, divideScalar, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm03(x, y, divideScalar, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, divideScalar);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
return algorithm11(x, y, divideScalar, false);
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, divideScalar, false);
},
'any, SparseMatrix': function anySparseMatrix(x, y) {
return algorithm12(y, x, divideScalar, true);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
return algorithm14(y, x, divideScalar, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, divideScalar, false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, divideScalar, true).valueOf();
}
});
});
// CONCATENATED MODULE: ./src/function/algebra/solver/utils/solveValidation.js
function createSolveValidation(_ref) {
var DenseMatrix = _ref.DenseMatrix;
/**
* Validates matrix and column vector b for backward/forward substitution algorithms.
*
* @param {Matrix} m An N x N matrix
* @param {Array | Matrix} b A column vector
* @param {Boolean} copy Return a copy of vector b
*
* @return {DenseMatrix} Dense column vector b
*/
return function solveValidation(m, b, copy) {
// matrix size
var size = m.size(); // validate matrix dimensions
if (size.length !== 2) {
throw new RangeError('Matrix must be two dimensional (size: ' + Object(utils_string["d" /* format */])(size) + ')');
} // rows & columns
var rows = size[0];
var columns = size[1]; // validate rows & columns
if (rows !== columns) {
throw new RangeError('Matrix must be square (size: ' + Object(utils_string["d" /* format */])(size) + ')');
} // vars
var data, i, bdata; // check b is matrix
if (Object(is["v" /* isMatrix */])(b)) {
// matrix size
var msize = b.size(); // vector
if (msize.length === 1) {
// check vector length
if (msize[0] !== rows) {
throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
} // create data array
data = []; // matrix data (DenseMatrix)
bdata = b._data; // loop b data
for (i = 0; i < rows; i++) {
// row array
data[i] = [bdata[i]];
} // return Dense Matrix
return new DenseMatrix({
data: data,
size: [rows, 1],
datatype: b._datatype
});
} // two dimensions
if (msize.length === 2) {
// array must be a column vector
if (msize[0] !== rows || msize[1] !== 1) {
throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
} // check matrix type
if (Object(is["n" /* isDenseMatrix */])(b)) {
// check a copy is needed
if (copy) {
// create data array
data = []; // matrix data (DenseMatrix)
bdata = b._data; // loop b data
for (i = 0; i < rows; i++) {
// row array
data[i] = [bdata[i][0]];
} // return Dense Matrix
return new DenseMatrix({
data: data,
size: [rows, 1],
datatype: b._datatype
});
} // b is already a column vector
return b;
} // create data array
data = [];
for (i = 0; i < rows; i++) {
data[i] = [0];
} // sparse matrix arrays
var values = b._values;
var index = b._index;
var ptr = b._ptr; // loop values in column 0
for (var k1 = ptr[1], k = ptr[0]; k < k1; k++) {
// row
i = index[k]; // add to data
data[i][0] = values[k];
} // return Dense Matrix
return new DenseMatrix({
data: data,
size: [rows, 1],
datatype: b._datatype
});
} // throw error
throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
} // check b is array
if (Object(is["b" /* isArray */])(b)) {
// size
var asize = Object(utils_array["a" /* arraySize */])(b); // check matrix dimensions, vector
if (asize.length === 1) {
// check vector length
if (asize[0] !== rows) {
throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
} // create data array
data = []; // loop b
for (i = 0; i < rows; i++) {
// row array
data[i] = [b[i]];
} // return Dense Matrix
return new DenseMatrix({
data: data,
size: [rows, 1]
});
}
if (asize.length === 2) {
// array must be a column vector
if (asize[0] !== rows || asize[1] !== 1) {
throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
} // create data array
data = []; // loop b data
for (i = 0; i < rows; i++) {
// row array
data[i] = [b[i][0]];
} // return Dense Matrix
return new DenseMatrix({
data: data,
size: [rows, 1]
});
} // throw error
throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
}
};
}
// CONCATENATED MODULE: ./src/function/algebra/solver/lsolve.js
var lsolve_name = 'lsolve';
var lsolve_dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];
var createLsolve = /* #__PURE__ */Object(factory["a" /* factory */])(lsolve_name, lsolve_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
divideScalar = _ref.divideScalar,
multiplyScalar = _ref.multiplyScalar,
subtract = _ref.subtract,
equalScalar = _ref.equalScalar,
DenseMatrix = _ref.DenseMatrix;
var solveValidation = createSolveValidation({
DenseMatrix: DenseMatrix
});
/**
* Solves the linear equation system by forwards substitution. Matrix must be a lower triangular matrix.
*
* `L * x = b`
*
* Syntax:
*
* math.lsolve(L, b)
*
* Examples:
*
* const a = [[-2, 3], [2, 1]]
* const b = [11, 9]
* const x = lsolve(a, b) // [[-5.5], [20]]
*
* See also:
*
* lup, slu, usolve, lusolve
*
* @param {Matrix, Array} L A N x N matrix or array (L)
* @param {Matrix, Array} b A column vector with the b values
*
* @return {DenseMatrix | Array} A column vector with the linear system solution (x)
*/
return typed(lsolve_name, {
'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {
// process matrix
return _sparseForwardSubstitution(m, b);
},
'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {
// process matrix
return _denseForwardSubstitution(m, b);
},
'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {
// create dense matrix from array
var m = matrix(a); // use matrix implementation
var r = _denseForwardSubstitution(m, b); // result
return r.valueOf();
}
});
function _denseForwardSubstitution(m, b) {
// validate matrix and vector, return copy of column vector b
b = solveValidation(m, b, true); // column vector data
var bdata = b._data; // rows & columns
var rows = m._size[0];
var columns = m._size[1]; // result
var x = []; // data
var data = m._data; // forward solve m * x = b, loop columns
for (var j = 0; j < columns; j++) {
// b[j]
var bj = bdata[j][0] || 0; // x[j]
var xj = void 0; // forward substitution (outer product) avoids inner looping when bj === 0
if (!equalScalar(bj, 0)) {
// value @ [j, j]
var vjj = data[j][j]; // check vjj
if (equalScalar(vjj, 0)) {
// system cannot be solved
throw new Error('Linear system cannot be solved since matrix is singular');
} // calculate xj
xj = divideScalar(bj, vjj); // loop rows
for (var i = j + 1; i < rows; i++) {
// update copy of b
bdata[i] = [subtract(bdata[i][0] || 0, multiplyScalar(xj, data[i][j]))];
}
} else {
// zero @ j
xj = 0;
} // update x
x[j] = [xj];
} // return vector
return new DenseMatrix({
data: x,
size: [rows, 1]
});
}
function _sparseForwardSubstitution(m, b) {
// validate matrix and vector, return copy of column vector b
b = solveValidation(m, b, true); // column vector data
var bdata = b._data; // rows & columns
var rows = m._size[0];
var columns = m._size[1]; // matrix arrays
var values = m._values;
var index = m._index;
var ptr = m._ptr; // vars
var i, k; // result
var x = []; // forward solve m * x = b, loop columns
for (var j = 0; j < columns; j++) {
// b[j]
var bj = bdata[j][0] || 0; // forward substitution (outer product) avoids inner looping when bj === 0
if (!equalScalar(bj, 0)) {
// value @ [j, j]
var vjj = 0; // lower triangular matrix values & index (column j)
var jvalues = [];
var jindex = []; // last index in column
var l = ptr[j + 1]; // values in column, find value @ [j, j]
for (k = ptr[j]; k < l; k++) {
// row
i = index[k]; // check row (rows are not sorted!)
if (i === j) {
// update vjj
vjj = values[k];
} else if (i > j) {
// store lower triangular
jvalues.push(values[k]);
jindex.push(i);
}
} // at this point we must have a value @ [j, j]
if (equalScalar(vjj, 0)) {
// system cannot be solved, there is no value @ [j, j]
throw new Error('Linear system cannot be solved since matrix is singular');
} // calculate xj
var xj = divideScalar(bj, vjj); // loop lower triangular
for (k = 0, l = jindex.length; k < l; k++) {
// row
i = jindex[k]; // update copy of b
bdata[i] = [subtract(bdata[i][0] || 0, multiplyScalar(xj, jvalues[k]))];
} // update x
x[j] = [xj];
} else {
// update x
x[j] = [0];
}
} // return vector
return new DenseMatrix({
data: x,
size: [rows, 1]
});
}
});
// CONCATENATED MODULE: ./src/function/algebra/solver/usolve.js
var usolve_name = 'usolve';
var usolve_dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];
var createUsolve = /* #__PURE__ */Object(factory["a" /* factory */])(usolve_name, usolve_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
divideScalar = _ref.divideScalar,
multiplyScalar = _ref.multiplyScalar,
subtract = _ref.subtract,
equalScalar = _ref.equalScalar,
DenseMatrix = _ref.DenseMatrix;
var solveValidation = createSolveValidation({
DenseMatrix: DenseMatrix
});
/**
* Solves the linear equation system by backward substitution. Matrix must be an upper triangular matrix.
*
* `U * x = b`
*
* Syntax:
*
* math.usolve(U, b)
*
* Examples:
*
* const a = [[-2, 3], [2, 1]]
* const b = [11, 9]
* const x = usolve(a, b) // [[8], [9]]
*
* See also:
*
* lup, slu, usolve, lusolve
*
* @param {Matrix, Array} U A N x N matrix or array (U)
* @param {Matrix, Array} b A column vector with the b values
*
* @return {DenseMatrix | Array} A column vector with the linear system solution (x)
*/
return typed(usolve_name, {
'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {
// process matrix
return _sparseBackwardSubstitution(m, b);
},
'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {
// process matrix
return _denseBackwardSubstitution(m, b);
},
'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {
// create dense matrix from array
var m = matrix(a); // use matrix implementation
var r = _denseBackwardSubstitution(m, b); // result
return r.valueOf();
}
});
function _denseBackwardSubstitution(m, b) {
// validate matrix and vector, return copy of column vector b
b = solveValidation(m, b, true); // column vector data
var bdata = b._data; // rows & columns
var rows = m._size[0];
var columns = m._size[1]; // result
var x = []; // arrays
var data = m._data; // backward solve m * x = b, loop columns (backwards)
for (var j = columns - 1; j >= 0; j--) {
// b[j]
var bj = bdata[j][0] || 0; // x[j]
var xj = void 0; // backward substitution (outer product) avoids inner looping when bj === 0
if (!equalScalar(bj, 0)) {
// value @ [j, j]
var vjj = data[j][j]; // check vjj
if (equalScalar(vjj, 0)) {
// system cannot be solved
throw new Error('Linear system cannot be solved since matrix is singular');
} // calculate xj
xj = divideScalar(bj, vjj); // loop rows
for (var i = j - 1; i >= 0; i--) {
// update copy of b
bdata[i] = [subtract(bdata[i][0] || 0, multiplyScalar(xj, data[i][j]))];
}
} else {
// zero value @ j
xj = 0;
} // update x
x[j] = [xj];
} // return column vector
return new DenseMatrix({
data: x,
size: [rows, 1]
});
}
function _sparseBackwardSubstitution(m, b) {
// validate matrix and vector, return copy of column vector b
b = solveValidation(m, b, true); // column vector data
var bdata = b._data; // rows & columns
var rows = m._size[0];
var columns = m._size[1]; // matrix arrays
var values = m._values;
var index = m._index;
var ptr = m._ptr; // vars
var i, k; // result
var x = []; // backward solve m * x = b, loop columns (backwards)
for (var j = columns - 1; j >= 0; j--) {
// b[j]
var bj = bdata[j][0] || 0; // backward substitution (outer product) avoids inner looping when bj === 0
if (!equalScalar(bj, 0)) {
// value @ [j, j]
var vjj = 0; // upper triangular matrix values & index (column j)
var jvalues = [];
var jindex = []; // first & last indeces in column
var f = ptr[j];
var l = ptr[j + 1]; // values in column, find value @ [j, j], loop backwards
for (k = l - 1; k >= f; k--) {
// row
i = index[k]; // check row
if (i === j) {
// update vjj
vjj = values[k];
} else if (i < j) {
// store upper triangular
jvalues.push(values[k]);
jindex.push(i);
}
} // at this point we must have a value @ [j, j]
if (equalScalar(vjj, 0)) {
// system cannot be solved, there is no value @ [j, j]
throw new Error('Linear system cannot be solved since matrix is singular');
} // calculate xj
var xj = divideScalar(bj, vjj); // loop upper triangular
for (k = 0, l = jindex.length; k < l; k++) {
// row
i = jindex[k]; // update copy of b
bdata[i] = [subtract(bdata[i][0], multiplyScalar(xj, jvalues[k]))];
} // update x
x[j] = [xj];
} else {
// update x
x[j] = [0];
}
} // return vector
return new DenseMatrix({
data: x,
size: [rows, 1]
});
}
});
// CONCATENATED MODULE: ./src/type/matrix/utils/algorithm08.js
var algorithm08_name = 'algorithm08';
var algorithm08_dependencies = ['typed', 'equalScalar'];
var createAlgorithm08 = /* #__PURE__ */Object(factory["a" /* factory */])(algorithm08_name, algorithm08_dependencies, function (_ref) {
var typed = _ref.typed,
equalScalar = _ref.equalScalar;
/**
* Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).
* Callback function invoked MAX(NNZA, NNZB) times
*
*
* ┌ f(Aij, Bij) ; A(i,j) !== 0 && B(i,j) !== 0
* C(i,j) = ┤ A(i,j) ; A(i,j) !== 0
* └ 0 ; otherwise
*
*
* @param {Matrix} a The SparseMatrix instance (A)
* @param {Matrix} b The SparseMatrix instance (B)
* @param {Function} callback The f(Aij,Bij) operation to invoke
*
* @return {Matrix} SparseMatrix (C)
*
* see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
*/
return function algorithm08(a, b, callback) {
// sparse matrix arrays
var avalues = a._values;
var aindex = a._index;
var aptr = a._ptr;
var asize = a._size;
var adt = a._datatype; // sparse matrix arrays
var bvalues = b._values;
var bindex = b._index;
var bptr = b._ptr;
var bsize = b._size;
var bdt = b._datatype; // validate dimensions
if (asize.length !== bsize.length) {
throw new DimensionError["a" /* DimensionError */](asize.length, bsize.length);
} // check rows & columns
if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
} // sparse matrix cannot be a Pattern matrix
if (!avalues || !bvalues) {
throw new Error('Cannot perform operation on Pattern Sparse Matrices');
} // rows & columns
var rows = asize[0];
var columns = asize[1]; // datatype
var dt; // equal signature to use
var eq = equalScalar; // zero value
var zero = 0; // callback signature to use
var cf = callback; // process data types
if (typeof adt === 'string' && adt === bdt) {
// datatype
dt = adt; // find signature that matches (dt, dt)
eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype
zero = typed.convert(0, dt); // callback
cf = typed.find(callback, [dt, dt]);
} // result arrays
var cvalues = [];
var cindex = [];
var cptr = []; // workspace
var x = []; // marks indicating we have a value in x for a given column
var w = []; // vars
var k, k0, k1, i; // loop columns
for (var j = 0; j < columns; j++) {
// update cptr
cptr[j] = cindex.length; // columns mark
var mark = j + 1; // loop values in a
for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
// row
i = aindex[k]; // mark workspace
w[i] = mark; // set value
x[i] = avalues[k]; // add index
cindex.push(i);
} // loop values in b
for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
// row
i = bindex[k]; // check value exists in workspace
if (w[i] === mark) {
// evaluate callback
x[i] = cf(x[i], bvalues[k]);
}
} // initialize first index in j
k = cptr[j]; // loop index in j
while (k < cindex.length) {
// row
i = cindex[k]; // value @ i
var v = x[i]; // check for zero value
if (!eq(v, zero)) {
// push value
cvalues.push(v); // increment pointer
k++;
} else {
// remove value @ i, do not increment pointer
cindex.splice(k, 1);
}
}
} // update cptr
cptr[columns] = cindex.length; // return sparse matrix
return a.createSparseMatrix({
values: cvalues,
index: cindex,
ptr: cptr,
size: [rows, columns],
datatype: dt
});
};
});
// CONCATENATED MODULE: ./src/function/bitwise/leftShift.js
var leftShift_name = 'leftShift';
var leftShift_dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];
var createLeftShift = /* #__PURE__ */Object(factory["a" /* factory */])(leftShift_name, leftShift_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
equalScalar = _ref.equalScalar,
zeros = _ref.zeros,
DenseMatrix = _ref.DenseMatrix;
var algorithm01 = createAlgorithm01({
typed: typed
});
var algorithm02 = createAlgorithm02({
typed: typed,
equalScalar: equalScalar
});
var algorithm08 = createAlgorithm08({
typed: typed,
equalScalar: equalScalar
});
var algorithm10 = createAlgorithm10({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm11 = createAlgorithm11({
typed: typed,
equalScalar: equalScalar
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Bitwise left logical shift of a value x by y number of bits, `x << y`.
* For matrices, the function is evaluated element wise.
* For units, the function is evaluated on the best prefix base.
*
* Syntax:
*
* math.leftShift(x, y)
*
* Examples:
*
* math.leftShift(1, 2) // returns number 4
*
* math.leftShift([1, 2, 3], 4) // returns Array [16, 32, 64]
*
* See also:
*
* leftShift, bitNot, bitOr, bitXor, rightArithShift, rightLogShift
*
* @param {number | BigNumber | Array | Matrix} x Value to be shifted
* @param {number | BigNumber} y Amount of shifts
* @return {number | BigNumber | Array | Matrix} `x` shifted left `y` times
*/
return typed(leftShift_name, {
'number, number': leftShiftNumber,
'BigNumber, BigNumber': leftShiftBigNumber,
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm08(x, y, this, false);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm02(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm01(x, y, this, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
// check scalar
if (equalScalar(y, 0)) {
return x.clone();
}
return algorithm11(x, y, this, false);
},
'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
// check scalar
if (equalScalar(y, 0)) {
return x.clone();
}
return algorithm14(x, y, this, false);
},
'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
// check scalar
if (equalScalar(x, 0)) {
return zeros(y.size(), y.storage());
}
return algorithm10(y, x, this, true);
},
'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
// check scalar
if (equalScalar(x, 0)) {
return zeros(y.size(), y.storage());
}
return algorithm14(y, x, this, true);
},
'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
// use matrix implementation
return this(matrix(x), y).valueOf();
},
'number | BigNumber, Array': function numberBigNumberArray(x, y) {
// use matrix implementation
return this(x, matrix(y)).valueOf();
}
});
});
// CONCATENATED MODULE: ./src/function/bitwise/rightArithShift.js
var rightArithShift_name = 'rightArithShift';
var rightArithShift_dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];
var createRightArithShift = /* #__PURE__ */Object(factory["a" /* factory */])(rightArithShift_name, rightArithShift_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
equalScalar = _ref.equalScalar,
zeros = _ref.zeros,
DenseMatrix = _ref.DenseMatrix;
var algorithm01 = createAlgorithm01({
typed: typed
});
var algorithm02 = createAlgorithm02({
typed: typed,
equalScalar: equalScalar
});
var algorithm08 = createAlgorithm08({
typed: typed,
equalScalar: equalScalar
});
var algorithm10 = createAlgorithm10({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm11 = createAlgorithm11({
typed: typed,
equalScalar: equalScalar
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Bitwise right arithmetic shift of a value x by y number of bits, `x >> y`.
* For matrices, the function is evaluated element wise.
* For units, the function is evaluated on the best prefix base.
*
* Syntax:
*
* math.rightArithShift(x, y)
*
* Examples:
*
* math.rightArithShift(4, 2) // returns number 1
*
* math.rightArithShift([16, -32, 64], 4) // returns Array [1, -2, 3]
*
* See also:
*
* bitAnd, bitNot, bitOr, bitXor, rightArithShift, rightLogShift
*
* @param {number | BigNumber | Array | Matrix} x Value to be shifted
* @param {number | BigNumber} y Amount of shifts
* @return {number | BigNumber | Array | Matrix} `x` sign-filled shifted right `y` times
*/
return typed(rightArithShift_name, {
'number, number': rightArithShiftNumber,
'BigNumber, BigNumber': rightArithShiftBigNumber,
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm08(x, y, this, false);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm02(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm01(x, y, this, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
// check scalar
if (equalScalar(y, 0)) {
return x.clone();
}
return algorithm11(x, y, this, false);
},
'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
// check scalar
if (equalScalar(y, 0)) {
return x.clone();
}
return algorithm14(x, y, this, false);
},
'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
// check scalar
if (equalScalar(x, 0)) {
return zeros(y.size(), y.storage());
}
return algorithm10(y, x, this, true);
},
'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
// check scalar
if (equalScalar(x, 0)) {
return zeros(y.size(), y.storage());
}
return algorithm14(y, x, this, true);
},
'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
// use matrix implementation
return this(matrix(x), y).valueOf();
},
'number | BigNumber, Array': function numberBigNumberArray(x, y) {
// use matrix implementation
return this(x, matrix(y)).valueOf();
}
});
});
// CONCATENATED MODULE: ./src/function/bitwise/rightLogShift.js
var rightLogShift_name = 'rightLogShift';
var rightLogShift_dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];
var createRightLogShift = /* #__PURE__ */Object(factory["a" /* factory */])(rightLogShift_name, rightLogShift_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
equalScalar = _ref.equalScalar,
zeros = _ref.zeros,
DenseMatrix = _ref.DenseMatrix;
var algorithm01 = createAlgorithm01({
typed: typed
});
var algorithm02 = createAlgorithm02({
typed: typed,
equalScalar: equalScalar
});
var algorithm08 = createAlgorithm08({
typed: typed,
equalScalar: equalScalar
});
var algorithm10 = createAlgorithm10({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm11 = createAlgorithm11({
typed: typed,
equalScalar: equalScalar
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Bitwise right logical shift of value x by y number of bits, `x >>> y`.
* For matrices, the function is evaluated element wise.
* For units, the function is evaluated on the best prefix base.
*
* Syntax:
*
* math.rightLogShift(x, y)
*
* Examples:
*
* math.rightLogShift(4, 2) // returns number 1
*
* math.rightLogShift([16, -32, 64], 4) // returns Array [1, 2, 3]
*
* See also:
*
* bitAnd, bitNot, bitOr, bitXor, leftShift, rightLogShift
*
* @param {number | Array | Matrix} x Value to be shifted
* @param {number} y Amount of shifts
* @return {number | Array | Matrix} `x` zero-filled shifted right `y` times
*/
return typed(rightLogShift_name, {
'number, number': rightLogShiftNumber,
// 'BigNumber, BigNumber': ..., // TODO: implement BigNumber support for rightLogShift
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm08(x, y, this, false);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm02(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm01(x, y, this, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
// check scalar
if (equalScalar(y, 0)) {
return x.clone();
}
return algorithm11(x, y, this, false);
},
'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
// check scalar
if (equalScalar(y, 0)) {
return x.clone();
}
return algorithm14(x, y, this, false);
},
'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
// check scalar
if (equalScalar(x, 0)) {
return zeros(y.size(), y.storage());
}
return algorithm10(y, x, this, true);
},
'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
// check scalar
if (equalScalar(x, 0)) {
return zeros(y.size(), y.storage());
}
return algorithm14(y, x, this, true);
},
'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
// use matrix implementation
return this(matrix(x), y).valueOf();
},
'number | BigNumber, Array': function numberBigNumberArray(x, y) {
// use matrix implementation
return this(x, matrix(y)).valueOf();
}
});
});
// CONCATENATED MODULE: ./src/function/logical/and.js
var and_name = 'and';
var and_dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'not'];
var createAnd = /* #__PURE__ */Object(factory["a" /* factory */])(and_name, and_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
equalScalar = _ref.equalScalar,
zeros = _ref.zeros,
not = _ref.not;
var algorithm02 = createAlgorithm02({
typed: typed,
equalScalar: equalScalar
});
var algorithm06 = createAlgorithm06({
typed: typed,
equalScalar: equalScalar
});
var algorithm11 = createAlgorithm11({
typed: typed,
equalScalar: equalScalar
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Logical `and`. Test whether two values are both defined with a nonzero/nonempty value.
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.and(x, y)
*
* Examples:
*
* math.and(2, 4) // returns true
*
* a = [2, 0, 0]
* b = [3, 7, 0]
* c = 0
*
* math.and(a, b) // returns [true, false, false]
* math.and(a, c) // returns [false, false, false]
*
* See also:
*
* not, or, xor
*
* @param {number | BigNumber | Complex | Unit | Array | Matrix} x First value to check
* @param {number | BigNumber | Complex | Unit | Array | Matrix} y Second value to check
* @return {boolean | Array | Matrix}
* Returns true when both inputs are defined with a nonzero/nonempty value.
*/
return typed(and_name, {
'number, number': andNumber,
'Complex, Complex': function ComplexComplex(x, y) {
return (x.re !== 0 || x.im !== 0) && (y.re !== 0 || y.im !== 0);
},
'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
return !x.isZero() && !y.isZero() && !x.isNaN() && !y.isNaN();
},
'Unit, Unit': function UnitUnit(x, y) {
return this(x.value || 0, y.value || 0);
},
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm06(x, y, this, false);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm02(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm02(x, y, this, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
// check scalar
if (not(y)) {
// return zero matrix
return zeros(x.size(), x.storage());
}
return algorithm11(x, y, this, false);
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
// check scalar
if (not(y)) {
// return zero matrix
return zeros(x.size(), x.storage());
}
return algorithm14(x, y, this, false);
},
'any, SparseMatrix': function anySparseMatrix(x, y) {
// check scalar
if (not(x)) {
// return zero matrix
return zeros(x.size(), x.storage());
}
return algorithm11(y, x, this, true);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
// check scalar
if (not(x)) {
// return zero matrix
return zeros(x.size(), x.storage());
}
return algorithm14(y, x, this, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return this(matrix(x), y).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return this(x, matrix(y)).valueOf();
}
});
});
// CONCATENATED MODULE: ./src/function/relational/compare.js
var compare_name = 'compare';
var compare_dependencies = ['typed', 'config', 'matrix', 'equalScalar', 'BigNumber', 'Fraction', 'DenseMatrix'];
var createCompare = /* #__PURE__ */Object(factory["a" /* factory */])(compare_name, compare_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
equalScalar = _ref.equalScalar,
matrix = _ref.matrix,
BigNumber = _ref.BigNumber,
Fraction = _ref.Fraction,
DenseMatrix = _ref.DenseMatrix;
var algorithm03 = createAlgorithm03({
typed: typed
});
var algorithm05 = createAlgorithm05({
typed: typed,
equalScalar: equalScalar
});
var algorithm12 = createAlgorithm12({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Compare two values. Returns 1 when x > y, -1 when x < y, and 0 when x == y.
*
* x and y are considered equal when the relative difference between x and y
* is smaller than the configured epsilon. The function cannot be used to
* compare values smaller than approximately 2.22e-16.
*
* For matrices, the function is evaluated element wise.
* Strings are compared by their numerical value.
*
* Syntax:
*
* math.compare(x, y)
*
* Examples:
*
* math.compare(6, 1) // returns 1
* math.compare(2, 3) // returns -1
* math.compare(7, 7) // returns 0
* math.compare('10', '2') // returns 1
* math.compare('1000', '1e3') // returns 0
*
* const a = math.unit('5 cm')
* const b = math.unit('40 mm')
* math.compare(a, b) // returns 1
*
* math.compare(2, [1, 2, 3]) // returns [1, 0, -1]
*
* See also:
*
* equal, unequal, smaller, smallerEq, larger, largerEq, compareNatural, compareText
*
* @param {number | BigNumber | Fraction | Unit | string | Array | Matrix} x First value to compare
* @param {number | BigNumber | Fraction | Unit | string | Array | Matrix} y Second value to compare
* @return {number | BigNumber | Fraction | Array | Matrix} Returns the result of the comparison:
* 1 when x > y, -1 when x < y, and 0 when x == y.
*/
return typed(compare_name, {
'boolean, boolean': function booleanBoolean(x, y) {
return x === y ? 0 : x > y ? 1 : -1;
},
'number, number': function numberNumber(x, y) {
return Object(utils_number["m" /* nearlyEqual */])(x, y, config.epsilon) ? 0 : x > y ? 1 : -1;
},
'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
return nearlyEqual(x, y, config.epsilon) ? new BigNumber(0) : new BigNumber(x.cmp(y));
},
'Fraction, Fraction': function FractionFraction(x, y) {
return new Fraction(x.compare(y));
},
'Complex, Complex': function ComplexComplex() {
throw new TypeError('No ordering relation is defined for complex numbers');
},
'Unit, Unit': function UnitUnit(x, y) {
if (!x.equalBase(y)) {
throw new Error('Cannot compare units with different base');
}
return this(x.value, y.value);
},
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm05(x, y, this);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm03(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm03(x, y, this, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
return algorithm12(x, y, this, false);
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, this, false);
},
'any, SparseMatrix': function anySparseMatrix(x, y) {
return algorithm12(y, x, this, true);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
return algorithm14(y, x, this, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, this, false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, this, true).valueOf();
}
});
});
var createCompareNumber = /* #__PURE__ */Object(factory["a" /* factory */])(compare_name, ['typed', 'config'], function (_ref2) {
var typed = _ref2.typed,
config = _ref2.config;
return typed(compare_name, {
'number, number': function numberNumber(x, y) {
return Object(utils_number["m" /* nearlyEqual */])(x, y, config.epsilon) ? 0 : x > y ? 1 : -1;
}
});
});
// EXTERNAL MODULE: ./node_modules/javascript-natural-sort/naturalSort.js
var naturalSort = __webpack_require__(11);
var naturalSort_default = /*#__PURE__*/__webpack_require__.n(naturalSort);
// CONCATENATED MODULE: ./src/function/relational/compareNatural.js
var compareNatural_name = 'compareNatural';
var compareNatural_dependencies = ['typed', 'compare'];
var createCompareNatural = /* #__PURE__ */Object(factory["a" /* factory */])(compareNatural_name, compareNatural_dependencies, function (_ref) {
var typed = _ref.typed,
compare = _ref.compare;
var compareBooleans = compare.signatures['boolean,boolean'];
/**
* Compare two values of any type in a deterministic, natural way.
*
* For numeric values, the function works the same as `math.compare`.
* For types of values that can't be compared mathematically,
* the function compares in a natural way.
*
* For numeric values, x and y are considered equal when the relative
* difference between x and y is smaller than the configured epsilon.
* The function cannot be used to compare values smaller than
* approximately 2.22e-16.
*
* For Complex numbers, first the real parts are compared. If equal,
* the imaginary parts are compared.
*
* Strings are compared with a natural sorting algorithm, which
* orders strings in a "logic" way following some heuristics.
* This differs from the function `compare`, which converts the string
* into a numeric value and compares that. The function `compareText`
* on the other hand compares text lexically.
*
* Arrays and Matrices are compared value by value until there is an
* unequal pair of values encountered. Objects are compared by sorted
* keys until the keys or their values are unequal.
*
* Syntax:
*
* math.compareNatural(x, y)
*
* Examples:
*
* math.compareNatural(6, 1) // returns 1
* math.compareNatural(2, 3) // returns -1
* math.compareNatural(7, 7) // returns 0
*
* math.compareNatural('10', '2') // returns 1
* math.compareText('10', '2') // returns -1
* math.compare('10', '2') // returns 1
*
* math.compareNatural('Answer: 10', 'Answer: 2') // returns 1
* math.compareText('Answer: 10', 'Answer: 2') // returns -1
* math.compare('Answer: 10', 'Answer: 2')
* // Error: Cannot convert "Answer: 10" to a number
*
* const a = math.unit('5 cm')
* const b = math.unit('40 mm')
* math.compareNatural(a, b) // returns 1
*
* const c = math.complex('2 + 3i')
* const d = math.complex('2 + 4i')
* math.compareNatural(c, d) // returns -1
*
* math.compareNatural([1, 2, 4], [1, 2, 3]) // returns 1
* math.compareNatural([1, 2, 3], [1, 2]) // returns 1
* math.compareNatural([1, 5], [1, 2, 3]) // returns 1
* math.compareNatural([1, 2], [1, 2]) // returns 0
*
* math.compareNatural({a: 2}, {a: 4}) // returns -1
*
* See also:
*
* compare, compareText
*
* @param {*} x First value to compare
* @param {*} y Second value to compare
* @return {number} Returns the result of the comparison:
* 1 when x > y, -1 when x < y, and 0 when x == y.
*/
return typed(compareNatural_name, {
'any, any': function anyAny(x, y) {
var typeX = Object(is["M" /* typeOf */])(x);
var typeY = Object(is["M" /* typeOf */])(y);
var c; // numeric types
if ((typeX === 'number' || typeX === 'BigNumber' || typeX === 'Fraction') && (typeY === 'number' || typeY === 'BigNumber' || typeY === 'Fraction')) {
c = compare(x, y);
if (c.toString() !== '0') {
// c can be number, BigNumber, or Fraction
return c > 0 ? 1 : -1; // return a number
} else {
return naturalSort_default()(typeX, typeY);
}
} // matrix types
if (typeX === 'Array' || typeX === 'Matrix' || typeY === 'Array' || typeY === 'Matrix') {
c = compareMatricesAndArrays(this, x, y);
if (c !== 0) {
return c;
} else {
return naturalSort_default()(typeX, typeY);
}
} // in case of different types, order by name of type, i.e. 'BigNumber' < 'Complex'
if (typeX !== typeY) {
return naturalSort_default()(typeX, typeY);
}
if (typeX === 'Complex') {
return compareComplexNumbers(x, y);
}
if (typeX === 'Unit') {
if (x.equalBase(y)) {
return this(x.value, y.value);
} // compare by units
return compareArrays(this, x.formatUnits(), y.formatUnits());
}
if (typeX === 'boolean') {
return compareBooleans(x, y);
}
if (typeX === 'string') {
return naturalSort_default()(x, y);
}
if (typeX === 'Object') {
return compareObjects(this, x, y);
}
if (typeX === 'null') {
return 0;
}
if (typeX === 'undefined') {
return 0;
} // this should not occur...
throw new TypeError('Unsupported type of value "' + typeX + '"');
}
});
/**
* Compare mixed matrix/array types, by converting to same-shaped array.
* This comparator is non-deterministic regarding input types.
* @param {Array | SparseMatrix | DenseMatrix | *} x
* @param {Array | SparseMatrix | DenseMatrix | *} y
* @returns {number} Returns the comparison result: -1, 0, or 1
*/
function compareMatricesAndArrays(compareNatural, x, y) {
if (Object(is["H" /* isSparseMatrix */])(x) && Object(is["H" /* isSparseMatrix */])(y)) {
return compareArrays(compareNatural, x.toJSON().values, y.toJSON().values);
}
if (Object(is["H" /* isSparseMatrix */])(x)) {
// note: convert to array is expensive
return compareMatricesAndArrays(compareNatural, x.toArray(), y);
}
if (Object(is["H" /* isSparseMatrix */])(y)) {
// note: convert to array is expensive
return compareMatricesAndArrays(compareNatural, x, y.toArray());
} // convert DenseArray into Array
if (Object(is["n" /* isDenseMatrix */])(x)) {
return compareMatricesAndArrays(compareNatural, x.toJSON().data, y);
}
if (Object(is["n" /* isDenseMatrix */])(y)) {
return compareMatricesAndArrays(compareNatural, x, y.toJSON().data);
} // convert scalars to array
if (!Array.isArray(x)) {
return compareMatricesAndArrays(compareNatural, [x], y);
}
if (!Array.isArray(y)) {
return compareMatricesAndArrays(compareNatural, x, [y]);
}
return compareArrays(compareNatural, x, y);
}
/**
* Compare two Arrays
*
* - First, compares value by value
* - Next, if all corresponding values are equal,
* look at the length: longest array will be considered largest
*
* @param {Array} x
* @param {Array} y
* @returns {number} Returns the comparison result: -1, 0, or 1
*/
function compareArrays(compareNatural, x, y) {
// compare each value
for (var i = 0, ii = Math.min(x.length, y.length); i < ii; i++) {
var v = compareNatural(x[i], y[i]);
if (v !== 0) {
return v;
}
} // compare the size of the arrays
if (x.length > y.length) {
return 1;
}
if (x.length < y.length) {
return -1;
} // both Arrays have equal size and content
return 0;
}
/**
* Compare two objects
*
* - First, compare sorted property names
* - Next, compare the property values
*
* @param {Object} x
* @param {Object} y
* @returns {number} Returns the comparison result: -1, 0, or 1
*/
function compareObjects(compareNatural, x, y) {
var keysX = Object.keys(x);
var keysY = Object.keys(y); // compare keys
keysX.sort(naturalSort_default.a);
keysY.sort(naturalSort_default.a);
var c = compareArrays(compareNatural, keysX, keysY);
if (c !== 0) {
return c;
} // compare values
for (var i = 0; i < keysX.length; i++) {
var v = compareNatural(x[keysX[i]], y[keysY[i]]);
if (v !== 0) {
return v;
}
}
return 0;
}
});
/**
* Compare two complex numbers, `x` and `y`:
*
* - First, compare the real values of `x` and `y`
* - If equal, compare the imaginary values of `x` and `y`
*
* @params {Complex} x
* @params {Complex} y
* @returns {number} Returns the comparison result: -1, 0, or 1
*/
function compareComplexNumbers(x, y) {
if (x.re > y.re) {
return 1;
}
if (x.re < y.re) {
return -1;
}
if (x.im > y.im) {
return 1;
}
if (x.im < y.im) {
return -1;
}
return 0;
}
// CONCATENATED MODULE: ./src/function/relational/compareText.js
var compareText_name = 'compareText';
var compareText_dependencies = ['typed', 'matrix'];
var createCompareText = /* #__PURE__ */Object(factory["a" /* factory */])(compareText_name, compareText_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix;
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Compare two strings lexically. Comparison is case sensitive.
* Returns 1 when x > y, -1 when x < y, and 0 when x == y.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.compareText(x, y)
*
* Examples:
*
* math.compareText('B', 'A') // returns 1
* math.compareText('2', '10') // returns 1
* math.compare('2', '10') // returns -1
* math.compareNatural('2', '10') // returns -1
*
* math.compareText('B', ['A', 'B', 'C']) // returns [1, 0, -1]
*
* See also:
*
* equal, equalText, compare, compareNatural
*
* @param {string | Array | DenseMatrix} x First string to compare
* @param {string | Array | DenseMatrix} y Second string to compare
* @return {number | Array | DenseMatrix} Returns the result of the comparison:
* 1 when x > y, -1 when x < y, and 0 when x == y.
*/
return typed(compareText_name, {
'any, any': utils_string["a" /* compareText */],
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, utils_string["a" /* compareText */]);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, utils_string["a" /* compareText */], false);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
return algorithm14(y, x, utils_string["a" /* compareText */], true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, utils_string["a" /* compareText */], false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, utils_string["a" /* compareText */], true).valueOf();
}
});
});
var createCompareTextNumber = /* #__PURE__ */Object(factory["a" /* factory */])(compareText_name, ['typed'], function (_ref2) {
var typed = _ref2.typed;
return typed(compareText_name, {
'any, any': utils_string["a" /* compareText */]
});
});
// CONCATENATED MODULE: ./src/function/relational/equal.js
var equal_name = 'equal';
var equal_dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];
var createEqual = /* #__PURE__ */Object(factory["a" /* factory */])(equal_name, equal_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
equalScalar = _ref.equalScalar,
DenseMatrix = _ref.DenseMatrix;
var algorithm03 = createAlgorithm03({
typed: typed
});
var algorithm07 = createAlgorithm07({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm12 = createAlgorithm12({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Test whether two values are equal.
*
* The function tests whether the relative difference between x and y is
* smaller than the configured epsilon. The function cannot be used to
* compare values smaller than approximately 2.22e-16.
*
* For matrices, the function is evaluated element wise.
* In case of complex numbers, x.re must equal y.re, and x.im must equal y.im.
*
* Values `null` and `undefined` are compared strictly, thus `null` is only
* equal to `null` and nothing else, and `undefined` is only equal to
* `undefined` and nothing else. Strings are compared by their numerical value.
*
* Syntax:
*
* math.equal(x, y)
*
* Examples:
*
* math.equal(2 + 2, 3) // returns false
* math.equal(2 + 2, 4) // returns true
*
* const a = math.unit('50 cm')
* const b = math.unit('5 m')
* math.equal(a, b) // returns true
*
* const c = [2, 5, 1]
* const d = [2, 7, 1]
*
* math.equal(c, d) // returns [true, false, true]
* math.deepEqual(c, d) // returns false
*
* math.equal("1000", "1e3") // returns true
* math.equal(0, null) // returns false
*
* See also:
*
* unequal, smaller, smallerEq, larger, largerEq, compare, deepEqual, equalText
*
* @param {number | BigNumber | boolean | Complex | Unit | string | Array | Matrix} x First value to compare
* @param {number | BigNumber | boolean | Complex | Unit | string | Array | Matrix} y Second value to compare
* @return {boolean | Array | Matrix} Returns true when the compared values are equal, else returns false
*/
return typed(equal_name, {
'any, any': function anyAny(x, y) {
// strict equality for null and undefined?
if (x === null) {
return y === null;
}
if (y === null) {
return x === null;
}
if (x === undefined) {
return y === undefined;
}
if (y === undefined) {
return x === undefined;
}
return equalScalar(x, y);
},
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm07(x, y, equalScalar);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm03(y, x, equalScalar, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm03(x, y, equalScalar, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, equalScalar);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
return algorithm12(x, y, equalScalar, false);
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, equalScalar, false);
},
'any, SparseMatrix': function anySparseMatrix(x, y) {
return algorithm12(y, x, equalScalar, true);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
return algorithm14(y, x, equalScalar, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, equalScalar, false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, equalScalar, true).valueOf();
}
});
});
var createEqualNumber = Object(factory["a" /* factory */])(equal_name, ['typed', 'equalScalar'], function (_ref2) {
var typed = _ref2.typed,
equalScalar = _ref2.equalScalar;
return typed(equal_name, {
'any, any': function anyAny(x, y) {
// strict equality for null and undefined?
if (x === null) {
return y === null;
}
if (y === null) {
return x === null;
}
if (x === undefined) {
return y === undefined;
}
if (y === undefined) {
return x === undefined;
}
return equalScalar(x, y);
}
});
});
// CONCATENATED MODULE: ./src/function/relational/equalText.js
var equalText_name = 'equalText';
var equalText_dependencies = ['typed', 'compareText', 'isZero'];
var createEqualText = /* #__PURE__ */Object(factory["a" /* factory */])(equalText_name, equalText_dependencies, function (_ref) {
var typed = _ref.typed,
compareText = _ref.compareText,
isZero = _ref.isZero;
/**
* Check equality of two strings. Comparison is case sensitive.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.equalText(x, y)
*
* Examples:
*
* math.equalText('Hello', 'Hello') // returns true
* math.equalText('a', 'A') // returns false
* math.equal('2e3', '2000') // returns true
* math.equalText('2e3', '2000') // returns false
*
* math.equalText('B', ['A', 'B', 'C']) // returns [false, true, false]
*
* See also:
*
* equal, compareText, compare, compareNatural
*
* @param {string | Array | DenseMatrix} x First string to compare
* @param {string | Array | DenseMatrix} y Second string to compare
* @return {number | Array | DenseMatrix} Returns true if the values are equal, and false if not.
*/
return typed(equalText_name, {
'any, any': function anyAny(x, y) {
return isZero(compareText(x, y));
}
});
});
// CONCATENATED MODULE: ./src/function/relational/smaller.js
var smaller_name = 'smaller';
var smaller_dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];
var createSmaller = /* #__PURE__ */Object(factory["a" /* factory */])(smaller_name, smaller_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
matrix = _ref.matrix,
DenseMatrix = _ref.DenseMatrix;
var algorithm03 = createAlgorithm03({
typed: typed
});
var algorithm07 = createAlgorithm07({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm12 = createAlgorithm12({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Test whether value x is smaller than y.
*
* The function returns true when x is smaller than y and the relative
* difference between x and y is smaller than the configured epsilon. The
* function cannot be used to compare values smaller than approximately 2.22e-16.
*
* For matrices, the function is evaluated element wise.
* Strings are compared by their numerical value.
*
* Syntax:
*
* math.smaller(x, y)
*
* Examples:
*
* math.smaller(2, 3) // returns true
* math.smaller(5, 2 * 2) // returns false
*
* const a = math.unit('5 cm')
* const b = math.unit('2 inch')
* math.smaller(a, b) // returns true
*
* See also:
*
* equal, unequal, smallerEq, smaller, smallerEq, compare
*
* @param {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare
* @param {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
* @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false
*/
return typed(smaller_name, {
'boolean, boolean': function booleanBoolean(x, y) {
return x < y;
},
'number, number': function numberNumber(x, y) {
return x < y && !Object(utils_number["m" /* nearlyEqual */])(x, y, config.epsilon);
},
'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
return x.lt(y) && !nearlyEqual(x, y, config.epsilon);
},
'Fraction, Fraction': function FractionFraction(x, y) {
return x.compare(y) === -1;
},
'Complex, Complex': function ComplexComplex(x, y) {
throw new TypeError('No ordering relation is defined for complex numbers');
},
'Unit, Unit': function UnitUnit(x, y) {
if (!x.equalBase(y)) {
throw new Error('Cannot compare units with different base');
}
return this(x.value, y.value);
},
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm07(x, y, this);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm03(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm03(x, y, this, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
return algorithm12(x, y, this, false);
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, this, false);
},
'any, SparseMatrix': function anySparseMatrix(x, y) {
return algorithm12(y, x, this, true);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
return algorithm14(y, x, this, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, this, false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, this, true).valueOf();
}
});
});
var createSmallerNumber = /* #__PURE__ */Object(factory["a" /* factory */])(smaller_name, ['typed', 'config'], function (_ref2) {
var typed = _ref2.typed,
config = _ref2.config;
return typed(smaller_name, {
'number, number': function numberNumber(x, y) {
return x < y && !Object(utils_number["m" /* nearlyEqual */])(x, y, config.epsilon);
}
});
});
// CONCATENATED MODULE: ./src/function/relational/smallerEq.js
var smallerEq_name = 'smallerEq';
var smallerEq_dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];
var createSmallerEq = /* #__PURE__ */Object(factory["a" /* factory */])(smallerEq_name, smallerEq_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
matrix = _ref.matrix,
DenseMatrix = _ref.DenseMatrix;
var algorithm03 = createAlgorithm03({
typed: typed
});
var algorithm07 = createAlgorithm07({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm12 = createAlgorithm12({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Test whether value x is smaller or equal to y.
*
* The function returns true when x is smaller than y or the relative
* difference between x and y is smaller than the configured epsilon. The
* function cannot be used to compare values smaller than approximately 2.22e-16.
*
* For matrices, the function is evaluated element wise.
* Strings are compared by their numerical value.
*
* Syntax:
*
* math.smallerEq(x, y)
*
* Examples:
*
* math.smaller(1 + 2, 3) // returns false
* math.smallerEq(1 + 2, 3) // returns true
*
* See also:
*
* equal, unequal, smaller, larger, largerEq, compare
*
* @param {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare
* @param {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
* @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false
*/
return typed(smallerEq_name, {
'boolean, boolean': function booleanBoolean(x, y) {
return x <= y;
},
'number, number': function numberNumber(x, y) {
return x <= y || Object(utils_number["m" /* nearlyEqual */])(x, y, config.epsilon);
},
'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
return x.lte(y) || nearlyEqual(x, y, config.epsilon);
},
'Fraction, Fraction': function FractionFraction(x, y) {
return x.compare(y) !== 1;
},
'Complex, Complex': function ComplexComplex() {
throw new TypeError('No ordering relation is defined for complex numbers');
},
'Unit, Unit': function UnitUnit(x, y) {
if (!x.equalBase(y)) {
throw new Error('Cannot compare units with different base');
}
return this(x.value, y.value);
},
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm07(x, y, this);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm03(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm03(x, y, this, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
return algorithm12(x, y, this, false);
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, this, false);
},
'any, SparseMatrix': function anySparseMatrix(x, y) {
return algorithm12(y, x, this, true);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
return algorithm14(y, x, this, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, this, false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, this, true).valueOf();
}
});
});
var createSmallerEqNumber = /* #__PURE__ */Object(factory["a" /* factory */])(smallerEq_name, ['typed', 'config'], function (_ref2) {
var typed = _ref2.typed,
config = _ref2.config;
return typed(smallerEq_name, {
'number, number': function numberNumber(x, y) {
return x <= y || Object(utils_number["m" /* nearlyEqual */])(x, y, config.epsilon);
}
});
});
// CONCATENATED MODULE: ./src/function/relational/larger.js
var larger_name = 'larger';
var larger_dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];
var createLarger = /* #__PURE__ */Object(factory["a" /* factory */])(larger_name, larger_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
matrix = _ref.matrix,
DenseMatrix = _ref.DenseMatrix;
var algorithm03 = createAlgorithm03({
typed: typed
});
var algorithm07 = createAlgorithm07({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm12 = createAlgorithm12({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Test whether value x is larger than y.
*
* The function returns true when x is larger than y and the relative
* difference between x and y is larger than the configured epsilon. The
* function cannot be used to compare values smaller than approximately 2.22e-16.
*
* For matrices, the function is evaluated element wise.
* Strings are compared by their numerical value.
*
* Syntax:
*
* math.larger(x, y)
*
* Examples:
*
* math.larger(2, 3) // returns false
* math.larger(5, 2 + 2) // returns true
*
* const a = math.unit('5 cm')
* const b = math.unit('2 inch')
* math.larger(a, b) // returns false
*
* See also:
*
* equal, unequal, smaller, smallerEq, largerEq, compare
*
* @param {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare
* @param {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
* @return {boolean | Array | Matrix} Returns true when the x is larger than y, else returns false
*/
return typed(larger_name, {
'boolean, boolean': function booleanBoolean(x, y) {
return x > y;
},
'number, number': function numberNumber(x, y) {
return x > y && !Object(utils_number["m" /* nearlyEqual */])(x, y, config.epsilon);
},
'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
return x.gt(y) && !nearlyEqual(x, y, config.epsilon);
},
'Fraction, Fraction': function FractionFraction(x, y) {
return x.compare(y) === 1;
},
'Complex, Complex': function ComplexComplex() {
throw new TypeError('No ordering relation is defined for complex numbers');
},
'Unit, Unit': function UnitUnit(x, y) {
if (!x.equalBase(y)) {
throw new Error('Cannot compare units with different base');
}
return this(x.value, y.value);
},
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm07(x, y, this);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm03(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm03(x, y, this, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
return algorithm12(x, y, this, false);
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, this, false);
},
'any, SparseMatrix': function anySparseMatrix(x, y) {
return algorithm12(y, x, this, true);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
return algorithm14(y, x, this, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, this, false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, this, true).valueOf();
}
});
});
var createLargerNumber = /* #__PURE__ */Object(factory["a" /* factory */])(larger_name, ['typed', 'config'], function (_ref2) {
var typed = _ref2.typed,
config = _ref2.config;
return typed(larger_name, {
'number, number': function numberNumber(x, y) {
return x > y && !Object(utils_number["m" /* nearlyEqual */])(x, y, config.epsilon);
}
});
});
// CONCATENATED MODULE: ./src/function/relational/largerEq.js
var largerEq_name = 'largerEq';
var largerEq_dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];
var createLargerEq = /* #__PURE__ */Object(factory["a" /* factory */])(largerEq_name, largerEq_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
matrix = _ref.matrix,
DenseMatrix = _ref.DenseMatrix;
var algorithm03 = createAlgorithm03({
typed: typed
});
var algorithm07 = createAlgorithm07({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm12 = createAlgorithm12({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Test whether value x is larger or equal to y.
*
* The function returns true when x is larger than y or the relative
* difference between x and y is smaller than the configured epsilon. The
* function cannot be used to compare values smaller than approximately 2.22e-16.
*
* For matrices, the function is evaluated element wise.
* Strings are compared by their numerical value.
*
* Syntax:
*
* math.largerEq(x, y)
*
* Examples:
*
* math.larger(2, 1 + 1) // returns false
* math.largerEq(2, 1 + 1) // returns true
*
* See also:
*
* equal, unequal, smaller, smallerEq, larger, compare
*
* @param {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare
* @param {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
* @return {boolean | Array | Matrix} Returns true when the x is larger or equal to y, else returns false
*/
return typed(largerEq_name, {
'boolean, boolean': function booleanBoolean(x, y) {
return x >= y;
},
'number, number': function numberNumber(x, y) {
return x >= y || Object(utils_number["m" /* nearlyEqual */])(x, y, config.epsilon);
},
'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
return x.gte(y) || nearlyEqual(x, y, config.epsilon);
},
'Fraction, Fraction': function FractionFraction(x, y) {
return x.compare(y) !== -1;
},
'Complex, Complex': function ComplexComplex() {
throw new TypeError('No ordering relation is defined for complex numbers');
},
'Unit, Unit': function UnitUnit(x, y) {
if (!x.equalBase(y)) {
throw new Error('Cannot compare units with different base');
}
return this(x.value, y.value);
},
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm07(x, y, this);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm03(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm03(x, y, this, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
return algorithm12(x, y, this, false);
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, this, false);
},
'any, SparseMatrix': function anySparseMatrix(x, y) {
return algorithm12(y, x, this, true);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
return algorithm14(y, x, this, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, this, false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, this, true).valueOf();
}
});
});
var createLargerEqNumber = /* #__PURE__ */Object(factory["a" /* factory */])(largerEq_name, ['typed', 'config'], function (_ref2) {
var typed = _ref2.typed,
config = _ref2.config;
return typed(largerEq_name, {
'number, number': function numberNumber(x, y) {
return x >= y || Object(utils_number["m" /* nearlyEqual */])(x, y, config.epsilon);
}
});
});
// CONCATENATED MODULE: ./src/function/relational/deepEqual.js
var deepEqual_name = 'deepEqual';
var deepEqual_dependencies = ['typed', 'equal'];
var createDeepEqual = /* #__PURE__ */Object(factory["a" /* factory */])(deepEqual_name, deepEqual_dependencies, function (_ref) {
var typed = _ref.typed,
equal = _ref.equal;
/**
* Test element wise whether two matrices are equal.
* The function accepts both matrices and scalar values.
*
* Strings are compared by their numerical value.
*
* Syntax:
*
* math.deepEqual(x, y)
*
* Examples:
*
* math.deepEqual(2, 4) // returns false
*
* a = [2, 5, 1]
* b = [2, 7, 1]
*
* math.deepEqual(a, b) // returns false
* math.equal(a, b) // returns [true, false, true]
*
* See also:
*
* equal, unequal
*
* @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First matrix to compare
* @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second matrix to compare
* @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}
* Returns true when the input matrices have the same size and each of their elements is equal.
*/
return typed(deepEqual_name, {
'any, any': function anyAny(x, y) {
return _deepEqual(x.valueOf(), y.valueOf());
}
});
/**
* Test whether two arrays have the same size and all elements are equal
* @param {Array | *} x
* @param {Array | *} y
* @return {boolean} Returns true if both arrays are deep equal
*/
function _deepEqual(x, y) {
if (Array.isArray(x)) {
if (Array.isArray(y)) {
var len = x.length;
if (len !== y.length) {
return false;
}
for (var i = 0; i < len; i++) {
if (!_deepEqual(x[i], y[i])) {
return false;
}
}
return true;
} else {
return false;
}
} else {
if (Array.isArray(y)) {
return false;
} else {
return equal(x, y);
}
}
}
});
// CONCATENATED MODULE: ./src/function/relational/unequal.js
var unequal_name = 'unequal';
var unequal_dependencies = ['typed', 'config', 'equalScalar', 'matrix', 'DenseMatrix'];
var createUnequal = /* #__PURE__ */Object(factory["a" /* factory */])(unequal_name, unequal_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
equalScalar = _ref.equalScalar,
matrix = _ref.matrix,
DenseMatrix = _ref.DenseMatrix;
var algorithm03 = createAlgorithm03({
typed: typed
});
var algorithm07 = createAlgorithm07({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm12 = createAlgorithm12({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Test whether two values are unequal.
*
* The function tests whether the relative difference between x and y is
* larger than the configured epsilon. The function cannot be used to compare
* values smaller than approximately 2.22e-16.
*
* For matrices, the function is evaluated element wise.
* In case of complex numbers, x.re must unequal y.re, or x.im must unequal y.im.
* Strings are compared by their numerical value.
*
* Values `null` and `undefined` are compared strictly, thus `null` is unequal
* with everything except `null`, and `undefined` is unequal with everything
* except `undefined`.
*
* Syntax:
*
* math.unequal(x, y)
*
* Examples:
*
* math.unequal(2 + 2, 3) // returns true
* math.unequal(2 + 2, 4) // returns false
*
* const a = math.unit('50 cm')
* const b = math.unit('5 m')
* math.unequal(a, b) // returns false
*
* const c = [2, 5, 1]
* const d = [2, 7, 1]
*
* math.unequal(c, d) // returns [false, true, false]
* math.deepEqual(c, d) // returns false
*
* math.unequal(0, null) // returns true
* See also:
*
* equal, deepEqual, smaller, smallerEq, larger, largerEq, compare
*
* @param {number | BigNumber | Fraction | boolean | Complex | Unit | string | Array | Matrix | undefined} x First value to compare
* @param {number | BigNumber | Fraction | boolean | Complex | Unit | string | Array | Matrix | undefined} y Second value to compare
* @return {boolean | Array | Matrix} Returns true when the compared values are unequal, else returns false
*/
return typed('unequal', {
'any, any': function anyAny(x, y) {
// strict equality for null and undefined?
if (x === null) {
return y !== null;
}
if (y === null) {
return x !== null;
}
if (x === undefined) {
return y !== undefined;
}
if (y === undefined) {
return x !== undefined;
}
return _unequal(x, y);
},
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm07(x, y, _unequal);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm03(y, x, _unequal, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm03(x, y, _unequal, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, _unequal);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
return algorithm12(x, y, _unequal, false);
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, _unequal, false);
},
'any, SparseMatrix': function anySparseMatrix(x, y) {
return algorithm12(y, x, _unequal, true);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
return algorithm14(y, x, _unequal, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, _unequal, false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, _unequal, true).valueOf();
}
});
function _unequal(x, y) {
return !equalScalar(x, y);
}
});
var createUnequalNumber = Object(factory["a" /* factory */])(unequal_name, ['typed', 'equalScalar'], function (_ref2) {
var typed = _ref2.typed,
equalScalar = _ref2.equalScalar;
return typed(unequal_name, {
'any, any': function anyAny(x, y) {
// strict equality for null and undefined?
if (x === null) {
return y !== null;
}
if (y === null) {
return x !== null;
}
if (x === undefined) {
return y !== undefined;
}
if (y === undefined) {
return x !== undefined;
}
return !equalScalar(x, y);
}
});
});
// CONCATENATED MODULE: ./src/function/matrix/partitionSelect.js
var partitionSelect_name = 'partitionSelect';
var partitionSelect_dependencies = ['typed', 'isNumeric', 'isNaN', 'compare'];
var createPartitionSelect = /* #__PURE__ */Object(factory["a" /* factory */])(partitionSelect_name, partitionSelect_dependencies, function (_ref) {
var typed = _ref.typed,
isNumeric = _ref.isNumeric,
isNaN = _ref.isNaN,
compare = _ref.compare;
var asc = compare;
var desc = function desc(a, b) {
return -compare(a, b);
};
/**
* Partition-based selection of an array or 1D matrix.
* Will find the kth smallest value, and mutates the input array.
* Uses Quickselect.
*
* Syntax:
*
* math.partitionSelect(x, k)
* math.partitionSelect(x, k, compare)
*
* Examples:
*
* math.partitionSelect([5, 10, 1], 2) // returns 10
* math.partitionSelect(['C', 'B', 'A', 'D'], 1) // returns 'B'
*
* function sortByLength (a, b) {
* return a.length - b.length
* }
* math.partitionSelect(['Langdon', 'Tom', 'Sara'], 2, sortByLength) // returns 'Langdon'
*
* See also:
*
* sort
*
* @param {Matrix | Array} x A one dimensional matrix or array to sort
* @param {Number} k The kth smallest value to be retrieved zero-based index
* @param {Function | 'asc' | 'desc'} [compare='asc']
* An optional comparator function. The function is called as
* `compare(a, b)`, and must return 1 when a > b, -1 when a < b,
* and 0 when a == b.
* @return {*} Returns the kth lowest value.
*/
return typed(partitionSelect_name, {
'Array | Matrix, number': function ArrayMatrixNumber(x, k) {
return _partitionSelect(x, k, asc);
},
'Array | Matrix, number, string': function ArrayMatrixNumberString(x, k, compare) {
if (compare === 'asc') {
return _partitionSelect(x, k, asc);
} else if (compare === 'desc') {
return _partitionSelect(x, k, desc);
} else {
throw new Error('Compare string must be "asc" or "desc"');
}
},
'Array | Matrix, number, function': _partitionSelect
});
function _partitionSelect(x, k, compare) {
if (!Object(utils_number["i" /* isInteger */])(k) || k < 0) {
throw new Error('k must be a non-negative integer');
}
if (Object(is["v" /* isMatrix */])(x)) {
var size = x.size();
if (size.length > 1) {
throw new Error('Only one dimensional matrices supported');
}
return quickSelect(x.valueOf(), k, compare);
}
if (Array.isArray(x)) {
return quickSelect(x, k, compare);
}
}
/**
* Quickselect algorithm.
* Code adapted from:
* https://blog.teamleadnet.com/2012/07/quick-select-algorithm-find-kth-element.html
*
* @param {Array} arr
* @param {Number} k
* @param {Function} compare
* @private
*/
function quickSelect(arr, k, compare) {
if (k >= arr.length) {
throw new Error('k out of bounds');
} // check for NaN values since these can cause an infinite while loop
for (var i = 0; i < arr.length; i++) {
if (isNumeric(arr[i]) && isNaN(arr[i])) {
return arr[i]; // return NaN
}
}
var from = 0;
var to = arr.length - 1; // if from == to we reached the kth element
while (from < to) {
var r = from;
var w = to;
var pivot = arr[Math.floor(Math.random() * (to - from + 1)) + from]; // stop if the reader and writer meets
while (r < w) {
// arr[r] >= pivot
if (compare(arr[r], pivot) >= 0) {
// put the large values at the end
var tmp = arr[w];
arr[w] = arr[r];
arr[r] = tmp;
--w;
} else {
// the value is smaller than the pivot, skip
++r;
}
} // if we stepped up (r++) we need to step one down (arr[r] > pivot)
if (compare(arr[r], pivot) > 0) {
--r;
} // the r pointer is on the end of the first k elements
if (k <= r) {
to = r;
} else {
from = r + 1;
}
}
return arr[k];
}
});
// CONCATENATED MODULE: ./src/function/matrix/sort.js
var sort_name = 'sort';
var sort_dependencies = ['typed', 'matrix', 'compare', 'compareNatural'];
var createSort = /* #__PURE__ */Object(factory["a" /* factory */])(sort_name, sort_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
compare = _ref.compare,
compareNatural = _ref.compareNatural;
var compareAsc = compare;
var compareDesc = function compareDesc(a, b) {
return -compare(a, b);
};
/**
* Sort the items in a matrix.
*
* Syntax:
*
* math.sort(x)
* math.sort(x, compare)
*
* Examples:
*
* math.sort([5, 10, 1]) // returns [1, 5, 10]
* math.sort(['C', 'B', 'A', 'D'], math.compareNatural)
* // returns ['A', 'B', 'C', 'D']
*
* function sortByLength (a, b) {
* return a.length - b.length
* }
* math.sort(['Langdon', 'Tom', 'Sara'], sortByLength)
* // returns ['Tom', 'Sara', 'Langdon']
*
* See also:
*
* filter, forEach, map, compare, compareNatural
*
* @param {Matrix | Array} x A one dimensional matrix or array to sort
* @param {Function | 'asc' | 'desc' | 'natural'} [compare='asc']
* An optional _comparator function or name. The function is called as
* `compare(a, b)`, and must return 1 when a > b, -1 when a < b,
* and 0 when a == b.
* @return {Matrix | Array} Returns the sorted matrix.
*/
return typed(sort_name, {
Array: function Array(x) {
_arrayIsVector(x);
return x.sort(compareAsc);
},
Matrix: function Matrix(x) {
_matrixIsVector(x);
return matrix(x.toArray().sort(compareAsc), x.storage());
},
'Array, function': function ArrayFunction(x, _comparator) {
_arrayIsVector(x);
return x.sort(_comparator);
},
'Matrix, function': function MatrixFunction(x, _comparator) {
_matrixIsVector(x);
return matrix(x.toArray().sort(_comparator), x.storage());
},
'Array, string': function ArrayString(x, order) {
_arrayIsVector(x);
return x.sort(_comparator(order));
},
'Matrix, string': function MatrixString(x, order) {
_matrixIsVector(x);
return matrix(x.toArray().sort(_comparator(order)), x.storage());
}
});
/**
* Get the comparator for given order ('asc', 'desc', 'natural')
* @param {'asc' | 'desc' | 'natural'} order
* @return {Function} Returns a _comparator function
*/
function _comparator(order) {
if (order === 'asc') {
return compareAsc;
} else if (order === 'desc') {
return compareDesc;
} else if (order === 'natural') {
return compareNatural;
} else {
throw new Error('String "asc", "desc", or "natural" expected');
}
}
/**
* Validate whether an array is one dimensional
* Throws an error when this is not the case
* @param {Array} array
* @private
*/
function _arrayIsVector(array) {
if (Object(utils_array["a" /* arraySize */])(array).length !== 1) {
throw new Error('One dimensional array expected');
}
}
/**
* Validate whether a matrix is one dimensional
* Throws an error when this is not the case
* @param {Matrix} matrix
* @private
*/
function _matrixIsVector(matrix) {
if (matrix.size().length !== 1) {
throw new Error('One dimensional matrix expected');
}
}
});
// CONCATENATED MODULE: ./src/function/statistics/max.js
var max_name = 'max';
var max_dependencies = ['typed', 'config', 'numeric', 'larger'];
var createMax = /* #__PURE__ */Object(factory["a" /* factory */])(max_name, max_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
numeric = _ref.numeric,
larger = _ref.larger;
/**
* Compute the maximum value of a matrix or a list with values.
* In case of a multi dimensional array, the maximum of the flattened array
* will be calculated. When `dim` is provided, the maximum over the selected
* dimension will be calculated. Parameter `dim` is zero-based.
*
* Syntax:
*
* math.max(a, b, c, ...)
* math.max(A)
* math.max(A, dim)
*
* Examples:
*
* math.max(2, 1, 4, 3) // returns 4
* math.max([2, 1, 4, 3]) // returns 4
*
* // maximum over a specified dimension (zero-based)
* math.max([[2, 5], [4, 3], [1, 7]], 0) // returns [4, 7]
* math.max([[2, 5], [4, 3]], [1, 7], 1) // returns [5, 4, 7]
*
* math.max(2.7, 7.1, -4.5, 2.0, 4.1) // returns 7.1
* math.min(2.7, 7.1, -4.5, 2.0, 4.1) // returns -4.5
*
* See also:
*
* mean, median, min, prod, std, sum, variance
*
* @param {... *} args A single matrix or or multiple scalar values
* @return {*} The maximum value
*/
return typed(max_name, {
// max([a, b, c, d, ...])
'Array | Matrix': _max,
// max([a, b, c, d, ...], dim)
'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {
return reduce(array, dim.valueOf(), _largest);
},
// max(a, b, c, d, ...)
'...': function _(args) {
if (containsCollections(args)) {
throw new TypeError('Scalar values expected in function max');
}
return _max(args);
}
});
/**
* Return the largest of two values
* @param {*} x
* @param {*} y
* @returns {*} Returns x when x is largest, or y when y is largest
* @private
*/
function _largest(x, y) {
try {
return larger(x, y) ? x : y;
} catch (err) {
throw improveErrorMessage(err, 'max', y);
}
}
/**
* Recursively calculate the maximum value in an n-dimensional array
* @param {Array} array
* @return {number} max
* @private
*/
function _max(array) {
var res;
deepForEach(array, function (value) {
try {
if (isNaN(value) && typeof value === 'number') {
res = NaN;
} else if (res === undefined || larger(value, res)) {
res = value;
}
} catch (err) {
throw improveErrorMessage(err, 'max', value);
}
});
if (res === undefined) {
throw new Error('Cannot calculate max of an empty array');
} // make sure returning numeric value: parse a string into a numeric value
if (typeof res === 'string') {
res = numeric(res, config.number);
}
return res;
}
});
// CONCATENATED MODULE: ./src/function/statistics/min.js
var min_name = 'min';
var min_dependencies = ['typed', 'config', 'numeric', 'smaller'];
var createMin = /* #__PURE__ */Object(factory["a" /* factory */])(min_name, min_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
numeric = _ref.numeric,
smaller = _ref.smaller;
/**
* Compute the minimum value of a matrix or a list of values.
* In case of a multi dimensional array, the minimum of the flattened array
* will be calculated. When `dim` is provided, the minimum over the selected
* dimension will be calculated. Parameter `dim` is zero-based.
*
* Syntax:
*
* math.min(a, b, c, ...)
* math.min(A)
* math.min(A, dim)
*
* Examples:
*
* math.min(2, 1, 4, 3) // returns 1
* math.min([2, 1, 4, 3]) // returns 1
*
* // minimum over a specified dimension (zero-based)
* math.min([[2, 5], [4, 3], [1, 7]], 0) // returns [1, 3]
* math.min([[2, 5], [4, 3], [1, 7]], 1) // returns [2, 3, 1]
*
* math.max(2.7, 7.1, -4.5, 2.0, 4.1) // returns 7.1
* math.min(2.7, 7.1, -4.5, 2.0, 4.1) // returns -4.5
*
* See also:
*
* mean, median, max, prod, std, sum, variance
*
* @param {... *} args A single matrix or or multiple scalar values
* @return {*} The minimum value
*/
return typed(min_name, {
// min([a, b, c, d, ...])
'Array | Matrix': _min,
// min([a, b, c, d, ...], dim)
'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {
return reduce(array, dim.valueOf(), _smallest);
},
// min(a, b, c, d, ...)
'...': function _(args) {
if (containsCollections(args)) {
throw new TypeError('Scalar values expected in function min');
}
return _min(args);
}
});
/**
* Return the smallest of two values
* @param {*} x
* @param {*} y
* @returns {*} Returns x when x is smallest, or y when y is smallest
* @private
*/
function _smallest(x, y) {
try {
return smaller(x, y) ? x : y;
} catch (err) {
throw improveErrorMessage(err, 'min', y);
}
}
/**
* Recursively calculate the minimum value in an n-dimensional array
* @param {Array} array
* @return {number} min
* @private
*/
function _min(array) {
var min;
deepForEach(array, function (value) {
try {
if (isNaN(value) && typeof value === 'number') {
min = NaN;
} else if (min === undefined || smaller(value, min)) {
min = value;
}
} catch (err) {
throw improveErrorMessage(err, 'min', value);
}
});
if (min === undefined) {
throw new Error('Cannot calculate min of an empty array');
} // make sure returning numeric value: parse a string into a numeric value
if (typeof min === 'string') {
min = numeric(min, config.number);
}
return min;
}
});
// CONCATENATED MODULE: ./src/type/matrix/ImmutableDenseMatrix.js
var ImmutableDenseMatrix_name = 'ImmutableDenseMatrix';
var ImmutableDenseMatrix_dependencies = ['smaller', 'DenseMatrix'];
var createImmutableDenseMatrixClass = /* #__PURE__ */Object(factory["a" /* factory */])(ImmutableDenseMatrix_name, ImmutableDenseMatrix_dependencies, function (_ref) {
var smaller = _ref.smaller,
DenseMatrix = _ref.DenseMatrix;
function ImmutableDenseMatrix(data, datatype) {
if (!(this instanceof ImmutableDenseMatrix)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
if (datatype && !Object(is["I" /* isString */])(datatype)) {
throw new Error('Invalid datatype: ' + datatype);
}
if (Object(is["v" /* isMatrix */])(data) || Object(is["b" /* isArray */])(data)) {
// use DenseMatrix implementation
var matrix = new DenseMatrix(data, datatype); // internal structures
this._data = matrix._data;
this._size = matrix._size;
this._datatype = matrix._datatype;
this._min = null;
this._max = null;
} else if (data && Object(is["b" /* isArray */])(data.data) && Object(is["b" /* isArray */])(data.size)) {
// initialize fields from JSON representation
this._data = data.data;
this._size = data.size;
this._datatype = data.datatype;
this._min = typeof data.min !== 'undefined' ? data.min : null;
this._max = typeof data.max !== 'undefined' ? data.max : null;
} else if (data) {
// unsupported type
throw new TypeError('Unsupported type of data (' + Object(is["M" /* typeOf */])(data) + ')');
} else {
// nothing provided
this._data = [];
this._size = [0];
this._datatype = datatype;
this._min = null;
this._max = null;
}
}
ImmutableDenseMatrix.prototype = new DenseMatrix();
/**
* Attach type information
*/
ImmutableDenseMatrix.prototype.type = 'ImmutableDenseMatrix';
ImmutableDenseMatrix.prototype.isImmutableDenseMatrix = true;
/**
* Get a subset of the matrix, or replace a subset of the matrix.
*
* Usage:
* const subset = matrix.subset(index) // retrieve subset
* const value = matrix.subset(index, replacement) // replace subset
*
* @param {Index} index
* @param {Array | ImmutableDenseMatrix | *} [replacement]
* @param {*} [defaultValue=0] Default value, filled in on new entries when
* the matrix is resized. If not provided,
* new matrix elements will be filled with zeros.
*/
ImmutableDenseMatrix.prototype.subset = function (index) {
switch (arguments.length) {
case 1:
{
// use base implementation
var m = DenseMatrix.prototype.subset.call(this, index); // check result is a matrix
if (Object(is["v" /* isMatrix */])(m)) {
// return immutable matrix
return new ImmutableDenseMatrix({
data: m._data,
size: m._size,
datatype: m._datatype
});
}
return m;
}
// intentional fall through
case 2:
case 3:
throw new Error('Cannot invoke set subset on an Immutable Matrix instance');
default:
throw new SyntaxError('Wrong number of arguments');
}
};
/**
* Replace a single element in the matrix.
* @param {Number[]} index Zero-based index
* @param {*} value
* @param {*} [defaultValue] Default value, filled in on new entries when
* the matrix is resized. If not provided,
* new matrix elements will be left undefined.
* @return {ImmutableDenseMatrix} self
*/
ImmutableDenseMatrix.prototype.set = function () {
throw new Error('Cannot invoke set on an Immutable Matrix instance');
};
/**
* Resize the matrix to the given size. Returns a copy of the matrix when
* `copy=true`, otherwise return the matrix itself (resize in place).
*
* @param {Number[]} size The new size the matrix should have.
* @param {*} [defaultValue=0] Default value, filled in on new entries.
* If not provided, the matrix elements will
* be filled with zeros.
* @param {boolean} [copy] Return a resized copy of the matrix
*
* @return {Matrix} The resized matrix
*/
ImmutableDenseMatrix.prototype.resize = function () {
throw new Error('Cannot invoke resize on an Immutable Matrix instance');
};
/**
* Disallows reshaping in favor of immutability.
*
* @throws {Error} Operation not allowed
*/
ImmutableDenseMatrix.prototype.reshape = function () {
throw new Error('Cannot invoke reshape on an Immutable Matrix instance');
};
/**
* Create a clone of the matrix
* @return {ImmutableDenseMatrix} clone
*/
ImmutableDenseMatrix.prototype.clone = function () {
return new ImmutableDenseMatrix({
data: Object(utils_object["a" /* clone */])(this._data),
size: Object(utils_object["a" /* clone */])(this._size),
datatype: this._datatype
});
};
/**
* Get a JSON representation of the matrix
* @returns {Object}
*/
ImmutableDenseMatrix.prototype.toJSON = function () {
return {
mathjs: 'ImmutableDenseMatrix',
data: this._data,
size: this._size,
datatype: this._datatype
};
};
/**
* Generate a matrix from a JSON object
* @param {Object} json An object structured like
* `{"mathjs": "ImmutableDenseMatrix", data: [], size: []}`,
* where mathjs is optional
* @returns {ImmutableDenseMatrix}
*/
ImmutableDenseMatrix.fromJSON = function (json) {
return new ImmutableDenseMatrix(json);
};
/**
* Swap rows i and j in Matrix.
*
* @param {Number} i Matrix row index 1
* @param {Number} j Matrix row index 2
*
* @return {Matrix} The matrix reference
*/
ImmutableDenseMatrix.prototype.swapRows = function () {
throw new Error('Cannot invoke swapRows on an Immutable Matrix instance');
};
/**
* Calculate the minimum value in the set
* @return {Number | undefined} min
*/
ImmutableDenseMatrix.prototype.min = function () {
// check min has been calculated before
if (this._min === null) {
// minimum
var m = null; // compute min
this.forEach(function (v) {
if (m === null || smaller(v, m)) {
m = v;
}
});
this._min = m !== null ? m : undefined;
}
return this._min;
};
/**
* Calculate the maximum value in the set
* @return {Number | undefined} max
*/
ImmutableDenseMatrix.prototype.max = function () {
// check max has been calculated before
if (this._max === null) {
// maximum
var m = null; // compute max
this.forEach(function (v) {
if (m === null || smaller(m, v)) {
m = v;
}
});
this._max = m !== null ? m : undefined;
}
return this._max;
};
return ImmutableDenseMatrix;
}, {
isClass: true
});
// CONCATENATED MODULE: ./src/type/matrix/MatrixIndex.js
var MatrixIndex_name = 'Index';
var MatrixIndex_dependencies = ['ImmutableDenseMatrix'];
var createIndexClass = /* #__PURE__ */Object(factory["a" /* factory */])(MatrixIndex_name, MatrixIndex_dependencies, function (_ref) {
var ImmutableDenseMatrix = _ref.ImmutableDenseMatrix;
/**
* Create an index. An Index can store ranges and sets for multiple dimensions.
* Matrix.get, Matrix.set, and math.subset accept an Index as input.
*
* Usage:
* const index = new Index(range1, range2, matrix1, array1, ...)
*
* Where each parameter can be any of:
* A number
* A string (containing a name of an object property)
* An instance of Range
* An Array with the Set values
* A Matrix with the Set values
*
* The parameters start, end, and step must be integer numbers.
*
* @class Index
* @Constructor Index
* @param {...*} ranges
*/
function Index(ranges) {
if (!(this instanceof Index)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
this._dimensions = [];
this._isScalar = true;
for (var i = 0, ii = arguments.length; i < ii; i++) {
var arg = arguments[i];
if (Object(is["D" /* isRange */])(arg)) {
this._dimensions.push(arg);
this._isScalar = false;
} else if (Array.isArray(arg) || Object(is["v" /* isMatrix */])(arg)) {
// create matrix
var m = _createImmutableMatrix(arg.valueOf());
this._dimensions.push(m); // size
var size = m.size(); // scalar
if (size.length !== 1 || size[0] !== 1) {
this._isScalar = false;
}
} else if (typeof arg === 'number') {
this._dimensions.push(_createImmutableMatrix([arg]));
} else if (typeof arg === 'string') {
// object property (arguments.count should be 1)
this._dimensions.push(arg);
} else {
throw new TypeError('Dimension must be an Array, Matrix, number, string, or Range');
} // TODO: implement support for wildcard '*'
}
}
/**
* Attach type information
*/
Index.prototype.type = 'Index';
Index.prototype.isIndex = true;
function _createImmutableMatrix(arg) {
// loop array elements
for (var i = 0, l = arg.length; i < l; i++) {
if (typeof arg[i] !== 'number' || !Object(utils_number["i" /* isInteger */])(arg[i])) {
throw new TypeError('Index parameters must be positive integer numbers');
}
} // create matrix
return new ImmutableDenseMatrix(arg);
}
/**
* Create a clone of the index
* @memberof Index
* @return {Index} clone
*/
Index.prototype.clone = function () {
var index = new Index();
index._dimensions = Object(utils_object["a" /* clone */])(this._dimensions);
index._isScalar = this._isScalar;
return index;
};
/**
* Create an index from an array with ranges/numbers
* @memberof Index
* @param {Array.<Array | number>} ranges
* @return {Index} index
* @private
*/
Index.create = function (ranges) {
var index = new Index();
Index.apply(index, ranges);
return index;
};
/**
* Retrieve the size of the index, the number of elements for each dimension.
* @memberof Index
* @returns {number[]} size
*/
Index.prototype.size = function () {
var size = [];
for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
var d = this._dimensions[i];
size[i] = typeof d === 'string' ? 1 : d.size()[0];
}
return size;
};
/**
* Get the maximum value for each of the indexes ranges.
* @memberof Index
* @returns {number[]} max
*/
Index.prototype.max = function () {
var values = [];
for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
var range = this._dimensions[i];
values[i] = typeof range === 'string' ? range : range.max();
}
return values;
};
/**
* Get the minimum value for each of the indexes ranges.
* @memberof Index
* @returns {number[]} min
*/
Index.prototype.min = function () {
var values = [];
for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
var range = this._dimensions[i];
values[i] = typeof range === 'string' ? range : range.min();
}
return values;
};
/**
* Loop over each of the ranges of the index
* @memberof Index
* @param {Function} callback Called for each range with a Range as first
* argument, the dimension as second, and the
* index object as third.
*/
Index.prototype.forEach = function (callback) {
for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
callback(this._dimensions[i], i, this);
}
};
/**
* Retrieve the dimension for the given index
* @memberof Index
* @param {Number} dim Number of the dimension
* @returns {Range | null} range
*/
Index.prototype.dimension = function (dim) {
return this._dimensions[dim] || null;
};
/**
* Test whether this index contains an object property
* @returns {boolean} Returns true if the index is an object property
*/
Index.prototype.isObjectProperty = function () {
return this._dimensions.length === 1 && typeof this._dimensions[0] === 'string';
};
/**
* Returns the object property name when the Index holds a single object property,
* else returns null
* @returns {string | null}
*/
Index.prototype.getObjectProperty = function () {
return this.isObjectProperty() ? this._dimensions[0] : null;
};
/**
* Test whether this index contains only a single value.
*
* This is the case when the index is created with only scalar values as ranges,
* not for ranges resolving into a single value.
* @memberof Index
* @return {boolean} isScalar
*/
Index.prototype.isScalar = function () {
return this._isScalar;
};
/**
* Expand the Index into an array.
* For example new Index([0,3], [2,7]) returns [[0,1,2], [2,3,4,5,6]]
* @memberof Index
* @returns {Array} array
*/
Index.prototype.toArray = function () {
var array = [];
for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
var dimension = this._dimensions[i];
array.push(typeof dimension === 'string' ? dimension : dimension.toArray());
}
return array;
};
/**
* Get the primitive value of the Index, a two dimensional array.
* Equivalent to Index.toArray().
* @memberof Index
* @returns {Array} array
*/
Index.prototype.valueOf = Index.prototype.toArray;
/**
* Get the string representation of the index, for example '[2:6]' or '[0:2:10, 4:7, [1,2,3]]'
* @memberof Index
* @returns {String} str
*/
Index.prototype.toString = function () {
var strings = [];
for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
var dimension = this._dimensions[i];
if (typeof dimension === 'string') {
strings.push(JSON.stringify(dimension));
} else {
strings.push(dimension.toString());
}
}
return '[' + strings.join(', ') + ']';
};
/**
* Get a JSON representation of the Index
* @memberof Index
* @returns {Object} Returns a JSON object structured as:
* `{"mathjs": "Index", "ranges": [{"mathjs": "Range", start: 0, end: 10, step:1}, ...]}`
*/
Index.prototype.toJSON = function () {
return {
mathjs: 'Index',
dimensions: this._dimensions
};
};
/**
* Instantiate an Index from a JSON object
* @memberof Index
* @param {Object} json A JSON object structured as:
* `{"mathjs": "Index", "dimensions": [{"mathjs": "Range", start: 0, end: 10, step:1}, ...]}`
* @return {Index}
*/
Index.fromJSON = function (json) {
return Index.create(json.dimensions);
};
return Index;
}, {
isClass: true
});
// CONCATENATED MODULE: ./src/type/matrix/FibonacciHeap.js
var FibonacciHeap_name = 'FibonacciHeap';
var FibonacciHeap_dependencies = ['smaller', 'larger'];
var createFibonacciHeapClass = /* #__PURE__ */Object(factory["a" /* factory */])(FibonacciHeap_name, FibonacciHeap_dependencies, function (_ref) {
var smaller = _ref.smaller,
larger = _ref.larger;
var oneOverLogPhi = 1.0 / Math.log((1.0 + Math.sqrt(5.0)) / 2.0);
/**
* Fibonacci Heap implementation, used interally for Matrix math.
* @class FibonacciHeap
* @constructor FibonacciHeap
*/
function FibonacciHeap() {
if (!(this instanceof FibonacciHeap)) {
throw new SyntaxError('Constructor must be called with the new operator');
} // initialize fields
this._minimum = null;
this._size = 0;
}
/**
* Attach type information
*/
FibonacciHeap.prototype.type = 'FibonacciHeap';
FibonacciHeap.prototype.isFibonacciHeap = true;
/**
* Inserts a new data element into the heap. No heap consolidation is
* performed at this time, the new node is simply inserted into the root
* list of this heap. Running time: O(1) actual.
* @memberof FibonacciHeap
*/
FibonacciHeap.prototype.insert = function (key, value) {
// create node
var node = {
key: key,
value: value,
degree: 0
}; // check we have a node in the minimum
if (this._minimum) {
// minimum node
var minimum = this._minimum; // update left & right of node
node.left = minimum;
node.right = minimum.right;
minimum.right = node;
node.right.left = node; // update minimum node in heap if needed
if (smaller(key, minimum.key)) {
// node has a smaller key, use it as minimum
this._minimum = node;
}
} else {
// set left & right
node.left = node;
node.right = node; // this is the first node
this._minimum = node;
} // increment number of nodes in heap
this._size++; // return node
return node;
};
/**
* Returns the number of nodes in heap. Running time: O(1) actual.
* @memberof FibonacciHeap
*/
FibonacciHeap.prototype.size = function () {
return this._size;
};
/**
* Removes all elements from this heap.
* @memberof FibonacciHeap
*/
FibonacciHeap.prototype.clear = function () {
this._minimum = null;
this._size = 0;
};
/**
* Returns true if the heap is empty, otherwise false.
* @memberof FibonacciHeap
*/
FibonacciHeap.prototype.isEmpty = function () {
return this._size === 0;
};
/**
* Extracts the node with minimum key from heap. Amortized running
* time: O(log n).
* @memberof FibonacciHeap
*/
FibonacciHeap.prototype.extractMinimum = function () {
// node to remove
var node = this._minimum; // check we have a minimum
if (node === null) {
return node;
} // current minimum
var minimum = this._minimum; // get number of children
var numberOfChildren = node.degree; // pointer to the first child
var x = node.child; // for each child of node do...
while (numberOfChildren > 0) {
// store node in right side
var tempRight = x.right; // remove x from child list
x.left.right = x.right;
x.right.left = x.left; // add x to root list of heap
x.left = minimum;
x.right = minimum.right;
minimum.right = x;
x.right.left = x; // set Parent[x] to null
x.parent = null;
x = tempRight;
numberOfChildren--;
} // remove node from root list of heap
node.left.right = node.right;
node.right.left = node.left; // update minimum
if (node === node.right) {
// empty
minimum = null;
} else {
// update minimum
minimum = node.right; // we need to update the pointer to the root with minimum key
minimum = _findMinimumNode(minimum, this._size);
} // decrement size of heap
this._size--; // update minimum
this._minimum = minimum; // return node
return node;
};
/**
* Removes a node from the heap given the reference to the node. The trees
* in the heap will be consolidated, if necessary. This operation may fail
* to remove the correct element if there are nodes with key value -Infinity.
* Running time: O(log n) amortized.
* @memberof FibonacciHeap
*/
FibonacciHeap.prototype.remove = function (node) {
// decrease key value
this._minimum = _decreaseKey(this._minimum, node, -1); // remove the smallest
this.extractMinimum();
};
/**
* Decreases the key value for a heap node, given the new value to take on.
* The structure of the heap may be changed and will not be consolidated.
* Running time: O(1) amortized.
* @memberof FibonacciHeap
*/
function _decreaseKey(minimum, node, key) {
// set node key
node.key = key; // get parent node
var parent = node.parent;
if (parent && smaller(node.key, parent.key)) {
// remove node from parent
_cut(minimum, node, parent); // remove all nodes from parent to the root parent
_cascadingCut(minimum, parent);
} // update minimum node if needed
if (smaller(node.key, minimum.key)) {
minimum = node;
} // return minimum
return minimum;
}
/**
* The reverse of the link operation: removes node from the child list of parent.
* This method assumes that min is non-null. Running time: O(1).
* @memberof FibonacciHeap
*/
function _cut(minimum, node, parent) {
// remove node from parent children and decrement Degree[parent]
node.left.right = node.right;
node.right.left = node.left;
parent.degree--; // reset y.child if necessary
if (parent.child === node) {
parent.child = node.right;
} // remove child if degree is 0
if (parent.degree === 0) {
parent.child = null;
} // add node to root list of heap
node.left = minimum;
node.right = minimum.right;
minimum.right = node;
node.right.left = node; // set parent[node] to null
node.parent = null; // set mark[node] to false
node.mark = false;
}
/**
* Performs a cascading cut operation. This cuts node from its parent and then
* does the same for its parent, and so on up the tree.
* Running time: O(log n); O(1) excluding the recursion.
* @memberof FibonacciHeap
*/
function _cascadingCut(minimum, node) {
// store parent node
var parent = node.parent; // if there's a parent...
if (!parent) {
return;
} // if node is unmarked, set it marked
if (!node.mark) {
node.mark = true;
} else {
// it's marked, cut it from parent
_cut(minimum, node, parent); // cut its parent as well
_cascadingCut(parent);
}
}
/**
* Make the first node a child of the second one. Running time: O(1) actual.
* @memberof FibonacciHeap
*/
var _linkNodes = function _linkNodes(node, parent) {
// remove node from root list of heap
node.left.right = node.right;
node.right.left = node.left; // make node a Child of parent
node.parent = parent;
if (!parent.child) {
parent.child = node;
node.right = node;
node.left = node;
} else {
node.left = parent.child;
node.right = parent.child.right;
parent.child.right = node;
node.right.left = node;
} // increase degree[parent]
parent.degree++; // set mark[node] false
node.mark = false;
};
function _findMinimumNode(minimum, size) {
// to find trees of the same degree efficiently we use an array of length O(log n) in which we keep a pointer to one root of each degree
var arraySize = Math.floor(Math.log(size) * oneOverLogPhi) + 1; // create list with initial capacity
var array = new Array(arraySize); // find the number of root nodes.
var numRoots = 0;
var x = minimum;
if (x) {
numRoots++;
x = x.right;
while (x !== minimum) {
numRoots++;
x = x.right;
}
} // vars
var y; // For each node in root list do...
while (numRoots > 0) {
// access this node's degree..
var d = x.degree; // get next node
var next = x.right; // check if there is a node already in array with the same degree
while (true) {
// get node with the same degree is any
y = array[d];
if (!y) {
break;
} // make one node with the same degree a child of the other, do this based on the key value.
if (larger(x.key, y.key)) {
var temp = y;
y = x;
x = temp;
} // make y a child of x
_linkNodes(y, x); // we have handled this degree, go to next one.
array[d] = null;
d++;
} // save this node for later when we might encounter another of the same degree.
array[d] = x; // move forward through list.
x = next;
numRoots--;
} // Set min to null (effectively losing the root list) and reconstruct the root list from the array entries in array[].
minimum = null; // loop nodes in array
for (var i = 0; i < arraySize; i++) {
// get current node
y = array[i];
if (!y) {
continue;
} // check if we have a linked list
if (minimum) {
// First remove node from root list.
y.left.right = y.right;
y.right.left = y.left; // now add to root list, again.
y.left = minimum;
y.right = minimum.right;
minimum.right = y;
y.right.left = y; // check if this is a new min.
if (smaller(y.key, minimum.key)) {
minimum = y;
}
} else {
minimum = y;
}
}
return minimum;
}
return FibonacciHeap;
}, {
isClass: true
});
// CONCATENATED MODULE: ./src/type/matrix/Spa.js
var Spa_name = 'Spa';
var Spa_dependencies = ['addScalar', 'equalScalar', 'FibonacciHeap'];
var createSpaClass = /* #__PURE__ */Object(factory["a" /* factory */])(Spa_name, Spa_dependencies, function (_ref) {
var addScalar = _ref.addScalar,
equalScalar = _ref.equalScalar,
FibonacciHeap = _ref.FibonacciHeap;
/**
* An ordered Sparse Accumulator is a representation for a sparse vector that includes a dense array
* of the vector elements and an ordered list of non-zero elements.
*/
function Spa() {
if (!(this instanceof Spa)) {
throw new SyntaxError('Constructor must be called with the new operator');
} // allocate vector, TODO use typed arrays
this._values = [];
this._heap = new FibonacciHeap();
}
/**
* Attach type information
*/
Spa.prototype.type = 'Spa';
Spa.prototype.isSpa = true;
/**
* Set the value for index i.
*
* @param {number} i The index
* @param {number | BigNumber | Complex} The value at index i
*/
Spa.prototype.set = function (i, v) {
// check we have a value @ i
if (!this._values[i]) {
// insert in heap
var node = this._heap.insert(i, v); // set the value @ i
this._values[i] = node;
} else {
// update the value @ i
this._values[i].value = v;
}
};
Spa.prototype.get = function (i) {
var node = this._values[i];
if (node) {
return node.value;
}
return 0;
};
Spa.prototype.accumulate = function (i, v) {
// node @ i
var node = this._values[i];
if (!node) {
// insert in heap
node = this._heap.insert(i, v); // initialize value
this._values[i] = node;
} else {
// accumulate value
node.value = addScalar(node.value, v);
}
};
Spa.prototype.forEach = function (from, to, callback) {
// references
var heap = this._heap;
var values = this._values; // nodes
var nodes = []; // node with minimum key, save it
var node = heap.extractMinimum();
if (node) {
nodes.push(node);
} // extract nodes from heap (ordered)
while (node && node.key <= to) {
// check it is in range
if (node.key >= from) {
// check value is not zero
if (!equalScalar(node.value, 0)) {
// invoke callback
callback(node.key, node.value, this);
}
} // extract next node, save it
node = heap.extractMinimum();
if (node) {
nodes.push(node);
}
} // reinsert all nodes in heap
for (var i = 0; i < nodes.length; i++) {
// current node
var n = nodes[i]; // insert node in heap
node = heap.insert(n.key, n.value); // update values
values[node.key] = node;
}
};
Spa.prototype.swap = function (i, j) {
// node @ i and j
var nodei = this._values[i];
var nodej = this._values[j]; // check we need to insert indeces
if (!nodei && nodej) {
// insert in heap
nodei = this._heap.insert(i, nodej.value); // remove from heap
this._heap.remove(nodej); // set values
this._values[i] = nodei;
this._values[j] = undefined;
} else if (nodei && !nodej) {
// insert in heap
nodej = this._heap.insert(j, nodei.value); // remove from heap
this._heap.remove(nodei); // set values
this._values[j] = nodej;
this._values[i] = undefined;
} else if (nodei && nodej) {
// swap values
var v = nodei.value;
nodei.value = nodej.value;
nodej.value = v;
}
};
return Spa;
}, {
isClass: true
});
// CONCATENATED MODULE: ./src/utils/bignumber/constants.js
/**
* Calculate BigNumber e
* @param {function} BigNumber BigNumber constructor
* @returns {BigNumber} Returns e
*/
var createBigNumberE = memoize(function (BigNumber) {
return new BigNumber(1).exp();
}, hasher);
/**
* Calculate BigNumber golden ratio, phi = (1+sqrt(5))/2
* @param {function} BigNumber BigNumber constructor
* @returns {BigNumber} Returns phi
*/
var createBigNumberPhi = memoize(function (BigNumber) {
return new BigNumber(1).plus(new BigNumber(5).sqrt()).div(2);
}, hasher);
/**
* Calculate BigNumber pi.
* @param {function} BigNumber BigNumber constructor
* @returns {BigNumber} Returns pi
*/
var createBigNumberPi = memoize(function (BigNumber) {
return BigNumber.acos(-1);
}, hasher);
/**
* Calculate BigNumber tau, tau = 2 * pi
* @param {function} BigNumber BigNumber constructor
* @returns {BigNumber} Returns tau
*/
var createBigNumberTau = memoize(function (BigNumber) {
return createBigNumberPi(BigNumber).times(2);
}, hasher);
/**
* Create a hash for a BigNumber constructor function. The created has is
* the configured precision
* @param {Array} args Supposed to contain a single entry with
* a BigNumber constructor
* @return {number} precision
* @private
*/
function hasher(args) {
return args[0].precision;
}
// CONCATENATED MODULE: ./src/type/unit/Unit.js
function Unit_typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { Unit_typeof = function _typeof(obj) { return typeof obj; }; } else { Unit_typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return Unit_typeof(obj); }
function _extends() { _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }
function Unit_ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; }
function Unit_objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { Unit_ownKeys(Object(source), true).forEach(function (key) { Unit_defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { Unit_ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }
function Unit_defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
var Unit_name = 'Unit';
var Unit_dependencies = ['?on', 'config', 'addScalar', 'subtract', 'multiplyScalar', 'divideScalar', 'pow', 'abs', 'fix', 'round', 'equal', 'isNumeric', 'format', 'number', 'Complex', 'BigNumber', 'Fraction'];
var createUnitClass = /* #__PURE__ */Object(factory["a" /* factory */])(Unit_name, Unit_dependencies, function (_ref) {
var on = _ref.on,
config = _ref.config,
addScalar = _ref.addScalar,
subtract = _ref.subtract,
multiplyScalar = _ref.multiplyScalar,
divideScalar = _ref.divideScalar,
pow = _ref.pow,
abs = _ref.abs,
fix = _ref.fix,
round = _ref.round,
equal = _ref.equal,
isNumeric = _ref.isNumeric,
format = _ref.format,
number = _ref.number,
Complex = _ref.Complex,
_BigNumber = _ref.BigNumber,
_Fraction = _ref.Fraction;
var toNumber = number;
/**
* A unit can be constructed in the following ways:
*
* const a = new Unit(value, name)
* const b = new Unit(null, name)
* const c = Unit.parse(str)
*
* Example usage:
*
* const a = new Unit(5, 'cm') // 50 mm
* const b = Unit.parse('23 kg') // 23 kg
* const c = math.in(a, new Unit(null, 'm') // 0.05 m
* const d = new Unit(9.81, "m/s^2") // 9.81 m/s^2
*
* @class Unit
* @constructor Unit
* @param {number | BigNumber | Fraction | Complex | boolean} [value] A value like 5.2
* @param {string} [name] A unit name like "cm" or "inch", or a derived unit of the form: "u1[^ex1] [u2[^ex2] ...] [/ u3[^ex3] [u4[^ex4]]]", such as "kg m^2/s^2", where each unit appearing after the forward slash is taken to be in the denominator. "kg m^2 s^-2" is a synonym and is also acceptable. Any of the units can include a prefix.
*/
function Unit(value, name) {
if (!(this instanceof Unit)) {
throw new Error('Constructor must be called with the new operator');
}
if (!(value === null || value === undefined || isNumeric(value) || Object(is["j" /* isComplex */])(value))) {
throw new TypeError('First parameter in Unit constructor must be number, BigNumber, Fraction, Complex, or undefined');
}
if (name !== undefined && (typeof name !== 'string' || name === '')) {
throw new TypeError('Second parameter in Unit constructor must be a string');
}
if (name !== undefined) {
var u = Unit.parse(name);
this.units = u.units;
this.dimensions = u.dimensions;
} else {
this.units = [{
unit: UNIT_NONE,
prefix: PREFIXES.NONE,
// link to a list with supported prefixes
power: 0
}];
this.dimensions = [];
for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
this.dimensions[i] = 0;
}
}
this.value = value !== undefined && value !== null ? this._normalize(value) : null;
this.fixPrefix = false; // if true, function format will not search for the
// best prefix but leave it as initially provided.
// fixPrefix is set true by the method Unit.to
// The justification behind this is that if the constructor is explicitly called,
// the caller wishes the units to be returned exactly as he supplied.
this.skipAutomaticSimplification = true;
}
/**
* Attach type information
*/
Unit.prototype.type = 'Unit';
Unit.prototype.isUnit = true; // private variables and functions for the Unit parser
var text, index, c;
function skipWhitespace() {
while (c === ' ' || c === '\t') {
next();
}
}
function isDigitDot(c) {
return c >= '0' && c <= '9' || c === '.';
}
function isDigit(c) {
return c >= '0' && c <= '9';
}
function next() {
index++;
c = text.charAt(index);
}
function revert(oldIndex) {
index = oldIndex;
c = text.charAt(index);
}
function parseNumber() {
var number = '';
var oldIndex = index;
if (c === '+') {
next();
} else if (c === '-') {
number += c;
next();
}
if (!isDigitDot(c)) {
// a + or - must be followed by a digit
revert(oldIndex);
return null;
} // get number, can have a single dot
if (c === '.') {
number += c;
next();
if (!isDigit(c)) {
// this is no legal number, it is just a dot
revert(oldIndex);
return null;
}
} else {
while (isDigit(c)) {
number += c;
next();
}
if (c === '.') {
number += c;
next();
}
}
while (isDigit(c)) {
number += c;
next();
} // check for exponential notation like "2.3e-4" or "1.23e50"
if (c === 'E' || c === 'e') {
// The grammar branches here. This could either be part of an exponent or the start of a unit that begins with the letter e, such as "4exabytes"
var tentativeNumber = '';
var tentativeIndex = index;
tentativeNumber += c;
next();
if (c === '+' || c === '-') {
tentativeNumber += c;
next();
} // Scientific notation MUST be followed by an exponent (otherwise we assume it is not scientific notation)
if (!isDigit(c)) {
// The e or E must belong to something else, so return the number without the e or E.
revert(tentativeIndex);
return number;
} // We can now safely say that this is scientific notation.
number = number + tentativeNumber;
while (isDigit(c)) {
number += c;
next();
}
}
return number;
}
function parseUnit() {
var unitName = ''; // Alphanumeric characters only; matches [a-zA-Z0-9]
var code = text.charCodeAt(index);
while (code >= 48 && code <= 57 || code >= 65 && code <= 90 || code >= 97 && code <= 122) {
unitName += c;
next();
code = text.charCodeAt(index);
} // Must begin with [a-zA-Z]
code = unitName.charCodeAt(0);
if (code >= 65 && code <= 90 || code >= 97 && code <= 122) {
return unitName || null;
} else {
return null;
}
}
function parseCharacter(toFind) {
if (c === toFind) {
next();
return toFind;
} else {
return null;
}
}
/**
* Parse a string into a unit. The value of the unit is parsed as number,
* BigNumber, or Fraction depending on the math.js config setting `number`.
*
* Throws an exception if the provided string does not contain a valid unit or
* cannot be parsed.
* @memberof Unit
* @param {string} str A string like "5.2 inch", "4e2 cm/s^2"
* @return {Unit} unit
*/
Unit.parse = function (str, options) {
options = options || {};
text = str;
index = -1;
c = '';
if (typeof text !== 'string') {
throw new TypeError('Invalid argument in Unit.parse, string expected');
}
var unit = new Unit();
unit.units = [];
var powerMultiplierCurrent = 1;
var expectingUnit = false; // A unit should follow this pattern:
// [number] ...[ [*/] unit[^number] ]
// unit[^number] ... [ [*/] unit[^number] ]
// Rules:
// number is any floating point number.
// unit is any alphanumeric string beginning with an alpha. Units with names like e3 should be avoided because they look like the exponent of a floating point number!
// The string may optionally begin with a number.
// Each unit may optionally be followed by ^number.
// Whitespace or a forward slash is recommended between consecutive units, although the following technically is parseable:
// 2m^2kg/s^2
// it is not good form. If a unit starts with e, then it could be confused as a floating point number:
// 4erg
next();
skipWhitespace(); // Optional number at the start of the string
var valueStr = parseNumber();
var value = null;
if (valueStr) {
if (config.number === 'BigNumber') {
value = new _BigNumber(valueStr);
} else if (config.number === 'Fraction') {
try {
// not all numbers can be turned in Fractions, for example very small numbers not
value = new _Fraction(valueStr);
} catch (err) {
value = parseFloat(valueStr);
}
} else {
// number
value = parseFloat(valueStr);
}
skipWhitespace(); // Whitespace is not required here
// handle multiplication or division right after the value, like '1/s'
if (parseCharacter('*')) {
powerMultiplierCurrent = 1;
expectingUnit = true;
} else if (parseCharacter('/')) {
powerMultiplierCurrent = -1;
expectingUnit = true;
}
} // Stack to keep track of powerMultipliers applied to each parentheses group
var powerMultiplierStack = []; // Running product of all elements in powerMultiplierStack
var powerMultiplierStackProduct = 1;
while (true) {
skipWhitespace(); // Check for and consume opening parentheses, pushing powerMultiplierCurrent to the stack
// A '(' will always appear directly before a unit.
while (c === '(') {
powerMultiplierStack.push(powerMultiplierCurrent);
powerMultiplierStackProduct *= powerMultiplierCurrent;
powerMultiplierCurrent = 1;
next();
skipWhitespace();
} // Is there something here?
var uStr = void 0;
if (c) {
var oldC = c;
uStr = parseUnit();
if (uStr === null) {
throw new SyntaxError('Unexpected "' + oldC + '" in "' + text + '" at index ' + index.toString());
}
} else {
// End of input.
break;
} // Verify the unit exists and get the prefix (if any)
var res = _findUnit(uStr);
if (res === null) {
// Unit not found.
throw new SyntaxError('Unit "' + uStr + '" not found.');
}
var power = powerMultiplierCurrent * powerMultiplierStackProduct; // Is there a "^ number"?
skipWhitespace();
if (parseCharacter('^')) {
skipWhitespace();
var p = parseNumber();
if (p === null) {
// No valid number found for the power!
throw new SyntaxError('In "' + str + '", "^" must be followed by a floating-point number');
}
power *= p;
} // Add the unit to the list
unit.units.push({
unit: res.unit,
prefix: res.prefix,
power: power
});
for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
unit.dimensions[i] += (res.unit.dimensions[i] || 0) * power;
} // Check for and consume closing parentheses, popping from the stack.
// A ')' will always follow a unit.
skipWhitespace();
while (c === ')') {
if (powerMultiplierStack.length === 0) {
throw new SyntaxError('Unmatched ")" in "' + text + '" at index ' + index.toString());
}
powerMultiplierStackProduct /= powerMultiplierStack.pop();
next();
skipWhitespace();
} // "*" and "/" should mean we are expecting something to come next.
// Is there a forward slash? If so, negate powerMultiplierCurrent. The next unit or paren group is in the denominator.
expectingUnit = false;
if (parseCharacter('*')) {
// explicit multiplication
powerMultiplierCurrent = 1;
expectingUnit = true;
} else if (parseCharacter('/')) {
// division
powerMultiplierCurrent = -1;
expectingUnit = true;
} else {
// implicit multiplication
powerMultiplierCurrent = 1;
} // Replace the unit into the auto unit system
if (res.unit.base) {
var baseDim = res.unit.base.key;
UNIT_SYSTEMS.auto[baseDim] = {
unit: res.unit,
prefix: res.prefix
};
}
} // Has the string been entirely consumed?
skipWhitespace();
if (c) {
throw new SyntaxError('Could not parse: "' + str + '"');
} // Is there a trailing slash?
if (expectingUnit) {
throw new SyntaxError('Trailing characters: "' + str + '"');
} // Is the parentheses stack empty?
if (powerMultiplierStack.length !== 0) {
throw new SyntaxError('Unmatched "(" in "' + text + '"');
} // Are there any units at all?
if (unit.units.length === 0 && !options.allowNoUnits) {
throw new SyntaxError('"' + str + '" contains no units');
}
unit.value = value !== undefined ? unit._normalize(value) : null;
return unit;
};
/**
* create a copy of this unit
* @memberof Unit
* @return {Unit} Returns a cloned version of the unit
*/
Unit.prototype.clone = function () {
var unit = new Unit();
unit.fixPrefix = this.fixPrefix;
unit.skipAutomaticSimplification = this.skipAutomaticSimplification;
unit.value = Object(utils_object["a" /* clone */])(this.value);
unit.dimensions = this.dimensions.slice(0);
unit.units = [];
for (var i = 0; i < this.units.length; i++) {
unit.units[i] = {};
for (var p in this.units[i]) {
if (Object(utils_object["f" /* hasOwnProperty */])(this.units[i], p)) {
unit.units[i][p] = this.units[i][p];
}
}
}
return unit;
};
/**
* Return whether the unit is derived (such as m/s, or cm^2, but not N)
* @memberof Unit
* @return {boolean} True if the unit is derived
*/
Unit.prototype._isDerived = function () {
if (this.units.length === 0) {
return false;
}
return this.units.length > 1 || Math.abs(this.units[0].power - 1.0) > 1e-15;
};
/**
* Normalize a value, based on its currently set unit(s)
* @memberof Unit
* @param {number | BigNumber | Fraction | boolean} value
* @return {number | BigNumber | Fraction | boolean} normalized value
* @private
*/
Unit.prototype._normalize = function (value) {
var unitValue, unitOffset, unitPower, unitPrefixValue;
var convert;
if (value === null || value === undefined || this.units.length === 0) {
return value;
} else if (this._isDerived()) {
// This is a derived unit, so do not apply offsets.
// For example, with J kg^-1 degC^-1 you would NOT want to apply the offset.
var res = value;
convert = Unit._getNumberConverter(Object(is["M" /* typeOf */])(value)); // convert to Fraction or BigNumber if needed
for (var i = 0; i < this.units.length; i++) {
unitValue = convert(this.units[i].unit.value);
unitPrefixValue = convert(this.units[i].prefix.value);
unitPower = convert(this.units[i].power);
res = multiplyScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower));
}
return res;
} else {
// This is a single unit of power 1, like kg or degC
convert = Unit._getNumberConverter(Object(is["M" /* typeOf */])(value)); // convert to Fraction or BigNumber if needed
unitValue = convert(this.units[0].unit.value);
unitOffset = convert(this.units[0].unit.offset);
unitPrefixValue = convert(this.units[0].prefix.value);
return multiplyScalar(addScalar(value, unitOffset), multiplyScalar(unitValue, unitPrefixValue));
}
};
/**
* Denormalize a value, based on its currently set unit(s)
* @memberof Unit
* @param {number} value
* @param {number} [prefixValue] Optional prefix value to be used (ignored if this is a derived unit)
* @return {number} denormalized value
* @private
*/
Unit.prototype._denormalize = function (value, prefixValue) {
var unitValue, unitOffset, unitPower, unitPrefixValue;
var convert;
if (value === null || value === undefined || this.units.length === 0) {
return value;
} else if (this._isDerived()) {
// This is a derived unit, so do not apply offsets.
// For example, with J kg^-1 degC^-1 you would NOT want to apply the offset.
// Also, prefixValue is ignored--but we will still use the prefix value stored in each unit, since kg is usually preferable to g unless the user decides otherwise.
var res = value;
convert = Unit._getNumberConverter(Object(is["M" /* typeOf */])(value)); // convert to Fraction or BigNumber if needed
for (var i = 0; i < this.units.length; i++) {
unitValue = convert(this.units[i].unit.value);
unitPrefixValue = convert(this.units[i].prefix.value);
unitPower = convert(this.units[i].power);
res = divideScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower));
}
return res;
} else {
// This is a single unit of power 1, like kg or degC
convert = Unit._getNumberConverter(Object(is["M" /* typeOf */])(value)); // convert to Fraction or BigNumber if needed
unitValue = convert(this.units[0].unit.value);
unitPrefixValue = convert(this.units[0].prefix.value);
unitOffset = convert(this.units[0].unit.offset);
if (prefixValue === undefined || prefixValue === null) {
return subtract(divideScalar(divideScalar(value, unitValue), unitPrefixValue), unitOffset);
} else {
return subtract(divideScalar(divideScalar(value, unitValue), prefixValue), unitOffset);
}
}
};
/**
* Find a unit from a string
* @memberof Unit
* @param {string} str A string like 'cm' or 'inch'
* @returns {Object | null} result When found, an object with fields unit and
* prefix is returned. Else, null is returned.
* @private
*/
function _findUnit(str) {
// First, match units names exactly. For example, a user could define 'mm' as 10^-4 m, which is silly, but then we would want 'mm' to match the user-defined unit.
if (Object(utils_object["f" /* hasOwnProperty */])(UNITS, str)) {
var unit = UNITS[str];
var prefix = unit.prefixes[''];
return {
unit: unit,
prefix: prefix
};
}
for (var _name in UNITS) {
if (Object(utils_object["f" /* hasOwnProperty */])(UNITS, _name)) {
if (Object(utils_string["b" /* endsWith */])(str, _name)) {
var _unit = UNITS[_name];
var prefixLen = str.length - _name.length;
var prefixName = str.substring(0, prefixLen);
var _prefix = Object(utils_object["f" /* hasOwnProperty */])(_unit.prefixes, prefixName) ? _unit.prefixes[prefixName] : undefined;
if (_prefix !== undefined) {
// store unit, prefix, and value
return {
unit: _unit,
prefix: _prefix
};
}
}
}
}
return null;
}
/**
* Test if the given expression is a unit.
* The unit can have a prefix but cannot have a value.
* @memberof Unit
* @param {string} name A string to be tested whether it is a value less unit.
* The unit can have prefix, like "cm"
* @return {boolean} true if the given string is a unit
*/
Unit.isValuelessUnit = function (name) {
return _findUnit(name) !== null;
};
/**
* check if this unit has given base unit
* If this unit is a derived unit, this will ALWAYS return false, since by definition base units are not derived.
* @memberof Unit
* @param {BASE_UNITS | string | undefined} base
*/
Unit.prototype.hasBase = function (base) {
if (typeof base === 'string') {
base = BASE_UNITS[base];
}
if (!base) {
return false;
} // All dimensions must be the same
for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
if (Math.abs((this.dimensions[i] || 0) - (base.dimensions[i] || 0)) > 1e-12) {
return false;
}
}
return true;
};
/**
* Check if this unit has a base or bases equal to another base or bases
* For derived units, the exponent on each base also must match
* @memberof Unit
* @param {Unit} other
* @return {boolean} true if equal base
*/
Unit.prototype.equalBase = function (other) {
// All dimensions must be the same
for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
if (Math.abs((this.dimensions[i] || 0) - (other.dimensions[i] || 0)) > 1e-12) {
return false;
}
}
return true;
};
/**
* Check if this unit equals another unit
* @memberof Unit
* @param {Unit} other
* @return {boolean} true if both units are equal
*/
Unit.prototype.equals = function (other) {
return this.equalBase(other) && equal(this.value, other.value);
};
/**
* Multiply this unit with another one
* @memberof Unit
* @param {Unit} other
* @return {Unit} product of this unit and the other unit
*/
Unit.prototype.multiply = function (other) {
var res = this.clone();
for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
// Dimensions arrays may be of different lengths. Default to 0.
res.dimensions[i] = (this.dimensions[i] || 0) + (other.dimensions[i] || 0);
} // Append other's units list onto res
for (var _i = 0; _i < other.units.length; _i++) {
// Make a shallow copy of every unit
var inverted = Unit_objectSpread({}, other.units[_i]);
res.units.push(inverted);
} // If at least one operand has a value, then the result should also have a value
if (this.value !== null || other.value !== null) {
var valThis = this.value === null ? this._normalize(1) : this.value;
var valOther = other.value === null ? other._normalize(1) : other.value;
res.value = multiplyScalar(valThis, valOther);
} else {
res.value = null;
}
res.skipAutomaticSimplification = false;
return getNumericIfUnitless(res);
};
/**
* Divide this unit by another one
* @memberof Unit
* @param {Unit} other
* @return {Unit} result of dividing this unit by the other unit
*/
Unit.prototype.divide = function (other) {
var res = this.clone();
for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
// Dimensions arrays may be of different lengths. Default to 0.
res.dimensions[i] = (this.dimensions[i] || 0) - (other.dimensions[i] || 0);
} // Invert and append other's units list onto res
for (var _i2 = 0; _i2 < other.units.length; _i2++) {
// Make a shallow copy of every unit
var inverted = Unit_objectSpread(Unit_objectSpread({}, other.units[_i2]), {}, {
power: -other.units[_i2].power
});
res.units.push(inverted);
} // If at least one operand has a value, the result should have a value
if (this.value !== null || other.value !== null) {
var valThis = this.value === null ? this._normalize(1) : this.value;
var valOther = other.value === null ? other._normalize(1) : other.value;
res.value = divideScalar(valThis, valOther);
} else {
res.value = null;
}
res.skipAutomaticSimplification = false;
return getNumericIfUnitless(res);
};
/**
* Calculate the power of a unit
* @memberof Unit
* @param {number | Fraction | BigNumber} p
* @returns {Unit} The result: this^p
*/
Unit.prototype.pow = function (p) {
var res = this.clone();
for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
// Dimensions arrays may be of different lengths. Default to 0.
res.dimensions[i] = (this.dimensions[i] || 0) * p;
} // Adjust the power of each unit in the list
for (var _i3 = 0; _i3 < res.units.length; _i3++) {
res.units[_i3].power *= p;
}
if (res.value !== null) {
res.value = pow(res.value, p); // only allow numeric output, we don't want to return a Complex number
// if (!isNumeric(res.value)) {
// res.value = NaN
// }
// Update: Complex supported now
} else {
res.value = null;
}
res.skipAutomaticSimplification = false;
return getNumericIfUnitless(res);
};
/**
* Return the numeric value of this unit if it is dimensionless, has a value, and config.predictable == false; or the original unit otherwise
* @param {Unit} unit
* @returns {number | Fraction | BigNumber | Unit} The numeric value of the unit if conditions are met, or the original unit otherwise
*/
function getNumericIfUnitless(unit) {
if (unit.equalBase(BASE_UNITS.NONE) && unit.value !== null && !config.predictable) {
return unit.value;
} else {
return unit;
}
}
/**
* Calculate the absolute value of a unit
* @memberof Unit
* @param {number | Fraction | BigNumber} x
* @returns {Unit} The result: |x|, absolute value of x
*/
Unit.prototype.abs = function () {
// This gives correct, but unexpected, results for units with an offset.
// For example, abs(-283.15 degC) = -263.15 degC !!!
var ret = this.clone();
ret.value = ret.value !== null ? abs(ret.value) : null;
for (var i in ret.units) {
if (ret.units[i].unit.name === 'VA' || ret.units[i].unit.name === 'VAR') {
ret.units[i].unit = UNITS.W;
}
}
return ret;
};
/**
* Convert the unit to a specific unit name.
* @memberof Unit
* @param {string | Unit} valuelessUnit A unit without value. Can have prefix, like "cm"
* @returns {Unit} Returns a clone of the unit with a fixed prefix and unit.
*/
Unit.prototype.to = function (valuelessUnit) {
var other;
var value = this.value === null ? this._normalize(1) : this.value;
if (typeof valuelessUnit === 'string') {
// other = new Unit(null, valuelessUnit)
other = Unit.parse(valuelessUnit);
if (!this.equalBase(other)) {
throw new Error("Units do not match ('".concat(other.toString(), "' != '").concat(this.toString(), "')"));
}
if (other.value !== null) {
throw new Error('Cannot convert to a unit with a value');
}
other.value = Object(utils_object["a" /* clone */])(value);
other.fixPrefix = true;
other.skipAutomaticSimplification = true;
return other;
} else if (Object(is["L" /* isUnit */])(valuelessUnit)) {
if (!this.equalBase(valuelessUnit)) {
throw new Error("Units do not match ('".concat(valuelessUnit.toString(), "' != '").concat(this.toString(), "')"));
}
if (valuelessUnit.value !== null) {
throw new Error('Cannot convert to a unit with a value');
}
other = valuelessUnit.clone();
other.value = Object(utils_object["a" /* clone */])(value);
other.fixPrefix = true;
other.skipAutomaticSimplification = true;
return other;
} else {
throw new Error('String or Unit expected as parameter');
}
};
/**
* Return the value of the unit when represented with given valueless unit
* @memberof Unit
* @param {string | Unit} valuelessUnit For example 'cm' or 'inch'
* @return {number} Returns the unit value as number.
*/
// TODO: deprecate Unit.toNumber? It's always better to use toNumeric
Unit.prototype.toNumber = function (valuelessUnit) {
return toNumber(this.toNumeric(valuelessUnit));
};
/**
* Return the value of the unit in the original numeric type
* @memberof Unit
* @param {string | Unit} valuelessUnit For example 'cm' or 'inch'
* @return {number | BigNumber | Fraction} Returns the unit value
*/
Unit.prototype.toNumeric = function (valuelessUnit) {
var other;
if (valuelessUnit) {
// Allow getting the numeric value without converting to a different unit
other = this.to(valuelessUnit);
} else {
other = this.clone();
}
if (other._isDerived() || other.units.length === 0) {
return other._denormalize(other.value);
} else {
return other._denormalize(other.value, other.units[0].prefix.value);
}
};
/**
* Get a string representation of the unit.
* @memberof Unit
* @return {string}
*/
Unit.prototype.toString = function () {
return this.format();
};
/**
* Get a JSON representation of the unit
* @memberof Unit
* @returns {Object} Returns a JSON object structured as:
* `{"mathjs": "Unit", "value": 2, "unit": "cm", "fixPrefix": false}`
*/
Unit.prototype.toJSON = function () {
return {
mathjs: 'Unit',
value: this._denormalize(this.value),
unit: this.formatUnits(),
fixPrefix: this.fixPrefix
};
};
/**
* Instantiate a Unit from a JSON object
* @memberof Unit
* @param {Object} json A JSON object structured as:
* `{"mathjs": "Unit", "value": 2, "unit": "cm", "fixPrefix": false}`
* @return {Unit}
*/
Unit.fromJSON = function (json) {
var unit = new Unit(json.value, json.unit);
unit.fixPrefix = json.fixPrefix || false;
return unit;
};
/**
* Returns the string representation of the unit.
* @memberof Unit
* @return {string}
*/
Unit.prototype.valueOf = Unit.prototype.toString;
/**
* Simplify this Unit's unit list and return a new Unit with the simplified list.
* The returned Unit will contain a list of the "best" units for formatting.
*/
Unit.prototype.simplify = function () {
var ret = this.clone();
var proposedUnitList = []; // Search for a matching base
var matchingBase;
for (var key in currentUnitSystem) {
if (Object(utils_object["f" /* hasOwnProperty */])(currentUnitSystem, key)) {
if (ret.hasBase(BASE_UNITS[key])) {
matchingBase = key;
break;
}
}
}
if (matchingBase === 'NONE') {
ret.units = [];
} else {
var matchingUnit;
if (matchingBase) {
// Does the unit system have a matching unit?
if (Object(utils_object["f" /* hasOwnProperty */])(currentUnitSystem, matchingBase)) {
matchingUnit = currentUnitSystem[matchingBase];
}
}
if (matchingUnit) {
ret.units = [{
unit: matchingUnit.unit,
prefix: matchingUnit.prefix,
power: 1.0
}];
} else {
// Multiple units or units with powers are formatted like this:
// 5 (kg m^2) / (s^3 mol)
// Build an representation from the base units of the current unit system
var missingBaseDim = false;
for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
var baseDim = BASE_DIMENSIONS[i];
if (Math.abs(ret.dimensions[i] || 0) > 1e-12) {
if (Object(utils_object["f" /* hasOwnProperty */])(currentUnitSystem, baseDim)) {
proposedUnitList.push({
unit: currentUnitSystem[baseDim].unit,
prefix: currentUnitSystem[baseDim].prefix,
power: ret.dimensions[i] || 0
});
} else {
missingBaseDim = true;
}
}
} // Is the proposed unit list "simpler" than the existing one?
if (proposedUnitList.length < ret.units.length && !missingBaseDim) {
// Replace this unit list with the proposed list
ret.units = proposedUnitList;
}
}
}
return ret;
};
/**
* Returns a new Unit in the SI system with the same value as this one
*/
Unit.prototype.toSI = function () {
var ret = this.clone();
var proposedUnitList = []; // Multiple units or units with powers are formatted like this:
// 5 (kg m^2) / (s^3 mol)
// Build an representation from the base units of the SI unit system
for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
var baseDim = BASE_DIMENSIONS[i];
if (Math.abs(ret.dimensions[i] || 0) > 1e-12) {
if (Object(utils_object["f" /* hasOwnProperty */])(UNIT_SYSTEMS.si, baseDim)) {
proposedUnitList.push({
unit: UNIT_SYSTEMS.si[baseDim].unit,
prefix: UNIT_SYSTEMS.si[baseDim].prefix,
power: ret.dimensions[i] || 0
});
} else {
throw new Error('Cannot express custom unit ' + baseDim + ' in SI units');
}
}
} // Replace this unit list with the proposed list
ret.units = proposedUnitList;
ret.fixPrefix = true;
ret.skipAutomaticSimplification = true;
return ret;
};
/**
* Get a string representation of the units of this Unit, without the value. The unit list is formatted as-is without first being simplified.
* @memberof Unit
* @return {string}
*/
Unit.prototype.formatUnits = function () {
var strNum = '';
var strDen = '';
var nNum = 0;
var nDen = 0;
for (var i = 0; i < this.units.length; i++) {
if (this.units[i].power > 0) {
nNum++;
strNum += ' ' + this.units[i].prefix.name + this.units[i].unit.name;
if (Math.abs(this.units[i].power - 1.0) > 1e-15) {
strNum += '^' + this.units[i].power;
}
} else if (this.units[i].power < 0) {
nDen++;
}
}
if (nDen > 0) {
for (var _i4 = 0; _i4 < this.units.length; _i4++) {
if (this.units[_i4].power < 0) {
if (nNum > 0) {
strDen += ' ' + this.units[_i4].prefix.name + this.units[_i4].unit.name;
if (Math.abs(this.units[_i4].power + 1.0) > 1e-15) {
strDen += '^' + -this.units[_i4].power;
}
} else {
strDen += ' ' + this.units[_i4].prefix.name + this.units[_i4].unit.name;
strDen += '^' + this.units[_i4].power;
}
}
}
} // Remove leading " "
strNum = strNum.substr(1);
strDen = strDen.substr(1); // Add parans for better copy/paste back into evaluate, for example, or for better pretty print formatting
if (nNum > 1 && nDen > 0) {
strNum = '(' + strNum + ')';
}
if (nDen > 1 && nNum > 0) {
strDen = '(' + strDen + ')';
}
var str = strNum;
if (nNum > 0 && nDen > 0) {
str += ' / ';
}
str += strDen;
return str;
};
/**
* Get a string representation of the Unit, with optional formatting options.
* @memberof Unit
* @param {Object | number | Function} [options] Formatting options. See
* lib/utils/number:format for a
* description of the available
* options.
* @return {string}
*/
Unit.prototype.format = function (options) {
// Simplfy the unit list, unless it is valueless or was created directly in the
// constructor or as the result of to or toSI
var simp = this.skipAutomaticSimplification || this.value === null ? this.clone() : this.simplify(); // Apply some custom logic for handling VA and VAR. The goal is to express the value of the unit as a real value, if possible. Otherwise, use a real-valued unit instead of a complex-valued one.
var isImaginary = false;
if (typeof simp.value !== 'undefined' && simp.value !== null && Object(is["j" /* isComplex */])(simp.value)) {
// TODO: Make this better, for example, use relative magnitude of re and im rather than absolute
isImaginary = Math.abs(simp.value.re) < 1e-14;
}
for (var i in simp.units) {
if (Object(utils_object["f" /* hasOwnProperty */])(simp.units, i)) {
if (simp.units[i].unit) {
if (simp.units[i].unit.name === 'VA' && isImaginary) {
simp.units[i].unit = UNITS.VAR;
} else if (simp.units[i].unit.name === 'VAR' && !isImaginary) {
simp.units[i].unit = UNITS.VA;
}
}
}
} // Now apply the best prefix
// Units must have only one unit and not have the fixPrefix flag set
if (simp.units.length === 1 && !simp.fixPrefix) {
// Units must have integer powers, otherwise the prefix will change the
// outputted value by not-an-integer-power-of-ten
if (Math.abs(simp.units[0].power - Math.round(simp.units[0].power)) < 1e-14) {
// Apply the best prefix
simp.units[0].prefix = simp._bestPrefix();
}
}
var value = simp._denormalize(simp.value);
var str = simp.value !== null ? format(value, options || {}) : '';
var unitStr = simp.formatUnits();
if (simp.value && Object(is["j" /* isComplex */])(simp.value)) {
str = '(' + str + ')'; // Surround complex values with ( ) to enable better parsing
}
if (unitStr.length > 0 && str.length > 0) {
str += ' ';
}
str += unitStr;
return str;
};
/**
* Calculate the best prefix using current value.
* @memberof Unit
* @returns {Object} prefix
* @private
*/
Unit.prototype._bestPrefix = function () {
if (this.units.length !== 1) {
throw new Error('Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!');
}
if (Math.abs(this.units[0].power - Math.round(this.units[0].power)) >= 1e-14) {
throw new Error('Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!');
} // find the best prefix value (resulting in the value of which
// the absolute value of the log10 is closest to zero,
// though with a little offset of 1.2 for nicer values: you get a
// sequence 1mm 100mm 500mm 0.6m 1m 10m 100m 500m 0.6km 1km ...
// Note: the units value can be any numeric type, but to find the best
// prefix it's enough to work with limited precision of a regular number
// Update: using mathjs abs since we also allow complex numbers
var absValue = this.value !== null ? abs(this.value) : 0;
var absUnitValue = abs(this.units[0].unit.value);
var bestPrefix = this.units[0].prefix;
if (absValue === 0) {
return bestPrefix;
}
var power = this.units[0].power;
var bestDiff = Math.log(absValue / Math.pow(bestPrefix.value * absUnitValue, power)) / Math.LN10 - 1.2;
if (bestDiff > -2.200001 && bestDiff < 1.800001) return bestPrefix; // Allow the original prefix
bestDiff = Math.abs(bestDiff);
var prefixes = this.units[0].unit.prefixes;
for (var p in prefixes) {
if (Object(utils_object["f" /* hasOwnProperty */])(prefixes, p)) {
var prefix = prefixes[p];
if (prefix.scientific) {
var diff = Math.abs(Math.log(absValue / Math.pow(prefix.value * absUnitValue, power)) / Math.LN10 - 1.2);
if (diff < bestDiff || diff === bestDiff && prefix.name.length < bestPrefix.name.length) {
// choose the prefix with the smallest diff, or if equal, choose the one
// with the shortest name (can happen with SHORTLONG for example)
bestPrefix = prefix;
bestDiff = diff;
}
}
}
}
return bestPrefix;
};
/**
* Returns an array of units whose sum is equal to this unit
* @memberof Unit
* @param {Array} [parts] An array of strings or valueless units.
*
* Example:
*
* const u = new Unit(1, 'm')
* u.splitUnit(['feet', 'inch'])
* [ 3 feet, 3.3700787401575 inch ]
*
* @return {Array} An array of units.
*/
Unit.prototype.splitUnit = function (parts) {
var x = this.clone();
var ret = [];
for (var i = 0; i < parts.length; i++) {
// Convert x to the requested unit
x = x.to(parts[i]);
if (i === parts.length - 1) break; // Get the numeric value of this unit
var xNumeric = x.toNumeric(); // Check to see if xNumeric is nearly equal to an integer,
// since fix can incorrectly round down if there is round-off error
var xRounded = round(xNumeric);
var xFixed = void 0;
var isNearlyEqual = equal(xRounded, xNumeric);
if (isNearlyEqual) {
xFixed = xRounded;
} else {
xFixed = fix(x.toNumeric());
}
var y = new Unit(xFixed, parts[i].toString());
ret.push(y);
x = subtract(x, y);
} // This little bit fixes a bug where the remainder should be 0 but is a little bit off.
// But instead of comparing x, the remainder, with zero--we will compare the sum of
// all the parts so far with the original value. If they are nearly equal,
// we set the remainder to 0.
var testSum = 0;
for (var _i5 = 0; _i5 < ret.length; _i5++) {
testSum = addScalar(testSum, ret[_i5].value);
}
if (equal(testSum, this.value)) {
x.value = 0;
}
ret.push(x);
return ret;
};
var PREFIXES = {
NONE: {
'': {
name: '',
value: 1,
scientific: true
}
},
SHORT: {
'': {
name: '',
value: 1,
scientific: true
},
da: {
name: 'da',
value: 1e1,
scientific: false
},
h: {
name: 'h',
value: 1e2,
scientific: false
},
k: {
name: 'k',
value: 1e3,
scientific: true
},
M: {
name: 'M',
value: 1e6,
scientific: true
},
G: {
name: 'G',
value: 1e9,
scientific: true
},
T: {
name: 'T',
value: 1e12,
scientific: true
},
P: {
name: 'P',
value: 1e15,
scientific: true
},
E: {
name: 'E',
value: 1e18,
scientific: true
},
Z: {
name: 'Z',
value: 1e21,
scientific: true
},
Y: {
name: 'Y',
value: 1e24,
scientific: true
},
d: {
name: 'd',
value: 1e-1,
scientific: false
},
c: {
name: 'c',
value: 1e-2,
scientific: false
},
m: {
name: 'm',
value: 1e-3,
scientific: true
},
u: {
name: 'u',
value: 1e-6,
scientific: true
},
n: {
name: 'n',
value: 1e-9,
scientific: true
},
p: {
name: 'p',
value: 1e-12,
scientific: true
},
f: {
name: 'f',
value: 1e-15,
scientific: true
},
a: {
name: 'a',
value: 1e-18,
scientific: true
},
z: {
name: 'z',
value: 1e-21,
scientific: true
},
y: {
name: 'y',
value: 1e-24,
scientific: true
}
},
LONG: {
'': {
name: '',
value: 1,
scientific: true
},
deca: {
name: 'deca',
value: 1e1,
scientific: false
},
hecto: {
name: 'hecto',
value: 1e2,
scientific: false
},
kilo: {
name: 'kilo',
value: 1e3,
scientific: true
},
mega: {
name: 'mega',
value: 1e6,
scientific: true
},
giga: {
name: 'giga',
value: 1e9,
scientific: true
},
tera: {
name: 'tera',
value: 1e12,
scientific: true
},
peta: {
name: 'peta',
value: 1e15,
scientific: true
},
exa: {
name: 'exa',
value: 1e18,
scientific: true
},
zetta: {
name: 'zetta',
value: 1e21,
scientific: true
},
yotta: {
name: 'yotta',
value: 1e24,
scientific: true
},
deci: {
name: 'deci',
value: 1e-1,
scientific: false
},
centi: {
name: 'centi',
value: 1e-2,
scientific: false
},
milli: {
name: 'milli',
value: 1e-3,
scientific: true
},
micro: {
name: 'micro',
value: 1e-6,
scientific: true
},
nano: {
name: 'nano',
value: 1e-9,
scientific: true
},
pico: {
name: 'pico',
value: 1e-12,
scientific: true
},
femto: {
name: 'femto',
value: 1e-15,
scientific: true
},
atto: {
name: 'atto',
value: 1e-18,
scientific: true
},
zepto: {
name: 'zepto',
value: 1e-21,
scientific: true
},
yocto: {
name: 'yocto',
value: 1e-24,
scientific: true
}
},
SQUARED: {
'': {
name: '',
value: 1,
scientific: true
},
da: {
name: 'da',
value: 1e2,
scientific: false
},
h: {
name: 'h',
value: 1e4,
scientific: false
},
k: {
name: 'k',
value: 1e6,
scientific: true
},
M: {
name: 'M',
value: 1e12,
scientific: true
},
G: {
name: 'G',
value: 1e18,
scientific: true
},
T: {
name: 'T',
value: 1e24,
scientific: true
},
P: {
name: 'P',
value: 1e30,
scientific: true
},
E: {
name: 'E',
value: 1e36,
scientific: true
},
Z: {
name: 'Z',
value: 1e42,
scientific: true
},
Y: {
name: 'Y',
value: 1e48,
scientific: true
},
d: {
name: 'd',
value: 1e-2,
scientific: false
},
c: {
name: 'c',
value: 1e-4,
scientific: false
},
m: {
name: 'm',
value: 1e-6,
scientific: true
},
u: {
name: 'u',
value: 1e-12,
scientific: true
},
n: {
name: 'n',
value: 1e-18,
scientific: true
},
p: {
name: 'p',
value: 1e-24,
scientific: true
},
f: {
name: 'f',
value: 1e-30,
scientific: true
},
a: {
name: 'a',
value: 1e-36,
scientific: true
},
z: {
name: 'z',
value: 1e-42,
scientific: true
},
y: {
name: 'y',
value: 1e-48,
scientific: true
}
},
CUBIC: {
'': {
name: '',
value: 1,
scientific: true
},
da: {
name: 'da',
value: 1e3,
scientific: false
},
h: {
name: 'h',
value: 1e6,
scientific: false
},
k: {
name: 'k',
value: 1e9,
scientific: true
},
M: {
name: 'M',
value: 1e18,
scientific: true
},
G: {
name: 'G',
value: 1e27,
scientific: true
},
T: {
name: 'T',
value: 1e36,
scientific: true
},
P: {
name: 'P',
value: 1e45,
scientific: true
},
E: {
name: 'E',
value: 1e54,
scientific: true
},
Z: {
name: 'Z',
value: 1e63,
scientific: true
},
Y: {
name: 'Y',
value: 1e72,
scientific: true
},
d: {
name: 'd',
value: 1e-3,
scientific: false
},
c: {
name: 'c',
value: 1e-6,
scientific: false
},
m: {
name: 'm',
value: 1e-9,
scientific: true
},
u: {
name: 'u',
value: 1e-18,
scientific: true
},
n: {
name: 'n',
value: 1e-27,
scientific: true
},
p: {
name: 'p',
value: 1e-36,
scientific: true
},
f: {
name: 'f',
value: 1e-45,
scientific: true
},
a: {
name: 'a',
value: 1e-54,
scientific: true
},
z: {
name: 'z',
value: 1e-63,
scientific: true
},
y: {
name: 'y',
value: 1e-72,
scientific: true
}
},
BINARY_SHORT_SI: {
'': {
name: '',
value: 1,
scientific: true
},
k: {
name: 'k',
value: 1e3,
scientific: true
},
M: {
name: 'M',
value: 1e6,
scientific: true
},
G: {
name: 'G',
value: 1e9,
scientific: true
},
T: {
name: 'T',
value: 1e12,
scientific: true
},
P: {
name: 'P',
value: 1e15,
scientific: true
},
E: {
name: 'E',
value: 1e18,
scientific: true
},
Z: {
name: 'Z',
value: 1e21,
scientific: true
},
Y: {
name: 'Y',
value: 1e24,
scientific: true
}
},
BINARY_SHORT_IEC: {
'': {
name: '',
value: 1,
scientific: true
},
Ki: {
name: 'Ki',
value: 1024,
scientific: true
},
Mi: {
name: 'Mi',
value: Math.pow(1024, 2),
scientific: true
},
Gi: {
name: 'Gi',
value: Math.pow(1024, 3),
scientific: true
},
Ti: {
name: 'Ti',
value: Math.pow(1024, 4),
scientific: true
},
Pi: {
name: 'Pi',
value: Math.pow(1024, 5),
scientific: true
},
Ei: {
name: 'Ei',
value: Math.pow(1024, 6),
scientific: true
},
Zi: {
name: 'Zi',
value: Math.pow(1024, 7),
scientific: true
},
Yi: {
name: 'Yi',
value: Math.pow(1024, 8),
scientific: true
}
},
BINARY_LONG_SI: {
'': {
name: '',
value: 1,
scientific: true
},
kilo: {
name: 'kilo',
value: 1e3,
scientific: true
},
mega: {
name: 'mega',
value: 1e6,
scientific: true
},
giga: {
name: 'giga',
value: 1e9,
scientific: true
},
tera: {
name: 'tera',
value: 1e12,
scientific: true
},
peta: {
name: 'peta',
value: 1e15,
scientific: true
},
exa: {
name: 'exa',
value: 1e18,
scientific: true
},
zetta: {
name: 'zetta',
value: 1e21,
scientific: true
},
yotta: {
name: 'yotta',
value: 1e24,
scientific: true
}
},
BINARY_LONG_IEC: {
'': {
name: '',
value: 1,
scientific: true
},
kibi: {
name: 'kibi',
value: 1024,
scientific: true
},
mebi: {
name: 'mebi',
value: Math.pow(1024, 2),
scientific: true
},
gibi: {
name: 'gibi',
value: Math.pow(1024, 3),
scientific: true
},
tebi: {
name: 'tebi',
value: Math.pow(1024, 4),
scientific: true
},
pebi: {
name: 'pebi',
value: Math.pow(1024, 5),
scientific: true
},
exi: {
name: 'exi',
value: Math.pow(1024, 6),
scientific: true
},
zebi: {
name: 'zebi',
value: Math.pow(1024, 7),
scientific: true
},
yobi: {
name: 'yobi',
value: Math.pow(1024, 8),
scientific: true
}
},
BTU: {
'': {
name: '',
value: 1,
scientific: true
},
MM: {
name: 'MM',
value: 1e6,
scientific: true
}
}
};
PREFIXES.SHORTLONG = _extends({}, PREFIXES.SHORT, PREFIXES.LONG);
PREFIXES.BINARY_SHORT = _extends({}, PREFIXES.BINARY_SHORT_SI, PREFIXES.BINARY_SHORT_IEC);
PREFIXES.BINARY_LONG = _extends({}, PREFIXES.BINARY_LONG_SI, PREFIXES.BINARY_LONG_IEC);
/* Internally, each unit is represented by a value and a dimension array. The elements of the dimensions array have the following meaning:
* Index Dimension
* ----- ---------
* 0 Length
* 1 Mass
* 2 Time
* 3 Current
* 4 Temperature
* 5 Luminous intensity
* 6 Amount of substance
* 7 Angle
* 8 Bit (digital)
* For example, the unit "298.15 K" is a pure temperature and would have a value of 298.15 and a dimension array of [0, 0, 0, 0, 1, 0, 0, 0, 0]. The unit "1 cal / (gm °C)" can be written in terms of the 9 fundamental dimensions as [length^2] / ([time^2] * [temperature]), and would a value of (after conversion to SI) 4184.0 and a dimensions array of [2, 0, -2, 0, -1, 0, 0, 0, 0].
*
*/
var BASE_DIMENSIONS = ['MASS', 'LENGTH', 'TIME', 'CURRENT', 'TEMPERATURE', 'LUMINOUS_INTENSITY', 'AMOUNT_OF_SUBSTANCE', 'ANGLE', 'BIT'];
var BASE_UNITS = {
NONE: {
dimensions: [0, 0, 0, 0, 0, 0, 0, 0, 0]
},
MASS: {
dimensions: [1, 0, 0, 0, 0, 0, 0, 0, 0]
},
LENGTH: {
dimensions: [0, 1, 0, 0, 0, 0, 0, 0, 0]
},
TIME: {
dimensions: [0, 0, 1, 0, 0, 0, 0, 0, 0]
},
CURRENT: {
dimensions: [0, 0, 0, 1, 0, 0, 0, 0, 0]
},
TEMPERATURE: {
dimensions: [0, 0, 0, 0, 1, 0, 0, 0, 0]
},
LUMINOUS_INTENSITY: {
dimensions: [0, 0, 0, 0, 0, 1, 0, 0, 0]
},
AMOUNT_OF_SUBSTANCE: {
dimensions: [0, 0, 0, 0, 0, 0, 1, 0, 0]
},
FORCE: {
dimensions: [1, 1, -2, 0, 0, 0, 0, 0, 0]
},
SURFACE: {
dimensions: [0, 2, 0, 0, 0, 0, 0, 0, 0]
},
VOLUME: {
dimensions: [0, 3, 0, 0, 0, 0, 0, 0, 0]
},
ENERGY: {
dimensions: [1, 2, -2, 0, 0, 0, 0, 0, 0]
},
POWER: {
dimensions: [1, 2, -3, 0, 0, 0, 0, 0, 0]
},
PRESSURE: {
dimensions: [1, -1, -2, 0, 0, 0, 0, 0, 0]
},
ELECTRIC_CHARGE: {
dimensions: [0, 0, 1, 1, 0, 0, 0, 0, 0]
},
ELECTRIC_CAPACITANCE: {
dimensions: [-1, -2, 4, 2, 0, 0, 0, 0, 0]
},
ELECTRIC_POTENTIAL: {
dimensions: [1, 2, -3, -1, 0, 0, 0, 0, 0]
},
ELECTRIC_RESISTANCE: {
dimensions: [1, 2, -3, -2, 0, 0, 0, 0, 0]
},
ELECTRIC_INDUCTANCE: {
dimensions: [1, 2, -2, -2, 0, 0, 0, 0, 0]
},
ELECTRIC_CONDUCTANCE: {
dimensions: [-1, -2, 3, 2, 0, 0, 0, 0, 0]
},
MAGNETIC_FLUX: {
dimensions: [1, 2, -2, -1, 0, 0, 0, 0, 0]
},
MAGNETIC_FLUX_DENSITY: {
dimensions: [1, 0, -2, -1, 0, 0, 0, 0, 0]
},
FREQUENCY: {
dimensions: [0, 0, -1, 0, 0, 0, 0, 0, 0]
},
ANGLE: {
dimensions: [0, 0, 0, 0, 0, 0, 0, 1, 0]
},
BIT: {
dimensions: [0, 0, 0, 0, 0, 0, 0, 0, 1]
}
};
for (var key in BASE_UNITS) {
if (Object(utils_object["f" /* hasOwnProperty */])(BASE_UNITS, key)) {
BASE_UNITS[key].key = key;
}
}
var BASE_UNIT_NONE = {};
var UNIT_NONE = {
name: '',
base: BASE_UNIT_NONE,
value: 1,
offset: 0,
dimensions: BASE_DIMENSIONS.map(function (x) {
return 0;
})
};
var UNITS = {
// length
meter: {
name: 'meter',
base: BASE_UNITS.LENGTH,
prefixes: PREFIXES.LONG,
value: 1,
offset: 0
},
inch: {
name: 'inch',
base: BASE_UNITS.LENGTH,
prefixes: PREFIXES.NONE,
value: 0.0254,
offset: 0
},
foot: {
name: 'foot',
base: BASE_UNITS.LENGTH,
prefixes: PREFIXES.NONE,
value: 0.3048,
offset: 0
},
yard: {
name: 'yard',
base: BASE_UNITS.LENGTH,
prefixes: PREFIXES.NONE,
value: 0.9144,
offset: 0
},
mile: {
name: 'mile',
base: BASE_UNITS.LENGTH,
prefixes: PREFIXES.NONE,
value: 1609.344,
offset: 0
},
link: {
name: 'link',
base: BASE_UNITS.LENGTH,
prefixes: PREFIXES.NONE,
value: 0.201168,
offset: 0
},
rod: {
name: 'rod',
base: BASE_UNITS.LENGTH,
prefixes: PREFIXES.NONE,
value: 5.0292,
offset: 0
},
chain: {
name: 'chain',
base: BASE_UNITS.LENGTH,
prefixes: PREFIXES.NONE,
value: 20.1168,
offset: 0
},
angstrom: {
name: 'angstrom',
base: BASE_UNITS.LENGTH,
prefixes: PREFIXES.NONE,
value: 1e-10,
offset: 0
},
m: {
name: 'm',
base: BASE_UNITS.LENGTH,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0
},
"in": {
name: 'in',
base: BASE_UNITS.LENGTH,
prefixes: PREFIXES.NONE,
value: 0.0254,
offset: 0
},
ft: {
name: 'ft',
base: BASE_UNITS.LENGTH,
prefixes: PREFIXES.NONE,
value: 0.3048,
offset: 0
},
yd: {
name: 'yd',
base: BASE_UNITS.LENGTH,
prefixes: PREFIXES.NONE,
value: 0.9144,
offset: 0
},
mi: {
name: 'mi',
base: BASE_UNITS.LENGTH,
prefixes: PREFIXES.NONE,
value: 1609.344,
offset: 0
},
li: {
name: 'li',
base: BASE_UNITS.LENGTH,
prefixes: PREFIXES.NONE,
value: 0.201168,
offset: 0
},
rd: {
name: 'rd',
base: BASE_UNITS.LENGTH,
prefixes: PREFIXES.NONE,
value: 5.029210,
offset: 0
},
ch: {
name: 'ch',
base: BASE_UNITS.LENGTH,
prefixes: PREFIXES.NONE,
value: 20.1168,
offset: 0
},
mil: {
name: 'mil',
base: BASE_UNITS.LENGTH,
prefixes: PREFIXES.NONE,
value: 0.0000254,
offset: 0
},
// 1/1000 inch
// Surface
m2: {
name: 'm2',
base: BASE_UNITS.SURFACE,
prefixes: PREFIXES.SQUARED,
value: 1,
offset: 0
},
sqin: {
name: 'sqin',
base: BASE_UNITS.SURFACE,
prefixes: PREFIXES.NONE,
value: 0.00064516,
offset: 0
},
// 645.16 mm2
sqft: {
name: 'sqft',
base: BASE_UNITS.SURFACE,
prefixes: PREFIXES.NONE,
value: 0.09290304,
offset: 0
},
// 0.09290304 m2
sqyd: {
name: 'sqyd',
base: BASE_UNITS.SURFACE,
prefixes: PREFIXES.NONE,
value: 0.83612736,
offset: 0
},
// 0.83612736 m2
sqmi: {
name: 'sqmi',
base: BASE_UNITS.SURFACE,
prefixes: PREFIXES.NONE,
value: 2589988.110336,
offset: 0
},
// 2.589988110336 km2
sqrd: {
name: 'sqrd',
base: BASE_UNITS.SURFACE,
prefixes: PREFIXES.NONE,
value: 25.29295,
offset: 0
},
// 25.29295 m2
sqch: {
name: 'sqch',
base: BASE_UNITS.SURFACE,
prefixes: PREFIXES.NONE,
value: 404.6873,
offset: 0
},
// 404.6873 m2
sqmil: {
name: 'sqmil',
base: BASE_UNITS.SURFACE,
prefixes: PREFIXES.NONE,
value: 6.4516e-10,
offset: 0
},
// 6.4516 * 10^-10 m2
acre: {
name: 'acre',
base: BASE_UNITS.SURFACE,
prefixes: PREFIXES.NONE,
value: 4046.86,
offset: 0
},
// 4046.86 m2
hectare: {
name: 'hectare',
base: BASE_UNITS.SURFACE,
prefixes: PREFIXES.NONE,
value: 10000,
offset: 0
},
// 10000 m2
// Volume
m3: {
name: 'm3',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.CUBIC,
value: 1,
offset: 0
},
L: {
name: 'L',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.SHORT,
value: 0.001,
offset: 0
},
// litre
l: {
name: 'l',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.SHORT,
value: 0.001,
offset: 0
},
// litre
litre: {
name: 'litre',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.LONG,
value: 0.001,
offset: 0
},
cuin: {
name: 'cuin',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 1.6387064e-5,
offset: 0
},
// 1.6387064e-5 m3
cuft: {
name: 'cuft',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.028316846592,
offset: 0
},
// 28.316 846 592 L
cuyd: {
name: 'cuyd',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.764554857984,
offset: 0
},
// 764.554 857 984 L
teaspoon: {
name: 'teaspoon',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.000005,
offset: 0
},
// 5 mL
tablespoon: {
name: 'tablespoon',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.000015,
offset: 0
},
// 15 mL
// {name: 'cup', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.000240, offset: 0}, // 240 mL // not possible, we have already another cup
drop: {
name: 'drop',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 5e-8,
offset: 0
},
// 0.05 mL = 5e-8 m3
gtt: {
name: 'gtt',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 5e-8,
offset: 0
},
// 0.05 mL = 5e-8 m3
// Liquid volume
minim: {
name: 'minim',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.00000006161152,
offset: 0
},
// 0.06161152 mL
fluiddram: {
name: 'fluiddram',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.0000036966911,
offset: 0
},
// 3.696691 mL
fluidounce: {
name: 'fluidounce',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.00002957353,
offset: 0
},
// 29.57353 mL
gill: {
name: 'gill',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.0001182941,
offset: 0
},
// 118.2941 mL
cc: {
name: 'cc',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 1e-6,
offset: 0
},
// 1e-6 L
cup: {
name: 'cup',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.0002365882,
offset: 0
},
// 236.5882 mL
pint: {
name: 'pint',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.0004731765,
offset: 0
},
// 473.1765 mL
quart: {
name: 'quart',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.0009463529,
offset: 0
},
// 946.3529 mL
gallon: {
name: 'gallon',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.003785412,
offset: 0
},
// 3.785412 L
beerbarrel: {
name: 'beerbarrel',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.1173478,
offset: 0
},
// 117.3478 L
oilbarrel: {
name: 'oilbarrel',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.1589873,
offset: 0
},
// 158.9873 L
hogshead: {
name: 'hogshead',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.2384810,
offset: 0
},
// 238.4810 L
// {name: 'min', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.00000006161152, offset: 0}, // 0.06161152 mL // min is already in use as minute
fldr: {
name: 'fldr',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.0000036966911,
offset: 0
},
// 3.696691 mL
floz: {
name: 'floz',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.00002957353,
offset: 0
},
// 29.57353 mL
gi: {
name: 'gi',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.0001182941,
offset: 0
},
// 118.2941 mL
cp: {
name: 'cp',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.0002365882,
offset: 0
},
// 236.5882 mL
pt: {
name: 'pt',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.0004731765,
offset: 0
},
// 473.1765 mL
qt: {
name: 'qt',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.0009463529,
offset: 0
},
// 946.3529 mL
gal: {
name: 'gal',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.003785412,
offset: 0
},
// 3.785412 L
bbl: {
name: 'bbl',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.1173478,
offset: 0
},
// 117.3478 L
obl: {
name: 'obl',
base: BASE_UNITS.VOLUME,
prefixes: PREFIXES.NONE,
value: 0.1589873,
offset: 0
},
// 158.9873 L
// {name: 'hogshead', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.2384810, offset: 0}, // 238.4810 L // TODO: hh?
// Mass
g: {
name: 'g',
base: BASE_UNITS.MASS,
prefixes: PREFIXES.SHORT,
value: 0.001,
offset: 0
},
gram: {
name: 'gram',
base: BASE_UNITS.MASS,
prefixes: PREFIXES.LONG,
value: 0.001,
offset: 0
},
ton: {
name: 'ton',
base: BASE_UNITS.MASS,
prefixes: PREFIXES.SHORT,
value: 907.18474,
offset: 0
},
t: {
name: 't',
base: BASE_UNITS.MASS,
prefixes: PREFIXES.SHORT,
value: 1000,
offset: 0
},
tonne: {
name: 'tonne',
base: BASE_UNITS.MASS,
prefixes: PREFIXES.LONG,
value: 1000,
offset: 0
},
grain: {
name: 'grain',
base: BASE_UNITS.MASS,
prefixes: PREFIXES.NONE,
value: 64.79891e-6,
offset: 0
},
dram: {
name: 'dram',
base: BASE_UNITS.MASS,
prefixes: PREFIXES.NONE,
value: 1.7718451953125e-3,
offset: 0
},
ounce: {
name: 'ounce',
base: BASE_UNITS.MASS,
prefixes: PREFIXES.NONE,
value: 28.349523125e-3,
offset: 0
},
poundmass: {
name: 'poundmass',
base: BASE_UNITS.MASS,
prefixes: PREFIXES.NONE,
value: 453.59237e-3,
offset: 0
},
hundredweight: {
name: 'hundredweight',
base: BASE_UNITS.MASS,
prefixes: PREFIXES.NONE,
value: 45.359237,
offset: 0
},
stick: {
name: 'stick',
base: BASE_UNITS.MASS,
prefixes: PREFIXES.NONE,
value: 115e-3,
offset: 0
},
stone: {
name: 'stone',
base: BASE_UNITS.MASS,
prefixes: PREFIXES.NONE,
value: 6.35029318,
offset: 0
},
gr: {
name: 'gr',
base: BASE_UNITS.MASS,
prefixes: PREFIXES.NONE,
value: 64.79891e-6,
offset: 0
},
dr: {
name: 'dr',
base: BASE_UNITS.MASS,
prefixes: PREFIXES.NONE,
value: 1.7718451953125e-3,
offset: 0
},
oz: {
name: 'oz',
base: BASE_UNITS.MASS,
prefixes: PREFIXES.NONE,
value: 28.349523125e-3,
offset: 0
},
lbm: {
name: 'lbm',
base: BASE_UNITS.MASS,
prefixes: PREFIXES.NONE,
value: 453.59237e-3,
offset: 0
},
cwt: {
name: 'cwt',
base: BASE_UNITS.MASS,
prefixes: PREFIXES.NONE,
value: 45.359237,
offset: 0
},
// Time
s: {
name: 's',
base: BASE_UNITS.TIME,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0
},
min: {
name: 'min',
base: BASE_UNITS.TIME,
prefixes: PREFIXES.NONE,
value: 60,
offset: 0
},
h: {
name: 'h',
base: BASE_UNITS.TIME,
prefixes: PREFIXES.NONE,
value: 3600,
offset: 0
},
second: {
name: 'second',
base: BASE_UNITS.TIME,
prefixes: PREFIXES.LONG,
value: 1,
offset: 0
},
sec: {
name: 'sec',
base: BASE_UNITS.TIME,
prefixes: PREFIXES.LONG,
value: 1,
offset: 0
},
minute: {
name: 'minute',
base: BASE_UNITS.TIME,
prefixes: PREFIXES.NONE,
value: 60,
offset: 0
},
hour: {
name: 'hour',
base: BASE_UNITS.TIME,
prefixes: PREFIXES.NONE,
value: 3600,
offset: 0
},
day: {
name: 'day',
base: BASE_UNITS.TIME,
prefixes: PREFIXES.NONE,
value: 86400,
offset: 0
},
week: {
name: 'week',
base: BASE_UNITS.TIME,
prefixes: PREFIXES.NONE,
value: 7 * 86400,
offset: 0
},
month: {
name: 'month',
base: BASE_UNITS.TIME,
prefixes: PREFIXES.NONE,
value: 2629800,
// 1/12th of Julian year
offset: 0
},
year: {
name: 'year',
base: BASE_UNITS.TIME,
prefixes: PREFIXES.NONE,
value: 31557600,
// Julian year
offset: 0
},
decade: {
name: 'decade',
base: BASE_UNITS.TIME,
prefixes: PREFIXES.NONE,
value: 315576000,
// Julian decade
offset: 0
},
century: {
name: 'century',
base: BASE_UNITS.TIME,
prefixes: PREFIXES.NONE,
value: 3155760000,
// Julian century
offset: 0
},
millennium: {
name: 'millennium',
base: BASE_UNITS.TIME,
prefixes: PREFIXES.NONE,
value: 31557600000,
// Julian millennium
offset: 0
},
// Frequency
hertz: {
name: 'Hertz',
base: BASE_UNITS.FREQUENCY,
prefixes: PREFIXES.LONG,
value: 1,
offset: 0,
reciprocal: true
},
Hz: {
name: 'Hz',
base: BASE_UNITS.FREQUENCY,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0,
reciprocal: true
},
// Angle
rad: {
name: 'rad',
base: BASE_UNITS.ANGLE,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0
},
radian: {
name: 'radian',
base: BASE_UNITS.ANGLE,
prefixes: PREFIXES.LONG,
value: 1,
offset: 0
},
// deg = rad / (2*pi) * 360 = rad / 0.017453292519943295769236907684888
deg: {
name: 'deg',
base: BASE_UNITS.ANGLE,
prefixes: PREFIXES.SHORT,
value: null,
// will be filled in by calculateAngleValues()
offset: 0
},
degree: {
name: 'degree',
base: BASE_UNITS.ANGLE,
prefixes: PREFIXES.LONG,
value: null,
// will be filled in by calculateAngleValues()
offset: 0
},
// grad = rad / (2*pi) * 400 = rad / 0.015707963267948966192313216916399
grad: {
name: 'grad',
base: BASE_UNITS.ANGLE,
prefixes: PREFIXES.SHORT,
value: null,
// will be filled in by calculateAngleValues()
offset: 0
},
gradian: {
name: 'gradian',
base: BASE_UNITS.ANGLE,
prefixes: PREFIXES.LONG,
value: null,
// will be filled in by calculateAngleValues()
offset: 0
},
// cycle = rad / (2*pi) = rad / 6.2831853071795864769252867665793
cycle: {
name: 'cycle',
base: BASE_UNITS.ANGLE,
prefixes: PREFIXES.NONE,
value: null,
// will be filled in by calculateAngleValues()
offset: 0
},
// arcsec = rad / (3600 * (360 / 2 * pi)) = rad / 0.0000048481368110953599358991410235795
arcsec: {
name: 'arcsec',
base: BASE_UNITS.ANGLE,
prefixes: PREFIXES.NONE,
value: null,
// will be filled in by calculateAngleValues()
offset: 0
},
// arcmin = rad / (60 * (360 / 2 * pi)) = rad / 0.00029088820866572159615394846141477
arcmin: {
name: 'arcmin',
base: BASE_UNITS.ANGLE,
prefixes: PREFIXES.NONE,
value: null,
// will be filled in by calculateAngleValues()
offset: 0
},
// Electric current
A: {
name: 'A',
base: BASE_UNITS.CURRENT,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0
},
ampere: {
name: 'ampere',
base: BASE_UNITS.CURRENT,
prefixes: PREFIXES.LONG,
value: 1,
offset: 0
},
// Temperature
// K(C) = °C + 273.15
// K(F) = (°F + 459.67) / 1.8
// K(R) = °R / 1.8
K: {
name: 'K',
base: BASE_UNITS.TEMPERATURE,
prefixes: PREFIXES.NONE,
value: 1,
offset: 0
},
degC: {
name: 'degC',
base: BASE_UNITS.TEMPERATURE,
prefixes: PREFIXES.NONE,
value: 1,
offset: 273.15
},
degF: {
name: 'degF',
base: BASE_UNITS.TEMPERATURE,
prefixes: PREFIXES.NONE,
value: 1 / 1.8,
offset: 459.67
},
degR: {
name: 'degR',
base: BASE_UNITS.TEMPERATURE,
prefixes: PREFIXES.NONE,
value: 1 / 1.8,
offset: 0
},
kelvin: {
name: 'kelvin',
base: BASE_UNITS.TEMPERATURE,
prefixes: PREFIXES.NONE,
value: 1,
offset: 0
},
celsius: {
name: 'celsius',
base: BASE_UNITS.TEMPERATURE,
prefixes: PREFIXES.NONE,
value: 1,
offset: 273.15
},
fahrenheit: {
name: 'fahrenheit',
base: BASE_UNITS.TEMPERATURE,
prefixes: PREFIXES.NONE,
value: 1 / 1.8,
offset: 459.67
},
rankine: {
name: 'rankine',
base: BASE_UNITS.TEMPERATURE,
prefixes: PREFIXES.NONE,
value: 1 / 1.8,
offset: 0
},
// amount of substance
mol: {
name: 'mol',
base: BASE_UNITS.AMOUNT_OF_SUBSTANCE,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0
},
mole: {
name: 'mole',
base: BASE_UNITS.AMOUNT_OF_SUBSTANCE,
prefixes: PREFIXES.LONG,
value: 1,
offset: 0
},
// luminous intensity
cd: {
name: 'cd',
base: BASE_UNITS.LUMINOUS_INTENSITY,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0
},
candela: {
name: 'candela',
base: BASE_UNITS.LUMINOUS_INTENSITY,
prefixes: PREFIXES.LONG,
value: 1,
offset: 0
},
// TODO: units STERADIAN
// {name: 'sr', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0},
// {name: 'steradian', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0},
// Force
N: {
name: 'N',
base: BASE_UNITS.FORCE,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0
},
newton: {
name: 'newton',
base: BASE_UNITS.FORCE,
prefixes: PREFIXES.LONG,
value: 1,
offset: 0
},
dyn: {
name: 'dyn',
base: BASE_UNITS.FORCE,
prefixes: PREFIXES.SHORT,
value: 0.00001,
offset: 0
},
dyne: {
name: 'dyne',
base: BASE_UNITS.FORCE,
prefixes: PREFIXES.LONG,
value: 0.00001,
offset: 0
},
lbf: {
name: 'lbf',
base: BASE_UNITS.FORCE,
prefixes: PREFIXES.NONE,
value: 4.4482216152605,
offset: 0
},
poundforce: {
name: 'poundforce',
base: BASE_UNITS.FORCE,
prefixes: PREFIXES.NONE,
value: 4.4482216152605,
offset: 0
},
kip: {
name: 'kip',
base: BASE_UNITS.FORCE,
prefixes: PREFIXES.LONG,
value: 4448.2216,
offset: 0
},
// Energy
J: {
name: 'J',
base: BASE_UNITS.ENERGY,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0
},
joule: {
name: 'joule',
base: BASE_UNITS.ENERGY,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0
},
erg: {
name: 'erg',
base: BASE_UNITS.ENERGY,
prefixes: PREFIXES.NONE,
value: 1e-7,
offset: 0
},
Wh: {
name: 'Wh',
base: BASE_UNITS.ENERGY,
prefixes: PREFIXES.SHORT,
value: 3600,
offset: 0
},
BTU: {
name: 'BTU',
base: BASE_UNITS.ENERGY,
prefixes: PREFIXES.BTU,
value: 1055.05585262,
offset: 0
},
eV: {
name: 'eV',
base: BASE_UNITS.ENERGY,
prefixes: PREFIXES.SHORT,
value: 1.602176565e-19,
offset: 0
},
electronvolt: {
name: 'electronvolt',
base: BASE_UNITS.ENERGY,
prefixes: PREFIXES.LONG,
value: 1.602176565e-19,
offset: 0
},
// Power
W: {
name: 'W',
base: BASE_UNITS.POWER,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0
},
watt: {
name: 'watt',
base: BASE_UNITS.POWER,
prefixes: PREFIXES.LONG,
value: 1,
offset: 0
},
hp: {
name: 'hp',
base: BASE_UNITS.POWER,
prefixes: PREFIXES.NONE,
value: 745.6998715386,
offset: 0
},
// Electrical power units
VAR: {
name: 'VAR',
base: BASE_UNITS.POWER,
prefixes: PREFIXES.SHORT,
value: Complex.I,
offset: 0
},
VA: {
name: 'VA',
base: BASE_UNITS.POWER,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0
},
// Pressure
Pa: {
name: 'Pa',
base: BASE_UNITS.PRESSURE,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0
},
psi: {
name: 'psi',
base: BASE_UNITS.PRESSURE,
prefixes: PREFIXES.NONE,
value: 6894.75729276459,
offset: 0
},
atm: {
name: 'atm',
base: BASE_UNITS.PRESSURE,
prefixes: PREFIXES.NONE,
value: 101325,
offset: 0
},
bar: {
name: 'bar',
base: BASE_UNITS.PRESSURE,
prefixes: PREFIXES.SHORTLONG,
value: 100000,
offset: 0
},
torr: {
name: 'torr',
base: BASE_UNITS.PRESSURE,
prefixes: PREFIXES.NONE,
value: 133.322,
offset: 0
},
mmHg: {
name: 'mmHg',
base: BASE_UNITS.PRESSURE,
prefixes: PREFIXES.NONE,
value: 133.322,
offset: 0
},
mmH2O: {
name: 'mmH2O',
base: BASE_UNITS.PRESSURE,
prefixes: PREFIXES.NONE,
value: 9.80665,
offset: 0
},
cmH2O: {
name: 'cmH2O',
base: BASE_UNITS.PRESSURE,
prefixes: PREFIXES.NONE,
value: 98.0665,
offset: 0
},
// Electric charge
coulomb: {
name: 'coulomb',
base: BASE_UNITS.ELECTRIC_CHARGE,
prefixes: PREFIXES.LONG,
value: 1,
offset: 0
},
C: {
name: 'C',
base: BASE_UNITS.ELECTRIC_CHARGE,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0
},
// Electric capacitance
farad: {
name: 'farad',
base: BASE_UNITS.ELECTRIC_CAPACITANCE,
prefixes: PREFIXES.LONG,
value: 1,
offset: 0
},
F: {
name: 'F',
base: BASE_UNITS.ELECTRIC_CAPACITANCE,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0
},
// Electric potential
volt: {
name: 'volt',
base: BASE_UNITS.ELECTRIC_POTENTIAL,
prefixes: PREFIXES.LONG,
value: 1,
offset: 0
},
V: {
name: 'V',
base: BASE_UNITS.ELECTRIC_POTENTIAL,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0
},
// Electric resistance
ohm: {
name: 'ohm',
base: BASE_UNITS.ELECTRIC_RESISTANCE,
prefixes: PREFIXES.SHORTLONG,
// Both Mohm and megaohm are acceptable
value: 1,
offset: 0
},
/*
* Unicode breaks in browsers if charset is not specified
Ω: {
name: 'Ω',
base: BASE_UNITS.ELECTRIC_RESISTANCE,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0
},
*/
// Electric inductance
henry: {
name: 'henry',
base: BASE_UNITS.ELECTRIC_INDUCTANCE,
prefixes: PREFIXES.LONG,
value: 1,
offset: 0
},
H: {
name: 'H',
base: BASE_UNITS.ELECTRIC_INDUCTANCE,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0
},
// Electric conductance
siemens: {
name: 'siemens',
base: BASE_UNITS.ELECTRIC_CONDUCTANCE,
prefixes: PREFIXES.LONG,
value: 1,
offset: 0
},
S: {
name: 'S',
base: BASE_UNITS.ELECTRIC_CONDUCTANCE,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0
},
// Magnetic flux
weber: {
name: 'weber',
base: BASE_UNITS.MAGNETIC_FLUX,
prefixes: PREFIXES.LONG,
value: 1,
offset: 0
},
Wb: {
name: 'Wb',
base: BASE_UNITS.MAGNETIC_FLUX,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0
},
// Magnetic flux density
tesla: {
name: 'tesla',
base: BASE_UNITS.MAGNETIC_FLUX_DENSITY,
prefixes: PREFIXES.LONG,
value: 1,
offset: 0
},
T: {
name: 'T',
base: BASE_UNITS.MAGNETIC_FLUX_DENSITY,
prefixes: PREFIXES.SHORT,
value: 1,
offset: 0
},
// Binary
b: {
name: 'b',
base: BASE_UNITS.BIT,
prefixes: PREFIXES.BINARY_SHORT,
value: 1,
offset: 0
},
bits: {
name: 'bits',
base: BASE_UNITS.BIT,
prefixes: PREFIXES.BINARY_LONG,
value: 1,
offset: 0
},
B: {
name: 'B',
base: BASE_UNITS.BIT,
prefixes: PREFIXES.BINARY_SHORT,
value: 8,
offset: 0
},
bytes: {
name: 'bytes',
base: BASE_UNITS.BIT,
prefixes: PREFIXES.BINARY_LONG,
value: 8,
offset: 0
}
}; // aliases (formerly plurals)
var ALIASES = {
meters: 'meter',
inches: 'inch',
feet: 'foot',
yards: 'yard',
miles: 'mile',
links: 'link',
rods: 'rod',
chains: 'chain',
angstroms: 'angstrom',
lt: 'l',
litres: 'litre',
liter: 'litre',
liters: 'litre',
teaspoons: 'teaspoon',
tablespoons: 'tablespoon',
minims: 'minim',
fluiddrams: 'fluiddram',
fluidounces: 'fluidounce',
gills: 'gill',
cups: 'cup',
pints: 'pint',
quarts: 'quart',
gallons: 'gallon',
beerbarrels: 'beerbarrel',
oilbarrels: 'oilbarrel',
hogsheads: 'hogshead',
gtts: 'gtt',
grams: 'gram',
tons: 'ton',
tonnes: 'tonne',
grains: 'grain',
drams: 'dram',
ounces: 'ounce',
poundmasses: 'poundmass',
hundredweights: 'hundredweight',
sticks: 'stick',
lb: 'lbm',
lbs: 'lbm',
kips: 'kip',
acres: 'acre',
hectares: 'hectare',
sqfeet: 'sqft',
sqyard: 'sqyd',
sqmile: 'sqmi',
sqmiles: 'sqmi',
mmhg: 'mmHg',
mmh2o: 'mmH2O',
cmh2o: 'cmH2O',
seconds: 'second',
secs: 'second',
minutes: 'minute',
mins: 'minute',
hours: 'hour',
hr: 'hour',
hrs: 'hour',
days: 'day',
weeks: 'week',
months: 'month',
years: 'year',
decades: 'decade',
centuries: 'century',
millennia: 'millennium',
hertz: 'hertz',
radians: 'radian',
degrees: 'degree',
gradians: 'gradian',
cycles: 'cycle',
arcsecond: 'arcsec',
arcseconds: 'arcsec',
arcminute: 'arcmin',
arcminutes: 'arcmin',
BTUs: 'BTU',
watts: 'watt',
joules: 'joule',
amperes: 'ampere',
coulombs: 'coulomb',
volts: 'volt',
ohms: 'ohm',
farads: 'farad',
webers: 'weber',
teslas: 'tesla',
electronvolts: 'electronvolt',
moles: 'mole',
bit: 'bits',
"byte": 'bytes'
};
/**
* Calculate the values for the angle units.
* Value is calculated as number or BigNumber depending on the configuration
* @param {{number: 'number' | 'BigNumber'}} config
*/
function calculateAngleValues(config) {
if (config.number === 'BigNumber') {
var pi = createBigNumberPi(_BigNumber);
UNITS.rad.value = new _BigNumber(1);
UNITS.deg.value = pi.div(180); // 2 * pi / 360
UNITS.grad.value = pi.div(200); // 2 * pi / 400
UNITS.cycle.value = pi.times(2); // 2 * pi
UNITS.arcsec.value = pi.div(648000); // 2 * pi / 360 / 3600
UNITS.arcmin.value = pi.div(10800); // 2 * pi / 360 / 60
} else {
// number
UNITS.rad.value = 1;
UNITS.deg.value = Math.PI / 180; // 2 * pi / 360
UNITS.grad.value = Math.PI / 200; // 2 * pi / 400
UNITS.cycle.value = Math.PI * 2; // 2 * pi
UNITS.arcsec.value = Math.PI / 648000; // 2 * pi / 360 / 3600
UNITS.arcmin.value = Math.PI / 10800; // 2 * pi / 360 / 60
} // copy to the full names of the angles
UNITS.radian.value = UNITS.rad.value;
UNITS.degree.value = UNITS.deg.value;
UNITS.gradian.value = UNITS.grad.value;
} // apply the angle values now
calculateAngleValues(config);
if (on) {
// recalculate the values on change of configuration
on('config', function (curr, prev) {
if (curr.number !== prev.number) {
calculateAngleValues(curr);
}
});
}
/**
* A unit system is a set of dimensionally independent base units plus a set of derived units, formed by multiplication and division of the base units, that are by convention used with the unit system.
* A user perhaps could issue a command to select a preferred unit system, or use the default (see below).
* Auto unit system: The default unit system is updated on the fly anytime a unit is parsed. The corresponding unit in the default unit system is updated, so that answers are given in the same units the user supplies.
*/
var UNIT_SYSTEMS = {
si: {
// Base units
NONE: {
unit: UNIT_NONE,
prefix: PREFIXES.NONE['']
},
LENGTH: {
unit: UNITS.m,
prefix: PREFIXES.SHORT['']
},
MASS: {
unit: UNITS.g,
prefix: PREFIXES.SHORT.k
},
TIME: {
unit: UNITS.s,
prefix: PREFIXES.SHORT['']
},
CURRENT: {
unit: UNITS.A,
prefix: PREFIXES.SHORT['']
},
TEMPERATURE: {
unit: UNITS.K,
prefix: PREFIXES.SHORT['']
},
LUMINOUS_INTENSITY: {
unit: UNITS.cd,
prefix: PREFIXES.SHORT['']
},
AMOUNT_OF_SUBSTANCE: {
unit: UNITS.mol,
prefix: PREFIXES.SHORT['']
},
ANGLE: {
unit: UNITS.rad,
prefix: PREFIXES.SHORT['']
},
BIT: {
unit: UNITS.bits,
prefix: PREFIXES.SHORT['']
},
// Derived units
FORCE: {
unit: UNITS.N,
prefix: PREFIXES.SHORT['']
},
ENERGY: {
unit: UNITS.J,
prefix: PREFIXES.SHORT['']
},
POWER: {
unit: UNITS.W,
prefix: PREFIXES.SHORT['']
},
PRESSURE: {
unit: UNITS.Pa,
prefix: PREFIXES.SHORT['']
},
ELECTRIC_CHARGE: {
unit: UNITS.C,
prefix: PREFIXES.SHORT['']
},
ELECTRIC_CAPACITANCE: {
unit: UNITS.F,
prefix: PREFIXES.SHORT['']
},
ELECTRIC_POTENTIAL: {
unit: UNITS.V,
prefix: PREFIXES.SHORT['']
},
ELECTRIC_RESISTANCE: {
unit: UNITS.ohm,
prefix: PREFIXES.SHORT['']
},
ELECTRIC_INDUCTANCE: {
unit: UNITS.H,
prefix: PREFIXES.SHORT['']
},
ELECTRIC_CONDUCTANCE: {
unit: UNITS.S,
prefix: PREFIXES.SHORT['']
},
MAGNETIC_FLUX: {
unit: UNITS.Wb,
prefix: PREFIXES.SHORT['']
},
MAGNETIC_FLUX_DENSITY: {
unit: UNITS.T,
prefix: PREFIXES.SHORT['']
},
FREQUENCY: {
unit: UNITS.Hz,
prefix: PREFIXES.SHORT['']
}
}
}; // Clone to create the other unit systems
UNIT_SYSTEMS.cgs = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si));
UNIT_SYSTEMS.cgs.LENGTH = {
unit: UNITS.m,
prefix: PREFIXES.SHORT.c
};
UNIT_SYSTEMS.cgs.MASS = {
unit: UNITS.g,
prefix: PREFIXES.SHORT['']
};
UNIT_SYSTEMS.cgs.FORCE = {
unit: UNITS.dyn,
prefix: PREFIXES.SHORT['']
};
UNIT_SYSTEMS.cgs.ENERGY = {
unit: UNITS.erg,
prefix: PREFIXES.NONE['']
}; // there are wholly 4 unique cgs systems for electricity and magnetism,
// so let's not worry about it unless somebody complains
UNIT_SYSTEMS.us = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si));
UNIT_SYSTEMS.us.LENGTH = {
unit: UNITS.ft,
prefix: PREFIXES.NONE['']
};
UNIT_SYSTEMS.us.MASS = {
unit: UNITS.lbm,
prefix: PREFIXES.NONE['']
};
UNIT_SYSTEMS.us.TEMPERATURE = {
unit: UNITS.degF,
prefix: PREFIXES.NONE['']
};
UNIT_SYSTEMS.us.FORCE = {
unit: UNITS.lbf,
prefix: PREFIXES.NONE['']
};
UNIT_SYSTEMS.us.ENERGY = {
unit: UNITS.BTU,
prefix: PREFIXES.BTU['']
};
UNIT_SYSTEMS.us.POWER = {
unit: UNITS.hp,
prefix: PREFIXES.NONE['']
};
UNIT_SYSTEMS.us.PRESSURE = {
unit: UNITS.psi,
prefix: PREFIXES.NONE['']
}; // Add additional unit systems here.
// Choose a unit system to seed the auto unit system.
UNIT_SYSTEMS.auto = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si)); // Set the current unit system
var currentUnitSystem = UNIT_SYSTEMS.auto;
/**
* Set a unit system for formatting derived units.
* @param {string} [name] The name of the unit system.
*/
Unit.setUnitSystem = function (name) {
if (Object(utils_object["f" /* hasOwnProperty */])(UNIT_SYSTEMS, name)) {
currentUnitSystem = UNIT_SYSTEMS[name];
} else {
throw new Error('Unit system ' + name + ' does not exist. Choices are: ' + Object.keys(UNIT_SYSTEMS).join(', '));
}
};
/**
* Return the current unit system.
* @return {string} The current unit system.
*/
Unit.getUnitSystem = function () {
for (var _key in UNIT_SYSTEMS) {
if (Object(utils_object["f" /* hasOwnProperty */])(UNIT_SYSTEMS, _key)) {
if (UNIT_SYSTEMS[_key] === currentUnitSystem) {
return _key;
}
}
}
};
/**
* Converters to convert from number to an other numeric type like BigNumber
* or Fraction
*/
Unit.typeConverters = {
BigNumber: function BigNumber(x) {
return new _BigNumber(x + ''); // stringify to prevent constructor error
},
Fraction: function Fraction(x) {
return new _Fraction(x);
},
Complex: function Complex(x) {
return x;
},
number: function number(x) {
return x;
}
};
/**
* Retrieve the right convertor function corresponding with the type
* of provided exampleValue.
*
* @param {string} type A string 'number', 'BigNumber', or 'Fraction'
* In case of an unknown type,
* @return {Function}
*/
Unit._getNumberConverter = function (type) {
if (!Unit.typeConverters[type]) {
throw new TypeError('Unsupported type "' + type + '"');
}
return Unit.typeConverters[type];
}; // Add dimensions to each built-in unit
for (var _key2 in UNITS) {
if (Object(utils_object["f" /* hasOwnProperty */])(UNITS, _key2)) {
var unit = UNITS[_key2];
unit.dimensions = unit.base.dimensions;
}
} // Create aliases
for (var _name2 in ALIASES) {
if (Object(utils_object["f" /* hasOwnProperty */])(ALIASES, _name2)) {
var _unit2 = UNITS[ALIASES[_name2]];
var alias = {};
for (var _key3 in _unit2) {
if (Object(utils_object["f" /* hasOwnProperty */])(_unit2, _key3)) {
alias[_key3] = _unit2[_key3];
}
}
alias.name = _name2;
UNITS[_name2] = alias;
}
}
function assertUnitNameIsValid(name) {
for (var i = 0; i < name.length; i++) {
var _c = name.charAt(i);
var isValidAlpha = function isValidAlpha(p) {
return /^[a-zA-Z]$/.test(p);
};
var _isDigit = function _isDigit(c) {
return c >= '0' && c <= '9';
};
if (i === 0 && !isValidAlpha(_c)) {
throw new Error('Invalid unit name (must begin with alpha character): "' + name + '"');
}
if (i > 0 && !(isValidAlpha(_c) || _isDigit(_c))) {
throw new Error('Invalid unit name (only alphanumeric characters are allowed): "' + name + '"');
}
}
}
/**
* Wrapper around createUnitSingle.
* Example:
* createUnit({
* foo: { },
* bar: {
* definition: 'kg/foo',
* aliases: ['ba', 'barr', 'bars'],
* offset: 200
* },
* baz: '4 bar'
* },
* {
* override: true
* })
* @param {object} obj Object map. Each key becomes a unit which is defined by its value.
* @param {object} options
*/
Unit.createUnit = function (obj, options) {
if (Unit_typeof(obj) !== 'object') {
throw new TypeError("createUnit expects first parameter to be of type 'Object'");
} // Remove all units and aliases we are overriding
if (options && options.override) {
for (var _key4 in obj) {
if (Object(utils_object["f" /* hasOwnProperty */])(obj, _key4)) {
Unit.deleteUnit(_key4);
}
if (obj[_key4].aliases) {
for (var i = 0; i < obj[_key4].aliases.length; i++) {
Unit.deleteUnit(obj[_key4].aliases[i]);
}
}
}
} // TODO: traverse multiple times until all units have been added
var lastUnit;
for (var _key5 in obj) {
if (Object(utils_object["f" /* hasOwnProperty */])(obj, _key5)) {
lastUnit = Unit.createUnitSingle(_key5, obj[_key5]);
}
}
return lastUnit;
};
/**
* Create a user-defined unit and register it with the Unit type.
* Example:
* createUnitSingle('knot', '0.514444444 m/s')
* createUnitSingle('acre', new Unit(43560, 'ft^2'))
*
* @param {string} name The name of the new unit. Must be unique. Example: 'knot'
* @param {string, Unit, Object} definition Definition of the unit in terms
* of existing units. For example, '0.514444444 m / s'. Can be a Unit, a string,
* or an Object. If an Object, may have the following properties:
* - definition {string|Unit} The definition of this unit.
* - prefixes {string} "none", "short", "long", "binary_short", or "binary_long".
* The default is "none".
* - aliases {Array} Array of strings. Example: ['knots', 'kt', 'kts']
* - offset {Numeric} An offset to apply when converting from the unit. For
* example, the offset for celsius is 273.15 and the offset for farhenheit
* is 459.67. Default is 0.
* - baseName {string} If the unit's dimension does not match that of any other
* base unit, the name of the newly create base unit. Otherwise, this property
* has no effect.
*
* @param {Object} options (optional) An object containing any of the following
* properties:
* - override {boolean} Whether this unit should be allowed to override existing
* units.
*
* @return {Unit}
*/
Unit.createUnitSingle = function (name, obj, options) {
if (typeof obj === 'undefined' || obj === null) {
obj = {};
}
if (typeof name !== 'string') {
throw new TypeError("createUnitSingle expects first parameter to be of type 'string'");
} // Check collisions with existing units
if (Object(utils_object["f" /* hasOwnProperty */])(UNITS, name)) {
throw new Error('Cannot create unit "' + name + '": a unit with that name already exists');
} // TODO: Validate name for collisions with other built-in functions (like abs or cos, for example), and for acceptable variable names. For example, '42' is probably not a valid unit. Nor is '%', since it is also an operator.
assertUnitNameIsValid(name);
var defUnit = null; // The Unit from which the new unit will be created.
var aliases = [];
var offset = 0;
var definition;
var prefixes;
var baseName;
if (obj && obj.type === 'Unit') {
defUnit = obj.clone();
} else if (typeof obj === 'string') {
if (obj !== '') {
definition = obj;
}
} else if (Unit_typeof(obj) === 'object') {
definition = obj.definition;
prefixes = obj.prefixes;
offset = obj.offset;
baseName = obj.baseName;
if (obj.aliases) {
aliases = obj.aliases.valueOf(); // aliases could be a Matrix, so convert to Array
}
} else {
throw new TypeError('Cannot create unit "' + name + '" from "' + obj.toString() + '": expecting "string" or "Unit" or "Object"');
}
if (aliases) {
for (var i = 0; i < aliases.length; i++) {
if (Object(utils_object["f" /* hasOwnProperty */])(UNITS, aliases[i])) {
throw new Error('Cannot create alias "' + aliases[i] + '": a unit with that name already exists');
}
}
}
if (definition && typeof definition === 'string' && !defUnit) {
try {
defUnit = Unit.parse(definition, {
allowNoUnits: true
});
} catch (ex) {
ex.message = 'Could not create unit "' + name + '" from "' + definition + '": ' + ex.message;
throw ex;
}
} else if (definition && definition.type === 'Unit') {
defUnit = definition.clone();
}
aliases = aliases || [];
offset = offset || 0;
if (prefixes && prefixes.toUpperCase) {
prefixes = PREFIXES[prefixes.toUpperCase()] || PREFIXES.NONE;
} else {
prefixes = PREFIXES.NONE;
} // If defUnit is null, it is because the user did not
// specify a defintion. So create a new base dimension.
var newUnit = {};
if (!defUnit) {
// Add a new base dimension
baseName = baseName || name + '_STUFF'; // foo --> foo_STUFF, or the essence of foo
if (BASE_DIMENSIONS.indexOf(baseName) >= 0) {
throw new Error('Cannot create new base unit "' + name + '": a base unit with that name already exists (and cannot be overridden)');
}
BASE_DIMENSIONS.push(baseName); // Push 0 onto existing base units
for (var b in BASE_UNITS) {
if (Object(utils_object["f" /* hasOwnProperty */])(BASE_UNITS, b)) {
BASE_UNITS[b].dimensions[BASE_DIMENSIONS.length - 1] = 0;
}
} // Add the new base unit
var newBaseUnit = {
dimensions: []
};
for (var _i6 = 0; _i6 < BASE_DIMENSIONS.length; _i6++) {
newBaseUnit.dimensions[_i6] = 0;
}
newBaseUnit.dimensions[BASE_DIMENSIONS.length - 1] = 1;
newBaseUnit.key = baseName;
BASE_UNITS[baseName] = newBaseUnit;
newUnit = {
name: name,
value: 1,
dimensions: BASE_UNITS[baseName].dimensions.slice(0),
prefixes: prefixes,
offset: offset,
base: BASE_UNITS[baseName]
};
currentUnitSystem[baseName] = {
unit: newUnit,
prefix: PREFIXES.NONE['']
};
} else {
newUnit = {
name: name,
value: defUnit.value,
dimensions: defUnit.dimensions.slice(0),
prefixes: prefixes,
offset: offset
}; // Create a new base if no matching base exists
var anyMatch = false;
for (var _i7 in BASE_UNITS) {
if (Object(utils_object["f" /* hasOwnProperty */])(BASE_UNITS, _i7)) {
var match = true;
for (var j = 0; j < BASE_DIMENSIONS.length; j++) {
if (Math.abs((newUnit.dimensions[j] || 0) - (BASE_UNITS[_i7].dimensions[j] || 0)) > 1e-12) {
match = false;
break;
}
}
if (match) {
anyMatch = true;
newUnit.base = BASE_UNITS[_i7];
break;
}
}
}
if (!anyMatch) {
baseName = baseName || name + '_STUFF'; // foo --> foo_STUFF, or the essence of foo
// Add the new base unit
var _newBaseUnit = {
dimensions: defUnit.dimensions.slice(0)
};
_newBaseUnit.key = baseName;
BASE_UNITS[baseName] = _newBaseUnit;
currentUnitSystem[baseName] = {
unit: newUnit,
prefix: PREFIXES.NONE['']
};
newUnit.base = BASE_UNITS[baseName];
}
}
Unit.UNITS[name] = newUnit;
for (var _i8 = 0; _i8 < aliases.length; _i8++) {
var aliasName = aliases[_i8];
var _alias = {};
for (var _key6 in newUnit) {
if (Object(utils_object["f" /* hasOwnProperty */])(newUnit, _key6)) {
_alias[_key6] = newUnit[_key6];
}
}
_alias.name = aliasName;
Unit.UNITS[aliasName] = _alias;
}
return new Unit(null, name);
};
Unit.deleteUnit = function (name) {
delete Unit.UNITS[name];
}; // expose arrays with prefixes, dimensions, units, systems
Unit.PREFIXES = PREFIXES;
Unit.BASE_DIMENSIONS = BASE_DIMENSIONS;
Unit.BASE_UNITS = BASE_UNITS;
Unit.UNIT_SYSTEMS = UNIT_SYSTEMS;
Unit.UNITS = UNITS;
return Unit;
}, {
isClass: true
});
// CONCATENATED MODULE: ./src/type/unit/function/unit.js
var unit_name = 'unit';
var unit_dependencies = ['typed', 'Unit']; // This function is named createUnitFunction to prevent a naming conflict with createUnit
var createUnitFunction = /* #__PURE__ */Object(factory["a" /* factory */])(unit_name, unit_dependencies, function (_ref) {
var typed = _ref.typed,
Unit = _ref.Unit;
/**
* Create a unit. Depending on the passed arguments, the function
* will create and return a new math.Unit object.
* When a matrix is provided, all elements will be converted to units.
*
* Syntax:
*
* math.unit(unit : string)
* math.unit(value : number, unit : string)
*
* Examples:
*
* const a = math.unit(5, 'cm') // returns Unit 50 mm
* const b = math.unit('23 kg') // returns Unit 23 kg
* a.to('m') // returns Unit 0.05 m
*
* See also:
*
* bignumber, boolean, complex, index, matrix, number, string, createUnit
*
* @param {* | Array | Matrix} args A number and unit.
* @return {Unit | Array | Matrix} The created unit
*/
return typed(unit_name, {
Unit: function Unit(x) {
return x.clone();
},
string: function string(x) {
if (Unit.isValuelessUnit(x)) {
return new Unit(null, x); // a pure unit
}
return Unit.parse(x, {
allowNoUnits: true
}); // a unit with value, like '5cm'
},
'number | BigNumber | Fraction | Complex, string': function numberBigNumberFractionComplexString(value, unit) {
return new Unit(value, unit);
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/type/matrix/function/sparse.js
var sparse_name = 'sparse';
var sparse_dependencies = ['typed', 'SparseMatrix'];
var createSparse = /* #__PURE__ */Object(factory["a" /* factory */])(sparse_name, sparse_dependencies, function (_ref) {
var typed = _ref.typed,
SparseMatrix = _ref.SparseMatrix;
/**
* Create a Sparse Matrix. The function creates a new `math.Matrix` object from
* an `Array`. A Matrix has utility functions to manipulate the data in the
* matrix, like getting the size and getting or setting values in the matrix.
*
* Syntax:
*
* math.sparse() // creates an empty sparse matrix.
* math.sparse(data) // creates a sparse matrix with initial data.
* math.sparse(data, 'number') // creates a sparse matrix with initial data, number datatype.
*
* Examples:
*
* let m = math.sparse([[1, 2], [3, 4]])
* m.size() // Array [2, 2]
* m.resize([3, 2], 5)
* m.valueOf() // Array [[1, 2], [3, 4], [5, 5]]
* m.get([1, 0]) // number 3
*
* See also:
*
* bignumber, boolean, complex, index, number, string, unit, matrix
*
* @param {Array | Matrix} [data] A two dimensional array
*
* @return {Matrix} The created matrix
*/
return typed(sparse_name, {
'': function _() {
return new SparseMatrix([]);
},
string: function string(datatype) {
return new SparseMatrix([], datatype);
},
'Array | Matrix': function ArrayMatrix(data) {
return new SparseMatrix(data);
},
'Array | Matrix, string': function ArrayMatrixString(data, datatype) {
return new SparseMatrix(data, datatype);
}
});
});
// CONCATENATED MODULE: ./src/type/unit/function/createUnit.js
var createUnit_name = 'createUnit';
var createUnit_dependencies = ['typed', 'Unit'];
var createCreateUnit = /* #__PURE__ */Object(factory["a" /* factory */])(createUnit_name, createUnit_dependencies, function (_ref) {
var typed = _ref.typed,
Unit = _ref.Unit;
/**
* Create a user-defined unit and register it with the Unit type.
*
* Syntax:
*
* math.createUnit({
* baseUnit1: {
* aliases: [string, ...]
* prefixes: object
* },
* unit2: {
* definition: string,
* aliases: [string, ...]
* prefixes: object,
* offset: number
* },
* unit3: string // Shortcut
* })
*
* // Another shortcut:
* math.createUnit(string, unit : string, [object])
*
* Examples:
*
* math.createUnit('foo')
* math.createUnit('knot', {definition: '0.514444444 m/s', aliases: ['knots', 'kt', 'kts']})
* math.createUnit('mph', '1 mile/hour')
*
* @param {string} name The name of the new unit. Must be unique. Example: 'knot'
* @param {string, Unit} definition Definition of the unit in terms of existing units. For example, '0.514444444 m / s'.
* @param {Object} options (optional) An object containing any of the following properties:
* - `prefixes {string}` "none", "short", "long", "binary_short", or "binary_long". The default is "none".
* - `aliases {Array}` Array of strings. Example: ['knots', 'kt', 'kts']
* - `offset {Numeric}` An offset to apply when converting from the unit. For example, the offset for celsius is 273.15. Default is 0.
*
* See also:
*
* unit
*
* @return {Unit} The new unit
*/
return typed(createUnit_name, {
// General function signature. First parameter is an object where each property is the definition of a new unit. The object keys are the unit names and the values are the definitions. The values can be objects, strings, or Units. If a property is an empty object or an empty string, a new base unit is created. The second parameter is the options.
'Object, Object': function ObjectObject(obj, options) {
return Unit.createUnit(obj, options);
},
// Same as above but without the options.
Object: function Object(obj) {
return Unit.createUnit(obj, {});
},
// Shortcut method for creating one unit.
'string, Unit | string | Object, Object': function stringUnitStringObjectObject(name, def, options) {
var obj = {};
obj[name] = def;
return Unit.createUnit(obj, options);
},
// Same as above but without the options.
'string, Unit | string | Object': function stringUnitStringObject(name, def) {
var obj = {};
obj[name] = def;
return Unit.createUnit(obj, {});
},
// Without a definition, creates a base unit.
string: function string(name) {
var obj = {};
obj[name] = {};
return Unit.createUnit(obj, {});
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/acos.js
var acos_name = 'acos';
var acos_dependencies = ['typed', 'config', 'Complex'];
var createAcos = /* #__PURE__ */Object(factory["a" /* factory */])(acos_name, acos_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
Complex = _ref.Complex;
/**
* Calculate the inverse cosine of a value.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.acos(x)
*
* Examples:
*
* math.acos(0.5) // returns number 1.0471975511965979
* math.acos(math.cos(1.5)) // returns number 1.5
*
* math.acos(2) // returns Complex 0 + 1.3169578969248166 i
*
* See also:
*
* cos, atan, asin
*
* @param {number | BigNumber | Complex | Array | Matrix} x Function input
* @return {number | BigNumber | Complex | Array | Matrix} The arc cosine of x
*/
return typed(acos_name, {
number: function number(x) {
if (x >= -1 && x <= 1 || config.predictable) {
return Math.acos(x);
} else {
return new Complex(x, 0).acos();
}
},
Complex: function Complex(x) {
return x.acos();
},
BigNumber: function BigNumber(x) {
return x.acos();
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/plain/number/trigonometry.js
var trigonometry_n1 = 'number';
var trigonometry_n2 = 'number, number';
function acosNumber(x) {
return Math.acos(x);
}
acosNumber.signature = trigonometry_n1;
function acoshNumber(x) {
return Object(utils_number["a" /* acosh */])(x);
}
acoshNumber.signature = trigonometry_n1;
function acotNumber(x) {
return Math.atan(1 / x);
}
acotNumber.signature = trigonometry_n1;
function acothNumber(x) {
return isFinite(x) ? (Math.log((x + 1) / x) + Math.log(x / (x - 1))) / 2 : 0;
}
acothNumber.signature = trigonometry_n1;
function acscNumber(x) {
return Math.asin(1 / x);
}
acscNumber.signature = trigonometry_n1;
function acschNumber(x) {
var xInv = 1 / x;
return Math.log(xInv + Math.sqrt(xInv * xInv + 1));
}
acschNumber.signature = trigonometry_n1;
function asecNumber(x) {
return Math.acos(1 / x);
}
asecNumber.signature = trigonometry_n1;
function asechNumber(x) {
var xInv = 1 / x;
var ret = Math.sqrt(xInv * xInv - 1);
return Math.log(ret + xInv);
}
asechNumber.signature = trigonometry_n1;
function asinNumber(x) {
return Math.asin(x);
}
asinNumber.signature = trigonometry_n1;
function asinhNumber(x) {
return Object(utils_number["b" /* asinh */])(x);
}
asinhNumber.signature = trigonometry_n1;
function atanNumber(x) {
return Math.atan(x);
}
atanNumber.signature = trigonometry_n1;
function atan2Number(y, x) {
return Math.atan2(y, x);
}
atan2Number.signature = trigonometry_n2;
function atanhNumber(x) {
return Object(utils_number["c" /* atanh */])(x);
}
atanhNumber.signature = trigonometry_n1;
function cosNumber(x) {
return Math.cos(x);
}
cosNumber.signature = trigonometry_n1;
function coshNumber(x) {
return Object(utils_number["e" /* cosh */])(x);
}
coshNumber.signature = trigonometry_n1;
function cotNumber(x) {
return 1 / Math.tan(x);
}
cotNumber.signature = trigonometry_n1;
function cothNumber(x) {
var e = Math.exp(2 * x);
return (e + 1) / (e - 1);
}
cothNumber.signature = trigonometry_n1;
function cscNumber(x) {
return 1 / Math.sin(x);
}
cscNumber.signature = trigonometry_n1;
function cschNumber(x) {
// consider values close to zero (+/-)
if (x === 0) {
return Number.POSITIVE_INFINITY;
} else {
return Math.abs(2 / (Math.exp(x) - Math.exp(-x))) * Object(utils_number["n" /* sign */])(x);
}
}
cschNumber.signature = trigonometry_n1;
function secNumber(x) {
return 1 / Math.cos(x);
}
secNumber.signature = trigonometry_n1;
function sechNumber(x) {
return 2 / (Math.exp(x) + Math.exp(-x));
}
sechNumber.signature = trigonometry_n1;
function sinNumber(x) {
return Math.sin(x);
}
sinNumber.signature = trigonometry_n1;
function sinhNumber(x) {
return Object(utils_number["o" /* sinh */])(x);
}
sinhNumber.signature = trigonometry_n1;
function tanNumber(x) {
return Math.tan(x);
}
tanNumber.signature = trigonometry_n1;
function tanhNumber(x) {
return Object(utils_number["p" /* tanh */])(x);
}
tanhNumber.signature = trigonometry_n1;
// CONCATENATED MODULE: ./src/function/trigonometry/acosh.js
var acosh_name = 'acosh';
var acosh_dependencies = ['typed', 'config', 'Complex'];
var createAcosh = /* #__PURE__ */Object(factory["a" /* factory */])(acosh_name, acosh_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
Complex = _ref.Complex;
/**
* Calculate the hyperbolic arccos of a value,
* defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.acosh(x)
*
* Examples:
*
* math.acosh(1.5) // returns 0.9624236501192069
*
* See also:
*
* cosh, asinh, atanh
*
* @param {number | Complex | Unit | Array | Matrix} x Function input
* @return {number | Complex | Array | Matrix} Hyperbolic arccosine of x
*/
return typed(acosh_name, {
number: function number(x) {
if (x >= 1 || config.predictable) {
return acoshNumber(x);
}
if (x <= -1) {
return new Complex(Math.log(Math.sqrt(x * x - 1) - x), Math.PI);
}
return new Complex(x, 0).acosh();
},
Complex: function Complex(x) {
return x.acosh();
},
BigNumber: function BigNumber(x) {
return x.acosh();
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/acot.js
var acot_name = 'acot';
var acot_dependencies = ['typed', 'BigNumber'];
var createAcot = /* #__PURE__ */Object(factory["a" /* factory */])(acot_name, acot_dependencies, function (_ref) {
var typed = _ref.typed,
_BigNumber = _ref.BigNumber;
/**
* Calculate the inverse cotangent of a value, defined as `acot(x) = atan(1/x)`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.acot(x)
*
* Examples:
*
* math.acot(0.5) // returns number 0.4636476090008061
* math.acot(math.cot(1.5)) // returns number 1.5
*
* math.acot(2) // returns Complex 1.5707963267948966 -1.3169578969248166 i
*
* See also:
*
* cot, atan
*
* @param {number | Complex | Array | Matrix} x Function input
* @return {number | Complex | Array | Matrix} The arc cotangent of x
*/
return typed(acot_name, {
number: acotNumber,
Complex: function Complex(x) {
return x.acot();
},
BigNumber: function BigNumber(x) {
return new _BigNumber(1).div(x).atan();
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/acoth.js
var acoth_name = 'acoth';
var acoth_dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
var createAcoth = /* #__PURE__ */Object(factory["a" /* factory */])(acoth_name, acoth_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
Complex = _ref.Complex,
_BigNumber = _ref.BigNumber;
/**
* Calculate the hyperbolic arccotangent of a value,
* defined as `acoth(x) = atanh(1/x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.acoth(x)
*
* Examples:
*
* math.acoth(0.5) // returns 0.8047189562170503
*
* See also:
*
* acsch, asech
*
* @param {number | Complex | Array | Matrix} x Function input
* @return {number | Complex | Array | Matrix} Hyperbolic arccotangent of x
*/
return typed(acoth_name, {
number: function number(x) {
if (x >= 1 || x <= -1 || config.predictable) {
return acothNumber(x);
}
return new Complex(x, 0).acoth();
},
Complex: function Complex(x) {
return x.acoth();
},
BigNumber: function BigNumber(x) {
return new _BigNumber(1).div(x).atanh();
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/acsc.js
var acsc_name = 'acsc';
var acsc_dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
var createAcsc = /* #__PURE__ */Object(factory["a" /* factory */])(acsc_name, acsc_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
Complex = _ref.Complex,
_BigNumber = _ref.BigNumber;
/**
* Calculate the inverse cosecant of a value, defined as `acsc(x) = asin(1/x)`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.acsc(x)
*
* Examples:
*
* math.acsc(0.5) // returns number 0.5235987755982989
* math.acsc(math.csc(1.5)) // returns number ~1.5
*
* math.acsc(2) // returns Complex 1.5707963267948966 -1.3169578969248166 i
*
* See also:
*
* csc, asin, asec
*
* @param {number | Complex | Array | Matrix} x Function input
* @return {number | Complex | Array | Matrix} The arc cosecant of x
*/
return typed(acsc_name, {
number: function number(x) {
if (x <= -1 || x >= 1 || config.predictable) {
return acscNumber(x);
}
return new Complex(x, 0).acsc();
},
Complex: function Complex(x) {
return x.acsc();
},
BigNumber: function BigNumber(x) {
return new _BigNumber(1).div(x).asin();
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/acsch.js
var acsch_name = 'acsch';
var acsch_dependencies = ['typed', 'BigNumber'];
var createAcsch = /* #__PURE__ */Object(factory["a" /* factory */])(acsch_name, acsch_dependencies, function (_ref) {
var typed = _ref.typed,
_BigNumber = _ref.BigNumber;
/**
* Calculate the hyperbolic arccosecant of a value,
* defined as `acsch(x) = asinh(1/x) = ln(1/x + sqrt(1/x^2 + 1))`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.acsch(x)
*
* Examples:
*
* math.acsch(0.5) // returns 1.4436354751788103
*
* See also:
*
* asech, acoth
*
* @param {number | Complex | Array | Matrix} x Function input
* @return {number | Complex | Array | Matrix} Hyperbolic arccosecant of x
*/
return typed(acsch_name, {
number: acschNumber,
Complex: function Complex(x) {
return x.acsch();
},
BigNumber: function BigNumber(x) {
return new _BigNumber(1).div(x).asinh();
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/asec.js
var asec_name = 'asec';
var asec_dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
var createAsec = /* #__PURE__ */Object(factory["a" /* factory */])(asec_name, asec_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
Complex = _ref.Complex,
_BigNumber = _ref.BigNumber;
/**
* Calculate the inverse secant of a value. Defined as `asec(x) = acos(1/x)`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.asec(x)
*
* Examples:
*
* math.asec(0.5) // returns 1.0471975511965979
* math.asec(math.sec(1.5)) // returns 1.5
*
* math.asec(2) // returns 0 + 1.3169578969248166 i
*
* See also:
*
* acos, acot, acsc
*
* @param {number | Complex | Array | Matrix} x Function input
* @return {number | Complex | Array | Matrix} The arc secant of x
*/
return typed(asec_name, {
number: function number(x) {
if (x <= -1 || x >= 1 || config.predictable) {
return asecNumber(x);
}
return new Complex(x, 0).asec();
},
Complex: function Complex(x) {
return x.asec();
},
BigNumber: function BigNumber(x) {
return new _BigNumber(1).div(x).acos();
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/asech.js
var asech_name = 'asech';
var asech_dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
var createAsech = /* #__PURE__ */Object(factory["a" /* factory */])(asech_name, asech_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
Complex = _ref.Complex,
_BigNumber = _ref.BigNumber;
/**
* Calculate the hyperbolic arcsecant of a value,
* defined as `asech(x) = acosh(1/x) = ln(sqrt(1/x^2 - 1) + 1/x)`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.asech(x)
*
* Examples:
*
* math.asech(0.5) // returns 1.3169578969248166
*
* See also:
*
* acsch, acoth
*
* @param {number | Complex | Array | Matrix} x Function input
* @return {number | Complex | Array | Matrix} Hyperbolic arcsecant of x
*/
return typed(asech_name, {
number: function number(x) {
if (x <= 1 && x >= -1 || config.predictable) {
var xInv = 1 / x;
if (xInv > 0 || config.predictable) {
return asechNumber(x);
}
var ret = Math.sqrt(xInv * xInv - 1);
return new Complex(Math.log(ret - xInv), Math.PI);
}
return new Complex(x, 0).asech();
},
Complex: function Complex(x) {
return x.asech();
},
BigNumber: function BigNumber(x) {
return new _BigNumber(1).div(x).acosh();
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/asin.js
var asin_name = 'asin';
var asin_dependencies = ['typed', 'config', 'Complex'];
var createAsin = /* #__PURE__ */Object(factory["a" /* factory */])(asin_name, asin_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
Complex = _ref.Complex;
/**
* Calculate the inverse sine of a value.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.asin(x)
*
* Examples:
*
* math.asin(0.5) // returns number 0.5235987755982989
* math.asin(math.sin(1.5)) // returns number ~1.5
*
* math.asin(2) // returns Complex 1.5707963267948966 -1.3169578969248166 i
*
* See also:
*
* sin, atan, acos
*
* @param {number | BigNumber | Complex | Array | Matrix} x Function input
* @return {number | BigNumber | Complex | Array | Matrix} The arc sine of x
*/
return typed(asin_name, {
number: function number(x) {
if (x >= -1 && x <= 1 || config.predictable) {
return Math.asin(x);
} else {
return new Complex(x, 0).asin();
}
},
Complex: function Complex(x) {
return x.asin();
},
BigNumber: function BigNumber(x) {
return x.asin();
},
'Array | Matrix': function ArrayMatrix(x) {
// deep map collection, skip zeros since asin(0) = 0
return deepMap(x, this, true);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/asinh.js
var asinh_name = 'asinh';
var asinh_dependencies = ['typed'];
var createAsinh = /* #__PURE__ */Object(factory["a" /* factory */])(asinh_name, asinh_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Calculate the hyperbolic arcsine of a value,
* defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.asinh(x)
*
* Examples:
*
* math.asinh(0.5) // returns 0.48121182505960347
*
* See also:
*
* acosh, atanh
*
* @param {number | Complex | Array | Matrix} x Function input
* @return {number | Complex | Array | Matrix} Hyperbolic arcsine of x
*/
return typed('asinh', {
number: asinhNumber,
Complex: function Complex(x) {
return x.asinh();
},
BigNumber: function BigNumber(x) {
return x.asinh();
},
'Array | Matrix': function ArrayMatrix(x) {
// deep map collection, skip zeros since asinh(0) = 0
return deepMap(x, this, true);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/atan.js
var atan_name = 'atan';
var atan_dependencies = ['typed'];
var createAtan = /* #__PURE__ */Object(factory["a" /* factory */])(atan_name, atan_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Calculate the inverse tangent of a value.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.atan(x)
*
* Examples:
*
* math.atan(0.5) // returns number 0.4636476090008061
* math.atan(math.tan(1.5)) // returns number 1.5
*
* math.atan(2) // returns Complex 1.5707963267948966 -1.3169578969248166 i
*
* See also:
*
* tan, asin, acos
*
* @param {number | BigNumber | Complex | Array | Matrix} x Function input
* @return {number | BigNumber | Complex | Array | Matrix} The arc tangent of x
*/
return typed('atan', {
number: function number(x) {
return Math.atan(x);
},
Complex: function Complex(x) {
return x.atan();
},
BigNumber: function BigNumber(x) {
return x.atan();
},
'Array | Matrix': function ArrayMatrix(x) {
// deep map collection, skip zeros since atan(0) = 0
return deepMap(x, this, true);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/atan2.js
var atan2_name = 'atan2';
var atan2_dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'DenseMatrix'];
var createAtan2 = /* #__PURE__ */Object(factory["a" /* factory */])(atan2_name, atan2_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
equalScalar = _ref.equalScalar,
BigNumber = _ref.BigNumber,
DenseMatrix = _ref.DenseMatrix;
var algorithm02 = createAlgorithm02({
typed: typed,
equalScalar: equalScalar
});
var algorithm03 = createAlgorithm03({
typed: typed
});
var algorithm09 = createAlgorithm09({
typed: typed,
equalScalar: equalScalar
});
var algorithm11 = createAlgorithm11({
typed: typed,
equalScalar: equalScalar
});
var algorithm12 = createAlgorithm12({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Calculate the inverse tangent function with two arguments, y/x.
* By providing two arguments, the right quadrant of the computed angle can be
* determined.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.atan2(y, x)
*
* Examples:
*
* math.atan2(2, 2) / math.pi // returns number 0.25
*
* const angle = math.unit(60, 'deg') // returns Unit 60 deg
* const x = math.cos(angle)
* const y = math.sin(angle)
*
* math.atan(2) // returns Complex 1.5707963267948966 -1.3169578969248166 i
*
* See also:
*
* tan, atan, sin, cos
*
* @param {number | Array | Matrix} y Second dimension
* @param {number | Array | Matrix} x First dimension
* @return {number | Array | Matrix} Four-quadrant inverse tangent
*/
return typed(atan2_name, {
'number, number': Math.atan2,
// Complex numbers doesn't seem to have a reasonable implementation of
// atan2(). Even Matlab removed the support, after they only calculated
// the atan only on base of the real part of the numbers and ignored the imaginary.
'BigNumber, BigNumber': function BigNumberBigNumber(y, x) {
return BigNumber.atan2(y, x);
},
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm09(x, y, this, false);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
// mind the order of y and x!
return algorithm02(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm03(x, y, this, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
return this(x, matrix(y));
},
'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
return algorithm11(x, y, this, false);
},
'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
return algorithm14(x, y, this, false);
},
'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
// mind the order of y and x
return algorithm12(y, x, this, true);
},
'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
// mind the order of y and x
return algorithm14(y, x, this, true);
},
'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
return algorithm14(matrix(x), y, this, false).valueOf();
},
'number | BigNumber, Array': function numberBigNumberArray(x, y) {
return algorithm14(matrix(y), x, this, true).valueOf();
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/atanh.js
var atanh_name = 'atanh';
var atanh_dependencies = ['typed', 'config', 'Complex'];
var createAtanh = /* #__PURE__ */Object(factory["a" /* factory */])(atanh_name, atanh_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
Complex = _ref.Complex;
/**
* Calculate the hyperbolic arctangent of a value,
* defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.atanh(x)
*
* Examples:
*
* math.atanh(0.5) // returns 0.5493061443340549
*
* See also:
*
* acosh, asinh
*
* @param {number | Complex | Array | Matrix} x Function input
* @return {number | Complex | Array | Matrix} Hyperbolic arctangent of x
*/
return typed(atanh_name, {
number: function number(x) {
if (x <= 1 && x >= -1 || config.predictable) {
return atanhNumber(x);
}
return new Complex(x, 0).atanh();
},
Complex: function Complex(x) {
return x.atanh();
},
BigNumber: function BigNumber(x) {
return x.atanh();
},
'Array | Matrix': function ArrayMatrix(x) {
// deep map collection, skip zeros since atanh(0) = 0
return deepMap(x, this, true);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/cos.js
var cos_name = 'cos';
var cos_dependencies = ['typed'];
var createCos = /* #__PURE__ */Object(factory["a" /* factory */])(cos_name, cos_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Calculate the cosine of a value.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.cos(x)
*
* Examples:
*
* math.cos(2) // returns number -0.4161468365471422
* math.cos(math.pi / 4) // returns number 0.7071067811865475
* math.cos(math.unit(180, 'deg')) // returns number -1
* math.cos(math.unit(60, 'deg')) // returns number 0.5
*
* const angle = 0.2
* math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number ~1
*
* See also:
*
* cos, tan
*
* @param {number | BigNumber | Complex | Unit | Array | Matrix} x Function input
* @return {number | BigNumber | Complex | Array | Matrix} Cosine of x
*/
return typed(cos_name, {
number: Math.cos,
Complex: function Complex(x) {
return x.cos();
},
BigNumber: function BigNumber(x) {
return x.cos();
},
Unit: function Unit(x) {
if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
throw new TypeError('Unit in function cos is no angle');
}
return this(x.value);
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/cosh.js
var cosh_name = 'cosh';
var cosh_dependencies = ['typed'];
var createCosh = /* #__PURE__ */Object(factory["a" /* factory */])(cosh_name, cosh_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Calculate the hyperbolic cosine of a value,
* defined as `cosh(x) = 1/2 * (exp(x) + exp(-x))`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.cosh(x)
*
* Examples:
*
* math.cosh(0.5) // returns number 1.1276259652063807
*
* See also:
*
* sinh, tanh
*
* @param {number | BigNumber | Complex | Unit | Array | Matrix} x Function input
* @return {number | BigNumber | Complex | Array | Matrix} Hyperbolic cosine of x
*/
return typed(cosh_name, {
number: utils_number["e" /* cosh */],
Complex: function Complex(x) {
return x.cosh();
},
BigNumber: function BigNumber(x) {
return x.cosh();
},
Unit: function Unit(x) {
if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
throw new TypeError('Unit in function cosh is no angle');
}
return this(x.value);
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/cot.js
var cot_name = 'cot';
var cot_dependencies = ['typed', 'BigNumber'];
var createCot = /* #__PURE__ */Object(factory["a" /* factory */])(cot_name, cot_dependencies, function (_ref) {
var typed = _ref.typed,
_BigNumber = _ref.BigNumber;
/**
* Calculate the cotangent of a value. Defined as `cot(x) = 1 / tan(x)`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.cot(x)
*
* Examples:
*
* math.cot(2) // returns number -0.45765755436028577
* 1 / math.tan(2) // returns number -0.45765755436028577
*
* See also:
*
* tan, sec, csc
*
* @param {number | Complex | Unit | Array | Matrix} x Function input
* @return {number | Complex | Array | Matrix} Cotangent of x
*/
return typed(cot_name, {
number: cotNumber,
Complex: function Complex(x) {
return x.cot();
},
BigNumber: function BigNumber(x) {
return new _BigNumber(1).div(x.tan());
},
Unit: function Unit(x) {
if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
throw new TypeError('Unit in function cot is no angle');
}
return this(x.value);
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/coth.js
var coth_name = 'coth';
var coth_dependencies = ['typed', 'BigNumber'];
var createCoth = /* #__PURE__ */Object(factory["a" /* factory */])(coth_name, coth_dependencies, function (_ref) {
var typed = _ref.typed,
_BigNumber = _ref.BigNumber;
/**
* Calculate the hyperbolic cotangent of a value,
* defined as `coth(x) = 1 / tanh(x)`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.coth(x)
*
* Examples:
*
* // coth(x) = 1 / tanh(x)
* math.coth(2) // returns 1.0373147207275482
* 1 / math.tanh(2) // returns 1.0373147207275482
*
* See also:
*
* sinh, tanh, cosh
*
* @param {number | Complex | Unit | Array | Matrix} x Function input
* @return {number | Complex | Array | Matrix} Hyperbolic cotangent of x
*/
return typed(coth_name, {
number: cothNumber,
Complex: function Complex(x) {
return x.coth();
},
BigNumber: function BigNumber(x) {
return new _BigNumber(1).div(x.tanh());
},
Unit: function Unit(x) {
if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
throw new TypeError('Unit in function coth is no angle');
}
return this(x.value);
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/csc.js
var csc_name = 'csc';
var csc_dependencies = ['typed', 'BigNumber'];
var createCsc = /* #__PURE__ */Object(factory["a" /* factory */])(csc_name, csc_dependencies, function (_ref) {
var typed = _ref.typed,
_BigNumber = _ref.BigNumber;
/**
* Calculate the cosecant of a value, defined as `csc(x) = 1/sin(x)`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.csc(x)
*
* Examples:
*
* math.csc(2) // returns number 1.099750170294617
* 1 / math.sin(2) // returns number 1.099750170294617
*
* See also:
*
* sin, sec, cot
*
* @param {number | Complex | Unit | Array | Matrix} x Function input
* @return {number | Complex | Array | Matrix} Cosecant of x
*/
return typed(csc_name, {
number: cscNumber,
Complex: function Complex(x) {
return x.csc();
},
BigNumber: function BigNumber(x) {
return new _BigNumber(1).div(x.sin());
},
Unit: function Unit(x) {
if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
throw new TypeError('Unit in function csc is no angle');
}
return this(x.value);
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/csch.js
var csch_name = 'csch';
var csch_dependencies = ['typed', 'BigNumber'];
var createCsch = /* #__PURE__ */Object(factory["a" /* factory */])(csch_name, csch_dependencies, function (_ref) {
var typed = _ref.typed,
_BigNumber = _ref.BigNumber;
/**
* Calculate the hyperbolic cosecant of a value,
* defined as `csch(x) = 1 / sinh(x)`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.csch(x)
*
* Examples:
*
* // csch(x) = 1/ sinh(x)
* math.csch(0.5) // returns 1.9190347513349437
* 1 / math.sinh(0.5) // returns 1.9190347513349437
*
* See also:
*
* sinh, sech, coth
*
* @param {number | Complex | Unit | Array | Matrix} x Function input
* @return {number | Complex | Array | Matrix} Hyperbolic cosecant of x
*/
return typed(csch_name, {
number: cschNumber,
Complex: function Complex(x) {
return x.csch();
},
BigNumber: function BigNumber(x) {
return new _BigNumber(1).div(x.sinh());
},
Unit: function Unit(x) {
if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
throw new TypeError('Unit in function csch is no angle');
}
return this(x.value);
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/sec.js
var sec_name = 'sec';
var sec_dependencies = ['typed', 'BigNumber'];
var createSec = /* #__PURE__ */Object(factory["a" /* factory */])(sec_name, sec_dependencies, function (_ref) {
var typed = _ref.typed,
_BigNumber = _ref.BigNumber;
/**
* Calculate the secant of a value, defined as `sec(x) = 1/cos(x)`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.sec(x)
*
* Examples:
*
* math.sec(2) // returns number -2.4029979617223822
* 1 / math.cos(2) // returns number -2.4029979617223822
*
* See also:
*
* cos, csc, cot
*
* @param {number | Complex | Unit | Array | Matrix} x Function input
* @return {number | Complex | Array | Matrix} Secant of x
*/
return typed(sec_name, {
number: secNumber,
Complex: function Complex(x) {
return x.sec();
},
BigNumber: function BigNumber(x) {
return new _BigNumber(1).div(x.cos());
},
Unit: function Unit(x) {
if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
throw new TypeError('Unit in function sec is no angle');
}
return this(x.value);
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/sech.js
var sech_name = 'sech';
var sech_dependencies = ['typed', 'BigNumber'];
var createSech = /* #__PURE__ */Object(factory["a" /* factory */])(sech_name, sech_dependencies, function (_ref) {
var typed = _ref.typed,
_BigNumber = _ref.BigNumber;
/**
* Calculate the hyperbolic secant of a value,
* defined as `sech(x) = 1 / cosh(x)`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.sech(x)
*
* Examples:
*
* // sech(x) = 1/ cosh(x)
* math.sech(0.5) // returns 0.886818883970074
* 1 / math.cosh(0.5) // returns 0.886818883970074
*
* See also:
*
* cosh, csch, coth
*
* @param {number | Complex | Unit | Array | Matrix} x Function input
* @return {number | Complex | Array | Matrix} Hyperbolic secant of x
*/
return typed(sech_name, {
number: sechNumber,
Complex: function Complex(x) {
return x.sech();
},
BigNumber: function BigNumber(x) {
return new _BigNumber(1).div(x.cosh());
},
Unit: function Unit(x) {
if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
throw new TypeError('Unit in function sech is no angle');
}
return this(x.value);
},
'Array | Matrix': function ArrayMatrix(x) {
return deepMap(x, this);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/sin.js
var sin_name = 'sin';
var sin_dependencies = ['typed'];
var createSin = /* #__PURE__ */Object(factory["a" /* factory */])(sin_name, sin_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Calculate the sine of a value.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.sin(x)
*
* Examples:
*
* math.sin(2) // returns number 0.9092974268256813
* math.sin(math.pi / 4) // returns number 0.7071067811865475
* math.sin(math.unit(90, 'deg')) // returns number 1
* math.sin(math.unit(30, 'deg')) // returns number 0.5
*
* const angle = 0.2
* math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number ~1
*
* See also:
*
* cos, tan
*
* @param {number | BigNumber | Complex | Unit | Array | Matrix} x Function input
* @return {number | BigNumber | Complex | Array | Matrix} Sine of x
*/
return typed(sin_name, {
number: Math.sin,
Complex: function Complex(x) {
return x.sin();
},
BigNumber: function BigNumber(x) {
return x.sin();
},
Unit: function Unit(x) {
if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
throw new TypeError('Unit in function sin is no angle');
}
return this(x.value);
},
'Array | Matrix': function ArrayMatrix(x) {
// deep map collection, skip zeros since sin(0) = 0
return deepMap(x, this, true);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/sinh.js
var sinh_name = 'sinh';
var sinh_dependencies = ['typed'];
var createSinh = /* #__PURE__ */Object(factory["a" /* factory */])(sinh_name, sinh_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Calculate the hyperbolic sine of a value,
* defined as `sinh(x) = 1/2 * (exp(x) - exp(-x))`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.sinh(x)
*
* Examples:
*
* math.sinh(0.5) // returns number 0.5210953054937474
*
* See also:
*
* cosh, tanh
*
* @param {number | BigNumber | Complex | Unit | Array | Matrix} x Function input
* @return {number | BigNumber | Complex | Array | Matrix} Hyperbolic sine of x
*/
return typed(sinh_name, {
number: sinhNumber,
Complex: function Complex(x) {
return x.sinh();
},
BigNumber: function BigNumber(x) {
return x.sinh();
},
Unit: function Unit(x) {
if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
throw new TypeError('Unit in function sinh is no angle');
}
return this(x.value);
},
'Array | Matrix': function ArrayMatrix(x) {
// deep map collection, skip zeros since sinh(0) = 0
return deepMap(x, this, true);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/tan.js
var tan_name = 'tan';
var tan_dependencies = ['typed'];
var createTan = /* #__PURE__ */Object(factory["a" /* factory */])(tan_name, tan_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Calculate the tangent of a value. `tan(x)` is equal to `sin(x) / cos(x)`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.tan(x)
*
* Examples:
*
* math.tan(0.5) // returns number 0.5463024898437905
* math.sin(0.5) / math.cos(0.5) // returns number 0.5463024898437905
* math.tan(math.pi / 4) // returns number 1
* math.tan(math.unit(45, 'deg')) // returns number 1
*
* See also:
*
* atan, sin, cos
*
* @param {number | BigNumber | Complex | Unit | Array | Matrix} x Function input
* @return {number | BigNumber | Complex | Array | Matrix} Tangent of x
*/
return typed(tan_name, {
number: Math.tan,
Complex: function Complex(x) {
return x.tan();
},
BigNumber: function BigNumber(x) {
return x.tan();
},
Unit: function Unit(x) {
if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
throw new TypeError('Unit in function tan is no angle');
}
return this(x.value);
},
'Array | Matrix': function ArrayMatrix(x) {
// deep map collection, skip zeros since tan(0) = 0
return deepMap(x, this, true);
}
});
});
// CONCATENATED MODULE: ./src/function/trigonometry/tanh.js
var tanh_name = 'tanh';
var tanh_dependencies = ['typed'];
var createTanh = /* #__PURE__ */Object(factory["a" /* factory */])(tanh_name, tanh_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Calculate the hyperbolic tangent of a value,
* defined as `tanh(x) = (exp(2 * x) - 1) / (exp(2 * x) + 1)`.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.tanh(x)
*
* Examples:
*
* // tanh(x) = sinh(x) / cosh(x) = 1 / coth(x)
* math.tanh(0.5) // returns 0.46211715726000974
* math.sinh(0.5) / math.cosh(0.5) // returns 0.46211715726000974
* 1 / math.coth(0.5) // returns 0.46211715726000974
*
* See also:
*
* sinh, cosh, coth
*
* @param {number | BigNumber | Complex | Unit | Array | Matrix} x Function input
* @return {number | BigNumber | Complex | Array | Matrix} Hyperbolic tangent of x
*/
return typed('tanh', {
number: utils_number["p" /* tanh */],
Complex: function Complex(x) {
return x.tanh();
},
BigNumber: function BigNumber(x) {
return x.tanh();
},
Unit: function Unit(x) {
if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
throw new TypeError('Unit in function tanh is no angle');
}
return this(x.value);
},
'Array | Matrix': function ArrayMatrix(x) {
// deep map collection, skip zeros since tanh(0) = 0
return deepMap(x, this, true);
}
});
});
// CONCATENATED MODULE: ./src/function/set/setCartesian.js
var setCartesian_name = 'setCartesian';
var setCartesian_dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
var createSetCartesian = /* #__PURE__ */Object(factory["a" /* factory */])(setCartesian_name, setCartesian_dependencies, function (_ref) {
var typed = _ref.typed,
size = _ref.size,
subset = _ref.subset,
compareNatural = _ref.compareNatural,
Index = _ref.Index,
DenseMatrix = _ref.DenseMatrix;
/**
* Create the cartesian product of two (multi)sets.
* Multi-dimension arrays will be converted to single-dimension arrays before the operation.
*
* Syntax:
*
* math.setCartesian(set1, set2)
*
* Examples:
*
* math.setCartesian([1, 2], [3, 4]) // returns [[1, 3], [1, 4], [2, 3], [2, 4]]
*
* See also:
*
* setUnion, setIntersect, setDifference, setPowerset
*
* @param {Array | Matrix} a1 A (multi)set
* @param {Array | Matrix} a2 A (multi)set
* @return {Array | Matrix} The cartesian product of two (multi)sets
*/
return typed(setCartesian_name, {
'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {
var result = [];
if (subset(size(a1), new Index(0)) !== 0 && subset(size(a2), new Index(0)) !== 0) {
// if any of them is empty, return empty
var b1 = Object(utils_array["e" /* flatten */])(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural);
var b2 = Object(utils_array["e" /* flatten */])(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural);
result = [];
for (var i = 0; i < b1.length; i++) {
for (var j = 0; j < b2.length; j++) {
result.push([b1[i], b2[j]]);
}
}
} // return an array, if both inputs were arrays
if (Array.isArray(a1) && Array.isArray(a2)) {
return result;
} // return a matrix otherwise
return new DenseMatrix(result);
}
});
});
// CONCATENATED MODULE: ./src/function/set/setDifference.js
var setDifference_name = 'setDifference';
var setDifference_dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
var createSetDifference = /* #__PURE__ */Object(factory["a" /* factory */])(setDifference_name, setDifference_dependencies, function (_ref) {
var typed = _ref.typed,
size = _ref.size,
subset = _ref.subset,
compareNatural = _ref.compareNatural,
Index = _ref.Index,
DenseMatrix = _ref.DenseMatrix;
/**
* Create the difference of two (multi)sets: every element of set1, that is not the element of set2.
* Multi-dimension arrays will be converted to single-dimension arrays before the operation.
*
* Syntax:
*
* math.setDifference(set1, set2)
*
* Examples:
*
* math.setDifference([1, 2, 3, 4], [3, 4, 5, 6]) // returns [1, 2]
* math.setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]]) // returns [1, 2]
*
* See also:
*
* setUnion, setIntersect, setSymDifference
*
* @param {Array | Matrix} a1 A (multi)set
* @param {Array | Matrix} a2 A (multi)set
* @return {Array | Matrix} The difference of two (multi)sets
*/
return typed(setDifference_name, {
'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {
var result;
if (subset(size(a1), new Index(0)) === 0) {
// empty-anything=empty
result = [];
} else if (subset(size(a2), new Index(0)) === 0) {
// anything-empty=anything
return Object(utils_array["e" /* flatten */])(a1.toArray());
} else {
var b1 = Object(utils_array["i" /* identify */])(Object(utils_array["e" /* flatten */])(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));
var b2 = Object(utils_array["i" /* identify */])(Object(utils_array["e" /* flatten */])(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));
result = [];
var inb2;
for (var i = 0; i < b1.length; i++) {
inb2 = false;
for (var j = 0; j < b2.length; j++) {
if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {
// the identifier is always a decimal int
inb2 = true;
break;
}
}
if (!inb2) {
result.push(b1[i]);
}
}
} // return an array, if both inputs were arrays
if (Array.isArray(a1) && Array.isArray(a2)) {
return Object(utils_array["g" /* generalize */])(result);
} // return a matrix otherwise
return new DenseMatrix(Object(utils_array["g" /* generalize */])(result));
}
});
});
// CONCATENATED MODULE: ./src/function/set/setDistinct.js
var setDistinct_name = 'setDistinct';
var setDistinct_dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
var createSetDistinct = /* #__PURE__ */Object(factory["a" /* factory */])(setDistinct_name, setDistinct_dependencies, function (_ref) {
var typed = _ref.typed,
size = _ref.size,
subset = _ref.subset,
compareNatural = _ref.compareNatural,
Index = _ref.Index,
DenseMatrix = _ref.DenseMatrix;
/**
* Collect the distinct elements of a multiset.
* A multi-dimension array will be converted to a single-dimension array before the operation.
*
* Syntax:
*
* math.setDistinct(set)
*
* Examples:
*
* math.setDistinct([1, 1, 1, 2, 2, 3]) // returns [1, 2, 3]
*
* See also:
*
* setMultiplicity
*
* @param {Array | Matrix} a A multiset
* @return {Array | Matrix} A set containing the distinc elements of the multiset
*/
return typed(setDistinct_name, {
'Array | Matrix': function ArrayMatrix(a) {
var result;
if (subset(size(a), new Index(0)) === 0) {
// if empty, return empty
result = [];
} else {
var b = Object(utils_array["e" /* flatten */])(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);
result = [];
result.push(b[0]);
for (var i = 1; i < b.length; i++) {
if (compareNatural(b[i], b[i - 1]) !== 0) {
result.push(b[i]);
}
}
} // return an array, if the input was an array
if (Array.isArray(a)) {
return result;
} // return a matrix otherwise
return new DenseMatrix(result);
}
});
});
// CONCATENATED MODULE: ./src/function/set/setIntersect.js
var setIntersect_name = 'setIntersect';
var setIntersect_dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
var createSetIntersect = /* #__PURE__ */Object(factory["a" /* factory */])(setIntersect_name, setIntersect_dependencies, function (_ref) {
var typed = _ref.typed,
size = _ref.size,
subset = _ref.subset,
compareNatural = _ref.compareNatural,
Index = _ref.Index,
DenseMatrix = _ref.DenseMatrix;
/**
* Create the intersection of two (multi)sets.
* Multi-dimension arrays will be converted to single-dimension arrays before the operation.
*
* Syntax:
*
* math.setIntersect(set1, set2)
*
* Examples:
*
* math.setIntersect([1, 2, 3, 4], [3, 4, 5, 6]) // returns [3, 4]
* math.setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]]) // returns [3, 4]
*
* See also:
*
* setUnion, setDifference
*
* @param {Array | Matrix} a1 A (multi)set
* @param {Array | Matrix} a2 A (multi)set
* @return {Array | Matrix} The intersection of two (multi)sets
*/
return typed(setIntersect_name, {
'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {
var result;
if (subset(size(a1), new Index(0)) === 0 || subset(size(a2), new Index(0)) === 0) {
// of any of them is empty, return empty
result = [];
} else {
var b1 = Object(utils_array["i" /* identify */])(Object(utils_array["e" /* flatten */])(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));
var b2 = Object(utils_array["i" /* identify */])(Object(utils_array["e" /* flatten */])(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));
result = [];
for (var i = 0; i < b1.length; i++) {
for (var j = 0; j < b2.length; j++) {
if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {
// the identifier is always a decimal int
result.push(b1[i]);
break;
}
}
}
} // return an array, if both inputs were arrays
if (Array.isArray(a1) && Array.isArray(a2)) {
return Object(utils_array["g" /* generalize */])(result);
} // return a matrix otherwise
return new DenseMatrix(Object(utils_array["g" /* generalize */])(result));
}
});
});
// CONCATENATED MODULE: ./src/function/set/setIsSubset.js
var setIsSubset_name = 'setIsSubset';
var setIsSubset_dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];
var createSetIsSubset = /* #__PURE__ */Object(factory["a" /* factory */])(setIsSubset_name, setIsSubset_dependencies, function (_ref) {
var typed = _ref.typed,
size = _ref.size,
subset = _ref.subset,
compareNatural = _ref.compareNatural,
Index = _ref.Index;
/**
* Check whether a (multi)set is a subset of another (multi)set. (Every element of set1 is the element of set2.)
* Multi-dimension arrays will be converted to single-dimension arrays before the operation.
*
* Syntax:
*
* math.setIsSubset(set1, set2)
*
* Examples:
*
* math.setIsSubset([1, 2], [3, 4, 5, 6]) // returns false
* math.setIsSubset([3, 4], [3, 4, 5, 6]) // returns true
*
* See also:
*
* setUnion, setIntersect, setDifference
*
* @param {Array | Matrix} a1 A (multi)set
* @param {Array | Matrix} a2 A (multi)set
* @return {boolean} true | false
*/
return typed(setIsSubset_name, {
'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {
if (subset(size(a1), new Index(0)) === 0) {
// empty is a subset of anything
return true;
} else if (subset(size(a2), new Index(0)) === 0) {
// anything is not a subset of empty
return false;
}
var b1 = Object(utils_array["i" /* identify */])(Object(utils_array["e" /* flatten */])(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));
var b2 = Object(utils_array["i" /* identify */])(Object(utils_array["e" /* flatten */])(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));
var inb2;
for (var i = 0; i < b1.length; i++) {
inb2 = false;
for (var j = 0; j < b2.length; j++) {
if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {
// the identifier is always a decimal int
inb2 = true;
break;
}
}
if (inb2 === false) {
return false;
}
}
return true;
}
});
});
// CONCATENATED MODULE: ./src/function/set/setMultiplicity.js
var setMultiplicity_name = 'setMultiplicity';
var setMultiplicity_dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];
var createSetMultiplicity = /* #__PURE__ */Object(factory["a" /* factory */])(setMultiplicity_name, setMultiplicity_dependencies, function (_ref) {
var typed = _ref.typed,
size = _ref.size,
subset = _ref.subset,
compareNatural = _ref.compareNatural,
Index = _ref.Index;
/**
* Count the multiplicity of an element in a multiset.
* A multi-dimension array will be converted to a single-dimension array before the operation.
*
* Syntax:
*
* math.setMultiplicity(element, set)
*
* Examples:
*
* math.setMultiplicity(1, [1, 2, 2, 4]) // returns 1
* math.setMultiplicity(2, [1, 2, 2, 4]) // returns 2
*
* See also:
*
* setDistinct, setSize
*
* @param {number | BigNumber | Fraction | Complex} e An element in the multiset
* @param {Array | Matrix} a A multiset
* @return {number} The number of how many times the multiset contains the element
*/
return typed(setMultiplicity_name, {
'number | BigNumber | Fraction | Complex, Array | Matrix': function numberBigNumberFractionComplexArrayMatrix(e, a) {
if (subset(size(a), new Index(0)) === 0) {
// if empty, return 0
return 0;
}
var b = Object(utils_array["e" /* flatten */])(Array.isArray(a) ? a : a.toArray());
var count = 0;
for (var i = 0; i < b.length; i++) {
if (compareNatural(b[i], e) === 0) {
count++;
}
}
return count;
}
});
});
// CONCATENATED MODULE: ./src/function/set/setPowerset.js
var setPowerset_name = 'setPowerset';
var setPowerset_dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];
var createSetPowerset = /* #__PURE__ */Object(factory["a" /* factory */])(setPowerset_name, setPowerset_dependencies, function (_ref) {
var typed = _ref.typed,
size = _ref.size,
subset = _ref.subset,
compareNatural = _ref.compareNatural,
Index = _ref.Index;
/**
* Create the powerset of a (multi)set. (The powerset contains very possible subsets of a (multi)set.)
* A multi-dimension array will be converted to a single-dimension array before the operation.
*
* Syntax:
*
* math.setPowerset(set)
*
* Examples:
*
* math.setPowerset([1, 2, 3]) // returns [[], [1], [2], [3], [1, 2], [1, 3], [2, 3], [1, 2, 3]]
*
* See also:
*
* setCartesian
*
* @param {Array | Matrix} a A (multi)set
* @return {Array} The powerset of the (multi)set
*/
return typed(setPowerset_name, {
'Array | Matrix': function ArrayMatrix(a) {
if (subset(size(a), new Index(0)) === 0) {
// if empty, return empty
return [];
}
var b = Object(utils_array["e" /* flatten */])(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);
var result = [];
var number = 0;
while (number.toString(2).length <= b.length) {
result.push(_subset(b, number.toString(2).split('').reverse()));
number++;
} // can not return a matrix, because of the different size of the subarrays
return _sort(result);
}
}); // create subset
function _subset(array, bitarray) {
var result = [];
for (var i = 0; i < bitarray.length; i++) {
if (bitarray[i] === '1') {
result.push(array[i]);
}
}
return result;
} // sort subsests by length
function _sort(array) {
var temp = [];
for (var i = array.length - 1; i > 0; i--) {
for (var j = 0; j < i; j++) {
if (array[j].length > array[j + 1].length) {
temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
}
}
}
return array;
}
});
// CONCATENATED MODULE: ./src/function/set/setSize.js
var setSize_name = 'setSize';
var setSize_dependencies = ['typed', 'compareNatural'];
var createSetSize = /* #__PURE__ */Object(factory["a" /* factory */])(setSize_name, setSize_dependencies, function (_ref) {
var typed = _ref.typed,
compareNatural = _ref.compareNatural;
/**
* Count the number of elements of a (multi)set. When a second parameter is 'true', count only the unique values.
* A multi-dimension array will be converted to a single-dimension array before the operation.
*
* Syntax:
*
* math.setSize(set)
* math.setSize(set, unique)
*
* Examples:
*
* math.setSize([1, 2, 2, 4]) // returns 4
* math.setSize([1, 2, 2, 4], true) // returns 3
*
* See also:
*
* setUnion, setIntersect, setDifference
*
* @param {Array | Matrix} a A multiset
* @return {number} The number of elements of the (multi)set
*/
return typed(setSize_name, {
'Array | Matrix': function ArrayMatrix(a) {
return Array.isArray(a) ? Object(utils_array["e" /* flatten */])(a).length : Object(utils_array["e" /* flatten */])(a.toArray()).length;
},
'Array | Matrix, boolean': function ArrayMatrixBoolean(a, unique) {
if (unique === false || a.length === 0) {
return Array.isArray(a) ? Object(utils_array["e" /* flatten */])(a).length : Object(utils_array["e" /* flatten */])(a.toArray()).length;
} else {
var b = Object(utils_array["e" /* flatten */])(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);
var count = 1;
for (var i = 1; i < b.length; i++) {
if (compareNatural(b[i], b[i - 1]) !== 0) {
count++;
}
}
return count;
}
}
});
});
// CONCATENATED MODULE: ./src/function/set/setSymDifference.js
var setSymDifference_name = 'setSymDifference';
var setSymDifference_dependencies = ['typed', 'size', 'concat', 'subset', 'setDifference', 'Index'];
var createSetSymDifference = /* #__PURE__ */Object(factory["a" /* factory */])(setSymDifference_name, setSymDifference_dependencies, function (_ref) {
var typed = _ref.typed,
size = _ref.size,
concat = _ref.concat,
subset = _ref.subset,
setDifference = _ref.setDifference,
Index = _ref.Index;
/**
* Create the symmetric difference of two (multi)sets.
* Multi-dimension arrays will be converted to single-dimension arrays before the operation.
*
* Syntax:
*
* math.setSymDifference(set1, set2)
*
* Examples:
*
* math.setSymDifference([1, 2, 3, 4], [3, 4, 5, 6]) // returns [1, 2, 5, 6]
* math.setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]]) // returns [1, 2, 5, 6]
*
* See also:
*
* setUnion, setIntersect, setDifference
*
* @param {Array | Matrix} a1 A (multi)set
* @param {Array | Matrix} a2 A (multi)set
* @return {Array | Matrix} The symmetric difference of two (multi)sets
*/
return typed(setSymDifference_name, {
'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {
if (subset(size(a1), new Index(0)) === 0) {
// if any of them is empty, return the other one
return Object(utils_array["e" /* flatten */])(a2);
} else if (subset(size(a2), new Index(0)) === 0) {
return Object(utils_array["e" /* flatten */])(a1);
}
var b1 = Object(utils_array["e" /* flatten */])(a1);
var b2 = Object(utils_array["e" /* flatten */])(a2);
return concat(setDifference(b1, b2), setDifference(b2, b1));
}
});
});
// CONCATENATED MODULE: ./src/function/set/setUnion.js
var setUnion_name = 'setUnion';
var setUnion_dependencies = ['typed', 'size', 'concat', 'subset', 'setIntersect', 'setSymDifference', 'Index'];
var createSetUnion = /* #__PURE__ */Object(factory["a" /* factory */])(setUnion_name, setUnion_dependencies, function (_ref) {
var typed = _ref.typed,
size = _ref.size,
concat = _ref.concat,
subset = _ref.subset,
setIntersect = _ref.setIntersect,
setSymDifference = _ref.setSymDifference,
Index = _ref.Index;
/**
* Create the union of two (multi)sets.
* Multi-dimension arrays will be converted to single-dimension arrays before the operation.
*
* Syntax:
*
* math.setUnion(set1, set2)
*
* Examples:
*
* math.setUnion([1, 2, 3, 4], [3, 4, 5, 6]) // returns [1, 2, 3, 4, 5, 6]
* math.setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]]) // returns [1, 2, 3, 4, 5, 6]
*
* See also:
*
* setIntersect, setDifference
*
* @param {Array | Matrix} a1 A (multi)set
* @param {Array | Matrix} a2 A (multi)set
* @return {Array | Matrix} The union of two (multi)sets
*/
return typed(setUnion_name, {
'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {
if (subset(size(a1), new Index(0)) === 0) {
// if any of them is empty, return the other one
return Object(utils_array["e" /* flatten */])(a2);
} else if (subset(size(a2), new Index(0)) === 0) {
return Object(utils_array["e" /* flatten */])(a1);
}
var b1 = Object(utils_array["e" /* flatten */])(a1);
var b2 = Object(utils_array["e" /* flatten */])(a2);
return concat(setSymDifference(b1, b2), setIntersect(b1, b2));
}
});
});
// CONCATENATED MODULE: ./src/function/arithmetic/add.js
var add_name = 'add';
var add_dependencies = ['typed', 'matrix', 'addScalar', 'equalScalar', 'DenseMatrix', 'SparseMatrix'];
var createAdd = /* #__PURE__ */Object(factory["a" /* factory */])(add_name, add_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
addScalar = _ref.addScalar,
equalScalar = _ref.equalScalar,
DenseMatrix = _ref.DenseMatrix,
SparseMatrix = _ref.SparseMatrix;
var algorithm01 = createAlgorithm01({
typed: typed
});
var algorithm04 = createAlgorithm04({
typed: typed,
equalScalar: equalScalar
});
var algorithm10 = createAlgorithm10({
typed: typed,
DenseMatrix: DenseMatrix
});
var algorithm13 = createAlgorithm13({
typed: typed
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Add two or more values, `x + y`.
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.add(x, y)
* math.add(x, y, z, ...)
*
* Examples:
*
* math.add(2, 3) // returns number 5
* math.add(2, 3, 4) // returns number 9
*
* const a = math.complex(2, 3)
* const b = math.complex(-4, 1)
* math.add(a, b) // returns Complex -2 + 4i
*
* math.add([1, 2, 3], 4) // returns Array [5, 6, 7]
*
* const c = math.unit('5 cm')
* const d = math.unit('2.1 mm')
* math.add(c, d) // returns Unit 52.1 mm
*
* math.add("2.3", "4") // returns number 6.3
*
* See also:
*
* subtract, sum
*
* @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First value to add
* @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second value to add
* @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Sum of `x` and `y`
*/
return typed(add_name, Object(utils_object["e" /* extend */])({
// we extend the signatures of addScalar with signatures dealing with matrices
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, addScalar);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm01(x, y, addScalar, false);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm01(y, x, addScalar, true);
},
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm04(x, y, addScalar);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, addScalar, false);
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
return algorithm10(x, y, addScalar, false);
},
'any, DenseMatrix': function anyDenseMatrix(x, y) {
return algorithm14(y, x, addScalar, true);
},
'any, SparseMatrix': function anySparseMatrix(x, y) {
return algorithm10(y, x, addScalar, true);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, addScalar, false).valueOf();
},
'any, Array': function anyArray(x, y) {
// use matrix implementation
return algorithm14(matrix(y), x, addScalar, true).valueOf();
},
'any, any': addScalar,
'any, any, ...any': function anyAnyAny(x, y, rest) {
var result = this(x, y);
for (var i = 0; i < rest.length; i++) {
result = this(result, rest[i]);
}
return result;
}
}, addScalar.signatures));
});
// CONCATENATED MODULE: ./src/function/arithmetic/hypot.js
var hypot_name = 'hypot';
var hypot_dependencies = ['typed', 'abs', 'addScalar', 'divideScalar', 'multiplyScalar', 'sqrt', 'smaller', 'isPositive'];
var createHypot = /* #__PURE__ */Object(factory["a" /* factory */])(hypot_name, hypot_dependencies, function (_ref) {
var typed = _ref.typed,
abs = _ref.abs,
addScalar = _ref.addScalar,
divideScalar = _ref.divideScalar,
multiplyScalar = _ref.multiplyScalar,
sqrt = _ref.sqrt,
smaller = _ref.smaller,
isPositive = _ref.isPositive;
/**
* Calculate the hypotenusa of a list with values. The hypotenusa is defined as:
*
* hypot(a, b, c, ...) = sqrt(a^2 + b^2 + c^2 + ...)
*
* For matrix input, the hypotenusa is calculated for all values in the matrix.
*
* Syntax:
*
* math.hypot(a, b, ...)
* math.hypot([a, b, c, ...])
*
* Examples:
*
* math.hypot(3, 4) // 5
* math.hypot(3, 4, 5) // 7.0710678118654755
* math.hypot([3, 4, 5]) // 7.0710678118654755
* math.hypot(-2) // 2
*
* See also:
*
* abs, norm
*
* @param {... number | BigNumber | Array | Matrix} args A list with numeric values or an Array or Matrix.
* Matrix and Array input is flattened and returns a
* single number for the whole matrix.
* @return {number | BigNumber} Returns the hypothenusa of the input values.
*/
return typed(hypot_name, {
'... number | BigNumber': _hypot,
Array: function Array(x) {
return this.apply(this, Object(utils_array["e" /* flatten */])(x));
},
Matrix: function Matrix(x) {
return this.apply(this, Object(utils_array["e" /* flatten */])(x.toArray()));
}
});
/**
* Calculate the hypotenusa for an Array with values
* @param {Array.<number | BigNumber>} args
* @return {number | BigNumber} Returns the result
* @private
*/
function _hypot(args) {
// code based on `hypot` from es6-shim:
// https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1619-L1633
var result = 0;
var largest = 0;
for (var i = 0; i < args.length; i++) {
var value = abs(args[i]);
if (smaller(largest, value)) {
result = multiplyScalar(result, multiplyScalar(divideScalar(largest, value), divideScalar(largest, value)));
result = addScalar(result, 1);
largest = value;
} else {
result = addScalar(result, isPositive(value) ? multiplyScalar(divideScalar(value, largest), divideScalar(value, largest)) : value);
}
}
return multiplyScalar(largest, sqrt(result));
}
});
// CONCATENATED MODULE: ./src/function/arithmetic/norm.js
var norm_name = 'norm';
var norm_dependencies = ['typed', 'abs', 'add', 'pow', 'conj', 'sqrt', 'multiply', 'equalScalar', 'larger', 'smaller', 'matrix'];
var createNorm = /* #__PURE__ */Object(factory["a" /* factory */])(norm_name, norm_dependencies, function (_ref) {
var typed = _ref.typed,
abs = _ref.abs,
add = _ref.add,
pow = _ref.pow,
conj = _ref.conj,
sqrt = _ref.sqrt,
multiply = _ref.multiply,
equalScalar = _ref.equalScalar,
larger = _ref.larger,
smaller = _ref.smaller,
matrix = _ref.matrix;
/**
* Calculate the norm of a number, vector or matrix.
*
* The second parameter p is optional. If not provided, it defaults to 2.
*
* Syntax:
*
* math.norm(x)
* math.norm(x, p)
*
* Examples:
*
* math.abs(-3.5) // returns 3.5
* math.norm(-3.5) // returns 3.5
*
* math.norm(math.complex(3, -4)) // returns 5
*
* math.norm([1, 2, -3], Infinity) // returns 3
* math.norm([1, 2, -3], -Infinity) // returns 1
*
* math.norm([3, 4], 2) // returns 5
*
* math.norm([[1, 2], [3, 4]], 1) // returns 6
* math.norm([[1, 2], [3, 4]], 'inf') // returns 7
* math.norm([[1, 2], [3, 4]], 'fro') // returns 5.477225575051661
*
* See also:
*
* abs, hypot
*
* @param {number | BigNumber | Complex | Array | Matrix} x
* Value for which to calculate the norm
* @param {number | BigNumber | string} [p=2]
* Vector space.
* Supported numbers include Infinity and -Infinity.
* Supported strings are: 'inf', '-inf', and 'fro' (The Frobenius norm)
* @return {number | BigNumber} the p-norm
*/
return typed(norm_name, {
number: Math.abs,
Complex: function Complex(x) {
return x.abs();
},
BigNumber: function BigNumber(x) {
// norm(x) = abs(x)
return x.abs();
},
"boolean": function boolean(x) {
// norm(x) = abs(x)
return Math.abs(x);
},
Array: function Array(x) {
return _norm(matrix(x), 2);
},
Matrix: function Matrix(x) {
return _norm(x, 2);
},
'number | Complex | BigNumber | boolean, number | BigNumber | string': function numberComplexBigNumberBooleanNumberBigNumberString(x) {
// ignore second parameter, TODO: remove the option of second parameter for these types
return this(x);
},
'Array, number | BigNumber | string': function ArrayNumberBigNumberString(x, p) {
return _norm(matrix(x), p);
},
'Matrix, number | BigNumber | string': function MatrixNumberBigNumberString(x, p) {
return _norm(x, p);
}
});
/**
* Calculate the norm for an array
* @param {Matrix} x
* @param {number | string} p
* @returns {number} Returns the norm
* @private
*/
function _norm(x, p) {
// size
var sizeX = x.size(); // check if it is a vector
if (sizeX.length === 1) {
// check p
if (p === Number.POSITIVE_INFINITY || p === 'inf') {
// norm(x, Infinity) = max(abs(x))
var pinf = 0; // skip zeros since abs(0) === 0
x.forEach(function (value) {
var v = abs(value);
if (larger(v, pinf)) {
pinf = v;
}
}, true);
return pinf;
}
if (p === Number.NEGATIVE_INFINITY || p === '-inf') {
// norm(x, -Infinity) = min(abs(x))
var ninf; // skip zeros since abs(0) === 0
x.forEach(function (value) {
var v = abs(value);
if (!ninf || smaller(v, ninf)) {
ninf = v;
}
}, true);
return ninf || 0;
}
if (p === 'fro') {
return _norm(x, 2);
}
if (typeof p === 'number' && !isNaN(p)) {
// check p != 0
if (!equalScalar(p, 0)) {
// norm(x, p) = sum(abs(xi) ^ p) ^ 1/p
var n = 0; // skip zeros since abs(0) === 0
x.forEach(function (value) {
n = add(pow(abs(value), p), n);
}, true);
return pow(n, 1 / p);
}
return Number.POSITIVE_INFINITY;
} // invalid parameter value
throw new Error('Unsupported parameter value');
} // MxN matrix
if (sizeX.length === 2) {
// check p
if (p === 1) {
// norm(x) = the largest column sum
var c = []; // result
var maxc = 0; // skip zeros since abs(0) == 0
x.forEach(function (value, index) {
var j = index[1];
var cj = add(c[j] || 0, abs(value));
if (larger(cj, maxc)) {
maxc = cj;
}
c[j] = cj;
}, true);
return maxc;
}
if (p === Number.POSITIVE_INFINITY || p === 'inf') {
// norm(x) = the largest row sum
var r = []; // result
var maxr = 0; // skip zeros since abs(0) == 0
x.forEach(function (value, index) {
var i = index[0];
var ri = add(r[i] || 0, abs(value));
if (larger(ri, maxr)) {
maxr = ri;
}
r[i] = ri;
}, true);
return maxr;
}
if (p === 'fro') {
// norm(x) = sqrt(sum(diag(x'x)))
var fro = 0;
x.forEach(function (value, index) {
fro = add(fro, multiply(value, conj(value)));
});
return abs(sqrt(fro));
}
if (p === 2) {
// not implemented
throw new Error('Unsupported parameter value, missing implementation of matrix singular value decomposition');
} // invalid parameter value
throw new Error('Unsupported parameter value');
}
}
});
// CONCATENATED MODULE: ./src/function/matrix/dot.js
var dot_name = 'dot';
var dot_dependencies = ['typed', 'addScalar', 'multiplyScalar', 'conj', 'size'];
var createDot = /* #__PURE__ */Object(factory["a" /* factory */])(dot_name, dot_dependencies, function (_ref) {
var typed = _ref.typed,
addScalar = _ref.addScalar,
multiplyScalar = _ref.multiplyScalar,
conj = _ref.conj,
size = _ref.size;
/**
* Calculate the dot product of two vectors. The dot product of
* `A = [a1, a2, ..., an]` and `B = [b1, b2, ..., bn]` is defined as:
*
* dot(A, B) = conj(a1) * b1 + conj(a2) * b2 + ... + conj(an) * bn
*
* Syntax:
*
* math.dot(x, y)
*
* Examples:
*
* math.dot([2, 4, 1], [2, 2, 3]) // returns number 15
* math.multiply([2, 4, 1], [2, 2, 3]) // returns number 15
*
* See also:
*
* multiply, cross
*
* @param {Array | Matrix} x First vector
* @param {Array | Matrix} y Second vector
* @return {number} Returns the dot product of `x` and `y`
*/
return typed(dot_name, {
'Array | DenseMatrix, Array | DenseMatrix': _denseDot,
'SparseMatrix, SparseMatrix': _sparseDot
});
function _validateDim(x, y) {
var xSize = _size(x);
var ySize = _size(y);
var xLen, yLen;
if (xSize.length === 1) {
xLen = xSize[0];
} else if (xSize.length === 2 && xSize[1] === 1) {
xLen = xSize[0];
} else {
throw new RangeError('Expected a column vector, instead got a matrix of size (' + xSize.join(', ') + ')');
}
if (ySize.length === 1) {
yLen = ySize[0];
} else if (ySize.length === 2 && ySize[1] === 1) {
yLen = ySize[0];
} else {
throw new RangeError('Expected a column vector, instead got a matrix of size (' + ySize.join(', ') + ')');
}
if (xLen !== yLen) throw new RangeError('Vectors must have equal length (' + xLen + ' != ' + yLen + ')');
if (xLen === 0) throw new RangeError('Cannot calculate the dot product of empty vectors');
return xLen;
}
function _denseDot(a, b) {
var N = _validateDim(a, b);
var adata = Object(is["v" /* isMatrix */])(a) ? a._data : a;
var adt = Object(is["v" /* isMatrix */])(a) ? a._datatype : undefined;
var bdata = Object(is["v" /* isMatrix */])(b) ? b._data : b;
var bdt = Object(is["v" /* isMatrix */])(b) ? b._datatype : undefined; // are these 2-dimensional column vectors? (as opposed to 1-dimensional vectors)
var aIsColumn = _size(a).length === 2;
var bIsColumn = _size(b).length === 2;
var add = addScalar;
var mul = multiplyScalar; // process data types
if (adt && bdt && adt === bdt && typeof adt === 'string') {
var dt = adt; // find signatures that matches (dt, dt)
add = typed.find(addScalar, [dt, dt]);
mul = typed.find(multiplyScalar, [dt, dt]);
} // both vectors 1-dimensional
if (!aIsColumn && !bIsColumn) {
var c = mul(conj(adata[0]), bdata[0]);
for (var i = 1; i < N; i++) {
c = add(c, mul(conj(adata[i]), bdata[i]));
}
return c;
} // a is 1-dim, b is column
if (!aIsColumn && bIsColumn) {
var _c = mul(conj(adata[0]), bdata[0][0]);
for (var _i = 1; _i < N; _i++) {
_c = add(_c, mul(conj(adata[_i]), bdata[_i][0]));
}
return _c;
} // a is column, b is 1-dim
if (aIsColumn && !bIsColumn) {
var _c2 = mul(conj(adata[0][0]), bdata[0]);
for (var _i2 = 1; _i2 < N; _i2++) {
_c2 = add(_c2, mul(conj(adata[_i2][0]), bdata[_i2]));
}
return _c2;
} // both vectors are column
if (aIsColumn && bIsColumn) {
var _c3 = mul(conj(adata[0][0]), bdata[0][0]);
for (var _i3 = 1; _i3 < N; _i3++) {
_c3 = add(_c3, mul(conj(adata[_i3][0]), bdata[_i3][0]));
}
return _c3;
}
}
function _sparseDot(x, y) {
_validateDim(x, y);
var xindex = x._index;
var xvalues = x._values;
var yindex = y._index;
var yvalues = y._values; // TODO optimize add & mul using datatype
var c = 0;
var add = addScalar;
var mul = multiplyScalar;
var i = 0;
var j = 0;
while (i < xindex.length && j < yindex.length) {
var I = xindex[i];
var J = yindex[j];
if (I < J) {
i++;
continue;
}
if (I > J) {
j++;
continue;
}
if (I === J) {
c = add(c, mul(xvalues[i], yvalues[j]));
i++;
j++;
}
}
return c;
} // TODO remove this once #1771 is fixed
function _size(x) {
return Object(is["v" /* isMatrix */])(x) ? x.size() : size(x);
}
});
// CONCATENATED MODULE: ./src/function/matrix/trace.js
var trace_name = 'trace';
var trace_dependencies = ['typed', 'matrix', 'add'];
var createTrace = /* #__PURE__ */Object(factory["a" /* factory */])(trace_name, trace_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
add = _ref.add;
/**
* Calculate the trace of a matrix: the sum of the elements on the main
* diagonal of a square matrix.
*
* Syntax:
*
* math.trace(x)
*
* Examples:
*
* math.trace([[1, 2], [3, 4]]) // returns 5
*
* const A = [
* [1, 2, 3],
* [-1, 2, 3],
* [2, 0, 3]
* ]
* math.trace(A) // returns 6
*
* See also:
*
* diag
*
* @param {Array | Matrix} x A matrix
*
* @return {number} The trace of `x`
*/
return typed('trace', {
Array: function _arrayTrace(x) {
// use dense matrix implementation
return _denseTrace(matrix(x));
},
SparseMatrix: _sparseTrace,
DenseMatrix: _denseTrace,
any: utils_object["a" /* clone */]
});
function _denseTrace(m) {
// matrix size & data
var size = m._size;
var data = m._data; // process dimensions
switch (size.length) {
case 1:
// vector
if (size[0] === 1) {
// return data[0]
return Object(utils_object["a" /* clone */])(data[0]);
}
throw new RangeError('Matrix must be square (size: ' + Object(utils_string["d" /* format */])(size) + ')');
case 2:
{
// two dimensional
var rows = size[0];
var cols = size[1];
if (rows === cols) {
// calulate sum
var sum = 0; // loop diagonal
for (var i = 0; i < rows; i++) {
sum = add(sum, data[i][i]);
} // return trace
return sum;
} else {
throw new RangeError('Matrix must be square (size: ' + Object(utils_string["d" /* format */])(size) + ')');
}
}
default:
// multi dimensional
throw new RangeError('Matrix must be two dimensional (size: ' + Object(utils_string["d" /* format */])(size) + ')');
}
}
function _sparseTrace(m) {
// matrix arrays
var values = m._values;
var index = m._index;
var ptr = m._ptr;
var size = m._size; // check dimensions
var rows = size[0];
var columns = size[1]; // matrix must be square
if (rows === columns) {
// calulate sum
var sum = 0; // check we have data (avoid looping columns)
if (values.length > 0) {
// loop columns
for (var j = 0; j < columns; j++) {
// k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
var k0 = ptr[j];
var k1 = ptr[j + 1]; // loop k within [k0, k1[
for (var k = k0; k < k1; k++) {
// row index
var i = index[k]; // check row
if (i === j) {
// accumulate value
sum = add(sum, values[k]); // exit loop
break;
}
if (i > j) {
// exit loop, no value on the diagonal for column j
break;
}
}
}
} // return trace
return sum;
}
throw new RangeError('Matrix must be square (size: ' + Object(utils_string["d" /* format */])(size) + ')');
}
});
// CONCATENATED MODULE: ./src/type/matrix/function/index.js
var function_name = 'index';
var function_dependencies = ['typed', 'Index'];
var createIndex = /* #__PURE__ */Object(factory["a" /* factory */])(function_name, function_dependencies, function (_ref) {
var typed = _ref.typed,
Index = _ref.Index;
/**
* Create an index. An Index can store ranges having start, step, and end
* for multiple dimensions.
* Matrix.get, Matrix.set, and math.subset accept an Index as input.
*
* Syntax:
*
* math.index(range1, range2, ...)
*
* Where each range can be any of:
*
* - A number
* - A string for getting/setting an object property
* - An instance of `Range`
* - A one-dimensional Array or a Matrix with numbers
*
* Indexes must be zero-based, integer numbers.
*
* Examples:
*
* const b = [1, 2, 3, 4, 5]
* math.subset(b, math.index([1, 2, 3])) // returns [2, 3, 4]
*
* const a = math.matrix([[1, 2], [3, 4]])
* a.subset(math.index(0, 1)) // returns 2
*
* See also:
*
* bignumber, boolean, complex, matrix, number, string, unit
*
* @param {...*} ranges Zero or more ranges or numbers.
* @return {Index} Returns the created index
*/
return typed(function_name, {
'...number | string | BigNumber | Range | Array | Matrix': function numberStringBigNumberRangeArrayMatrix(args) {
var ranges = args.map(function (arg) {
if (Object(is["e" /* isBigNumber */])(arg)) {
return arg.toNumber(); // convert BigNumber to Number
} else if (Array.isArray(arg) || Object(is["v" /* isMatrix */])(arg)) {
return arg.map(function (elem) {
// convert BigNumber to Number
return Object(is["e" /* isBigNumber */])(elem) ? elem.toNumber() : elem;
});
} else {
return arg;
}
});
var res = new Index();
Index.apply(res, ranges);
return res;
}
});
});
// CONCATENATED MODULE: ./src/expression/keywords.js
// Reserved keywords not allowed to use in the parser
var keywords = {
end: true
};
// CONCATENATED MODULE: ./src/expression/node/Node.js
function Node_typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { Node_typeof = function _typeof(obj) { return typeof obj; }; } else { Node_typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return Node_typeof(obj); }
var Node_name = 'Node';
var Node_dependencies = ['mathWithTransform'];
var createNode = /* #__PURE__ */Object(factory["a" /* factory */])(Node_name, Node_dependencies, function (_ref) {
var mathWithTransform = _ref.mathWithTransform;
/**
* Node
*/
function Node() {
if (!(this instanceof Node)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
}
/**
* Evaluate the node
* @param {Object} [scope] Scope to read/write variables
* @return {*} Returns the result
*/
Node.prototype.evaluate = function (scope) {
return this.compile().evaluate(scope);
};
Node.prototype.type = 'Node';
Node.prototype.isNode = true;
Node.prototype.comment = '';
/**
* Compile the node into an optimized, evauatable JavaScript function
* @return {{evaluate: function([Object])}} object
* Returns an object with a function 'evaluate',
* which can be invoked as expr.evaluate([scope: Object]),
* where scope is an optional object with
* variables.
*/
Node.prototype.compile = function () {
var expr = this._compile(mathWithTransform, {});
var args = {};
var context = null;
function evaluate(scope) {
var s = scope || {};
_validateScope(s);
return expr(s, args, context);
}
return {
evaluate: evaluate
};
};
/**
* Compile a node into a JavaScript function.
* This basically pre-calculates as much as possible and only leaves open
* calculations which depend on a dynamic scope with variables.
* @param {Object} math Math.js namespace with functions and constants.
* @param {Object} argNames An object with argument names as key and `true`
* as value. Used in the SymbolNode to optimize
* for arguments from user assigned functions
* (see FunctionAssignmentNode) or special symbols
* like `end` (see IndexNode).
* @return {function} Returns a function which can be called like:
* evalNode(scope: Object, args: Object, context: *)
*/
Node.prototype._compile = function (math, argNames) {
throw new Error('Method _compile should be implemented by type ' + this.type);
};
/**
* Execute a callback for each of the child nodes of this node
* @param {function(child: Node, path: string, parent: Node)} callback
*/
Node.prototype.forEach = function (callback) {
// must be implemented by each of the Node implementations
throw new Error('Cannot run forEach on a Node interface');
};
/**
* Create a new Node having it's childs be the results of calling
* the provided callback function for each of the childs of the original node.
* @param {function(child: Node, path: string, parent: Node): Node} callback
* @returns {OperatorNode} Returns a transformed copy of the node
*/
Node.prototype.map = function (callback) {
// must be implemented by each of the Node implementations
throw new Error('Cannot run map on a Node interface');
};
/**
* Validate whether an object is a Node, for use with map
* @param {Node} node
* @returns {Node} Returns the input if it's a node, else throws an Error
* @protected
*/
Node.prototype._ifNode = function (node) {
if (!Object(is["w" /* isNode */])(node)) {
throw new TypeError('Callback function must return a Node');
}
return node;
};
/**
* Recursively traverse all nodes in a node tree. Executes given callback for
* this node and each of its child nodes.
* @param {function(node: Node, path: string, parent: Node)} callback
* A callback called for every node in the node tree.
*/
Node.prototype.traverse = function (callback) {
// execute callback for itself
callback(this, null, null); // eslint-disable-line standard/no-callback-literal
// recursively traverse over all childs of a node
function _traverse(node, callback) {
node.forEach(function (child, path, parent) {
callback(child, path, parent);
_traverse(child, callback);
});
}
_traverse(this, callback);
};
/**
* Recursively transform a node tree via a transform function.
*
* For example, to replace all nodes of type SymbolNode having name 'x' with a
* ConstantNode with value 2:
*
* const res = Node.transform(function (node, path, parent) {
* if (node && node.isSymbolNode) && (node.name === 'x')) {
* return new ConstantNode(2)
* }
* else {
* return node
* }
* })
*
* @param {function(node: Node, path: string, parent: Node) : Node} callback
* A mapping function accepting a node, and returning
* a replacement for the node or the original node.
* Signature: callback(node: Node, index: string, parent: Node) : Node
* @return {Node} Returns the original node or its replacement
*/
Node.prototype.transform = function (callback) {
function _transform(child, path, parent) {
var replacement = callback(child, path, parent);
if (replacement !== child) {
// stop iterating when the node is replaced
return replacement;
}
return child.map(_transform);
}
return _transform(this, null, null);
};
/**
* Find any node in the node tree matching given filter function. For example, to
* find all nodes of type SymbolNode having name 'x':
*
* const results = Node.filter(function (node) {
* return (node && node.isSymbolNode) && (node.name === 'x')
* })
*
* @param {function(node: Node, path: string, parent: Node) : Node} callback
* A test function returning true when a node matches, and false
* otherwise. Function signature:
* callback(node: Node, index: string, parent: Node) : boolean
* @return {Node[]} nodes An array with nodes matching given filter criteria
*/
Node.prototype.filter = function (callback) {
var nodes = [];
this.traverse(function (node, path, parent) {
if (callback(node, path, parent)) {
nodes.push(node);
}
});
return nodes;
};
/**
* Create a shallow clone of this node
* @return {Node}
*/
Node.prototype.clone = function () {
// must be implemented by each of the Node implementations
throw new Error('Cannot clone a Node interface');
};
/**
* Create a deep clone of this node
* @return {Node}
*/
Node.prototype.cloneDeep = function () {
return this.map(function (node) {
return node.cloneDeep();
});
};
/**
* Deep compare this node with another node.
* @param {Node} other
* @return {boolean} Returns true when both nodes are of the same type and
* contain the same values (as do their childs)
*/
Node.prototype.equals = function (other) {
return other ? Object(utils_object["d" /* deepStrictEqual */])(this, other) : false;
};
/**
* Get string representation. (wrapper function)
*
* This function can get an object of the following form:
* {
* handler: //This can be a callback function of the form
* // "function callback(node, options)"or
* // a map that maps function names (used in FunctionNodes)
* // to callbacks
* parenthesis: "keep" //the parenthesis option (This is optional)
* }
*
* @param {Object} [options]
* @return {string}
*/
Node.prototype.toString = function (options) {
var customString;
if (options && Node_typeof(options) === 'object') {
switch (Node_typeof(options.handler)) {
case 'object':
case 'undefined':
break;
case 'function':
customString = options.handler(this, options);
break;
default:
throw new TypeError('Object or function expected as callback');
}
}
if (typeof customString !== 'undefined') {
return customString;
}
return this._toString(options);
};
/**
* Get a JSON representation of the node
* Both .toJSON() and the static .fromJSON(json) should be implemented by all
* implementations of Node
* @returns {Object}
*/
Node.prototype.toJSON = function () {
throw new Error('Cannot serialize object: toJSON not implemented by ' + this.type);
};
/**
* Get HTML representation. (wrapper function)
*
* This function can get an object of the following form:
* {
* handler: //This can be a callback function of the form
* // "function callback(node, options)" or
* // a map that maps function names (used in FunctionNodes)
* // to callbacks
* parenthesis: "keep" //the parenthesis option (This is optional)
* }
*
* @param {Object} [options]
* @return {string}
*/
Node.prototype.toHTML = function (options) {
var customString;
if (options && Node_typeof(options) === 'object') {
switch (Node_typeof(options.handler)) {
case 'object':
case 'undefined':
break;
case 'function':
customString = options.handler(this, options);
break;
default:
throw new TypeError('Object or function expected as callback');
}
}
if (typeof customString !== 'undefined') {
return customString;
}
return this.toHTML(options);
};
/**
* Internal function to generate the string output.
* This has to be implemented by every Node
*
* @throws {Error}
*/
Node.prototype._toString = function () {
// must be implemented by each of the Node implementations
throw new Error('_toString not implemented for ' + this.type);
};
/**
* Get LaTeX representation. (wrapper function)
*
* This function can get an object of the following form:
* {
* handler: //This can be a callback function of the form
* // "function callback(node, options)"or
* // a map that maps function names (used in FunctionNodes)
* // to callbacks
* parenthesis: "keep" //the parenthesis option (This is optional)
* }
*
* @param {Object} [options]
* @return {string}
*/
Node.prototype.toTex = function (options) {
var customTex;
if (options && Node_typeof(options) === 'object') {
switch (Node_typeof(options.handler)) {
case 'object':
case 'undefined':
break;
case 'function':
customTex = options.handler(this, options);
break;
default:
throw new TypeError('Object or function expected as callback');
}
}
if (typeof customTex !== 'undefined') {
return customTex;
}
return this._toTex(options);
};
/**
* Internal function to generate the LaTeX output.
* This has to be implemented by every Node
*
* @param {Object} [options]
* @throws {Error}
*/
Node.prototype._toTex = function (options) {
// must be implemented by each of the Node implementations
throw new Error('_toTex not implemented for ' + this.type);
};
/**
* Get identifier.
* @return {string}
*/
Node.prototype.getIdentifier = function () {
return this.type;
};
/**
* Get the content of the current Node.
* @return {Node} node
**/
Node.prototype.getContent = function () {
return this;
};
/**
* Validate the symbol names of a scope.
* Throws an error when the scope contains an illegal symbol.
* @param {Object} scope
*/
function _validateScope(scope) {
for (var symbol in scope) {
if (Object(utils_object["f" /* hasOwnProperty */])(scope, symbol)) {
if (symbol in keywords) {
throw new Error('Scope contains an illegal symbol, "' + symbol + '" is a reserved keyword');
}
}
}
}
return Node;
}, {
isClass: true,
isNode: true
});
// CONCATENATED MODULE: ./src/expression/transform/utils/errorTransform.js
/**
* Transform zero-based indices to one-based indices in errors
* @param {Error} err
* @returns {Error | IndexError} Returns the transformed error
*/
function errorTransform(err) {
if (err && err.isIndexError) {
return new IndexError["a" /* IndexError */](err.index + 1, err.min + 1, err.max !== undefined ? err.max + 1 : undefined);
}
return err;
}
// CONCATENATED MODULE: ./src/expression/node/utils/access.js
function access_typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { access_typeof = function _typeof(obj) { return typeof obj; }; } else { access_typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return access_typeof(obj); }
function accessFactory(_ref) {
var subset = _ref.subset;
/**
* Retrieve part of an object:
*
* - Retrieve a property from an object
* - Retrieve a part of a string
* - Retrieve a matrix subset
*
* @param {Object | Array | Matrix | string} object
* @param {Index} index
* @return {Object | Array | Matrix | string} Returns the subset
*/
return function access(object, index) {
try {
if (Array.isArray(object)) {
return subset(object, index);
} else if (object && typeof object.subset === 'function') {
// Matrix
return object.subset(index);
} else if (typeof object === 'string') {
// TODO: move getStringSubset into a separate util file, use that
return subset(object, index);
} else if (access_typeof(object) === 'object') {
if (!index.isObjectProperty()) {
throw new TypeError('Cannot apply a numeric index as object property');
}
return getSafeProperty(object, index.getObjectProperty());
} else {
throw new TypeError('Cannot apply index: unsupported type of object');
}
} catch (err) {
throw errorTransform(err);
}
};
}
// CONCATENATED MODULE: ./src/expression/node/AccessorNode.js
var AccessorNode_name = 'AccessorNode';
var AccessorNode_dependencies = ['subset', 'Node'];
var createAccessorNode = /* #__PURE__ */Object(factory["a" /* factory */])(AccessorNode_name, AccessorNode_dependencies, function (_ref) {
var subset = _ref.subset,
Node = _ref.Node;
var access = accessFactory({
subset: subset
});
/**
* @constructor AccessorNode
* @extends {Node}
* Access an object property or get a matrix subset
*
* @param {Node} object The object from which to retrieve
* a property or subset.
* @param {IndexNode} index IndexNode containing ranges
*/
function AccessorNode(object, index) {
if (!(this instanceof AccessorNode)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
if (!Object(is["w" /* isNode */])(object)) {
throw new TypeError('Node expected for parameter "object"');
}
if (!Object(is["u" /* isIndexNode */])(index)) {
throw new TypeError('IndexNode expected for parameter "index"');
}
this.object = object || null;
this.index = index; // readonly property name
Object.defineProperty(this, 'name', {
get: function () {
if (this.index) {
return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';
} else {
return this.object.name || '';
}
}.bind(this),
set: function set() {
throw new Error('Cannot assign a new name, name is read-only');
}
});
}
AccessorNode.prototype = new Node();
AccessorNode.prototype.type = 'AccessorNode';
AccessorNode.prototype.isAccessorNode = true;
/**
* Compile a node into a JavaScript function.
* This basically pre-calculates as much as possible and only leaves open
* calculations which depend on a dynamic scope with variables.
* @param {Object} math Math.js namespace with functions and constants.
* @param {Object} argNames An object with argument names as key and `true`
* as value. Used in the SymbolNode to optimize
* for arguments from user assigned functions
* (see FunctionAssignmentNode) or special symbols
* like `end` (see IndexNode).
* @return {function} Returns a function which can be called like:
* evalNode(scope: Object, args: Object, context: *)
*/
AccessorNode.prototype._compile = function (math, argNames) {
var evalObject = this.object._compile(math, argNames);
var evalIndex = this.index._compile(math, argNames);
if (this.index.isObjectProperty()) {
var prop = this.index.getObjectProperty();
return function evalAccessorNode(scope, args, context) {
return getSafeProperty(evalObject(scope, args, context), prop);
};
} else {
return function evalAccessorNode(scope, args, context) {
var object = evalObject(scope, args, context);
var index = evalIndex(scope, args, object); // we pass object here instead of context
return access(object, index);
};
}
};
/**
* Execute a callback for each of the child nodes of this node
* @param {function(child: Node, path: string, parent: Node)} callback
*/
AccessorNode.prototype.forEach = function (callback) {
callback(this.object, 'object', this);
callback(this.index, 'index', this);
};
/**
* Create a new AccessorNode having it's childs be the results of calling
* the provided callback function for each of the childs of the original node.
* @param {function(child: Node, path: string, parent: Node): Node} callback
* @returns {AccessorNode} Returns a transformed copy of the node
*/
AccessorNode.prototype.map = function (callback) {
return new AccessorNode(this._ifNode(callback(this.object, 'object', this)), this._ifNode(callback(this.index, 'index', this)));
};
/**
* Create a clone of this node, a shallow copy
* @return {AccessorNode}
*/
AccessorNode.prototype.clone = function () {
return new AccessorNode(this.object, this.index);
};
/**
* Get string representation
* @param {Object} options
* @return {string}
*/
AccessorNode.prototype._toString = function (options) {
var object = this.object.toString(options);
if (needParenthesis(this.object)) {
object = '(' + object + ')';
}
return object + this.index.toString(options);
};
/**
* Get HTML representation
* @param {Object} options
* @return {string}
*/
AccessorNode.prototype.toHTML = function (options) {
var object = this.object.toHTML(options);
if (needParenthesis(this.object)) {
object = '<span class="math-parenthesis math-round-parenthesis">(</span>' + object + '<span class="math-parenthesis math-round-parenthesis">)</span>';
}
return object + this.index.toHTML(options);
};
/**
* Get LaTeX representation
* @param {Object} options
* @return {string}
*/
AccessorNode.prototype._toTex = function (options) {
var object = this.object.toTex(options);
if (needParenthesis(this.object)) {
object = '\\left(\' + object + \'\\right)';
}
return object + this.index.toTex(options);
};
/**
* Get a JSON representation of the node
* @returns {Object}
*/
AccessorNode.prototype.toJSON = function () {
return {
mathjs: 'AccessorNode',
object: this.object,
index: this.index
};
};
/**
* Instantiate an AccessorNode from its JSON representation
* @param {Object} json An object structured like
* `{"mathjs": "AccessorNode", object: ..., index: ...}`,
* where mathjs is optional
* @returns {AccessorNode}
*/
AccessorNode.fromJSON = function (json) {
return new AccessorNode(json.object, json.index);
};
/**
* Are parenthesis needed?
* @private
*/
function needParenthesis(node) {
// TODO: maybe make a method on the nodes which tells whether they need parenthesis?
return !(Object(is["a" /* isAccessorNode */])(node) || Object(is["c" /* isArrayNode */])(node) || Object(is["l" /* isConstantNode */])(node) || Object(is["r" /* isFunctionNode */])(node) || Object(is["A" /* isObjectNode */])(node) || Object(is["C" /* isParenthesisNode */])(node) || Object(is["J" /* isSymbolNode */])(node));
}
return AccessorNode;
}, {
isClass: true,
isNode: true
});
// CONCATENATED MODULE: ./src/expression/node/ArrayNode.js
var ArrayNode_name = 'ArrayNode';
var ArrayNode_dependencies = ['Node'];
var createArrayNode = /* #__PURE__ */Object(factory["a" /* factory */])(ArrayNode_name, ArrayNode_dependencies, function (_ref) {
var Node = _ref.Node;
/**
* @constructor ArrayNode
* @extends {Node}
* Holds an 1-dimensional array with items
* @param {Node[]} [items] 1 dimensional array with items
*/
function ArrayNode(items) {
if (!(this instanceof ArrayNode)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
this.items = items || []; // validate input
if (!Array.isArray(this.items) || !this.items.every(is["w" /* isNode */])) {
throw new TypeError('Array containing Nodes expected');
}
}
ArrayNode.prototype = new Node();
ArrayNode.prototype.type = 'ArrayNode';
ArrayNode.prototype.isArrayNode = true;
/**
* Compile a node into a JavaScript function.
* This basically pre-calculates as much as possible and only leaves open
* calculations which depend on a dynamic scope with variables.
* @param {Object} math Math.js namespace with functions and constants.
* @param {Object} argNames An object with argument names as key and `true`
* as value. Used in the SymbolNode to optimize
* for arguments from user assigned functions
* (see FunctionAssignmentNode) or special symbols
* like `end` (see IndexNode).
* @return {function} Returns a function which can be called like:
* evalNode(scope: Object, args: Object, context: *)
*/
ArrayNode.prototype._compile = function (math, argNames) {
var evalItems = Object(utils_array["k" /* map */])(this.items, function (item) {
return item._compile(math, argNames);
});
var asMatrix = math.config.matrix !== 'Array';
if (asMatrix) {
var matrix = math.matrix;
return function evalArrayNode(scope, args, context) {
return matrix(Object(utils_array["k" /* map */])(evalItems, function (evalItem) {
return evalItem(scope, args, context);
}));
};
} else {
return function evalArrayNode(scope, args, context) {
return Object(utils_array["k" /* map */])(evalItems, function (evalItem) {
return evalItem(scope, args, context);
});
};
}
};
/**
* Execute a callback for each of the child nodes of this node
* @param {function(child: Node, path: string, parent: Node)} callback
*/
ArrayNode.prototype.forEach = function (callback) {
for (var i = 0; i < this.items.length; i++) {
var node = this.items[i];
callback(node, 'items[' + i + ']', this);
}
};
/**
* Create a new ArrayNode having it's childs be the results of calling
* the provided callback function for each of the childs of the original node.
* @param {function(child: Node, path: string, parent: Node): Node} callback
* @returns {ArrayNode} Returns a transformed copy of the node
*/
ArrayNode.prototype.map = function (callback) {
var items = [];
for (var i = 0; i < this.items.length; i++) {
items[i] = this._ifNode(callback(this.items[i], 'items[' + i + ']', this));
}
return new ArrayNode(items);
};
/**
* Create a clone of this node, a shallow copy
* @return {ArrayNode}
*/
ArrayNode.prototype.clone = function () {
return new ArrayNode(this.items.slice(0));
};
/**
* Get string representation
* @param {Object} options
* @return {string} str
* @override
*/
ArrayNode.prototype._toString = function (options) {
var items = this.items.map(function (node) {
return node.toString(options);
});
return '[' + items.join(', ') + ']';
};
/**
* Get a JSON representation of the node
* @returns {Object}
*/
ArrayNode.prototype.toJSON = function () {
return {
mathjs: 'ArrayNode',
items: this.items
};
};
/**
* Instantiate an ArrayNode from its JSON representation
* @param {Object} json An object structured like
* `{"mathjs": "ArrayNode", items: [...]}`,
* where mathjs is optional
* @returns {ArrayNode}
*/
ArrayNode.fromJSON = function (json) {
return new ArrayNode(json.items);
};
/**
* Get HTML representation
* @param {Object} options
* @return {string} str
* @override
*/
ArrayNode.prototype.toHTML = function (options) {
var items = this.items.map(function (node) {
return node.toHTML(options);
});
return '<span class="math-parenthesis math-square-parenthesis">[</span>' + items.join('<span class="math-separator">,</span>') + '<span class="math-parenthesis math-square-parenthesis">]</span>';
};
/**
* Get LaTeX representation
* @param {Object} options
* @return {string} str
*/
ArrayNode.prototype._toTex = function (options) {
var s = '\\begin{bmatrix}';
this.items.forEach(function (node) {
if (node.items) {
s += node.items.map(function (childNode) {
return childNode.toTex(options);
}).join('&');
} else {
s += node.toTex(options);
} // new line
s += '\\\\';
});
s += '\\end{bmatrix}';
return s;
};
return ArrayNode;
}, {
isClass: true,
isNode: true
});
// CONCATENATED MODULE: ./src/expression/node/utils/assign.js
function assign_typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { assign_typeof = function _typeof(obj) { return typeof obj; }; } else { assign_typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return assign_typeof(obj); }
function assignFactory(_ref) {
var subset = _ref.subset,
matrix = _ref.matrix;
/**
* Replace part of an object:
*
* - Assign a property to an object
* - Replace a part of a string
* - Replace a matrix subset
*
* @param {Object | Array | Matrix | string} object
* @param {Index} index
* @param {*} value
* @return {Object | Array | Matrix | string} Returns the original object
* except in case of a string
*/
// TODO: change assign to return the value instead of the object
return function assign(object, index, value) {
try {
if (Array.isArray(object)) {
// we use matrix.subset here instead of the function subset because we must not clone the contents
return matrix(object).subset(index, value).valueOf();
} else if (object && typeof object.subset === 'function') {
// Matrix
return object.subset(index, value);
} else if (typeof object === 'string') {
// TODO: move setStringSubset into a separate util file, use that
return subset(object, index, value);
} else if (assign_typeof(object) === 'object') {
if (!index.isObjectProperty()) {
throw TypeError('Cannot apply a numeric index as object property');
}
setSafeProperty(object, index.getObjectProperty(), value);
return object;
} else {
throw new TypeError('Cannot apply index: unsupported type of object');
}
} catch (err) {
throw errorTransform(err);
}
};
}
// CONCATENATED MODULE: ./src/expression/operators.js
// list of identifiers of nodes in order of their precedence
// also contains information about left/right associativity
// and which other operator the operator is associative with
// Example:
// addition is associative with addition and subtraction, because:
// (a+b)+c=a+(b+c)
// (a+b)-c=a+(b-c)
//
// postfix operators are left associative, prefix operators
// are right associative
//
// It's also possible to set the following properties:
// latexParens: if set to false, this node doesn't need to be enclosed
// in parentheses when using LaTeX
// latexLeftParens: if set to false, this !OperatorNode's!
// left argument doesn't need to be enclosed
// in parentheses
// latexRightParens: the same for the right argument
var operators_properties = [{
// assignment
AssignmentNode: {},
FunctionAssignmentNode: {}
}, {
// conditional expression
ConditionalNode: {
latexLeftParens: false,
latexRightParens: false,
latexParens: false // conditionals don't need parentheses in LaTeX because
// they are 2 dimensional
}
}, {
// logical or
'OperatorNode:or': {
associativity: 'left',
associativeWith: []
}
}, {
// logical xor
'OperatorNode:xor': {
associativity: 'left',
associativeWith: []
}
}, {
// logical and
'OperatorNode:and': {
associativity: 'left',
associativeWith: []
}
}, {
// bitwise or
'OperatorNode:bitOr': {
associativity: 'left',
associativeWith: []
}
}, {
// bitwise xor
'OperatorNode:bitXor': {
associativity: 'left',
associativeWith: []
}
}, {
// bitwise and
'OperatorNode:bitAnd': {
associativity: 'left',
associativeWith: []
}
}, {
// relational operators
'OperatorNode:equal': {
associativity: 'left',
associativeWith: []
},
'OperatorNode:unequal': {
associativity: 'left',
associativeWith: []
},
'OperatorNode:smaller': {
associativity: 'left',
associativeWith: []
},
'OperatorNode:larger': {
associativity: 'left',
associativeWith: []
},
'OperatorNode:smallerEq': {
associativity: 'left',
associativeWith: []
},
'OperatorNode:largerEq': {
associativity: 'left',
associativeWith: []
},
RelationalNode: {
associativity: 'left',
associativeWith: []
}
}, {
// bitshift operators
'OperatorNode:leftShift': {
associativity: 'left',
associativeWith: []
},
'OperatorNode:rightArithShift': {
associativity: 'left',
associativeWith: []
},
'OperatorNode:rightLogShift': {
associativity: 'left',
associativeWith: []
}
}, {
// unit conversion
'OperatorNode:to': {
associativity: 'left',
associativeWith: []
}
}, {
// range
RangeNode: {}
}, {
// addition, subtraction
'OperatorNode:add': {
associativity: 'left',
associativeWith: ['OperatorNode:add', 'OperatorNode:subtract']
},
'OperatorNode:subtract': {
associativity: 'left',
associativeWith: []
}
}, {
// multiply, divide, modulus
'OperatorNode:multiply': {
associativity: 'left',
associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'Operator:dotMultiply', 'Operator:dotDivide']
},
'OperatorNode:divide': {
associativity: 'left',
associativeWith: [],
latexLeftParens: false,
latexRightParens: false,
latexParens: false // fractions don't require parentheses because
// they're 2 dimensional, so parens aren't needed
// in LaTeX
},
'OperatorNode:dotMultiply': {
associativity: 'left',
associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'OperatorNode:dotMultiply', 'OperatorNode:doDivide']
},
'OperatorNode:dotDivide': {
associativity: 'left',
associativeWith: []
},
'OperatorNode:mod': {
associativity: 'left',
associativeWith: []
}
}, {
// unary prefix operators
'OperatorNode:unaryPlus': {
associativity: 'right'
},
'OperatorNode:unaryMinus': {
associativity: 'right'
},
'OperatorNode:bitNot': {
associativity: 'right'
},
'OperatorNode:not': {
associativity: 'right'
}
}, {
// exponentiation
'OperatorNode:pow': {
associativity: 'right',
associativeWith: [],
latexRightParens: false // the exponent doesn't need parentheses in
// LaTeX because it's 2 dimensional
// (it's on top)
},
'OperatorNode:dotPow': {
associativity: 'right',
associativeWith: []
}
}, {
// factorial
'OperatorNode:factorial': {
associativity: 'left'
}
}, {
// matrix transpose
'OperatorNode:transpose': {
associativity: 'left'
}
}];
/**
* Get the precedence of a Node.
* Higher number for higher precedence, starting with 0.
* Returns null if the precedence is undefined.
*
* @param {Node} _node
* @param {string} parenthesis
* @return {number | null}
*/
function getPrecedence(_node, parenthesis) {
var node = _node;
if (parenthesis !== 'keep') {
// ParenthesisNodes are only ignored when not in 'keep' mode
node = _node.getContent();
}
var identifier = node.getIdentifier();
for (var i = 0; i < operators_properties.length; i++) {
if (identifier in operators_properties[i]) {
return i;
}
}
return null;
}
/**
* Get the associativity of an operator (left or right).
* Returns a string containing 'left' or 'right' or null if
* the associativity is not defined.
*
* @param {Node}
* @param {string} parenthesis
* @return {string|null}
* @throws {Error}
*/
function getAssociativity(_node, parenthesis) {
var node = _node;
if (parenthesis !== 'keep') {
// ParenthesisNodes are only ignored when not in 'keep' mode
node = _node.getContent();
}
var identifier = node.getIdentifier();
var index = getPrecedence(node, parenthesis);
if (index === null) {
// node isn't in the list
return null;
}
var property = operators_properties[index][identifier];
if (Object(utils_object["f" /* hasOwnProperty */])(property, 'associativity')) {
if (property.associativity === 'left') {
return 'left';
}
if (property.associativity === 'right') {
return 'right';
} // associativity is invalid
throw Error('\'' + identifier + '\' has the invalid associativity \'' + property.associativity + '\'.');
} // associativity is undefined
return null;
}
/**
* Check if an operator is associative with another operator.
* Returns either true or false or null if not defined.
*
* @param {Node} nodeA
* @param {Node} nodeB
* @param {string} parenthesis
* @return {boolean | null}
*/
function isAssociativeWith(nodeA, nodeB, parenthesis) {
// ParenthesisNodes are only ignored when not in 'keep' mode
var a = parenthesis !== 'keep' ? nodeA.getContent() : nodeA;
var b = parenthesis !== 'keep' ? nodeA.getContent() : nodeB;
var identifierA = a.getIdentifier();
var identifierB = b.getIdentifier();
var index = getPrecedence(a, parenthesis);
if (index === null) {
// node isn't in the list
return null;
}
var property = operators_properties[index][identifierA];
if (Object(utils_object["f" /* hasOwnProperty */])(property, 'associativeWith') && property.associativeWith instanceof Array) {
for (var i = 0; i < property.associativeWith.length; i++) {
if (property.associativeWith[i] === identifierB) {
return true;
}
}
return false;
} // associativeWith is not defined
return null;
}
// CONCATENATED MODULE: ./src/expression/node/AssignmentNode.js
var AssignmentNode_name = 'AssignmentNode';
var AssignmentNode_dependencies = ['subset', '?matrix', // FIXME: should not be needed at all, should be handled by subset
'Node'];
var createAssignmentNode = /* #__PURE__ */Object(factory["a" /* factory */])(AssignmentNode_name, AssignmentNode_dependencies, function (_ref) {
var subset = _ref.subset,
matrix = _ref.matrix,
Node = _ref.Node;
var access = accessFactory({
subset: subset
});
var assign = assignFactory({
subset: subset,
matrix: matrix
});
/**
* @constructor AssignmentNode
* @extends {Node}
*
* Define a symbol, like `a=3.2`, update a property like `a.b=3.2`, or
* replace a subset of a matrix like `A[2,2]=42`.
*
* Syntax:
*
* new AssignmentNode(symbol, value)
* new AssignmentNode(object, index, value)
*
* Usage:
*
* new AssignmentNode(new SymbolNode('a'), new ConstantNode(2)) // a=2
* new AssignmentNode(new SymbolNode('a'), new IndexNode('b'), new ConstantNode(2)) // a.b=2
* new AssignmentNode(new SymbolNode('a'), new IndexNode(1, 2), new ConstantNode(3)) // a[1,2]=3
*
* @param {SymbolNode | AccessorNode} object Object on which to assign a value
* @param {IndexNode} [index=null] Index, property name or matrix
* index. Optional. If not provided
* and `object` is a SymbolNode,
* the property is assigned to the
* global scope.
* @param {Node} value The value to be assigned
*/
function AssignmentNode(object, index, value) {
if (!(this instanceof AssignmentNode)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
this.object = object;
this.index = value ? index : null;
this.value = value || index; // validate input
if (!Object(is["J" /* isSymbolNode */])(object) && !Object(is["a" /* isAccessorNode */])(object)) {
throw new TypeError('SymbolNode or AccessorNode expected as "object"');
}
if (Object(is["J" /* isSymbolNode */])(object) && object.name === 'end') {
throw new Error('Cannot assign to symbol "end"');
}
if (this.index && !Object(is["u" /* isIndexNode */])(this.index)) {
// index is optional
throw new TypeError('IndexNode expected as "index"');
}
if (!Object(is["w" /* isNode */])(this.value)) {
throw new TypeError('Node expected as "value"');
} // readonly property name
Object.defineProperty(this, 'name', {
get: function () {
if (this.index) {
return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';
} else {
return this.object.name || '';
}
}.bind(this),
set: function set() {
throw new Error('Cannot assign a new name, name is read-only');
}
});
}
AssignmentNode.prototype = new Node();
AssignmentNode.prototype.type = 'AssignmentNode';
AssignmentNode.prototype.isAssignmentNode = true;
/**
* Compile a node into a JavaScript function.
* This basically pre-calculates as much as possible and only leaves open
* calculations which depend on a dynamic scope with variables.
* @param {Object} math Math.js namespace with functions and constants.
* @param {Object} argNames An object with argument names as key and `true`
* as value. Used in the SymbolNode to optimize
* for arguments from user assigned functions
* (see FunctionAssignmentNode) or special symbols
* like `end` (see IndexNode).
* @return {function} Returns a function which can be called like:
* evalNode(scope: Object, args: Object, context: *)
*/
AssignmentNode.prototype._compile = function (math, argNames) {
var evalObject = this.object._compile(math, argNames);
var evalIndex = this.index ? this.index._compile(math, argNames) : null;
var evalValue = this.value._compile(math, argNames);
var name = this.object.name;
if (!this.index) {
// apply a variable to the scope, for example `a=2`
if (!Object(is["J" /* isSymbolNode */])(this.object)) {
throw new TypeError('SymbolNode expected as object');
}
return function evalAssignmentNode(scope, args, context) {
return setSafeProperty(scope, name, evalValue(scope, args, context));
};
} else if (this.index.isObjectProperty()) {
// apply an object property for example `a.b=2`
var prop = this.index.getObjectProperty();
return function evalAssignmentNode(scope, args, context) {
var object = evalObject(scope, args, context);
var value = evalValue(scope, args, context);
return setSafeProperty(object, prop, value);
};
} else if (Object(is["J" /* isSymbolNode */])(this.object)) {
// update a matrix subset, for example `a[2]=3`
return function evalAssignmentNode(scope, args, context) {
var childObject = evalObject(scope, args, context);
var value = evalValue(scope, args, context);
var index = evalIndex(scope, args, childObject); // Important: we pass childObject instead of context
setSafeProperty(scope, name, assign(childObject, index, value));
return value;
};
} else {
// isAccessorNode(node.object) === true
// update a matrix subset, for example `a.b[2]=3`
// we will not use the compile function of the AccessorNode, but compile it
// ourselves here as we need the parent object of the AccessorNode:
// wee need to apply the updated object to parent object
var evalParentObject = this.object.object._compile(math, argNames);
if (this.object.index.isObjectProperty()) {
var parentProp = this.object.index.getObjectProperty();
return function evalAssignmentNode(scope, args, context) {
var parent = evalParentObject(scope, args, context);
var childObject = getSafeProperty(parent, parentProp);
var index = evalIndex(scope, args, childObject); // Important: we pass childObject instead of context
var value = evalValue(scope, args, context);
setSafeProperty(parent, parentProp, assign(childObject, index, value));
return value;
};
} else {
// if some parameters use the 'end' parameter, we need to calculate the size
var evalParentIndex = this.object.index._compile(math, argNames);
return function evalAssignmentNode(scope, args, context) {
var parent = evalParentObject(scope, args, context);
var parentIndex = evalParentIndex(scope, args, parent); // Important: we pass parent instead of context
var childObject = access(parent, parentIndex);
var index = evalIndex(scope, args, childObject); // Important: we pass childObject instead of context
var value = evalValue(scope, args, context);
assign(parent, parentIndex, assign(childObject, index, value));
return value;
};
}
}
};
/**
* Execute a callback for each of the child nodes of this node
* @param {function(child: Node, path: string, parent: Node)} callback
*/
AssignmentNode.prototype.forEach = function (callback) {
callback(this.object, 'object', this);
if (this.index) {
callback(this.index, 'index', this);
}
callback(this.value, 'value', this);
};
/**
* Create a new AssignmentNode having it's childs be the results of calling
* the provided callback function for each of the childs of the original node.
* @param {function(child: Node, path: string, parent: Node): Node} callback
* @returns {AssignmentNode} Returns a transformed copy of the node
*/
AssignmentNode.prototype.map = function (callback) {
var object = this._ifNode(callback(this.object, 'object', this));
var index = this.index ? this._ifNode(callback(this.index, 'index', this)) : null;
var value = this._ifNode(callback(this.value, 'value', this));
return new AssignmentNode(object, index, value);
};
/**
* Create a clone of this node, a shallow copy
* @return {AssignmentNode}
*/
AssignmentNode.prototype.clone = function () {
return new AssignmentNode(this.object, this.index, this.value);
};
/*
* Is parenthesis needed?
* @param {node} node
* @param {string} [parenthesis='keep']
* @private
*/
function needParenthesis(node, parenthesis) {
if (!parenthesis) {
parenthesis = 'keep';
}
var precedence = getPrecedence(node, parenthesis);
var exprPrecedence = getPrecedence(node.value, parenthesis);
return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;
}
/**
* Get string representation
* @param {Object} options
* @return {string}
*/
AssignmentNode.prototype._toString = function (options) {
var object = this.object.toString(options);
var index = this.index ? this.index.toString(options) : '';
var value = this.value.toString(options);
if (needParenthesis(this, options && options.parenthesis)) {
value = '(' + value + ')';
}
return object + index + ' = ' + value;
};
/**
* Get a JSON representation of the node
* @returns {Object}
*/
AssignmentNode.prototype.toJSON = function () {
return {
mathjs: 'AssignmentNode',
object: this.object,
index: this.index,
value: this.value
};
};
/**
* Instantiate an AssignmentNode from its JSON representation
* @param {Object} json An object structured like
* `{"mathjs": "AssignmentNode", object: ..., index: ..., value: ...}`,
* where mathjs is optional
* @returns {AssignmentNode}
*/
AssignmentNode.fromJSON = function (json) {
return new AssignmentNode(json.object, json.index, json.value);
};
/**
* Get HTML representation
* @param {Object} options
* @return {string}
*/
AssignmentNode.prototype.toHTML = function (options) {
var object = this.object.toHTML(options);
var index = this.index ? this.index.toHTML(options) : '';
var value = this.value.toHTML(options);
if (needParenthesis(this, options && options.parenthesis)) {
value = '<span class="math-paranthesis math-round-parenthesis">(</span>' + value + '<span class="math-paranthesis math-round-parenthesis">)</span>';
}
return object + index + '<span class="math-operator math-assignment-operator math-variable-assignment-operator math-binary-operator">=</span>' + value;
};
/**
* Get LaTeX representation
* @param {Object} options
* @return {string}
*/
AssignmentNode.prototype._toTex = function (options) {
var object = this.object.toTex(options);
var index = this.index ? this.index.toTex(options) : '';
var value = this.value.toTex(options);
if (needParenthesis(this, options && options.parenthesis)) {
value = "\\left(".concat(value, "\\right)");
}
return object + index + ':=' + value;
};
return AssignmentNode;
}, {
isClass: true,
isNode: true
});
// CONCATENATED MODULE: ./src/expression/node/BlockNode.js
var BlockNode_name = 'BlockNode';
var BlockNode_dependencies = ['ResultSet', 'Node'];
var createBlockNode = /* #__PURE__ */Object(factory["a" /* factory */])(BlockNode_name, BlockNode_dependencies, function (_ref) {
var ResultSet = _ref.ResultSet,
Node = _ref.Node;
/**
* @constructor BlockNode
* @extends {Node}
* Holds a set with blocks
* @param {Array.<{node: Node} | {node: Node, visible: boolean}>} blocks
* An array with blocks, where a block is constructed as an Object
* with properties block, which is a Node, and visible, which is
* a boolean. The property visible is optional and is true by default
*/
function BlockNode(blocks) {
if (!(this instanceof BlockNode)) {
throw new SyntaxError('Constructor must be called with the new operator');
} // validate input, copy blocks
if (!Array.isArray(blocks)) throw new Error('Array expected');
this.blocks = blocks.map(function (block) {
var node = block && block.node;
var visible = block && block.visible !== undefined ? block.visible : true;
if (!Object(is["w" /* isNode */])(node)) throw new TypeError('Property "node" must be a Node');
if (typeof visible !== 'boolean') throw new TypeError('Property "visible" must be a boolean');
return {
node: node,
visible: visible
};
});
}
BlockNode.prototype = new Node();
BlockNode.prototype.type = 'BlockNode';
BlockNode.prototype.isBlockNode = true;
/**
* Compile a node into a JavaScript function.
* This basically pre-calculates as much as possible and only leaves open
* calculations which depend on a dynamic scope with variables.
* @param {Object} math Math.js namespace with functions and constants.
* @param {Object} argNames An object with argument names as key and `true`
* as value. Used in the SymbolNode to optimize
* for arguments from user assigned functions
* (see FunctionAssignmentNode) or special symbols
* like `end` (see IndexNode).
* @return {function} Returns a function which can be called like:
* evalNode(scope: Object, args: Object, context: *)
*/
BlockNode.prototype._compile = function (math, argNames) {
var evalBlocks = Object(utils_array["k" /* map */])(this.blocks, function (block) {
return {
evaluate: block.node._compile(math, argNames),
visible: block.visible
};
});
return function evalBlockNodes(scope, args, context) {
var results = [];
Object(utils_array["f" /* forEach */])(evalBlocks, function evalBlockNode(block) {
var result = block.evaluate(scope, args, context);
if (block.visible) {
results.push(result);
}
});
return new ResultSet(results);
};
};
/**
* Execute a callback for each of the child blocks of this node
* @param {function(child: Node, path: string, parent: Node)} callback
*/
BlockNode.prototype.forEach = function (callback) {
for (var i = 0; i < this.blocks.length; i++) {
callback(this.blocks[i].node, 'blocks[' + i + '].node', this);
}
};
/**
* Create a new BlockNode having it's childs be the results of calling
* the provided callback function for each of the childs of the original node.
* @param {function(child: Node, path: string, parent: Node): Node} callback
* @returns {BlockNode} Returns a transformed copy of the node
*/
BlockNode.prototype.map = function (callback) {
var blocks = [];
for (var i = 0; i < this.blocks.length; i++) {
var block = this.blocks[i];
var node = this._ifNode(callback(block.node, 'blocks[' + i + '].node', this));
blocks[i] = {
node: node,
visible: block.visible
};
}
return new BlockNode(blocks);
};
/**
* Create a clone of this node, a shallow copy
* @return {BlockNode}
*/
BlockNode.prototype.clone = function () {
var blocks = this.blocks.map(function (block) {
return {
node: block.node,
visible: block.visible
};
});
return new BlockNode(blocks);
};
/**
* Get string representation
* @param {Object} options
* @return {string} str
* @override
*/
BlockNode.prototype._toString = function (options) {
return this.blocks.map(function (param) {
return param.node.toString(options) + (param.visible ? '' : ';');
}).join('\n');
};
/**
* Get a JSON representation of the node
* @returns {Object}
*/
BlockNode.prototype.toJSON = function () {
return {
mathjs: 'BlockNode',
blocks: this.blocks
};
};
/**
* Instantiate an BlockNode from its JSON representation
* @param {Object} json An object structured like
* `{"mathjs": "BlockNode", blocks: [{node: ..., visible: false}, ...]}`,
* where mathjs is optional
* @returns {BlockNode}
*/
BlockNode.fromJSON = function (json) {
return new BlockNode(json.blocks);
};
/**
* Get HTML representation
* @param {Object} options
* @return {string} str
* @override
*/
BlockNode.prototype.toHTML = function (options) {
return this.blocks.map(function (param) {
return param.node.toHTML(options) + (param.visible ? '' : '<span class="math-separator">;</span>');
}).join('<span class="math-separator"><br /></span>');
};
/**
* Get LaTeX representation
* @param {Object} options
* @return {string} str
*/
BlockNode.prototype._toTex = function (options) {
return this.blocks.map(function (param) {
return param.node.toTex(options) + (param.visible ? '' : ';');
}).join('\\;\\;\n');
};
return BlockNode;
}, {
isClass: true,
isNode: true
});
// CONCATENATED MODULE: ./src/expression/node/ConditionalNode.js
var ConditionalNode_name = 'ConditionalNode';
var ConditionalNode_dependencies = ['Node'];
var createConditionalNode = /* #__PURE__ */Object(factory["a" /* factory */])(ConditionalNode_name, ConditionalNode_dependencies, function (_ref) {
var Node = _ref.Node;
/**
* A lazy evaluating conditional operator: 'condition ? trueExpr : falseExpr'
*
* @param {Node} condition Condition, must result in a boolean
* @param {Node} trueExpr Expression evaluated when condition is true
* @param {Node} falseExpr Expression evaluated when condition is true
*
* @constructor ConditionalNode
* @extends {Node}
*/
function ConditionalNode(condition, trueExpr, falseExpr) {
if (!(this instanceof ConditionalNode)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
if (!Object(is["w" /* isNode */])(condition)) throw new TypeError('Parameter condition must be a Node');
if (!Object(is["w" /* isNode */])(trueExpr)) throw new TypeError('Parameter trueExpr must be a Node');
if (!Object(is["w" /* isNode */])(falseExpr)) throw new TypeError('Parameter falseExpr must be a Node');
this.condition = condition;
this.trueExpr = trueExpr;
this.falseExpr = falseExpr;
}
ConditionalNode.prototype = new Node();
ConditionalNode.prototype.type = 'ConditionalNode';
ConditionalNode.prototype.isConditionalNode = true;
/**
* Compile a node into a JavaScript function.
* This basically pre-calculates as much as possible and only leaves open
* calculations which depend on a dynamic scope with variables.
* @param {Object} math Math.js namespace with functions and constants.
* @param {Object} argNames An object with argument names as key and `true`
* as value. Used in the SymbolNode to optimize
* for arguments from user assigned functions
* (see FunctionAssignmentNode) or special symbols
* like `end` (see IndexNode).
* @return {function} Returns a function which can be called like:
* evalNode(scope: Object, args: Object, context: *)
*/
ConditionalNode.prototype._compile = function (math, argNames) {
var evalCondition = this.condition._compile(math, argNames);
var evalTrueExpr = this.trueExpr._compile(math, argNames);
var evalFalseExpr = this.falseExpr._compile(math, argNames);
return function evalConditionalNode(scope, args, context) {
return testCondition(evalCondition(scope, args, context)) ? evalTrueExpr(scope, args, context) : evalFalseExpr(scope, args, context);
};
};
/**
* Execute a callback for each of the child nodes of this node
* @param {function(child: Node, path: string, parent: Node)} callback
*/
ConditionalNode.prototype.forEach = function (callback) {
callback(this.condition, 'condition', this);
callback(this.trueExpr, 'trueExpr', this);
callback(this.falseExpr, 'falseExpr', this);
};
/**
* Create a new ConditionalNode having it's childs be the results of calling
* the provided callback function for each of the childs of the original node.
* @param {function(child: Node, path: string, parent: Node): Node} callback
* @returns {ConditionalNode} Returns a transformed copy of the node
*/
ConditionalNode.prototype.map = function (callback) {
return new ConditionalNode(this._ifNode(callback(this.condition, 'condition', this)), this._ifNode(callback(this.trueExpr, 'trueExpr', this)), this._ifNode(callback(this.falseExpr, 'falseExpr', this)));
};
/**
* Create a clone of this node, a shallow copy
* @return {ConditionalNode}
*/
ConditionalNode.prototype.clone = function () {
return new ConditionalNode(this.condition, this.trueExpr, this.falseExpr);
};
/**
* Get string representation
* @param {Object} options
* @return {string} str
*/
ConditionalNode.prototype._toString = function (options) {
var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
var precedence = getPrecedence(this, parenthesis); // Enclose Arguments in parentheses if they are an OperatorNode
// or have lower or equal precedence
// NOTE: enclosing all OperatorNodes in parentheses is a decision
// purely based on aesthetics and readability
var condition = this.condition.toString(options);
var conditionPrecedence = getPrecedence(this.condition, parenthesis);
if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {
condition = '(' + condition + ')';
}
var trueExpr = this.trueExpr.toString(options);
var truePrecedence = getPrecedence(this.trueExpr, parenthesis);
if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {
trueExpr = '(' + trueExpr + ')';
}
var falseExpr = this.falseExpr.toString(options);
var falsePrecedence = getPrecedence(this.falseExpr, parenthesis);
if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {
falseExpr = '(' + falseExpr + ')';
}
return condition + ' ? ' + trueExpr + ' : ' + falseExpr;
};
/**
* Get a JSON representation of the node
* @returns {Object}
*/
ConditionalNode.prototype.toJSON = function () {
return {
mathjs: 'ConditionalNode',
condition: this.condition,
trueExpr: this.trueExpr,
falseExpr: this.falseExpr
};
};
/**
* Instantiate an ConditionalNode from its JSON representation
* @param {Object} json An object structured like
* `{"mathjs": "ConditionalNode", "condition": ..., "trueExpr": ..., "falseExpr": ...}`,
* where mathjs is optional
* @returns {ConditionalNode}
*/
ConditionalNode.fromJSON = function (json) {
return new ConditionalNode(json.condition, json.trueExpr, json.falseExpr);
};
/**
* Get HTML representation
* @param {Object} options
* @return {string} str
*/
ConditionalNode.prototype.toHTML = function (options) {
var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
var precedence = getPrecedence(this, parenthesis); // Enclose Arguments in parentheses if they are an OperatorNode
// or have lower or equal precedence
// NOTE: enclosing all OperatorNodes in parentheses is a decision
// purely based on aesthetics and readability
var condition = this.condition.toHTML(options);
var conditionPrecedence = getPrecedence(this.condition, parenthesis);
if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {
condition = '<span class="math-parenthesis math-round-parenthesis">(</span>' + condition + '<span class="math-parenthesis math-round-parenthesis">)</span>';
}
var trueExpr = this.trueExpr.toHTML(options);
var truePrecedence = getPrecedence(this.trueExpr, parenthesis);
if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {
trueExpr = '<span class="math-parenthesis math-round-parenthesis">(</span>' + trueExpr + '<span class="math-parenthesis math-round-parenthesis">)</span>';
}
var falseExpr = this.falseExpr.toHTML(options);
var falsePrecedence = getPrecedence(this.falseExpr, parenthesis);
if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {
falseExpr = '<span class="math-parenthesis math-round-parenthesis">(</span>' + falseExpr + '<span class="math-parenthesis math-round-parenthesis">)</span>';
}
return condition + '<span class="math-operator math-conditional-operator">?</span>' + trueExpr + '<span class="math-operator math-conditional-operator">:</span>' + falseExpr;
};
/**
* Get LaTeX representation
* @param {Object} options
* @return {string} str
*/
ConditionalNode.prototype._toTex = function (options) {
return '\\begin{cases} {' + this.trueExpr.toTex(options) + '}, &\\quad{\\text{if }\\;' + this.condition.toTex(options) + '}\\\\{' + this.falseExpr.toTex(options) + '}, &\\quad{\\text{otherwise}}\\end{cases}';
};
/**
* Test whether a condition is met
* @param {*} condition
* @returns {boolean} true if condition is true or non-zero, else false
*/
function testCondition(condition) {
if (typeof condition === 'number' || typeof condition === 'boolean' || typeof condition === 'string') {
return !!condition;
}
if (condition) {
if (Object(is["e" /* isBigNumber */])(condition)) {
return !condition.isZero();
}
if (Object(is["j" /* isComplex */])(condition)) {
return !!(condition.re || condition.im);
}
if (Object(is["L" /* isUnit */])(condition)) {
return !!condition.value;
}
}
if (condition === null || condition === undefined) {
return false;
}
throw new TypeError('Unsupported type of condition "' + Object(is["M" /* typeOf */])(condition) + '"');
}
return ConditionalNode;
}, {
isClass: true,
isNode: true
});
// EXTERNAL MODULE: ./node_modules/escape-latex/dist/index.js
var dist = __webpack_require__(16);
var dist_default = /*#__PURE__*/__webpack_require__.n(dist);
// CONCATENATED MODULE: ./src/utils/latex.js
/* eslint no-template-curly-in-string: "off" */
var latexSymbols = {
// GREEK LETTERS
Alpha: 'A',
alpha: '\\alpha',
Beta: 'B',
beta: '\\beta',
Gamma: '\\Gamma',
gamma: '\\gamma',
Delta: '\\Delta',
delta: '\\delta',
Epsilon: 'E',
epsilon: '\\epsilon',
varepsilon: '\\varepsilon',
Zeta: 'Z',
zeta: '\\zeta',
Eta: 'H',
eta: '\\eta',
Theta: '\\Theta',
theta: '\\theta',
vartheta: '\\vartheta',
Iota: 'I',
iota: '\\iota',
Kappa: 'K',
kappa: '\\kappa',
varkappa: '\\varkappa',
Lambda: '\\Lambda',
lambda: '\\lambda',
Mu: 'M',
mu: '\\mu',
Nu: 'N',
nu: '\\nu',
Xi: '\\Xi',
xi: '\\xi',
Omicron: 'O',
omicron: 'o',
Pi: '\\Pi',
pi: '\\pi',
varpi: '\\varpi',
Rho: 'P',
rho: '\\rho',
varrho: '\\varrho',
Sigma: '\\Sigma',
sigma: '\\sigma',
varsigma: '\\varsigma',
Tau: 'T',
tau: '\\tau',
Upsilon: "\\Upsilon",
upsilon: "\\upsilon",
Phi: '\\Phi',
phi: '\\phi',
varphi: '\\varphi',
Chi: 'X',
chi: '\\chi',
Psi: '\\Psi',
psi: '\\psi',
Omega: '\\Omega',
omega: '\\omega',
// logic
"true": '\\mathrm{True}',
"false": '\\mathrm{False}',
// other
i: 'i',
// TODO use \i ??
inf: '\\infty',
Inf: '\\infty',
infinity: '\\infty',
Infinity: '\\infty',
oo: '\\infty',
lim: '\\lim',
undefined: '\\mathbf{?}'
};
var latexOperators = {
transpose: '^\\top',
ctranspose: '^H',
factorial: '!',
pow: '^',
dotPow: '.^\\wedge',
// TODO find ideal solution
unaryPlus: '+',
unaryMinus: '-',
bitNot: '\\~',
// TODO find ideal solution
not: '\\neg',
multiply: '\\cdot',
divide: '\\frac',
// TODO how to handle that properly?
dotMultiply: '.\\cdot',
// TODO find ideal solution
dotDivide: '.:',
// TODO find ideal solution
mod: '\\mod',
add: '+',
subtract: '-',
to: '\\rightarrow',
leftShift: '<<',
rightArithShift: '>>',
rightLogShift: '>>>',
equal: '=',
unequal: '\\neq',
smaller: '<',
larger: '>',
smallerEq: '\\leq',
largerEq: '\\geq',
bitAnd: '\\&',
bitXor: "\\underline{|}",
bitOr: '|',
and: '\\wedge',
xor: '\\veebar',
or: '\\vee'
};
var latexFunctions = {
// arithmetic
abs: {
1: '\\left|${args[0]}\\right|'
},
add: {
2: "\\left(${args[0]}".concat(latexOperators.add, "${args[1]}\\right)")
},
cbrt: {
1: '\\sqrt[3]{${args[0]}}'
},
ceil: {
1: '\\left\\lceil${args[0]}\\right\\rceil'
},
cube: {
1: '\\left(${args[0]}\\right)^3'
},
divide: {
2: '\\frac{${args[0]}}{${args[1]}}'
},
dotDivide: {
2: "\\left(${args[0]}".concat(latexOperators.dotDivide, "${args[1]}\\right)")
},
dotMultiply: {
2: "\\left(${args[0]}".concat(latexOperators.dotMultiply, "${args[1]}\\right)")
},
dotPow: {
2: "\\left(${args[0]}".concat(latexOperators.dotPow, "${args[1]}\\right)")
},
exp: {
1: '\\exp\\left(${args[0]}\\right)'
},
expm1: "\\left(e".concat(latexOperators.pow, "{${args[0]}}-1\\right)"),
fix: {
1: '\\mathrm{${name}}\\left(${args[0]}\\right)'
},
floor: {
1: '\\left\\lfloor${args[0]}\\right\\rfloor'
},
gcd: '\\gcd\\left(${args}\\right)',
hypot: '\\hypot\\left(${args}\\right)',
log: {
1: '\\ln\\left(${args[0]}\\right)',
2: '\\log_{${args[1]}}\\left(${args[0]}\\right)'
},
log10: {
1: '\\log_{10}\\left(${args[0]}\\right)'
},
log1p: {
1: '\\ln\\left(${args[0]}+1\\right)',
2: '\\log_{${args[1]}}\\left(${args[0]}+1\\right)'
},
log2: '\\log_{2}\\left(${args[0]}\\right)',
mod: {
2: "\\left(${args[0]}".concat(latexOperators.mod, "${args[1]}\\right)")
},
multiply: {
2: "\\left(${args[0]}".concat(latexOperators.multiply, "${args[1]}\\right)")
},
norm: {
1: '\\left\\|${args[0]}\\right\\|',
2: undefined // use default template
},
nthRoot: {
2: '\\sqrt[${args[1]}]{${args[0]}}'
},
nthRoots: {
2: '\\{y : $y^{args[1]} = {${args[0]}}\\}'
},
pow: {
2: "\\left(${args[0]}\\right)".concat(latexOperators.pow, "{${args[1]}}")
},
round: {
1: '\\left\\lfloor${args[0]}\\right\\rceil',
2: undefined // use default template
},
sign: {
1: '\\mathrm{${name}}\\left(${args[0]}\\right)'
},
sqrt: {
1: '\\sqrt{${args[0]}}'
},
square: {
1: '\\left(${args[0]}\\right)^2'
},
subtract: {
2: "\\left(${args[0]}".concat(latexOperators.subtract, "${args[1]}\\right)")
},
unaryMinus: {
1: "".concat(latexOperators.unaryMinus, "\\left(${args[0]}\\right)")
},
unaryPlus: {
1: "".concat(latexOperators.unaryPlus, "\\left(${args[0]}\\right)")
},
// bitwise
bitAnd: {
2: "\\left(${args[0]}".concat(latexOperators.bitAnd, "${args[1]}\\right)")
},
bitNot: {
1: latexOperators.bitNot + '\\left(${args[0]}\\right)'
},
bitOr: {
2: "\\left(${args[0]}".concat(latexOperators.bitOr, "${args[1]}\\right)")
},
bitXor: {
2: "\\left(${args[0]}".concat(latexOperators.bitXor, "${args[1]}\\right)")
},
leftShift: {
2: "\\left(${args[0]}".concat(latexOperators.leftShift, "${args[1]}\\right)")
},
rightArithShift: {
2: "\\left(${args[0]}".concat(latexOperators.rightArithShift, "${args[1]}\\right)")
},
rightLogShift: {
2: "\\left(${args[0]}".concat(latexOperators.rightLogShift, "${args[1]}\\right)")
},
// combinatorics
bellNumbers: {
1: '\\mathrm{B}_{${args[0]}}'
},
catalan: {
1: '\\mathrm{C}_{${args[0]}}'
},
stirlingS2: {
2: '\\mathrm{S}\\left(${args}\\right)'
},
// complex
arg: {
1: '\\arg\\left(${args[0]}\\right)'
},
conj: {
1: '\\left(${args[0]}\\right)^*'
},
im: {
1: '\\Im\\left\\lbrace${args[0]}\\right\\rbrace'
},
re: {
1: '\\Re\\left\\lbrace${args[0]}\\right\\rbrace'
},
// logical
and: {
2: "\\left(${args[0]}".concat(latexOperators.and, "${args[1]}\\right)")
},
not: {
1: latexOperators.not + '\\left(${args[0]}\\right)'
},
or: {
2: "\\left(${args[0]}".concat(latexOperators.or, "${args[1]}\\right)")
},
xor: {
2: "\\left(${args[0]}".concat(latexOperators.xor, "${args[1]}\\right)")
},
// matrix
cross: {
2: '\\left(${args[0]}\\right)\\times\\left(${args[1]}\\right)'
},
ctranspose: {
1: "\\left(${args[0]}\\right)".concat(latexOperators.ctranspose)
},
det: {
1: '\\det\\left(${args[0]}\\right)'
},
dot: {
2: '\\left(${args[0]}\\cdot${args[1]}\\right)'
},
expm: {
1: '\\exp\\left(${args[0]}\\right)'
},
inv: {
1: '\\left(${args[0]}\\right)^{-1}'
},
sqrtm: {
1: "{${args[0]}}".concat(latexOperators.pow, "{\\frac{1}{2}}")
},
trace: {
1: '\\mathrm{tr}\\left(${args[0]}\\right)'
},
transpose: {
1: "\\left(${args[0]}\\right)".concat(latexOperators.transpose)
},
// probability
combinations: {
2: '\\binom{${args[0]}}{${args[1]}}'
},
combinationsWithRep: {
2: '\\left(\\!\\!{\\binom{${args[0]}}{${args[1]}}}\\!\\!\\right)'
},
factorial: {
1: "\\left(${args[0]}\\right)".concat(latexOperators.factorial)
},
gamma: {
1: '\\Gamma\\left(${args[0]}\\right)'
},
// relational
equal: {
2: "\\left(${args[0]}".concat(latexOperators.equal, "${args[1]}\\right)")
},
larger: {
2: "\\left(${args[0]}".concat(latexOperators.larger, "${args[1]}\\right)")
},
largerEq: {
2: "\\left(${args[0]}".concat(latexOperators.largerEq, "${args[1]}\\right)")
},
smaller: {
2: "\\left(${args[0]}".concat(latexOperators.smaller, "${args[1]}\\right)")
},
smallerEq: {
2: "\\left(${args[0]}".concat(latexOperators.smallerEq, "${args[1]}\\right)")
},
unequal: {
2: "\\left(${args[0]}".concat(latexOperators.unequal, "${args[1]}\\right)")
},
// special
erf: {
1: 'erf\\left(${args[0]}\\right)'
},
// statistics
max: '\\max\\left(${args}\\right)',
min: '\\min\\left(${args}\\right)',
variance: '\\mathrm{Var}\\left(${args}\\right)',
// trigonometry
acos: {
1: '\\cos^{-1}\\left(${args[0]}\\right)'
},
acosh: {
1: '\\cosh^{-1}\\left(${args[0]}\\right)'
},
acot: {
1: '\\cot^{-1}\\left(${args[0]}\\right)'
},
acoth: {
1: '\\coth^{-1}\\left(${args[0]}\\right)'
},
acsc: {
1: '\\csc^{-1}\\left(${args[0]}\\right)'
},
acsch: {
1: '\\mathrm{csch}^{-1}\\left(${args[0]}\\right)'
},
asec: {
1: '\\sec^{-1}\\left(${args[0]}\\right)'
},
asech: {
1: '\\mathrm{sech}^{-1}\\left(${args[0]}\\right)'
},
asin: {
1: '\\sin^{-1}\\left(${args[0]}\\right)'
},
asinh: {
1: '\\sinh^{-1}\\left(${args[0]}\\right)'
},
atan: {
1: '\\tan^{-1}\\left(${args[0]}\\right)'
},
atan2: {
2: '\\mathrm{atan2}\\left(${args}\\right)'
},
atanh: {
1: '\\tanh^{-1}\\left(${args[0]}\\right)'
},
cos: {
1: '\\cos\\left(${args[0]}\\right)'
},
cosh: {
1: '\\cosh\\left(${args[0]}\\right)'
},
cot: {
1: '\\cot\\left(${args[0]}\\right)'
},
coth: {
1: '\\coth\\left(${args[0]}\\right)'
},
csc: {
1: '\\csc\\left(${args[0]}\\right)'
},
csch: {
1: '\\mathrm{csch}\\left(${args[0]}\\right)'
},
sec: {
1: '\\sec\\left(${args[0]}\\right)'
},
sech: {
1: '\\mathrm{sech}\\left(${args[0]}\\right)'
},
sin: {
1: '\\sin\\left(${args[0]}\\right)'
},
sinh: {
1: '\\sinh\\left(${args[0]}\\right)'
},
tan: {
1: '\\tan\\left(${args[0]}\\right)'
},
tanh: {
1: '\\tanh\\left(${args[0]}\\right)'
},
// unit
to: {
2: "\\left(${args[0]}".concat(latexOperators.to, "${args[1]}\\right)")
},
// utils
numeric: function numeric(node, options) {
// Not sure if this is strictly right but should work correctly for the vast majority of use cases.
return node.args[0].toTex();
},
// type
number: {
0: '0',
1: '\\left(${args[0]}\\right)',
2: '\\left(\\left(${args[0]}\\right)${args[1]}\\right)'
},
string: {
0: '\\mathtt{""}',
1: '\\mathrm{string}\\left(${args[0]}\\right)'
},
bignumber: {
0: '0',
1: '\\left(${args[0]}\\right)'
},
complex: {
0: '0',
1: '\\left(${args[0]}\\right)',
2: "\\left(\\left(${args[0]}\\right)+".concat(latexSymbols.i, "\\cdot\\left(${args[1]}\\right)\\right)")
},
matrix: {
0: '\\begin{bmatrix}\\end{bmatrix}',
1: '\\left(${args[0]}\\right)',
2: '\\left(${args[0]}\\right)'
},
sparse: {
0: '\\begin{bsparse}\\end{bsparse}',
1: '\\left(${args[0]}\\right)'
},
unit: {
1: '\\left(${args[0]}\\right)',
2: '\\left(\\left(${args[0]}\\right)${args[1]}\\right)'
}
};
var defaultTemplate = '\\mathrm{${name}}\\left(${args}\\right)';
var latexUnits = {
deg: '^\\circ'
};
function escapeLatex(string) {
return dist_default()(string, {
preserveFormatting: true
});
} // @param {string} name
// @param {boolean} isUnit
function toSymbol(name, isUnit) {
isUnit = typeof isUnit === 'undefined' ? false : isUnit;
if (isUnit) {
if (Object(utils_object["f" /* hasOwnProperty */])(latexUnits, name)) {
return latexUnits[name];
}
return '\\mathrm{' + escapeLatex(name) + '}';
}
if (Object(utils_object["f" /* hasOwnProperty */])(latexSymbols, name)) {
return latexSymbols[name];
}
return escapeLatex(name);
}
// CONCATENATED MODULE: ./src/expression/node/ConstantNode.js
var ConstantNode_name = 'ConstantNode';
var ConstantNode_dependencies = ['Node'];
var ConstantNode_createConstantNode = /* #__PURE__ */Object(factory["a" /* factory */])(ConstantNode_name, ConstantNode_dependencies, function (_ref) {
var Node = _ref.Node;
/**
* A ConstantNode holds a constant value like a number or string.
*
* Usage:
*
* new ConstantNode(2.3)
* new ConstantNode('hello')
*
* @param {*} value Value can be any type (number, BigNumber, string, ...)
* @constructor ConstantNode
* @extends {Node}
*/
function ConstantNode(value) {
if (!(this instanceof ConstantNode)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
this.value = value;
}
ConstantNode.prototype = new Node();
ConstantNode.prototype.type = 'ConstantNode';
ConstantNode.prototype.isConstantNode = true;
/**
* Compile a node into a JavaScript function.
* This basically pre-calculates as much as possible and only leaves open
* calculations which depend on a dynamic scope with variables.
* @param {Object} math Math.js namespace with functions and constants.
* @param {Object} argNames An object with argument names as key and `true`
* as value. Used in the SymbolNode to optimize
* for arguments from user assigned functions
* (see FunctionAssignmentNode) or special symbols
* like `end` (see IndexNode).
* @return {function} Returns a function which can be called like:
* evalNode(scope: Object, args: Object, context: *)
*/
ConstantNode.prototype._compile = function (math, argNames) {
var value = this.value;
return function evalConstantNode() {
return value;
};
};
/**
* Execute a callback for each of the child nodes of this node
* @param {function(child: Node, path: string, parent: Node)} callback
*/
ConstantNode.prototype.forEach = function (callback) {// nothing to do, we don't have childs
};
/**
* Create a new ConstantNode having it's childs be the results of calling
* the provided callback function for each of the childs of the original node.
* @param {function(child: Node, path: string, parent: Node) : Node} callback
* @returns {ConstantNode} Returns a clone of the node
*/
ConstantNode.prototype.map = function (callback) {
return this.clone();
};
/**
* Create a clone of this node, a shallow copy
* @return {ConstantNode}
*/
ConstantNode.prototype.clone = function () {
return new ConstantNode(this.value);
};
/**
* Get string representation
* @param {Object} options
* @return {string} str
*/
ConstantNode.prototype._toString = function (options) {
return Object(utils_string["d" /* format */])(this.value, options);
};
/**
* Get HTML representation
* @param {Object} options
* @return {string} str
*/
ConstantNode.prototype.toHTML = function (options) {
var value = this._toString(options);
switch (Object(is["M" /* typeOf */])(this.value)) {
case 'number':
case 'BigNumber':
case 'Fraction':
return '<span class="math-number">' + value + '</span>';
case 'string':
return '<span class="math-string">' + value + '</span>';
case 'boolean':
return '<span class="math-boolean">' + value + '</span>';
case 'null':
return '<span class="math-null-symbol">' + value + '</span>';
case 'undefined':
return '<span class="math-undefined">' + value + '</span>';
default:
return '<span class="math-symbol">' + value + '</span>';
}
};
/**
* Get a JSON representation of the node
* @returns {Object}
*/
ConstantNode.prototype.toJSON = function () {
return {
mathjs: 'ConstantNode',
value: this.value
};
};
/**
* Instantiate a ConstantNode from its JSON representation
* @param {Object} json An object structured like
* `{"mathjs": "SymbolNode", value: 2.3}`,
* where mathjs is optional
* @returns {ConstantNode}
*/
ConstantNode.fromJSON = function (json) {
return new ConstantNode(json.value);
};
/**
* Get LaTeX representation
* @param {Object} options
* @return {string} str
*/
ConstantNode.prototype._toTex = function (options) {
var value = this._toString(options);
switch (Object(is["M" /* typeOf */])(this.value)) {
case 'string':
return '\\mathtt{' + escapeLatex(value) + '}';
case 'number':
case 'BigNumber':
{
if (!isFinite(this.value)) {
return this.value.valueOf() < 0 ? '-\\infty' : '\\infty';
}
var index = value.toLowerCase().indexOf('e');
if (index !== -1) {
return value.substring(0, index) + '\\cdot10^{' + value.substring(index + 1) + '}';
}
}
return value;
case 'Fraction':
return this.value.toLatex();
default:
return value;
}
};
return ConstantNode;
}, {
isClass: true,
isNode: true
});
// CONCATENATED MODULE: ./src/expression/node/FunctionAssignmentNode.js
var FunctionAssignmentNode_name = 'FunctionAssignmentNode';
var FunctionAssignmentNode_dependencies = ['typed', 'Node'];
var createFunctionAssignmentNode = /* #__PURE__ */Object(factory["a" /* factory */])(FunctionAssignmentNode_name, FunctionAssignmentNode_dependencies, function (_ref) {
var typed = _ref.typed,
Node = _ref.Node;
/**
* @constructor FunctionAssignmentNode
* @extends {Node}
* Function assignment
*
* @param {string} name Function name
* @param {string[] | Array.<{name: string, type: string}>} params
* Array with function parameter names, or an
* array with objects containing the name
* and type of the parameter
* @param {Node} expr The function expression
*/
function FunctionAssignmentNode(name, params, expr) {
if (!(this instanceof FunctionAssignmentNode)) {
throw new SyntaxError('Constructor must be called with the new operator');
} // validate input
if (typeof name !== 'string') throw new TypeError('String expected for parameter "name"');
if (!Array.isArray(params)) throw new TypeError('Array containing strings or objects expected for parameter "params"');
if (!Object(is["w" /* isNode */])(expr)) throw new TypeError('Node expected for parameter "expr"');
if (name in keywords) throw new Error('Illegal function name, "' + name + '" is a reserved keyword');
this.name = name;
this.params = params.map(function (param) {
return param && param.name || param;
});
this.types = params.map(function (param) {
return param && param.type || 'any';
});
this.expr = expr;
}
FunctionAssignmentNode.prototype = new Node();
FunctionAssignmentNode.prototype.type = 'FunctionAssignmentNode';
FunctionAssignmentNode.prototype.isFunctionAssignmentNode = true;
/**
* Compile a node into a JavaScript function.
* This basically pre-calculates as much as possible and only leaves open
* calculations which depend on a dynamic scope with variables.
* @param {Object} math Math.js namespace with functions and constants.
* @param {Object} argNames An object with argument names as key and `true`
* as value. Used in the SymbolNode to optimize
* for arguments from user assigned functions
* (see FunctionAssignmentNode) or special symbols
* like `end` (see IndexNode).
* @return {function} Returns a function which can be called like:
* evalNode(scope: Object, args: Object, context: *)
*/
FunctionAssignmentNode.prototype._compile = function (math, argNames) {
var childArgNames = Object.create(argNames);
Object(utils_array["f" /* forEach */])(this.params, function (param) {
childArgNames[param] = true;
}); // compile the function expression with the child args
var evalExpr = this.expr._compile(math, childArgNames);
var name = this.name;
var params = this.params;
var signature = Object(utils_array["j" /* join */])(this.types, ',');
var syntax = name + '(' + Object(utils_array["j" /* join */])(this.params, ', ') + ')';
return function evalFunctionAssignmentNode(scope, args, context) {
var signatures = {};
signatures[signature] = function () {
var childArgs = Object.create(args);
for (var i = 0; i < params.length; i++) {
childArgs[params[i]] = arguments[i];
}
return evalExpr(scope, childArgs, context);
};
var fn = typed(name, signatures);
fn.syntax = syntax;
setSafeProperty(scope, name, fn);
return fn;
};
};
/**
* Execute a callback for each of the child nodes of this node
* @param {function(child: Node, path: string, parent: Node)} callback
*/
FunctionAssignmentNode.prototype.forEach = function (callback) {
callback(this.expr, 'expr', this);
};
/**
* Create a new FunctionAssignmentNode having it's childs be the results of calling
* the provided callback function for each of the childs of the original node.
* @param {function(child: Node, path: string, parent: Node): Node} callback
* @returns {FunctionAssignmentNode} Returns a transformed copy of the node
*/
FunctionAssignmentNode.prototype.map = function (callback) {
var expr = this._ifNode(callback(this.expr, 'expr', this));
return new FunctionAssignmentNode(this.name, this.params.slice(0), expr);
};
/**
* Create a clone of this node, a shallow copy
* @return {FunctionAssignmentNode}
*/
FunctionAssignmentNode.prototype.clone = function () {
return new FunctionAssignmentNode(this.name, this.params.slice(0), this.expr);
};
/**
* Is parenthesis needed?
* @param {Node} node
* @param {Object} parenthesis
* @private
*/
function needParenthesis(node, parenthesis) {
var precedence = getPrecedence(node, parenthesis);
var exprPrecedence = getPrecedence(node.expr, parenthesis);
return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;
}
/**
* get string representation
* @param {Object} options
* @return {string} str
*/
FunctionAssignmentNode.prototype._toString = function (options) {
var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
var expr = this.expr.toString(options);
if (needParenthesis(this, parenthesis)) {
expr = '(' + expr + ')';
}
return this.name + '(' + this.params.join(', ') + ') = ' + expr;
};
/**
* Get a JSON representation of the node
* @returns {Object}
*/
FunctionAssignmentNode.prototype.toJSON = function () {
var types = this.types;
return {
mathjs: 'FunctionAssignmentNode',
name: this.name,
params: this.params.map(function (param, index) {
return {
name: param,
type: types[index]
};
}),
expr: this.expr
};
};
/**
* Instantiate an FunctionAssignmentNode from its JSON representation
* @param {Object} json An object structured like
* `{"mathjs": "FunctionAssignmentNode", name: ..., params: ..., expr: ...}`,
* where mathjs is optional
* @returns {FunctionAssignmentNode}
*/
FunctionAssignmentNode.fromJSON = function (json) {
return new FunctionAssignmentNode(json.name, json.params, json.expr);
};
/**
* get HTML representation
* @param {Object} options
* @return {string} str
*/
FunctionAssignmentNode.prototype.toHTML = function (options) {
var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
var params = [];
for (var i = 0; i < this.params.length; i++) {
params.push('<span class="math-symbol math-parameter">' + Object(utils_string["c" /* escape */])(this.params[i]) + '</span>');
}
var expr = this.expr.toHTML(options);
if (needParenthesis(this, parenthesis)) {
expr = '<span class="math-parenthesis math-round-parenthesis">(</span>' + expr + '<span class="math-parenthesis math-round-parenthesis">)</span>';
}
return '<span class="math-function">' + Object(utils_string["c" /* escape */])(this.name) + '</span>' + '<span class="math-parenthesis math-round-parenthesis">(</span>' + params.join('<span class="math-separator">,</span>') + '<span class="math-parenthesis math-round-parenthesis">)</span><span class="math-operator math-assignment-operator math-variable-assignment-operator math-binary-operator">=</span>' + expr;
};
/**
* get LaTeX representation
* @param {Object} options
* @return {string} str
*/
FunctionAssignmentNode.prototype._toTex = function (options) {
var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
var expr = this.expr.toTex(options);
if (needParenthesis(this, parenthesis)) {
expr = "\\left(".concat(expr, "\\right)");
}
return '\\mathrm{' + this.name + '}\\left(' + this.params.map(toSymbol).join(',') + '\\right):=' + expr;
};
return FunctionAssignmentNode;
}, {
isClass: true,
isNode: true
});
// CONCATENATED MODULE: ./src/expression/node/IndexNode.js
function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }
function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && Symbol.iterator in Object(iter)) return Array.from(iter); }
function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
var IndexNode_name = 'IndexNode';
var IndexNode_dependencies = ['Range', 'Node', 'size'];
var createIndexNode = /* #__PURE__ */Object(factory["a" /* factory */])(IndexNode_name, IndexNode_dependencies, function (_ref) {
var Range = _ref.Range,
Node = _ref.Node,
size = _ref.size;
/**
* @constructor IndexNode
* @extends Node
*
* Describes a subset of a matrix or an object property.
* Cannot be used on its own, needs to be used within an AccessorNode or
* AssignmentNode.
*
* @param {Node[]} dimensions
* @param {boolean} [dotNotation=false] Optional property describing whether
* this index was written using dot
* notation like `a.b`, or using bracket
* notation like `a["b"]` (default).
* Used to stringify an IndexNode.
*/
function IndexNode(dimensions, dotNotation) {
if (!(this instanceof IndexNode)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
this.dimensions = dimensions;
this.dotNotation = dotNotation || false; // validate input
if (!Array.isArray(dimensions) || !dimensions.every(is["w" /* isNode */])) {
throw new TypeError('Array containing Nodes expected for parameter "dimensions"');
}
if (this.dotNotation && !this.isObjectProperty()) {
throw new Error('dotNotation only applicable for object properties');
}
}
IndexNode.prototype = new Node();
IndexNode.prototype.type = 'IndexNode';
IndexNode.prototype.isIndexNode = true;
/**
* Compile a node into a JavaScript function.
* This basically pre-calculates as much as possible and only leaves open
* calculations which depend on a dynamic scope with variables.
* @param {Object} math Math.js namespace with functions and constants.
* @param {Object} argNames An object with argument names as key and `true`
* as value. Used in the SymbolNode to optimize
* for arguments from user assigned functions
* (see FunctionAssignmentNode) or special symbols
* like `end` (see IndexNode).
* @return {function} Returns a function which can be called like:
* evalNode(scope: Object, args: Object, context: *)
*/
IndexNode.prototype._compile = function (math, argNames) {
// TODO: implement support for bignumber (currently bignumbers are silently
// reduced to numbers when changing the value to zero-based)
// TODO: Optimization: when the range values are ConstantNodes,
// we can beforehand resolve the zero-based value
// optimization for a simple object property
var evalDimensions = Object(utils_array["k" /* map */])(this.dimensions, function (range, i) {
if (Object(is["E" /* isRangeNode */])(range)) {
if (range.needsEnd()) {
// create a range containing end (like '4:end')
var childArgNames = Object.create(argNames);
childArgNames.end = true;
var evalStart = range.start._compile(math, childArgNames);
var evalEnd = range.end._compile(math, childArgNames);
var evalStep = range.step ? range.step._compile(math, childArgNames) : function () {
return 1;
};
return function evalDimension(scope, args, context) {
var s = size(context).valueOf();
var childArgs = Object.create(args);
childArgs.end = s[i];
return createRange(evalStart(scope, childArgs, context), evalEnd(scope, childArgs, context), evalStep(scope, childArgs, context));
};
} else {
// create range
var _evalStart = range.start._compile(math, argNames);
var _evalEnd = range.end._compile(math, argNames);
var _evalStep = range.step ? range.step._compile(math, argNames) : function () {
return 1;
};
return function evalDimension(scope, args, context) {
return createRange(_evalStart(scope, args, context), _evalEnd(scope, args, context), _evalStep(scope, args, context));
};
}
} else if (Object(is["J" /* isSymbolNode */])(range) && range.name === 'end') {
// SymbolNode 'end'
var _childArgNames = Object.create(argNames);
_childArgNames.end = true;
var evalRange = range._compile(math, _childArgNames);
return function evalDimension(scope, args, context) {
var s = size(context).valueOf();
var childArgs = Object.create(args);
childArgs.end = s[i];
return evalRange(scope, childArgs, context);
};
} else {
// ConstantNode
var _evalRange = range._compile(math, argNames);
return function evalDimension(scope, args, context) {
return _evalRange(scope, args, context);
};
}
});
var index = getSafeProperty(math, 'index');
return function evalIndexNode(scope, args, context) {
var dimensions = Object(utils_array["k" /* map */])(evalDimensions, function (evalDimension) {
return evalDimension(scope, args, context);
});
return index.apply(void 0, _toConsumableArray(dimensions));
};
};
/**
* Execute a callback for each of the child nodes of this node
* @param {function(child: Node, path: string, parent: Node)} callback
*/
IndexNode.prototype.forEach = function (callback) {
for (var i = 0; i < this.dimensions.length; i++) {
callback(this.dimensions[i], 'dimensions[' + i + ']', this);
}
};
/**
* Create a new IndexNode having it's childs be the results of calling
* the provided callback function for each of the childs of the original node.
* @param {function(child: Node, path: string, parent: Node): Node} callback
* @returns {IndexNode} Returns a transformed copy of the node
*/
IndexNode.prototype.map = function (callback) {
var dimensions = [];
for (var i = 0; i < this.dimensions.length; i++) {
dimensions[i] = this._ifNode(callback(this.dimensions[i], 'dimensions[' + i + ']', this));
}
return new IndexNode(dimensions, this.dotNotation);
};
/**
* Create a clone of this node, a shallow copy
* @return {IndexNode}
*/
IndexNode.prototype.clone = function () {
return new IndexNode(this.dimensions.slice(0), this.dotNotation);
};
/**
* Test whether this IndexNode contains a single property name
* @return {boolean}
*/
IndexNode.prototype.isObjectProperty = function () {
return this.dimensions.length === 1 && Object(is["l" /* isConstantNode */])(this.dimensions[0]) && typeof this.dimensions[0].value === 'string';
};
/**
* Returns the property name if IndexNode contains a property.
* If not, returns null.
* @return {string | null}
*/
IndexNode.prototype.getObjectProperty = function () {
return this.isObjectProperty() ? this.dimensions[0].value : null;
};
/**
* Get string representation
* @param {Object} options
* @return {string} str
*/
IndexNode.prototype._toString = function (options) {
// format the parameters like "[1, 0:5]"
return this.dotNotation ? '.' + this.getObjectProperty() : '[' + this.dimensions.join(', ') + ']';
};
/**
* Get a JSON representation of the node
* @returns {Object}
*/
IndexNode.prototype.toJSON = function () {
return {
mathjs: 'IndexNode',
dimensions: this.dimensions,
dotNotation: this.dotNotation
};
};
/**
* Instantiate an IndexNode from its JSON representation
* @param {Object} json An object structured like
* `{"mathjs": "IndexNode", dimensions: [...], dotNotation: false}`,
* where mathjs is optional
* @returns {IndexNode}
*/
IndexNode.fromJSON = function (json) {
return new IndexNode(json.dimensions, json.dotNotation);
};
/**
* Get HTML representation
* @param {Object} options
* @return {string} str
*/
IndexNode.prototype.toHTML = function (options) {
// format the parameters like "[1, 0:5]"
var dimensions = [];
for (var i = 0; i < this.dimensions.length; i++) {
dimensions[i] = this.dimensions[i].toHTML();
}
if (this.dotNotation) {
return '<span class="math-operator math-accessor-operator">.</span>' + '<span class="math-symbol math-property">' + Object(utils_string["c" /* escape */])(this.getObjectProperty()) + '</span>';
} else {
return '<span class="math-parenthesis math-square-parenthesis">[</span>' + dimensions.join('<span class="math-separator">,</span>') + '<span class="math-parenthesis math-square-parenthesis">]</span>';
}
};
/**
* Get LaTeX representation
* @param {Object} options
* @return {string} str
*/
IndexNode.prototype._toTex = function (options) {
var dimensions = this.dimensions.map(function (range) {
return range.toTex(options);
});
return this.dotNotation ? '.' + this.getObjectProperty() + '' : '_{' + dimensions.join(',') + '}';
}; // helper function to create a Range from start, step and end
function createRange(start, end, step) {
return new Range(Object(is["e" /* isBigNumber */])(start) ? start.toNumber() : start, Object(is["e" /* isBigNumber */])(end) ? end.toNumber() : end, Object(is["e" /* isBigNumber */])(step) ? step.toNumber() : step);
}
return IndexNode;
}, {
isClass: true,
isNode: true
});
// CONCATENATED MODULE: ./src/expression/node/ObjectNode.js
function ObjectNode_typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { ObjectNode_typeof = function _typeof(obj) { return typeof obj; }; } else { ObjectNode_typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return ObjectNode_typeof(obj); }
var ObjectNode_name = 'ObjectNode';
var ObjectNode_dependencies = ['Node'];
var createObjectNode = /* #__PURE__ */Object(factory["a" /* factory */])(ObjectNode_name, ObjectNode_dependencies, function (_ref) {
var Node = _ref.Node;
/**
* @constructor ObjectNode
* @extends {Node}
* Holds an object with keys/values
* @param {Object.<string, Node>} [properties] object with key/value pairs
*/
function ObjectNode(properties) {
if (!(this instanceof ObjectNode)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
this.properties = properties || {}; // validate input
if (properties) {
if (!(ObjectNode_typeof(properties) === 'object') || !Object.keys(properties).every(function (key) {
return Object(is["w" /* isNode */])(properties[key]);
})) {
throw new TypeError('Object containing Nodes expected');
}
}
}
ObjectNode.prototype = new Node();
ObjectNode.prototype.type = 'ObjectNode';
ObjectNode.prototype.isObjectNode = true;
/**
* Compile a node into a JavaScript function.
* This basically pre-calculates as much as possible and only leaves open
* calculations which depend on a dynamic scope with variables.
* @param {Object} math Math.js namespace with functions and constants.
* @param {Object} argNames An object with argument names as key and `true`
* as value. Used in the SymbolNode to optimize
* for arguments from user assigned functions
* (see FunctionAssignmentNode) or special symbols
* like `end` (see IndexNode).
* @return {function} Returns a function which can be called like:
* evalNode(scope: Object, args: Object, context: *)
*/
ObjectNode.prototype._compile = function (math, argNames) {
var evalEntries = {};
for (var key in this.properties) {
if (Object(utils_object["f" /* hasOwnProperty */])(this.properties, key)) {
// we stringify/parse the key here to resolve unicode characters,
// so you cannot create a key like {"co\\u006Estructor": null}
var stringifiedKey = Object(utils_string["e" /* stringify */])(key);
var parsedKey = JSON.parse(stringifiedKey);
if (!isSafeProperty(this.properties, parsedKey)) {
throw new Error('No access to property "' + parsedKey + '"');
}
evalEntries[parsedKey] = this.properties[key]._compile(math, argNames);
}
}
return function evalObjectNode(scope, args, context) {
var obj = {};
for (var _key in evalEntries) {
if (Object(utils_object["f" /* hasOwnProperty */])(evalEntries, _key)) {
obj[_key] = evalEntries[_key](scope, args, context);
}
}
return obj;
};
};
/**
* Execute a callback for each of the child nodes of this node
* @param {function(child: Node, path: string, parent: Node)} callback
*/
ObjectNode.prototype.forEach = function (callback) {
for (var key in this.properties) {
if (Object(utils_object["f" /* hasOwnProperty */])(this.properties, key)) {
callback(this.properties[key], 'properties[' + Object(utils_string["e" /* stringify */])(key) + ']', this);
}
}
};
/**
* Create a new ObjectNode having it's childs be the results of calling
* the provided callback function for each of the childs of the original node.
* @param {function(child: Node, path: string, parent: Node): Node} callback
* @returns {ObjectNode} Returns a transformed copy of the node
*/
ObjectNode.prototype.map = function (callback) {
var properties = {};
for (var key in this.properties) {
if (Object(utils_object["f" /* hasOwnProperty */])(this.properties, key)) {
properties[key] = this._ifNode(callback(this.properties[key], 'properties[' + Object(utils_string["e" /* stringify */])(key) + ']', this));
}
}
return new ObjectNode(properties);
};
/**
* Create a clone of this node, a shallow copy
* @return {ObjectNode}
*/
ObjectNode.prototype.clone = function () {
var properties = {};
for (var key in this.properties) {
if (Object(utils_object["f" /* hasOwnProperty */])(this.properties, key)) {
properties[key] = this.properties[key];
}
}
return new ObjectNode(properties);
};
/**
* Get string representation
* @param {Object} options
* @return {string} str
* @override
*/
ObjectNode.prototype._toString = function (options) {
var entries = [];
for (var key in this.properties) {
if (Object(utils_object["f" /* hasOwnProperty */])(this.properties, key)) {
entries.push(Object(utils_string["e" /* stringify */])(key) + ': ' + this.properties[key].toString(options));
}
}
return '{' + entries.join(', ') + '}';
};
/**
* Get a JSON representation of the node
* @returns {Object}
*/
ObjectNode.prototype.toJSON = function () {
return {
mathjs: 'ObjectNode',
properties: this.properties
};
};
/**
* Instantiate an OperatorNode from its JSON representation
* @param {Object} json An object structured like
* `{"mathjs": "ObjectNode", "properties": {...}}`,
* where mathjs is optional
* @returns {ObjectNode}
*/
ObjectNode.fromJSON = function (json) {
return new ObjectNode(json.properties);
};
/**
* Get HTML representation
* @param {Object} options
* @return {string} str
* @override
*/
ObjectNode.prototype.toHTML = function (options) {
var entries = [];
for (var key in this.properties) {
if (Object(utils_object["f" /* hasOwnProperty */])(this.properties, key)) {
entries.push('<span class="math-symbol math-property">' + Object(utils_string["c" /* escape */])(key) + '</span>' + '<span class="math-operator math-assignment-operator math-property-assignment-operator math-binary-operator">:</span>' + this.properties[key].toHTML(options));
}
}
return '<span class="math-parenthesis math-curly-parenthesis">{</span>' + entries.join('<span class="math-separator">,</span>') + '<span class="math-parenthesis math-curly-parenthesis">}</span>';
};
/**
* Get LaTeX representation
* @param {Object} options
* @return {string} str
*/
ObjectNode.prototype._toTex = function (options) {
var entries = [];
for (var key in this.properties) {
if (Object(utils_object["f" /* hasOwnProperty */])(this.properties, key)) {
entries.push('\\mathbf{' + key + ':} & ' + this.properties[key].toTex(options) + '\\\\');
}
}
return "\\left\\{\\begin{array}{ll}".concat(entries.join('\n'), "\\end{array}\\right\\}");
};
return ObjectNode;
}, {
isClass: true,
isNode: true
});
// CONCATENATED MODULE: ./src/expression/node/OperatorNode.js
var OperatorNode_name = 'OperatorNode';
var OperatorNode_dependencies = ['Node'];
var createOperatorNode = /* #__PURE__ */Object(factory["a" /* factory */])(OperatorNode_name, OperatorNode_dependencies, function (_ref) {
var Node = _ref.Node;
/**
* @constructor OperatorNode
* @extends {Node}
* An operator with two arguments, like 2+3
*
* @param {string} op Operator name, for example '+'
* @param {string} fn Function name, for example 'add'
* @param {Node[]} args Operator arguments
* @param {boolean} [implicit] Is this an implicit multiplication?
*/
function OperatorNode(op, fn, args, implicit) {
if (!(this instanceof OperatorNode)) {
throw new SyntaxError('Constructor must be called with the new operator');
} // validate input
if (typeof op !== 'string') {
throw new TypeError('string expected for parameter "op"');
}
if (typeof fn !== 'string') {
throw new TypeError('string expected for parameter "fn"');
}
if (!Array.isArray(args) || !args.every(is["w" /* isNode */])) {
throw new TypeError('Array containing Nodes expected for parameter "args"');
}
this.implicit = implicit === true;
this.op = op;
this.fn = fn;
this.args = args || [];
}
OperatorNode.prototype = new Node();
OperatorNode.prototype.type = 'OperatorNode';
OperatorNode.prototype.isOperatorNode = true;
/**
* Compile a node into a JavaScript function.
* This basically pre-calculates as much as possible and only leaves open
* calculations which depend on a dynamic scope with variables.
* @param {Object} math Math.js namespace with functions and constants.
* @param {Object} argNames An object with argument names as key and `true`
* as value. Used in the SymbolNode to optimize
* for arguments from user assigned functions
* (see FunctionAssignmentNode) or special symbols
* like `end` (see IndexNode).
* @return {function} Returns a function which can be called like:
* evalNode(scope: Object, args: Object, context: *)
*/
OperatorNode.prototype._compile = function (math, argNames) {
// validate fn
if (typeof this.fn !== 'string' || !isSafeMethod(math, this.fn)) {
if (!math[this.fn]) {
throw new Error('Function ' + this.fn + ' missing in provided namespace "math"');
} else {
throw new Error('No access to function "' + this.fn + '"');
}
}
var fn = getSafeProperty(math, this.fn);
var evalArgs = Object(utils_array["k" /* map */])(this.args, function (arg) {
return arg._compile(math, argNames);
});
if (evalArgs.length === 1) {
var evalArg0 = evalArgs[0];
return function evalOperatorNode(scope, args, context) {
return fn(evalArg0(scope, args, context));
};
} else if (evalArgs.length === 2) {
var _evalArg = evalArgs[0];
var evalArg1 = evalArgs[1];
return function evalOperatorNode(scope, args, context) {
return fn(_evalArg(scope, args, context), evalArg1(scope, args, context));
};
} else {
return function evalOperatorNode(scope, args, context) {
return fn.apply(null, Object(utils_array["k" /* map */])(evalArgs, function (evalArg) {
return evalArg(scope, args, context);
}));
};
}
};
/**
* Execute a callback for each of the child nodes of this node
* @param {function(child: Node, path: string, parent: Node)} callback
*/
OperatorNode.prototype.forEach = function (callback) {
for (var i = 0; i < this.args.length; i++) {
callback(this.args[i], 'args[' + i + ']', this);
}
};
/**
* Create a new OperatorNode having it's childs be the results of calling
* the provided callback function for each of the childs of the original node.
* @param {function(child: Node, path: string, parent: Node): Node} callback
* @returns {OperatorNode} Returns a transformed copy of the node
*/
OperatorNode.prototype.map = function (callback) {
var args = [];
for (var i = 0; i < this.args.length; i++) {
args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));
}
return new OperatorNode(this.op, this.fn, args, this.implicit);
};
/**
* Create a clone of this node, a shallow copy
* @return {OperatorNode}
*/
OperatorNode.prototype.clone = function () {
return new OperatorNode(this.op, this.fn, this.args.slice(0), this.implicit);
};
/**
* Check whether this is an unary OperatorNode:
* has exactly one argument, like `-a`.
* @return {boolean} Returns true when an unary operator node, false otherwise.
*/
OperatorNode.prototype.isUnary = function () {
return this.args.length === 1;
};
/**
* Check whether this is a binary OperatorNode:
* has exactly two arguments, like `a + b`.
* @return {boolean} Returns true when a binary operator node, false otherwise.
*/
OperatorNode.prototype.isBinary = function () {
return this.args.length === 2;
};
/**
* Calculate which parentheses are necessary. Gets an OperatorNode
* (which is the root of the tree) and an Array of Nodes
* (this.args) and returns an array where 'true' means that an argument
* has to be enclosed in parentheses whereas 'false' means the opposite.
*
* @param {OperatorNode} root
* @param {string} parenthesis
* @param {Node[]} args
* @param {boolean} latex
* @return {boolean[]}
* @private
*/
function calculateNecessaryParentheses(root, parenthesis, implicit, args, latex) {
// precedence of the root OperatorNode
var precedence = getPrecedence(root, parenthesis);
var associativity = getAssociativity(root, parenthesis);
if (parenthesis === 'all' || args.length > 2 && root.getIdentifier() !== 'OperatorNode:add' && root.getIdentifier() !== 'OperatorNode:multiply') {
return args.map(function (arg) {
switch (arg.getContent().type) {
// Nodes that don't need extra parentheses
case 'ArrayNode':
case 'ConstantNode':
case 'SymbolNode':
case 'ParenthesisNode':
return false;
default:
return true;
}
});
}
var result;
switch (args.length) {
case 0:
result = [];
break;
case 1:
// unary operators
{
// precedence of the operand
var operandPrecedence = getPrecedence(args[0], parenthesis); // handle special cases for LaTeX, where some of the parentheses aren't needed
if (latex && operandPrecedence !== null) {
var operandIdentifier;
var rootIdentifier;
if (parenthesis === 'keep') {
operandIdentifier = args[0].getIdentifier();
rootIdentifier = root.getIdentifier();
} else {
// Ignore Parenthesis Nodes when not in 'keep' mode
operandIdentifier = args[0].getContent().getIdentifier();
rootIdentifier = root.getContent().getIdentifier();
}
if (operators_properties[precedence][rootIdentifier].latexLeftParens === false) {
result = [false];
break;
}
if (operators_properties[operandPrecedence][operandIdentifier].latexParens === false) {
result = [false];
break;
}
}
if (operandPrecedence === null) {
// if the operand has no defined precedence, no parens are needed
result = [false];
break;
}
if (operandPrecedence <= precedence) {
// if the operands precedence is lower, parens are needed
result = [true];
break;
} // otherwise, no parens needed
result = [false];
}
break;
case 2:
// binary operators
{
var lhsParens; // left hand side needs parenthesis?
// precedence of the left hand side
var lhsPrecedence = getPrecedence(args[0], parenthesis); // is the root node associative with the left hand side
var assocWithLhs = isAssociativeWith(root, args[0], parenthesis);
if (lhsPrecedence === null) {
// if the left hand side has no defined precedence, no parens are needed
// FunctionNode for example
lhsParens = false;
} else if (lhsPrecedence === precedence && associativity === 'right' && !assocWithLhs) {
// In case of equal precedence, if the root node is left associative
// parens are **never** necessary for the left hand side.
// If it is right associative however, parens are necessary
// if the root node isn't associative with the left hand side
lhsParens = true;
} else if (lhsPrecedence < precedence) {
lhsParens = true;
} else {
lhsParens = false;
}
var rhsParens; // right hand side needs parenthesis?
// precedence of the right hand side
var rhsPrecedence = getPrecedence(args[1], parenthesis); // is the root node associative with the right hand side?
var assocWithRhs = isAssociativeWith(root, args[1], parenthesis);
if (rhsPrecedence === null) {
// if the right hand side has no defined precedence, no parens are needed
// FunctionNode for example
rhsParens = false;
} else if (rhsPrecedence === precedence && associativity === 'left' && !assocWithRhs) {
// In case of equal precedence, if the root node is right associative
// parens are **never** necessary for the right hand side.
// If it is left associative however, parens are necessary
// if the root node isn't associative with the right hand side
rhsParens = true;
} else if (rhsPrecedence < precedence) {
rhsParens = true;
} else {
rhsParens = false;
} // handle special cases for LaTeX, where some of the parentheses aren't needed
if (latex) {
var _rootIdentifier;
var lhsIdentifier;
var rhsIdentifier;
if (parenthesis === 'keep') {
_rootIdentifier = root.getIdentifier();
lhsIdentifier = root.args[0].getIdentifier();
rhsIdentifier = root.args[1].getIdentifier();
} else {
// Ignore ParenthesisNodes when not in 'keep' mode
_rootIdentifier = root.getContent().getIdentifier();
lhsIdentifier = root.args[0].getContent().getIdentifier();
rhsIdentifier = root.args[1].getContent().getIdentifier();
}
if (lhsPrecedence !== null) {
if (operators_properties[precedence][_rootIdentifier].latexLeftParens === false) {
lhsParens = false;
}
if (operators_properties[lhsPrecedence][lhsIdentifier].latexParens === false) {
lhsParens = false;
}
}
if (rhsPrecedence !== null) {
if (operators_properties[precedence][_rootIdentifier].latexRightParens === false) {
rhsParens = false;
}
if (operators_properties[rhsPrecedence][rhsIdentifier].latexParens === false) {
rhsParens = false;
}
}
}
result = [lhsParens, rhsParens];
}
break;
default:
if (root.getIdentifier() === 'OperatorNode:add' || root.getIdentifier() === 'OperatorNode:multiply') {
result = args.map(function (arg) {
var argPrecedence = getPrecedence(arg, parenthesis);
var assocWithArg = isAssociativeWith(root, arg, parenthesis);
var argAssociativity = getAssociativity(arg, parenthesis);
if (argPrecedence === null) {
// if the argument has no defined precedence, no parens are needed
return false;
} else if (precedence === argPrecedence && associativity === argAssociativity && !assocWithArg) {
return true;
} else if (argPrecedence < precedence) {
return true;
}
return false;
});
}
break;
} // handles an edge case of 'auto' parentheses with implicit multiplication of ConstantNode
// In that case print parentheses for ParenthesisNodes even though they normally wouldn't be
// printed.
if (args.length >= 2 && root.getIdentifier() === 'OperatorNode:multiply' && root.implicit && parenthesis === 'auto' && implicit === 'hide') {
result = args.map(function (arg, index) {
var isParenthesisNode = arg.getIdentifier() === 'ParenthesisNode';
if (result[index] || isParenthesisNode) {
// put in parenthesis?
return true;
}
return false;
});
}
return result;
}
/**
* Get string representation.
* @param {Object} options
* @return {string} str
*/
OperatorNode.prototype._toString = function (options) {
var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
var implicit = options && options.implicit ? options.implicit : 'hide';
var args = this.args;
var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, false);
if (args.length === 1) {
// unary operators
var assoc = getAssociativity(this, parenthesis);
var operand = args[0].toString(options);
if (parens[0]) {
operand = '(' + operand + ')';
} // for example for "not", we want a space between operand and argument
var opIsNamed = /[a-zA-Z]+/.test(this.op);
if (assoc === 'right') {
// prefix operator
return this.op + (opIsNamed ? ' ' : '') + operand;
} else if (assoc === 'left') {
// postfix
return operand + (opIsNamed ? ' ' : '') + this.op;
} // fall back to postfix
return operand + this.op;
} else if (args.length === 2) {
var lhs = args[0].toString(options); // left hand side
var rhs = args[1].toString(options); // right hand side
if (parens[0]) {
// left hand side in parenthesis?
lhs = '(' + lhs + ')';
}
if (parens[1]) {
// right hand side in parenthesis?
rhs = '(' + rhs + ')';
}
if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {
return lhs + ' ' + rhs;
}
return lhs + ' ' + this.op + ' ' + rhs;
} else if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {
var stringifiedArgs = args.map(function (arg, index) {
arg = arg.toString(options);
if (parens[index]) {
// put in parenthesis?
arg = '(' + arg + ')';
}
return arg;
});
if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {
return stringifiedArgs.join(' ');
}
return stringifiedArgs.join(' ' + this.op + ' ');
} else {
// fallback to formatting as a function call
return this.fn + '(' + this.args.join(', ') + ')';
}
};
/**
* Get a JSON representation of the node
* @returns {Object}
*/
OperatorNode.prototype.toJSON = function () {
return {
mathjs: 'OperatorNode',
op: this.op,
fn: this.fn,
args: this.args,
implicit: this.implicit
};
};
/**
* Instantiate an OperatorNode from its JSON representation
* @param {Object} json An object structured like
* `{"mathjs": "OperatorNode", "op": "+", "fn": "add", "args": [...], "implicit": false}`,
* where mathjs is optional
* @returns {OperatorNode}
*/
OperatorNode.fromJSON = function (json) {
return new OperatorNode(json.op, json.fn, json.args, json.implicit);
};
/**
* Get HTML representation.
* @param {Object} options
* @return {string} str
*/
OperatorNode.prototype.toHTML = function (options) {
var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
var implicit = options && options.implicit ? options.implicit : 'hide';
var args = this.args;
var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, false);
if (args.length === 1) {
// unary operators
var assoc = getAssociativity(this, parenthesis);
var operand = args[0].toHTML(options);
if (parens[0]) {
operand = '<span class="math-parenthesis math-round-parenthesis">(</span>' + operand + '<span class="math-parenthesis math-round-parenthesis">)</span>';
}
if (assoc === 'right') {
// prefix operator
return '<span class="math-operator math-unary-operator math-lefthand-unary-operator">' + Object(utils_string["c" /* escape */])(this.op) + '</span>' + operand;
} else {
// postfix when assoc === 'left' or undefined
return operand + '<span class="math-operator math-unary-operator math-righthand-unary-operator">' + Object(utils_string["c" /* escape */])(this.op) + '</span>';
}
} else if (args.length === 2) {
// binary operatoes
var lhs = args[0].toHTML(options); // left hand side
var rhs = args[1].toHTML(options); // right hand side
if (parens[0]) {
// left hand side in parenthesis?
lhs = '<span class="math-parenthesis math-round-parenthesis">(</span>' + lhs + '<span class="math-parenthesis math-round-parenthesis">)</span>';
}
if (parens[1]) {
// right hand side in parenthesis?
rhs = '<span class="math-parenthesis math-round-parenthesis">(</span>' + rhs + '<span class="math-parenthesis math-round-parenthesis">)</span>';
}
if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {
return lhs + '<span class="math-operator math-binary-operator math-implicit-binary-operator"></span>' + rhs;
}
return lhs + '<span class="math-operator math-binary-operator math-explicit-binary-operator">' + Object(utils_string["c" /* escape */])(this.op) + '</span>' + rhs;
} else {
var stringifiedArgs = args.map(function (arg, index) {
arg = arg.toHTML(options);
if (parens[index]) {
// put in parenthesis?
arg = '<span class="math-parenthesis math-round-parenthesis">(</span>' + arg + '<span class="math-parenthesis math-round-parenthesis">)</span>';
}
return arg;
});
if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {
if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {
return stringifiedArgs.join('<span class="math-operator math-binary-operator math-implicit-binary-operator"></span>');
}
return stringifiedArgs.join('<span class="math-operator math-binary-operator math-explicit-binary-operator">' + Object(utils_string["c" /* escape */])(this.op) + '</span>');
} else {
// fallback to formatting as a function call
return '<span class="math-function">' + Object(utils_string["c" /* escape */])(this.fn) + '</span><span class="math-paranthesis math-round-parenthesis">(</span>' + stringifiedArgs.join('<span class="math-separator">,</span>') + '<span class="math-paranthesis math-round-parenthesis">)</span>';
}
}
};
/**
* Get LaTeX representation
* @param {Object} options
* @return {string} str
*/
OperatorNode.prototype._toTex = function (options) {
var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
var implicit = options && options.implicit ? options.implicit : 'hide';
var args = this.args;
var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, true);
var op = latexOperators[this.fn];
op = typeof op === 'undefined' ? this.op : op; // fall back to using this.op
if (args.length === 1) {
// unary operators
var assoc = getAssociativity(this, parenthesis);
var operand = args[0].toTex(options);
if (parens[0]) {
operand = "\\left(".concat(operand, "\\right)");
}
if (assoc === 'right') {
// prefix operator
return op + operand;
} else if (assoc === 'left') {
// postfix operator
return operand + op;
} // fall back to postfix
return operand + op;
} else if (args.length === 2) {
// binary operators
var lhs = args[0]; // left hand side
var lhsTex = lhs.toTex(options);
if (parens[0]) {
lhsTex = "\\left(".concat(lhsTex, "\\right)");
}
var rhs = args[1]; // right hand side
var rhsTex = rhs.toTex(options);
if (parens[1]) {
rhsTex = "\\left(".concat(rhsTex, "\\right)");
} // handle some exceptions (due to the way LaTeX works)
var lhsIdentifier;
if (parenthesis === 'keep') {
lhsIdentifier = lhs.getIdentifier();
} else {
// Ignore ParenthesisNodes if in 'keep' mode
lhsIdentifier = lhs.getContent().getIdentifier();
}
switch (this.getIdentifier()) {
case 'OperatorNode:divide':
// op contains '\\frac' at this point
return op + '{' + lhsTex + '}' + '{' + rhsTex + '}';
case 'OperatorNode:pow':
lhsTex = '{' + lhsTex + '}';
rhsTex = '{' + rhsTex + '}';
switch (lhsIdentifier) {
case 'ConditionalNode': //
case 'OperatorNode:divide':
lhsTex = "\\left(".concat(lhsTex, "\\right)");
}
break;
case 'OperatorNode:multiply':
if (this.implicit && implicit === 'hide') {
return lhsTex + '~' + rhsTex;
}
}
return lhsTex + op + rhsTex;
} else if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {
var texifiedArgs = args.map(function (arg, index) {
arg = arg.toTex(options);
if (parens[index]) {
arg = "\\left(".concat(arg, "\\right)");
}
return arg;
});
if (this.getIdentifier() === 'OperatorNode:multiply' && this.implicit) {
return texifiedArgs.join('~');
}
return texifiedArgs.join(op);
} else {
// fall back to formatting as a function call
// as this is a fallback, it doesn't use
// fancy function names
return '\\mathrm{' + this.fn + '}\\left(' + args.map(function (arg) {
return arg.toTex(options);
}).join(',') + '\\right)';
}
};
/**
* Get identifier.
* @return {string}
*/
OperatorNode.prototype.getIdentifier = function () {
return this.type + ':' + this.fn;
};
return OperatorNode;
}, {
isClass: true,
isNode: true
});
// CONCATENATED MODULE: ./src/expression/node/ParenthesisNode.js
var ParenthesisNode_name = 'ParenthesisNode';
var ParenthesisNode_dependencies = ['Node'];
var createParenthesisNode = /* #__PURE__ */Object(factory["a" /* factory */])(ParenthesisNode_name, ParenthesisNode_dependencies, function (_ref) {
var Node = _ref.Node;
/**
* @constructor ParenthesisNode
* @extends {Node}
* A parenthesis node describes manual parenthesis from the user input
* @param {Node} content
* @extends {Node}
*/
function ParenthesisNode(content) {
if (!(this instanceof ParenthesisNode)) {
throw new SyntaxError('Constructor must be called with the new operator');
} // validate input
if (!Object(is["w" /* isNode */])(content)) {
throw new TypeError('Node expected for parameter "content"');
}
this.content = content;
}
ParenthesisNode.prototype = new Node();
ParenthesisNode.prototype.type = 'ParenthesisNode';
ParenthesisNode.prototype.isParenthesisNode = true;
/**
* Compile a node into a JavaScript function.
* This basically pre-calculates as much as possible and only leaves open
* calculations which depend on a dynamic scope with variables.
* @param {Object} math Math.js namespace with functions and constants.
* @param {Object} argNames An object with argument names as key and `true`
* as value. Used in the SymbolNode to optimize
* for arguments from user assigned functions
* (see FunctionAssignmentNode) or special symbols
* like `end` (see IndexNode).
* @return {function} Returns a function which can be called like:
* evalNode(scope: Object, args: Object, context: *)
*/
ParenthesisNode.prototype._compile = function (math, argNames) {
return this.content._compile(math, argNames);
};
/**
* Get the content of the current Node.
* @return {Node} content
* @override
**/
ParenthesisNode.prototype.getContent = function () {
return this.content.getContent();
};
/**
* Execute a callback for each of the child nodes of this node
* @param {function(child: Node, path: string, parent: Node)} callback
*/
ParenthesisNode.prototype.forEach = function (callback) {
callback(this.content, 'content', this);
};
/**
* Create a new ParenthesisNode having it's childs be the results of calling
* the provided callback function for each of the childs of the original node.
* @param {function(child: Node, path: string, parent: Node) : Node} callback
* @returns {ParenthesisNode} Returns a clone of the node
*/
ParenthesisNode.prototype.map = function (callback) {
var content = callback(this.content, 'content', this);
return new ParenthesisNode(content);
};
/**
* Create a clone of this node, a shallow copy
* @return {ParenthesisNode}
*/
ParenthesisNode.prototype.clone = function () {
return new ParenthesisNode(this.content);
};
/**
* Get string representation
* @param {Object} options
* @return {string} str
* @override
*/
ParenthesisNode.prototype._toString = function (options) {
if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {
return '(' + this.content.toString(options) + ')';
}
return this.content.toString(options);
};
/**
* Get a JSON representation of the node
* @returns {Object}
*/
ParenthesisNode.prototype.toJSON = function () {
return {
mathjs: 'ParenthesisNode',
content: this.content
};
};
/**
* Instantiate an ParenthesisNode from its JSON representation
* @param {Object} json An object structured like
* `{"mathjs": "ParenthesisNode", "content": ...}`,
* where mathjs is optional
* @returns {ParenthesisNode}
*/
ParenthesisNode.fromJSON = function (json) {
return new ParenthesisNode(json.content);
};
/**
* Get HTML representation
* @param {Object} options
* @return {string} str
* @override
*/
ParenthesisNode.prototype.toHTML = function (options) {
if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {
return '<span class="math-parenthesis math-round-parenthesis">(</span>' + this.content.toHTML(options) + '<span class="math-parenthesis math-round-parenthesis">)</span>';
}
return this.content.toHTML(options);
};
/**
* Get LaTeX representation
* @param {Object} options
* @return {string} str
* @override
*/
ParenthesisNode.prototype._toTex = function (options) {
if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {
return "\\left(".concat(this.content.toTex(options), "\\right)");
}
return this.content.toTex(options);
};
return ParenthesisNode;
}, {
isClass: true,
isNode: true
});
// CONCATENATED MODULE: ./src/expression/node/RangeNode.js
var RangeNode_name = 'RangeNode';
var RangeNode_dependencies = ['Node'];
var createRangeNode = /* #__PURE__ */Object(factory["a" /* factory */])(RangeNode_name, RangeNode_dependencies, function (_ref) {
var Node = _ref.Node;
/**
* @constructor RangeNode
* @extends {Node}
* create a range
* @param {Node} start included lower-bound
* @param {Node} end included upper-bound
* @param {Node} [step] optional step
*/
function RangeNode(start, end, step) {
if (!(this instanceof RangeNode)) {
throw new SyntaxError('Constructor must be called with the new operator');
} // validate inputs
if (!Object(is["w" /* isNode */])(start)) throw new TypeError('Node expected');
if (!Object(is["w" /* isNode */])(end)) throw new TypeError('Node expected');
if (step && !Object(is["w" /* isNode */])(step)) throw new TypeError('Node expected');
if (arguments.length > 3) throw new Error('Too many arguments');
this.start = start; // included lower-bound
this.end = end; // included upper-bound
this.step = step || null; // optional step
}
RangeNode.prototype = new Node();
RangeNode.prototype.type = 'RangeNode';
RangeNode.prototype.isRangeNode = true;
/**
* Check whether the RangeNode needs the `end` symbol to be defined.
* This end is the size of the Matrix in current dimension.
* @return {boolean}
*/
RangeNode.prototype.needsEnd = function () {
// find all `end` symbols in this RangeNode
var endSymbols = this.filter(function (node) {
return Object(is["J" /* isSymbolNode */])(node) && node.name === 'end';
});
return endSymbols.length > 0;
};
/**
* Compile a node into a JavaScript function.
* This basically pre-calculates as much as possible and only leaves open
* calculations which depend on a dynamic scope with variables.
* @param {Object} math Math.js namespace with functions and constants.
* @param {Object} argNames An object with argument names as key and `true`
* as value. Used in the SymbolNode to optimize
* for arguments from user assigned functions
* (see FunctionAssignmentNode) or special symbols
* like `end` (see IndexNode).
* @return {function} Returns a function which can be called like:
* evalNode(scope: Object, args: Object, context: *)
*/
RangeNode.prototype._compile = function (math, argNames) {
var range = math.range;
var evalStart = this.start._compile(math, argNames);
var evalEnd = this.end._compile(math, argNames);
if (this.step) {
var evalStep = this.step._compile(math, argNames);
return function evalRangeNode(scope, args, context) {
return range(evalStart(scope, args, context), evalEnd(scope, args, context), evalStep(scope, args, context));
};
} else {
return function evalRangeNode(scope, args, context) {
return range(evalStart(scope, args, context), evalEnd(scope, args, context));
};
}
};
/**
* Execute a callback for each of the child nodes of this node
* @param {function(child: Node, path: string, parent: Node)} callback
*/
RangeNode.prototype.forEach = function (callback) {
callback(this.start, 'start', this);
callback(this.end, 'end', this);
if (this.step) {
callback(this.step, 'step', this);
}
};
/**
* Create a new RangeNode having it's childs be the results of calling
* the provided callback function for each of the childs of the original node.
* @param {function(child: Node, path: string, parent: Node): Node} callback
* @returns {RangeNode} Returns a transformed copy of the node
*/
RangeNode.prototype.map = function (callback) {
return new RangeNode(this._ifNode(callback(this.start, 'start', this)), this._ifNode(callback(this.end, 'end', this)), this.step && this._ifNode(callback(this.step, 'step', this)));
};
/**
* Create a clone of this node, a shallow copy
* @return {RangeNode}
*/
RangeNode.prototype.clone = function () {
return new RangeNode(this.start, this.end, this.step && this.step);
};
/**
* Calculate the necessary parentheses
* @param {Node} node
* @param {string} parenthesis
* @return {Object} parentheses
* @private
*/
function calculateNecessaryParentheses(node, parenthesis) {
var precedence = getPrecedence(node, parenthesis);
var parens = {};
var startPrecedence = getPrecedence(node.start, parenthesis);
parens.start = startPrecedence !== null && startPrecedence <= precedence || parenthesis === 'all';
if (node.step) {
var stepPrecedence = getPrecedence(node.step, parenthesis);
parens.step = stepPrecedence !== null && stepPrecedence <= precedence || parenthesis === 'all';
}
var endPrecedence = getPrecedence(node.end, parenthesis);
parens.end = endPrecedence !== null && endPrecedence <= precedence || parenthesis === 'all';
return parens;
}
/**
* Get string representation
* @param {Object} options
* @return {string} str
*/
RangeNode.prototype._toString = function (options) {
var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
var parens = calculateNecessaryParentheses(this, parenthesis); // format string as start:step:stop
var str;
var start = this.start.toString(options);
if (parens.start) {
start = '(' + start + ')';
}
str = start;
if (this.step) {
var step = this.step.toString(options);
if (parens.step) {
step = '(' + step + ')';
}
str += ':' + step;
}
var end = this.end.toString(options);
if (parens.end) {
end = '(' + end + ')';
}
str += ':' + end;
return str;
};
/**
* Get a JSON representation of the node
* @returns {Object}
*/
RangeNode.prototype.toJSON = function () {
return {
mathjs: 'RangeNode',
start: this.start,
end: this.end,
step: this.step
};
};
/**
* Instantiate an RangeNode from its JSON representation
* @param {Object} json An object structured like
* `{"mathjs": "RangeNode", "start": ..., "end": ..., "step": ...}`,
* where mathjs is optional
* @returns {RangeNode}
*/
RangeNode.fromJSON = function (json) {
return new RangeNode(json.start, json.end, json.step);
};
/**
* Get HTML representation
* @param {Object} options
* @return {string} str
*/
RangeNode.prototype.toHTML = function (options) {
var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
var parens = calculateNecessaryParentheses(this, parenthesis); // format string as start:step:stop
var str;
var start = this.start.toHTML(options);
if (parens.start) {
start = '<span class="math-parenthesis math-round-parenthesis">(</span>' + start + '<span class="math-parenthesis math-round-parenthesis">)</span>';
}
str = start;
if (this.step) {
var step = this.step.toHTML(options);
if (parens.step) {
step = '<span class="math-parenthesis math-round-parenthesis">(</span>' + step + '<span class="math-parenthesis math-round-parenthesis">)</span>';
}
str += '<span class="math-operator math-range-operator">:</span>' + step;
}
var end = this.end.toHTML(options);
if (parens.end) {
end = '<span class="math-parenthesis math-round-parenthesis">(</span>' + end + '<span class="math-parenthesis math-round-parenthesis">)</span>';
}
str += '<span class="math-operator math-range-operator">:</span>' + end;
return str;
};
/**
* Get LaTeX representation
* @params {Object} options
* @return {string} str
*/
RangeNode.prototype._toTex = function (options) {
var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
var parens = calculateNecessaryParentheses(this, parenthesis);
var str = this.start.toTex(options);
if (parens.start) {
str = "\\left(".concat(str, "\\right)");
}
if (this.step) {
var step = this.step.toTex(options);
if (parens.step) {
step = "\\left(".concat(step, "\\right)");
}
str += ':' + step;
}
var end = this.end.toTex(options);
if (parens.end) {
end = "\\left(".concat(end, "\\right)");
}
str += ':' + end;
return str;
};
return RangeNode;
}, {
isClass: true,
isNode: true
});
// CONCATENATED MODULE: ./src/expression/node/RelationalNode.js
var RelationalNode_name = 'RelationalNode';
var RelationalNode_dependencies = ['Node'];
var createRelationalNode = /* #__PURE__ */Object(factory["a" /* factory */])(RelationalNode_name, RelationalNode_dependencies, function (_ref) {
var Node = _ref.Node;
/**
* A node representing a chained conditional expression, such as 'x > y > z'
*
* @param {String[]} conditionals An array of conditional operators used to compare the parameters
* @param {Node[]} params The parameters that will be compared
*
* @constructor RelationalNode
* @extends {Node}
*/
function RelationalNode(conditionals, params) {
if (!(this instanceof RelationalNode)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
if (!Array.isArray(conditionals)) throw new TypeError('Parameter conditionals must be an array');
if (!Array.isArray(params)) throw new TypeError('Parameter params must be an array');
if (conditionals.length !== params.length - 1) throw new TypeError('Parameter params must contain exactly one more element than parameter conditionals');
this.conditionals = conditionals;
this.params = params;
}
RelationalNode.prototype = new Node();
RelationalNode.prototype.type = 'RelationalNode';
RelationalNode.prototype.isRelationalNode = true;
/**
* Compile a node into a JavaScript function.
* This basically pre-calculates as much as possible and only leaves open
* calculations which depend on a dynamic scope with variables.
* @param {Object} math Math.js namespace with functions and constants.
* @param {Object} argNames An object with argument names as key and `true`
* as value. Used in the SymbolNode to optimize
* for arguments from user assigned functions
* (see FunctionAssignmentNode) or special symbols
* like `end` (see IndexNode).
* @return {function} Returns a function which can be called like:
* evalNode(scope: Object, args: Object, context: *)
*/
RelationalNode.prototype._compile = function (math, argNames) {
var self = this;
var compiled = this.params.map(function (p) {
return p._compile(math, argNames);
});
return function evalRelationalNode(scope, args, context) {
var evalLhs;
var evalRhs = compiled[0](scope, args, context);
for (var i = 0; i < self.conditionals.length; i++) {
evalLhs = evalRhs;
evalRhs = compiled[i + 1](scope, args, context);
var condFn = getSafeProperty(math, self.conditionals[i]);
if (!condFn(evalLhs, evalRhs)) {
return false;
}
}
return true;
};
};
/**
* Execute a callback for each of the child nodes of this node
* @param {function(child: Node, path: string, parent: Node)} callback
*/
RelationalNode.prototype.forEach = function (callback) {
var _this = this;
this.params.forEach(function (n, i) {
return callback(n, 'params[' + i + ']', _this);
}, this);
};
/**
* Create a new RelationalNode having its childs be the results of calling
* the provided callback function for each of the childs of the original node.
* @param {function(child: Node, path: string, parent: Node): Node} callback
* @returns {RelationalNode} Returns a transformed copy of the node
*/
RelationalNode.prototype.map = function (callback) {
var _this2 = this;
return new RelationalNode(this.conditionals.slice(), this.params.map(function (n, i) {
return _this2._ifNode(callback(n, 'params[' + i + ']', _this2));
}, this));
};
/**
* Create a clone of this node, a shallow copy
* @return {RelationalNode}
*/
RelationalNode.prototype.clone = function () {
return new RelationalNode(this.conditionals, this.params);
};
/**
* Get string representation.
* @param {Object} options
* @return {string} str
*/
RelationalNode.prototype._toString = function (options) {
var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
var precedence = getPrecedence(this, parenthesis);
var paramStrings = this.params.map(function (p, index) {
var paramPrecedence = getPrecedence(p, parenthesis);
return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '(' + p.toString(options) + ')' : p.toString(options);
});
var operatorMap = {
equal: '==',
unequal: '!=',
smaller: '<',
larger: '>',
smallerEq: '<=',
largerEq: '>='
};
var ret = paramStrings[0];
for (var i = 0; i < this.conditionals.length; i++) {
ret += ' ' + operatorMap[this.conditionals[i]] + ' ' + paramStrings[i + 1];
}
return ret;
};
/**
* Get a JSON representation of the node
* @returns {Object}
*/
RelationalNode.prototype.toJSON = function () {
return {
mathjs: 'RelationalNode',
conditionals: this.conditionals,
params: this.params
};
};
/**
* Instantiate a RelationalNode from its JSON representation
* @param {Object} json An object structured like
* `{"mathjs": "RelationalNode", "condition": ..., "trueExpr": ..., "falseExpr": ...}`,
* where mathjs is optional
* @returns {RelationalNode}
*/
RelationalNode.fromJSON = function (json) {
return new RelationalNode(json.conditionals, json.params);
};
/**
* Get HTML representation
* @param {Object} options
* @return {string} str
*/
RelationalNode.prototype.toHTML = function (options) {
var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
var precedence = getPrecedence(this, parenthesis);
var paramStrings = this.params.map(function (p, index) {
var paramPrecedence = getPrecedence(p, parenthesis);
return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '<span class="math-parenthesis math-round-parenthesis">(</span>' + p.toHTML(options) + '<span class="math-parenthesis math-round-parenthesis">)</span>' : p.toHTML(options);
});
var operatorMap = {
equal: '==',
unequal: '!=',
smaller: '<',
larger: '>',
smallerEq: '<=',
largerEq: '>='
};
var ret = paramStrings[0];
for (var i = 0; i < this.conditionals.length; i++) {
ret += '<span class="math-operator math-binary-operator math-explicit-binary-operator">' + Object(utils_string["c" /* escape */])(operatorMap[this.conditionals[i]]) + '</span>' + paramStrings[i + 1];
}
return ret;
};
/**
* Get LaTeX representation
* @param {Object} options
* @return {string} str
*/
RelationalNode.prototype._toTex = function (options) {
var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
var precedence = getPrecedence(this, parenthesis);
var paramStrings = this.params.map(function (p, index) {
var paramPrecedence = getPrecedence(p, parenthesis);
return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '\\left(' + p.toTex(options) + '\right)' : p.toTex(options);
});
var ret = paramStrings[0];
for (var i = 0; i < this.conditionals.length; i++) {
ret += latexOperators[this.conditionals[i]] + paramStrings[i + 1];
}
return ret;
};
return RelationalNode;
}, {
isClass: true,
isNode: true
});
// CONCATENATED MODULE: ./src/expression/node/SymbolNode.js
var SymbolNode_name = 'SymbolNode';
var SymbolNode_dependencies = ['math', '?Unit', 'Node'];
var createSymbolNode = /* #__PURE__ */Object(factory["a" /* factory */])(SymbolNode_name, SymbolNode_dependencies, function (_ref) {
var math = _ref.math,
Unit = _ref.Unit,
Node = _ref.Node;
/**
* Check whether some name is a valueless unit like "inch".
* @param {string} name
* @return {boolean}
*/
function isValuelessUnit(name) {
return Unit ? Unit.isValuelessUnit(name) : false;
}
/**
* @constructor SymbolNode
* @extends {Node}
* A symbol node can hold and resolve a symbol
* @param {string} name
* @extends {Node}
*/
function SymbolNode(name) {
if (!(this instanceof SymbolNode)) {
throw new SyntaxError('Constructor must be called with the new operator');
} // validate input
if (typeof name !== 'string') throw new TypeError('String expected for parameter "name"');
this.name = name;
}
SymbolNode.prototype = new Node();
SymbolNode.prototype.type = 'SymbolNode';
SymbolNode.prototype.isSymbolNode = true;
/**
* Compile a node into a JavaScript function.
* This basically pre-calculates as much as possible and only leaves open
* calculations which depend on a dynamic scope with variables.
* @param {Object} math Math.js namespace with functions and constants.
* @param {Object} argNames An object with argument names as key and `true`
* as value. Used in the SymbolNode to optimize
* for arguments from user assigned functions
* (see FunctionAssignmentNode) or special symbols
* like `end` (see IndexNode).
* @return {function} Returns a function which can be called like:
* evalNode(scope: Object, args: Object, context: *)
*/
SymbolNode.prototype._compile = function (math, argNames) {
var name = this.name;
if (argNames[name] === true) {
// this is a FunctionAssignment argument
// (like an x when inside the expression of a function assignment `f(x) = ...`)
return function (scope, args, context) {
return args[name];
};
} else if (name in math) {
return function (scope, args, context) {
return name in scope ? getSafeProperty(scope, name) : getSafeProperty(math, name);
};
} else {
var isUnit = isValuelessUnit(name);
return function (scope, args, context) {
return name in scope ? getSafeProperty(scope, name) : isUnit ? new Unit(null, name) : undef(name);
};
}
};
/**
* Execute a callback for each of the child nodes of this node
* @param {function(child: Node, path: string, parent: Node)} callback
*/
SymbolNode.prototype.forEach = function (callback) {// nothing to do, we don't have childs
};
/**
* Create a new SymbolNode having it's childs be the results of calling
* the provided callback function for each of the childs of the original node.
* @param {function(child: Node, path: string, parent: Node) : Node} callback
* @returns {SymbolNode} Returns a clone of the node
*/
SymbolNode.prototype.map = function (callback) {
return this.clone();
};
/**
* Throws an error 'Undefined symbol {name}'
* @param {string} name
*/
function undef(name) {
throw new Error('Undefined symbol ' + name);
}
/**
* Create a clone of this node, a shallow copy
* @return {SymbolNode}
*/
SymbolNode.prototype.clone = function () {
return new SymbolNode(this.name);
};
/**
* Get string representation
* @param {Object} options
* @return {string} str
* @override
*/
SymbolNode.prototype._toString = function (options) {
return this.name;
};
/**
* Get HTML representation
* @param {Object} options
* @return {string} str
* @override
*/
SymbolNode.prototype.toHTML = function (options) {
var name = Object(utils_string["c" /* escape */])(this.name);
if (name === 'true' || name === 'false') {
return '<span class="math-symbol math-boolean">' + name + '</span>';
} else if (name === 'i') {
return '<span class="math-symbol math-imaginary-symbol">' + name + '</span>';
} else if (name === 'Infinity') {
return '<span class="math-symbol math-infinity-symbol">' + name + '</span>';
} else if (name === 'NaN') {
return '<span class="math-symbol math-nan-symbol">' + name + '</span>';
} else if (name === 'null') {
return '<span class="math-symbol math-null-symbol">' + name + '</span>';
} else if (name === 'undefined') {
return '<span class="math-symbol math-undefined-symbol">' + name + '</span>';
}
return '<span class="math-symbol">' + name + '</span>';
};
/**
* Get a JSON representation of the node
* @returns {Object}
*/
SymbolNode.prototype.toJSON = function () {
return {
mathjs: 'SymbolNode',
name: this.name
};
};
/**
* Instantiate a SymbolNode from its JSON representation
* @param {Object} json An object structured like
* `{"mathjs": "SymbolNode", name: "x"}`,
* where mathjs is optional
* @returns {SymbolNode}
*/
SymbolNode.fromJSON = function (json) {
return new SymbolNode(json.name);
};
/**
* Get LaTeX representation
* @param {Object} options
* @return {string} str
* @override
*/
SymbolNode.prototype._toTex = function (options) {
var isUnit = false;
if (typeof math[this.name] === 'undefined' && isValuelessUnit(this.name)) {
isUnit = true;
}
var symbol = toSymbol(this.name, isUnit);
if (symbol[0] === '\\') {
// no space needed if the symbol starts with '\'
return symbol;
} // the space prevents symbols from breaking stuff like '\cdot' if it's written right before the symbol
return ' ' + symbol;
};
return SymbolNode;
}, {
isClass: true,
isNode: true
});
// CONCATENATED MODULE: ./src/expression/node/FunctionNode.js
function FunctionNode_typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { FunctionNode_typeof = function _typeof(obj) { return typeof obj; }; } else { FunctionNode_typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return FunctionNode_typeof(obj); }
function FunctionNode_extends() { FunctionNode_extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return FunctionNode_extends.apply(this, arguments); }
var FunctionNode_name = 'FunctionNode';
var FunctionNode_dependencies = ['math', 'Node', 'SymbolNode'];
var createFunctionNode = /* #__PURE__ */Object(factory["a" /* factory */])(FunctionNode_name, FunctionNode_dependencies, function (_ref) {
var math = _ref.math,
Node = _ref.Node,
SymbolNode = _ref.SymbolNode;
/**
* @constructor FunctionNode
* @extends {./Node}
* invoke a list with arguments on a node
* @param {./Node | string} fn Node resolving with a function on which to invoke
* the arguments, typically a SymboNode or AccessorNode
* @param {./Node[]} args
*/
function FunctionNode(fn, args) {
if (!(this instanceof FunctionNode)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
if (typeof fn === 'string') {
fn = new SymbolNode(fn);
} // validate input
if (!Object(is["w" /* isNode */])(fn)) throw new TypeError('Node expected as parameter "fn"');
if (!Array.isArray(args) || !args.every(is["w" /* isNode */])) {
throw new TypeError('Array containing Nodes expected for parameter "args"');
}
this.fn = fn;
this.args = args || []; // readonly property name
Object.defineProperty(this, 'name', {
get: function () {
return this.fn.name || '';
}.bind(this),
set: function set() {
throw new Error('Cannot assign a new name, name is read-only');
}
});
}
FunctionNode.prototype = new Node();
FunctionNode.prototype.type = 'FunctionNode';
FunctionNode.prototype.isFunctionNode = true;
/**
* Compile a node into a JavaScript function.
* This basically pre-calculates as much as possible and only leaves open
* calculations which depend on a dynamic scope with variables.
* @param {Object} math Math.js namespace with functions and constants.
* @param {Object} argNames An object with argument names as key and `true`
* as value. Used in the SymbolNode to optimize
* for arguments from user assigned functions
* (see FunctionAssignmentNode) or special symbols
* like `end` (see IndexNode).
* @return {function} Returns a function which can be called like:
* evalNode(scope: Object, args: Object, context: *)
*/
FunctionNode.prototype._compile = function (math, argNames) {
if (!(this instanceof FunctionNode)) {
throw new TypeError('No valid FunctionNode');
} // compile arguments
var evalArgs = Object(utils_array["k" /* map */])(this.args, function (arg) {
return arg._compile(math, argNames);
});
if (Object(is["J" /* isSymbolNode */])(this.fn)) {
// we can statically determine whether the function has an rawArgs property
var _name = this.fn.name;
var fn = _name in math ? getSafeProperty(math, _name) : undefined;
var isRaw = typeof fn === 'function' && fn.rawArgs === true;
if (isRaw) {
// pass unevaluated parameters (nodes) to the function
// "raw" evaluation
var rawArgs = this.args;
return function evalFunctionNode(scope, args, context) {
return (_name in scope ? getSafeProperty(scope, _name) : fn)(rawArgs, math, FunctionNode_extends({}, scope, args));
};
} else {
// "regular" evaluation
if (evalArgs.length === 1) {
var evalArg0 = evalArgs[0];
return function evalFunctionNode(scope, args, context) {
return (_name in scope ? getSafeProperty(scope, _name) : fn)(evalArg0(scope, args, context));
};
} else if (evalArgs.length === 2) {
var _evalArg = evalArgs[0];
var evalArg1 = evalArgs[1];
return function evalFunctionNode(scope, args, context) {
return (_name in scope ? getSafeProperty(scope, _name) : fn)(_evalArg(scope, args, context), evalArg1(scope, args, context));
};
} else {
return function evalFunctionNode(scope, args, context) {
return (_name in scope ? getSafeProperty(scope, _name) : fn).apply(null, Object(utils_array["k" /* map */])(evalArgs, function (evalArg) {
return evalArg(scope, args, context);
}));
};
}
}
} else if (Object(is["a" /* isAccessorNode */])(this.fn) && Object(is["u" /* isIndexNode */])(this.fn.index) && this.fn.index.isObjectProperty()) {
// execute the function with the right context: the object of the AccessorNode
var evalObject = this.fn.object._compile(math, argNames);
var prop = this.fn.index.getObjectProperty();
var _rawArgs = this.args;
return function evalFunctionNode(scope, args, context) {
var object = evalObject(scope, args, context);
validateSafeMethod(object, prop);
var isRaw = object[prop] && object[prop].rawArgs;
return isRaw ? object[prop](_rawArgs, math, FunctionNode_extends({}, scope, args)) // "raw" evaluation
: object[prop].apply(object, Object(utils_array["k" /* map */])(evalArgs, function (evalArg) {
// "regular" evaluation
return evalArg(scope, args, context);
}));
};
} else {
// node.fn.isAccessorNode && !node.fn.index.isObjectProperty()
// we have to dynamically determine whether the function has a rawArgs property
var evalFn = this.fn._compile(math, argNames);
var _rawArgs2 = this.args;
return function evalFunctionNode(scope, args, context) {
var fn = evalFn(scope, args, context);
var isRaw = fn && fn.rawArgs;
return isRaw ? fn(_rawArgs2, math, FunctionNode_extends({}, scope, args)) // "raw" evaluation
: fn.apply(fn, Object(utils_array["k" /* map */])(evalArgs, function (evalArg) {
// "regular" evaluation
return evalArg(scope, args, context);
}));
};
}
};
/**
* Execute a callback for each of the child nodes of this node
* @param {function(child: Node, path: string, parent: Node)} callback
*/
FunctionNode.prototype.forEach = function (callback) {
callback(this.fn, 'fn', this);
for (var i = 0; i < this.args.length; i++) {
callback(this.args[i], 'args[' + i + ']', this);
}
};
/**
* Create a new FunctionNode having it's childs be the results of calling
* the provided callback function for each of the childs of the original node.
* @param {function(child: Node, path: string, parent: Node): Node} callback
* @returns {FunctionNode} Returns a transformed copy of the node
*/
FunctionNode.prototype.map = function (callback) {
var fn = this._ifNode(callback(this.fn, 'fn', this));
var args = [];
for (var i = 0; i < this.args.length; i++) {
args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));
}
return new FunctionNode(fn, args);
};
/**
* Create a clone of this node, a shallow copy
* @return {FunctionNode}
*/
FunctionNode.prototype.clone = function () {
return new FunctionNode(this.fn, this.args.slice(0));
}; // backup Node's toString function
// @private
var nodeToString = FunctionNode.prototype.toString;
/**
* Get string representation. (wrapper function)
* This overrides parts of Node's toString function.
* If callback is an object containing callbacks, it
* calls the correct callback for the current node,
* otherwise it falls back to calling Node's toString
* function.
*
* @param {Object} options
* @return {string} str
* @override
*/
FunctionNode.prototype.toString = function (options) {
var customString;
var name = this.fn.toString(options);
if (options && FunctionNode_typeof(options.handler) === 'object' && Object(utils_object["f" /* hasOwnProperty */])(options.handler, name)) {
// callback is a map of callback functions
customString = options.handler[name](this, options);
}
if (typeof customString !== 'undefined') {
return customString;
} // fall back to Node's toString
return nodeToString.call(this, options);
};
/**
* Get string representation
* @param {Object} options
* @return {string} str
*/
FunctionNode.prototype._toString = function (options) {
var args = this.args.map(function (arg) {
return arg.toString(options);
});
var fn = Object(is["q" /* isFunctionAssignmentNode */])(this.fn) ? '(' + this.fn.toString(options) + ')' : this.fn.toString(options); // format the arguments like "add(2, 4.2)"
return fn + '(' + args.join(', ') + ')';
};
/**
* Get a JSON representation of the node
* @returns {Object}
*/
FunctionNode.prototype.toJSON = function () {
return {
mathjs: 'FunctionNode',
fn: this.fn,
args: this.args
};
};
/**
* Instantiate an AssignmentNode from its JSON representation
* @param {Object} json An object structured like
* `{"mathjs": "FunctionNode", fn: ..., args: ...}`,
* where mathjs is optional
* @returns {FunctionNode}
*/
FunctionNode.fromJSON = function (json) {
return new FunctionNode(json.fn, json.args);
};
/**
* Get HTML representation
* @param {Object} options
* @return {string} str
*/
FunctionNode.prototype.toHTML = function (options) {
var args = this.args.map(function (arg) {
return arg.toHTML(options);
}); // format the arguments like "add(2, 4.2)"
return '<span class="math-function">' + Object(utils_string["c" /* escape */])(this.fn) + '</span><span class="math-paranthesis math-round-parenthesis">(</span>' + args.join('<span class="math-separator">,</span>') + '<span class="math-paranthesis math-round-parenthesis">)</span>';
};
/*
* Expand a LaTeX template
*
* @param {string} template
* @param {Node} node
* @param {Object} options
* @private
**/
function expandTemplate(template, node, options) {
var latex = ''; // Match everything of the form ${identifier} or ${identifier[2]} or $$
// while submatching identifier and 2 (in the second case)
var regex = new RegExp('\\$(?:\\{([a-z_][a-z_0-9]*)(?:\\[([0-9]+)\\])?\\}|\\$)', 'ig');
var inputPos = 0; // position in the input string
var match;
while ((match = regex.exec(template)) !== null) {
// go through all matches
// add everything in front of the match to the LaTeX string
latex += template.substring(inputPos, match.index);
inputPos = match.index;
if (match[0] === '$$') {
// escaped dollar sign
latex += '$';
inputPos++;
} else {
// template parameter
inputPos += match[0].length;
var property = node[match[1]];
if (!property) {
throw new ReferenceError('Template: Property ' + match[1] + ' does not exist.');
}
if (match[2] === undefined) {
// no square brackets
switch (FunctionNode_typeof(property)) {
case 'string':
latex += property;
break;
case 'object':
if (Object(is["w" /* isNode */])(property)) {
latex += property.toTex(options);
} else if (Array.isArray(property)) {
// make array of Nodes into comma separated list
latex += property.map(function (arg, index) {
if (Object(is["w" /* isNode */])(arg)) {
return arg.toTex(options);
}
throw new TypeError('Template: ' + match[1] + '[' + index + '] is not a Node.');
}).join(',');
} else {
throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes');
}
break;
default:
throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes');
}
} else {
// with square brackets
if (Object(is["w" /* isNode */])(property[match[2]] && property[match[2]])) {
latex += property[match[2]].toTex(options);
} else {
throw new TypeError('Template: ' + match[1] + '[' + match[2] + '] is not a Node.');
}
}
}
}
latex += template.slice(inputPos); // append rest of the template
return latex;
} // backup Node's toTex function
// @private
var nodeToTex = FunctionNode.prototype.toTex;
/**
* Get LaTeX representation. (wrapper function)
* This overrides parts of Node's toTex function.
* If callback is an object containing callbacks, it
* calls the correct callback for the current node,
* otherwise it falls back to calling Node's toTex
* function.
*
* @param {Object} options
* @return {string}
*/
FunctionNode.prototype.toTex = function (options) {
var customTex;
if (options && FunctionNode_typeof(options.handler) === 'object' && Object(utils_object["f" /* hasOwnProperty */])(options.handler, this.name)) {
// callback is a map of callback functions
customTex = options.handler[this.name](this, options);
}
if (typeof customTex !== 'undefined') {
return customTex;
} // fall back to Node's toTex
return nodeToTex.call(this, options);
};
/**
* Get LaTeX representation
* @param {Object} options
* @return {string} str
*/
FunctionNode.prototype._toTex = function (options) {
var args = this.args.map(function (arg) {
// get LaTeX of the arguments
return arg.toTex(options);
});
var latexConverter;
if (latexFunctions[this.name]) {
latexConverter = latexFunctions[this.name];
} // toTex property on the function itself
if (math[this.name] && (typeof math[this.name].toTex === 'function' || FunctionNode_typeof(math[this.name].toTex) === 'object' || typeof math[this.name].toTex === 'string')) {
// .toTex is a callback function
latexConverter = math[this.name].toTex;
}
var customToTex;
switch (FunctionNode_typeof(latexConverter)) {
case 'function':
// a callback function
customToTex = latexConverter(this, options);
break;
case 'string':
// a template string
customToTex = expandTemplate(latexConverter, this, options);
break;
case 'object':
// an object with different "converters" for different numbers of arguments
switch (FunctionNode_typeof(latexConverter[args.length])) {
case 'function':
customToTex = latexConverter[args.length](this, options);
break;
case 'string':
customToTex = expandTemplate(latexConverter[args.length], this, options);
break;
}
}
if (typeof customToTex !== 'undefined') {
return customToTex;
}
return expandTemplate(defaultTemplate, this, options);
};
/**
* Get identifier.
* @return {string}
*/
FunctionNode.prototype.getIdentifier = function () {
return this.type + ':' + this.name;
};
return FunctionNode;
}, {
isClass: true,
isNode: true
});
// CONCATENATED MODULE: ./src/expression/parse.js
function parse_extends() { parse_extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return parse_extends.apply(this, arguments); }
var parse_name = 'parse';
var parse_dependencies = ['typed', 'numeric', 'config', 'AccessorNode', 'ArrayNode', 'AssignmentNode', 'BlockNode', 'ConditionalNode', 'ConstantNode', 'FunctionAssignmentNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'RangeNode', 'RelationalNode', 'SymbolNode'];
var createParse = /* #__PURE__ */Object(factory["a" /* factory */])(parse_name, parse_dependencies, function (_ref) {
var typed = _ref.typed,
numeric = _ref.numeric,
config = _ref.config,
AccessorNode = _ref.AccessorNode,
ArrayNode = _ref.ArrayNode,
AssignmentNode = _ref.AssignmentNode,
BlockNode = _ref.BlockNode,
ConditionalNode = _ref.ConditionalNode,
ConstantNode = _ref.ConstantNode,
FunctionAssignmentNode = _ref.FunctionAssignmentNode,
FunctionNode = _ref.FunctionNode,
IndexNode = _ref.IndexNode,
ObjectNode = _ref.ObjectNode,
OperatorNode = _ref.OperatorNode,
ParenthesisNode = _ref.ParenthesisNode,
RangeNode = _ref.RangeNode,
RelationalNode = _ref.RelationalNode,
SymbolNode = _ref.SymbolNode;
/**
* Parse an expression. Returns a node tree, which can be evaluated by
* invoking node.evaluate().
*
* Note the evaluating arbitrary expressions may involve security risks,
* see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.
*
* Syntax:
*
* math.parse(expr)
* math.parse(expr, options)
* math.parse([expr1, expr2, expr3, ...])
* math.parse([expr1, expr2, expr3, ...], options)
*
* Example:
*
* const node1 = math.parse('sqrt(3^2 + 4^2)')
* node1.compile().evaluate() // 5
*
* let scope = {a:3, b:4}
* const node2 = math.parse('a * b') // 12
* const code2 = node2.compile()
* code2.evaluate(scope) // 12
* scope.a = 5
* code2.evaluate(scope) // 20
*
* const nodes = math.parse(['a = 3', 'b = 4', 'a * b'])
* nodes[2].compile().evaluate() // 12
*
* See also:
*
* evaluate, compile
*
* @param {string | string[] | Matrix} expr Expression to be parsed
* @param {{nodes: Object<string, Node>}} [options] Available options:
* - `nodes` a set of custom nodes
* @return {Node | Node[]} node
* @throws {Error}
*/
var parse = typed(parse_name, {
string: function string(expression) {
return parseStart(expression, {});
},
'Array | Matrix': function ArrayMatrix(expressions) {
return parseMultiple(expressions, {});
},
'string, Object': function stringObject(expression, options) {
var extraNodes = options.nodes !== undefined ? options.nodes : {};
return parseStart(expression, extraNodes);
},
'Array | Matrix, Object': parseMultiple
});
function parseMultiple(expressions) {
var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
var extraNodes = options.nodes !== undefined ? options.nodes : {}; // parse an array or matrix with expressions
return deepMap(expressions, function (elem) {
if (typeof elem !== 'string') throw new TypeError('String expected');
return parseStart(elem, extraNodes);
});
} // token types enumeration
var TOKENTYPE = {
NULL: 0,
DELIMITER: 1,
NUMBER: 2,
SYMBOL: 3,
UNKNOWN: 4
}; // map with all delimiters
var DELIMITERS = {
',': true,
'(': true,
')': true,
'[': true,
']': true,
'{': true,
'}': true,
'"': true,
'\'': true,
';': true,
'+': true,
'-': true,
'*': true,
'.*': true,
'/': true,
'./': true,
'%': true,
'^': true,
'.^': true,
'~': true,
'!': true,
'&': true,
'|': true,
'^|': true,
'=': true,
':': true,
'?': true,
'==': true,
'!=': true,
'<': true,
'>': true,
'<=': true,
'>=': true,
'<<': true,
'>>': true,
'>>>': true
}; // map with all named delimiters
var NAMED_DELIMITERS = {
mod: true,
to: true,
"in": true,
and: true,
xor: true,
or: true,
not: true
};
var CONSTANTS = {
"true": true,
"false": false,
"null": null,
undefined: undefined
};
var NUMERIC_CONSTANTS = ['NaN', 'Infinity'];
function initialState() {
return {
extraNodes: {},
// current extra nodes, must be careful not to mutate
expression: '',
// current expression
comment: '',
// last parsed comment
index: 0,
// current index in expr
token: '',
// current token
tokenType: TOKENTYPE.NULL,
// type of the token
nestingLevel: 0,
// level of nesting inside parameters, used to ignore newline characters
conditionalLevel: null // when a conditional is being parsed, the level of the conditional is stored here
};
}
/**
* View upto `length` characters of the expression starting at the current character.
*
* @param {Object} state
* @param {number} [length=1] Number of characters to view
* @returns {string}
* @private
*/
function currentString(state, length) {
return state.expression.substr(state.index, length);
}
/**
* View the current character. Returns '' if end of expression is reached.
*
* @param {Object} state
* @returns {string}
* @private
*/
function currentCharacter(state) {
return currentString(state, 1);
}
/**
* Get the next character from the expression.
* The character is stored into the char c. If the end of the expression is
* reached, the function puts an empty string in c.
* @private
*/
function next(state) {
state.index++;
}
/**
* Preview the previous character from the expression.
* @return {string} cNext
* @private
*/
function prevCharacter(state) {
return state.expression.charAt(state.index - 1);
}
/**
* Preview the next character from the expression.
* @return {string} cNext
* @private
*/
function nextCharacter(state) {
return state.expression.charAt(state.index + 1);
}
/**
* Get next token in the current string expr.
* The token and token type are available as token and tokenType
* @private
*/
function getToken(state) {
state.tokenType = TOKENTYPE.NULL;
state.token = '';
state.comment = ''; // skip over whitespaces
// space, tab, and newline when inside parameters
while (parse.isWhitespace(currentCharacter(state), state.nestingLevel)) {
next(state);
} // skip comment
if (currentCharacter(state) === '#') {
while (currentCharacter(state) !== '\n' && currentCharacter(state) !== '') {
state.comment += currentCharacter(state);
next(state);
}
} // check for end of expression
if (currentCharacter(state) === '') {
// token is still empty
state.tokenType = TOKENTYPE.DELIMITER;
return;
} // check for new line character
if (currentCharacter(state) === '\n' && !state.nestingLevel) {
state.tokenType = TOKENTYPE.DELIMITER;
state.token = currentCharacter(state);
next(state);
return;
}
var c1 = currentCharacter(state);
var c2 = currentString(state, 2);
var c3 = currentString(state, 3);
if (c3.length === 3 && DELIMITERS[c3]) {
state.tokenType = TOKENTYPE.DELIMITER;
state.token = c3;
next(state);
next(state);
next(state);
return;
} // check for delimiters consisting of 2 characters
if (c2.length === 2 && DELIMITERS[c2]) {
state.tokenType = TOKENTYPE.DELIMITER;
state.token = c2;
next(state);
next(state);
return;
} // check for delimiters consisting of 1 character
if (DELIMITERS[c1]) {
state.tokenType = TOKENTYPE.DELIMITER;
state.token = c1;
next(state);
return;
} // check for a number
if (parse.isDigitDot(c1)) {
state.tokenType = TOKENTYPE.NUMBER; // get number, can have a single dot
if (currentCharacter(state) === '.') {
state.token += currentCharacter(state);
next(state);
if (!parse.isDigit(currentCharacter(state))) {
// this is no number, it is just a dot (can be dot notation)
state.tokenType = TOKENTYPE.DELIMITER;
}
} else {
while (parse.isDigit(currentCharacter(state))) {
state.token += currentCharacter(state);
next(state);
}
if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {
state.token += currentCharacter(state);
next(state);
}
}
while (parse.isDigit(currentCharacter(state))) {
state.token += currentCharacter(state);
next(state);
} // check for exponential notation like "2.3e-4", "1.23e50" or "2e+4"
if (currentCharacter(state) === 'E' || currentCharacter(state) === 'e') {
if (parse.isDigit(nextCharacter(state)) || nextCharacter(state) === '-' || nextCharacter(state) === '+') {
state.token += currentCharacter(state);
next(state);
if (currentCharacter(state) === '+' || currentCharacter(state) === '-') {
state.token += currentCharacter(state);
next(state);
} // Scientific notation MUST be followed by an exponent
if (!parse.isDigit(currentCharacter(state))) {
throw createSyntaxError(state, 'Digit expected, got "' + currentCharacter(state) + '"');
}
while (parse.isDigit(currentCharacter(state))) {
state.token += currentCharacter(state);
next(state);
}
if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {
throw createSyntaxError(state, 'Digit expected, got "' + currentCharacter(state) + '"');
}
} else if (nextCharacter(state) === '.') {
next(state);
throw createSyntaxError(state, 'Digit expected, got "' + currentCharacter(state) + '"');
}
}
return;
} // check for variables, functions, named operators
if (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state))) {
while (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state)) || parse.isDigit(currentCharacter(state))) {
state.token += currentCharacter(state);
next(state);
}
if (Object(utils_object["f" /* hasOwnProperty */])(NAMED_DELIMITERS, state.token)) {
state.tokenType = TOKENTYPE.DELIMITER;
} else {
state.tokenType = TOKENTYPE.SYMBOL;
}
return;
} // something unknown is found, wrong characters -> a syntax error
state.tokenType = TOKENTYPE.UNKNOWN;
while (currentCharacter(state) !== '') {
state.token += currentCharacter(state);
next(state);
}
throw createSyntaxError(state, 'Syntax error in part "' + state.token + '"');
}
/**
* Get next token and skip newline tokens
*/
function getTokenSkipNewline(state) {
do {
getToken(state);
} while (state.token === '\n'); // eslint-disable-line no-unmodified-loop-condition
}
/**
* Open parameters.
* New line characters will be ignored until closeParams(state) is called
*/
function openParams(state) {
state.nestingLevel++;
}
/**
* Close parameters.
* New line characters will no longer be ignored
*/
function closeParams(state) {
state.nestingLevel--;
}
/**
* Checks whether the current character `c` is a valid alpha character:
*
* - A latin letter (upper or lower case) Ascii: a-z, A-Z
* - An underscore Ascii: _
* - A dollar sign Ascii: $
* - A latin letter with accents Unicode: \u00C0 - \u02AF
* - A greek letter Unicode: \u0370 - \u03FF
* - A mathematical alphanumeric symbol Unicode: \u{1D400} - \u{1D7FF} excluding invalid code points
*
* The previous and next characters are needed to determine whether
* this character is part of a unicode surrogate pair.
*
* @param {string} c Current character in the expression
* @param {string} cPrev Previous character
* @param {string} cNext Next character
* @return {boolean}
*/
parse.isAlpha = function isAlpha(c, cPrev, cNext) {
return parse.isValidLatinOrGreek(c) || parse.isValidMathSymbol(c, cNext) || parse.isValidMathSymbol(cPrev, c);
};
/**
* Test whether a character is a valid latin, greek, or letter-like character
* @param {string} c
* @return {boolean}
*/
parse.isValidLatinOrGreek = function isValidLatinOrGreek(c) {
return /^[a-zA-Z_$\u00C0-\u02AF\u0370-\u03FF\u2100-\u214F]$/.test(c);
};
/**
* Test whether two given 16 bit characters form a surrogate pair of a
* unicode math symbol.
*
* https://unicode-table.com/en/
* https://www.wikiwand.com/en/Mathematical_operators_and_symbols_in_Unicode
*
* Note: In ES6 will be unicode aware:
* https://stackoverflow.com/questions/280712/javascript-unicode-regexes
* https://mathiasbynens.be/notes/es6-unicode-regex
*
* @param {string} high
* @param {string} low
* @return {boolean}
*/
parse.isValidMathSymbol = function isValidMathSymbol(high, low) {
return /^[\uD835]$/.test(high) && /^[\uDC00-\uDFFF]$/.test(low) && /^[^\uDC55\uDC9D\uDCA0\uDCA1\uDCA3\uDCA4\uDCA7\uDCA8\uDCAD\uDCBA\uDCBC\uDCC4\uDD06\uDD0B\uDD0C\uDD15\uDD1D\uDD3A\uDD3F\uDD45\uDD47-\uDD49\uDD51\uDEA6\uDEA7\uDFCC\uDFCD]$/.test(low);
};
/**
* Check whether given character c is a white space character: space, tab, or enter
* @param {string} c
* @param {number} nestingLevel
* @return {boolean}
*/
parse.isWhitespace = function isWhitespace(c, nestingLevel) {
// TODO: also take '\r' carriage return as newline? Or does that give problems on mac?
return c === ' ' || c === '\t' || c === '\n' && nestingLevel > 0;
};
/**
* Test whether the character c is a decimal mark (dot).
* This is the case when it's not the start of a delimiter '.*', './', or '.^'
* @param {string} c
* @param {string} cNext
* @return {boolean}
*/
parse.isDecimalMark = function isDecimalMark(c, cNext) {
return c === '.' && cNext !== '/' && cNext !== '*' && cNext !== '^';
};
/**
* checks if the given char c is a digit or dot
* @param {string} c a string with one character
* @return {boolean}
*/
parse.isDigitDot = function isDigitDot(c) {
return c >= '0' && c <= '9' || c === '.';
};
/**
* checks if the given char c is a digit
* @param {string} c a string with one character
* @return {boolean}
*/
parse.isDigit = function isDigit(c) {
return c >= '0' && c <= '9';
};
/**
* Start of the parse levels below, in order of precedence
* @return {Node} node
* @private
*/
function parseStart(expression, extraNodes) {
var state = initialState();
parse_extends(state, {
expression: expression,
extraNodes: extraNodes
});
getToken(state);
var node = parseBlock(state); // check for garbage at the end of the expression
// an expression ends with a empty character '' and tokenType DELIMITER
if (state.token !== '') {
if (state.tokenType === TOKENTYPE.DELIMITER) {
// user entered a not existing operator like "//"
// TODO: give hints for aliases, for example with "<>" give as hint " did you mean !== ?"
throw createError(state, 'Unexpected operator ' + state.token);
} else {
throw createSyntaxError(state, 'Unexpected part "' + state.token + '"');
}
}
return node;
}
/**
* Parse a block with expressions. Expressions can be separated by a newline
* character '\n', or by a semicolon ';'. In case of a semicolon, no output
* of the preceding line is returned.
* @return {Node} node
* @private
*/
function parseBlock(state) {
var node;
var blocks = [];
var visible;
if (state.token !== '' && state.token !== '\n' && state.token !== ';') {
node = parseAssignment(state);
node.comment = state.comment;
} // TODO: simplify this loop
while (state.token === '\n' || state.token === ';') {
// eslint-disable-line no-unmodified-loop-condition
if (blocks.length === 0 && node) {
visible = state.token !== ';';
blocks.push({
node: node,
visible: visible
});
}
getToken(state);
if (state.token !== '\n' && state.token !== ';' && state.token !== '') {
node = parseAssignment(state);
node.comment = state.comment;
visible = state.token !== ';';
blocks.push({
node: node,
visible: visible
});
}
}
if (blocks.length > 0) {
return new BlockNode(blocks);
} else {
if (!node) {
node = new ConstantNode(undefined);
node.comment = state.comment;
}
return node;
}
}
/**
* Assignment of a function or variable,
* - can be a variable like 'a=2.3'
* - or a updating an existing variable like 'matrix(2,3:5)=[6,7,8]'
* - defining a function like 'f(x) = x^2'
* @return {Node} node
* @private
*/
function parseAssignment(state) {
var name, args, value, valid;
var node = parseConditional(state);
if (state.token === '=') {
if (Object(is["J" /* isSymbolNode */])(node)) {
// parse a variable assignment like 'a = 2/3'
name = node.name;
getTokenSkipNewline(state);
value = parseAssignment(state);
return new AssignmentNode(new SymbolNode(name), value);
} else if (Object(is["a" /* isAccessorNode */])(node)) {
// parse a matrix subset assignment like 'A[1,2] = 4'
getTokenSkipNewline(state);
value = parseAssignment(state);
return new AssignmentNode(node.object, node.index, value);
} else if (Object(is["r" /* isFunctionNode */])(node) && Object(is["J" /* isSymbolNode */])(node.fn)) {
// parse function assignment like 'f(x) = x^2'
valid = true;
args = [];
name = node.name;
node.args.forEach(function (arg, index) {
if (Object(is["J" /* isSymbolNode */])(arg)) {
args[index] = arg.name;
} else {
valid = false;
}
});
if (valid) {
getTokenSkipNewline(state);
value = parseAssignment(state);
return new FunctionAssignmentNode(name, args, value);
}
}
throw createSyntaxError(state, 'Invalid left hand side of assignment operator =');
}
return node;
}
/**
* conditional operation
*
* condition ? truePart : falsePart
*
* Note: conditional operator is right-associative
*
* @return {Node} node
* @private
*/
function parseConditional(state) {
var node = parseLogicalOr(state);
while (state.token === '?') {
// eslint-disable-line no-unmodified-loop-condition
// set a conditional level, the range operator will be ignored as long
// as conditionalLevel === state.nestingLevel.
var prev = state.conditionalLevel;
state.conditionalLevel = state.nestingLevel;
getTokenSkipNewline(state);
var condition = node;
var trueExpr = parseAssignment(state);
if (state.token !== ':') throw createSyntaxError(state, 'False part of conditional expression expected');
state.conditionalLevel = null;
getTokenSkipNewline(state);
var falseExpr = parseAssignment(state); // Note: check for conditional operator again, right associativity
node = new ConditionalNode(condition, trueExpr, falseExpr); // restore the previous conditional level
state.conditionalLevel = prev;
}
return node;
}
/**
* logical or, 'x or y'
* @return {Node} node
* @private
*/
function parseLogicalOr(state) {
var node = parseLogicalXor(state);
while (state.token === 'or') {
// eslint-disable-line no-unmodified-loop-condition
getTokenSkipNewline(state);
node = new OperatorNode('or', 'or', [node, parseLogicalXor(state)]);
}
return node;
}
/**
* logical exclusive or, 'x xor y'
* @return {Node} node
* @private
*/
function parseLogicalXor(state) {
var node = parseLogicalAnd(state);
while (state.token === 'xor') {
// eslint-disable-line no-unmodified-loop-condition
getTokenSkipNewline(state);
node = new OperatorNode('xor', 'xor', [node, parseLogicalAnd(state)]);
}
return node;
}
/**
* logical and, 'x and y'
* @return {Node} node
* @private
*/
function parseLogicalAnd(state) {
var node = parseBitwiseOr(state);
while (state.token === 'and') {
// eslint-disable-line no-unmodified-loop-condition
getTokenSkipNewline(state);
node = new OperatorNode('and', 'and', [node, parseBitwiseOr(state)]);
}
return node;
}
/**
* bitwise or, 'x | y'
* @return {Node} node
* @private
*/
function parseBitwiseOr(state) {
var node = parseBitwiseXor(state);
while (state.token === '|') {
// eslint-disable-line no-unmodified-loop-condition
getTokenSkipNewline(state);
node = new OperatorNode('|', 'bitOr', [node, parseBitwiseXor(state)]);
}
return node;
}
/**
* bitwise exclusive or (xor), 'x ^| y'
* @return {Node} node
* @private
*/
function parseBitwiseXor(state) {
var node = parseBitwiseAnd(state);
while (state.token === '^|') {
// eslint-disable-line no-unmodified-loop-condition
getTokenSkipNewline(state);
node = new OperatorNode('^|', 'bitXor', [node, parseBitwiseAnd(state)]);
}
return node;
}
/**
* bitwise and, 'x & y'
* @return {Node} node
* @private
*/
function parseBitwiseAnd(state) {
var node = parseRelational(state);
while (state.token === '&') {
// eslint-disable-line no-unmodified-loop-condition
getTokenSkipNewline(state);
node = new OperatorNode('&', 'bitAnd', [node, parseRelational(state)]);
}
return node;
}
/**
* Parse a chained conditional, like 'a > b >= c'
* @return {Node} node
*/
function parseRelational(state) {
var params = [parseShift(state)];
var conditionals = [];
var operators = {
'==': 'equal',
'!=': 'unequal',
'<': 'smaller',
'>': 'larger',
'<=': 'smallerEq',
'>=': 'largerEq'
};
while (Object(utils_object["f" /* hasOwnProperty */])(operators, state.token)) {
// eslint-disable-line no-unmodified-loop-condition
var cond = {
name: state.token,
fn: operators[state.token]
};
conditionals.push(cond);
getTokenSkipNewline(state);
params.push(parseShift(state));
}
if (params.length === 1) {
return params[0];
} else if (params.length === 2) {
return new OperatorNode(conditionals[0].name, conditionals[0].fn, params);
} else {
return new RelationalNode(conditionals.map(function (c) {
return c.fn;
}), params);
}
}
/**
* Bitwise left shift, bitwise right arithmetic shift, bitwise right logical shift
* @return {Node} node
* @private
*/
function parseShift(state) {
var node, name, fn, params;
node = parseConversion(state);
var operators = {
'<<': 'leftShift',
'>>': 'rightArithShift',
'>>>': 'rightLogShift'
};
while (Object(utils_object["f" /* hasOwnProperty */])(operators, state.token)) {
name = state.token;
fn = operators[name];
getTokenSkipNewline(state);
params = [node, parseConversion(state)];
node = new OperatorNode(name, fn, params);
}
return node;
}
/**
* conversion operators 'to' and 'in'
* @return {Node} node
* @private
*/
function parseConversion(state) {
var node, name, fn, params;
node = parseRange(state);
var operators = {
to: 'to',
"in": 'to' // alias of 'to'
};
while (Object(utils_object["f" /* hasOwnProperty */])(operators, state.token)) {
name = state.token;
fn = operators[name];
getTokenSkipNewline(state);
if (name === 'in' && state.token === '') {
// end of expression -> this is the unit 'in' ('inch')
node = new OperatorNode('*', 'multiply', [node, new SymbolNode('in')], true);
} else {
// operator 'a to b' or 'a in b'
params = [node, parseRange(state)];
node = new OperatorNode(name, fn, params);
}
}
return node;
}
/**
* parse range, "start:end", "start:step:end", ":", "start:", ":end", etc
* @return {Node} node
* @private
*/
function parseRange(state) {
var node;
var params = [];
if (state.token === ':') {
// implicit start=1 (one-based)
node = new ConstantNode(1);
} else {
// explicit start
node = parseAddSubtract(state);
}
if (state.token === ':' && state.conditionalLevel !== state.nestingLevel) {
// we ignore the range operator when a conditional operator is being processed on the same level
params.push(node); // parse step and end
while (state.token === ':' && params.length < 3) {
// eslint-disable-line no-unmodified-loop-condition
getTokenSkipNewline(state);
if (state.token === ')' || state.token === ']' || state.token === ',' || state.token === '') {
// implicit end
params.push(new SymbolNode('end'));
} else {
// explicit end
params.push(parseAddSubtract(state));
}
}
if (params.length === 3) {
// params = [start, step, end]
node = new RangeNode(params[0], params[2], params[1]); // start, end, step
} else {
// length === 2
// params = [start, end]
node = new RangeNode(params[0], params[1]); // start, end
}
}
return node;
}
/**
* add or subtract
* @return {Node} node
* @private
*/
function parseAddSubtract(state) {
var node, name, fn, params;
node = parseMultiplyDivide(state);
var operators = {
'+': 'add',
'-': 'subtract'
};
while (Object(utils_object["f" /* hasOwnProperty */])(operators, state.token)) {
name = state.token;
fn = operators[name];
getTokenSkipNewline(state);
params = [node, parseMultiplyDivide(state)];
node = new OperatorNode(name, fn, params);
}
return node;
}
/**
* multiply, divide, modulus
* @return {Node} node
* @private
*/
function parseMultiplyDivide(state) {
var node, last, name, fn;
node = parseImplicitMultiplication(state);
last = node;
var operators = {
'*': 'multiply',
'.*': 'dotMultiply',
'/': 'divide',
'./': 'dotDivide',
'%': 'mod',
mod: 'mod'
};
while (true) {
if (Object(utils_object["f" /* hasOwnProperty */])(operators, state.token)) {
// explicit operators
name = state.token;
fn = operators[name];
getTokenSkipNewline(state);
last = parseImplicitMultiplication(state);
node = new OperatorNode(name, fn, [node, last]);
} else {
break;
}
}
return node;
}
/**
* implicit multiplication
* @return {Node} node
* @private
*/
function parseImplicitMultiplication(state) {
var node, last;
node = parseRule2(state);
last = node;
while (true) {
if (state.tokenType === TOKENTYPE.SYMBOL || state.token === 'in' && Object(is["l" /* isConstantNode */])(node) || state.tokenType === TOKENTYPE.NUMBER && !Object(is["l" /* isConstantNode */])(last) && (!Object(is["B" /* isOperatorNode */])(last) || last.op === '!') || state.token === '(') {
// parse implicit multiplication
//
// symbol: implicit multiplication like '2a', '(2+3)a', 'a b'
// number: implicit multiplication like '(2+3)2'
// parenthesis: implicit multiplication like '2(3+4)', '(3+4)(1+2)'
last = parseRule2(state);
node = new OperatorNode('*', 'multiply', [node, last], true
/* implicit */
);
} else {
break;
}
}
return node;
}
/**
* Infamous "rule 2" as described in https://github.com/josdejong/mathjs/issues/792#issuecomment-361065370
* Explicit division gets higher precedence than implicit multiplication
* when the division matches this pattern: [number] / [number] [symbol]
* @return {Node} node
* @private
*/
function parseRule2(state) {
var node = parseUnary(state);
var last = node;
var tokenStates = [];
while (true) {
// Match the "number /" part of the pattern "number / number symbol"
if (state.token === '/' && Object(is["l" /* isConstantNode */])(last)) {
// Look ahead to see if the next token is a number
tokenStates.push(parse_extends({}, state));
getTokenSkipNewline(state); // Match the "number / number" part of the pattern
if (state.tokenType === TOKENTYPE.NUMBER) {
// Look ahead again
tokenStates.push(parse_extends({}, state));
getTokenSkipNewline(state); // Match the "symbol" part of the pattern, or a left parenthesis
if (state.tokenType === TOKENTYPE.SYMBOL || state.token === '(') {
// We've matched the pattern "number / number symbol".
// Rewind once and build the "number / number" node; the symbol will be consumed later
parse_extends(state, tokenStates.pop());
tokenStates.pop();
last = parseUnary(state);
node = new OperatorNode('/', 'divide', [node, last]);
} else {
// Not a match, so rewind
tokenStates.pop();
parse_extends(state, tokenStates.pop());
break;
}
} else {
// Not a match, so rewind
parse_extends(state, tokenStates.pop());
break;
}
} else {
break;
}
}
return node;
}
/**
* Unary plus and minus, and logical and bitwise not
* @return {Node} node
* @private
*/
function parseUnary(state) {
var name, params, fn;
var operators = {
'-': 'unaryMinus',
'+': 'unaryPlus',
'~': 'bitNot',
not: 'not'
};
if (Object(utils_object["f" /* hasOwnProperty */])(operators, state.token)) {
fn = operators[state.token];
name = state.token;
getTokenSkipNewline(state);
params = [parseUnary(state)];
return new OperatorNode(name, fn, params);
}
return parsePow(state);
}
/**
* power
* Note: power operator is right associative
* @return {Node} node
* @private
*/
function parsePow(state) {
var node, name, fn, params;
node = parseLeftHandOperators(state);
if (state.token === '^' || state.token === '.^') {
name = state.token;
fn = name === '^' ? 'pow' : 'dotPow';
getTokenSkipNewline(state);
params = [node, parseUnary(state)]; // Go back to unary, we can have '2^-3'
node = new OperatorNode(name, fn, params);
}
return node;
}
/**
* Left hand operators: factorial x!, ctranspose x'
* @return {Node} node
* @private
*/
function parseLeftHandOperators(state) {
var node, name, fn, params;
node = parseCustomNodes(state);
var operators = {
'!': 'factorial',
'\'': 'ctranspose'
};
while (Object(utils_object["f" /* hasOwnProperty */])(operators, state.token)) {
name = state.token;
fn = operators[name];
getToken(state);
params = [node];
node = new OperatorNode(name, fn, params);
node = parseAccessors(state, node);
}
return node;
}
/**
* Parse a custom node handler. A node handler can be used to process
* nodes in a custom way, for example for handling a plot.
*
* A handler must be passed as second argument of the parse function.
* - must extend math.Node
* - must contain a function _compile(defs: Object) : string
* - must contain a function find(filter: Object) : Node[]
* - must contain a function toString() : string
* - the constructor is called with a single argument containing all parameters
*
* For example:
*
* nodes = {
* 'plot': PlotHandler
* }
*
* The constructor of the handler is called as:
*
* node = new PlotHandler(params)
*
* The handler will be invoked when evaluating an expression like:
*
* node = math.parse('plot(sin(x), x)', nodes)
*
* @return {Node} node
* @private
*/
function parseCustomNodes(state) {
var params = [];
if (state.tokenType === TOKENTYPE.SYMBOL && Object(utils_object["f" /* hasOwnProperty */])(state.extraNodes, state.token)) {
var CustomNode = state.extraNodes[state.token];
getToken(state); // parse parameters
if (state.token === '(') {
params = [];
openParams(state);
getToken(state);
if (state.token !== ')') {
params.push(parseAssignment(state)); // parse a list with parameters
while (state.token === ',') {
// eslint-disable-line no-unmodified-loop-condition
getToken(state);
params.push(parseAssignment(state));
}
}
if (state.token !== ')') {
throw createSyntaxError(state, 'Parenthesis ) expected');
}
closeParams(state);
getToken(state);
} // create a new custom node
// noinspection JSValidateTypes
return new CustomNode(params);
}
return parseSymbol(state);
}
/**
* parse symbols: functions, variables, constants, units
* @return {Node} node
* @private
*/
function parseSymbol(state) {
var node, name;
if (state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {
name = state.token;
getToken(state);
if (Object(utils_object["f" /* hasOwnProperty */])(CONSTANTS, name)) {
// true, false, null, ...
node = new ConstantNode(CONSTANTS[name]);
} else if (NUMERIC_CONSTANTS.indexOf(name) !== -1) {
// NaN, Infinity
node = new ConstantNode(numeric(name, 'number'));
} else {
node = new SymbolNode(name);
} // parse function parameters and matrix index
node = parseAccessors(state, node);
return node;
}
return parseDoubleQuotesString(state);
}
/**
* parse accessors:
* - function invocation in round brackets (...), for example sqrt(2)
* - index enclosed in square brackets [...], for example A[2,3]
* - dot notation for properties, like foo.bar
* @param {Object} state
* @param {Node} node Node on which to apply the parameters. If there
* are no parameters in the expression, the node
* itself is returned
* @param {string[]} [types] Filter the types of notations
* can be ['(', '[', '.']
* @return {Node} node
* @private
*/
function parseAccessors(state, node, types) {
var params;
while ((state.token === '(' || state.token === '[' || state.token === '.') && (!types || types.indexOf(state.token) !== -1)) {
// eslint-disable-line no-unmodified-loop-condition
params = [];
if (state.token === '(') {
if (Object(is["J" /* isSymbolNode */])(node) || Object(is["a" /* isAccessorNode */])(node)) {
// function invocation like fn(2, 3) or obj.fn(2, 3)
openParams(state);
getToken(state);
if (state.token !== ')') {
params.push(parseAssignment(state)); // parse a list with parameters
while (state.token === ',') {
// eslint-disable-line no-unmodified-loop-condition
getToken(state);
params.push(parseAssignment(state));
}
}
if (state.token !== ')') {
throw createSyntaxError(state, 'Parenthesis ) expected');
}
closeParams(state);
getToken(state);
node = new FunctionNode(node, params);
} else {
// implicit multiplication like (2+3)(4+5) or sqrt(2)(1+2)
// don't parse it here but let it be handled by parseImplicitMultiplication
// with correct precedence
return node;
}
} else if (state.token === '[') {
// index notation like variable[2, 3]
openParams(state);
getToken(state);
if (state.token !== ']') {
params.push(parseAssignment(state)); // parse a list with parameters
while (state.token === ',') {
// eslint-disable-line no-unmodified-loop-condition
getToken(state);
params.push(parseAssignment(state));
}
}
if (state.token !== ']') {
throw createSyntaxError(state, 'Parenthesis ] expected');
}
closeParams(state);
getToken(state);
node = new AccessorNode(node, new IndexNode(params));
} else {
// dot notation like variable.prop
getToken(state);
if (state.tokenType !== TOKENTYPE.SYMBOL) {
throw createSyntaxError(state, 'Property name expected after dot');
}
params.push(new ConstantNode(state.token));
getToken(state);
var dotNotation = true;
node = new AccessorNode(node, new IndexNode(params, dotNotation));
}
}
return node;
}
/**
* Parse a double quotes string.
* @return {Node} node
* @private
*/
function parseDoubleQuotesString(state) {
var node, str;
if (state.token === '"') {
str = parseDoubleQuotesStringToken(state); // create constant
node = new ConstantNode(str); // parse index parameters
node = parseAccessors(state, node);
return node;
}
return parseSingleQuotesString(state);
}
/**
* Parse a string surrounded by double quotes "..."
* @return {string}
*/
function parseDoubleQuotesStringToken(state) {
var str = '';
while (currentCharacter(state) !== '' && currentCharacter(state) !== '"') {
if (currentCharacter(state) === '\\') {
// escape character, immediately process the next
// character to prevent stopping at a next '\"'
str += currentCharacter(state);
next(state);
}
str += currentCharacter(state);
next(state);
}
getToken(state);
if (state.token !== '"') {
throw createSyntaxError(state, 'End of string " expected');
}
getToken(state);
return JSON.parse('"' + str + '"'); // unescape escaped characters
}
/**
* Parse a single quotes string.
* @return {Node} node
* @private
*/
function parseSingleQuotesString(state) {
var node, str;
if (state.token === '\'') {
str = parseSingleQuotesStringToken(state); // create constant
node = new ConstantNode(str); // parse index parameters
node = parseAccessors(state, node);
return node;
}
return parseMatrix(state);
}
/**
* Parse a string surrounded by single quotes '...'
* @return {string}
*/
function parseSingleQuotesStringToken(state) {
var str = '';
while (currentCharacter(state) !== '' && currentCharacter(state) !== '\'') {
if (currentCharacter(state) === '\\') {
// escape character, immediately process the next
// character to prevent stopping at a next '\''
str += currentCharacter(state);
next(state);
}
str += currentCharacter(state);
next(state);
}
getToken(state);
if (state.token !== '\'') {
throw createSyntaxError(state, 'End of string \' expected');
}
getToken(state);
return JSON.parse('"' + str + '"'); // unescape escaped characters
}
/**
* parse the matrix
* @return {Node} node
* @private
*/
function parseMatrix(state) {
var array, params, rows, cols;
if (state.token === '[') {
// matrix [...]
openParams(state);
getToken(state);
if (state.token !== ']') {
// this is a non-empty matrix
var row = parseRow(state);
if (state.token === ';') {
// 2 dimensional array
rows = 1;
params = [row]; // the rows of the matrix are separated by dot-comma's
while (state.token === ';') {
// eslint-disable-line no-unmodified-loop-condition
getToken(state);
params[rows] = parseRow(state);
rows++;
}
if (state.token !== ']') {
throw createSyntaxError(state, 'End of matrix ] expected');
}
closeParams(state);
getToken(state); // check if the number of columns matches in all rows
cols = params[0].items.length;
for (var r = 1; r < rows; r++) {
if (params[r].items.length !== cols) {
throw createError(state, 'Column dimensions mismatch ' + '(' + params[r].items.length + ' !== ' + cols + ')');
}
}
array = new ArrayNode(params);
} else {
// 1 dimensional vector
if (state.token !== ']') {
throw createSyntaxError(state, 'End of matrix ] expected');
}
closeParams(state);
getToken(state);
array = row;
}
} else {
// this is an empty matrix "[ ]"
closeParams(state);
getToken(state);
array = new ArrayNode([]);
}
return parseAccessors(state, array);
}
return parseObject(state);
}
/**
* Parse a single comma-separated row from a matrix, like 'a, b, c'
* @return {ArrayNode} node
*/
function parseRow(state) {
var params = [parseAssignment(state)];
var len = 1;
while (state.token === ',') {
// eslint-disable-line no-unmodified-loop-condition
getToken(state); // parse expression
params[len] = parseAssignment(state);
len++;
}
return new ArrayNode(params);
}
/**
* parse an object, enclosed in angle brackets{...}, for example {value: 2}
* @return {Node} node
* @private
*/
function parseObject(state) {
if (state.token === '{') {
openParams(state);
var key;
var properties = {};
do {
getToken(state);
if (state.token !== '}') {
// parse key
if (state.token === '"') {
key = parseDoubleQuotesStringToken(state);
} else if (state.token === '\'') {
key = parseSingleQuotesStringToken(state);
} else if (state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {
key = state.token;
getToken(state);
} else {
throw createSyntaxError(state, 'Symbol or string expected as object key');
} // parse key/value separator
if (state.token !== ':') {
throw createSyntaxError(state, 'Colon : expected after object key');
}
getToken(state); // parse key
properties[key] = parseAssignment(state);
}
} while (state.token === ','); // eslint-disable-line no-unmodified-loop-condition
if (state.token !== '}') {
throw createSyntaxError(state, 'Comma , or bracket } expected after object value');
}
closeParams(state);
getToken(state);
var node = new ObjectNode(properties); // parse index parameters
node = parseAccessors(state, node);
return node;
}
return parseNumber(state);
}
/**
* parse a number
* @return {Node} node
* @private
*/
function parseNumber(state) {
var numberStr;
if (state.tokenType === TOKENTYPE.NUMBER) {
// this is a number
numberStr = state.token;
getToken(state);
return new ConstantNode(numeric(numberStr, config.number));
}
return parseParentheses(state);
}
/**
* parentheses
* @return {Node} node
* @private
*/
function parseParentheses(state) {
var node; // check if it is a parenthesized expression
if (state.token === '(') {
// parentheses (...)
openParams(state);
getToken(state);
node = parseAssignment(state); // start again
if (state.token !== ')') {
throw createSyntaxError(state, 'Parenthesis ) expected');
}
closeParams(state);
getToken(state);
node = new ParenthesisNode(node);
node = parseAccessors(state, node);
return node;
}
return parseEnd(state);
}
/**
* Evaluated when the expression is not yet ended but expected to end
* @return {Node} res
* @private
*/
function parseEnd(state) {
if (state.token === '') {
// syntax error or unexpected end of expression
throw createSyntaxError(state, 'Unexpected end of expression');
} else {
throw createSyntaxError(state, 'Value expected');
}
}
/**
* Shortcut for getting the current row value (one based)
* Returns the line of the currently handled expression
* @private
*/
/* TODO: implement keeping track on the row number
function row () {
return null
}
*/
/**
* Shortcut for getting the current col value (one based)
* Returns the column (position) where the last state.token starts
* @private
*/
function col(state) {
return state.index - state.token.length + 1;
}
/**
* Create an error
* @param {Object} state
* @param {string} message
* @return {SyntaxError} instantiated error
* @private
*/
function createSyntaxError(state, message) {
var c = col(state);
var error = new SyntaxError(message + ' (char ' + c + ')');
error["char"] = c;
return error;
}
/**
* Create an error
* @param {Object} state
* @param {string} message
* @return {Error} instantiated error
* @private
*/
function createError(state, message) {
var c = col(state);
var error = new SyntaxError(message + ' (char ' + c + ')');
error["char"] = c;
return error;
}
return parse;
});
// CONCATENATED MODULE: ./src/expression/function/compile.js
var compile_name = 'compile';
var compile_dependencies = ['typed', 'parse'];
var createCompile = /* #__PURE__ */Object(factory["a" /* factory */])(compile_name, compile_dependencies, function (_ref) {
var typed = _ref.typed,
parse = _ref.parse;
/**
* Parse and compile an expression.
* Returns a an object with a function `evaluate([scope])` to evaluate the
* compiled expression.
*
* Syntax:
*
* math.compile(expr) // returns one node
* math.compile([expr1, expr2, expr3, ...]) // returns an array with nodes
*
* Examples:
*
* const code1 = math.compile('sqrt(3^2 + 4^2)')
* code1.evaluate() // 5
*
* let scope = {a: 3, b: 4}
* const code2 = math.compile('a * b') // 12
* code2.evaluate(scope) // 12
* scope.a = 5
* code2.evaluate(scope) // 20
*
* const nodes = math.compile(['a = 3', 'b = 4', 'a * b'])
* nodes[2].evaluate() // 12
*
* See also:
*
* parse, evaluate
*
* @param {string | string[] | Array | Matrix} expr
* The expression to be compiled
* @return {{evaluate: Function} | Array.<{evaluate: Function}>} code
* An object with the compiled expression
* @throws {Error}
*/
return typed(compile_name, {
string: function string(expr) {
return parse(expr).compile();
},
'Array | Matrix': function ArrayMatrix(expr) {
return deepMap(expr, function (entry) {
return parse(entry).compile();
});
}
});
});
// CONCATENATED MODULE: ./src/expression/function/evaluate.js
var evaluate_name = 'evaluate';
var evaluate_dependencies = ['typed', 'parse'];
var createEvaluate = /* #__PURE__ */Object(factory["a" /* factory */])(evaluate_name, evaluate_dependencies, function (_ref) {
var typed = _ref.typed,
parse = _ref.parse;
/**
* Evaluate an expression.
*
* Note the evaluating arbitrary expressions may involve security risks,
* see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.
*
* Syntax:
*
* math.evaluate(expr)
* math.evaluate(expr, scope)
* math.evaluate([expr1, expr2, expr3, ...])
* math.evaluate([expr1, expr2, expr3, ...], scope)
*
* Example:
*
* math.evaluate('(2+3)/4') // 1.25
* math.evaluate('sqrt(3^2 + 4^2)') // 5
* math.evaluate('sqrt(-4)') // 2i
* math.evaluate(['a=3', 'b=4', 'a*b']) // [3, 4, 12]
*
* let scope = {a:3, b:4}
* math.evaluate('a * b', scope) // 12
*
* See also:
*
* parse, compile
*
* @param {string | string[] | Matrix} expr The expression to be evaluated
* @param {Object} [scope] Scope to read/write variables
* @return {*} The result of the expression
* @throws {Error}
*/
return typed(evaluate_name, {
string: function string(expr) {
var scope = {};
return parse(expr).compile().evaluate(scope);
},
'string, Object': function stringObject(expr, scope) {
return parse(expr).compile().evaluate(scope);
},
'Array | Matrix': function ArrayMatrix(expr) {
var scope = {};
return deepMap(expr, function (entry) {
return parse(entry).compile().evaluate(scope);
});
},
'Array | Matrix, Object': function ArrayMatrixObject(expr, scope) {
return deepMap(expr, function (entry) {
return parse(entry).compile().evaluate(scope);
});
}
});
});
// CONCATENATED MODULE: ./src/expression/Parser.js
var Parser_name = 'Parser';
var Parser_dependencies = ['parse'];
var createParserClass = /* #__PURE__ */Object(factory["a" /* factory */])(Parser_name, Parser_dependencies, function (_ref) {
var parse = _ref.parse;
/**
* @constructor Parser
* Parser contains methods to evaluate or parse expressions, and has a number
* of convenience methods to get, set, and remove variables from memory. Parser
* keeps a scope containing variables in memory, which is used for all
* evaluations.
*
* Methods:
* const result = parser.evaluate(expr) // evaluate an expression
* const value = parser.get(name) // retrieve a variable from the parser
* const values = parser.getAll() // retrieve all defined variables
* parser.set(name, value) // set a variable in the parser
* parser.remove(name) // clear a variable from the
* // parsers scope
* parser.clear() // clear the parsers scope
*
* Example usage:
* const parser = new Parser()
* // Note: there is a convenience method which can be used instead:
* // const parser = new math.parser()
*
* // evaluate expressions
* parser.evaluate('sqrt(3^2 + 4^2)') // 5
* parser.evaluate('sqrt(-4)') // 2i
* parser.evaluate('2 inch in cm') // 5.08 cm
* parser.evaluate('cos(45 deg)') // 0.7071067811865476
*
* // define variables and functions
* parser.evaluate('x = 7 / 2') // 3.5
* parser.evaluate('x + 3') // 6.5
* parser.evaluate('function f(x, y) = x^y') // f(x, y)
* parser.evaluate('f(2, 3)') // 8
*
* // get and set variables and functions
* const x = parser.get('x') // 7
* const f = parser.get('f') // function
* const g = f(3, 2) // 9
* parser.set('h', 500)
* const i = parser.evaluate('h / 2') // 250
* parser.set('hello', function (name) {
* return 'hello, ' + name + '!'
* })
* parser.evaluate('hello("user")') // "hello, user!"
*
* // clear defined functions and variables
* parser.clear()
*
*/
function Parser() {
if (!(this instanceof Parser)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
this.scope = {};
}
/**
* Attach type information
*/
Parser.prototype.type = 'Parser';
Parser.prototype.isParser = true;
/**
* Parse and evaluate the given expression
* @param {string} expr A string containing an expression, for example "2+3"
* @return {*} result The result, or undefined when the expression was empty
* @throws {Error}
*/
Parser.prototype.evaluate = function (expr) {
// TODO: validate arguments
return parse(expr).compile().evaluate(this.scope);
};
/**
* Get a variable (a function or variable) by name from the parsers scope.
* Returns undefined when not found
* @param {string} name
* @return {* | undefined} value
*/
Parser.prototype.get = function (name) {
// TODO: validate arguments
return name in this.scope ? getSafeProperty(this.scope, name) : undefined;
};
/**
* Get a map with all defined variables
* @return {Object} values
*/
Parser.prototype.getAll = function () {
return Object(utils_object["e" /* extend */])({}, this.scope);
};
/**
* Set a symbol (a function or variable) by name from the parsers scope.
* @param {string} name
* @param {* | undefined} value
*/
Parser.prototype.set = function (name, value) {
// TODO: validate arguments
return setSafeProperty(this.scope, name, value);
};
/**
* Remove a variable from the parsers scope
* @param {string} name
*/
Parser.prototype.remove = function (name) {
// TODO: validate arguments
delete this.scope[name];
};
/**
* Clear the scope with variables and functions
*/
Parser.prototype.clear = function () {
for (var _name in this.scope) {
if (Object(utils_object["f" /* hasOwnProperty */])(this.scope, _name)) {
delete this.scope[_name];
}
}
};
return Parser;
}, {
isClass: true
});
// CONCATENATED MODULE: ./src/expression/function/parser.js
var parser_name = 'parser';
var parser_dependencies = ['typed', 'Parser'];
var createParser = /* #__PURE__ */Object(factory["a" /* factory */])(parser_name, parser_dependencies, function (_ref) {
var typed = _ref.typed,
Parser = _ref.Parser;
/**
* Create a parser. The function creates a new `math.Parser` object.
*
* Syntax:
*
* math.parser()
*
* Examples:
*
* const parser = new math.parser()
*
* // evaluate expressions
* const a = parser.evaluate('sqrt(3^2 + 4^2)') // 5
* const b = parser.evaluate('sqrt(-4)') // 2i
* const c = parser.evaluate('2 inch in cm') // 5.08 cm
* const d = parser.evaluate('cos(45 deg)') // 0.7071067811865476
*
* // define variables and functions
* parser.evaluate('x = 7 / 2') // 3.5
* parser.evaluate('x + 3') // 6.5
* parser.evaluate('function f(x, y) = x^y') // f(x, y)
* parser.evaluate('f(2, 3)') // 8
*
* // get and set variables and functions
* const x = parser.get('x') // 7
* const f = parser.get('f') // function
* const g = f(3, 2) // 9
* parser.set('h', 500)
* const i = parser.evaluate('h / 2') // 250
* parser.set('hello', function (name) {
* return 'hello, ' + name + '!'
* })
* parser.evaluate('hello("user")') // "hello, user!"
*
* // clear defined functions and variables
* parser.clear()
*
* See also:
*
* evaluate, compile, parse
*
* @return {Parser} Parser
*/
return typed(parser_name, {
'': function _() {
return new Parser();
}
});
});
// CONCATENATED MODULE: ./src/function/algebra/decomposition/lup.js
var lup_name = 'lup';
var lup_dependencies = ['typed', 'matrix', 'abs', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtract', 'larger', 'equalScalar', 'unaryMinus', 'DenseMatrix', 'SparseMatrix', 'Spa'];
var createLup = /* #__PURE__ */Object(factory["a" /* factory */])(lup_name, lup_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
abs = _ref.abs,
addScalar = _ref.addScalar,
divideScalar = _ref.divideScalar,
multiplyScalar = _ref.multiplyScalar,
subtract = _ref.subtract,
larger = _ref.larger,
equalScalar = _ref.equalScalar,
unaryMinus = _ref.unaryMinus,
DenseMatrix = _ref.DenseMatrix,
SparseMatrix = _ref.SparseMatrix,
Spa = _ref.Spa;
/**
* Calculate the Matrix LU decomposition with partial pivoting. Matrix `A` is decomposed in two matrices (`L`, `U`) and a
* row permutation vector `p` where `A[p,:] = L * U`
*
* Syntax:
*
* math.lup(A)
*
* Example:
*
* const m = [[2, 1], [1, 4]]
* const r = math.lup(m)
* // r = {
* // L: [[1, 0], [0.5, 1]],
* // U: [[2, 1], [0, 3.5]],
* // P: [0, 1]
* // }
*
* See also:
*
* slu, lsolve, lusolve, usolve
*
* @param {Matrix | Array} A A two dimensional matrix or array for which to get the LUP decomposition.
*
* @return {{L: Array | Matrix, U: Array | Matrix, P: Array.<number>}} The lower triangular matrix, the upper triangular matrix and the permutation matrix.
*/
return typed(lup_name, {
DenseMatrix: function DenseMatrix(m) {
return _denseLUP(m);
},
SparseMatrix: function SparseMatrix(m) {
return _sparseLUP(m);
},
Array: function Array(a) {
// create dense matrix from array
var m = matrix(a); // lup, use matrix implementation
var r = _denseLUP(m); // result
return {
L: r.L.valueOf(),
U: r.U.valueOf(),
p: r.p
};
}
});
function _denseLUP(m) {
// rows & columns
var rows = m._size[0];
var columns = m._size[1]; // minimum rows and columns
var n = Math.min(rows, columns); // matrix array, clone original data
var data = Object(utils_object["a" /* clone */])(m._data); // l matrix arrays
var ldata = [];
var lsize = [rows, n]; // u matrix arrays
var udata = [];
var usize = [n, columns]; // vars
var i, j, k; // permutation vector
var p = [];
for (i = 0; i < rows; i++) {
p[i] = i;
} // loop columns
for (j = 0; j < columns; j++) {
// skip first column in upper triangular matrix
if (j > 0) {
// loop rows
for (i = 0; i < rows; i++) {
// min i,j
var min = Math.min(i, j); // v[i, j]
var s = 0; // loop up to min
for (k = 0; k < min; k++) {
// s = l[i, k] - data[k, j]
s = addScalar(s, multiplyScalar(data[i][k], data[k][j]));
}
data[i][j] = subtract(data[i][j], s);
}
} // row with larger value in cvector, row >= j
var pi = j;
var pabsv = 0;
var vjj = 0; // loop rows
for (i = j; i < rows; i++) {
// data @ i, j
var v = data[i][j]; // absolute value
var absv = abs(v); // value is greater than pivote value
if (larger(absv, pabsv)) {
// store row
pi = i; // update max value
pabsv = absv; // value @ [j, j]
vjj = v;
}
} // swap rows (j <-> pi)
if (j !== pi) {
// swap values j <-> pi in p
p[j] = [p[pi], p[pi] = p[j]][0]; // swap j <-> pi in data
DenseMatrix._swapRows(j, pi, data);
} // check column is in lower triangular matrix
if (j < rows) {
// loop rows (lower triangular matrix)
for (i = j + 1; i < rows; i++) {
// value @ i, j
var vij = data[i][j];
if (!equalScalar(vij, 0)) {
// update data
data[i][j] = divideScalar(data[i][j], vjj);
}
}
}
} // loop columns
for (j = 0; j < columns; j++) {
// loop rows
for (i = 0; i < rows; i++) {
// initialize row in arrays
if (j === 0) {
// check row exists in upper triangular matrix
if (i < columns) {
// U
udata[i] = [];
} // L
ldata[i] = [];
} // check we are in the upper triangular matrix
if (i < j) {
// check row exists in upper triangular matrix
if (i < columns) {
// U
udata[i][j] = data[i][j];
} // check column exists in lower triangular matrix
if (j < rows) {
// L
ldata[i][j] = 0;
}
continue;
} // diagonal value
if (i === j) {
// check row exists in upper triangular matrix
if (i < columns) {
// U
udata[i][j] = data[i][j];
} // check column exists in lower triangular matrix
if (j < rows) {
// L
ldata[i][j] = 1;
}
continue;
} // check row exists in upper triangular matrix
if (i < columns) {
// U
udata[i][j] = 0;
} // check column exists in lower triangular matrix
if (j < rows) {
// L
ldata[i][j] = data[i][j];
}
}
} // l matrix
var l = new DenseMatrix({
data: ldata,
size: lsize
}); // u matrix
var u = new DenseMatrix({
data: udata,
size: usize
}); // p vector
var pv = [];
for (i = 0, n = p.length; i < n; i++) {
pv[p[i]] = i;
} // return matrices
return {
L: l,
U: u,
p: pv,
toString: function toString() {
return 'L: ' + this.L.toString() + '\nU: ' + this.U.toString() + '\nP: ' + this.p;
}
};
}
function _sparseLUP(m) {
// rows & columns
var rows = m._size[0];
var columns = m._size[1]; // minimum rows and columns
var n = Math.min(rows, columns); // matrix arrays (will not be modified, thanks to permutation vector)
var values = m._values;
var index = m._index;
var ptr = m._ptr; // l matrix arrays
var lvalues = [];
var lindex = [];
var lptr = [];
var lsize = [rows, n]; // u matrix arrays
var uvalues = [];
var uindex = [];
var uptr = [];
var usize = [n, columns]; // vars
var i, j, k; // permutation vectors, (current index -> original index) and (original index -> current index)
var pvCo = [];
var pvOc = [];
for (i = 0; i < rows; i++) {
pvCo[i] = i;
pvOc[i] = i;
} // swap indices in permutation vectors (condition x < y)!
var swapIndeces = function swapIndeces(x, y) {
// find pv indeces getting data from x and y
var kx = pvOc[x];
var ky = pvOc[y]; // update permutation vector current -> original
pvCo[kx] = y;
pvCo[ky] = x; // update permutation vector original -> current
pvOc[x] = ky;
pvOc[y] = kx;
}; // loop columns
var _loop = function _loop() {
// sparse accumulator
var spa = new Spa(); // check lower triangular matrix has a value @ column j
if (j < rows) {
// update ptr
lptr.push(lvalues.length); // first value in j column for lower triangular matrix
lvalues.push(1);
lindex.push(j);
} // update ptr
uptr.push(uvalues.length); // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
var k0 = ptr[j];
var k1 = ptr[j + 1]; // copy column j into sparse accumulator
for (k = k0; k < k1; k++) {
// row
i = index[k]; // copy column values into sparse accumulator (use permutation vector)
spa.set(pvCo[i], values[k]);
} // skip first column in upper triangular matrix
if (j > 0) {
// loop rows in column j (above diagonal)
spa.forEach(0, j - 1, function (k, vkj) {
// loop rows in column k (L)
SparseMatrix._forEachRow(k, lvalues, lindex, lptr, function (i, vik) {
// check row is below k
if (i > k) {
// update spa value
spa.accumulate(i, unaryMinus(multiplyScalar(vik, vkj)));
}
});
});
} // row with larger value in spa, row >= j
var pi = j;
var vjj = spa.get(j);
var pabsv = abs(vjj); // loop values in spa (order by row, below diagonal)
spa.forEach(j + 1, rows - 1, function (x, v) {
// absolute value
var absv = abs(v); // value is greater than pivote value
if (larger(absv, pabsv)) {
// store row
pi = x; // update max value
pabsv = absv; // value @ [j, j]
vjj = v;
}
}); // swap rows (j <-> pi)
if (j !== pi) {
// swap values j <-> pi in L
SparseMatrix._swapRows(j, pi, lsize[1], lvalues, lindex, lptr); // swap values j <-> pi in U
SparseMatrix._swapRows(j, pi, usize[1], uvalues, uindex, uptr); // swap values in spa
spa.swap(j, pi); // update permutation vector (swap values @ j, pi)
swapIndeces(j, pi);
} // loop values in spa (order by row)
spa.forEach(0, rows - 1, function (x, v) {
// check we are above diagonal
if (x <= j) {
// update upper triangular matrix
uvalues.push(v);
uindex.push(x);
} else {
// update value
v = divideScalar(v, vjj); // check value is non zero
if (!equalScalar(v, 0)) {
// update lower triangular matrix
lvalues.push(v);
lindex.push(x);
}
}
});
};
for (j = 0; j < columns; j++) {
_loop();
} // update ptrs
uptr.push(uvalues.length);
lptr.push(lvalues.length); // return matrices
return {
L: new SparseMatrix({
values: lvalues,
index: lindex,
ptr: lptr,
size: lsize
}),
U: new SparseMatrix({
values: uvalues,
index: uindex,
ptr: uptr,
size: usize
}),
p: pvCo,
toString: function toString() {
return 'L: ' + this.L.toString() + '\nU: ' + this.U.toString() + '\nP: ' + this.p;
}
};
}
});
// CONCATENATED MODULE: ./src/function/algebra/decomposition/qr.js
function qr_extends() { qr_extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return qr_extends.apply(this, arguments); }
var qr_name = 'qr';
var qr_dependencies = ['typed', 'matrix', 'zeros', 'identity', 'isZero', 'equal', 'sign', 'sqrt', 'conj', 'unaryMinus', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtract', 'complex'];
var createQr = /* #__PURE__ */Object(factory["a" /* factory */])(qr_name, qr_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
zeros = _ref.zeros,
identity = _ref.identity,
isZero = _ref.isZero,
equal = _ref.equal,
sign = _ref.sign,
sqrt = _ref.sqrt,
conj = _ref.conj,
unaryMinus = _ref.unaryMinus,
addScalar = _ref.addScalar,
divideScalar = _ref.divideScalar,
multiplyScalar = _ref.multiplyScalar,
subtract = _ref.subtract,
complex = _ref.complex;
/**
* Calculate the Matrix QR decomposition. Matrix `A` is decomposed in
* two matrices (`Q`, `R`) where `Q` is an
* orthogonal matrix and `R` is an upper triangular matrix.
*
* Syntax:
*
* math.qr(A)
*
* Example:
*
* const m = [
* [1, -1, 4],
* [1, 4, -2],
* [1, 4, 2],
* [1, -1, 0]
* ]
* const result = math.qr(m)
* // r = {
* // Q: [
* // [0.5, -0.5, 0.5],
* // [0.5, 0.5, -0.5],
* // [0.5, 0.5, 0.5],
* // [0.5, -0.5, -0.5],
* // ],
* // R: [
* // [2, 3, 2],
* // [0, 5, -2],
* // [0, 0, 4],
* // [0, 0, 0]
* // ]
* // }
*
* See also:
*
* lup, lusolve
*
* @param {Matrix | Array} A A two dimensional matrix or array
* for which to get the QR decomposition.
*
* @return {{Q: Array | Matrix, R: Array | Matrix}} Q: the orthogonal
* matrix and R: the upper triangular matrix
*/
return qr_extends(typed(qr_name, {
DenseMatrix: function DenseMatrix(m) {
return _denseQR(m);
},
SparseMatrix: function SparseMatrix(m) {
return _sparseQR(m);
},
Array: function Array(a) {
// create dense matrix from array
var m = matrix(a); // lup, use matrix implementation
var r = _denseQR(m); // result
return {
Q: r.Q.valueOf(),
R: r.R.valueOf()
};
}
}), {
_denseQRimpl: _denseQRimpl
});
function _denseQRimpl(m) {
// rows & columns (m x n)
var rows = m._size[0]; // m
var cols = m._size[1]; // n
var Q = identity([rows], 'dense');
var Qdata = Q._data;
var R = m.clone();
var Rdata = R._data; // vars
var i, j, k;
var w = zeros([rows], '');
for (k = 0; k < Math.min(cols, rows); ++k) {
/*
* **k-th Household matrix**
*
* The matrix I - 2*v*transpose(v)
* x = first column of A
* x1 = first element of x
* alpha = x1 / |x1| * |x|
* e1 = tranpose([1, 0, 0, ...])
* u = x - alpha * e1
* v = u / |u|
*
* Household matrix = I - 2 * v * tranpose(v)
*
* * Initially Q = I and R = A.
* * Household matrix is a reflection in a plane normal to v which
* will zero out all but the top right element in R.
* * Appplying reflection to both Q and R will not change product.
* * Repeat this process on the (1,1) minor to get R as an upper
* triangular matrix.
* * Reflections leave the magnitude of the columns of Q unchanged
* so Q remains othoganal.
*
*/
var pivot = Rdata[k][k];
var sgn = unaryMinus(equal(pivot, 0) ? 1 : sign(pivot));
var conjSgn = conj(sgn);
var alphaSquared = 0;
for (i = k; i < rows; i++) {
alphaSquared = addScalar(alphaSquared, multiplyScalar(Rdata[i][k], conj(Rdata[i][k])));
}
var alpha = multiplyScalar(sgn, sqrt(alphaSquared));
if (!isZero(alpha)) {
// first element in vector u
var u1 = subtract(pivot, alpha); // w = v * u1 / |u| (only elements k to (rows-1) are used)
w[k] = 1;
for (i = k + 1; i < rows; i++) {
w[i] = divideScalar(Rdata[i][k], u1);
} // tau = - conj(u1 / alpha)
var tau = unaryMinus(conj(divideScalar(u1, alpha)));
var s = void 0;
/*
* tau and w have been choosen so that
*
* 2 * v * tranpose(v) = tau * w * tranpose(w)
*/
/*
* -- calculate R = R - tau * w * tranpose(w) * R --
* Only do calculation with rows k to (rows-1)
* Additionally columns 0 to (k-1) will not be changed by this
* multiplication so do not bother recalculating them
*/
for (j = k; j < cols; j++) {
s = 0.0; // calculate jth element of [tranpose(w) * R]
for (i = k; i < rows; i++) {
s = addScalar(s, multiplyScalar(conj(w[i]), Rdata[i][j]));
} // calculate the jth element of [tau * transpose(w) * R]
s = multiplyScalar(s, tau);
for (i = k; i < rows; i++) {
Rdata[i][j] = multiplyScalar(subtract(Rdata[i][j], multiplyScalar(w[i], s)), conjSgn);
}
}
/*
* -- calculate Q = Q - tau * Q * w * transpose(w) --
* Q is a square matrix (rows x rows)
* Only do calculation with columns k to (rows-1)
* Additionally rows 0 to (k-1) will not be changed by this
* multiplication so do not bother recalculating them
*/
for (i = 0; i < rows; i++) {
s = 0.0; // calculate ith element of [Q * w]
for (j = k; j < rows; j++) {
s = addScalar(s, multiplyScalar(Qdata[i][j], w[j]));
} // calculate the ith element of [tau * Q * w]
s = multiplyScalar(s, tau);
for (j = k; j < rows; ++j) {
Qdata[i][j] = divideScalar(subtract(Qdata[i][j], multiplyScalar(s, conj(w[j]))), conjSgn);
}
}
}
} // return matrices
return {
Q: Q,
R: R,
toString: function toString() {
return 'Q: ' + this.Q.toString() + '\nR: ' + this.R.toString();
}
};
}
function _denseQR(m) {
var ret = _denseQRimpl(m);
var Rdata = ret.R._data;
if (m._data.length > 0) {
var zero = Rdata[0][0].type === 'Complex' ? complex(0) : 0;
for (var i = 0; i < Rdata.length; ++i) {
for (var j = 0; j < i && j < (Rdata[0] || []).length; ++j) {
Rdata[i][j] = zero;
}
}
}
return ret;
}
function _sparseQR(m) {
throw new Error('qr not implemented for sparse matrices yet');
}
});
// CONCATENATED MODULE: ./src/function/algebra/sparse/csPermute.js
/**
* Permutes a sparse matrix C = P * A * Q
*
* @param {SparseMatrix} a The Matrix A
* @param {Array} pinv The row permutation vector
* @param {Array} q The column permutation vector
* @param {boolean} values Create a pattern matrix (false), values and pattern otherwise
*
* @return {Matrix} C = P * A * Q, null on error
*
* Reference: http://faculty.cse.tamu.edu/davis/publications.html
*/
function csPermute(a, pinv, q, values) {
// a arrays
var avalues = a._values;
var aindex = a._index;
var aptr = a._ptr;
var asize = a._size;
var adt = a._datatype; // rows & columns
var m = asize[0];
var n = asize[1]; // c arrays
var cvalues = values && a._values ? [] : null;
var cindex = []; // (aptr[n])
var cptr = []; // (n + 1)
// initialize vars
var nz = 0; // loop columns
for (var k = 0; k < n; k++) {
// column k of C is column q[k] of A
cptr[k] = nz; // apply column permutation
var j = q ? q[k] : k; // loop values in column j of A
for (var t0 = aptr[j], t1 = aptr[j + 1], t = t0; t < t1; t++) {
// row i of A is row pinv[i] of C
var r = pinv ? pinv[aindex[t]] : aindex[t]; // index
cindex[nz] = r; // check we need to populate values
if (cvalues) {
cvalues[nz] = avalues[t];
} // increment number of nonzero elements
nz++;
}
} // finalize the last column of C
cptr[n] = nz; // return C matrix
return a.createSparseMatrix({
values: cvalues,
index: cindex,
ptr: cptr,
size: [m, n],
datatype: adt
});
}
// CONCATENATED MODULE: ./src/function/algebra/sparse/csTdfs.js
/**
* Depth-first search and postorder of a tree rooted at node j
*
* @param {Number} j The tree node
* @param {Number} k
* @param {Array} w The workspace array
* @param {Number} head The index offset within the workspace for the head array
* @param {Number} next The index offset within the workspace for the next array
* @param {Array} post The post ordering array
* @param {Number} stack The index offset within the workspace for the stack array
*
* Reference: http://faculty.cse.tamu.edu/davis/publications.html
*/
function csTdfs(j, k, w, head, next, post, stack) {
// variables
var top = 0; // place j on the stack
w[stack] = j; // while (stack is not empty)
while (top >= 0) {
// p = top of stack
var p = w[stack + top]; // i = youngest child of p
var i = w[head + p];
if (i === -1) {
// p has no unordered children left
top--; // node p is the kth postordered node
post[k++] = p;
} else {
// remove i from children of p
w[head + p] = w[next + i]; // increment top
++top; // start dfs on child node i
w[stack + top] = i;
}
}
return k;
}
// CONCATENATED MODULE: ./src/function/algebra/sparse/csPost.js
/**
* Post order a tree of forest
*
* @param {Array} parent The tree or forest
* @param {Number} n Number of columns
*
* Reference: http://faculty.cse.tamu.edu/davis/publications.html
*/
function csPost(parent, n) {
// check inputs
if (!parent) {
return null;
} // vars
var k = 0;
var j; // allocate result
var post = []; // (n)
// workspace, head: first n entries, next: next n entries, stack: last n entries
var w = []; // (3 * n)
var head = 0;
var next = n;
var stack = 2 * n; // initialize workspace
for (j = 0; j < n; j++) {
// empty linked lists
w[head + j] = -1;
} // traverse nodes in reverse order
for (j = n - 1; j >= 0; j--) {
// check j is a root
if (parent[j] === -1) {
continue;
} // add j to list of its parent
w[next + j] = w[head + parent[j]];
w[head + parent[j]] = j;
} // loop nodes
for (j = 0; j < n; j++) {
// skip j if it is not a root
if (parent[j] !== -1) {
continue;
} // depth-first search
k = csTdfs(j, k, w, head, next, post, stack);
}
return post;
}
// CONCATENATED MODULE: ./src/function/algebra/sparse/csEtree.js
/**
* Computes the elimination tree of Matrix A (using triu(A)) or the
* elimination tree of A'A without forming A'A.
*
* @param {Matrix} a The A Matrix
* @param {boolean} ata A value of true the function computes the etree of A'A
*
* Reference: http://faculty.cse.tamu.edu/davis/publications.html
*/
function csEtree(a, ata) {
// check inputs
if (!a) {
return null;
} // a arrays
var aindex = a._index;
var aptr = a._ptr;
var asize = a._size; // rows & columns
var m = asize[0];
var n = asize[1]; // allocate result
var parent = []; // (n)
// allocate workspace
var w = []; // (n + (ata ? m : 0))
var ancestor = 0; // first n entries in w
var prev = n; // last m entries (ata = true)
var i, inext; // check we are calculating A'A
if (ata) {
// initialize workspace
for (i = 0; i < m; i++) {
w[prev + i] = -1;
}
} // loop columns
for (var k = 0; k < n; k++) {
// node k has no parent yet
parent[k] = -1; // nor does k have an ancestor
w[ancestor + k] = -1; // values in column k
for (var p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {
// row
var r = aindex[p]; // node
i = ata ? w[prev + r] : r; // traverse from i to k
for (; i !== -1 && i < k; i = inext) {
// inext = ancestor of i
inext = w[ancestor + i]; // path compression
w[ancestor + i] = k; // check no anc., parent is k
if (inext === -1) {
parent[i] = k;
}
}
if (ata) {
w[prev + r] = k;
}
}
}
return parent;
}
// CONCATENATED MODULE: ./src/function/algebra/sparse/csFkeep.js
/**
* Keeps entries in the matrix when the callback function returns true, removes the entry otherwise
*
* @param {Matrix} a The sparse matrix
* @param {function} callback The callback function, function will be invoked with the following args:
* - The entry row
* - The entry column
* - The entry value
* - The state parameter
* @param {any} other The state
*
* @return The number of nonzero elements in the matrix
*
* Reference: http://faculty.cse.tamu.edu/davis/publications.html
*/
function csFkeep(a, callback, other) {
// a arrays
var avalues = a._values;
var aindex = a._index;
var aptr = a._ptr;
var asize = a._size; // columns
var n = asize[1]; // nonzero items
var nz = 0; // loop columns
for (var j = 0; j < n; j++) {
// get current location of col j
var p = aptr[j]; // record new location of col j
aptr[j] = nz;
for (; p < aptr[j + 1]; p++) {
// check we need to keep this item
if (callback(aindex[p], j, avalues ? avalues[p] : 1, other)) {
// keep A(i,j)
aindex[nz] = aindex[p]; // check we need to process values (pattern only)
if (avalues) {
avalues[nz] = avalues[p];
} // increment nonzero items
nz++;
}
}
} // finalize A
aptr[n] = nz; // trim arrays
aindex.splice(nz, aindex.length - nz); // check we need to process values (pattern only)
if (avalues) {
avalues.splice(nz, avalues.length - nz);
} // return number of nonzero items
return nz;
}
// CONCATENATED MODULE: ./src/function/algebra/sparse/csFlip.js
/**
* This function "flips" its input about the integer -1.
*
* @param {Number} i The value to flip
*
* Reference: http://faculty.cse.tamu.edu/davis/publications.html
*/
function csFlip(i) {
// flip the value
return -i - 2;
}
// CONCATENATED MODULE: ./src/function/algebra/sparse/csAmd.js
var csAmd_name = 'csAmd';
var csAmd_dependencies = ['add', 'multiply', 'transpose'];
var createCsAmd = /* #__PURE__ */Object(factory["a" /* factory */])(csAmd_name, csAmd_dependencies, function (_ref) {
var add = _ref.add,
multiply = _ref.multiply,
transpose = _ref.transpose;
/**
* Approximate minimum degree ordering. The minimum degree algorithm is a widely used
* heuristic for finding a permutation P so that P*A*P' has fewer nonzeros in its factorization
* than A. It is a gready method that selects the sparsest pivot row and column during the course
* of a right looking sparse Cholesky factorization.
*
* Reference: http://faculty.cse.tamu.edu/davis/publications.html
*
* @param {Number} order 0: Natural, 1: Cholesky, 2: LU, 3: QR
* @param {Matrix} m Sparse Matrix
*/
return function csAmd(order, a) {
// check input parameters
if (!a || order <= 0 || order > 3) {
return null;
} // a matrix arrays
var asize = a._size; // rows and columns
var m = asize[0];
var n = asize[1]; // initialize vars
var lemax = 0; // dense threshold
var dense = Math.max(16, 10 * Math.sqrt(n));
dense = Math.min(n - 2, dense); // create target matrix C
var cm = _createTargetMatrix(order, a, m, n, dense); // drop diagonal entries
csFkeep(cm, _diag, null); // C matrix arrays
var cindex = cm._index;
var cptr = cm._ptr; // number of nonzero elements in C
var cnz = cptr[n]; // allocate result (n+1)
var P = []; // create workspace (8 * (n + 1))
var W = [];
var len = 0; // first n + 1 entries
var nv = n + 1; // next n + 1 entries
var next = 2 * (n + 1); // next n + 1 entries
var head = 3 * (n + 1); // next n + 1 entries
var elen = 4 * (n + 1); // next n + 1 entries
var degree = 5 * (n + 1); // next n + 1 entries
var w = 6 * (n + 1); // next n + 1 entries
var hhead = 7 * (n + 1); // last n + 1 entries
// use P as workspace for last
var last = P; // initialize quotient graph
var mark = _initializeQuotientGraph(n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree); // initialize degree lists
var nel = _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next); // minimum degree node
var mindeg = 0; // vars
var i, j, k, k1, k2, e, pj, ln, nvi, pk, eln, p1, p2, pn, h, d; // while (selecting pivots) do
while (nel < n) {
// select node of minimum approximate degree. amd() is now ready to start eliminating the graph. It first
// finds a node k of minimum degree and removes it from its degree list. The variable nel keeps track of thow
// many nodes have been eliminated.
for (k = -1; mindeg < n && (k = W[head + mindeg]) === -1; mindeg++) {
;
}
if (W[next + k] !== -1) {
last[W[next + k]] = -1;
} // remove k from degree list
W[head + mindeg] = W[next + k]; // elenk = |Ek|
var elenk = W[elen + k]; // # of nodes k represents
var nvk = W[nv + k]; // W[nv + k] nodes of A eliminated
nel += nvk; // Construct a new element. The new element Lk is constructed in place if |Ek| = 0. nv[i] is
// negated for all nodes i in Lk to flag them as members of this set. Each node i is removed from the
// degree lists. All elements e in Ek are absorved into element k.
var dk = 0; // flag k as in Lk
W[nv + k] = -nvk;
var p = cptr[k]; // do in place if W[elen + k] === 0
var pk1 = elenk === 0 ? p : cnz;
var pk2 = pk1;
for (k1 = 1; k1 <= elenk + 1; k1++) {
if (k1 > elenk) {
// search the nodes in k
e = k; // list of nodes starts at cindex[pj]
pj = p; // length of list of nodes in k
ln = W[len + k] - elenk;
} else {
// search the nodes in e
e = cindex[p++];
pj = cptr[e]; // length of list of nodes in e
ln = W[len + e];
}
for (k2 = 1; k2 <= ln; k2++) {
i = cindex[pj++]; // check node i dead, or seen
if ((nvi = W[nv + i]) <= 0) {
continue;
} // W[degree + Lk] += size of node i
dk += nvi; // negate W[nv + i] to denote i in Lk
W[nv + i] = -nvi; // place i in Lk
cindex[pk2++] = i;
if (W[next + i] !== -1) {
last[W[next + i]] = last[i];
} // check we need to remove i from degree list
if (last[i] !== -1) {
W[next + last[i]] = W[next + i];
} else {
W[head + W[degree + i]] = W[next + i];
}
}
if (e !== k) {
// absorb e into k
cptr[e] = csFlip(k); // e is now a dead element
W[w + e] = 0;
}
} // cindex[cnz...nzmax] is free
if (elenk !== 0) {
cnz = pk2;
} // external degree of k - |Lk\i|
W[degree + k] = dk; // element k is in cindex[pk1..pk2-1]
cptr[k] = pk1;
W[len + k] = pk2 - pk1; // k is now an element
W[elen + k] = -2; // Find set differences. The scan1 function now computes the set differences |Le \ Lk| for all elements e. At the start of the
// scan, no entry in the w array is greater than or equal to mark.
// clear w if necessary
mark = _wclear(mark, lemax, W, w, n); // scan 1: find |Le\Lk|
for (pk = pk1; pk < pk2; pk++) {
i = cindex[pk]; // check if W[elen + i] empty, skip it
if ((eln = W[elen + i]) <= 0) {
continue;
} // W[nv + i] was negated
nvi = -W[nv + i];
var wnvi = mark - nvi; // scan Ei
for (p = cptr[i], p1 = cptr[i] + eln - 1; p <= p1; p++) {
e = cindex[p];
if (W[w + e] >= mark) {
// decrement |Le\Lk|
W[w + e] -= nvi;
} else if (W[w + e] !== 0) {
// ensure e is a live element, 1st time e seen in scan 1
W[w + e] = W[degree + e] + wnvi;
}
}
} // degree update
// The second pass computes the approximate degree di, prunes the sets Ei and Ai, and computes a hash
// function h(i) for all nodes in Lk.
// scan2: degree update
for (pk = pk1; pk < pk2; pk++) {
// consider node i in Lk
i = cindex[pk];
p1 = cptr[i];
p2 = p1 + W[elen + i] - 1;
pn = p1; // scan Ei
for (h = 0, d = 0, p = p1; p <= p2; p++) {
e = cindex[p]; // check e is an unabsorbed element
if (W[w + e] !== 0) {
// dext = |Le\Lk|
var dext = W[w + e] - mark;
if (dext > 0) {
// sum up the set differences
d += dext; // keep e in Ei
cindex[pn++] = e; // compute the hash of node i
h += e;
} else {
// aggressive absorb. e->k
cptr[e] = csFlip(k); // e is a dead element
W[w + e] = 0;
}
}
} // W[elen + i] = |Ei|
W[elen + i] = pn - p1 + 1;
var p3 = pn;
var p4 = p1 + W[len + i]; // prune edges in Ai
for (p = p2 + 1; p < p4; p++) {
j = cindex[p]; // check node j dead or in Lk
var nvj = W[nv + j];
if (nvj <= 0) {
continue;
} // degree(i) += |j|
d += nvj; // place j in node list of i
cindex[pn++] = j; // compute hash for node i
h += j;
} // check for mass elimination
if (d === 0) {
// absorb i into k
cptr[i] = csFlip(k);
nvi = -W[nv + i]; // |Lk| -= |i|
dk -= nvi; // |k| += W[nv + i]
nvk += nvi;
nel += nvi;
W[nv + i] = 0; // node i is dead
W[elen + i] = -1;
} else {
// update degree(i)
W[degree + i] = Math.min(W[degree + i], d); // move first node to end
cindex[pn] = cindex[p3]; // move 1st el. to end of Ei
cindex[p3] = cindex[p1]; // add k as 1st element in of Ei
cindex[p1] = k; // new len of adj. list of node i
W[len + i] = pn - p1 + 1; // finalize hash of i
h = (h < 0 ? -h : h) % n; // place i in hash bucket
W[next + i] = W[hhead + h];
W[hhead + h] = i; // save hash of i in last[i]
last[i] = h;
}
} // finalize |Lk|
W[degree + k] = dk;
lemax = Math.max(lemax, dk); // clear w
mark = _wclear(mark + lemax, lemax, W, w, n); // Supernode detection. Supernode detection relies on the hash function h(i) computed for each node i.
// If two nodes have identical adjacency lists, their hash functions wil be identical.
for (pk = pk1; pk < pk2; pk++) {
i = cindex[pk]; // check i is dead, skip it
if (W[nv + i] >= 0) {
continue;
} // scan hash bucket of node i
h = last[i];
i = W[hhead + h]; // hash bucket will be empty
W[hhead + h] = -1;
for (; i !== -1 && W[next + i] !== -1; i = W[next + i], mark++) {
ln = W[len + i];
eln = W[elen + i];
for (p = cptr[i] + 1; p <= cptr[i] + ln - 1; p++) {
W[w + cindex[p]] = mark;
}
var jlast = i; // compare i with all j
for (j = W[next + i]; j !== -1;) {
var ok = W[len + j] === ln && W[elen + j] === eln;
for (p = cptr[j] + 1; ok && p <= cptr[j] + ln - 1; p++) {
// compare i and j
if (W[w + cindex[p]] !== mark) {
ok = 0;
}
} // check i and j are identical
if (ok) {
// absorb j into i
cptr[j] = csFlip(i);
W[nv + i] += W[nv + j];
W[nv + j] = 0; // node j is dead
W[elen + j] = -1; // delete j from hash bucket
j = W[next + j];
W[next + jlast] = j;
} else {
// j and i are different
jlast = j;
j = W[next + j];
}
}
}
} // Finalize new element. The elimination of node k is nearly complete. All nodes i in Lk are scanned one last time.
// Node i is removed from Lk if it is dead. The flagged status of nv[i] is cleared.
for (p = pk1, pk = pk1; pk < pk2; pk++) {
i = cindex[pk]; // check i is dead, skip it
if ((nvi = -W[nv + i]) <= 0) {
continue;
} // restore W[nv + i]
W[nv + i] = nvi; // compute external degree(i)
d = W[degree + i] + dk - nvi;
d = Math.min(d, n - nel - nvi);
if (W[head + d] !== -1) {
last[W[head + d]] = i;
} // put i back in degree list
W[next + i] = W[head + d];
last[i] = -1;
W[head + d] = i; // find new minimum degree
mindeg = Math.min(mindeg, d);
W[degree + i] = d; // place i in Lk
cindex[p++] = i;
} // # nodes absorbed into k
W[nv + k] = nvk; // length of adj list of element k
if ((W[len + k] = p - pk1) === 0) {
// k is a root of the tree
cptr[k] = -1; // k is now a dead element
W[w + k] = 0;
}
if (elenk !== 0) {
// free unused space in Lk
cnz = p;
}
} // Postordering. The elimination is complete, but no permutation has been computed. All that is left
// of the graph is the assembly tree (ptr) and a set of dead nodes and elements (i is a dead node if
// nv[i] is zero and a dead element if nv[i] > 0). It is from this information only that the final permutation
// is computed. The tree is restored by unflipping all of ptr.
// fix assembly tree
for (i = 0; i < n; i++) {
cptr[i] = csFlip(cptr[i]);
}
for (j = 0; j <= n; j++) {
W[head + j] = -1;
} // place unordered nodes in lists
for (j = n; j >= 0; j--) {
// skip if j is an element
if (W[nv + j] > 0) {
continue;
} // place j in list of its parent
W[next + j] = W[head + cptr[j]];
W[head + cptr[j]] = j;
} // place elements in lists
for (e = n; e >= 0; e--) {
// skip unless e is an element
if (W[nv + e] <= 0) {
continue;
}
if (cptr[e] !== -1) {
// place e in list of its parent
W[next + e] = W[head + cptr[e]];
W[head + cptr[e]] = e;
}
} // postorder the assembly tree
for (k = 0, i = 0; i <= n; i++) {
if (cptr[i] === -1) {
k = csTdfs(i, k, W, head, next, P, w);
}
} // remove last item in array
P.splice(P.length - 1, 1); // return P
return P;
};
/**
* Creates the matrix that will be used by the approximate minimum degree ordering algorithm. The function accepts the matrix M as input and returns a permutation
* vector P. The amd algorithm operates on a symmetrix matrix, so one of three symmetric matrices is formed.
*
* Order: 0
* A natural ordering P=null matrix is returned.
*
* Order: 1
* Matrix must be square. This is appropriate for a Cholesky or LU factorization.
* P = M + M'
*
* Order: 2
* Dense columns from M' are dropped, M recreated from M'. This is appropriatefor LU factorization of unsymmetric matrices.
* P = M' * M
*
* Order: 3
* This is best used for QR factorization or LU factorization is matrix M has no dense rows. A dense row is a row with more than 10*sqr(columns) entries.
* P = M' * M
*/
function _createTargetMatrix(order, a, m, n, dense) {
// compute A'
var at = transpose(a); // check order = 1, matrix must be square
if (order === 1 && n === m) {
// C = A + A'
return add(a, at);
} // check order = 2, drop dense columns from M'
if (order === 2) {
// transpose arrays
var tindex = at._index;
var tptr = at._ptr; // new column index
var p2 = 0; // loop A' columns (rows)
for (var j = 0; j < m; j++) {
// column j of AT starts here
var p = tptr[j]; // new column j starts here
tptr[j] = p2; // skip dense col j
if (tptr[j + 1] - p > dense) {
continue;
} // map rows in column j of A
for (var p1 = tptr[j + 1]; p < p1; p++) {
tindex[p2++] = tindex[p];
}
} // finalize AT
tptr[m] = p2; // recreate A from new transpose matrix
a = transpose(at); // use A' * A
return multiply(at, a);
} // use A' * A, square or rectangular matrix
return multiply(at, a);
}
/**
* Initialize quotient graph. There are four kind of nodes and elements that must be represented:
*
* - A live node is a node i (or a supernode) that has not been selected as a pivot nad has not been merged into another supernode.
* - A dead node i is one that has been removed from the graph, having been absorved into r = flip(ptr[i]).
* - A live element e is one that is in the graph, having been formed when node e was selected as the pivot.
* - A dead element e is one that has benn absorved into a subsequent element s = flip(ptr[e]).
*/
function _initializeQuotientGraph(n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree) {
// Initialize quotient graph
for (var k = 0; k < n; k++) {
W[len + k] = cptr[k + 1] - cptr[k];
}
W[len + n] = 0; // initialize workspace
for (var i = 0; i <= n; i++) {
// degree list i is empty
W[head + i] = -1;
last[i] = -1;
W[next + i] = -1; // hash list i is empty
W[hhead + i] = -1; // node i is just one node
W[nv + i] = 1; // node i is alive
W[w + i] = 1; // Ek of node i is empty
W[elen + i] = 0; // degree of node i
W[degree + i] = W[len + i];
} // clear w
var mark = _wclear(0, 0, W, w, n); // n is a dead element
W[elen + n] = -2; // n is a root of assembly tree
cptr[n] = -1; // n is a dead element
W[w + n] = 0; // return mark
return mark;
}
/**
* Initialize degree lists. Each node is placed in its degree lists. Nodes of zero degree are eliminated immediately. Nodes with
* degree >= dense are alsol eliminated and merged into a placeholder node n, a dead element. Thes nodes will appera last in the
* output permutation p.
*/
function _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next) {
// result
var nel = 0; // loop columns
for (var i = 0; i < n; i++) {
// degree @ i
var d = W[degree + i]; // check node i is empty
if (d === 0) {
// element i is dead
W[elen + i] = -2;
nel++; // i is a root of assembly tree
cptr[i] = -1;
W[w + i] = 0;
} else if (d > dense) {
// absorb i into element n
W[nv + i] = 0; // node i is dead
W[elen + i] = -1;
nel++;
cptr[i] = csFlip(n);
W[nv + n]++;
} else {
var h = W[head + d];
if (h !== -1) {
last[h] = i;
} // put node i in degree list d
W[next + i] = W[head + d];
W[head + d] = i;
}
}
return nel;
}
function _wclear(mark, lemax, W, w, n) {
if (mark < 2 || mark + lemax < 0) {
for (var k = 0; k < n; k++) {
if (W[w + k] !== 0) {
W[w + k] = 1;
}
}
mark = 2;
} // at this point, W [0..n-1] < mark holds
return mark;
}
function _diag(i, j) {
return i !== j;
}
});
// CONCATENATED MODULE: ./src/function/algebra/sparse/csLeaf.js
/**
* This function determines if j is a leaf of the ith row subtree.
* Consider A(i,j), node j in ith row subtree and return lca(jprev,j)
*
* @param {Number} i The ith row subtree
* @param {Number} j The node to test
* @param {Array} w The workspace array
* @param {Number} first The index offset within the workspace for the first array
* @param {Number} maxfirst The index offset within the workspace for the maxfirst array
* @param {Number} prevleaf The index offset within the workspace for the prevleaf array
* @param {Number} ancestor The index offset within the workspace for the ancestor array
*
* @return {Object}
*
* Reference: http://faculty.cse.tamu.edu/davis/publications.html
*/
function csLeaf(i, j, w, first, maxfirst, prevleaf, ancestor) {
var s, sparent; // our result
var jleaf = 0;
var q; // check j is a leaf
if (i <= j || w[first + j] <= w[maxfirst + i]) {
return -1;
} // update max first[j] seen so far
w[maxfirst + i] = w[first + j]; // jprev = previous leaf of ith subtree
var jprev = w[prevleaf + i];
w[prevleaf + i] = j; // check j is first or subsequent leaf
if (jprev === -1) {
// 1st leaf, q = root of ith subtree
jleaf = 1;
q = i;
} else {
// update jleaf
jleaf = 2; // q = least common ancester (jprev,j)
for (q = jprev; q !== w[ancestor + q]; q = w[ancestor + q]) {
;
}
for (s = jprev; s !== q; s = sparent) {
// path compression
sparent = w[ancestor + s];
w[ancestor + s] = q;
}
}
return {
jleaf: jleaf,
q: q
};
}
// CONCATENATED MODULE: ./src/function/algebra/sparse/csCounts.js
var csCounts_name = 'csCounts';
var csCounts_dependencies = ['transpose'];
var createCsCounts = /* #__PURE__ */Object(factory["a" /* factory */])(csCounts_name, csCounts_dependencies, function (_ref) {
var transpose = _ref.transpose;
/**
* Computes the column counts using the upper triangular part of A.
* It transposes A internally, none of the input parameters are modified.
*
* @param {Matrix} a The sparse matrix A
*
* @param {Matrix} ata Count the columns of A'A instead
*
* @return An array of size n of the column counts or null on error
*
* Reference: http://faculty.cse.tamu.edu/davis/publications.html
*/
return function (a, parent, post, ata) {
// check inputs
if (!a || !parent || !post) {
return null;
} // a matrix arrays
var asize = a._size; // rows and columns
var m = asize[0];
var n = asize[1]; // variables
var i, j, k, J, p, p0, p1; // workspace size
var s = 4 * n + (ata ? n + m + 1 : 0); // allocate workspace
var w = []; // (s)
var ancestor = 0; // first n entries
var maxfirst = n; // next n entries
var prevleaf = 2 * n; // next n entries
var first = 3 * n; // next n entries
var head = 4 * n; // next n + 1 entries (used when ata is true)
var next = 5 * n + 1; // last entries in workspace
// clear workspace w[0..s-1]
for (k = 0; k < s; k++) {
w[k] = -1;
} // allocate result
var colcount = []; // (n)
// AT = A'
var at = transpose(a); // at arrays
var tindex = at._index;
var tptr = at._ptr; // find w[first + j]
for (k = 0; k < n; k++) {
j = post[k]; // colcount[j]=1 if j is a leaf
colcount[j] = w[first + j] === -1 ? 1 : 0;
for (; j !== -1 && w[first + j] === -1; j = parent[j]) {
w[first + j] = k;
}
} // initialize ata if needed
if (ata) {
// invert post
for (k = 0; k < n; k++) {
w[post[k]] = k;
} // loop rows (columns in AT)
for (i = 0; i < m; i++) {
// values in column i of AT
for (k = n, p0 = tptr[i], p1 = tptr[i + 1], p = p0; p < p1; p++) {
k = Math.min(k, w[tindex[p]]);
} // place row i in linked list k
w[next + i] = w[head + k];
w[head + k] = i;
}
} // each node in its own set
for (i = 0; i < n; i++) {
w[ancestor + i] = i;
}
for (k = 0; k < n; k++) {
// j is the kth node in postordered etree
j = post[k]; // check j is not a root
if (parent[j] !== -1) {
colcount[parent[j]]--;
} // J=j for LL'=A case
for (J = ata ? w[head + k] : j; J !== -1; J = ata ? w[next + J] : -1) {
for (p = tptr[J]; p < tptr[J + 1]; p++) {
i = tindex[p];
var r = csLeaf(i, j, w, first, maxfirst, prevleaf, ancestor); // check A(i,j) is in skeleton
if (r.jleaf >= 1) {
colcount[j]++;
} // check account for overlap in q
if (r.jleaf === 2) {
colcount[r.q]--;
}
}
}
if (parent[j] !== -1) {
w[ancestor + j] = parent[j];
}
} // sum up colcount's of each child
for (j = 0; j < n; j++) {
if (parent[j] !== -1) {
colcount[parent[j]] += colcount[j];
}
}
return colcount;
};
});
// CONCATENATED MODULE: ./src/function/algebra/sparse/csSqr.js
var csSqr_name = 'csSqr';
var csSqr_dependencies = ['add', 'multiply', 'transpose'];
var createCsSqr = /* #__PURE__ */Object(factory["a" /* factory */])(csSqr_name, csSqr_dependencies, function (_ref) {
var add = _ref.add,
multiply = _ref.multiply,
transpose = _ref.transpose;
var csAmd = createCsAmd({
add: add,
multiply: multiply,
transpose: transpose
});
var csCounts = createCsCounts({
transpose: transpose
});
/**
* Symbolic ordering and analysis for QR and LU decompositions.
*
* @param {Number} order The ordering strategy (see csAmd for more details)
* @param {Matrix} a The A matrix
* @param {boolean} qr Symbolic ordering and analysis for QR decomposition (true) or
* symbolic ordering and analysis for LU decomposition (false)
*
* @return {Object} The Symbolic ordering and analysis for matrix A
*
* Reference: http://faculty.cse.tamu.edu/davis/publications.html
*/
return function csSqr(order, a, qr) {
// a arrays
var aptr = a._ptr;
var asize = a._size; // columns
var n = asize[1]; // vars
var k; // symbolic analysis result
var s = {}; // fill-reducing ordering
s.q = csAmd(order, a); // validate results
if (order && !s.q) {
return null;
} // QR symbolic analysis
if (qr) {
// apply permutations if needed
var c = order ? csPermute(a, null, s.q, 0) : a; // etree of C'*C, where C=A(:,q)
s.parent = csEtree(c, 1); // post order elimination tree
var post = csPost(s.parent, n); // col counts chol(C'*C)
s.cp = csCounts(c, s.parent, post, 1); // check we have everything needed to calculate number of nonzero elements
if (c && s.parent && s.cp && _vcount(c, s)) {
// calculate number of nonzero elements
for (s.unz = 0, k = 0; k < n; k++) {
s.unz += s.cp[k];
}
}
} else {
// for LU factorization only, guess nnz(L) and nnz(U)
s.unz = 4 * aptr[n] + n;
s.lnz = s.unz;
} // return result S
return s;
};
/**
* Compute nnz(V) = s.lnz, s.pinv, s.leftmost, s.m2 from A and s.parent
*/
function _vcount(a, s) {
// a arrays
var aptr = a._ptr;
var aindex = a._index;
var asize = a._size; // rows & columns
var m = asize[0];
var n = asize[1]; // initialize s arrays
s.pinv = []; // (m + n)
s.leftmost = []; // (m)
// vars
var parent = s.parent;
var pinv = s.pinv;
var leftmost = s.leftmost; // workspace, next: first m entries, head: next n entries, tail: next n entries, nque: next n entries
var w = []; // (m + 3 * n)
var next = 0;
var head = m;
var tail = m + n;
var nque = m + 2 * n; // vars
var i, k, p, p0, p1; // initialize w
for (k = 0; k < n; k++) {
// queue k is empty
w[head + k] = -1;
w[tail + k] = -1;
w[nque + k] = 0;
} // initialize row arrays
for (i = 0; i < m; i++) {
leftmost[i] = -1;
} // loop columns backwards
for (k = n - 1; k >= 0; k--) {
// values & index for column k
for (p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {
// leftmost[i] = min(find(A(i,:)))
leftmost[aindex[p]] = k;
}
} // scan rows in reverse order
for (i = m - 1; i >= 0; i--) {
// row i is not yet ordered
pinv[i] = -1;
k = leftmost[i]; // check row i is empty
if (k === -1) {
continue;
} // first row in queue k
if (w[nque + k]++ === 0) {
w[tail + k] = i;
} // put i at head of queue k
w[next + i] = w[head + k];
w[head + k] = i;
}
s.lnz = 0;
s.m2 = m; // find row permutation and nnz(V)
for (k = 0; k < n; k++) {
// remove row i from queue k
i = w[head + k]; // count V(k,k) as nonzero
s.lnz++; // add a fictitious row
if (i < 0) {
i = s.m2++;
} // associate row i with V(:,k)
pinv[i] = k; // skip if V(k+1:m,k) is empty
if (--nque[k] <= 0) {
continue;
} // nque[k] is nnz (V(k+1:m,k))
s.lnz += w[nque + k]; // move all rows to parent of k
var pa = parent[k];
if (pa !== -1) {
if (w[nque + pa] === 0) {
w[tail + pa] = w[tail + k];
}
w[next + w[tail + k]] = w[head + pa];
w[head + pa] = w[next + i];
w[nque + pa] += w[nque + k];
}
}
for (i = 0; i < m; i++) {
if (pinv[i] < 0) {
pinv[i] = k++;
}
}
return true;
}
});
// CONCATENATED MODULE: ./src/function/algebra/sparse/csMarked.js
/**
* Checks if the node at w[j] is marked
*
* @param {Array} w The array
* @param {Number} j The array index
*
* Reference: http://faculty.cse.tamu.edu/davis/publications.html
*/
function csMarked(w, j) {
// check node is marked
return w[j] < 0;
}
// CONCATENATED MODULE: ./src/function/algebra/sparse/csMark.js
/**
* Marks the node at w[j]
*
* @param {Array} w The array
* @param {Number} j The array index
*
* Reference: http://faculty.cse.tamu.edu/davis/publications.html
*/
function csMark(w, j) {
// mark w[j]
w[j] = csFlip(w[j]);
}
// CONCATENATED MODULE: ./src/function/algebra/sparse/csUnflip.js
/**
* Flips the value if it is negative of returns the same value otherwise.
*
* @param {Number} i The value to flip
*
* Reference: http://faculty.cse.tamu.edu/davis/publications.html
*/
function csUnflip(i) {
// flip the value if it is negative
return i < 0 ? csFlip(i) : i;
}
// CONCATENATED MODULE: ./src/function/algebra/sparse/csDfs.js
/**
* Depth-first search computes the nonzero pattern xi of the directed graph G (Matrix) starting
* at nodes in B (see csReach()).
*
* @param {Number} j The starting node for the DFS algorithm
* @param {Matrix} g The G matrix to search, ptr array modified, then restored
* @param {Number} top Start index in stack xi[top..n-1]
* @param {Number} k The kth column in B
* @param {Array} xi The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n
* The first n entries is the nonzero pattern, the last n entries is the stack
* @param {Array} pinv The inverse row permutation vector, must be null for L * x = b
*
* @return {Number} New value of top
*
* Reference: http://faculty.cse.tamu.edu/davis/publications.html
*/
function csDfs(j, g, top, xi, pinv) {
// g arrays
var index = g._index;
var ptr = g._ptr;
var size = g._size; // columns
var n = size[1]; // vars
var i, p, p2; // initialize head
var head = 0; // initialize the recursion stack
xi[0] = j; // loop
while (head >= 0) {
// get j from the top of the recursion stack
j = xi[head]; // apply permutation vector
var jnew = pinv ? pinv[j] : j; // check node j is marked
if (!csMarked(ptr, j)) {
// mark node j as visited
csMark(ptr, j); // update stack (last n entries in xi)
xi[n + head] = jnew < 0 ? 0 : csUnflip(ptr[jnew]);
} // node j done if no unvisited neighbors
var done = 1; // examine all neighbors of j, stack (last n entries in xi)
for (p = xi[n + head], p2 = jnew < 0 ? 0 : csUnflip(ptr[jnew + 1]); p < p2; p++) {
// consider neighbor node i
i = index[p]; // check we have visited node i, skip it
if (csMarked(ptr, i)) {
continue;
} // pause depth-first search of node j, update stack (last n entries in xi)
xi[n + head] = p; // start dfs at node i
xi[++head] = i; // node j is not done
done = 0; // break, to start dfs(i)
break;
} // check depth-first search at node j is done
if (done) {
// remove j from the recursion stack
head--; // and place in the output stack
xi[--top] = j;
}
}
return top;
}
// CONCATENATED MODULE: ./src/function/algebra/sparse/csReach.js
/**
* The csReach function computes X = Reach(B), where B is the nonzero pattern of the n-by-1
* sparse column of vector b. The function returns the set of nodes reachable from any node in B. The
* nonzero pattern xi of the solution x to the sparse linear system Lx=b is given by X=Reach(B).
*
* @param {Matrix} g The G matrix
* @param {Matrix} b The B matrix
* @param {Number} k The kth column in B
* @param {Array} xi The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n
* The first n entries is the nonzero pattern, the last n entries is the stack
* @param {Array} pinv The inverse row permutation vector
*
* @return {Number} The index for the nonzero pattern
*
* Reference: http://faculty.cse.tamu.edu/davis/publications.html
*/
function csReach(g, b, k, xi, pinv) {
// g arrays
var gptr = g._ptr;
var gsize = g._size; // b arrays
var bindex = b._index;
var bptr = b._ptr; // columns
var n = gsize[1]; // vars
var p, p0, p1; // initialize top
var top = n; // loop column indeces in B
for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) {
// node i
var i = bindex[p]; // check node i is marked
if (!csMarked(gptr, i)) {
// start a dfs at unmarked node i
top = csDfs(i, g, top, xi, pinv);
}
} // loop columns from top -> n - 1
for (p = top; p < n; p++) {
// restore G
csMark(gptr, xi[p]);
}
return top;
}
// CONCATENATED MODULE: ./src/function/algebra/sparse/csSpsolve.js
var csSpsolve_name = 'csSpsolve';
var csSpsolve_dependencies = ['divideScalar', 'multiply', 'subtract'];
var createCsSpsolve = /* #__PURE__ */Object(factory["a" /* factory */])(csSpsolve_name, csSpsolve_dependencies, function (_ref) {
var divideScalar = _ref.divideScalar,
multiply = _ref.multiply,
subtract = _ref.subtract;
/**
* The function csSpsolve() computes the solution to G * x = bk, where bk is the
* kth column of B. When lo is true, the function assumes G = L is lower triangular with the
* diagonal entry as the first entry in each column. When lo is true, the function assumes G = U
* is upper triangular with the diagonal entry as the last entry in each column.
*
* @param {Matrix} g The G matrix
* @param {Matrix} b The B matrix
* @param {Number} k The kth column in B
* @param {Array} xi The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n
* The first n entries is the nonzero pattern, the last n entries is the stack
* @param {Array} x The soluton to the linear system G * x = b
* @param {Array} pinv The inverse row permutation vector, must be null for L * x = b
* @param {boolean} lo The lower (true) upper triangular (false) flag
*
* @return {Number} The index for the nonzero pattern
*
* Reference: http://faculty.cse.tamu.edu/davis/publications.html
*/
return function csSpsolve(g, b, k, xi, x, pinv, lo) {
// g arrays
var gvalues = g._values;
var gindex = g._index;
var gptr = g._ptr;
var gsize = g._size; // columns
var n = gsize[1]; // b arrays
var bvalues = b._values;
var bindex = b._index;
var bptr = b._ptr; // vars
var p, p0, p1, q; // xi[top..n-1] = csReach(B(:,k))
var top = csReach(g, b, k, xi, pinv); // clear x
for (p = top; p < n; p++) {
x[xi[p]] = 0;
} // scatter b
for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) {
x[bindex[p]] = bvalues[p];
} // loop columns
for (var px = top; px < n; px++) {
// x array index for px
var j = xi[px]; // apply permutation vector (U x = b), j maps to column J of G
var J = pinv ? pinv[j] : j; // check column J is empty
if (J < 0) {
continue;
} // column value indeces in G, p0 <= p < p1
p0 = gptr[J];
p1 = gptr[J + 1]; // x(j) /= G(j,j)
x[j] = divideScalar(x[j], gvalues[lo ? p0 : p1 - 1]); // first entry L(j,j)
p = lo ? p0 + 1 : p0;
q = lo ? p1 : p1 - 1; // loop
for (; p < q; p++) {
// row
var i = gindex[p]; // x(i) -= G(i,j) * x(j)
x[i] = subtract(x[i], multiply(gvalues[p], x[j]));
}
} // return top of stack
return top;
};
});
// CONCATENATED MODULE: ./src/function/algebra/sparse/csLu.js
var csLu_name = 'csLu';
var csLu_dependencies = ['abs', 'divideScalar', 'multiply', 'subtract', 'larger', 'largerEq', 'SparseMatrix'];
var createCsLu = /* #__PURE__ */Object(factory["a" /* factory */])(csLu_name, csLu_dependencies, function (_ref) {
var abs = _ref.abs,
divideScalar = _ref.divideScalar,
multiply = _ref.multiply,
subtract = _ref.subtract,
larger = _ref.larger,
largerEq = _ref.largerEq,
SparseMatrix = _ref.SparseMatrix;
var csSpsolve = createCsSpsolve({
divideScalar: divideScalar,
multiply: multiply,
subtract: subtract
});
/**
* Computes the numeric LU factorization of the sparse matrix A. Implements a Left-looking LU factorization
* algorithm that computes L and U one column at a tume. At the kth step, it access columns 1 to k-1 of L
* and column k of A. Given the fill-reducing column ordering q (see parameter s) computes L, U and pinv so
* L * U = A(p, q), where p is the inverse of pinv.
*
* @param {Matrix} m The A Matrix to factorize
* @param {Object} s The symbolic analysis from csSqr(). Provides the fill-reducing
* column ordering q
* @param {Number} tol Partial pivoting threshold (1 for partial pivoting)
*
* @return {Number} The numeric LU factorization of A or null
*
* Reference: http://faculty.cse.tamu.edu/davis/publications.html
*/
return function csLu(m, s, tol) {
// validate input
if (!m) {
return null;
} // m arrays
var size = m._size; // columns
var n = size[1]; // symbolic analysis result
var q;
var lnz = 100;
var unz = 100; // update symbolic analysis parameters
if (s) {
q = s.q;
lnz = s.lnz || lnz;
unz = s.unz || unz;
} // L arrays
var lvalues = []; // (lnz)
var lindex = []; // (lnz)
var lptr = []; // (n + 1)
// L
var L = new SparseMatrix({
values: lvalues,
index: lindex,
ptr: lptr,
size: [n, n]
}); // U arrays
var uvalues = []; // (unz)
var uindex = []; // (unz)
var uptr = []; // (n + 1)
// U
var U = new SparseMatrix({
values: uvalues,
index: uindex,
ptr: uptr,
size: [n, n]
}); // inverse of permutation vector
var pinv = []; // (n)
// vars
var i, p; // allocate arrays
var x = []; // (n)
var xi = []; // (2 * n)
// initialize variables
for (i = 0; i < n; i++) {
// clear workspace
x[i] = 0; // no rows pivotal yet
pinv[i] = -1; // no cols of L yet
lptr[i + 1] = 0;
} // reset number of nonzero elements in L and U
lnz = 0;
unz = 0; // compute L(:,k) and U(:,k)
for (var k = 0; k < n; k++) {
// update ptr
lptr[k] = lnz;
uptr[k] = unz; // apply column permutations if needed
var col = q ? q[k] : k; // solve triangular system, x = L\A(:,col)
var top = csSpsolve(L, m, col, xi, x, pinv, 1); // find pivot
var ipiv = -1;
var a = -1; // loop xi[] from top -> n
for (p = top; p < n; p++) {
// x[i] is nonzero
i = xi[p]; // check row i is not yet pivotal
if (pinv[i] < 0) {
// absolute value of x[i]
var xabs = abs(x[i]); // check absoulte value is greater than pivot value
if (larger(xabs, a)) {
// largest pivot candidate so far
a = xabs;
ipiv = i;
}
} else {
// x(i) is the entry U(pinv[i],k)
uindex[unz] = pinv[i];
uvalues[unz++] = x[i];
}
} // validate we found a valid pivot
if (ipiv === -1 || a <= 0) {
return null;
} // update actual pivot column, give preference to diagonal value
if (pinv[col] < 0 && largerEq(abs(x[col]), multiply(a, tol))) {
ipiv = col;
} // the chosen pivot
var pivot = x[ipiv]; // last entry in U(:,k) is U(k,k)
uindex[unz] = k;
uvalues[unz++] = pivot; // ipiv is the kth pivot row
pinv[ipiv] = k; // first entry in L(:,k) is L(k,k) = 1
lindex[lnz] = ipiv;
lvalues[lnz++] = 1; // L(k+1:n,k) = x / pivot
for (p = top; p < n; p++) {
// row
i = xi[p]; // check x(i) is an entry in L(:,k)
if (pinv[i] < 0) {
// save unpermuted row in L
lindex[lnz] = i; // scale pivot column
lvalues[lnz++] = divideScalar(x[i], pivot);
} // x[0..n-1] = 0 for next k
x[i] = 0;
}
} // update ptr
lptr[n] = lnz;
uptr[n] = unz; // fix row indices of L for final pinv
for (p = 0; p < lnz; p++) {
lindex[p] = pinv[lindex[p]];
} // trim arrays
lvalues.splice(lnz, lvalues.length - lnz);
lindex.splice(lnz, lindex.length - lnz);
uvalues.splice(unz, uvalues.length - unz);
uindex.splice(unz, uindex.length - unz); // return LU factor
return {
L: L,
U: U,
pinv: pinv
};
};
});
// CONCATENATED MODULE: ./src/function/algebra/decomposition/slu.js
var slu_name = 'slu';
var slu_dependencies = ['typed', 'abs', 'add', 'multiply', 'transpose', 'divideScalar', 'subtract', 'larger', 'largerEq', 'SparseMatrix'];
var createSlu = /* #__PURE__ */Object(factory["a" /* factory */])(slu_name, slu_dependencies, function (_ref) {
var typed = _ref.typed,
abs = _ref.abs,
add = _ref.add,
multiply = _ref.multiply,
transpose = _ref.transpose,
divideScalar = _ref.divideScalar,
subtract = _ref.subtract,
larger = _ref.larger,
largerEq = _ref.largerEq,
SparseMatrix = _ref.SparseMatrix;
var csSqr = createCsSqr({
add: add,
multiply: multiply,
transpose: transpose
});
var csLu = createCsLu({
abs: abs,
divideScalar: divideScalar,
multiply: multiply,
subtract: subtract,
larger: larger,
largerEq: largerEq,
SparseMatrix: SparseMatrix
});
/**
* Calculate the Sparse Matrix LU decomposition with full pivoting. Sparse Matrix `A` is decomposed in two matrices (`L`, `U`) and two permutation vectors (`pinv`, `q`) where
*
* `P * A * Q = L * U`
*
* Syntax:
*
* math.slu(A, order, threshold)
*
* Examples:
*
* const A = math.sparse([[4,3], [6, 3]])
* math.slu(A, 1, 0.001)
* // returns:
* // {
* // L: [[1, 0], [1.5, 1]]
* // U: [[4, 3], [0, -1.5]]
* // p: [0, 1]
* // q: [0, 1]
* // }
*
* See also:
*
* lup, lsolve, usolve, lusolve
*
* @param {SparseMatrix} A A two dimensional sparse matrix for which to get the LU decomposition.
* @param {Number} order The Symbolic Ordering and Analysis order:
* 0 - Natural ordering, no permutation vector q is returned
* 1 - Matrix must be square, symbolic ordering and analisis is performed on M = A + A'
* 2 - Symbolic ordering and analisis is performed on M = A' * A. Dense columns from A' are dropped, A recreated from A'.
* This is appropriatefor LU factorization of unsymmetric matrices.
* 3 - Symbolic ordering and analisis is performed on M = A' * A. This is best used for LU factorization is matrix M has no dense rows.
* A dense row is a row with more than 10*sqr(columns) entries.
* @param {Number} threshold Partial pivoting threshold (1 for partial pivoting)
*
* @return {Object} The lower triangular matrix, the upper triangular matrix and the permutation vectors.
*/
return typed(slu_name, {
'SparseMatrix, number, number': function SparseMatrixNumberNumber(a, order, threshold) {
// verify order
if (!Object(utils_number["i" /* isInteger */])(order) || order < 0 || order > 3) {
throw new Error('Symbolic Ordering and Analysis order must be an integer number in the interval [0, 3]');
} // verify threshold
if (threshold < 0 || threshold > 1) {
throw new Error('Partial pivoting threshold must be a number from 0 to 1');
} // perform symbolic ordering and analysis
var s = csSqr(order, a, false); // perform lu decomposition
var f = csLu(a, s, threshold); // return decomposition
return {
L: f.L,
U: f.U,
p: f.pinv,
q: s.q,
toString: function toString() {
return 'L: ' + this.L.toString() + '\nU: ' + this.U.toString() + '\np: ' + this.p.toString() + (this.q ? '\nq: ' + this.q.toString() : '') + '\n';
}
};
}
});
});
// CONCATENATED MODULE: ./src/function/algebra/sparse/csIpvec.js
/**
* Permutes a vector; x = P'b. In MATLAB notation, x(p)=b.
*
* @param {Array} p The permutation vector of length n. null value denotes identity
* @param {Array} b The input vector
*
* @return {Array} The output vector x = P'b
*/
function csIpvec(p, b) {
// vars
var k;
var n = b.length;
var x = []; // check permutation vector was provided, p = null denotes identity
if (p) {
// loop vector
for (k = 0; k < n; k++) {
// apply permutation
x[p[k]] = b[k];
}
} else {
// loop vector
for (k = 0; k < n; k++) {
// x[i] = b[i]
x[k] = b[k];
}
}
return x;
}
// CONCATENATED MODULE: ./src/function/algebra/solver/lusolve.js
var lusolve_name = 'lusolve';
var lusolve_dependencies = ['typed', 'matrix', 'lup', 'slu', 'usolve', 'lsolve', 'DenseMatrix'];
var createLusolve = /* #__PURE__ */Object(factory["a" /* factory */])(lusolve_name, lusolve_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
lup = _ref.lup,
slu = _ref.slu,
usolve = _ref.usolve,
lsolve = _ref.lsolve,
DenseMatrix = _ref.DenseMatrix;
var solveValidation = createSolveValidation({
DenseMatrix: DenseMatrix
});
/**
* Solves the linear system `A * x = b` where `A` is an [n x n] matrix and `b` is a [n] column vector.
*
* Syntax:
*
* math.lusolve(A, b) // returns column vector with the solution to the linear system A * x = b
* math.lusolve(lup, b) // returns column vector with the solution to the linear system A * x = b, lup = math.lup(A)
*
* Examples:
*
* const m = [[1, 0, 0, 0], [0, 2, 0, 0], [0, 0, 3, 0], [0, 0, 0, 4]]
*
* const x = math.lusolve(m, [-1, -1, -1, -1]) // x = [[-1], [-0.5], [-1/3], [-0.25]]
*
* const f = math.lup(m)
* const x1 = math.lusolve(f, [-1, -1, -1, -1]) // x1 = [[-1], [-0.5], [-1/3], [-0.25]]
* const x2 = math.lusolve(f, [1, 2, 1, -1]) // x2 = [[1], [1], [1/3], [-0.25]]
*
* const a = [[-2, 3], [2, 1]]
* const b = [11, 9]
* const x = math.lusolve(a, b) // [[2], [5]]
*
* See also:
*
* lup, slu, lsolve, usolve
*
* @param {Matrix | Array | Object} A Invertible Matrix or the Matrix LU decomposition
* @param {Matrix | Array} b Column Vector
* @param {number} [order] The Symbolic Ordering and Analysis order, see slu for details. Matrix must be a SparseMatrix
* @param {Number} [threshold] Partial pivoting threshold (1 for partial pivoting), see slu for details. Matrix must be a SparseMatrix.
*
* @return {DenseMatrix | Array} Column vector with the solution to the linear system A * x = b
*/
return typed(lusolve_name, {
'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {
// convert a to matrix
a = matrix(a); // matrix lup decomposition
var d = lup(a); // solve
var x = _lusolve(d.L, d.U, d.p, null, b); // convert result to array
return x.valueOf();
},
'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(a, b) {
// matrix lup decomposition
var d = lup(a); // solve
return _lusolve(d.L, d.U, d.p, null, b);
},
'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(a, b) {
// matrix lup decomposition
var d = lup(a); // solve
return _lusolve(d.L, d.U, d.p, null, b);
},
'SparseMatrix, Array | Matrix, number, number': function SparseMatrixArrayMatrixNumberNumber(a, b, order, threshold) {
// matrix lu decomposition
var d = slu(a, order, threshold); // solve
return _lusolve(d.L, d.U, d.p, d.q, b);
},
'Object, Array | Matrix': function ObjectArrayMatrix(d, b) {
// solve
return _lusolve(d.L, d.U, d.p, d.q, b);
}
});
function _toMatrix(a) {
// check it is a matrix
if (Object(is["v" /* isMatrix */])(a)) {
return a;
} // check array
if (Object(is["b" /* isArray */])(a)) {
return matrix(a);
} // throw
throw new TypeError('Invalid Matrix LU decomposition');
}
function _lusolve(l, u, p, q, b) {
// verify L, U, P
l = _toMatrix(l);
u = _toMatrix(u); // validate matrix and vector
b = solveValidation(l, b, false); // apply row permutations if needed (b is a DenseMatrix)
if (p) {
b._data = csIpvec(p, b._data);
} // use forward substitution to resolve L * y = b
var y = lsolve(l, b); // use backward substitution to resolve U * x = y
var x = usolve(u, y); // apply column permutations if needed (x is a DenseMatrix)
if (q) {
x._data = csIpvec(q, x._data);
} // return solution
return x;
}
});
// CONCATENATED MODULE: ./src/expression/Help.js
var Help_name = 'Help';
var Help_dependencies = ['parse'];
var createHelpClass = /* #__PURE__ */Object(factory["a" /* factory */])(Help_name, Help_dependencies, function (_ref) {
var parse = _ref.parse;
/**
* Documentation object
* @param {Object} doc Object containing properties:
* {string} name
* {string} category
* {string} description
* {string[]} syntax
* {string[]} examples
* {string[]} seealso
* @constructor
*/
function Help(doc) {
if (!(this instanceof Help)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
if (!doc) throw new Error('Argument "doc" missing');
this.doc = doc;
}
/**
* Attach type information
*/
Help.prototype.type = 'Help';
Help.prototype.isHelp = true;
/**
* Generate a string representation of the Help object
* @return {string} Returns a string
* @private
*/
Help.prototype.toString = function () {
var doc = this.doc || {};
var desc = '\n';
if (doc.name) {
desc += 'Name: ' + doc.name + '\n\n';
}
if (doc.category) {
desc += 'Category: ' + doc.category + '\n\n';
}
if (doc.description) {
desc += 'Description:\n ' + doc.description + '\n\n';
}
if (doc.syntax) {
desc += 'Syntax:\n ' + doc.syntax.join('\n ') + '\n\n';
}
if (doc.examples) {
desc += 'Examples:\n';
var scope = {};
for (var i = 0; i < doc.examples.length; i++) {
var expr = doc.examples[i];
desc += ' ' + expr + '\n';
var res = void 0;
try {
// note: res can be undefined when `expr` is an empty string
res = parse(expr).compile().evaluate(scope);
} catch (e) {
res = e;
}
if (res !== undefined && !Object(is["s" /* isHelp */])(res)) {
desc += ' ' + Object(utils_string["d" /* format */])(res, {
precision: 14
}) + '\n';
}
}
desc += '\n';
}
if (doc.seealso && doc.seealso.length) {
desc += 'See also: ' + doc.seealso.join(', ') + '\n';
}
return desc;
};
/**
* Export the help object to JSON
*/
Help.prototype.toJSON = function () {
var obj = Object(utils_object["a" /* clone */])(this.doc);
obj.mathjs = 'Help';
return obj;
};
/**
* Instantiate a Help object from a JSON object
* @param {Object} json
* @returns {Help} Returns a new Help object
*/
Help.fromJSON = function (json) {
var doc = {};
Object.keys(json).filter(function (prop) {
return prop !== 'mathjs';
}).forEach(function (prop) {
doc[prop] = json[prop];
});
return new Help(doc);
};
/**
* Returns a string representation of the Help object
*/
Help.prototype.valueOf = Help.prototype.toString;
return Help;
}, {
isClass: true
});
// CONCATENATED MODULE: ./src/type/chain/Chain.js
var Chain_name = 'Chain';
var Chain_dependencies = ['?on', 'math'];
var createChainClass = /* #__PURE__ */Object(factory["a" /* factory */])(Chain_name, Chain_dependencies, function (_ref) {
var on = _ref.on,
math = _ref.math;
/**
* @constructor Chain
* Wrap any value in a chain, allowing to perform chained operations on
* the value.
*
* All methods available in the math.js library can be called upon the chain,
* and then will be evaluated with the value itself as first argument.
* The chain can be closed by executing chain.done(), which will return
* the final value.
*
* The Chain has a number of special functions:
* - done() Finalize the chained operation and return the
* chain's value.
* - valueOf() The same as done()
* - toString() Returns a string representation of the chain's value.
*
* @param {*} [value]
*/
function Chain(value) {
if (!(this instanceof Chain)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
if (Object(is["h" /* isChain */])(value)) {
this.value = value.value;
} else {
this.value = value;
}
}
/**
* Attach type information
*/
Chain.prototype.type = 'Chain';
Chain.prototype.isChain = true;
/**
* Close the chain. Returns the final value.
* Does the same as method valueOf()
* @returns {*} value
*/
Chain.prototype.done = function () {
return this.value;
};
/**
* Close the chain. Returns the final value.
* Does the same as method done()
* @returns {*} value
*/
Chain.prototype.valueOf = function () {
return this.value;
};
/**
* Get a string representation of the value in the chain
* @returns {string}
*/
Chain.prototype.toString = function () {
return Object(utils_string["d" /* format */])(this.value);
};
/**
* Get a JSON representation of the chain
* @returns {Object}
*/
Chain.prototype.toJSON = function () {
return {
mathjs: 'Chain',
value: this.value
};
};
/**
* Instantiate a Chain from its JSON representation
* @param {Object} json An object structured like
* `{"mathjs": "Chain", value: ...}`,
* where mathjs is optional
* @returns {Chain}
*/
Chain.fromJSON = function (json) {
return new Chain(json.value);
};
/**
* Create a proxy method for the chain
* @param {string} name
* @param {Function} fn The function to be proxied
* If fn is no function, it is silently ignored.
* @private
*/
function createProxy(name, fn) {
if (typeof fn === 'function') {
Chain.prototype[name] = chainify(fn);
}
}
/**
* Create a proxy method for the chain
* @param {string} name
* @param {function} resolver The function resolving with the
* function to be proxied
* @private
*/
function createLazyProxy(name, resolver) {
Object(utils_object["h" /* lazy */])(Chain.prototype, name, function outerResolver() {
var fn = resolver();
if (typeof fn === 'function') {
return chainify(fn);
}
return undefined; // if not a function, ignore
});
}
/**
* Make a function chainable
* @param {function} fn
* @return {Function} chain function
* @private
*/
function chainify(fn) {
return function () {
var args = [this.value]; // `this` will be the context of a Chain instance
for (var i = 0; i < arguments.length; i++) {
args[i + 1] = arguments[i];
}
return new Chain(fn.apply(fn, args));
};
}
/**
* Create a proxy for a single method, or an object with multiple methods.
* Example usage:
*
* Chain.createProxy('add', function add (x, y) {...})
* Chain.createProxy({
* add: function add (x, y) {...},
* subtract: function subtract (x, y) {...}
* }
*
* @param {string | Object} arg0 A name (string), or an object with
* functions
* @param {*} [arg1] A function, when arg0 is a name
*/
Chain.createProxy = function (arg0, arg1) {
if (typeof arg0 === 'string') {
// createProxy(name, value)
createProxy(arg0, arg1);
} else {
var _loop = function _loop(_name) {
if (Object(utils_object["f" /* hasOwnProperty */])(arg0, _name) && excludedNames[_name] === undefined) {
createLazyProxy(_name, function () {
return arg0[_name];
});
}
};
// createProxy(values)
for (var _name in arg0) {
_loop(_name);
}
}
};
var excludedNames = {
expression: true,
docs: true,
type: true,
classes: true,
json: true,
error: true,
isChain: true // conflicts with the property isChain of a Chain instance
}; // create proxy for everything that is in math.js
Chain.createProxy(math); // register on the import event, automatically add a proxy for every imported function.
if (on) {
on('import', function (name, resolver, path) {
if (!path) {
// an imported function (not a data type or something special)
createLazyProxy(name, resolver);
}
});
}
return Chain;
}, {
isClass: true
});
// CONCATENATED MODULE: ./src/expression/embeddedDocs/construction/bignumber.js
var bignumberDocs = {
name: 'bignumber',
category: 'Construction',
syntax: ['bignumber(x)'],
description: 'Create a big number from a number or string.',
examples: ['0.1 + 0.2', 'bignumber(0.1) + bignumber(0.2)', 'bignumber("7.2")', 'bignumber("7.2e500")', 'bignumber([0.1, 0.2, 0.3])'],
seealso: ['boolean', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/utils/typeOf.js
var typeOfDocs = {
name: 'typeOf',
category: 'Utils',
syntax: ['typeOf(x)'],
description: 'Get the type of a variable.',
examples: ['typeOf(3.5)', 'typeOf(2 - 4i)', 'typeOf(45 deg)', 'typeOf("hello world")'],
seealso: ['getMatrixDataType']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/utils/isZero.js
var isZeroDocs = {
name: 'isZero',
category: 'Utils',
syntax: ['isZero(x)'],
description: 'Test whether a value is zero.',
examples: ['isZero(2)', 'isZero(0)', 'isZero(-4)', 'isZero([3, 0, -2, 0])'],
seealso: ['isInteger', 'isNumeric', 'isNegative', 'isPositive']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/utils/isPrime.js
var isPrimeDocs = {
name: 'isPrime',
category: 'Utils',
syntax: ['isPrime(x)'],
description: 'Test whether a value is prime: has no divisors other than itself and one.',
examples: ['isPrime(3)', 'isPrime(-2)', 'isPrime([2, 17, 100])'],
seealso: ['isInteger', 'isNumeric', 'isNegative', 'isZero']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/utils/isPositive.js
var isPositiveDocs = {
name: 'isPositive',
category: 'Utils',
syntax: ['isPositive(x)'],
description: 'Test whether a value is positive: larger than zero.',
examples: ['isPositive(2)', 'isPositive(0)', 'isPositive(-4)', 'isPositive([3, 0.5, -2])'],
seealso: ['isInteger', 'isNumeric', 'isNegative', 'isZero']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/utils/isNumeric.js
var isNumericDocs = {
name: 'isNumeric',
category: 'Utils',
syntax: ['isNumeric(x)'],
description: 'Test whether a value is a numeric value. ' + 'Returns true when the input is a number, BigNumber, Fraction, or boolean.',
examples: ['isNumeric(2)', 'isNumeric("2")', 'hasNumericValue("2")', 'isNumeric(0)', 'isNumeric(bignumber(500))', 'isNumeric(fraction(0.125))', 'isNumeric(2 + 3i)', 'isNumeric([2.3, "foo", false])'],
seealso: ['isInteger', 'isZero', 'isNegative', 'isPositive', 'isNaN', 'hasNumericValue']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/utils/hasNumericValue.js
var hasNumericValueDocs = {
name: 'hasNumericValue',
category: 'Utils',
syntax: ['hasNumericValue(x)'],
description: 'Test whether a value is an numeric value. ' + 'In case of a string, true is returned if the string contains a numeric value.',
examples: ['hasNumericValue(2)', 'hasNumericValue("2")', 'isNumeric("2")', 'hasNumericValue(0)', 'hasNumericValue(bignumber(500))', 'hasNumericValue(fraction(0.125))', 'hasNumericValue(2 + 3i)', 'hasNumericValue([2.3, "foo", false])'],
seealso: ['isInteger', 'isZero', 'isNegative', 'isPositive', 'isNaN', 'isNumeric']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/utils/isNegative.js
var isNegativeDocs = {
name: 'isNegative',
category: 'Utils',
syntax: ['isNegative(x)'],
description: 'Test whether a value is negative: smaller than zero.',
examples: ['isNegative(2)', 'isNegative(0)', 'isNegative(-4)', 'isNegative([3, 0.5, -2])'],
seealso: ['isInteger', 'isNumeric', 'isPositive', 'isZero']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/utils/isInteger.js
var isIntegerDocs = {
name: 'isInteger',
category: 'Utils',
syntax: ['isInteger(x)'],
description: 'Test whether a value is an integer number.',
examples: ['isInteger(2)', 'isInteger(3.5)', 'isInteger([3, 0.5, -2])'],
seealso: ['isNegative', 'isNumeric', 'isPositive', 'isZero']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/utils/isNaN.js
var isNaNDocs = {
name: 'isNaN',
category: 'Utils',
syntax: ['isNaN(x)'],
description: 'Test whether a value is NaN (not a number)',
examples: ['isNaN(2)', 'isNaN(0 / 0)', 'isNaN(NaN)', 'isNaN(Infinity)'],
seealso: ['isNegative', 'isNumeric', 'isPositive', 'isZero']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/utils/format.js
var formatDocs = {
name: 'format',
category: 'Utils',
syntax: ['format(value)', 'format(value, precision)'],
description: 'Format a value of any type as string.',
examples: ['format(2.3)', 'format(3 - 4i)', 'format([])', 'format(pi, 3)'],
seealso: ['print']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/utils/clone.js
var cloneDocs = {
name: 'clone',
category: 'Utils',
syntax: ['clone(x)'],
description: 'Clone a variable. Creates a copy of primitive variables,and a deep copy of matrices',
examples: ['clone(3.5)', 'clone(2 - 4i)', 'clone(45 deg)', 'clone([1, 2; 3, 4])', 'clone("hello world")'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/units/to.js
var toDocs = {
name: 'to',
category: 'Units',
syntax: ['x to unit', 'to(x, unit)'],
description: 'Change the unit of a value.',
examples: ['5 inch to cm', '3.2kg to g', '16 bytes in bits'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/tanh.js
var tanhDocs = {
name: 'tanh',
category: 'Trigonometry',
syntax: ['tanh(x)'],
description: 'Compute the hyperbolic tangent of x in radians.',
examples: ['tanh(0.5)', 'sinh(0.5) / cosh(0.5)'],
seealso: ['sinh', 'cosh']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/tan.js
var tanDocs = {
name: 'tan',
category: 'Trigonometry',
syntax: ['tan(x)'],
description: 'Compute the tangent of x in radians.',
examples: ['tan(0.5)', 'sin(0.5) / cos(0.5)', 'tan(pi / 4)', 'tan(45 deg)'],
seealso: ['atan', 'sin', 'cos']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/sinh.js
var sinhDocs = {
name: 'sinh',
category: 'Trigonometry',
syntax: ['sinh(x)'],
description: 'Compute the hyperbolic sine of x in radians.',
examples: ['sinh(0.5)'],
seealso: ['cosh', 'tanh']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/sech.js
var sechDocs = {
name: 'sech',
category: 'Trigonometry',
syntax: ['sech(x)'],
description: 'Compute the hyperbolic secant of x in radians. Defined as 1/cosh(x)',
examples: ['sech(2)', '1 / cosh(2)'],
seealso: ['coth', 'csch', 'cosh']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/sec.js
var secDocs = {
name: 'sec',
category: 'Trigonometry',
syntax: ['sec(x)'],
description: 'Compute the secant of x in radians. Defined as 1/cos(x)',
examples: ['sec(2)', '1 / cos(2)'],
seealso: ['cot', 'csc', 'cos']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/csch.js
var cschDocs = {
name: 'csch',
category: 'Trigonometry',
syntax: ['csch(x)'],
description: 'Compute the hyperbolic cosecant of x in radians. Defined as 1/sinh(x)',
examples: ['csch(2)', '1 / sinh(2)'],
seealso: ['sech', 'coth', 'sinh']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/csc.js
var cscDocs = {
name: 'csc',
category: 'Trigonometry',
syntax: ['csc(x)'],
description: 'Compute the cosecant of x in radians. Defined as 1/sin(x)',
examples: ['csc(2)', '1 / sin(2)'],
seealso: ['sec', 'cot', 'sin']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/coth.js
var cothDocs = {
name: 'coth',
category: 'Trigonometry',
syntax: ['coth(x)'],
description: 'Compute the hyperbolic cotangent of x in radians.',
examples: ['coth(2)', '1 / tanh(2)'],
seealso: ['sech', 'csch', 'tanh']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/cot.js
var cotDocs = {
name: 'cot',
category: 'Trigonometry',
syntax: ['cot(x)'],
description: 'Compute the cotangent of x in radians. Defined as 1/tan(x)',
examples: ['cot(2)', '1 / tan(2)'],
seealso: ['sec', 'csc', 'tan']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/cosh.js
var coshDocs = {
name: 'cosh',
category: 'Trigonometry',
syntax: ['cosh(x)'],
description: 'Compute the hyperbolic cosine of x in radians.',
examples: ['cosh(0.5)'],
seealso: ['sinh', 'tanh', 'coth']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/cos.js
var cosDocs = {
name: 'cos',
category: 'Trigonometry',
syntax: ['cos(x)'],
description: 'Compute the cosine of x in radians.',
examples: ['cos(2)', 'cos(pi / 4) ^ 2', 'cos(180 deg)', 'cos(60 deg)', 'sin(0.2)^2 + cos(0.2)^2'],
seealso: ['acos', 'sin', 'tan']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/atan2.js
var atan2Docs = {
name: 'atan2',
category: 'Trigonometry',
syntax: ['atan2(y, x)'],
description: 'Computes the principal value of the arc tangent of y/x in radians.',
examples: ['atan2(2, 2) / pi', 'angle = 60 deg in rad', 'x = cos(angle)', 'y = sin(angle)', 'atan2(y, x)'],
seealso: ['sin', 'cos', 'tan']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/atanh.js
var atanhDocs = {
name: 'atanh',
category: 'Trigonometry',
syntax: ['atanh(x)'],
description: 'Calculate the hyperbolic arctangent of a value, defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.',
examples: ['atanh(0.5)'],
seealso: ['acosh', 'asinh']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/atan.js
var atanDocs = {
name: 'atan',
category: 'Trigonometry',
syntax: ['atan(x)'],
description: 'Compute the inverse tangent of a value in radians.',
examples: ['atan(0.5)', 'atan(tan(0.5))'],
seealso: ['tan', 'acos', 'asin']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/asinh.js
var asinhDocs = {
name: 'asinh',
category: 'Trigonometry',
syntax: ['asinh(x)'],
description: 'Calculate the hyperbolic arcsine of a value, defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.',
examples: ['asinh(0.5)'],
seealso: ['acosh', 'atanh']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/asin.js
var asinDocs = {
name: 'asin',
category: 'Trigonometry',
syntax: ['asin(x)'],
description: 'Compute the inverse sine of a value in radians.',
examples: ['asin(0.5)', 'asin(sin(0.5))'],
seealso: ['sin', 'acos', 'atan']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/asech.js
var asechDocs = {
name: 'asech',
category: 'Trigonometry',
syntax: ['asech(x)'],
description: 'Calculate the inverse secant of a value.',
examples: ['asech(0.5)'],
seealso: ['acsch', 'acoth']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/asec.js
var asecDocs = {
name: 'asec',
category: 'Trigonometry',
syntax: ['asec(x)'],
description: 'Calculate the inverse secant of a value.',
examples: ['asec(0.5)', 'asec(sec(0.5))', 'asec(2)'],
seealso: ['acos', 'acot', 'acsc']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/acsch.js
var acschDocs = {
name: 'acsch',
category: 'Trigonometry',
syntax: ['acsch(x)'],
description: 'Calculate the hyperbolic arccosecant of a value, defined as `acsch(x) = ln(1/x + sqrt(1/x^2 + 1))`.',
examples: ['acsch(0.5)'],
seealso: ['asech', 'acoth']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/acsc.js
var acscDocs = {
name: 'acsc',
category: 'Trigonometry',
syntax: ['acsc(x)'],
description: 'Calculate the inverse cotangent of a value.',
examples: ['acsc(2)', 'acsc(csc(0.5))', 'acsc(0.5)'],
seealso: ['csc', 'asin', 'asec']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/acoth.js
var acothDocs = {
name: 'acoth',
category: 'Trigonometry',
syntax: ['acoth(x)'],
description: 'Calculate the hyperbolic arccotangent of a value, defined as `acoth(x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.',
examples: ['acoth(2)', 'acoth(0.5)'],
seealso: ['acsch', 'asech']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/acot.js
var acotDocs = {
name: 'acot',
category: 'Trigonometry',
syntax: ['acot(x)'],
description: 'Calculate the inverse cotangent of a value.',
examples: ['acot(0.5)', 'acot(cot(0.5))', 'acot(2)'],
seealso: ['cot', 'atan']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/acosh.js
var acoshDocs = {
name: 'acosh',
category: 'Trigonometry',
syntax: ['acosh(x)'],
description: 'Calculate the hyperbolic arccos of a value, defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.',
examples: ['acosh(1.5)'],
seealso: ['cosh', 'asinh', 'atanh']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/acos.js
var acosDocs = {
name: 'acos',
category: 'Trigonometry',
syntax: ['acos(x)'],
description: 'Compute the inverse cosine of a value in radians.',
examples: ['acos(0.5)', 'acos(cos(2.3))'],
seealso: ['cos', 'atan', 'asin']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/statistics/sum.js
var sumDocs = {
name: 'sum',
category: 'Statistics',
syntax: ['sum(a, b, c, ...)', 'sum(A)'],
description: 'Compute the sum of all values.',
examples: ['sum(2, 3, 4, 1)', 'sum([2, 3, 4, 1])', 'sum([2, 5; 4, 3])'],
seealso: ['max', 'mean', 'median', 'min', 'prod', 'std', 'sum', 'variance']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/statistics/std.js
var stdDocs = {
name: 'std',
category: 'Statistics',
syntax: ['std(a, b, c, ...)', 'std(A)', 'std(A, normalization)'],
description: 'Compute the standard deviation of all values, defined as std(A) = sqrt(variance(A)). Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".',
examples: ['std(2, 4, 6)', 'std([2, 4, 6, 8])', 'std([2, 4, 6, 8], "uncorrected")', 'std([2, 4, 6, 8], "biased")', 'std([1, 2, 3; 4, 5, 6])'],
seealso: ['max', 'mean', 'min', 'median', 'prod', 'sum', 'variance']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/statistics/quantileSeq.js
var quantileSeqDocs = {
name: 'quantileSeq',
category: 'Statistics',
syntax: ['quantileSeq(A, prob[, sorted])', 'quantileSeq(A, [prob1, prob2, ...][, sorted])', 'quantileSeq(A, N[, sorted])'],
description: 'Compute the prob order quantile of a matrix or a list with values. The sequence is sorted and the middle value is returned. Supported types of sequence values are: Number, BigNumber, Unit Supported types of probablity are: Number, BigNumber. \n\nIn case of a (multi dimensional) array or matrix, the prob order quantile of all elements will be calculated.',
examples: ['quantileSeq([3, -1, 5, 7], 0.5)', 'quantileSeq([3, -1, 5, 7], [1/3, 2/3])', 'quantileSeq([3, -1, 5, 7], 2)', 'quantileSeq([-1, 3, 5, 7], 0.5, true)'],
seealso: ['mean', 'median', 'min', 'max', 'prod', 'std', 'sum', 'variance']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/statistics/prod.js
var prodDocs = {
name: 'prod',
category: 'Statistics',
syntax: ['prod(a, b, c, ...)', 'prod(A)'],
description: 'Compute the product of all values.',
examples: ['prod(2, 3, 4)', 'prod([2, 3, 4])', 'prod([2, 5; 4, 3])'],
seealso: ['max', 'mean', 'min', 'median', 'min', 'std', 'sum', 'variance']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/statistics/mode.js
var modeDocs = {
name: 'mode',
category: 'Statistics',
syntax: ['mode(a, b, c, ...)', 'mode(A)', 'mode(A, a, b, B, c, ...)'],
description: 'Computes the mode of all values as an array. In case mode being more than one, multiple values are returned in an array.',
examples: ['mode(2, 1, 4, 3, 1)', 'mode([1, 2.7, 3.2, 4, 2.7])', 'mode(1, 4, 6, 1, 6)'],
seealso: ['max', 'mean', 'min', 'median', 'prod', 'std', 'sum', 'variance']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/statistics/min.js
var minDocs = {
name: 'min',
category: 'Statistics',
syntax: ['min(a, b, c, ...)', 'min(A)', 'min(A, dim)'],
description: 'Compute the minimum value of a list of values.',
examples: ['min(2, 3, 4, 1)', 'min([2, 3, 4, 1])', 'min([2, 5; 4, 3])', 'min([2, 5; 4, 3], 1)', 'min([2, 5; 4, 3], 2)', 'min(2.7, 7.1, -4.5, 2.0, 4.1)', 'max(2.7, 7.1, -4.5, 2.0, 4.1)'],
seealso: ['max', 'mean', 'median', 'prod', 'std', 'sum', 'variance']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/statistics/median.js
var medianDocs = {
name: 'median',
category: 'Statistics',
syntax: ['median(a, b, c, ...)', 'median(A)'],
description: 'Compute the median of all values. The values are sorted and the middle value is returned. In case of an even number of values, the average of the two middle values is returned.',
examples: ['median(5, 2, 7)', 'median([3, -1, 5, 7])'],
seealso: ['max', 'mean', 'min', 'prod', 'std', 'sum', 'variance', 'quantileSeq']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/statistics/mean.js
var meanDocs = {
name: 'mean',
category: 'Statistics',
syntax: ['mean(a, b, c, ...)', 'mean(A)', 'mean(A, dim)'],
description: 'Compute the arithmetic mean of a list of values.',
examples: ['mean(2, 3, 4, 1)', 'mean([2, 3, 4, 1])', 'mean([2, 5; 4, 3])', 'mean([2, 5; 4, 3], 1)', 'mean([2, 5; 4, 3], 2)', 'mean([1.0, 2.7, 3.2, 4.0])'],
seealso: ['max', 'median', 'min', 'prod', 'std', 'sum', 'variance']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/statistics/max.js
var maxDocs = {
name: 'max',
category: 'Statistics',
syntax: ['max(a, b, c, ...)', 'max(A)', 'max(A, dim)'],
description: 'Compute the maximum value of a list of values.',
examples: ['max(2, 3, 4, 1)', 'max([2, 3, 4, 1])', 'max([2, 5; 4, 3])', 'max([2, 5; 4, 3], 1)', 'max([2, 5; 4, 3], 2)', 'max(2.7, 7.1, -4.5, 2.0, 4.1)', 'min(2.7, 7.1, -4.5, 2.0, 4.1)'],
seealso: ['mean', 'median', 'min', 'prod', 'std', 'sum', 'variance']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/statistics/mad.js
var madDocs = {
name: 'mad',
category: 'Statistics',
syntax: ['mad(a, b, c, ...)', 'mad(A)'],
description: 'Compute the median absolute deviation of a matrix or a list with values. The median absolute deviation is defined as the median of the absolute deviations from the median.',
examples: ['mad(10, 20, 30)', 'mad([1, 2, 3])'],
seealso: ['mean', 'median', 'std', 'abs']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/special/erf.js
var erfDocs = {
name: 'erf',
category: 'Special',
syntax: ['erf(x)'],
description: 'Compute the erf function of a value using a rational Chebyshev approximations for different intervals of x',
examples: ['erf(0.2)', 'erf(-0.5)', 'erf(4)'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/set/setUnion.js
var setUnionDocs = {
name: 'setUnion',
category: 'Set',
syntax: ['setUnion(set1, set2)'],
description: 'Create the union of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
examples: ['setUnion([1, 2, 3, 4], [3, 4, 5, 6])', 'setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],
seealso: ['setIntersect', 'setDifference']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/set/setSymDifference.js
var setSymDifferenceDocs = {
name: 'setSymDifference',
category: 'Set',
syntax: ['setSymDifference(set1, set2)'],
description: 'Create the symmetric difference of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
examples: ['setSymDifference([1, 2, 3, 4], [3, 4, 5, 6])', 'setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],
seealso: ['setUnion', 'setIntersect', 'setDifference']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/set/setSize.js
var setSizeDocs = {
name: 'setSize',
category: 'Set',
syntax: ['setSize(set)', 'setSize(set, unique)'],
description: 'Count the number of elements of a (multi)set. When the second parameter "unique" is true, count only the unique values. A multi-dimension array will be converted to a single-dimension array before the operation.',
examples: ['setSize([1, 2, 2, 4])', 'setSize([1, 2, 2, 4], true)'],
seealso: ['setUnion', 'setIntersect', 'setDifference']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/set/setPowerset.js
var setPowersetDocs = {
name: 'setPowerset',
category: 'Set',
syntax: ['setPowerset(set)'],
description: 'Create the powerset of a (multi)set: the powerset contains very possible subsets of a (multi)set. A multi-dimension array will be converted to a single-dimension array before the operation.',
examples: ['setPowerset([1, 2, 3])'],
seealso: ['setCartesian']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/set/setMultiplicity.js
var setMultiplicityDocs = {
name: 'setMultiplicity',
category: 'Set',
syntax: ['setMultiplicity(element, set)'],
description: 'Count the multiplicity of an element in a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.',
examples: ['setMultiplicity(1, [1, 2, 2, 4])', 'setMultiplicity(2, [1, 2, 2, 4])'],
seealso: ['setDistinct', 'setSize']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/set/setIsSubset.js
var setIsSubsetDocs = {
name: 'setIsSubset',
category: 'Set',
syntax: ['setIsSubset(set1, set2)'],
description: 'Check whether a (multi)set is a subset of another (multi)set: every element of set1 is the element of set2. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
examples: ['setIsSubset([1, 2], [3, 4, 5, 6])', 'setIsSubset([3, 4], [3, 4, 5, 6])'],
seealso: ['setUnion', 'setIntersect', 'setDifference']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/set/setIntersect.js
var setIntersectDocs = {
name: 'setIntersect',
category: 'Set',
syntax: ['setIntersect(set1, set2)'],
description: 'Create the intersection of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
examples: ['setIntersect([1, 2, 3, 4], [3, 4, 5, 6])', 'setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],
seealso: ['setUnion', 'setDifference']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/set/setDistinct.js
var setDistinctDocs = {
name: 'setDistinct',
category: 'Set',
syntax: ['setDistinct(set)'],
description: 'Collect the distinct elements of a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.',
examples: ['setDistinct([1, 1, 1, 2, 2, 3])'],
seealso: ['setMultiplicity']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/set/setDifference.js
var setDifferenceDocs = {
name: 'setDifference',
category: 'Set',
syntax: ['setDifference(set1, set2)'],
description: 'Create the difference of two (multi)sets: every element of set1, that is not the element of set2. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
examples: ['setDifference([1, 2, 3, 4], [3, 4, 5, 6])', 'setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],
seealso: ['setUnion', 'setIntersect', 'setSymDifference']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/set/setCartesian.js
var setCartesianDocs = {
name: 'setCartesian',
category: 'Set',
syntax: ['setCartesian(set1, set2)'],
description: 'Create the cartesian product of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
examples: ['setCartesian([1, 2], [3, 4])'],
seealso: ['setUnion', 'setIntersect', 'setDifference', 'setPowerset']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/relational/unequal.js
var unequalDocs = {
name: 'unequal',
category: 'Relational',
syntax: ['x != y', 'unequal(x, y)'],
description: 'Check unequality of two values. Returns true if the values are unequal, and false if they are equal.',
examples: ['2+2 != 3', '2+2 != 4', 'a = 3.2', 'b = 6-2.8', 'a != b', '50cm != 0.5m', '5 cm != 2 inch'],
seealso: ['equal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/relational/smallerEq.js
var smallerEqDocs = {
name: 'smallerEq',
category: 'Relational',
syntax: ['x <= y', 'smallerEq(x, y)'],
description: 'Check if value x is smaller or equal to value y. Returns true if x is smaller than y, and false if not.',
examples: ['2 <= 1+1', '2 < 1+1', 'a = 3.2', 'b = 6-2.8', '(a <= b)'],
seealso: ['equal', 'unequal', 'larger', 'smaller', 'largerEq', 'compare']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/relational/smaller.js
var smallerDocs = {
name: 'smaller',
category: 'Relational',
syntax: ['x < y', 'smaller(x, y)'],
description: 'Check if value x is smaller than value y. Returns true if x is smaller than y, and false if not.',
examples: ['2 < 3', '5 < 2*2', 'a = 3.3', 'b = 6-2.8', '(a < b)', '5 cm < 2 inch'],
seealso: ['equal', 'unequal', 'larger', 'smallerEq', 'largerEq', 'compare']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/relational/largerEq.js
var largerEqDocs = {
name: 'largerEq',
category: 'Relational',
syntax: ['x >= y', 'largerEq(x, y)'],
description: 'Check if value x is larger or equal to y. Returns true if x is larger or equal to y, and false if not.',
examples: ['2 >= 1+1', '2 > 1+1', 'a = 3.2', 'b = 6-2.8', '(a >= b)'],
seealso: ['equal', 'unequal', 'smallerEq', 'smaller', 'compare']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/relational/larger.js
var largerDocs = {
name: 'larger',
category: 'Relational',
syntax: ['x > y', 'larger(x, y)'],
description: 'Check if value x is larger than y. Returns true if x is larger than y, and false if not.',
examples: ['2 > 3', '5 > 2*2', 'a = 3.3', 'b = 6-2.8', '(a > b)', '(b < a)', '5 cm > 2 inch'],
seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/relational/equalText.js
var equalTextDocs = {
name: 'equalText',
category: 'Relational',
syntax: ['equalText(x, y)'],
description: 'Check equality of two strings. Comparison is case sensitive. Returns true if the values are equal, and false if not.',
examples: ['equalText("Hello", "Hello")', 'equalText("a", "A")', 'equal("2e3", "2000")', 'equalText("2e3", "2000")', 'equalText("B", ["A", "B", "C"])'],
seealso: ['compare', 'compareNatural', 'compareText', 'equal']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/relational/equal.js
var equalDocs = {
name: 'equal',
category: 'Relational',
syntax: ['x == y', 'equal(x, y)'],
description: 'Check equality of two values. Returns true if the values are equal, and false if not.',
examples: ['2+2 == 3', '2+2 == 4', 'a = 3.2', 'b = 6-2.8', 'a == b', '50cm == 0.5m'],
seealso: ['unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual', 'equalText']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/relational/deepEqual.js
var deepEqualDocs = {
name: 'deepEqual',
category: 'Relational',
syntax: ['deepEqual(x, y)'],
description: 'Check equality of two matrices element wise. Returns true if the size of both matrices is equal and when and each of the elements are equal.',
examples: ['deepEqual([1,3,4], [1,3,4])', 'deepEqual([1,3,4], [1,3])'],
seealso: ['equal', 'unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/relational/compareText.js
var compareTextDocs = {
name: 'compareText',
category: 'Relational',
syntax: ['compareText(x, y)'],
description: 'Compare two strings lexically. Comparison is case sensitive. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',
examples: ['compareText("B", "A")', 'compareText("A", "B")', 'compareText("A", "A")', 'compareText("2", "10")', 'compare("2", "10")', 'compare(2, 10)', 'compareNatural("2", "10")', 'compareText("B", ["A", "B", "C"])'],
seealso: ['compare', 'compareNatural']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/relational/compareNatural.js
var compareNaturalDocs = {
name: 'compareNatural',
category: 'Relational',
syntax: ['compareNatural(x, y)'],
description: 'Compare two values of any type in a deterministic, natural way. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',
examples: ['compareNatural(2, 3)', 'compareNatural(3, 2)', 'compareNatural(2, 2)', 'compareNatural(5cm, 40mm)', 'compareNatural("2", "10")', 'compareNatural(2 + 3i, 2 + 4i)', 'compareNatural([1, 2, 4], [1, 2, 3])', 'compareNatural([1, 5], [1, 2, 3])', 'compareNatural([1, 2], [1, 2])', 'compareNatural({a: 2}, {a: 4})'],
seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare', 'compareText']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/relational/compare.js
var compareDocs = {
name: 'compare',
category: 'Relational',
syntax: ['compare(x, y)'],
description: 'Compare two values. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',
examples: ['compare(2, 3)', 'compare(3, 2)', 'compare(2, 2)', 'compare(5cm, 40mm)', 'compare(2, [1, 2, 3])'],
seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compareNatural', 'compareText']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/probability/randomInt.js
var randomIntDocs = {
name: 'randomInt',
category: 'Probability',
syntax: ['randomInt(max)', 'randomInt(min, max)', 'randomInt(size)', 'randomInt(size, max)', 'randomInt(size, min, max)'],
description: 'Return a random integer number',
examples: ['randomInt(10, 20)', 'randomInt([2, 3], 10)'],
seealso: ['pickRandom', 'random']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/probability/random.js
var randomDocs = {
name: 'random',
category: 'Probability',
syntax: ['random()', 'random(max)', 'random(min, max)', 'random(size)', 'random(size, max)', 'random(size, min, max)'],
description: 'Return a random number.',
examples: ['random()', 'random(10, 20)', 'random([2, 3])'],
seealso: ['pickRandom', 'randomInt']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/probability/pickRandom.js
var pickRandomDocs = {
name: 'pickRandom',
category: 'Probability',
syntax: ['pickRandom(array)', 'pickRandom(array, number)', 'pickRandom(array, weights)', 'pickRandom(array, number, weights)', 'pickRandom(array, weights, number)'],
description: 'Pick a random entry from a given array.',
examples: ['pickRandom(0:10)', 'pickRandom([1, 3, 1, 6])', 'pickRandom([1, 3, 1, 6], 2)', 'pickRandom([1, 3, 1, 6], [2, 3, 2, 1])', 'pickRandom([1, 3, 1, 6], 2, [2, 3, 2, 1])', 'pickRandom([1, 3, 1, 6], [2, 3, 2, 1], 2)'],
seealso: ['random', 'randomInt']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/probability/permutations.js
var permutationsDocs = {
name: 'permutations',
category: 'Probability',
syntax: ['permutations(n)', 'permutations(n, k)'],
description: 'Compute the number of permutations of n items taken k at a time',
examples: ['permutations(5)', 'permutations(5, 3)'],
seealso: ['combinations', 'combinationsWithRep', 'factorial']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/probability/multinomial.js
var multinomialDocs = {
name: 'multinomial',
category: 'Probability',
syntax: ['multinomial(A)'],
description: 'Multinomial Coefficients compute the number of ways of picking a1, a2, ..., ai unordered outcomes from `n` possibilities. multinomial takes one array of integers as an argument. The following condition must be enforced: every ai > 0.',
examples: ['multinomial([1, 2, 1])'],
seealso: ['combinations', 'factorial']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/probability/kldivergence.js
var kldivergenceDocs = {
name: 'kldivergence',
category: 'Probability',
syntax: ['kldivergence(x, y)'],
description: 'Calculate the Kullback-Leibler (KL) divergence between two distributions.',
examples: ['kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5])'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/probability/gamma.js
var gammaDocs = {
name: 'gamma',
category: 'Probability',
syntax: ['gamma(n)'],
description: 'Compute the gamma function. For small values, the Lanczos approximation is used, and for large values the extended Stirling approximation.',
examples: ['gamma(4)', '3!', 'gamma(1/2)', 'sqrt(pi)'],
seealso: ['factorial']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/probability/factorial.js
var factorialDocs = {
name: 'factorial',
category: 'Probability',
syntax: ['n!', 'factorial(n)'],
description: 'Compute the factorial of a value',
examples: ['5!', '5 * 4 * 3 * 2 * 1', '3!'],
seealso: ['combinations', 'combinationsWithRep', 'permutations', 'gamma']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/probability/combinations.js
var combinationsDocs = {
name: 'combinations',
category: 'Probability',
syntax: ['combinations(n, k)'],
description: 'Compute the number of combinations of n items taken k at a time',
examples: ['combinations(7, 5)'],
seealso: ['combinationsWithRep', 'permutations', 'factorial']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/probability/combinationsWithRep.js
var combinationsWithRepDocs = {
name: 'combinationsWithRep',
category: 'Probability',
syntax: ['combinationsWithRep(n, k)'],
description: 'Compute the number of combinations of n items taken k at a time with replacements.',
examples: ['combinationsWithRep(7, 5)'],
seealso: ['combinations', 'permutations', 'factorial']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/zeros.js
var zerosDocs = {
name: 'zeros',
category: 'Matrix',
syntax: ['zeros(m)', 'zeros(m, n)', 'zeros(m, n, p, ...)', 'zeros([m])', 'zeros([m, n])', 'zeros([m, n, p, ...])'],
description: 'Create a matrix containing zeros.',
examples: ['zeros(3)', 'zeros(3, 5)', 'a = [1, 2, 3; 4, 5, 6]', 'zeros(size(a))'],
seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/transpose.js
var transposeDocs = {
name: 'transpose',
category: 'Matrix',
syntax: ['x\'', 'transpose(x)'],
description: 'Transpose a matrix',
examples: ['a = [1, 2, 3; 4, 5, 6]', 'a\'', 'transpose(a)'],
seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/trace.js
var traceDocs = {
name: 'trace',
category: 'Matrix',
syntax: ['trace(A)'],
description: 'Calculate the trace of a matrix: the sum of the elements on the main diagonal of a square matrix.',
examples: ['A = [1, 2, 3; -1, 2, 3; 2, 0, 3]', 'trace(A)'],
seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'transpose', 'zeros']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/subset.js
var subsetDocs = {
name: 'subset',
category: 'Matrix',
syntax: ['value(index)', 'value(index) = replacement', 'subset(value, [index])', 'subset(value, [index], replacement)'],
description: 'Get or set a subset of a matrix or string. ' + 'Indexes are one-based. ' + 'Both the ranges lower-bound and upper-bound are included.',
examples: ['d = [1, 2; 3, 4]', 'e = []', 'e[1, 1:2] = [5, 6]', 'e[2, :] = [7, 8]', 'f = d * e', 'f[2, 1]', 'f[:, 1]'],
seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'trace', 'transpose', 'zeros']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/squeeze.js
var squeezeDocs = {
name: 'squeeze',
category: 'Matrix',
syntax: ['squeeze(x)'],
description: 'Remove inner and outer singleton dimensions from a matrix.',
examples: ['a = zeros(3,2,1)', 'size(squeeze(a))', 'b = zeros(1,1,3)', 'size(squeeze(b))'],
seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'subset', 'trace', 'transpose', 'zeros']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/sort.js
var sortDocs = {
name: 'sort',
category: 'Matrix',
syntax: ['sort(x)', 'sort(x, compare)'],
description: 'Sort the items in a matrix. Compare can be a string "asc", "desc", "natural", or a custom sort function.',
examples: ['sort([5, 10, 1])', 'sort(["C", "B", "A", "D"])', 'sortByLength(a, b) = size(a)[1] - size(b)[1]', 'sort(["Langdon", "Tom", "Sara"], sortByLength)', 'sort(["10", "1", "2"], "natural")'],
seealso: ['map', 'filter', 'forEach']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/size.js
var sizeDocs = {
name: 'size',
category: 'Matrix',
syntax: ['size(x)'],
description: 'Calculate the size of a matrix.',
examples: ['size(2.3)', 'size("hello world")', 'a = [1, 2; 3, 4; 5, 6]', 'size(a)', 'size(1:6)'],
seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/reshape.js
var reshapeDocs = {
name: 'reshape',
category: 'Matrix',
syntax: ['reshape(x, sizes)'],
description: 'Reshape a multi dimensional array to fit the specified dimensions.',
examples: ['reshape([1, 2, 3, 4, 5, 6], [2, 3])', 'reshape([[1, 2], [3, 4]], [1, 4])', 'reshape([[1, 2], [3, 4]], [4])'],
seealso: ['size', 'squeeze', 'resize']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/resize.js
var resizeDocs = {
name: 'resize',
category: 'Matrix',
syntax: ['resize(x, size)', 'resize(x, size, defaultValue)'],
description: 'Resize a matrix.',
examples: ['resize([1,2,3,4,5], [3])', 'resize([1,2,3], [5])', 'resize([1,2,3], [5], -1)', 'resize(2, [2, 3])', 'resize("hello", [8], "!")'],
seealso: ['size', 'subset', 'squeeze', 'reshape']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/range.js
var rangeDocs = {
name: 'range',
category: 'Type',
syntax: ['start:end', 'start:step:end', 'range(start, end)', 'range(start, end, step)', 'range(string)'],
description: 'Create a range. Lower bound of the range is included, upper bound is excluded.',
examples: ['1:5', '3:-1:-3', 'range(3, 7)', 'range(0, 12, 2)', 'range("4:10")', 'a = [1, 2, 3, 4; 5, 6, 7, 8]', 'a[1:2, 1:2]'],
seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/partitionSelect.js
var partitionSelectDocs = {
name: 'partitionSelect',
category: 'Matrix',
syntax: ['partitionSelect(x, k)', 'partitionSelect(x, k, compare)'],
description: 'Partition-based selection of an array or 1D matrix. Will find the kth smallest value, and mutates the input array. Uses Quickselect.',
examples: ['partitionSelect([5, 10, 1], 2)', 'partitionSelect(["C", "B", "A", "D"], 1)'],
seealso: ['sort']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/ones.js
var onesDocs = {
name: 'ones',
category: 'Matrix',
syntax: ['ones(m)', 'ones(m, n)', 'ones(m, n, p, ...)', 'ones([m])', 'ones([m, n])', 'ones([m, n, p, ...])'],
description: 'Create a matrix containing ones.',
examples: ['ones(3)', 'ones(3, 5)', 'ones([2,3]) * 4.5', 'a = [1, 2, 3; 4, 5, 6]', 'ones(size(a))'],
seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/map.js
var mapDocs = {
name: 'map',
category: 'Matrix',
syntax: ['map(x, callback)'],
description: 'Create a new matrix or array with the results of the callback function executed on each entry of the matrix/array.',
examples: ['map([1, 2, 3], square)'],
seealso: ['filter', 'forEach']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/kron.js
var kronDocs = {
name: 'kron',
category: 'Matrix',
syntax: ['kron(x, y)'],
description: 'Calculates the kronecker product of 2 matrices or vectors.',
examples: ['kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])', 'kron([1,1], [2,3,4])'],
seealso: ['multiply', 'dot', 'cross']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/inv.js
var invDocs = {
name: 'inv',
category: 'Matrix',
syntax: ['inv(x)'],
description: 'Calculate the inverse of a matrix',
examples: ['inv([1, 2; 3, 4])', 'inv(4)', '1 / 4'],
seealso: ['concat', 'det', 'diag', 'identity', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/forEach.js
var forEachDocs = {
name: 'forEach',
category: 'Matrix',
syntax: ['forEach(x, callback)'],
description: 'Iterates over all elements of a matrix/array, and executes the given callback function.',
examples: ['forEach([1, 2, 3], function(val) { console.log(val) })'],
seealso: ['map', 'sort', 'filter']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/flatten.js
var flattenDocs = {
name: 'flatten',
category: 'Matrix',
syntax: ['flatten(x)'],
description: 'Flatten a multi dimensional matrix into a single dimensional matrix.',
examples: ['a = [1, 2, 3; 4, 5, 6]', 'size(a)', 'b = flatten(a)', 'size(b)'],
seealso: ['concat', 'resize', 'size', 'squeeze']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/filter.js
var filterDocs = {
name: 'filter',
category: 'Matrix',
syntax: ['filter(x, test)'],
description: 'Filter items in a matrix.',
examples: ['isPositive(x) = x > 0', 'filter([6, -2, -1, 4, 3], isPositive)', 'filter([6, -2, 0, 1, 0], x != 0)'],
seealso: ['sort', 'map', 'forEach']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/identity.js
var identityDocs = {
name: 'identity',
category: 'Matrix',
syntax: ['identity(n)', 'identity(m, n)', 'identity([m, n])'],
description: 'Returns the identity matrix with size m-by-n. The matrix has ones on the diagonal and zeros elsewhere.',
examples: ['identity(3)', 'identity(3, 5)', 'a = [1, 2, 3; 4, 5, 6]', 'identity(size(a))'],
seealso: ['concat', 'det', 'diag', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/getMatrixDataType.js
var getMatrixDataTypeDocs = {
name: 'getMatrixDataType',
category: 'Matrix',
syntax: ['getMatrixDataType(x)'],
description: 'Find the data type of all elements in a matrix or array, ' + 'for example "number" if all items are a number ' + 'and "Complex" if all values are complex numbers. ' + 'If a matrix contains more than one data type, it will return "mixed".',
examples: ['getMatrixDataType([1, 2, 3])', 'getMatrixDataType([[5 cm], [2 inch]])', 'getMatrixDataType([1, "text"])', 'getMatrixDataType([1, bignumber(4)])'],
seealso: ['matrix', 'sparse', 'typeOf']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/dot.js
var dotDocs = {
name: 'dot',
category: 'Matrix',
syntax: ['dot(A, B)', 'A * B'],
description: 'Calculate the dot product of two vectors. ' + 'The dot product of A = [a1, a2, a3, ..., an] and B = [b1, b2, b3, ..., bn] ' + 'is defined as dot(A, B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn',
examples: ['dot([2, 4, 1], [2, 2, 3])', '[2, 4, 1] * [2, 2, 3]'],
seealso: ['multiply', 'cross']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/diag.js
var diagDocs = {
name: 'diag',
category: 'Matrix',
syntax: ['diag(x)', 'diag(x, k)'],
description: 'Create a diagonal matrix or retrieve the diagonal of a matrix. When x is a vector, a matrix with the vector values on the diagonal will be returned. When x is a matrix, a vector with the diagonal values of the matrix is returned. When k is provided, the k-th diagonal will be filled in or retrieved, if k is positive, the values are placed on the super diagonal. When k is negative, the values are placed on the sub diagonal.',
examples: ['diag(1:3)', 'diag(1:3, 1)', 'a = [1, 2, 3; 4, 5, 6; 7, 8, 9]', 'diag(a)'],
seealso: ['concat', 'det', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/det.js
var detDocs = {
name: 'det',
category: 'Matrix',
syntax: ['det(x)'],
description: 'Calculate the determinant of a matrix',
examples: ['det([1, 2; 3, 4])', 'det([-2, 2, 3; -1, 1, 3; 2, 0, -1])'],
seealso: ['concat', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/ctranspose.js
var ctransposeDocs = {
name: 'ctranspose',
category: 'Matrix',
syntax: ['x\'', 'ctranspose(x)'],
description: 'Complex Conjugate and Transpose a matrix',
examples: ['a = [1, 2, 3; 4, 5, 6]', 'a\'', 'ctranspose(a)'],
seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/cross.js
var crossDocs = {
name: 'cross',
category: 'Matrix',
syntax: ['cross(A, B)'],
description: 'Calculate the cross product for two vectors in three dimensional space.',
examples: ['cross([1, 1, 0], [0, 1, 1])', 'cross([3, -3, 1], [4, 9, 2])', 'cross([2, 3, 4], [5, 6, 7])'],
seealso: ['multiply', 'dot']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/concat.js
var concatDocs = {
name: 'concat',
category: 'Matrix',
syntax: ['concat(A, B, C, ...)', 'concat(A, B, C, ..., dim)'],
description: 'Concatenate matrices. By default, the matrices are concatenated by the last dimension. The dimension on which to concatenate can be provided as last argument.',
examples: ['A = [1, 2; 5, 6]', 'B = [3, 4; 7, 8]', 'concat(A, B)', 'concat(A, B, 1)', 'concat(A, B, 2)'],
seealso: ['det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/logical/xor.js
var xorDocs = {
name: 'xor',
category: 'Logical',
syntax: ['x xor y', 'xor(x, y)'],
description: 'Logical exclusive or, xor. Test whether one and only one value is defined with a nonzero/nonempty value.',
examples: ['true xor false', 'false xor false', 'true xor true', '0 xor 4'],
seealso: ['not', 'and', 'or']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/logical/or.js
var orDocs = {
name: 'or',
category: 'Logical',
syntax: ['x or y', 'or(x, y)'],
description: 'Logical or. Test if at least one value is defined with a nonzero/nonempty value.',
examples: ['true or false', 'false or false', '0 or 4'],
seealso: ['not', 'and', 'xor']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/logical/not.js
var notDocs = {
name: 'not',
category: 'Logical',
syntax: ['not x', 'not(x)'],
description: 'Logical not. Flips the boolean value of given argument.',
examples: ['not true', 'not false', 'not 2', 'not 0'],
seealso: ['and', 'or', 'xor']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/logical/and.js
var andDocs = {
name: 'and',
category: 'Logical',
syntax: ['x and y', 'and(x, y)'],
description: 'Logical and. Test whether two values are both defined with a nonzero/nonempty value.',
examples: ['true and false', 'true and true', '2 and 4'],
seealso: ['not', 'or', 'xor']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/geometry/intersect.js
var intersectDocs = {
name: 'intersect',
category: 'Geometry',
syntax: ['intersect(expr1, expr2, expr3, expr4)', 'intersect(expr1, expr2, expr3)'],
description: 'Computes the intersection point of lines and/or planes.',
examples: ['intersect([0, 0], [10, 10], [10, 0], [0, 10])', 'intersect([1, 0, 1], [4, -2, 2], [1, 1, 1, 6])'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/geometry/distance.js
var distanceDocs = {
name: 'distance',
category: 'Geometry',
syntax: ['distance([x1, y1], [x2, y2])', 'distance([[x1, y1], [x2, y2]])'],
description: 'Calculates the Euclidean distance between two points.',
examples: ['distance([0,0], [4,4])', 'distance([[0,0], [4,4]])'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/expression/help.js
var helpDocs = {
name: 'help',
category: 'Expression',
syntax: ['help(object)', 'help(string)'],
description: 'Display documentation on a function or data type.',
examples: ['help(sqrt)', 'help("complex")'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/expression/evaluate.js
var evaluateDocs = {
name: 'evaluate',
category: 'Expression',
syntax: ['evaluate(expression)', 'evaluate([expr1, expr2, expr3, ...])'],
description: 'Evaluate an expression or an array with expressions.',
examples: ['evaluate("2 + 3")', 'evaluate("sqrt(" + 4 + ")")'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/complex/im.js
var imDocs = {
name: 'im',
category: 'Complex',
syntax: ['im(x)'],
description: 'Get the imaginary part of a complex number.',
examples: ['im(2 + 3i)', 're(2 + 3i)', 'im(-5.2i)', 'im(2.4)'],
seealso: ['re', 'conj', 'abs', 'arg']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/complex/re.js
var reDocs = {
name: 're',
category: 'Complex',
syntax: ['re(x)'],
description: 'Get the real part of a complex number.',
examples: ['re(2 + 3i)', 'im(2 + 3i)', 're(-5.2i)', 're(2.4)'],
seealso: ['im', 'conj', 'abs', 'arg']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/complex/conj.js
var conjDocs = {
name: 'conj',
category: 'Complex',
syntax: ['conj(x)'],
description: 'Compute the complex conjugate of a complex value. If x = a+bi, the complex conjugate is a-bi.',
examples: ['conj(2 + 3i)', 'conj(2 - 3i)', 'conj(-5.2i)'],
seealso: ['re', 'im', 'abs', 'arg']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/complex/arg.js
var argDocs = {
name: 'arg',
category: 'Complex',
syntax: ['arg(x)'],
description: 'Compute the argument of a complex value. If x = a+bi, the argument is computed as atan2(b, a).',
examples: ['arg(2 + 2i)', 'atan2(3, 2)', 'arg(2 + 3i)'],
seealso: ['re', 'im', 'conj', 'abs']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/core/typed.js
var typedDocs = {
name: 'typed',
category: 'Core',
syntax: ['typed(signatures)', 'typed(name, signatures)'],
description: 'Create a typed function.',
examples: ['double = typed({ "number, number": f(x)=x+x })', 'double(2)', 'double("hello")'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/core/import.js
var importDocs = {
name: 'import',
category: 'Core',
syntax: ['import(functions)', 'import(functions, options)'],
description: 'Import functions or constants from an object.',
examples: ['import({myFn: f(x)=x^2, myConstant: 32 })', 'myFn(2)', 'myConstant'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/core/config.js
var configDocs = {
name: 'config',
category: 'Core',
syntax: ['config()', 'config(options)'],
description: 'Get configuration or change configuration.',
examples: ['config()', '1/3 + 1/4', 'config({number: "Fraction"})', '1/3 + 1/4'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/combinatorics/stirlingS2.js
var stirlingS2Docs = {
name: 'stirlingS2',
category: 'Combinatorics',
syntax: ['stirlingS2(n, k)'],
description: 'he Stirling numbers of the second kind, counts the number of ways to partition a set of n labelled objects into k nonempty unlabelled subsets. `stirlingS2` only takes integer arguments. The following condition must be enforced: k <= n. If n = k or k = 1, then s(n,k) = 1.',
examples: ['stirlingS2(5, 3)'],
seealso: ['bellNumbers']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/combinatorics/composition.js
var compositionDocs = {
name: 'composition',
category: 'Combinatorics',
syntax: ['composition(n, k)'],
description: 'The composition counts of n into k parts. composition only takes integer arguments. The following condition must be enforced: k <= n.',
examples: ['composition(5, 3)'],
seealso: ['combinations']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/combinatorics/catalan.js
var catalanDocs = {
name: 'catalan',
category: 'Combinatorics',
syntax: ['catalan(n)'],
description: 'The Catalan Numbers enumerate combinatorial structures of many different types. catalan only takes integer arguments. The following condition must be enforced: n >= 0.',
examples: ['catalan(3)', 'catalan(8)'],
seealso: ['bellNumbers']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/combinatorics/bellNumbers.js
var bellNumbersDocs = {
name: 'bellNumbers',
category: 'Combinatorics',
syntax: ['bellNumbers(n)'],
description: 'The Bell Numbers count the number of partitions of a set. A partition is a pairwise disjoint subset of S whose union is S. `bellNumbers` only takes integer arguments. The following condition must be enforced: n >= 0.',
examples: ['bellNumbers(3)', 'bellNumbers(8)'],
seealso: ['stirlingS2']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/bitwise/rightLogShift.js
var rightLogShiftDocs = {
name: 'rightLogShift',
category: 'Bitwise',
syntax: ['x >>> y', 'rightLogShift(x, y)'],
description: 'Bitwise right logical shift of a value x by y number of bits.',
examples: ['8 >>> 1', '4 << 1', '-12 >>> 2'],
seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/bitwise/rightArithShift.js
var rightArithShiftDocs = {
name: 'rightArithShift',
category: 'Bitwise',
syntax: ['x >> y', 'rightArithShift(x, y)'],
description: 'Bitwise right arithmetic shift of a value x by y number of bits.',
examples: ['8 >> 1', '4 << 1', '-12 >> 2'],
seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightLogShift']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/bitwise/leftShift.js
var leftShiftDocs = {
name: 'leftShift',
category: 'Bitwise',
syntax: ['x << y', 'leftShift(x, y)'],
description: 'Bitwise left logical shift of a value x by y number of bits.',
examples: ['4 << 1', '8 >> 1'],
seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'rightArithShift', 'rightLogShift']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/bitwise/bitXor.js
var bitXorDocs = {
name: 'bitXor',
category: 'Bitwise',
syntax: ['bitXor(x, y)'],
description: 'Bitwise XOR operation, exclusive OR. Performs the logical exclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if only the first bit is 1 or only the second bit is 1, but will be 0 if both are 0 or both are 1.',
examples: ['bitOr(1, 2)', 'bitXor([2, 3, 4], 4)'],
seealso: ['bitAnd', 'bitNot', 'bitOr', 'leftShift', 'rightArithShift', 'rightLogShift']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/bitwise/bitOr.js
var bitOrDocs = {
name: 'bitOr',
category: 'Bitwise',
syntax: ['x | y', 'bitOr(x, y)'],
description: 'Bitwise OR operation. Performs the logical inclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if the first bit is 1 or the second bit is 1 or both bits are 1, otherwise, the result is 0.',
examples: ['5 | 3', 'bitOr([1, 2, 3], 4)'],
seealso: ['bitAnd', 'bitNot', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/bitwise/bitNot.js
var bitNotDocs = {
name: 'bitNot',
category: 'Bitwise',
syntax: ['~x', 'bitNot(x)'],
description: 'Bitwise NOT operation. Performs a logical negation on each bit of the given value. Bits that are 0 become 1, and those that are 1 become 0.',
examples: ['~1', '~2', 'bitNot([2, -3, 4])'],
seealso: ['bitAnd', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/bitwise/bitAnd.js
var bitAndDocs = {
name: 'bitAnd',
category: 'Bitwise',
syntax: ['x & y', 'bitAnd(x, y)'],
description: 'Bitwise AND operation. Performs the logical AND operation on each pair of the corresponding bits of the two given values by multiplying them. If both bits in the compared position are 1, the bit in the resulting binary representation is 1, otherwise, the result is 0',
examples: ['5 & 3', 'bitAnd(53, 131)', '[1, 12, 31] & 42'],
seealso: ['bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/xgcd.js
var xgcdDocs = {
name: 'xgcd',
category: 'Arithmetic',
syntax: ['xgcd(a, b)'],
description: 'Calculate the extended greatest common divisor for two values. The result is an array [d, x, y] with 3 entries, where d is the greatest common divisor, and d = x * a + y * b.',
examples: ['xgcd(8, 12)', 'gcd(8, 12)', 'xgcd(36163, 21199)'],
seealso: ['gcd', 'lcm']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/unaryPlus.js
var unaryPlusDocs = {
name: 'unaryPlus',
category: 'Operators',
syntax: ['+x', 'unaryPlus(x)'],
description: 'Converts booleans and strings to numbers.',
examples: ['+true', '+"2"'],
seealso: ['add', 'subtract', 'unaryMinus']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/unaryMinus.js
var unaryMinusDocs = {
name: 'unaryMinus',
category: 'Operators',
syntax: ['-x', 'unaryMinus(x)'],
description: 'Inverse the sign of a value. Converts booleans and strings to numbers.',
examples: ['-4.5', '-(-5.6)', '-"22"'],
seealso: ['add', 'subtract', 'unaryPlus']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/square.js
var squareDocs = {
name: 'square',
category: 'Arithmetic',
syntax: ['square(x)'],
description: 'Compute the square of a value. The square of x is x * x.',
examples: ['square(3)', 'sqrt(9)', '3^2', '3 * 3'],
seealso: ['multiply', 'pow', 'sqrt', 'cube']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/sqrtm.js
var sqrtmDocs = {
name: 'sqrtm',
category: 'Arithmetic',
syntax: ['sqrtm(x)'],
description: 'Calculate the principal square root of a square matrix. The principal square root matrix `X` of another matrix `A` is such that `X * X = A`.',
examples: ['sqrtm([[1, 2], [3, 4]])'],
seealso: ['sqrt', 'abs', 'square', 'multiply']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/sqrt.js
var sqrtDocs = {
name: 'sqrt',
category: 'Arithmetic',
syntax: ['sqrt(x)'],
description: 'Compute the square root value. If x = y * y, then y is the square root of x.',
examples: ['sqrt(25)', '5 * 5', 'sqrt(-1)'],
seealso: ['square', 'sqrtm', 'multiply', 'nthRoot', 'nthRoots', 'pow']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/sign.js
var signDocs = {
name: 'sign',
category: 'Arithmetic',
syntax: ['sign(x)'],
description: 'Compute the sign of a value. The sign of a value x is 1 when x>1, -1 when x<0, and 0 when x=0.',
examples: ['sign(3.5)', 'sign(-4.2)', 'sign(0)'],
seealso: ['abs']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/round.js
var roundDocs = {
name: 'round',
category: 'Arithmetic',
syntax: ['round(x)', 'round(x, n)'],
description: 'round a value towards the nearest integer.If x is complex, both real and imaginary part are rounded towards the nearest integer. When n is specified, the value is rounded to n decimals.',
examples: ['round(3.2)', 'round(3.8)', 'round(-4.2)', 'round(-4.8)', 'round(pi, 3)', 'round(123.45678, 2)'],
seealso: ['ceil', 'floor', 'fix']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/pow.js
var powDocs = {
name: 'pow',
category: 'Operators',
syntax: ['x ^ y', 'pow(x, y)'],
description: 'Calculates the power of x to y, x^y.',
examples: ['2^3', '2*2*2', '1 + e ^ (pi * i)'],
seealso: ['multiply', 'nthRoot', 'nthRoots', 'sqrt']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/nthRoots.js
var nthRootsDocs = {
name: 'nthRoots',
category: 'Arithmetic',
syntax: ['nthRoots(A)', 'nthRoots(A, root)'],
description: '' + 'Calculate the nth roots of a value. ' + 'An nth root of a positive real number A, ' + 'is a positive real solution of the equation "x^root = A". ' + 'This function returns an array of complex values.',
examples: ['nthRoots(1)', 'nthRoots(1, 3)'],
seealso: ['sqrt', 'pow', 'nthRoot']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/nthRoot.js
var nthRootDocs = {
name: 'nthRoot',
category: 'Arithmetic',
syntax: ['nthRoot(a)', 'nthRoot(a, root)'],
description: 'Calculate the nth root of a value. ' + 'The principal nth root of a positive real number A, ' + 'is the positive real solution of the equation "x^root = A".',
examples: ['4 ^ 3', 'nthRoot(64, 3)', 'nthRoot(9, 2)', 'sqrt(9)'],
seealso: ['nthRoots', 'pow', 'sqrt']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/norm.js
var normDocs = {
name: 'norm',
category: 'Arithmetic',
syntax: ['norm(x)', 'norm(x, p)'],
description: 'Calculate the norm of a number, vector or matrix.',
examples: ['abs(-3.5)', 'norm(-3.5)', 'norm(3 - 4i)', 'norm([1, 2, -3], Infinity)', 'norm([1, 2, -3], -Infinity)', 'norm([3, 4], 2)', 'norm([[1, 2], [3, 4]], 1)', 'norm([[1, 2], [3, 4]], "inf")', 'norm([[1, 2], [3, 4]], "fro")']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/multiply.js
var multiplyDocs = {
name: 'multiply',
category: 'Operators',
syntax: ['x * y', 'multiply(x, y)'],
description: 'multiply two values.',
examples: ['a = 2.1 * 3.4', 'a / 3.4', '2 * 3 + 4', '2 * (3 + 4)', '3 * 2.1 km'],
seealso: ['divide']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/mod.js
var modDocs = {
name: 'mod',
category: 'Operators',
syntax: ['x % y', 'x mod y', 'mod(x, y)'],
description: 'Calculates the modulus, the remainder of an integer division.',
examples: ['7 % 3', '11 % 2', '10 mod 4', 'isOdd(x) = x % 2', 'isOdd(2)', 'isOdd(3)'],
seealso: ['divide']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/log10.js
var log10Docs = {
name: 'log10',
category: 'Arithmetic',
syntax: ['log10(x)'],
description: 'Compute the 10-base logarithm of a value.',
examples: ['log10(0.00001)', 'log10(10000)', '10 ^ 4', 'log(10000) / log(10)', 'log(10000, 10)'],
seealso: ['exp', 'log']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/log1p.js
var log1pDocs = {
name: 'log1p',
category: 'Arithmetic',
syntax: ['log1p(x)', 'log1p(x, base)'],
description: 'Calculate the logarithm of a `value+1`',
examples: ['log1p(2.5)', 'exp(log1p(1.4))', 'pow(10, 4)', 'log1p(9999, 10)', 'log1p(9999) / log(10)'],
seealso: ['exp', 'log', 'log2', 'log10']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/log2.js
var log2Docs = {
name: 'log2',
category: 'Arithmetic',
syntax: ['log2(x)'],
description: 'Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.',
examples: ['log2(0.03125)', 'log2(16)', 'log2(16) / log2(2)', 'pow(2, 4)'],
seealso: ['exp', 'log1p', 'log', 'log10']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/log.js
var logDocs = {
name: 'log',
category: 'Arithmetic',
syntax: ['log(x)', 'log(x, base)'],
description: 'Compute the logarithm of a value. If no base is provided, the natural logarithm of x is calculated. If base if provided, the logarithm is calculated for the specified base. log(x, base) is defined as log(x) / log(base).',
examples: ['log(3.5)', 'a = log(2.4)', 'exp(a)', '10 ^ 4', 'log(10000, 10)', 'log(10000) / log(10)', 'b = log(1024, 2)', '2 ^ b'],
seealso: ['exp', 'log1p', 'log2', 'log10']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/lcm.js
var lcmDocs = {
name: 'lcm',
category: 'Arithmetic',
syntax: ['lcm(x, y)'],
description: 'Compute the least common multiple.',
examples: ['lcm(4, 6)', 'lcm(6, 21)', 'lcm(6, 21, 5)'],
seealso: ['gcd']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/hypot.js
var hypotDocs = {
name: 'hypot',
category: 'Arithmetic',
syntax: ['hypot(a, b, c, ...)', 'hypot([a, b, c, ...])'],
description: 'Calculate the hypotenusa of a list with values. ',
examples: ['hypot(3, 4)', 'sqrt(3^2 + 4^2)', 'hypot(-2)', 'hypot([3, 4, 5])'],
seealso: ['abs', 'norm']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/gcd.js
var gcdDocs = {
name: 'gcd',
category: 'Arithmetic',
syntax: ['gcd(a, b)', 'gcd(a, b, c, ...)'],
description: 'Compute the greatest common divisor.',
examples: ['gcd(8, 12)', 'gcd(-4, 6)', 'gcd(25, 15, -10)'],
seealso: ['lcm', 'xgcd']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/floor.js
var floorDocs = {
name: 'floor',
category: 'Arithmetic',
syntax: ['floor(x)'],
description: 'Round a value towards minus infinity.If x is complex, both real and imaginary part are rounded towards minus infinity.',
examples: ['floor(3.2)', 'floor(3.8)', 'floor(-4.2)'],
seealso: ['ceil', 'fix', 'round']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/fix.js
var fixDocs = {
name: 'fix',
category: 'Arithmetic',
syntax: ['fix(x)'],
description: 'Round a value towards zero. If x is complex, both real and imaginary part are rounded towards zero.',
examples: ['fix(3.2)', 'fix(3.8)', 'fix(-4.2)', 'fix(-4.8)'],
seealso: ['ceil', 'floor', 'round']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/expm1.js
var expm1Docs = {
name: 'expm1',
category: 'Arithmetic',
syntax: ['expm1(x)'],
description: 'Calculate the value of subtracting 1 from the exponential value.',
examples: ['expm1(2)', 'pow(e, 2) - 1', 'log(expm1(2) + 1)'],
seealso: ['exp', 'pow', 'log']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/expm.js
var expmDocs = {
name: 'expm',
category: 'Arithmetic',
syntax: ['exp(x)'],
description: 'Compute the matrix exponential, expm(A) = e^A. ' + 'The matrix must be square. ' + 'Not to be confused with exp(a), which performs element-wise exponentiation.',
examples: ['expm([[0,2],[0,0]])'],
seealso: ['exp']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/eigs.js
var eigsDocs = {
name: 'eigs',
category: 'Matrix',
syntax: ['eigs(x)'],
description: 'Calculate the eigenvalues and eigenvectors of a real symmetric matrix',
examples: ['eigs([[5, 2.3], [2.3, 1]])'],
seealso: ['inv']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/exp.js
var expDocs = {
name: 'exp',
category: 'Arithmetic',
syntax: ['exp(x)'],
description: 'Calculate the exponent of a value.',
examples: ['exp(1.3)', 'e ^ 1.3', 'log(exp(1.3))', 'x = 2.4', '(exp(i*x) == cos(x) + i*sin(x)) # Euler\'s formula'],
seealso: ['expm', 'expm1', 'pow', 'log']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/dotMultiply.js
var dotMultiplyDocs = {
name: 'dotMultiply',
category: 'Operators',
syntax: ['x .* y', 'dotMultiply(x, y)'],
description: 'Multiply two values element wise.',
examples: ['a = [1, 2, 3; 4, 5, 6]', 'b = [2, 1, 1; 3, 2, 5]', 'a .* b'],
seealso: ['multiply', 'divide', 'dotDivide']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/dotDivide.js
var dotDivideDocs = {
name: 'dotDivide',
category: 'Operators',
syntax: ['x ./ y', 'dotDivide(x, y)'],
description: 'Divide two values element wise.',
examples: ['a = [1, 2, 3; 4, 5, 6]', 'b = [2, 1, 1; 3, 2, 5]', 'a ./ b'],
seealso: ['multiply', 'dotMultiply', 'divide']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/divide.js
var divideDocs = {
name: 'divide',
category: 'Operators',
syntax: ['x / y', 'divide(x, y)'],
description: 'Divide two values.',
examples: ['a = 2 / 3', 'a * 3', '4.5 / 2', '3 + 4 / 2', '(3 + 4) / 2', '18 km / 4.5'],
seealso: ['multiply']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/cube.js
var cubeDocs = {
name: 'cube',
category: 'Arithmetic',
syntax: ['cube(x)'],
description: 'Compute the cube of a value. The cube of x is x * x * x.',
examples: ['cube(2)', '2^3', '2 * 2 * 2'],
seealso: ['multiply', 'square', 'pow']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/ceil.js
var ceilDocs = {
name: 'ceil',
category: 'Arithmetic',
syntax: ['ceil(x)'],
description: 'Round a value towards plus infinity. If x is complex, both real and imaginary part are rounded towards plus infinity.',
examples: ['ceil(3.2)', 'ceil(3.8)', 'ceil(-4.2)'],
seealso: ['floor', 'fix', 'round']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/cbrt.js
var cbrtDocs = {
name: 'cbrt',
category: 'Arithmetic',
syntax: ['cbrt(x)', 'cbrt(x, allRoots)'],
description: 'Compute the cubic root value. If x = y * y * y, then y is the cubic root of x. When `x` is a number or complex number, an optional second argument `allRoots` can be provided to return all three cubic roots. If not provided, the principal root is returned',
examples: ['cbrt(64)', 'cube(4)', 'cbrt(-8)', 'cbrt(2 + 3i)', 'cbrt(8i)', 'cbrt(8i, true)', 'cbrt(27 m^3)'],
seealso: ['square', 'sqrt', 'cube', 'multiply']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/add.js
var addDocs = {
name: 'add',
category: 'Operators',
syntax: ['x + y', 'add(x, y)'],
description: 'Add two values.',
examples: ['a = 2.1 + 3.6', 'a - 3.6', '3 + 2i', '3 cm + 2 inch', '"2.3" + "4"'],
seealso: ['subtract']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/abs.js
var absDocs = {
name: 'abs',
category: 'Arithmetic',
syntax: ['abs(x)'],
description: 'Compute the absolute value.',
examples: ['abs(3.5)', 'abs(-4.2)'],
seealso: ['sign']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/algebra/qr.js
var qrDocs = {
name: 'qr',
category: 'Algebra',
syntax: ['qr(A)'],
description: 'Calculates the Matrix QR decomposition. Matrix `A` is decomposed in two matrices (`Q`, `R`) where `Q` is an orthogonal matrix and `R` is an upper triangular matrix.',
examples: ['qr([[1, -1, 4], [1, 4, -2], [1, 4, 2], [1, -1, 0]])'],
seealso: ['lup', 'slu', 'matrix']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/algebra/usolve.js
var usolveDocs = {
name: 'usolve',
category: 'Algebra',
syntax: ['x=usolve(U, b)'],
description: 'Solves the linear system U * x = b where U is an [n x n] upper triangular matrix and b is a [n] column vector.',
examples: ['x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])'],
seealso: ['lup', 'lusolve', 'lsolve', 'matrix', 'sparse']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/algebra/slu.js
var sluDocs = {
name: 'slu',
category: 'Algebra',
syntax: ['slu(A, order, threshold)'],
description: 'Calculate the Matrix LU decomposition with full pivoting. Matrix A is decomposed in two matrices (L, U) and two permutation vectors (pinv, q) where P * A * Q = L * U',
examples: ['slu(sparse([4.5, 0, 3.2, 0; 3.1, 2.9, 0, 0.9; 0, 1.7, 3, 0; 3.5, 0.4, 0, 1]), 1, 0.001)'],
seealso: ['lusolve', 'lsolve', 'usolve', 'matrix', 'sparse', 'lup', 'qr']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/algebra/rationalize.js
var rationalizeDocs = {
name: 'rationalize',
category: 'Algebra',
syntax: ['rationalize(expr)', 'rationalize(expr, scope)', 'rationalize(expr, scope, detailed)'],
description: 'Transform a rationalizable expression in a rational fraction. If rational fraction is one variable polynomial then converts the numerator and denominator in canonical form, with decreasing exponents, returning the coefficients of numerator.',
examples: ['rationalize("2x/y - y/(x+1)")', 'rationalize("2x/y - y/(x+1)", true)'],
seealso: ['simplify']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/algebra/simplify.js
var simplifyDocs = {
name: 'simplify',
category: 'Algebra',
syntax: ['simplify(expr)', 'simplify(expr, rules)'],
description: 'Simplify an expression tree.',
examples: ['simplify("3 + 2 / 4")', 'simplify("2x + x")', 'f = parse("x * (x + 2 + x)")', 'simplified = simplify(f)', 'simplified.evaluate({x: 2})'],
seealso: ['derivative', 'parse', 'evaluate']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/algebra/lup.js
var lupDocs = {
name: 'lup',
category: 'Algebra',
syntax: ['lup(m)'],
description: 'Calculate the Matrix LU decomposition with partial pivoting. Matrix A is decomposed in three matrices (L, U, P) where P * A = L * U',
examples: ['lup([[2, 1], [1, 4]])', 'lup(matrix([[2, 1], [1, 4]]))', 'lup(sparse([[2, 1], [1, 4]]))'],
seealso: ['lusolve', 'lsolve', 'usolve', 'matrix', 'sparse', 'slu', 'qr']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/algebra/lsolve.js
var lsolveDocs = {
name: 'lsolve',
category: 'Algebra',
syntax: ['x=lsolve(L, b)'],
description: 'Solves the linear system L * x = b where L is an [n x n] lower triangular matrix and b is a [n] column vector.',
examples: ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lsolve(a, b)'],
seealso: ['lup', 'lusolve', 'usolve', 'matrix', 'sparse']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/algebra/derivative.js
var derivativeDocs = {
name: 'derivative',
category: 'Algebra',
syntax: ['derivative(expr, variable)', 'derivative(expr, variable, {simplify: boolean})'],
description: 'Takes the derivative of an expression expressed in parser Nodes. The derivative will be taken over the supplied variable in the second parameter. If there are multiple variables in the expression, it will return a partial derivative.',
examples: ['derivative("2x^3", "x")', 'derivative("2x^3", "x", {simplify: false})', 'derivative("2x^2 + 3x + 4", "x")', 'derivative("sin(2x)", "x")', 'f = parse("x^2 + x")', 'x = parse("x")', 'df = derivative(f, x)', 'df.evaluate({x: 3})'],
seealso: ['simplify', 'parse', 'evaluate']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/constants/version.js
var versionDocs = {
name: 'version',
category: 'Constants',
syntax: ['version'],
description: 'A string with the version number of math.js',
examples: ['version'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/constants/true.js
var trueDocs = {
name: 'true',
category: 'Constants',
syntax: ['true'],
description: 'Boolean value true',
examples: ['true'],
seealso: ['false']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/constants/tau.js
var tauDocs = {
name: 'tau',
category: 'Constants',
syntax: ['tau'],
description: 'Tau is the ratio constant of a circle\'s circumference to radius, equal to 2 * pi, approximately 6.2832.',
examples: ['tau', '2 * pi'],
seealso: ['pi']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/constants/SQRT2.js
var SQRT2Docs = {
name: 'SQRT2',
category: 'Constants',
syntax: ['SQRT2'],
description: 'Returns the square root of 2, approximately equal to 1.414',
examples: ['SQRT2', 'sqrt(2)'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/constants/SQRT1_2.js
var SQRT12Docs = {
name: 'SQRT1_2',
category: 'Constants',
syntax: ['SQRT1_2'],
description: 'Returns the square root of 1/2, approximately equal to 0.707',
examples: ['SQRT1_2', 'sqrt(1/2)'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/constants/phi.js
var phiDocs = {
name: 'phi',
category: 'Constants',
syntax: ['phi'],
description: 'Phi is the golden ratio. Two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities. Phi is defined as `(1 + sqrt(5)) / 2` and is approximately 1.618034...',
examples: ['phi'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/constants/pi.js
var piDocs = {
name: 'pi',
category: 'Constants',
syntax: ['pi'],
description: 'The number pi is a mathematical constant that is the ratio of a circle\'s circumference to its diameter, and is approximately equal to 3.14159',
examples: ['pi', 'sin(pi/2)'],
seealso: ['tau']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/constants/null.js
var nullDocs = {
name: 'null',
category: 'Constants',
syntax: ['null'],
description: 'Value null',
examples: ['null'],
seealso: ['true', 'false']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/constants/NaN.js
var NaNDocs = {
name: 'NaN',
category: 'Constants',
syntax: ['NaN'],
description: 'Not a number',
examples: ['NaN', '0 / 0'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/constants/LOG10E.js
var LOG10EDocs = {
name: 'LOG10E',
category: 'Constants',
syntax: ['LOG10E'],
description: 'Returns the base-10 logarithm of E, approximately equal to 0.434',
examples: ['LOG10E', 'log(e, 10)'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/constants/LOG2E.js
var LOG2EDocs = {
name: 'LOG2E',
category: 'Constants',
syntax: ['LOG2E'],
description: 'Returns the base-2 logarithm of E, approximately equal to 1.442',
examples: ['LOG2E', 'log(e, 2)'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/constants/LN10.js
var LN10Docs = {
name: 'LN10',
category: 'Constants',
syntax: ['LN10'],
description: 'Returns the natural logarithm of 10, approximately equal to 2.302',
examples: ['LN10', 'log(10)'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/constants/LN2.js
var LN2Docs = {
name: 'LN2',
category: 'Constants',
syntax: ['LN2'],
description: 'Returns the natural logarithm of 2, approximately equal to 0.693',
examples: ['LN2', 'log(2)'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/constants/Infinity.js
var InfinityDocs = {
name: 'Infinity',
category: 'Constants',
syntax: ['Infinity'],
description: 'Infinity, a number which is larger than the maximum number that can be handled by a floating point number.',
examples: ['Infinity', '1 / 0'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/constants/i.js
var iDocs = {
name: 'i',
category: 'Constants',
syntax: ['i'],
description: 'Imaginary unit, defined as i*i=-1. A complex number is described as a + b*i, where a is the real part, and b is the imaginary part.',
examples: ['i', 'i * i', 'sqrt(-1)'],
seealso: []
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/constants/false.js
var falseDocs = {
name: 'false',
category: 'Constants',
syntax: ['false'],
description: 'Boolean value false',
examples: ['false'],
seealso: ['true']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/constants/e.js
var eDocs = {
name: 'e',
category: 'Constants',
syntax: ['e'],
description: 'Euler\'s number, the base of the natural logarithm. Approximately equal to 2.71828',
examples: ['e', 'e ^ 2', 'exp(2)', 'log(e)'],
seealso: ['exp']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/construction/unit.js
var unitDocs = {
name: 'unit',
category: 'Construction',
syntax: ['value unit', 'unit(value, unit)', 'unit(string)'],
description: 'Create a unit.',
examples: ['5.5 mm', '3 inch', 'unit(7.1, "kilogram")', 'unit("23 deg")'],
seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'string']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/construction/string.js
var stringDocs = {
name: 'string',
category: 'Construction',
syntax: ['"text"', 'string(x)'],
description: 'Create a string or convert a value to a string',
examples: ['"Hello World!"', 'string(4.2)', 'string(3 + 2i)'],
seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'unit']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/construction/splitUnit.js
var splitUnitDocs = {
name: 'splitUnit',
category: 'Construction',
syntax: ['splitUnit(unit: Unit, parts: Unit[])'],
description: 'Split a unit in an array of units whose sum is equal to the original unit.',
examples: ['splitUnit(1 m, ["feet", "inch"])'],
seealso: ['unit', 'createUnit']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/construction/sparse.js
var sparseDocs = {
name: 'sparse',
category: 'Construction',
syntax: ['sparse()', 'sparse([a1, b1, ...; a1, b2, ...])', 'sparse([a1, b1, ...; a1, b2, ...], "number")'],
description: 'Create a sparse matrix.',
examples: ['sparse()', 'sparse([3, 4; 5, 6])', 'sparse([3, 0; 5, 0], "number")'],
seealso: ['bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit', 'matrix']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/construction/number.js
var numberDocs = {
name: 'number',
category: 'Construction',
syntax: ['x', 'number(x)', 'number(unit, valuelessUnit)'],
description: 'Create a number or convert a string or boolean into a number.',
examples: ['2', '2e3', '4.05', 'number(2)', 'number("7.2")', 'number(true)', 'number([true, false, true, true])', 'number(unit("52cm"), "m")'],
seealso: ['bignumber', 'boolean', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/construction/matrix.js
var matrixDocs = {
name: 'matrix',
category: 'Construction',
syntax: ['[]', '[a1, b1, ...; a2, b2, ...]', 'matrix()', 'matrix("dense")', 'matrix([...])'],
description: 'Create a matrix.',
examples: ['[]', '[1, 2, 3]', '[1, 2, 3; 4, 5, 6]', 'matrix()', 'matrix([3, 4])', 'matrix([3, 4; 5, 6], "sparse")', 'matrix([3, 4; 5, 6], "sparse", "number")'],
seealso: ['bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit', 'sparse']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/construction/index.js
var indexDocs = {
name: 'index',
category: 'Construction',
syntax: ['[start]', '[start:end]', '[start:step:end]', '[start1, start 2, ...]', '[start1:end1, start2:end2, ...]', '[start1:step1:end1, start2:step2:end2, ...]'],
description: 'Create an index to get or replace a subset of a matrix',
examples: ['[]', '[1, 2, 3]', 'A = [1, 2, 3; 4, 5, 6]', 'A[1, :]', 'A[1, 2] = 50', 'A[0:2, 0:2] = ones(2, 2)'],
seealso: ['bignumber', 'boolean', 'complex', 'matrix,', 'number', 'range', 'string', 'unit']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/construction/fraction.js
var fractionDocs = {
name: 'fraction',
category: 'Construction',
syntax: ['fraction(num)', 'fraction(num,den)'],
description: 'Create a fraction from a number or from a numerator and denominator.',
examples: ['fraction(0.125)', 'fraction(1, 3) + fraction(2, 5)'],
seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'string', 'unit']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/construction/createUnit.js
var createUnitDocs = {
name: 'createUnit',
category: 'Construction',
syntax: ['createUnit(definitions)', 'createUnit(name, definition)'],
description: 'Create a user-defined unit and register it with the Unit type.',
examples: ['createUnit("foo")', 'createUnit("knot", {definition: "0.514444444 m/s", aliases: ["knots", "kt", "kts"]})', 'createUnit("mph", "1 mile/hour")'],
seealso: ['unit', 'splitUnit']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/construction/complex.js
var complexDocs = {
name: 'complex',
category: 'Construction',
syntax: ['complex()', 'complex(re, im)', 'complex(string)'],
description: 'Create a complex number.',
examples: ['complex()', 'complex(2, 3)', 'complex("7 - 2i")'],
seealso: ['bignumber', 'boolean', 'index', 'matrix', 'number', 'string', 'unit']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/construction/boolean.js
var booleanDocs = {
name: 'boolean',
category: 'Construction',
syntax: ['x', 'boolean(x)'],
description: 'Convert a string or number into a boolean.',
examples: ['boolean(0)', 'boolean(1)', 'boolean(3)', 'boolean("true")', 'boolean("false")', 'boolean([1, 0, 1, 1])'],
seealso: ['bignumber', 'complex', 'index', 'matrix', 'number', 'string', 'unit']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/dotPow.js
var dotPowDocs = {
name: 'dotPow',
category: 'Operators',
syntax: ['x .^ y', 'dotPow(x, y)'],
description: 'Calculates the power of x to y element wise.',
examples: ['a = [1, 2, 3; 4, 5, 6]', 'a .^ 2'],
seealso: ['pow']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/algebra/lusolve.js
var lusolveDocs = {
name: 'lusolve',
category: 'Algebra',
syntax: ['x=lusolve(A, b)', 'x=lusolve(lu, b)'],
description: 'Solves the linear system A * x = b where A is an [n x n] matrix and b is a [n] column vector.',
examples: ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lusolve(a, b)'],
seealso: ['lup', 'slu', 'lsolve', 'usolve', 'matrix', 'sparse']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/arithmetic/subtract.js
var subtractDocs = {
name: 'subtract',
category: 'Operators',
syntax: ['x - y', 'subtract(x, y)'],
description: 'subtract two values.',
examples: ['a = 5.3 - 2', 'a + 2', '2/3 - 1/6', '2 * 3 - 3', '2.1 km - 500m'],
seealso: ['add']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/statistics/variance.js
var varianceDocs = {
name: 'variance',
category: 'Statistics',
syntax: ['variance(a, b, c, ...)', 'variance(A)', 'variance(A, normalization)'],
description: 'Compute the variance of all values. Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".',
examples: ['variance(2, 4, 6)', 'variance([2, 4, 6, 8])', 'variance([2, 4, 6, 8], "uncorrected")', 'variance([2, 4, 6, 8], "biased")', 'variance([1, 2, 3; 4, 5, 6])'],
seealso: ['max', 'mean', 'min', 'median', 'min', 'prod', 'std', 'sum']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/trigonometry/sin.js
var sinDocs = {
name: 'sin',
category: 'Trigonometry',
syntax: ['sin(x)'],
description: 'Compute the sine of x in radians.',
examples: ['sin(2)', 'sin(pi / 4) ^ 2', 'sin(90 deg)', 'sin(30 deg)', 'sin(0.2)^2 + cos(0.2)^2'],
seealso: ['asin', 'cos', 'tan']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/utils/numeric.js
var numericDocs = {
name: 'numeric',
category: 'Utils',
syntax: ['numeric(x)'],
description: 'Convert a numeric input to a specific numeric type: number, BigNumber, or Fraction.',
examples: ['numeric("4")', 'numeric("4", "number")', 'numeric("4", "BigNumber")', 'numeric("4", "Fraction)', 'numeric(4, "Fraction")', 'numeric(fraction(2, 5), "number)'],
seealso: ['number', 'fraction', 'bignumber', 'string', 'format']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/column.js
var columnDocs = {
name: 'column',
category: 'Matrix',
syntax: ['column(x, index)'],
description: 'Return a column from a matrix or array.',
examples: ['A = [[1, 2], [3, 4]]', 'column(A, 1)', 'column(A, 2)'],
seealso: ['row']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/function/matrix/row.js
var rowDocs = {
name: 'row',
category: 'Matrix',
syntax: ['row(x, index)'],
description: 'Return a row from a matrix or array.',
examples: ['A = [[1, 2], [3, 4]]', 'row(A, 1)', 'row(A, 2)'],
seealso: ['column']
};
// CONCATENATED MODULE: ./src/expression/embeddedDocs/embeddedDocs.js
var embeddedDocs = {
// construction functions
bignumber: bignumberDocs,
"boolean": booleanDocs,
complex: complexDocs,
createUnit: createUnitDocs,
fraction: fractionDocs,
index: indexDocs,
matrix: matrixDocs,
number: numberDocs,
sparse: sparseDocs,
splitUnit: splitUnitDocs,
string: stringDocs,
unit: unitDocs,
// constants
e: eDocs,
E: eDocs,
"false": falseDocs,
i: iDocs,
Infinity: InfinityDocs,
LN2: LN2Docs,
LN10: LN10Docs,
LOG2E: LOG2EDocs,
LOG10E: LOG10EDocs,
NaN: NaNDocs,
"null": nullDocs,
pi: piDocs,
PI: piDocs,
phi: phiDocs,
SQRT1_2: SQRT12Docs,
SQRT2: SQRT2Docs,
tau: tauDocs,
"true": trueDocs,
version: versionDocs,
// physical constants
// TODO: more detailed docs for physical constants
speedOfLight: {
description: 'Speed of light in vacuum',
examples: ['speedOfLight']
},
gravitationConstant: {
description: 'Newtonian constant of gravitation',
examples: ['gravitationConstant']
},
planckConstant: {
description: 'Planck constant',
examples: ['planckConstant']
},
reducedPlanckConstant: {
description: 'Reduced Planck constant',
examples: ['reducedPlanckConstant']
},
magneticConstant: {
description: 'Magnetic constant (vacuum permeability)',
examples: ['magneticConstant']
},
electricConstant: {
description: 'Electric constant (vacuum permeability)',
examples: ['electricConstant']
},
vacuumImpedance: {
description: 'Characteristic impedance of vacuum',
examples: ['vacuumImpedance']
},
coulomb: {
description: 'Coulomb\'s constant',
examples: ['coulomb']
},
elementaryCharge: {
description: 'Elementary charge',
examples: ['elementaryCharge']
},
bohrMagneton: {
description: 'Borh magneton',
examples: ['bohrMagneton']
},
conductanceQuantum: {
description: 'Conductance quantum',
examples: ['conductanceQuantum']
},
inverseConductanceQuantum: {
description: 'Inverse conductance quantum',
examples: ['inverseConductanceQuantum']
},
// josephson: {description: 'Josephson constant', examples: ['josephson']},
magneticFluxQuantum: {
description: 'Magnetic flux quantum',
examples: ['magneticFluxQuantum']
},
nuclearMagneton: {
description: 'Nuclear magneton',
examples: ['nuclearMagneton']
},
klitzing: {
description: 'Von Klitzing constant',
examples: ['klitzing']
},
bohrRadius: {
description: 'Borh radius',
examples: ['bohrRadius']
},
classicalElectronRadius: {
description: 'Classical electron radius',
examples: ['classicalElectronRadius']
},
electronMass: {
description: 'Electron mass',
examples: ['electronMass']
},
fermiCoupling: {
description: 'Fermi coupling constant',
examples: ['fermiCoupling']
},
fineStructure: {
description: 'Fine-structure constant',
examples: ['fineStructure']
},
hartreeEnergy: {
description: 'Hartree energy',
examples: ['hartreeEnergy']
},
protonMass: {
description: 'Proton mass',
examples: ['protonMass']
},
deuteronMass: {
description: 'Deuteron Mass',
examples: ['deuteronMass']
},
neutronMass: {
description: 'Neutron mass',
examples: ['neutronMass']
},
quantumOfCirculation: {
description: 'Quantum of circulation',
examples: ['quantumOfCirculation']
},
rydberg: {
description: 'Rydberg constant',
examples: ['rydberg']
},
thomsonCrossSection: {
description: 'Thomson cross section',
examples: ['thomsonCrossSection']
},
weakMixingAngle: {
description: 'Weak mixing angle',
examples: ['weakMixingAngle']
},
efimovFactor: {
description: 'Efimov factor',
examples: ['efimovFactor']
},
atomicMass: {
description: 'Atomic mass constant',
examples: ['atomicMass']
},
avogadro: {
description: 'Avogadro\'s number',
examples: ['avogadro']
},
boltzmann: {
description: 'Boltzmann constant',
examples: ['boltzmann']
},
faraday: {
description: 'Faraday constant',
examples: ['faraday']
},
firstRadiation: {
description: 'First radiation constant',
examples: ['firstRadiation']
},
loschmidt: {
description: 'Loschmidt constant at T=273.15 K and p=101.325 kPa',
examples: ['loschmidt']
},
gasConstant: {
description: 'Gas constant',
examples: ['gasConstant']
},
molarPlanckConstant: {
description: 'Molar Planck constant',
examples: ['molarPlanckConstant']
},
molarVolume: {
description: 'Molar volume of an ideal gas at T=273.15 K and p=101.325 kPa',
examples: ['molarVolume']
},
sackurTetrode: {
description: 'Sackur-Tetrode constant at T=1 K and p=101.325 kPa',
examples: ['sackurTetrode']
},
secondRadiation: {
description: 'Second radiation constant',
examples: ['secondRadiation']
},
stefanBoltzmann: {
description: 'Stefan-Boltzmann constant',
examples: ['stefanBoltzmann']
},
wienDisplacement: {
description: 'Wien displacement law constant',
examples: ['wienDisplacement']
},
// spectralRadiance: {description: 'First radiation constant for spectral radiance', examples: ['spectralRadiance']},
molarMass: {
description: 'Molar mass constant',
examples: ['molarMass']
},
molarMassC12: {
description: 'Molar mass constant of carbon-12',
examples: ['molarMassC12']
},
gravity: {
description: 'Standard acceleration of gravity (standard acceleration of free-fall on Earth)',
examples: ['gravity']
},
planckLength: {
description: 'Planck length',
examples: ['planckLength']
},
planckMass: {
description: 'Planck mass',
examples: ['planckMass']
},
planckTime: {
description: 'Planck time',
examples: ['planckTime']
},
planckCharge: {
description: 'Planck charge',
examples: ['planckCharge']
},
planckTemperature: {
description: 'Planck temperature',
examples: ['planckTemperature']
},
// functions - algebra
derivative: derivativeDocs,
lsolve: lsolveDocs,
lup: lupDocs,
lusolve: lusolveDocs,
simplify: simplifyDocs,
rationalize: rationalizeDocs,
slu: sluDocs,
usolve: usolveDocs,
qr: qrDocs,
// functions - arithmetic
abs: absDocs,
add: addDocs,
cbrt: cbrtDocs,
ceil: ceilDocs,
cube: cubeDocs,
divide: divideDocs,
dotDivide: dotDivideDocs,
dotMultiply: dotMultiplyDocs,
dotPow: dotPowDocs,
exp: expDocs,
expm: expmDocs,
expm1: expm1Docs,
fix: fixDocs,
floor: floorDocs,
gcd: gcdDocs,
hypot: hypotDocs,
lcm: lcmDocs,
log: logDocs,
log2: log2Docs,
log1p: log1pDocs,
log10: log10Docs,
mod: modDocs,
multiply: multiplyDocs,
norm: normDocs,
nthRoot: nthRootDocs,
nthRoots: nthRootsDocs,
pow: powDocs,
round: roundDocs,
sign: signDocs,
sqrt: sqrtDocs,
sqrtm: sqrtmDocs,
square: squareDocs,
subtract: subtractDocs,
unaryMinus: unaryMinusDocs,
unaryPlus: unaryPlusDocs,
xgcd: xgcdDocs,
// functions - bitwise
bitAnd: bitAndDocs,
bitNot: bitNotDocs,
bitOr: bitOrDocs,
bitXor: bitXorDocs,
leftShift: leftShiftDocs,
rightArithShift: rightArithShiftDocs,
rightLogShift: rightLogShiftDocs,
// functions - combinatorics
bellNumbers: bellNumbersDocs,
catalan: catalanDocs,
composition: compositionDocs,
stirlingS2: stirlingS2Docs,
// functions - core
config: configDocs,
"import": importDocs,
typed: typedDocs,
// functions - complex
arg: argDocs,
conj: conjDocs,
re: reDocs,
im: imDocs,
// functions - expression
evaluate: evaluateDocs,
help: helpDocs,
// functions - geometry
distance: distanceDocs,
intersect: intersectDocs,
// functions - logical
and: andDocs,
not: notDocs,
or: orDocs,
xor: xorDocs,
// functions - matrix
concat: concatDocs,
cross: crossDocs,
column: columnDocs,
ctranspose: ctransposeDocs,
det: detDocs,
diag: diagDocs,
dot: dotDocs,
getMatrixDataType: getMatrixDataTypeDocs,
identity: identityDocs,
filter: filterDocs,
flatten: flattenDocs,
forEach: forEachDocs,
inv: invDocs,
eigs: eigsDocs,
kron: kronDocs,
map: mapDocs,
ones: onesDocs,
partitionSelect: partitionSelectDocs,
range: rangeDocs,
resize: resizeDocs,
reshape: reshapeDocs,
row: rowDocs,
size: sizeDocs,
sort: sortDocs,
squeeze: squeezeDocs,
subset: subsetDocs,
trace: traceDocs,
transpose: transposeDocs,
zeros: zerosDocs,
// functions - probability
combinations: combinationsDocs,
combinationsWithRep: combinationsWithRepDocs,
// distribution: distributionDocs,
factorial: factorialDocs,
gamma: gammaDocs,
kldivergence: kldivergenceDocs,
multinomial: multinomialDocs,
permutations: permutationsDocs,
pickRandom: pickRandomDocs,
random: randomDocs,
randomInt: randomIntDocs,
// functions - relational
compare: compareDocs,
compareNatural: compareNaturalDocs,
compareText: compareTextDocs,
deepEqual: deepEqualDocs,
equal: equalDocs,
equalText: equalTextDocs,
larger: largerDocs,
largerEq: largerEqDocs,
smaller: smallerDocs,
smallerEq: smallerEqDocs,
unequal: unequalDocs,
// functions - set
setCartesian: setCartesianDocs,
setDifference: setDifferenceDocs,
setDistinct: setDistinctDocs,
setIntersect: setIntersectDocs,
setIsSubset: setIsSubsetDocs,
setMultiplicity: setMultiplicityDocs,
setPowerset: setPowersetDocs,
setSize: setSizeDocs,
setSymDifference: setSymDifferenceDocs,
setUnion: setUnionDocs,
// functions - special
erf: erfDocs,
// functions - statistics
mad: madDocs,
max: maxDocs,
mean: meanDocs,
median: medianDocs,
min: minDocs,
mode: modeDocs,
prod: prodDocs,
quantileSeq: quantileSeqDocs,
std: stdDocs,
sum: sumDocs,
variance: varianceDocs,
// functions - trigonometry
acos: acosDocs,
acosh: acoshDocs,
acot: acotDocs,
acoth: acothDocs,
acsc: acscDocs,
acsch: acschDocs,
asec: asecDocs,
asech: asechDocs,
asin: asinDocs,
asinh: asinhDocs,
atan: atanDocs,
atanh: atanhDocs,
atan2: atan2Docs,
cos: cosDocs,
cosh: coshDocs,
cot: cotDocs,
coth: cothDocs,
csc: cscDocs,
csch: cschDocs,
sec: secDocs,
sech: sechDocs,
sin: sinDocs,
sinh: sinhDocs,
tan: tanDocs,
tanh: tanhDocs,
// functions - units
to: toDocs,
// functions - utils
clone: cloneDocs,
format: formatDocs,
isNaN: isNaNDocs,
isInteger: isIntegerDocs,
isNegative: isNegativeDocs,
isNumeric: isNumericDocs,
hasNumericValue: hasNumericValueDocs,
isPositive: isPositiveDocs,
isPrime: isPrimeDocs,
isZero: isZeroDocs,
// print: printDocs // TODO: add documentation for print as soon as the parser supports objects.
typeOf: typeOfDocs,
numeric: numericDocs
};
// CONCATENATED MODULE: ./src/expression/function/help.js
var help_name = 'help';
var help_dependencies = ['typed', 'mathWithTransform', 'Help'];
var createHelp = /* #__PURE__ */Object(factory["a" /* factory */])(help_name, help_dependencies, function (_ref) {
var typed = _ref.typed,
mathWithTransform = _ref.mathWithTransform,
Help = _ref.Help;
/**
* Retrieve help on a function or data type.
* Help files are retrieved from the embedded documentation in math.docs.
*
* Syntax:
*
* math.help(search)
*
* Examples:
*
* console.log(math.help('sin').toString())
* console.log(math.help(math.add).toString())
* console.log(math.help(math.add).toJSON())
*
* @param {Function | string | Object} search A function or function name
* for which to get help
* @return {Help} A help object
*/
return typed(help_name, {
any: function any(search) {
var prop;
var searchName = search;
if (typeof search !== 'string') {
for (prop in mathWithTransform) {
// search in functions and constants
if (Object(utils_object["f" /* hasOwnProperty */])(mathWithTransform, prop) && search === mathWithTransform[prop]) {
searchName = prop;
break;
}
}
/* TODO: implement help for data types
if (!text) {
// search data type
for (prop in math.type) {
if (hasOwnProperty(math, prop)) {
if (search === math.type[prop]) {
text = prop
break
}
}
}
}
*/
}
var doc = getSafeProperty(embeddedDocs, searchName);
if (!doc) {
var searchText = typeof searchName === 'function' ? searchName.name : searchName;
throw new Error('No documentation found on "' + searchText + '"');
}
return new Help(doc);
}
});
});
// CONCATENATED MODULE: ./src/type/chain/function/chain.js
var chain_name = 'chain';
var chain_dependencies = ['typed', 'Chain'];
var createChain = /* #__PURE__ */Object(factory["a" /* factory */])(chain_name, chain_dependencies, function (_ref) {
var typed = _ref.typed,
Chain = _ref.Chain;
/**
* Wrap any value in a chain, allowing to perform chained operations on
* the value.
*
* All methods available in the math.js library can be called upon the chain,
* and then will be evaluated with the value itself as first argument.
* The chain can be closed by executing `chain.done()`, which returns
* the final value.
*
* The chain has a number of special functions:
*
* - `done()` Finalize the chain and return the chain's value.
* - `valueOf()` The same as `done()`
* - `toString()` Executes `math.format()` onto the chain's value, returning
* a string representation of the value.
*
* Syntax:
*
* math.chain(value)
*
* Examples:
*
* math.chain(3)
* .add(4)
* .subtract(2)
* .done() // 5
*
* math.chain( [[1, 2], [3, 4]] )
* .subset(math.index(0, 0), 8)
* .multiply(3)
* .done() // [[24, 6], [9, 12]]
*
* @param {*} [value] A value of any type on which to start a chained operation.
* @return {math.Chain} The created chain
*/
return typed(chain_name, {
'': function _() {
return new Chain();
},
any: function any(value) {
return new Chain(value);
}
});
});
// CONCATENATED MODULE: ./src/function/matrix/det.js
var det_name = 'det';
var det_dependencies = ['typed', 'matrix', 'subtract', 'multiply', 'unaryMinus', 'lup'];
var createDet = /* #__PURE__ */Object(factory["a" /* factory */])(det_name, det_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
subtract = _ref.subtract,
multiply = _ref.multiply,
unaryMinus = _ref.unaryMinus,
lup = _ref.lup;
/**
* Calculate the determinant of a matrix.
*
* Syntax:
*
* math.det(x)
*
* Examples:
*
* math.det([[1, 2], [3, 4]]) // returns -2
*
* const A = [
* [-2, 2, 3],
* [-1, 1, 3],
* [2, 0, -1]
* ]
* math.det(A) // returns 6
*
* See also:
*
* inv
*
* @param {Array | Matrix} x A matrix
* @return {number} The determinant of `x`
*/
return typed(det_name, {
any: function any(x) {
return Object(utils_object["a" /* clone */])(x);
},
'Array | Matrix': function det(x) {
var size;
if (Object(is["v" /* isMatrix */])(x)) {
size = x.size();
} else if (Array.isArray(x)) {
x = matrix(x);
size = x.size();
} else {
// a scalar
size = [];
}
switch (size.length) {
case 0:
// scalar
return Object(utils_object["a" /* clone */])(x);
case 1:
// vector
if (size[0] === 1) {
return Object(utils_object["a" /* clone */])(x.valueOf()[0]);
} else {
throw new RangeError('Matrix must be square ' + '(size: ' + Object(utils_string["d" /* format */])(size) + ')');
}
case 2:
{
// two dimensional array
var rows = size[0];
var cols = size[1];
if (rows === cols) {
return _det(x.clone().valueOf(), rows, cols);
} else {
throw new RangeError('Matrix must be square ' + '(size: ' + Object(utils_string["d" /* format */])(size) + ')');
}
}
default:
// multi dimensional array
throw new RangeError('Matrix must be two dimensional ' + '(size: ' + Object(utils_string["d" /* format */])(size) + ')');
}
}
});
/**
* Calculate the determinant of a matrix
* @param {Array[]} matrix A square, two dimensional matrix
* @param {number} rows Number of rows of the matrix (zero-based)
* @param {number} cols Number of columns of the matrix (zero-based)
* @returns {number} det
* @private
*/
function _det(matrix, rows, cols) {
if (rows === 1) {
// this is a 1 x 1 matrix
return Object(utils_object["a" /* clone */])(matrix[0][0]);
} else if (rows === 2) {
// this is a 2 x 2 matrix
// the determinant of [a11,a12;a21,a22] is det = a11*a22-a21*a12
return subtract(multiply(matrix[0][0], matrix[1][1]), multiply(matrix[1][0], matrix[0][1]));
} else {
// Compute the LU decomposition
var decomp = lup(matrix); // The determinant is the product of the diagonal entries of U (and those of L, but they are all 1)
var det = decomp.U[0][0];
for (var _i = 1; _i < rows; _i++) {
det = multiply(det, decomp.U[_i][_i]);
} // The determinant will be multiplied by 1 or -1 depending on the parity of the permutation matrix.
// This can be determined by counting the cycles. This is roughly a linear time algorithm.
var evenCycles = 0;
var i = 0;
var visited = [];
while (true) {
while (visited[i]) {
i++;
}
if (i >= rows) break;
var j = i;
var cycleLen = 0;
while (!visited[decomp.p[j]]) {
visited[decomp.p[j]] = true;
j = decomp.p[j];
cycleLen++;
}
if (cycleLen % 2 === 0) {
evenCycles++;
}
}
return evenCycles % 2 === 0 ? det : unaryMinus(det);
}
}
});
// CONCATENATED MODULE: ./src/function/matrix/inv.js
var inv_name = 'inv';
var inv_dependencies = ['typed', 'matrix', 'divideScalar', 'addScalar', 'multiply', 'unaryMinus', 'det', 'identity', 'abs'];
var createInv = /* #__PURE__ */Object(factory["a" /* factory */])(inv_name, inv_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
divideScalar = _ref.divideScalar,
addScalar = _ref.addScalar,
multiply = _ref.multiply,
unaryMinus = _ref.unaryMinus,
det = _ref.det,
identity = _ref.identity,
abs = _ref.abs;
/**
* Calculate the inverse of a square matrix.
*
* Syntax:
*
* math.inv(x)
*
* Examples:
*
* math.inv([[1, 2], [3, 4]]) // returns [[-2, 1], [1.5, -0.5]]
* math.inv(4) // returns 0.25
* 1 / 4 // returns 0.25
*
* See also:
*
* det, transpose
*
* @param {number | Complex | Array | Matrix} x Matrix to be inversed
* @return {number | Complex | Array | Matrix} The inverse of `x`.
*/
return typed(inv_name, {
'Array | Matrix': function ArrayMatrix(x) {
var size = Object(is["v" /* isMatrix */])(x) ? x.size() : Object(utils_array["a" /* arraySize */])(x);
switch (size.length) {
case 1:
// vector
if (size[0] === 1) {
if (Object(is["v" /* isMatrix */])(x)) {
return matrix([divideScalar(1, x.valueOf()[0])]);
} else {
return [divideScalar(1, x[0])];
}
} else {
throw new RangeError('Matrix must be square ' + '(size: ' + Object(utils_string["d" /* format */])(size) + ')');
}
case 2:
// two dimensional array
{
var rows = size[0];
var cols = size[1];
if (rows === cols) {
if (Object(is["v" /* isMatrix */])(x)) {
return matrix(_inv(x.valueOf(), rows, cols), x.storage());
} else {
// return an Array
return _inv(x, rows, cols);
}
} else {
throw new RangeError('Matrix must be square ' + '(size: ' + Object(utils_string["d" /* format */])(size) + ')');
}
}
default:
// multi dimensional array
throw new RangeError('Matrix must be two dimensional ' + '(size: ' + Object(utils_string["d" /* format */])(size) + ')');
}
},
any: function any(x) {
// scalar
return divideScalar(1, x); // FIXME: create a BigNumber one when configured for bignumbers
}
});
/**
* Calculate the inverse of a square matrix
* @param {Array[]} mat A square matrix
* @param {number} rows Number of rows
* @param {number} cols Number of columns, must equal rows
* @return {Array[]} inv Inverse matrix
* @private
*/
function _inv(mat, rows, cols) {
var r, s, f, value, temp;
if (rows === 1) {
// this is a 1 x 1 matrix
value = mat[0][0];
if (value === 0) {
throw Error('Cannot calculate inverse, determinant is zero');
}
return [[divideScalar(1, value)]];
} else if (rows === 2) {
// this is a 2 x 2 matrix
var d = det(mat);
if (d === 0) {
throw Error('Cannot calculate inverse, determinant is zero');
}
return [[divideScalar(mat[1][1], d), divideScalar(unaryMinus(mat[0][1]), d)], [divideScalar(unaryMinus(mat[1][0]), d), divideScalar(mat[0][0], d)]];
} else {
// this is a matrix of 3 x 3 or larger
// calculate inverse using gauss-jordan elimination
// https://en.wikipedia.org/wiki/Gaussian_elimination
// http://mathworld.wolfram.com/MatrixInverse.html
// http://math.uww.edu/~mcfarlat/inverse.htm
// make a copy of the matrix (only the arrays, not of the elements)
var A = mat.concat();
for (r = 0; r < rows; r++) {
A[r] = A[r].concat();
} // create an identity matrix which in the end will contain the
// matrix inverse
var B = identity(rows).valueOf(); // loop over all columns, and perform row reductions
for (var c = 0; c < cols; c++) {
// Pivoting: Swap row c with row r, where row r contains the largest element A[r][c]
var ABig = abs(A[c][c]);
var rBig = c;
r = c + 1;
while (r < rows) {
if (abs(A[r][c]) > ABig) {
ABig = abs(A[r][c]);
rBig = r;
}
r++;
}
if (ABig === 0) {
throw Error('Cannot calculate inverse, determinant is zero');
}
r = rBig;
if (r !== c) {
temp = A[c];
A[c] = A[r];
A[r] = temp;
temp = B[c];
B[c] = B[r];
B[r] = temp;
} // eliminate non-zero values on the other rows at column c
var Ac = A[c];
var Bc = B[c];
for (r = 0; r < rows; r++) {
var Ar = A[r];
var Br = B[r];
if (r !== c) {
// eliminate value at column c and row r
if (Ar[c] !== 0) {
f = divideScalar(unaryMinus(Ar[c]), Ac[c]); // add (f * row c) to row r to eliminate the value
// at column c
for (s = c; s < cols; s++) {
Ar[s] = addScalar(Ar[s], multiply(f, Ac[s]));
}
for (s = 0; s < cols; s++) {
Br[s] = addScalar(Br[s], multiply(f, Bc[s]));
}
}
} else {
// normalize value at Acc to 1,
// divide each value on row r with the value at Acc
f = Ac[c];
for (s = c; s < cols; s++) {
Ar[s] = divideScalar(Ar[s], f);
}
for (s = 0; s < cols; s++) {
Br[s] = divideScalar(Br[s], f);
}
}
}
}
return B;
}
}
});
// CONCATENATED MODULE: ./src/function/matrix/eigs.js
var eigs_name = 'eigs';
var eigs_dependencies = ['config', 'typed', 'matrix', 'addScalar', 'equal', 'subtract', 'abs', 'atan', 'cos', 'sin', 'multiplyScalar', 'inv', 'bignumber', 'multiply', 'add'];
var createEigs = /* #__PURE__ */Object(factory["a" /* factory */])(eigs_name, eigs_dependencies, function (_ref) {
var config = _ref.config,
typed = _ref.typed,
matrix = _ref.matrix,
addScalar = _ref.addScalar,
subtract = _ref.subtract,
equal = _ref.equal,
abs = _ref.abs,
atan = _ref.atan,
cos = _ref.cos,
sin = _ref.sin,
multiplyScalar = _ref.multiplyScalar,
inv = _ref.inv,
bignumber = _ref.bignumber,
multiply = _ref.multiply,
add = _ref.add;
/**
* Compute eigenvalue and eigenvector of a real symmetric matrix.
* Only applicable to two dimensional symmetric matrices. Uses Jacobi
* Algorithm. Matrix containing mixed type ('number', 'bignumber', 'fraction')
* of elements are not supported. Input matrix or 2D array should contain all elements
* of either 'number', 'bignumber' or 'fraction' type. For 'number' and 'fraction', the
* eigenvalues are of 'number' type. For 'bignumber' the eigenvalues are of ''bignumber' type.
* Eigenvectors are always of 'number' type.
*
* Syntax:
*
* math.eigs(x)
*
* Examples:
*
* const H = [[5, 2.3], [2.3, 1]]
* const ans = math.eigs(H) // returns {values: [E1,E2...sorted], vectors: [v1,v2.... corresponding vectors as columns]}
* const E = ans.values
* const U = ans.vectors
* math.multiply(H, math.column(U, 0)) // returns math.multiply(E[0], math.column(U, 0))
* const UTxHxU = math.multiply(math.transpose(U), H, U) // rotates H to the eigen-representation
* E[0] == UTxHxU[0][0] // returns true
* See also:
*
* inv
*
* @param {Array | Matrix} x Matrix to be diagonalized
* @return {{values: Array, vectors: Array} | {values: Matrix, vectors: Matrix}} Object containing eigenvalues (Array or Matrix) and eigenvectors (2D Array/Matrix with eigenvectors as columns).
*/
return typed('eigs', {
Array: function Array(x) {
// check array size
var mat = matrix(x);
var size = mat.size();
if (size.length !== 2 || size[0] !== size[1]) {
throw new RangeError('Matrix must be square ' + '(size: ' + Object(utils_string["d" /* format */])(size) + ')');
} // use dense 2D matrix implementation
var ans = checkAndSubmit(mat, size[0]);
return {
values: ans[0],
vectors: ans[1]
};
},
Matrix: function Matrix(x) {
// use dense 2D array implementation
// dense matrix
var size = x.size();
if (size.length !== 2 || size[0] !== size[1]) {
throw new RangeError('Matrix must be square ' + '(size: ' + Object(utils_string["d" /* format */])(size) + ')');
}
var ans = checkAndSubmit(x, size[0]);
return {
values: matrix(ans[0]),
vectors: matrix(ans[1])
};
}
}); // Is the matrix
// symmetric ?
function isSymmetric(x, n) {
for (var i = 0; i < n; i++) {
for (var j = i; j < n; j++) {
// not symmtric
if (!equal(x[i][j], x[j][i])) {
throw new TypeError('Input matrix is not symmetric');
}
}
}
} // check input for possible problems
// and perform diagonalization efficiently for
// specific type of number
function checkAndSubmit(x, n) {
var type = x.datatype(); // type check
if (type === undefined) {
type = x.getDataType();
}
if (type !== 'number' && type !== 'BigNumber' && type !== 'Fraction') {
if (type === 'mixed') {
throw new TypeError('Mixed matrix element type is not supported');
} else {
throw new TypeError('Matrix element type not supported (' + type + ')');
}
} else {
isSymmetric(x.toArray(), n);
} // perform efficient calculation for 'numbers'
if (type === 'number') {
return diag(x.toArray());
} else if (type === 'Fraction') {
var xArr = x.toArray(); // convert fraction to numbers
for (var i = 0; i < n; i++) {
for (var j = i; j < n; j++) {
xArr[i][j] = xArr[i][j].valueOf();
xArr[j][i] = xArr[i][j];
}
}
return diag(x.toArray());
} else if (type === 'BigNumber') {
return diagBig(x.toArray());
}
} // diagonalization implementation for number (efficient)
function diag(x) {
var N = x.length;
var e0 = Math.abs(config.epsilon / N);
var psi;
var Sij = new Array(N); // Sij is Identity Matrix
for (var i = 0; i < N; i++) {
Sij[i] = createArray(N, 0);
Sij[i][i] = 1.0;
} // initial error
var Vab = getAij(x);
while (Math.abs(Vab[1]) >= Math.abs(e0)) {
var _i = Vab[0][0];
var j = Vab[0][1];
psi = getTheta(x[_i][_i], x[j][j], x[_i][j]);
x = x1(x, psi, _i, j);
Sij = Sij1(Sij, psi, _i, j);
Vab = getAij(x);
}
var Ei = createArray(N, 0); // eigenvalues
for (var _i2 = 0; _i2 < N; _i2++) {
Ei[_i2] = x[_i2][_i2];
}
return sorting(Object(utils_object["a" /* clone */])(Ei), Object(utils_object["a" /* clone */])(Sij));
} // diagonalization implementation for bigNumber
function diagBig(x) {
var N = x.length;
var e0 = abs(config.epsilon / N);
var psi;
var Sij = new Array(N); // Sij is Identity Matrix
for (var i = 0; i < N; i++) {
Sij[i] = createArray(N, 0);
Sij[i][i] = 1.0;
} // initial error
var Vab = getAijBig(x);
while (abs(Vab[1]) >= abs(e0)) {
var _i3 = Vab[0][0];
var j = Vab[0][1];
psi = getThetaBig(x[_i3][_i3], x[j][j], x[_i3][j]);
x = x1Big(x, psi, _i3, j);
Sij = Sij1Big(Sij, psi, _i3, j);
Vab = getAijBig(x);
}
var Ei = createArray(N, 0); // eigenvalues
for (var _i4 = 0; _i4 < N; _i4++) {
Ei[_i4] = x[_i4][_i4];
} // return [clone(Ei), clone(Sij)]
return sorting(Object(utils_object["a" /* clone */])(Ei), Object(utils_object["a" /* clone */])(Sij));
} // get angle
function getTheta(aii, ajj, aij) {
var denom = ajj - aii;
if (Math.abs(denom) <= config.epsilon) {
return Math.PI / 4;
} else {
return 0.5 * Math.atan(2 * aij / (ajj - aii));
}
} // get angle
function getThetaBig(aii, ajj, aij) {
var denom = subtract(ajj, aii);
if (abs(denom) <= config.epsilon) {
return bignumber(-1).acos().div(4);
} else {
return multiplyScalar(0.5, atan(multiply(2, aij, inv(denom))));
}
} // update eigvec
function Sij1(Sij, theta, i, j) {
var N = Sij.length;
var c = Math.cos(theta);
var s = Math.sin(theta);
var Ski = createArray(N, 0);
var Skj = createArray(N, 0);
for (var k = 0; k < N; k++) {
Ski[k] = c * Sij[k][i] - s * Sij[k][j];
Skj[k] = s * Sij[k][i] + c * Sij[k][j];
}
for (var _k = 0; _k < N; _k++) {
Sij[_k][i] = Ski[_k];
Sij[_k][j] = Skj[_k];
}
return Sij;
} // update eigvec for overlap
function Sij1Big(Sij, theta, i, j) {
var N = Sij.length;
var c = cos(theta);
var s = sin(theta);
var Ski = createArray(N, bignumber(0));
var Skj = createArray(N, bignumber(0));
for (var k = 0; k < N; k++) {
Ski[k] = subtract(multiplyScalar(c, Sij[k][i]), multiplyScalar(s, Sij[k][j]));
Skj[k] = addScalar(multiplyScalar(s, Sij[k][i]), multiplyScalar(c, Sij[k][j]));
}
for (var _k2 = 0; _k2 < N; _k2++) {
Sij[_k2][i] = Ski[_k2];
Sij[_k2][j] = Skj[_k2];
}
return Sij;
} // update matrix
function x1Big(Hij, theta, i, j) {
var N = Hij.length;
var c = bignumber(cos(theta));
var s = bignumber(sin(theta));
var c2 = multiplyScalar(c, c);
var s2 = multiplyScalar(s, s);
var Aki = createArray(N, bignumber(0));
var Akj = createArray(N, bignumber(0)); // 2cs Hij
var csHij = multiply(bignumber(2), c, s, Hij[i][j]); // Aii
var Aii = addScalar(subtract(multiplyScalar(c2, Hij[i][i]), csHij), multiplyScalar(s2, Hij[j][j]));
var Ajj = add(multiplyScalar(s2, Hij[i][i]), csHij, multiplyScalar(c2, Hij[j][j])); // 0 to i
for (var k = 0; k < N; k++) {
Aki[k] = subtract(multiplyScalar(c, Hij[i][k]), multiplyScalar(s, Hij[j][k]));
Akj[k] = addScalar(multiplyScalar(s, Hij[i][k]), multiplyScalar(c, Hij[j][k]));
} // Modify Hij
Hij[i][i] = Aii;
Hij[j][j] = Ajj;
Hij[i][j] = bignumber(0);
Hij[j][i] = bignumber(0); // 0 to i
for (var _k3 = 0; _k3 < N; _k3++) {
if (_k3 !== i && _k3 !== j) {
Hij[i][_k3] = Aki[_k3];
Hij[_k3][i] = Aki[_k3];
Hij[j][_k3] = Akj[_k3];
Hij[_k3][j] = Akj[_k3];
}
}
return Hij;
} // update matrix
function x1(Hij, theta, i, j) {
var N = Hij.length;
var c = Math.cos(theta);
var s = Math.sin(theta);
var c2 = c * c;
var s2 = s * s;
var Aki = createArray(N, 0);
var Akj = createArray(N, 0); // Aii
var Aii = c2 * Hij[i][i] - 2 * c * s * Hij[i][j] + s2 * Hij[j][j];
var Ajj = s2 * Hij[i][i] + 2 * c * s * Hij[i][j] + c2 * Hij[j][j]; // 0 to i
for (var k = 0; k < N; k++) {
Aki[k] = c * Hij[i][k] - s * Hij[j][k];
Akj[k] = s * Hij[i][k] + c * Hij[j][k];
} // Modify Hij
Hij[i][i] = Aii;
Hij[j][j] = Ajj;
Hij[i][j] = 0;
Hij[j][i] = 0; // 0 to i
for (var _k4 = 0; _k4 < N; _k4++) {
if (_k4 !== i && _k4 !== j) {
Hij[i][_k4] = Aki[_k4];
Hij[_k4][i] = Aki[_k4];
Hij[j][_k4] = Akj[_k4];
Hij[_k4][j] = Akj[_k4];
}
}
return Hij;
} // get max off-diagonal value from Upper Diagonal
function getAij(Mij) {
var N = Mij.length;
var maxMij = 0;
var maxIJ = [0, 1];
for (var i = 0; i < N; i++) {
for (var j = i + 1; j < N; j++) {
if (Math.abs(maxMij) < Math.abs(Mij[i][j])) {
maxMij = Math.abs(Mij[i][j]);
maxIJ = [i, j];
}
}
}
return [maxIJ, maxMij];
} // get max off-diagonal value from Upper Diagonal
function getAijBig(Mij) {
var N = Mij.length;
var maxMij = 0;
var maxIJ = [0, 1];
for (var i = 0; i < N; i++) {
for (var j = i + 1; j < N; j++) {
if (abs(maxMij) < abs(Mij[i][j])) {
maxMij = abs(Mij[i][j]);
maxIJ = [i, j];
}
}
}
return [maxIJ, maxMij];
} // sort results
function sorting(E, S) {
var N = E.length;
var Ef = Array(N);
var Sf = Array(N);
for (var k = 0; k < N; k++) {
Sf[k] = Array(N);
}
for (var i = 0; i < N; i++) {
var minID = 0;
var minE = E[0];
for (var j = 0; j < E.length; j++) {
if (E[j] < minE) {
minID = j;
minE = E[minID];
}
}
Ef[i] = E.splice(minID, 1)[0];
for (var _k5 = 0; _k5 < N; _k5++) {
Sf[_k5][i] = S[_k5][minID];
S[_k5].splice(minID, 1);
}
}
return [Object(utils_object["a" /* clone */])(Ef), Object(utils_object["a" /* clone */])(Sf)];
}
/**
* Create an array of a certain size and fill all items with an initial value
* @param {number} size
* @param {number} value
* @return {number[]}
*/
function createArray(size, value) {
// TODO: as soon as all browsers support Array.fill, use that instead (IE doesn't support it)
var array = new Array(size);
for (var i = 0; i < size; i++) {
array[i] = value;
}
return array;
}
});
// CONCATENATED MODULE: ./src/function/matrix/expm.js
var expm_name = 'expm';
var expm_dependencies = ['typed', 'abs', 'add', 'identity', 'inv', 'multiply'];
var createExpm = /* #__PURE__ */Object(factory["a" /* factory */])(expm_name, expm_dependencies, function (_ref) {
var typed = _ref.typed,
abs = _ref.abs,
add = _ref.add,
identity = _ref.identity,
inv = _ref.inv,
multiply = _ref.multiply;
/**
* Compute the matrix exponential, expm(A) = e^A. The matrix must be square.
* Not to be confused with exp(a), which performs element-wise
* exponentiation.
*
* The exponential is calculated using the Padé approximant with scaling and
* squaring; see "Nineteen Dubious Ways to Compute the Exponential of a
* Matrix," by Moler and Van Loan.
*
* Syntax:
*
* math.expm(x)
*
* Examples:
*
* const A = [[0,2],[0,0]]
* math.expm(A) // returns [[1,2],[0,1]]
*
* See also:
*
* exp
*
* @param {Matrix} x A square Matrix
* @return {Matrix} The exponential of x
*/
return typed(expm_name, {
Matrix: function Matrix(A) {
// Check matrix size
var size = A.size();
if (size.length !== 2 || size[0] !== size[1]) {
throw new RangeError('Matrix must be square ' + '(size: ' + Object(utils_string["d" /* format */])(size) + ')');
}
var n = size[0]; // Desired accuracy of the approximant (The actual accuracy
// will be affected by round-off error)
var eps = 1e-15; // The Padé approximant is not so accurate when the values of A
// are "large", so scale A by powers of two. Then compute the
// exponential, and square the result repeatedly according to
// the identity e^A = (e^(A/m))^m
// Compute infinity-norm of A, ||A||, to see how "big" it is
var infNorm = infinityNorm(A); // Find the optimal scaling factor and number of terms in the
// Padé approximant to reach the desired accuracy
var params = findParams(infNorm, eps);
var q = params.q;
var j = params.j; // The Pade approximation to e^A is:
// Rqq(A) = Dqq(A) ^ -1 * Nqq(A)
// where
// Nqq(A) = sum(i=0, q, (2q-i)!p! / [ (2q)!i!(q-i)! ] A^i
// Dqq(A) = sum(i=0, q, (2q-i)!q! / [ (2q)!i!(q-i)! ] (-A)^i
// Scale A by 1 / 2^j
var Apos = multiply(A, Math.pow(2, -j)); // The i=0 term is just the identity matrix
var N = identity(n);
var D = identity(n); // Initialization (i=0)
var factor = 1; // Initialization (i=1)
var AposToI = Apos; // Cloning not necessary
var alternate = -1;
for (var i = 1; i <= q; i++) {
if (i > 1) {
AposToI = multiply(AposToI, Apos);
alternate = -alternate;
}
factor = factor * (q - i + 1) / ((2 * q - i + 1) * i);
N = add(N, multiply(factor, AposToI));
D = add(D, multiply(factor * alternate, AposToI));
}
var R = multiply(inv(D), N); // Square j times
for (var _i = 0; _i < j; _i++) {
R = multiply(R, R);
}
return Object(is["H" /* isSparseMatrix */])(A) ? A.createSparseMatrix(R) : R;
}
});
function infinityNorm(A) {
var n = A.size()[0];
var infNorm = 0;
for (var i = 0; i < n; i++) {
var rowSum = 0;
for (var j = 0; j < n; j++) {
rowSum += abs(A.get([i, j]));
}
infNorm = Math.max(rowSum, infNorm);
}
return infNorm;
}
/**
* Find the best parameters for the Pade approximant given
* the matrix norm and desired accuracy. Returns the first acceptable
* combination in order of increasing computational load.
*/
function findParams(infNorm, eps) {
var maxSearchSize = 30;
for (var k = 0; k < maxSearchSize; k++) {
for (var q = 0; q <= k; q++) {
var j = k - q;
if (errorEstimate(infNorm, q, j) < eps) {
return {
q: q,
j: j
};
}
}
}
throw new Error('Could not find acceptable parameters to compute the matrix exponential (try increasing maxSearchSize in expm.js)');
}
/**
* Returns the estimated error of the Pade approximant for the given
* parameters.
*/
function errorEstimate(infNorm, q, j) {
var qfac = 1;
for (var i = 2; i <= q; i++) {
qfac *= i;
}
var twoqfac = qfac;
for (var _i2 = q + 1; _i2 <= 2 * q; _i2++) {
twoqfac *= _i2;
}
var twoqp1fac = twoqfac * (2 * q + 1);
return 8.0 * Math.pow(infNorm / Math.pow(2, j), 2 * q) * qfac * qfac / (twoqfac * twoqp1fac);
}
});
// CONCATENATED MODULE: ./src/function/matrix/sqrtm.js
var sqrtm_name = 'sqrtm';
var sqrtm_dependencies = ['typed', 'abs', 'add', 'multiply', 'sqrt', 'subtract', 'inv', 'size', 'max', 'identity'];
var createSqrtm = /* #__PURE__ */Object(factory["a" /* factory */])(sqrtm_name, sqrtm_dependencies, function (_ref) {
var typed = _ref.typed,
abs = _ref.abs,
add = _ref.add,
multiply = _ref.multiply,
sqrt = _ref.sqrt,
subtract = _ref.subtract,
inv = _ref.inv,
size = _ref.size,
max = _ref.max,
identity = _ref.identity;
var _maxIterations = 1e3;
var _tolerance = 1e-6;
/**
* Calculate the principal square root matrix using the Denman–Beavers iterative method
*
* https://en.wikipedia.org/wiki/Square_root_of_a_matrix#By_Denman–Beavers_iteration
*
* @param {Array | Matrix} A The square matrix `A`
* @return {Array | Matrix} The principal square root of matrix `A`
* @private
*/
function _denmanBeavers(A) {
var error;
var iterations = 0;
var Y = A;
var Z = identity(size(A));
do {
var Yk = Y;
Y = multiply(0.5, add(Yk, inv(Z)));
Z = multiply(0.5, add(Z, inv(Yk)));
error = max(abs(subtract(Y, Yk)));
if (error > _tolerance && ++iterations > _maxIterations) {
throw new Error('computing square root of matrix: iterative method could not converge');
}
} while (error > _tolerance);
return Y;
}
/**
* Calculate the principal square root of a square matrix.
* The principal square root matrix `X` of another matrix `A` is such that `X * X = A`.
*
* https://en.wikipedia.org/wiki/Square_root_of_a_matrix
*
* Syntax:
*
* X = math.sqrtm(A)
*
* Examples:
*
* math.sqrtm([[1, 2], [3, 4]]) // returns [[-2, 1], [1.5, -0.5]]
*
* See also:
*
* sqrt, pow
*
* @param {Array | Matrix} A The square matrix `A`
* @return {Array | Matrix} The principal square root of matrix `A`
*/
return typed(sqrtm_name, {
'Array | Matrix': function ArrayMatrix(A) {
var size = Object(is["v" /* isMatrix */])(A) ? A.size() : Object(utils_array["a" /* arraySize */])(A);
switch (size.length) {
case 1:
// Single element Array | Matrix
if (size[0] === 1) {
return sqrt(A);
} else {
throw new RangeError('Matrix must be square ' + '(size: ' + Object(utils_string["d" /* format */])(size) + ')');
}
case 2:
{
// Two-dimensional Array | Matrix
var rows = size[0];
var cols = size[1];
if (rows === cols) {
return _denmanBeavers(A);
} else {
throw new RangeError('Matrix must be square ' + '(size: ' + Object(utils_string["d" /* format */])(size) + ')');
}
}
}
}
});
});
// CONCATENATED MODULE: ./src/function/arithmetic/divide.js
var divide_name = 'divide';
var divide_dependencies = ['typed', 'matrix', 'multiply', 'equalScalar', 'divideScalar', 'inv'];
var createDivide = /* #__PURE__ */Object(factory["a" /* factory */])(divide_name, divide_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
multiply = _ref.multiply,
equalScalar = _ref.equalScalar,
divideScalar = _ref.divideScalar,
inv = _ref.inv;
var algorithm11 = createAlgorithm11({
typed: typed,
equalScalar: equalScalar
});
var algorithm14 = createAlgorithm14({
typed: typed
});
/**
* Divide two values, `x / y`.
* To divide matrices, `x` is multiplied with the inverse of `y`: `x * inv(y)`.
*
* Syntax:
*
* math.divide(x, y)
*
* Examples:
*
* math.divide(2, 3) // returns number 0.6666666666666666
*
* const a = math.complex(5, 14)
* const b = math.complex(4, 1)
* math.divide(a, b) // returns Complex 2 + 3i
*
* const c = [[7, -6], [13, -4]]
* const d = [[1, 2], [4, 3]]
* math.divide(c, d) // returns Array [[-9, 4], [-11, 6]]
*
* const e = math.unit('18 km')
* math.divide(e, 4.5) // returns Unit 4 km
*
* See also:
*
* multiply
*
* @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Numerator
* @param {number | BigNumber | Fraction | Complex | Array | Matrix} y Denominator
* @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Quotient, `x / y`
*/
return typed('divide', Object(utils_object["e" /* extend */])({
// we extend the signatures of divideScalar with signatures dealing with matrices
'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(x, y) {
// TODO: implement matrix right division using pseudo inverse
// https://www.mathworks.nl/help/matlab/ref/mrdivide.html
// https://www.gnu.org/software/octave/doc/interpreter/Arithmetic-Ops.html
// https://stackoverflow.com/questions/12263932/how-does-gnu-octave-matrix-division-work-getting-unexpected-behaviour
return multiply(x, inv(y));
},
'DenseMatrix, any': function DenseMatrixAny(x, y) {
return algorithm14(x, y, divideScalar, false);
},
'SparseMatrix, any': function SparseMatrixAny(x, y) {
return algorithm11(x, y, divideScalar, false);
},
'Array, any': function ArrayAny(x, y) {
// use matrix implementation
return algorithm14(matrix(x), y, divideScalar, false).valueOf();
},
'any, Array | Matrix': function anyArrayMatrix(x, y) {
return multiply(x, inv(y));
}
}, divideScalar.signatures));
});
// CONCATENATED MODULE: ./src/function/geometry/distance.js
var distance_name = 'distance';
var distance_dependencies = ['typed', 'addScalar', 'subtract', 'divideScalar', 'multiplyScalar', 'unaryMinus', 'sqrt', 'abs'];
var createDistance = /* #__PURE__ */Object(factory["a" /* factory */])(distance_name, distance_dependencies, function (_ref) {
var typed = _ref.typed,
addScalar = _ref.addScalar,
subtract = _ref.subtract,
multiplyScalar = _ref.multiplyScalar,
divideScalar = _ref.divideScalar,
unaryMinus = _ref.unaryMinus,
sqrt = _ref.sqrt,
abs = _ref.abs;
/**
* Calculates:
* The eucledian distance between two points in N-dimensional spaces.
* Distance between point and a line in 2 and 3 dimensional spaces.
* Pairwise distance between a set of 2D or 3D points
* NOTE:
* When substituting coefficients of a line(a, b and c), use ax + by + c = 0 instead of ax + by = c
* For parametric equation of a 3D line, x0, y0, z0, a, b, c are from: (x−x0, y−y0, z−z0) = t(a, b, c)
*
* Syntax:
* math.distance([x1, y1], [x2, y2])
*- math.distance({pointOneX: 4, pointOneY: 5}, {pointTwoX: 2, pointTwoY: 7})
* math.distance([x1, y1, z1], [x2, y2, z2])
* math.distance({pointOneX: 4, pointOneY: 5, pointOneZ: 8}, {pointTwoX: 2, pointTwoY: 7, pointTwoZ: 9})
* math.distance([x1, y1, ... , N1], [x2, y2, ... , N2])
* math.distance([[A], [B], [C]...])
* math.distance([x1, y1], [LinePtX1, LinePtY1], [LinePtX2, LinePtY2])
* math.distance({pointX: 1, pointY: 4}, {lineOnePtX: 6, lineOnePtY: 3}, {lineTwoPtX: 2, lineTwoPtY: 8})
* math.distance([x1, y1, z1], [LinePtX1, LinePtY1, LinePtZ1], [LinePtX2, LinePtY2, LinePtZ2])
* math.distance({pointX: 1, pointY: 4, pointZ: 7}, {lineOnePtX: 6, lineOnePtY: 3, lineOnePtZ: 4}, {lineTwoPtX: 2, lineTwoPtY: 8, lineTwoPtZ: 5})
* math.distance([x1, y1], [xCoeffLine, yCoeffLine, constant])
* math.distance({pointX: 10, pointY: 10}, {xCoeffLine: 8, yCoeffLine: 1, constant: 3})
* math.distance([x1, y1, z1], [x0, y0, z0, a-tCoeff, b-tCoeff, c-tCoeff]) point and parametric equation of 3D line
* math.distance([x, y, z], [x0, y0, z0, a, b, c])
* math.distance({pointX: 2, pointY: 5, pointZ: 9}, {x0: 4, y0: 6, z0: 3, a: 4, b: 2, c: 0})
*
* Examples:
* math.distance([0,0], [4,4]) // Returns 5.6569
* math.distance(
* {pointOneX: 0, pointOneY: 0},
* {pointTwoX: 10, pointTwoY: 10}) // Returns 14.142135623730951
* math.distance([1, 0, 1], [4, -2, 2]) // Returns 3.74166
* math.distance(
* {pointOneX: 4, pointOneY: 5, pointOneZ: 8},
* {pointTwoX: 2, pointTwoY: 7, pointTwoZ: 9}) // Returns 3
* math.distance([1, 0, 1, 0], [0, -1, 0, -1]) // Returns 2
* math.distance([[1, 2], [1, 2], [1, 3]]) // Returns [0, 1, 1]
* math.distance([[1,2,4], [1,2,6], [8,1,3]]) // Returns [2, 7.14142842854285, 7.681145747868608]
* math.distance([10, 10], [8, 1, 3]) // Returns 11.535230316796387
* math.distance([10, 10], [2, 3], [-8, 0]) // Returns 8.759953130362847
* math.distance(
* {pointX: 1, pointY: 4},
* {lineOnePtX: 6, lineOnePtY: 3},
* {lineTwoPtX: 2, lineTwoPtY: 8}) // Returns 2.720549372624744
* math.distance([2, 3, 1], [1, 1, 2, 5, 0, 1]) // Returns 2.3204774044612857
* math.distance(
* {pointX: 2, pointY: 3, pointZ: 1},
* {x0: 1, y0: 1, z0: 2, a: 5, b: 0, c: 1} // Returns 2.3204774044612857
*
* @param {Array | Matrix | Object} x Co-ordinates of first point
* @param {Array | Matrix | Object} y Co-ordinates of second point
* @return {Number | BigNumber} Returns the distance from two/three points
*/
return typed(distance_name, {
'Array, Array, Array': function ArrayArrayArray(x, y, z) {
// Point to Line 2D (x=Point, y=LinePoint1, z=LinePoint2)
if (x.length === 2 && y.length === 2 && z.length === 2) {
if (!_2d(x)) {
throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');
}
if (!_2d(y)) {
throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument');
}
if (!_2d(z)) {
throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument');
}
var m = divideScalar(subtract(z[1], z[0]), subtract(y[1], y[0]));
var xCoeff = multiplyScalar(multiplyScalar(m, m), y[0]);
var yCoeff = unaryMinus(multiplyScalar(m, y[0]));
var constant = x[1];
return _distancePointLine2D(x[0], x[1], xCoeff, yCoeff, constant);
} else {
throw new TypeError('Invalid Arguments: Try again');
}
},
'Object, Object, Object': function ObjectObjectObject(x, y, z) {
if (Object.keys(x).length === 2 && Object.keys(y).length === 2 && Object.keys(z).length === 2) {
if (!_2d(x)) {
throw new TypeError('Values of pointX and pointY should be numbers or BigNumbers');
}
if (!_2d(y)) {
throw new TypeError('Values of lineOnePtX and lineOnePtY should be numbers or BigNumbers');
}
if (!_2d(z)) {
throw new TypeError('Values of lineTwoPtX and lineTwoPtY should be numbers or BigNumbers');
}
if ('pointX' in x && 'pointY' in x && 'lineOnePtX' in y && 'lineOnePtY' in y && 'lineTwoPtX' in z && 'lineTwoPtY' in z) {
var m = divideScalar(subtract(z.lineTwoPtY, z.lineTwoPtX), subtract(y.lineOnePtY, y.lineOnePtX));
var xCoeff = multiplyScalar(multiplyScalar(m, m), y.lineOnePtX);
var yCoeff = unaryMinus(multiplyScalar(m, y.lineOnePtX));
var constant = x.pointX;
return _distancePointLine2D(x.pointX, x.pointY, xCoeff, yCoeff, constant);
} else {
throw new TypeError('Key names do not match');
}
} else {
throw new TypeError('Invalid Arguments: Try again');
}
},
'Array, Array': function ArrayArray(x, y) {
// Point to Line 2D (x=[pointX, pointY], y=[x-coeff, y-coeff, const])
if (x.length === 2 && y.length === 3) {
if (!_2d(x)) {
throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');
}
if (!_3d(y)) {
throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');
}
return _distancePointLine2D(x[0], x[1], y[0], y[1], y[2]);
} else if (x.length === 3 && y.length === 6) {
// Point to Line 3D
if (!_3d(x)) {
throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');
}
if (!_parametricLine(y)) {
throw new TypeError('Array with 6 numbers or BigNumbers expected for second argument');
}
return _distancePointLine3D(x[0], x[1], x[2], y[0], y[1], y[2], y[3], y[4], y[5]);
} else if (x.length === y.length && x.length > 0) {
// Point to Point N-dimensions
if (!_containsOnlyNumbers(x)) {
throw new TypeError('All values of an array should be numbers or BigNumbers');
}
if (!_containsOnlyNumbers(y)) {
throw new TypeError('All values of an array should be numbers or BigNumbers');
}
return _euclideanDistance(x, y);
} else {
throw new TypeError('Invalid Arguments: Try again');
}
},
'Object, Object': function ObjectObject(x, y) {
if (Object.keys(x).length === 2 && Object.keys(y).length === 3) {
if (!_2d(x)) {
throw new TypeError('Values of pointX and pointY should be numbers or BigNumbers');
}
if (!_3d(y)) {
throw new TypeError('Values of xCoeffLine, yCoeffLine and constant should be numbers or BigNumbers');
}
if ('pointX' in x && 'pointY' in x && 'xCoeffLine' in y && 'yCoeffLine' in y && 'constant' in y) {
return _distancePointLine2D(x.pointX, x.pointY, y.xCoeffLine, y.yCoeffLine, y.constant);
} else {
throw new TypeError('Key names do not match');
}
} else if (Object.keys(x).length === 3 && Object.keys(y).length === 6) {
// Point to Line 3D
if (!_3d(x)) {
throw new TypeError('Values of pointX, pointY and pointZ should be numbers or BigNumbers');
}
if (!_parametricLine(y)) {
throw new TypeError('Values of x0, y0, z0, a, b and c should be numbers or BigNumbers');
}
if ('pointX' in x && 'pointY' in x && 'x0' in y && 'y0' in y && 'z0' in y && 'a' in y && 'b' in y && 'c' in y) {
return _distancePointLine3D(x.pointX, x.pointY, x.pointZ, y.x0, y.y0, y.z0, y.a, y.b, y.c);
} else {
throw new TypeError('Key names do not match');
}
} else if (Object.keys(x).length === 2 && Object.keys(y).length === 2) {
// Point to Point 2D
if (!_2d(x)) {
throw new TypeError('Values of pointOneX and pointOneY should be numbers or BigNumbers');
}
if (!_2d(y)) {
throw new TypeError('Values of pointTwoX and pointTwoY should be numbers or BigNumbers');
}
if ('pointOneX' in x && 'pointOneY' in x && 'pointTwoX' in y && 'pointTwoY' in y) {
return _euclideanDistance([x.pointOneX, x.pointOneY], [y.pointTwoX, y.pointTwoY]);
} else {
throw new TypeError('Key names do not match');
}
} else if (Object.keys(x).length === 3 && Object.keys(y).length === 3) {
// Point to Point 3D
if (!_3d(x)) {
throw new TypeError('Values of pointOneX, pointOneY and pointOneZ should be numbers or BigNumbers');
}
if (!_3d(y)) {
throw new TypeError('Values of pointTwoX, pointTwoY and pointTwoZ should be numbers or BigNumbers');
}
if ('pointOneX' in x && 'pointOneY' in x && 'pointOneZ' in x && 'pointTwoX' in y && 'pointTwoY' in y && 'pointTwoZ' in y) {
return _euclideanDistance([x.pointOneX, x.pointOneY, x.pointOneZ], [y.pointTwoX, y.pointTwoY, y.pointTwoZ]);
} else {
throw new TypeError('Key names do not match');
}
} else {
throw new TypeError('Invalid Arguments: Try again');
}
},
Array: function Array(arr) {
if (!_pairwise(arr)) {
throw new TypeError('Incorrect array format entered for pairwise distance calculation');
}
return _distancePairwise(arr);
}
});
function _isNumber(a) {
// distance supports numbers and bignumbers
return typeof a === 'number' || Object(is["e" /* isBigNumber */])(a);
}
function _2d(a) {
// checks if the number of arguments are correct in count and are valid (should be numbers)
if (a.constructor !== Array) {
a = _objectToArray(a);
}
return _isNumber(a[0]) && _isNumber(a[1]);
}
function _3d(a) {
// checks if the number of arguments are correct in count and are valid (should be numbers)
if (a.constructor !== Array) {
a = _objectToArray(a);
}
return _isNumber(a[0]) && _isNumber(a[1]) && _isNumber(a[2]);
}
function _containsOnlyNumbers(a) {
// checks if the number of arguments are correct in count and are valid (should be numbers)
if (!Array.isArray(a)) {
a = _objectToArray(a);
}
return a.every(_isNumber);
}
function _parametricLine(a) {
if (a.constructor !== Array) {
a = _objectToArray(a);
}
return _isNumber(a[0]) && _isNumber(a[1]) && _isNumber(a[2]) && _isNumber(a[3]) && _isNumber(a[4]) && _isNumber(a[5]);
}
function _objectToArray(o) {
var keys = Object.keys(o);
var a = [];
for (var i = 0; i < keys.length; i++) {
a.push(o[keys[i]]);
}
return a;
}
function _pairwise(a) {
// checks for valid arguments passed to _distancePairwise(Array)
if (a[0].length === 2 && _isNumber(a[0][0]) && _isNumber(a[0][1])) {
if (a.some(function (aI) {
return aI.length !== 2 || !_isNumber(aI[0]) || !_isNumber(aI[1]);
})) {
return false;
}
} else if (a[0].length === 3 && _isNumber(a[0][0]) && _isNumber(a[0][1]) && _isNumber(a[0][2])) {
if (a.some(function (aI) {
return aI.length !== 3 || !_isNumber(aI[0]) || !_isNumber(aI[1]) || !_isNumber(aI[2]);
})) {
return false;
}
} else {
return false;
}
return true;
}
function _distancePointLine2D(x, y, a, b, c) {
var num = abs(addScalar(addScalar(multiplyScalar(a, x), multiplyScalar(b, y)), c));
var den = sqrt(addScalar(multiplyScalar(a, a), multiplyScalar(b, b)));
return divideScalar(num, den);
}
function _distancePointLine3D(x, y, z, x0, y0, z0, a, b, c) {
var num = [subtract(multiplyScalar(subtract(y0, y), c), multiplyScalar(subtract(z0, z), b)), subtract(multiplyScalar(subtract(z0, z), a), multiplyScalar(subtract(x0, x), c)), subtract(multiplyScalar(subtract(x0, x), b), multiplyScalar(subtract(y0, y), a))];
num = sqrt(addScalar(addScalar(multiplyScalar(num[0], num[0]), multiplyScalar(num[1], num[1])), multiplyScalar(num[2], num[2])));
var den = sqrt(addScalar(addScalar(multiplyScalar(a, a), multiplyScalar(b, b)), multiplyScalar(c, c)));
return divideScalar(num, den);
}
function _euclideanDistance(x, y) {
var vectorSize = x.length;
var result = 0;
var diff = 0;
for (var i = 0; i < vectorSize; i++) {
diff = subtract(x[i], y[i]);
result = addScalar(multiplyScalar(diff, diff), result);
}
return sqrt(result);
}
function _distancePairwise(a) {
var result = [];
var pointA = [];
var pointB = [];
for (var i = 0; i < a.length - 1; i++) {
for (var j = i + 1; j < a.length; j++) {
if (a[0].length === 2) {
pointA = [a[i][0], a[i][1]];
pointB = [a[j][0], a[j][1]];
} else if (a[0].length === 3) {
pointA = [a[i][0], a[i][1], a[i][2]];
pointB = [a[j][0], a[j][1], a[j][2]];
}
result.push(_euclideanDistance(pointA, pointB));
}
}
return result;
}
});
// CONCATENATED MODULE: ./src/function/geometry/intersect.js
var intersect_name = 'intersect';
var intersect_dependencies = ['typed', 'config', 'abs', 'add', 'addScalar', 'matrix', 'multiply', 'multiplyScalar', 'divideScalar', 'subtract', 'smaller', 'equalScalar'];
var createIntersect = /* #__PURE__ */Object(factory["a" /* factory */])(intersect_name, intersect_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
abs = _ref.abs,
add = _ref.add,
addScalar = _ref.addScalar,
matrix = _ref.matrix,
multiply = _ref.multiply,
multiplyScalar = _ref.multiplyScalar,
divideScalar = _ref.divideScalar,
subtract = _ref.subtract,
smaller = _ref.smaller,
equalScalar = _ref.equalScalar;
/**
* Calculates the point of intersection of two lines in two or three dimensions
* and of a line and a plane in three dimensions. The inputs are in the form of
* arrays or 1 dimensional matrices. The line intersection functions return null
* if the lines do not meet.
*
* Note: Fill the plane coefficients as `x + y + z = c` and not as `x + y + z + c = 0`.
*
* Syntax:
*
* math.intersect(endPoint1Line1, endPoint2Line1, endPoint1Line2, endPoint2Line2)
* math.intersect(endPoint1, endPoint2, planeCoefficients)
*
* Examples:
*
* math.intersect([0, 0], [10, 10], [10, 0], [0, 10]) // Returns [5, 5]
* math.intersect([0, 0, 0], [10, 10, 0], [10, 0, 0], [0, 10, 0]) // Returns [5, 5, 0]
* math.intersect([1, 0, 1], [4, -2, 2], [1, 1, 1, 6]) // Returns [7, -4, 3]
*
* @param {Array | Matrix} w Co-ordinates of first end-point of first line
* @param {Array | Matrix} x Co-ordinates of second end-point of first line
* @param {Array | Matrix} y Co-ordinates of first end-point of second line
* OR Co-efficients of the plane's equation
* @param {Array | Matrix} z Co-ordinates of second end-point of second line
* OR null if the calculation is for line and plane
* @return {Array} Returns the point of intersection of lines/lines-planes
*/
return typed('intersect', {
'Array, Array, Array': function ArrayArrayArray(x, y, plane) {
if (!_3d(x)) {
throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');
}
if (!_3d(y)) {
throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');
}
if (!_4d(plane)) {
throw new TypeError('Array with 4 numbers expected as third argument');
}
return _intersectLinePlane(x[0], x[1], x[2], y[0], y[1], y[2], plane[0], plane[1], plane[2], plane[3]);
},
'Array, Array, Array, Array': function ArrayArrayArrayArray(w, x, y, z) {
if (w.length === 2) {
if (!_2d(w)) {
throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');
}
if (!_2d(x)) {
throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument');
}
if (!_2d(y)) {
throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument');
}
if (!_2d(z)) {
throw new TypeError('Array with 2 numbers or BigNumbers expected for fourth argument');
}
return _intersect2d(w, x, y, z);
} else if (w.length === 3) {
if (!_3d(w)) {
throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');
}
if (!_3d(x)) {
throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');
}
if (!_3d(y)) {
throw new TypeError('Array with 3 numbers or BigNumbers expected for third argument');
}
if (!_3d(z)) {
throw new TypeError('Array with 3 numbers or BigNumbers expected for fourth argument');
}
return _intersect3d(w[0], w[1], w[2], x[0], x[1], x[2], y[0], y[1], y[2], z[0], z[1], z[2]);
} else {
throw new TypeError('Arrays with two or thee dimensional points expected');
}
},
'Matrix, Matrix, Matrix': function MatrixMatrixMatrix(x, y, plane) {
return matrix(this(x.valueOf(), y.valueOf(), plane.valueOf()));
},
'Matrix, Matrix, Matrix, Matrix': function MatrixMatrixMatrixMatrix(w, x, y, z) {
// TODO: output matrix type should match input matrix type
return matrix(this(w.valueOf(), x.valueOf(), y.valueOf(), z.valueOf()));
}
});
function _isNumeric(a) {
// intersect supports numbers and bignumbers
return typeof a === 'number' || Object(is["e" /* isBigNumber */])(a);
}
function _2d(x) {
return x.length === 2 && _isNumeric(x[0]) && _isNumeric(x[1]);
}
function _3d(x) {
return x.length === 3 && _isNumeric(x[0]) && _isNumeric(x[1]) && _isNumeric(x[2]);
}
function _4d(x) {
return x.length === 4 && _isNumeric(x[0]) && _isNumeric(x[1]) && _isNumeric(x[2]) && _isNumeric(x[3]);
}
function _intersect2d(p1a, p1b, p2a, p2b) {
var o1 = p1a;
var o2 = p2a;
var d1 = subtract(o1, p1b);
var d2 = subtract(o2, p2b);
var det = subtract(multiplyScalar(d1[0], d2[1]), multiplyScalar(d2[0], d1[1]));
if (smaller(abs(det), config.epsilon)) {
return null;
}
var d20o11 = multiplyScalar(d2[0], o1[1]);
var d21o10 = multiplyScalar(d2[1], o1[0]);
var d20o21 = multiplyScalar(d2[0], o2[1]);
var d21o20 = multiplyScalar(d2[1], o2[0]);
var t = divideScalar(addScalar(subtract(subtract(d20o11, d21o10), d20o21), d21o20), det);
return add(multiply(d1, t), o1);
}
function _intersect3dHelper(a, b, c, d, e, f, g, h, i, j, k, l) {
// (a - b)*(c - d) + (e - f)*(g - h) + (i - j)*(k - l)
var add1 = multiplyScalar(subtract(a, b), subtract(c, d));
var add2 = multiplyScalar(subtract(e, f), subtract(g, h));
var add3 = multiplyScalar(subtract(i, j), subtract(k, l));
return addScalar(addScalar(add1, add2), add3);
}
function _intersect3d(x1, y1, z1, x2, y2, z2, x3, y3, z3, x4, y4, z4) {
var d1343 = _intersect3dHelper(x1, x3, x4, x3, y1, y3, y4, y3, z1, z3, z4, z3);
var d4321 = _intersect3dHelper(x4, x3, x2, x1, y4, y3, y2, y1, z4, z3, z2, z1);
var d1321 = _intersect3dHelper(x1, x3, x2, x1, y1, y3, y2, y1, z1, z3, z2, z1);
var d4343 = _intersect3dHelper(x4, x3, x4, x3, y4, y3, y4, y3, z4, z3, z4, z3);
var d2121 = _intersect3dHelper(x2, x1, x2, x1, y2, y1, y2, y1, z2, z1, z2, z1);
var ta = divideScalar(subtract(multiplyScalar(d1343, d4321), multiplyScalar(d1321, d4343)), subtract(multiplyScalar(d2121, d4343), multiplyScalar(d4321, d4321)));
var tb = divideScalar(addScalar(d1343, multiplyScalar(ta, d4321)), d4343);
var pax = addScalar(x1, multiplyScalar(ta, subtract(x2, x1)));
var pay = addScalar(y1, multiplyScalar(ta, subtract(y2, y1)));
var paz = addScalar(z1, multiplyScalar(ta, subtract(z2, z1)));
var pbx = addScalar(x3, multiplyScalar(tb, subtract(x4, x3)));
var pby = addScalar(y3, multiplyScalar(tb, subtract(y4, y3)));
var pbz = addScalar(z3, multiplyScalar(tb, subtract(z4, z3)));
if (equalScalar(pax, pbx) && equalScalar(pay, pby) && equalScalar(paz, pbz)) {
return [pax, pay, paz];
} else {
return null;
}
}
function _intersectLinePlane(x1, y1, z1, x2, y2, z2, x, y, z, c) {
var x1x = multiplyScalar(x1, x);
var x2x = multiplyScalar(x2, x);
var y1y = multiplyScalar(y1, y);
var y2y = multiplyScalar(y2, y);
var z1z = multiplyScalar(z1, z);
var z2z = multiplyScalar(z2, z);
var t = divideScalar(subtract(subtract(subtract(c, x1x), y1y), z1z), subtract(subtract(subtract(addScalar(addScalar(x2x, y2y), z2z), x1x), y1y), z1z));
var px = addScalar(x1, multiplyScalar(t, subtract(x2, x1)));
var py = addScalar(y1, multiplyScalar(t, subtract(y2, y1)));
var pz = addScalar(z1, multiplyScalar(t, subtract(z2, z1)));
return [px, py, pz]; // TODO: Add cases when line is parallel to the plane:
// (a) no intersection,
// (b) line contained in plane
}
});
// CONCATENATED MODULE: ./src/function/statistics/sum.js
var sum_name = 'sum';
var sum_dependencies = ['typed', 'config', 'add', 'numeric'];
var createSum = /* #__PURE__ */Object(factory["a" /* factory */])(sum_name, sum_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
add = _ref.add,
numeric = _ref.numeric;
/**
* Compute the sum of a matrix or a list with values.
* In case of a (multi dimensional) array or matrix, the sum of all
* elements will be calculated.
*
* Syntax:
*
* math.sum(a, b, c, ...)
* math.sum(A)
*
* Examples:
*
* math.sum(2, 1, 4, 3) // returns 10
* math.sum([2, 1, 4, 3]) // returns 10
* math.sum([[2, 5], [4, 3], [1, 7]]) // returns 22
*
* See also:
*
* mean, median, min, max, prod, std, variance
*
* @param {... *} args A single matrix or or multiple scalar values
* @return {*} The sum of all values
*/
return typed(sum_name, {
// sum([a, b, c, d, ...])
'Array | Matrix': _sum,
// sum([a, b, c, d, ...], dim)
'Array | Matrix, number | BigNumber': _nsumDim,
// sum(a, b, c, d, ...)
'...': function _(args) {
if (containsCollections(args)) {
throw new TypeError('Scalar values expected in function sum');
}
return _sum(args);
}
});
/**
* Recursively calculate the sum of an n-dimensional array
* @param {Array | Matrix} array
* @return {number} sum
* @private
*/
function _sum(array) {
var sum;
deepForEach(array, function (value) {
try {
sum = sum === undefined ? value : add(sum, value);
} catch (err) {
throw improveErrorMessage(err, 'sum', value);
}
}); // make sure returning numeric value: parse a string into a numeric value
if (sum === undefined) {
sum = numeric(0, config.number);
}
if (typeof sum === 'string') {
sum = numeric(sum, config.number);
}
return sum;
}
function _nsumDim(array, dim) {
try {
var sum = reduce(array, dim, add);
return sum;
} catch (err) {
throw improveErrorMessage(err, 'sum');
}
}
});
// CONCATENATED MODULE: ./src/function/statistics/mean.js
var mean_name = 'mean';
var mean_dependencies = ['typed', 'add', 'divide'];
var createMean = /* #__PURE__ */Object(factory["a" /* factory */])(mean_name, mean_dependencies, function (_ref) {
var typed = _ref.typed,
add = _ref.add,
divide = _ref.divide;
/**
* Compute the mean value of matrix or a list with values.
* In case of a multi dimensional array, the mean of the flattened array
* will be calculated. When `dim` is provided, the maximum over the selected
* dimension will be calculated. Parameter `dim` is zero-based.
*
* Syntax:
*
* math.mean(a, b, c, ...)
* math.mean(A)
* math.mean(A, dim)
*
* Examples:
*
* math.mean(2, 1, 4, 3) // returns 2.5
* math.mean([1, 2.7, 3.2, 4]) // returns 2.725
*
* math.mean([[2, 5], [6, 3], [1, 7]], 0) // returns [3, 5]
* math.mean([[2, 5], [6, 3], [1, 7]], 1) // returns [3.5, 4.5, 4]
*
* See also:
*
* median, min, max, sum, prod, std, variance
*
* @param {... *} args A single matrix or or multiple scalar values
* @return {*} The mean of all values
*/
return typed(mean_name, {
// mean([a, b, c, d, ...])
'Array | Matrix': _mean,
// mean([a, b, c, d, ...], dim)
'Array | Matrix, number | BigNumber': _nmeanDim,
// mean(a, b, c, d, ...)
'...': function _(args) {
if (containsCollections(args)) {
throw new TypeError('Scalar values expected in function mean');
}
return _mean(args);
}
});
/**
* Calculate the mean value in an n-dimensional array, returning a
* n-1 dimensional array
* @param {Array} array
* @param {number} dim
* @return {number} mean
* @private
*/
function _nmeanDim(array, dim) {
try {
var sum = reduce(array, dim, add);
var s = Array.isArray(array) ? Object(utils_array["a" /* arraySize */])(array) : array.size();
return divide(sum, s[dim]);
} catch (err) {
throw improveErrorMessage(err, 'mean');
}
}
/**
* Recursively calculate the mean value in an n-dimensional array
* @param {Array} array
* @return {number} mean
* @private
*/
function _mean(array) {
var sum;
var num = 0;
deepForEach(array, function (value) {
try {
sum = sum === undefined ? value : add(sum, value);
num++;
} catch (err) {
throw improveErrorMessage(err, 'mean', value);
}
});
if (num === 0) {
throw new Error('Cannot calculate the mean of an empty array');
}
return divide(sum, num);
}
});
// CONCATENATED MODULE: ./src/function/statistics/median.js
var median_name = 'median';
var median_dependencies = ['typed', 'add', 'divide', 'compare', 'partitionSelect'];
var createMedian = /* #__PURE__ */Object(factory["a" /* factory */])(median_name, median_dependencies, function (_ref) {
var typed = _ref.typed,
add = _ref.add,
divide = _ref.divide,
compare = _ref.compare,
partitionSelect = _ref.partitionSelect;
/**
* Recursively calculate the median of an n-dimensional array
* @param {Array} array
* @return {Number} median
* @private
*/
function _median(array) {
try {
array = Object(utils_array["e" /* flatten */])(array.valueOf());
var num = array.length;
if (num === 0) {
throw new Error('Cannot calculate median of an empty array');
}
if (num % 2 === 0) {
// even: return the average of the two middle values
var mid = num / 2 - 1;
var right = partitionSelect(array, mid + 1); // array now partitioned at mid + 1, take max of left part
var left = array[mid];
for (var i = 0; i < mid; ++i) {
if (compare(array[i], left) > 0) {
left = array[i];
}
}
return middle2(left, right);
} else {
// odd: return the middle value
var m = partitionSelect(array, (num - 1) / 2);
return middle(m);
}
} catch (err) {
throw improveErrorMessage(err, 'median');
}
} // helper function to type check the middle value of the array
var middle = typed({
'number | BigNumber | Complex | Unit': function numberBigNumberComplexUnit(value) {
return value;
}
}); // helper function to type check the two middle value of the array
var middle2 = typed({
'number | BigNumber | Complex | Unit, number | BigNumber | Complex | Unit': function numberBigNumberComplexUnitNumberBigNumberComplexUnit(left, right) {
return divide(add(left, right), 2);
}
});
/**
* Compute the median of a matrix or a list with values. The values are
* sorted and the middle value is returned. In case of an even number of
* values, the average of the two middle values is returned.
* Supported types of values are: Number, BigNumber, Unit
*
* In case of a (multi dimensional) array or matrix, the median of all
* elements will be calculated.
*
* Syntax:
*
* math.median(a, b, c, ...)
* math.median(A)
*
* Examples:
*
* math.median(5, 2, 7) // returns 5
* math.median([3, -1, 5, 7]) // returns 4
*
* See also:
*
* mean, min, max, sum, prod, std, variance, quantileSeq
*
* @param {... *} args A single matrix or or multiple scalar values
* @return {*} The median
*/
return typed(median_name, {
// median([a, b, c, d, ...])
'Array | Matrix': _median,
// median([a, b, c, d, ...], dim)
'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {
// TODO: implement median(A, dim)
throw new Error('median(A, dim) is not yet supported'); // return reduce(arguments[0], arguments[1], ...)
},
// median(a, b, c, d, ...)
'...': function _(args) {
if (containsCollections(args)) {
throw new TypeError('Scalar values expected in function median');
}
return _median(args);
}
});
});
// CONCATENATED MODULE: ./src/function/statistics/mad.js
var mad_name = 'mad';
var mad_dependencies = ['typed', 'abs', 'map', 'median', 'subtract'];
var createMad = /* #__PURE__ */Object(factory["a" /* factory */])(mad_name, mad_dependencies, function (_ref) {
var typed = _ref.typed,
abs = _ref.abs,
map = _ref.map,
median = _ref.median,
subtract = _ref.subtract;
/**
* Compute the median absolute deviation of a matrix or a list with values.
* The median absolute deviation is defined as the median of the absolute
* deviations from the median.
*
* Syntax:
*
* math.mad(a, b, c, ...)
* math.mad(A)
*
* Examples:
*
* math.mad(10, 20, 30) // returns 10
* math.mad([1, 2, 3]) // returns 1
* math.mad([[1, 2, 3], [4, 5, 6]]) // returns 1.5
*
* See also:
*
* median, mean, std, abs
*
* @param {Array | Matrix} array
* A single matrix or multiple scalar values.
* @return {*} The median absolute deviation.
*/
return typed(mad_name, {
// mad([a, b, c, d, ...])
'Array | Matrix': _mad,
// mad(a, b, c, d, ...)
'...': function _(args) {
return _mad(args);
}
});
function _mad(array) {
array = Object(utils_array["e" /* flatten */])(array.valueOf());
if (array.length === 0) {
throw new Error('Cannot calculate median absolute deviation (mad) of an empty array');
}
try {
var med = median(array);
return median(map(array, function (value) {
return abs(subtract(value, med));
}));
} catch (err) {
if (err instanceof TypeError && err.message.indexOf('median') !== -1) {
throw new TypeError(err.message.replace('median', 'mad'));
} else {
throw improveErrorMessage(err, 'mad');
}
}
}
});
// CONCATENATED MODULE: ./src/function/statistics/variance.js
var DEFAULT_NORMALIZATION = 'unbiased';
var variance_name = 'variance';
var variance_dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'apply', 'isNaN'];
var createVariance = /* #__PURE__ */Object(factory["a" /* factory */])(variance_name, variance_dependencies, function (_ref) {
var typed = _ref.typed,
add = _ref.add,
subtract = _ref.subtract,
multiply = _ref.multiply,
divide = _ref.divide,
apply = _ref.apply,
isNaN = _ref.isNaN;
/**
* Compute the variance of a matrix or a list with values.
* In case of a (multi dimensional) array or matrix, the variance over all
* elements will be calculated.
*
* Additionally, it is possible to compute the variance along the rows
* or columns of a matrix by specifying the dimension as the second argument.
*
* Optionally, the type of normalization can be specified as the final
* parameter. The parameter `normalization` can be one of the following values:
*
* - 'unbiased' (default) The sum of squared errors is divided by (n - 1)
* - 'uncorrected' The sum of squared errors is divided by n
* - 'biased' The sum of squared errors is divided by (n + 1)
*
*
* Note that older browser may not like the variable name `var`. In that
* case, the function can be called as `math['var'](...)` instead of
* `math.var(...)`.
*
* Syntax:
*
* math.variance(a, b, c, ...)
* math.variance(A)
* math.variance(A, normalization)
* math.variance(A, dimension)
* math.variance(A, dimension, normalization)
*
* Examples:
*
* math.variance(2, 4, 6) // returns 4
* math.variance([2, 4, 6, 8]) // returns 6.666666666666667
* math.variance([2, 4, 6, 8], 'uncorrected') // returns 5
* math.variance([2, 4, 6, 8], 'biased') // returns 4
*
* math.variance([[1, 2, 3], [4, 5, 6]]) // returns 3.5
* math.variance([[1, 2, 3], [4, 6, 8]], 0) // returns [4.5, 8, 12.5]
* math.variance([[1, 2, 3], [4, 6, 8]], 1) // returns [1, 4]
* math.variance([[1, 2, 3], [4, 6, 8]], 1, 'biased') // returns [0.5, 2]
*
* See also:
*
* mean, median, max, min, prod, std, sum
*
* @param {Array | Matrix} array
* A single matrix or or multiple scalar values
* @param {string} [normalization='unbiased']
* Determines how to normalize the variance.
* Choose 'unbiased' (default), 'uncorrected', or 'biased'.
* @param dimension {number | BigNumber}
* Determines the axis to compute the variance for a matrix
* @return {*} The variance
*/
return typed(variance_name, {
// variance([a, b, c, d, ...])
'Array | Matrix': function ArrayMatrix(array) {
return _var(array, DEFAULT_NORMALIZATION);
},
// variance([a, b, c, d, ...], normalization)
'Array | Matrix, string': _var,
// variance([a, b, c, c, ...], dim)
'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {
return _varDim(array, dim, DEFAULT_NORMALIZATION);
},
// variance([a, b, c, c, ...], dim, normalization)
'Array | Matrix, number | BigNumber, string': _varDim,
// variance(a, b, c, d, ...)
'...': function _(args) {
return _var(args, DEFAULT_NORMALIZATION);
}
});
/**
* Recursively calculate the variance of an n-dimensional array
* @param {Array} array
* @param {string} normalization
* Determines how to normalize the variance:
* - 'unbiased' The sum of squared errors is divided by (n - 1)
* - 'uncorrected' The sum of squared errors is divided by n
* - 'biased' The sum of squared errors is divided by (n + 1)
* @return {number | BigNumber} variance
* @private
*/
function _var(array, normalization) {
var sum = 0;
var num = 0;
if (array.length === 0) {
throw new SyntaxError('Function variance requires one or more parameters (0 provided)');
} // calculate the mean and number of elements
deepForEach(array, function (value) {
try {
sum = add(sum, value);
num++;
} catch (err) {
throw improveErrorMessage(err, 'variance', value);
}
});
if (num === 0) throw new Error('Cannot calculate variance of an empty array');
var mean = divide(sum, num); // calculate the variance
sum = 0;
deepForEach(array, function (value) {
var diff = subtract(value, mean);
sum = add(sum, multiply(diff, diff));
});
if (isNaN(sum)) {
return sum;
}
switch (normalization) {
case 'uncorrected':
return divide(sum, num);
case 'biased':
return divide(sum, num + 1);
case 'unbiased':
{
var zero = Object(is["e" /* isBigNumber */])(sum) ? sum.mul(0) : 0;
return num === 1 ? zero : divide(sum, num - 1);
}
default:
throw new Error('Unknown normalization "' + normalization + '". ' + 'Choose "unbiased" (default), "uncorrected", or "biased".');
}
}
function _varDim(array, dim, normalization) {
try {
if (array.length === 0) {
throw new SyntaxError('Function variance requires one or more parameters (0 provided)');
}
return apply(array, dim, function (x) {
return _var(x, normalization);
});
} catch (err) {
throw improveErrorMessage(err, 'variance');
}
}
});
// CONCATENATED MODULE: ./src/function/statistics/quantileSeq.js
var quantileSeq_name = 'quantileSeq';
var quantileSeq_dependencies = ['typed', 'add', 'multiply', 'partitionSelect', 'compare'];
var createQuantileSeq = /* #__PURE__ */Object(factory["a" /* factory */])(quantileSeq_name, quantileSeq_dependencies, function (_ref) {
var typed = _ref.typed,
add = _ref.add,
multiply = _ref.multiply,
partitionSelect = _ref.partitionSelect,
compare = _ref.compare;
/**
* Compute the prob order quantile of a matrix or a list with values.
* The sequence is sorted and the middle value is returned.
* Supported types of sequence values are: Number, BigNumber, Unit
* Supported types of probability are: Number, BigNumber
*
* In case of a (multi dimensional) array or matrix, the prob order quantile
* of all elements will be calculated.
*
* Syntax:
*
* math.quantileSeq(A, prob[, sorted])
* math.quantileSeq(A, [prob1, prob2, ...][, sorted])
* math.quantileSeq(A, N[, sorted])
*
* Examples:
*
* math.quantileSeq([3, -1, 5, 7], 0.5) // returns 4
* math.quantileSeq([3, -1, 5, 7], [1/3, 2/3]) // returns [3, 5]
* math.quantileSeq([3, -1, 5, 7], 2) // returns [3, 5]
* math.quantileSeq([-1, 3, 5, 7], 0.5, true) // returns 4
*
* See also:
*
* median, mean, min, max, sum, prod, std, variance
*
* @param {Array, Matrix} data A single matrix or Array
* @param {Number, BigNumber, Array} probOrN prob is the order of the quantile, while N is
* the amount of evenly distributed steps of
* probabilities; only one of these options can
* be provided
* @param {Boolean} sorted=false is data sorted in ascending order
* @return {Number, BigNumber, Unit, Array} Quantile(s)
*/
function quantileSeq(data, probOrN, sorted) {
var probArr, dataArr, one;
if (arguments.length < 2 || arguments.length > 3) {
throw new SyntaxError('Function quantileSeq requires two or three parameters');
}
if (Object(is["i" /* isCollection */])(data)) {
sorted = sorted || false;
if (typeof sorted === 'boolean') {
dataArr = data.valueOf();
if (Object(is["y" /* isNumber */])(probOrN)) {
if (probOrN < 0) {
throw new Error('N/prob must be non-negative');
}
if (probOrN <= 1) {
// quantileSeq([a, b, c, d, ...], prob[,sorted])
return _quantileSeq(dataArr, probOrN, sorted);
}
if (probOrN > 1) {
// quantileSeq([a, b, c, d, ...], N[,sorted])
if (!Object(utils_number["i" /* isInteger */])(probOrN)) {
throw new Error('N must be a positive integer');
}
var nPlusOne = probOrN + 1;
probArr = new Array(probOrN);
for (var i = 0; i < probOrN;) {
probArr[i] = _quantileSeq(dataArr, ++i / nPlusOne, sorted);
}
return probArr;
}
}
if (Object(is["e" /* isBigNumber */])(probOrN)) {
var BigNumber = probOrN.constructor;
if (probOrN.isNegative()) {
throw new Error('N/prob must be non-negative');
}
one = new BigNumber(1);
if (probOrN.lte(one)) {
// quantileSeq([a, b, c, d, ...], prob[,sorted])
return new BigNumber(_quantileSeq(dataArr, probOrN, sorted));
}
if (probOrN.gt(one)) {
// quantileSeq([a, b, c, d, ...], N[,sorted])
if (!probOrN.isInteger()) {
throw new Error('N must be a positive integer');
} // largest possible Array length is 2^32-1
// 2^32 < 10^15, thus safe conversion guaranteed
var intN = probOrN.toNumber();
if (intN > 4294967295) {
throw new Error('N must be less than or equal to 2^32-1, as that is the maximum length of an Array');
}
var _nPlusOne = new BigNumber(intN + 1);
probArr = new Array(intN);
for (var _i = 0; _i < intN;) {
probArr[_i] = new BigNumber(_quantileSeq(dataArr, new BigNumber(++_i).div(_nPlusOne), sorted));
}
return probArr;
}
}
if (Array.isArray(probOrN)) {
// quantileSeq([a, b, c, d, ...], [prob1, prob2, ...][,sorted])
probArr = new Array(probOrN.length);
for (var _i2 = 0; _i2 < probArr.length; ++_i2) {
var currProb = probOrN[_i2];
if (Object(is["y" /* isNumber */])(currProb)) {
if (currProb < 0 || currProb > 1) {
throw new Error('Probability must be between 0 and 1, inclusive');
}
} else if (Object(is["e" /* isBigNumber */])(currProb)) {
one = new currProb.constructor(1);
if (currProb.isNegative() || currProb.gt(one)) {
throw new Error('Probability must be between 0 and 1, inclusive');
}
} else {
throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function
}
probArr[_i2] = _quantileSeq(dataArr, currProb, sorted);
}
return probArr;
}
throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function
}
throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function
}
throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function
}
/**
* Calculate the prob order quantile of an n-dimensional array.
*
* @param {Array} array
* @param {Number, BigNumber} prob
* @param {Boolean} sorted
* @return {Number, BigNumber, Unit} prob order quantile
* @private
*/
function _quantileSeq(array, prob, sorted) {
var flat = Object(utils_array["e" /* flatten */])(array);
var len = flat.length;
if (len === 0) {
throw new Error('Cannot calculate quantile of an empty sequence');
}
if (Object(is["y" /* isNumber */])(prob)) {
var _index = prob * (len - 1);
var _fracPart = _index % 1;
if (_fracPart === 0) {
var value = sorted ? flat[_index] : partitionSelect(flat, _index);
validate(value);
return value;
}
var _integerPart = Math.floor(_index);
var _left;
var _right;
if (sorted) {
_left = flat[_integerPart];
_right = flat[_integerPart + 1];
} else {
_right = partitionSelect(flat, _integerPart + 1); // max of partition is kth largest
_left = flat[_integerPart];
for (var i = 0; i < _integerPart; ++i) {
if (compare(flat[i], _left) > 0) {
_left = flat[i];
}
}
}
validate(_left);
validate(_right); // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]
return add(multiply(_left, 1 - _fracPart), multiply(_right, _fracPart));
} // If prob is a BigNumber
var index = prob.times(len - 1);
if (index.isInteger()) {
index = index.toNumber();
var _value = sorted ? flat[index] : partitionSelect(flat, index);
validate(_value);
return _value;
}
var integerPart = index.floor();
var fracPart = index.minus(integerPart);
var integerPartNumber = integerPart.toNumber();
var left;
var right;
if (sorted) {
left = flat[integerPartNumber];
right = flat[integerPartNumber + 1];
} else {
right = partitionSelect(flat, integerPartNumber + 1); // max of partition is kth largest
left = flat[integerPartNumber];
for (var _i3 = 0; _i3 < integerPartNumber; ++_i3) {
if (compare(flat[_i3], left) > 0) {
left = flat[_i3];
}
}
}
validate(left);
validate(right); // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]
var one = new fracPart.constructor(1);
return add(multiply(left, one.minus(fracPart)), multiply(right, fracPart));
}
/**
* Check if array value types are valid, throw error otherwise.
* @param {number | BigNumber | Unit} x
* @param {number | BigNumber | Unit} x
* @private
*/
var validate = typed({
'number | BigNumber | Unit': function numberBigNumberUnit(x) {
return x;
}
});
return quantileSeq;
});
// CONCATENATED MODULE: ./src/function/statistics/std.js
var std_name = 'std';
var std_dependencies = ['typed', 'sqrt', 'variance'];
var createStd = /* #__PURE__ */Object(factory["a" /* factory */])(std_name, std_dependencies, function (_ref) {
var typed = _ref.typed,
sqrt = _ref.sqrt,
variance = _ref.variance;
/**
* Compute the standard deviation of a matrix or a list with values.
* The standard deviations is defined as the square root of the variance:
* `std(A) = sqrt(variance(A))`.
* In case of a (multi dimensional) array or matrix, the standard deviation
* over all elements will be calculated by default, unless an axis is specified
* in which case the standard deviation will be computed along that axis.
*
* Additionally, it is possible to compute the standard deviation along the rows
* or columns of a matrix by specifying the dimension as the second argument.
*
* Optionally, the type of normalization can be specified as the final
* parameter. The parameter `normalization` can be one of the following values:
*
* - 'unbiased' (default) The sum of squared errors is divided by (n - 1)
* - 'uncorrected' The sum of squared errors is divided by n
* - 'biased' The sum of squared errors is divided by (n + 1)
*
*
* Syntax:
*
* math.std(a, b, c, ...)
* math.std(A)
* math.std(A, normalization)
* math.std(A, dimension)
* math.std(A, dimension, normalization)
*
* Examples:
*
* math.std(2, 4, 6) // returns 2
* math.std([2, 4, 6, 8]) // returns 2.581988897471611
* math.std([2, 4, 6, 8], 'uncorrected') // returns 2.23606797749979
* math.std([2, 4, 6, 8], 'biased') // returns 2
*
* math.std([[1, 2, 3], [4, 5, 6]]) // returns 1.8708286933869707
* math.std([[1, 2, 3], [4, 6, 8]], 0) // returns [2.1213203435596424, 2.8284271247461903, 3.5355339059327378]
* math.std([[1, 2, 3], [4, 6, 8]], 1) // returns [1, 2]
* math.std([[1, 2, 3], [4, 6, 8]], 1, 'biased') // returns [0.7071067811865476, 1.4142135623730951]
*
* See also:
*
* mean, median, max, min, prod, sum, variance
*
* @param {Array | Matrix} array
* A single matrix or or multiple scalar values
* @param {string} [normalization='unbiased']
* Determines how to normalize the variance.
* Choose 'unbiased' (default), 'uncorrected', or 'biased'.
* @param dimension {number | BigNumber}
* Determines the axis to compute the standard deviation for a matrix
* @return {*} The standard deviation
*/
return typed(std_name, {
// std([a, b, c, d, ...])
'Array | Matrix': _std,
// std([a, b, c, d, ...], normalization)
'Array | Matrix, string': _std,
// std([a, b, c, c, ...], dim)
'Array | Matrix, number | BigNumber': _std,
// std([a, b, c, c, ...], dim, normalization)
'Array | Matrix, number | BigNumber, string': _std,
// std(a, b, c, d, ...)
'...': function _(args) {
return _std(args);
}
});
function _std(array, normalization) {
if (array.length === 0) {
throw new SyntaxError('Function std requires one or more parameters (0 provided)');
}
try {
return sqrt(variance.apply(null, arguments));
} catch (err) {
if (err instanceof TypeError && err.message.indexOf(' variance') !== -1) {
throw new TypeError(err.message.replace(' variance', ' std'));
} else {
throw err;
}
}
}
});
// CONCATENATED MODULE: ./src/utils/product.js
/** @param {number} i
* @param {number} n
* @returns {number} product of i to n
*/
function product_product(i, n) {
if (n < i) {
return 1;
}
if (n === i) {
return n;
}
var half = n + i >> 1; // divide (n + i) by 2 and truncate to integer
return product_product(i, half) * product_product(half + 1, n);
}
// CONCATENATED MODULE: ./src/plain/number/combinations.js
function combinationsNumber(n, k) {
if (!Object(utils_number["i" /* isInteger */])(n) || n < 0) {
throw new TypeError('Positive integer value expected in function combinations');
}
if (!Object(utils_number["i" /* isInteger */])(k) || k < 0) {
throw new TypeError('Positive integer value expected in function combinations');
}
if (k > n) {
throw new TypeError('k must be less than or equal to n');
}
var nMinusk = n - k;
var prodrange;
if (k < nMinusk) {
prodrange = product_product(nMinusk + 1, n);
return prodrange / product_product(1, k);
}
prodrange = product_product(k + 1, n);
return prodrange / product_product(1, nMinusk);
}
combinationsNumber.signature = 'number, number';
// CONCATENATED MODULE: ./src/function/probability/combinations.js
var combinations_name = 'combinations';
var combinations_dependencies = ['typed'];
var createCombinations = /* #__PURE__ */Object(factory["a" /* factory */])(combinations_name, combinations_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Compute the number of ways of picking `k` unordered outcomes from `n`
* possibilities.
*
* Combinations only takes integer arguments.
* The following condition must be enforced: k <= n.
*
* Syntax:
*
* math.combinations(n, k)
*
* Examples:
*
* math.combinations(7, 5) // returns 21
*
* See also:
*
* combinationsWithRep, permutations, factorial
*
* @param {number | BigNumber} n Total number of objects in the set
* @param {number | BigNumber} k Number of objects in the subset
* @return {number | BigNumber} Number of possible combinations.
*/
return typed(combinations_name, {
'number, number': combinationsNumber,
'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {
var BigNumber = n.constructor;
var result, i;
var nMinusk = n.minus(k);
var one = new BigNumber(1);
if (!isPositiveInteger(n) || !isPositiveInteger(k)) {
throw new TypeError('Positive integer value expected in function combinations');
}
if (k.gt(n)) {
throw new TypeError('k must be less than n in function combinations');
}
result = one;
if (k.lt(nMinusk)) {
for (i = one; i.lte(nMinusk); i = i.plus(one)) {
result = result.times(k.plus(i)).dividedBy(i);
}
} else {
for (i = one; i.lte(k); i = i.plus(one)) {
result = result.times(nMinusk.plus(i)).dividedBy(i);
}
}
return result;
} // TODO: implement support for collection in combinations
});
});
/**
* Test whether BigNumber n is a positive integer
* @param {BigNumber} n
* @returns {boolean} isPositiveInteger
*/
function isPositiveInteger(n) {
return n.isInteger() && n.gte(0);
}
// CONCATENATED MODULE: ./src/function/probability/combinationsWithRep.js
var combinationsWithRep_name = 'combinationsWithRep';
var combinationsWithRep_dependencies = ['typed'];
var createCombinationsWithRep = /* #__PURE__ */Object(factory["a" /* factory */])(combinationsWithRep_name, combinationsWithRep_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Compute the number of ways of picking `k` unordered outcomes from `n`
* possibilities, allowing individual outcomes to be repeated more than once.
*
* CombinationsWithRep only takes integer arguments.
* The following condition must be enforced: k <= n + k -1.
*
* Syntax:
*
* math.combinationsWithRep(n, k)
*
* Examples:
*
* math.combinationsWithRep(7, 5) // returns 462
*
* See also:
*
* combinations, permutations, factorial
*
* @param {number | BigNumber} n Total number of objects in the set
* @param {number | BigNumber} k Number of objects in the subset
* @return {number | BigNumber} Number of possible combinations with replacement.
*/
return typed(combinationsWithRep_name, {
'number, number': function numberNumber(n, k) {
if (!Object(utils_number["i" /* isInteger */])(n) || n < 0) {
throw new TypeError('Positive integer value expected in function combinationsWithRep');
}
if (!Object(utils_number["i" /* isInteger */])(k) || k < 0) {
throw new TypeError('Positive integer value expected in function combinationsWithRep');
}
if (n < 1) {
throw new TypeError('k must be less than or equal to n + k - 1');
}
if (k < n - 1) {
var _prodrange = product_product(n, n + k - 1);
return _prodrange / product_product(1, k);
}
var prodrange = product_product(k + 1, n + k - 1);
return prodrange / product_product(1, n - 1);
},
'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {
var BigNumber = n.constructor;
var result, i;
var one = new BigNumber(1);
var nMinusOne = n.minus(one);
if (!combinationsWithRep_isPositiveInteger(n) || !combinationsWithRep_isPositiveInteger(k)) {
throw new TypeError('Positive integer value expected in function combinationsWithRep');
}
if (n.lt(one)) {
throw new TypeError('k must be less than or equal to n + k - 1 in function combinationsWithRep');
}
result = one;
if (k.lt(nMinusOne)) {
for (i = one; i.lte(nMinusOne); i = i.plus(one)) {
result = result.times(k.plus(i)).dividedBy(i);
}
} else {
for (i = one; i.lte(k); i = i.plus(one)) {
result = result.times(nMinusOne.plus(i)).dividedBy(i);
}
}
return result;
}
});
});
/**
* Test whether BigNumber n is a positive integer
* @param {BigNumber} n
* @returns {boolean} isPositiveInteger
*/
function combinationsWithRep_isPositiveInteger(n) {
return n.isInteger() && n.gte(0);
}
// CONCATENATED MODULE: ./src/plain/number/probability.js
function gammaNumber(n) {
var x;
if (Object(utils_number["i" /* isInteger */])(n)) {
if (n <= 0) {
return isFinite(n) ? Infinity : NaN;
}
if (n > 171) {
return Infinity; // Will overflow
}
return product_product(1, n - 1);
}
if (n < 0.5) {
return Math.PI / (Math.sin(Math.PI * n) * gammaNumber(1 - n));
}
if (n >= 171.35) {
return Infinity; // will overflow
}
if (n > 85.0) {
// Extended Stirling Approx
var twoN = n * n;
var threeN = twoN * n;
var fourN = threeN * n;
var fiveN = fourN * n;
return Math.sqrt(2 * Math.PI / n) * Math.pow(n / Math.E, n) * (1 + 1 / (12 * n) + 1 / (288 * twoN) - 139 / (51840 * threeN) - 571 / (2488320 * fourN) + 163879 / (209018880 * fiveN) + 5246819 / (75246796800 * fiveN * n));
}
--n;
x = gammaP[0];
for (var i = 1; i < gammaP.length; ++i) {
x += gammaP[i] / (n + i);
}
var t = n + gammaG + 0.5;
return Math.sqrt(2 * Math.PI) * Math.pow(t, n + 0.5) * Math.exp(-t) * x;
}
gammaNumber.signature = 'number'; // TODO: comment on the variables g and p
var gammaG = 4.7421875;
var gammaP = [0.99999999999999709182, 57.156235665862923517, -59.597960355475491248, 14.136097974741747174, -0.49191381609762019978, 0.33994649984811888699e-4, 0.46523628927048575665e-4, -0.98374475304879564677e-4, 0.15808870322491248884e-3, -0.21026444172410488319e-3, 0.21743961811521264320e-3, -0.16431810653676389022e-3, 0.84418223983852743293e-4, -0.26190838401581408670e-4, 0.36899182659531622704e-5];
// CONCATENATED MODULE: ./src/function/probability/gamma.js
var gamma_name = 'gamma';
var gamma_dependencies = ['typed', 'config', 'multiplyScalar', 'pow', 'BigNumber', 'Complex'];
var createGamma = /* #__PURE__ */Object(factory["a" /* factory */])(gamma_name, gamma_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
multiplyScalar = _ref.multiplyScalar,
pow = _ref.pow,
_BigNumber = _ref.BigNumber,
_Complex = _ref.Complex;
/**
* Compute the gamma function of a value using Lanczos approximation for
* small values, and an extended Stirling approximation for large values.
*
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.gamma(n)
*
* Examples:
*
* math.gamma(5) // returns 24
* math.gamma(-0.5) // returns -3.5449077018110335
* math.gamma(math.i) // returns -0.15494982830180973 - 0.49801566811835596i
*
* See also:
*
* combinations, factorial, permutations
*
* @param {number | Array | Matrix} n A real or complex number
* @return {number | Array | Matrix} The gamma of `n`
*/
return typed(gamma_name, {
number: gammaNumber,
Complex: function Complex(n) {
if (n.im === 0) {
return this(n.re);
}
n = new _Complex(n.re - 1, n.im);
var x = new _Complex(gammaP[0], 0);
for (var i = 1; i < gammaP.length; ++i) {
var real = n.re + i; // x += p[i]/(n+i)
var den = real * real + n.im * n.im;
if (den !== 0) {
x.re += gammaP[i] * real / den;
x.im += -(gammaP[i] * n.im) / den;
} else {
x.re = gammaP[i] < 0 ? -Infinity : Infinity;
}
}
var t = new _Complex(n.re + gammaG + 0.5, n.im);
var twoPiSqrt = Math.sqrt(2 * Math.PI);
n.re += 0.5;
var result = pow(t, n);
if (result.im === 0) {
// sqrt(2*PI)*result
result.re *= twoPiSqrt;
} else if (result.re === 0) {
result.im *= twoPiSqrt;
} else {
result.re *= twoPiSqrt;
result.im *= twoPiSqrt;
}
var r = Math.exp(-t.re); // exp(-t)
t.re = r * Math.cos(-t.im);
t.im = r * Math.sin(-t.im);
return multiplyScalar(multiplyScalar(result, t), x);
},
BigNumber: function BigNumber(n) {
if (n.isInteger()) {
return n.isNegative() || n.isZero() ? new _BigNumber(Infinity) : bigFactorial(n.minus(1));
}
if (!n.isFinite()) {
return new _BigNumber(n.isNegative() ? NaN : Infinity);
}
throw new Error('Integer BigNumber expected');
},
'Array | Matrix': function ArrayMatrix(n) {
return deepMap(n, this);
}
});
/**
* Calculate factorial for a BigNumber
* @param {BigNumber} n
* @returns {BigNumber} Returns the factorial of n
*/
function bigFactorial(n) {
if (n < 8) {
return new _BigNumber([1, 1, 2, 6, 24, 120, 720, 5040][n]);
}
var precision = config.precision + (Math.log(n.toNumber()) | 0);
var Big = _BigNumber.clone({
precision: precision
});
if (n % 2 === 1) {
return n.times(bigFactorial(new _BigNumber(n - 1)));
}
var p = n;
var prod = new Big(n);
var sum = n.toNumber();
while (p > 2) {
p -= 2;
sum += p;
prod = prod.times(sum);
}
return new _BigNumber(prod.toPrecision(_BigNumber.precision));
}
});
// CONCATENATED MODULE: ./src/function/probability/factorial.js
var factorial_name = 'factorial';
var factorial_dependencies = ['typed', 'gamma'];
var createFactorial = /* #__PURE__ */Object(factory["a" /* factory */])(factorial_name, factorial_dependencies, function (_ref) {
var typed = _ref.typed,
gamma = _ref.gamma;
/**
* Compute the factorial of a value
*
* Factorial only supports an integer value as argument.
* For matrices, the function is evaluated element wise.
*
* Syntax:
*
* math.factorial(n)
*
* Examples:
*
* math.factorial(5) // returns 120
* math.factorial(3) // returns 6
*
* See also:
*
* combinations, combinationsWithRep, gamma, permutations
*
* @param {number | BigNumber | Array | Matrix} n An integer number
* @return {number | BigNumber | Array | Matrix} The factorial of `n`
*/
return typed(factorial_name, {
number: function number(n) {
if (n < 0) {
throw new Error('Value must be non-negative');
}
return gamma(n + 1);
},
BigNumber: function BigNumber(n) {
if (n.isNegative()) {
throw new Error('Value must be non-negative');
}
return gamma(n.plus(1));
},
'Array | Matrix': function ArrayMatrix(n) {
return deepMap(n, this);
}
});
});
// CONCATENATED MODULE: ./src/function/probability/kldivergence.js
var kldivergence_name = 'kldivergence';
var kldivergence_dependencies = ['typed', 'matrix', 'divide', 'sum', 'multiply', 'dotDivide', 'log', 'isNumeric'];
var createKldivergence = /* #__PURE__ */Object(factory["a" /* factory */])(kldivergence_name, kldivergence_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
divide = _ref.divide,
sum = _ref.sum,
multiply = _ref.multiply,
dotDivide = _ref.dotDivide,
log = _ref.log,
isNumeric = _ref.isNumeric;
/**
* Calculate the Kullback-Leibler (KL) divergence between two distributions
*
* Syntax:
*
* math.kldivergence(x, y)
*
* Examples:
*
* math.kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5]) //returns 0.24376698773121153
*
*
* @param {Array | Matrix} q First vector
* @param {Array | Matrix} p Second vector
* @return {number} Returns distance between q and p
*/
return typed(kldivergence_name, {
'Array, Array': function ArrayArray(q, p) {
return _kldiv(matrix(q), matrix(p));
},
'Matrix, Array': function MatrixArray(q, p) {
return _kldiv(q, matrix(p));
},
'Array, Matrix': function ArrayMatrix(q, p) {
return _kldiv(matrix(q), p);
},
'Matrix, Matrix': function MatrixMatrix(q, p) {
return _kldiv(q, p);
}
});
function _kldiv(q, p) {
var plength = p.size().length;
var qlength = q.size().length;
if (plength > 1) {
throw new Error('first object must be one dimensional');
}
if (qlength > 1) {
throw new Error('second object must be one dimensional');
}
if (plength !== qlength) {
throw new Error('Length of two vectors must be equal');
} // Before calculation, apply normalization
var sumq = sum(q);
if (sumq === 0) {
throw new Error('Sum of elements in first object must be non zero');
}
var sump = sum(p);
if (sump === 0) {
throw new Error('Sum of elements in second object must be non zero');
}
var qnorm = divide(q, sum(q));
var pnorm = divide(p, sum(p));
var result = sum(multiply(qnorm, log(dotDivide(qnorm, pnorm))));
if (isNumeric(result)) {
return result;
} else {
return Number.NaN;
}
}
});
// CONCATENATED MODULE: ./src/function/probability/multinomial.js
var multinomial_name = 'multinomial';
var multinomial_dependencies = ['typed', 'add', 'divide', 'multiply', 'factorial', 'isInteger', 'isPositive'];
var createMultinomial = /* #__PURE__ */Object(factory["a" /* factory */])(multinomial_name, multinomial_dependencies, function (_ref) {
var typed = _ref.typed,
add = _ref.add,
divide = _ref.divide,
multiply = _ref.multiply,
factorial = _ref.factorial,
isInteger = _ref.isInteger,
isPositive = _ref.isPositive;
/**
* Multinomial Coefficients compute the number of ways of picking a1, a2, ..., ai unordered outcomes from `n` possibilities.
*
* multinomial takes one array of integers as an argument.
* The following condition must be enforced: every ai <= 0
*
* Syntax:
*
* math.multinomial(a) // a is an array type
*
* Examples:
*
* math.multinomial([1,2,1]) // returns 12
*
* See also:
*
* combinations, factorial
*
* @param {number[] | BigNumber[]} a Integer numbers of objects in the subset
* @return {Number | BigNumber} Multinomial coefficient.
*/
return typed(multinomial_name, {
'Array | Matrix': function ArrayMatrix(a) {
var sum = 0;
var denom = 1;
deepForEach(a, function (ai) {
if (!isInteger(ai) || !isPositive(ai)) {
throw new TypeError('Positive integer value expected in function multinomial');
}
sum = add(sum, ai);
denom = multiply(denom, factorial(ai));
});
return divide(factorial(sum), denom);
}
});
});
// CONCATENATED MODULE: ./src/function/probability/permutations.js
var permutations_name = 'permutations';
var permutations_dependencies = ['typed', 'factorial'];
var createPermutations = /* #__PURE__ */Object(factory["a" /* factory */])(permutations_name, permutations_dependencies, function (_ref) {
var typed = _ref.typed,
factorial = _ref.factorial;
/**
* Compute the number of ways of obtaining an ordered subset of `k` elements
* from a set of `n` elements.
*
* Permutations only takes integer arguments.
* The following condition must be enforced: k <= n.
*
* Syntax:
*
* math.permutations(n)
* math.permutations(n, k)
*
* Examples:
*
* math.permutations(5) // 120
* math.permutations(5, 3) // 60
*
* See also:
*
* combinations, combinationsWithRep, factorial
*
* @param {number | BigNumber} n The number of objects in total
* @param {number | BigNumber} [k] The number of objects in the subset
* @return {number | BigNumber} The number of permutations
*/
return typed(permutations_name, {
'number | BigNumber': factorial,
'number, number': function numberNumber(n, k) {
if (!Object(utils_number["i" /* isInteger */])(n) || n < 0) {
throw new TypeError('Positive integer value expected in function permutations');
}
if (!Object(utils_number["i" /* isInteger */])(k) || k < 0) {
throw new TypeError('Positive integer value expected in function permutations');
}
if (k > n) {
throw new TypeError('second argument k must be less than or equal to first argument n');
} // Permute n objects, k at a time
return product_product(n - k + 1, n);
},
'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {
var result, i;
if (!permutations_isPositiveInteger(n) || !permutations_isPositiveInteger(k)) {
throw new TypeError('Positive integer value expected in function permutations');
}
if (k.gt(n)) {
throw new TypeError('second argument k must be less than or equal to first argument n');
}
var one = n.mul(0).add(1);
result = one;
for (i = n.minus(k).plus(1); i.lte(n); i = i.plus(1)) {
result = result.times(i);
}
return result;
} // TODO: implement support for collection in permutations
});
});
/**
* Test whether BigNumber n is a positive integer
* @param {BigNumber} n
* @returns {boolean} isPositiveInteger
*/
function permutations_isPositiveInteger(n) {
return n.isInteger() && n.gte(0);
}
// EXTERNAL MODULE: ./node_modules/seed-random/index.js
var seed_random = __webpack_require__(14);
var seed_random_default = /*#__PURE__*/__webpack_require__.n(seed_random);
// CONCATENATED MODULE: ./src/function/probability/util/seededRNG.js
// create a random seed here to prevent an infinite loop from seed-random
// inside the factory. Reason is that math.random is defined as a getter/setter
// and seed-random generates a seed from the local entropy by reading every
// defined object including `math` itself. That means that whilst getting
// math.random, it tries to get math.random, etc... an infinite loop.
// See https://github.com/ForbesLindesay/seed-random/issues/6
var singletonRandom = /* #__PURE__ */seed_random_default()();
function createRng(randomSeed) {
var random; // create a new random generator with given seed
function setSeed(seed) {
random = seed === null ? singletonRandom : seed_random_default()(String(seed));
} // initialize a seeded pseudo random number generator with config's random seed
setSeed(randomSeed); // wrapper function so the rng can be updated via generator
function rng() {
return random();
}
return rng;
}
// CONCATENATED MODULE: ./src/function/probability/pickRandom.js
var pickRandom_name = 'pickRandom';
var pickRandom_dependencies = ['typed', 'config', '?on'];
var createPickRandom = /* #__PURE__ */Object(factory["a" /* factory */])(pickRandom_name, pickRandom_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
on = _ref.on;
// seeded pseudo random number generator
var rng = createRng(config.randomSeed);
if (on) {
on('config', function (curr, prev) {
if (curr.randomSeed !== prev.randomSeed) {
rng = createRng(curr.randomSeed);
}
});
}
/**
* Random pick one or more values from a one dimensional array.
* Array elements are picked using a random function with uniform or weighted distribution.
*
* Syntax:
*
* math.pickRandom(array)
* math.pickRandom(array, number)
* math.pickRandom(array, weights)
* math.pickRandom(array, number, weights)
* math.pickRandom(array, weights, number)
*
* Examples:
*
* math.pickRandom([3, 6, 12, 2]) // returns one of the values in the array
* math.pickRandom([3, 6, 12, 2], 2) // returns an array of two of the values in the array
* math.pickRandom([3, 6, 12, 2], [1, 3, 2, 1]) // returns one of the values in the array with weighted distribution
* math.pickRandom([3, 6, 12, 2], 2, [1, 3, 2, 1]) // returns an array of two of the values in the array with weighted distribution
* math.pickRandom([3, 6, 12, 2], [1, 3, 2, 1], 2) // returns an array of two of the values in the array with weighted distribution
*
* See also:
*
* random, randomInt
*
* @param {Array | Matrix} array A one dimensional array
* @param {Int} number An int or float
* @param {Array | Matrix} weights An array of ints or floats
* @return {number | Array} Returns a single random value from array when number is 1 or undefined.
* Returns an array with the configured number of elements when number is > 1.
*/
return typed({
'Array | Matrix': function ArrayMatrix(possibles) {
return _pickRandom(possibles);
},
'Array | Matrix, number': function ArrayMatrixNumber(possibles, number) {
return _pickRandom(possibles, number, undefined);
},
'Array | Matrix, Array': function ArrayMatrixArray(possibles, weights) {
return _pickRandom(possibles, undefined, weights);
},
'Array | Matrix, Array | Matrix, number': function ArrayMatrixArrayMatrixNumber(possibles, weights, number) {
return _pickRandom(possibles, number, weights);
},
'Array | Matrix, number, Array | Matrix': function ArrayMatrixNumberArrayMatrix(possibles, number, weights) {
return _pickRandom(possibles, number, weights);
}
});
function _pickRandom(possibles, number, weights) {
var single = typeof number === 'undefined';
if (single) {
number = 1;
}
possibles = possibles.valueOf(); // get Array
if (weights) {
weights = weights.valueOf(); // get Array
}
if (Object(utils_array["a" /* arraySize */])(possibles).length > 1) {
throw new Error('Only one dimensional vectors supported');
}
var totalWeights = 0;
if (typeof weights !== 'undefined') {
if (weights.length !== possibles.length) {
throw new Error('Weights must have the same length as possibles');
}
for (var i = 0, len = weights.length; i < len; i++) {
if (!Object(is["y" /* isNumber */])(weights[i]) || weights[i] < 0) {
throw new Error('Weights must be an array of positive numbers');
}
totalWeights += weights[i];
}
}
var length = possibles.length;
if (length === 0) {
return [];
} else if (number >= length) {
return number > 1 ? possibles : possibles[0];
}
var result = [];
var pick;
while (result.length < number) {
if (typeof weights === 'undefined') {
pick = possibles[Math.floor(rng() * length)];
} else {
var randKey = rng() * totalWeights;
for (var _i = 0, _len = possibles.length; _i < _len; _i++) {
randKey -= weights[_i];
if (randKey < 0) {
pick = possibles[_i];
break;
}
}
}
if (result.indexOf(pick) === -1) {
result.push(pick);
}
}
return single ? result[0] : result; // TODO: return matrix when input was a matrix
// TODO: add support for multi dimensional matrices
}
});
// CONCATENATED MODULE: ./src/function/probability/util/randomMatrix.js
/**
* This is a util function for generating a random matrix recursively.
* @param {number[]} size
* @param {function} random
* @returns {Array}
*/
function randomMatrix(size, random) {
var data = [];
size = size.slice(0);
if (size.length > 1) {
for (var i = 0, length = size.shift(); i < length; i++) {
data.push(randomMatrix(size, random));
}
} else {
for (var _i = 0, _length = size.shift(); _i < _length; _i++) {
data.push(random());
}
}
return data;
}
// CONCATENATED MODULE: ./src/function/probability/random.js
var random_name = 'random';
var random_dependencies = ['typed', 'config', '?on'];
var createRandom = /* #__PURE__ */Object(factory["a" /* factory */])(random_name, random_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
on = _ref.on;
// seeded pseudo random number generator
var rng = createRng(config.randomSeed);
if (on) {
on('config', function (curr, prev) {
if (curr.randomSeed !== prev.randomSeed) {
rng = createRng(curr.randomSeed);
}
});
}
/**
* Return a random number larger or equal to `min` and smaller than `max`
* using a uniform distribution.
*
* Syntax:
*
* math.random() // generate a random number between 0 and 1
* math.random(max) // generate a random number between 0 and max
* math.random(min, max) // generate a random number between min and max
* math.random(size) // generate a matrix with random numbers between 0 and 1
* math.random(size, max) // generate a matrix with random numbers between 0 and max
* math.random(size, min, max) // generate a matrix with random numbers between min and max
*
* Examples:
*
* math.random() // returns a random number between 0 and 1
* math.random(100) // returns a random number between 0 and 100
* math.random(30, 40) // returns a random number between 30 and 40
* math.random([2, 3]) // returns a 2x3 matrix with random numbers between 0 and 1
*
* See also:
*
* randomInt, pickRandom
*
* @param {Array | Matrix} [size] If provided, an array or matrix with given
* size and filled with random values is returned
* @param {number} [min] Minimum boundary for the random value, included
* @param {number} [max] Maximum boundary for the random value, excluded
* @return {number | Array | Matrix} A random number
*/
return typed(random_name, {
'': function _() {
return _random(0, 1);
},
number: function number(max) {
return _random(0, max);
},
'number, number': function numberNumber(min, max) {
return _random(min, max);
},
'Array | Matrix': function ArrayMatrix(size) {
return _randomMatrix(size, 0, 1);
},
'Array | Matrix, number': function ArrayMatrixNumber(size, max) {
return _randomMatrix(size, 0, max);
},
'Array | Matrix, number, number': function ArrayMatrixNumberNumber(size, min, max) {
return _randomMatrix(size, min, max);
}
});
function _randomMatrix(size, min, max) {
var res = randomMatrix(size.valueOf(), function () {
return _random(min, max);
});
return Object(is["v" /* isMatrix */])(size) ? size.create(res) : res;
}
function _random(min, max) {
return min + rng() * (max - min);
}
}); // number only implementation of random, no matrix support
// TODO: there is quite some duplicate code in both createRandom and createRandomNumber, can we improve that?
var createRandomNumber = /* #__PURE__ */Object(factory["a" /* factory */])(random_name, ['typed', 'config', '?on'], function (_ref2) {
var typed = _ref2.typed,
config = _ref2.config,
on = _ref2.on,
matrix = _ref2.matrix;
// seeded pseudo random number generator1
var rng = createRng(config.randomSeed);
if (on) {
on('config', function (curr, prev) {
if (curr.randomSeed !== prev.randomSeed) {
rng = createRng(curr.randomSeed);
}
});
}
return typed(random_name, {
'': function _() {
return _random(0, 1);
},
number: function number(max) {
return _random(0, max);
},
'number, number': function numberNumber(min, max) {
return _random(min, max);
}
});
function _random(min, max) {
return min + rng() * (max - min);
}
});
// CONCATENATED MODULE: ./src/function/probability/randomInt.js
var randomInt_name = 'randomInt';
var randomInt_dependencies = ['typed', 'config', '?on'];
var createRandomInt = /* #__PURE__ */Object(factory["a" /* factory */])(randomInt_name, randomInt_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
on = _ref.on;
// seeded pseudo random number generator
var rng = createRng(config.randomSeed);
if (on) {
on('config', function (curr, prev) {
if (curr.randomSeed !== prev.randomSeed) {
rng = createRng(curr.randomSeed);
}
});
}
/**
* Return a random integer number larger or equal to `min` and smaller than `max`
* using a uniform distribution.
*
* Syntax:
*
* math.randomInt() // generate a random integer between 0 and 1
* math.randomInt(max) // generate a random integer between 0 and max
* math.randomInt(min, max) // generate a random integer between min and max
* math.randomInt(size) // generate a matrix with random integer between 0 and 1
* math.randomInt(size, max) // generate a matrix with random integer between 0 and max
* math.randomInt(size, min, max) // generate a matrix with random integer between min and max
*
* Examples:
*
* math.randomInt(100) // returns a random integer between 0 and 100
* math.randomInt(30, 40) // returns a random integer between 30 and 40
* math.randomInt([2, 3]) // returns a 2x3 matrix with random integers between 0 and 1
*
* See also:
*
* random, pickRandom
*
* @param {Array | Matrix} [size] If provided, an array or matrix with given
* size and filled with random values is returned
* @param {number} [min] Minimum boundary for the random value, included
* @param {number} [max] Maximum boundary for the random value, excluded
* @return {number | Array | Matrix} A random integer value
*/
return typed(randomInt_name, {
'': function _() {
return _randomInt(0, 1);
},
number: function number(max) {
return _randomInt(0, max);
},
'number, number': function numberNumber(min, max) {
return _randomInt(min, max);
},
'Array | Matrix': function ArrayMatrix(size) {
return _randomIntMatrix(size, 0, 1);
},
'Array | Matrix, number': function ArrayMatrixNumber(size, max) {
return _randomIntMatrix(size, 0, max);
},
'Array | Matrix, number, number': function ArrayMatrixNumberNumber(size, min, max) {
return _randomIntMatrix(size, min, max);
}
});
function _randomIntMatrix(size, min, max) {
var res = randomMatrix(size.valueOf(), function () {
return _randomInt(min, max);
});
return Object(is["v" /* isMatrix */])(size) ? size.create(res) : res;
}
function _randomInt(min, max) {
return Math.floor(min + rng() * (max - min));
}
});
// CONCATENATED MODULE: ./src/function/combinatorics/stirlingS2.js
var stirlingS2_name = 'stirlingS2';
var stirlingS2_dependencies = ['typed', 'addScalar', 'subtract', 'multiplyScalar', 'divideScalar', 'pow', 'factorial', 'combinations', 'isNegative', 'isInteger', 'larger'];
var createStirlingS2 = /* #__PURE__ */Object(factory["a" /* factory */])(stirlingS2_name, stirlingS2_dependencies, function (_ref) {
var typed = _ref.typed,
addScalar = _ref.addScalar,
subtract = _ref.subtract,
multiplyScalar = _ref.multiplyScalar,
divideScalar = _ref.divideScalar,
pow = _ref.pow,
factorial = _ref.factorial,
combinations = _ref.combinations,
isNegative = _ref.isNegative,
isInteger = _ref.isInteger,
larger = _ref.larger;
/**
* The Stirling numbers of the second kind, counts the number of ways to partition
* a set of n labelled objects into k nonempty unlabelled subsets.
* stirlingS2 only takes integer arguments.
* The following condition must be enforced: k <= n.
*
* If n = k or k = 1, then s(n,k) = 1
*
* Syntax:
*
* math.stirlingS2(n, k)
*
* Examples:
*
* math.stirlingS2(5, 3) //returns 25
*
* See also:
*
* bellNumbers
*
* @param {Number | BigNumber} n Total number of objects in the set
* @param {Number | BigNumber} k Number of objects in the subset
* @return {Number | BigNumber} S(n,k)
*/
return typed(stirlingS2_name, {
'number | BigNumber, number | BigNumber': function numberBigNumberNumberBigNumber(n, k) {
if (!isInteger(n) || isNegative(n) || !isInteger(k) || isNegative(k)) {
throw new TypeError('Non-negative integer value expected in function stirlingS2');
} else if (larger(k, n)) {
throw new TypeError('k must be less than or equal to n in function stirlingS2');
} // 1/k! Sum(i=0 -> k) [(-1)^(k-i)*C(k,j)* i^n]
var kFactorial = factorial(k);
var result = 0;
for (var i = 0; i <= k; i++) {
var negativeOne = pow(-1, subtract(k, i));
var kChooseI = combinations(k, i);
var iPower = pow(i, n);
result = addScalar(result, multiplyScalar(multiplyScalar(kChooseI, iPower), negativeOne));
}
return divideScalar(result, kFactorial);
}
});
});
// CONCATENATED MODULE: ./src/function/combinatorics/bellNumbers.js
var bellNumbers_name = 'bellNumbers';
var bellNumbers_dependencies = ['typed', 'addScalar', 'isNegative', 'isInteger', 'stirlingS2'];
var createBellNumbers = /* #__PURE__ */Object(factory["a" /* factory */])(bellNumbers_name, bellNumbers_dependencies, function (_ref) {
var typed = _ref.typed,
addScalar = _ref.addScalar,
isNegative = _ref.isNegative,
isInteger = _ref.isInteger,
stirlingS2 = _ref.stirlingS2;
/**
* The Bell Numbers count the number of partitions of a set. A partition is a pairwise disjoint subset of S whose union is S.
* bellNumbers only takes integer arguments.
* The following condition must be enforced: n >= 0
*
* Syntax:
*
* math.bellNumbers(n)
*
* Examples:
*
* math.bellNumbers(3) // returns 5
* math.bellNumbers(8) // returns 4140
*
* See also:
*
* stirlingS2
*
* @param {Number | BigNumber} n Total number of objects in the set
* @return {Number | BigNumber} B(n)
*/
return typed(bellNumbers_name, {
'number | BigNumber': function numberBigNumber(n) {
if (!isInteger(n) || isNegative(n)) {
throw new TypeError('Non-negative integer value expected in function bellNumbers');
} // Sum (k=0, n) S(n,k).
var result = 0;
for (var i = 0; i <= n; i++) {
result = addScalar(result, stirlingS2(n, i));
}
return result;
}
});
});
// CONCATENATED MODULE: ./src/function/combinatorics/catalan.js
var catalan_name = 'catalan';
var catalan_dependencies = ['typed', 'addScalar', 'divideScalar', 'multiplyScalar', 'combinations', 'isNegative', 'isInteger'];
var createCatalan = /* #__PURE__ */Object(factory["a" /* factory */])(catalan_name, catalan_dependencies, function (_ref) {
var typed = _ref.typed,
addScalar = _ref.addScalar,
divideScalar = _ref.divideScalar,
multiplyScalar = _ref.multiplyScalar,
combinations = _ref.combinations,
isNegative = _ref.isNegative,
isInteger = _ref.isInteger;
/**
* The Catalan Numbers enumerate combinatorial structures of many different types.
* catalan only takes integer arguments.
* The following condition must be enforced: n >= 0
*
* Syntax:
*
* math.catalan(n)
*
* Examples:
*
* math.catalan(3) // returns 5
* math.catalan(8) // returns 1430
*
* See also:
*
* bellNumbers
*
* @param {Number | BigNumber} n nth Catalan number
* @return {Number | BigNumber} Cn(n)
*/
return typed(catalan_name, {
'number | BigNumber': function numberBigNumber(n) {
if (!isInteger(n) || isNegative(n)) {
throw new TypeError('Non-negative integer value expected in function catalan');
}
return divideScalar(combinations(multiplyScalar(n, 2), n), addScalar(n, 1));
}
});
});
// CONCATENATED MODULE: ./src/function/combinatorics/composition.js
var composition_name = 'composition';
var composition_dependencies = ['typed', 'addScalar', 'combinations', 'isNegative', 'isPositive', 'isInteger', 'larger'];
var createComposition = /* #__PURE__ */Object(factory["a" /* factory */])(composition_name, composition_dependencies, function (_ref) {
var typed = _ref.typed,
addScalar = _ref.addScalar,
combinations = _ref.combinations,
isPositive = _ref.isPositive,
isNegative = _ref.isNegative,
isInteger = _ref.isInteger,
larger = _ref.larger;
/**
* 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(composition_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));
}
});
});
// CONCATENATED MODULE: ./src/function/algebra/simplify/util.js
var util_name = 'simplifyUtil';
var util_dependencies = ['FunctionNode', 'OperatorNode', 'SymbolNode'];
var createUtil = /* #__PURE__ */Object(factory["a" /* factory */])(util_name, util_dependencies, function (_ref) {
var FunctionNode = _ref.FunctionNode,
OperatorNode = _ref.OperatorNode,
SymbolNode = _ref.SymbolNode;
// TODO commutative/associative properties rely on the arguments
// e.g. multiply is not commutative for matrices
// The properties should be calculated from an argument to simplify, or possibly something in math.config
// the other option is for typed() to specify a return type so that we can evaluate the type of arguments
var commutative = {
add: true,
multiply: true
};
var associative = {
add: true,
multiply: true
};
function isCommutative(node, context) {
if (!Object(is["B" /* isOperatorNode */])(node)) {
return true;
}
var name = node.fn.toString();
if (context && Object(utils_object["f" /* hasOwnProperty */])(context, name) && Object(utils_object["f" /* hasOwnProperty */])(context[name], 'commutative')) {
return context[name].commutative;
}
return commutative[name] || false;
}
function isAssociative(node, context) {
if (!Object(is["B" /* isOperatorNode */])(node)) {
return false;
}
var name = node.fn.toString();
if (context && Object(utils_object["f" /* hasOwnProperty */])(context, name) && Object(utils_object["f" /* hasOwnProperty */])(context[name], 'associative')) {
return context[name].associative;
}
return associative[name] || false;
}
/**
* Flatten all associative operators in an expression tree.
* Assumes parentheses have already been removed.
*/
function flatten(node) {
if (!node.args || node.args.length === 0) {
return node;
}
node.args = allChildren(node);
for (var i = 0; i < node.args.length; i++) {
flatten(node.args[i]);
}
}
/**
* Get the children of a node as if it has been flattened.
* TODO implement for FunctionNodes
*/
function allChildren(node) {
var op;
var children = [];
var findChildren = function findChildren(node) {
for (var i = 0; i < node.args.length; i++) {
var child = node.args[i];
if (Object(is["B" /* isOperatorNode */])(child) && op === child.op) {
findChildren(child);
} else {
children.push(child);
}
}
};
if (isAssociative(node)) {
op = node.op;
findChildren(node);
return children;
} else {
return node.args;
}
}
/**
* Unflatten all flattened operators to a right-heavy binary tree.
*/
function unflattenr(node) {
if (!node.args || node.args.length === 0) {
return;
}
var makeNode = createMakeNodeFunction(node);
var l = node.args.length;
for (var i = 0; i < l; i++) {
unflattenr(node.args[i]);
}
if (l > 2 && isAssociative(node)) {
var curnode = node.args.pop();
while (node.args.length > 0) {
curnode = makeNode([node.args.pop(), curnode]);
}
node.args = curnode.args;
}
}
/**
* Unflatten all flattened operators to a left-heavy binary tree.
*/
function unflattenl(node) {
if (!node.args || node.args.length === 0) {
return;
}
var makeNode = createMakeNodeFunction(node);
var l = node.args.length;
for (var i = 0; i < l; i++) {
unflattenl(node.args[i]);
}
if (l > 2 && isAssociative(node)) {
var curnode = node.args.shift();
while (node.args.length > 0) {
curnode = makeNode([curnode, node.args.shift()]);
}
node.args = curnode.args;
}
}
function createMakeNodeFunction(node) {
if (Object(is["B" /* isOperatorNode */])(node)) {
return function (args) {
try {
return new OperatorNode(node.op, node.fn, args, node.implicit);
} catch (err) {
console.error(err);
return [];
}
};
} else {
return function (args) {
return new FunctionNode(new SymbolNode(node.name), args);
};
}
}
return {
createMakeNodeFunction: createMakeNodeFunction,
isCommutative: isCommutative,
isAssociative: isAssociative,
flatten: flatten,
allChildren: allChildren,
unflattenr: unflattenr,
unflattenl: unflattenl
};
});
// CONCATENATED MODULE: ./src/function/algebra/simplify/simplifyCore.js
var simplifyCore_name = 'simplifyCore';
var simplifyCore_dependencies = ['equal', 'isZero', 'add', 'subtract', 'multiply', 'divide', 'pow', 'ConstantNode', 'OperatorNode', 'FunctionNode', 'ParenthesisNode'];
var createSimplifyCore = /* #__PURE__ */Object(factory["a" /* factory */])(simplifyCore_name, simplifyCore_dependencies, function (_ref) {
var equal = _ref.equal,
isZero = _ref.isZero,
add = _ref.add,
subtract = _ref.subtract,
multiply = _ref.multiply,
divide = _ref.divide,
pow = _ref.pow,
ConstantNode = _ref.ConstantNode,
OperatorNode = _ref.OperatorNode,
FunctionNode = _ref.FunctionNode,
ParenthesisNode = _ref.ParenthesisNode;
var node0 = new ConstantNode(0);
var node1 = new ConstantNode(1);
/**
* simplifyCore() performs single pass simplification suitable for
* applications requiring ultimate performance. In contrast, simplify()
* extends simplifyCore() with additional passes to provide deeper
* simplification.
*
* Syntax:
*
* simplify.simplifyCore(expr)
*
* Examples:
*
* const f = math.parse('2 * 1 * x ^ (2 - 1)')
* math.simplify.simpifyCore(f) // Node {2 * x}
* math.simplify('2 * 1 * x ^ (2 - 1)', [math.simplify.simpifyCore]) // Node {2 * x}
*
* See also:
*
* derivative
*
* @param {Node} node
* The expression to be simplified
*/
function simplifyCore(node) {
if (Object(is["B" /* isOperatorNode */])(node) && node.isUnary()) {
var a0 = simplifyCore(node.args[0]);
if (node.op === '+') {
// unary plus
return a0;
}
if (node.op === '-') {
// unary minus
if (Object(is["B" /* isOperatorNode */])(a0)) {
if (a0.isUnary() && a0.op === '-') {
return a0.args[0];
} else if (a0.isBinary() && a0.fn === 'subtract') {
return new OperatorNode('-', 'subtract', [a0.args[1], a0.args[0]]);
}
}
return new OperatorNode(node.op, node.fn, [a0]);
}
} else if (Object(is["B" /* isOperatorNode */])(node) && node.isBinary()) {
var _a = simplifyCore(node.args[0]);
var a1 = simplifyCore(node.args[1]);
if (node.op === '+') {
if (Object(is["l" /* isConstantNode */])(_a)) {
if (isZero(_a.value)) {
return a1;
} else if (Object(is["l" /* isConstantNode */])(a1)) {
return new ConstantNode(add(_a.value, a1.value));
}
}
if (Object(is["l" /* isConstantNode */])(a1) && isZero(a1.value)) {
return _a;
}
if (Object(is["B" /* isOperatorNode */])(a1) && a1.isUnary() && a1.op === '-') {
return new OperatorNode('-', 'subtract', [_a, a1.args[0]]);
}
return new OperatorNode(node.op, node.fn, a1 ? [_a, a1] : [_a]);
} else if (node.op === '-') {
if (Object(is["l" /* isConstantNode */])(_a) && a1) {
if (Object(is["l" /* isConstantNode */])(a1)) {
return new ConstantNode(subtract(_a.value, a1.value));
} else if (isZero(_a.value)) {
return new OperatorNode('-', 'unaryMinus', [a1]);
}
} // if (node.fn === "subtract" && node.args.length === 2) {
if (node.fn === 'subtract') {
if (Object(is["l" /* isConstantNode */])(a1) && isZero(a1.value)) {
return _a;
}
if (Object(is["B" /* isOperatorNode */])(a1) && a1.isUnary() && a1.op === '-') {
return simplifyCore(new OperatorNode('+', 'add', [_a, a1.args[0]]));
}
return new OperatorNode(node.op, node.fn, [_a, a1]);
}
} else if (node.op === '*') {
if (Object(is["l" /* isConstantNode */])(_a)) {
if (isZero(_a.value)) {
return node0;
} else if (equal(_a.value, 1)) {
return a1;
} else if (Object(is["l" /* isConstantNode */])(a1)) {
return new ConstantNode(multiply(_a.value, a1.value));
}
}
if (Object(is["l" /* isConstantNode */])(a1)) {
if (isZero(a1.value)) {
return node0;
} else if (equal(a1.value, 1)) {
return _a;
} else if (Object(is["B" /* isOperatorNode */])(_a) && _a.isBinary() && _a.op === node.op) {
var a00 = _a.args[0];
if (Object(is["l" /* isConstantNode */])(a00)) {
var a00a1 = new ConstantNode(multiply(a00.value, a1.value));
return new OperatorNode(node.op, node.fn, [a00a1, _a.args[1]], node.implicit); // constants on left
}
}
return new OperatorNode(node.op, node.fn, [a1, _a], node.implicit); // constants on left
}
return new OperatorNode(node.op, node.fn, [_a, a1], node.implicit);
} else if (node.op === '/') {
if (Object(is["l" /* isConstantNode */])(_a)) {
if (isZero(_a.value)) {
return node0;
} else if (Object(is["l" /* isConstantNode */])(a1) && (equal(a1.value, 1) || equal(a1.value, 2) || equal(a1.value, 4))) {
return new ConstantNode(divide(_a.value, a1.value));
}
}
return new OperatorNode(node.op, node.fn, [_a, a1]);
} else if (node.op === '^') {
if (Object(is["l" /* isConstantNode */])(a1)) {
if (isZero(a1.value)) {
return node1;
} else if (equal(a1.value, 1)) {
return _a;
} else {
if (Object(is["l" /* isConstantNode */])(_a)) {
// fold constant
return new ConstantNode(pow(_a.value, a1.value));
} else if (Object(is["B" /* isOperatorNode */])(_a) && _a.isBinary() && _a.op === '^') {
var a01 = _a.args[1];
if (Object(is["l" /* isConstantNode */])(a01)) {
return new OperatorNode(node.op, node.fn, [_a.args[0], new ConstantNode(multiply(a01.value, a1.value))]);
}
}
}
}
return new OperatorNode(node.op, node.fn, [_a, a1]);
}
} else if (Object(is["C" /* isParenthesisNode */])(node)) {
var c = simplifyCore(node.content);
if (Object(is["C" /* isParenthesisNode */])(c) || Object(is["J" /* isSymbolNode */])(c) || Object(is["l" /* isConstantNode */])(c)) {
return c;
}
return new ParenthesisNode(c);
} else if (Object(is["r" /* isFunctionNode */])(node)) {
var args = node.args.map(simplifyCore).map(function (arg) {
return Object(is["C" /* isParenthesisNode */])(arg) ? arg.content : arg;
});
return new FunctionNode(simplifyCore(node.fn), args);
} else {// cannot simplify
}
return node;
}
return simplifyCore;
});
// CONCATENATED MODULE: ./src/function/algebra/simplify/simplifyConstant.js
// TODO this could be improved by simplifying seperated constants under associative and commutative operators
var simplifyConstant_name = 'simplifyConstant';
var simplifyConstant_dependencies = ['typed', 'config', 'mathWithTransform', '?fraction', '?bignumber', 'ConstantNode', 'OperatorNode', 'FunctionNode', 'SymbolNode'];
var createSimplifyConstant = /* #__PURE__ */Object(factory["a" /* factory */])(simplifyConstant_name, simplifyConstant_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
mathWithTransform = _ref.mathWithTransform,
fraction = _ref.fraction,
bignumber = _ref.bignumber,
ConstantNode = _ref.ConstantNode,
OperatorNode = _ref.OperatorNode,
FunctionNode = _ref.FunctionNode,
SymbolNode = _ref.SymbolNode;
var _createUtil = createUtil({
FunctionNode: FunctionNode,
OperatorNode: OperatorNode,
SymbolNode: SymbolNode
}),
isCommutative = _createUtil.isCommutative,
isAssociative = _createUtil.isAssociative,
allChildren = _createUtil.allChildren,
createMakeNodeFunction = _createUtil.createMakeNodeFunction;
function simplifyConstant(expr, options) {
var res = foldFraction(expr, options);
return Object(is["w" /* isNode */])(res) ? res : _toNode(res);
}
function _eval(fnname, args, options) {
try {
return _toNumber(mathWithTransform[fnname].apply(null, args), options);
} catch (ignore) {
// sometimes the implicit type conversion causes the evaluation to fail, so we'll try again after removing Fractions
args = args.map(function (x) {
if (Object(is["o" /* isFraction */])(x)) {
return x.valueOf();
}
return x;
});
return _toNumber(mathWithTransform[fnname].apply(null, args), options);
}
}
var _toNode = typed({
Fraction: _fractionToNode,
number: function number(n) {
if (n < 0) {
return unaryMinusNode(new ConstantNode(-n));
}
return new ConstantNode(n);
},
BigNumber: function BigNumber(n) {
if (n < 0) {
return unaryMinusNode(new ConstantNode(-n));
}
return new ConstantNode(n); // old parameters: (n.toString(), 'number')
},
Complex: function Complex(s) {
throw new Error('Cannot convert Complex number to Node');
}
}); // convert a number to a fraction only if it can be expressed exactly
function _exactFraction(n, options) {
var exactFractions = options && options.exactFractions !== false;
if (exactFractions && isFinite(n) && fraction) {
var f = fraction(n);
if (f.valueOf() === n) {
return f;
}
}
return n;
} // Convert numbers to a preferred number type in preference order: Fraction, number, Complex
// BigNumbers are left alone
var _toNumber = typed({
'string, Object': function stringObject(s, options) {
if (config.number === 'BigNumber') {
if (bignumber === undefined) {
noBignumber();
}
return bignumber(s);
} else if (config.number === 'Fraction') {
if (fraction === undefined) {
noFraction();
}
return fraction(s);
} else {
var n = parseFloat(s);
return _exactFraction(n, options);
}
},
'Fraction, Object': function FractionObject(s, options) {
return s;
},
// we don't need options here
'BigNumber, Object': function BigNumberObject(s, options) {
return s;
},
// we don't need options here
'number, Object': function numberObject(s, options) {
return _exactFraction(s, options);
},
'Complex, Object': function ComplexObject(s, options) {
if (s.im !== 0) {
return s;
}
return _exactFraction(s.re, options);
}
});
function unaryMinusNode(n) {
return new OperatorNode('-', 'unaryMinus', [n]);
}
function _fractionToNode(f) {
var n;
var vn = f.s * f.n;
if (vn < 0) {
n = new OperatorNode('-', 'unaryMinus', [new ConstantNode(-vn)]);
} else {
n = new ConstantNode(vn);
}
if (f.d === 1) {
return n;
}
return new OperatorNode('/', 'divide', [n, new ConstantNode(f.d)]);
}
/*
* Create a binary tree from a list of Fractions and Nodes.
* Tries to fold Fractions by evaluating them until the first Node in the list is hit, so
* `args` should be sorted to have the Fractions at the start (if the operator is commutative).
* @param args - list of Fractions and Nodes
* @param fn - evaluator for the binary operation evaluator that accepts two Fractions
* @param makeNode - creates a binary OperatorNode/FunctionNode from a list of child Nodes
* if args.length is 1, returns args[0]
* @return - Either a Node representing a binary expression or Fraction
*/
function foldOp(fn, args, makeNode, options) {
return args.reduce(function (a, b) {
if (!Object(is["w" /* isNode */])(a) && !Object(is["w" /* isNode */])(b)) {
try {
return _eval(fn, [a, b], options);
} catch (ignoreandcontinue) {}
a = _toNode(a);
b = _toNode(b);
} else if (!Object(is["w" /* isNode */])(a)) {
a = _toNode(a);
} else if (!Object(is["w" /* isNode */])(b)) {
b = _toNode(b);
}
return makeNode([a, b]);
});
} // destroys the original node and returns a folded one
function foldFraction(node, options) {
switch (node.type) {
case 'SymbolNode':
return node;
case 'ConstantNode':
if (typeof node.value === 'number' || !isNaN(node.value)) {
return _toNumber(node.value, options);
}
return node;
case 'FunctionNode':
if (mathWithTransform[node.name] && mathWithTransform[node.name].rawArgs) {
return node;
}
{
// Process operators as OperatorNode
var operatorFunctions = ['add', 'multiply'];
if (operatorFunctions.indexOf(node.name) === -1) {
var args = node.args.map(function (arg) {
return foldFraction(arg, options);
}); // If all args are numbers
if (!args.some(is["w" /* isNode */])) {
try {
return _eval(node.name, args, options);
} catch (ignoreandcontine) {}
} // Convert all args to nodes and construct a symbolic function call
args = args.map(function (arg) {
return Object(is["w" /* isNode */])(arg) ? arg : _toNode(arg);
});
return new FunctionNode(node.name, args);
} else {// treat as operator
}
}
/* falls through */
case 'OperatorNode':
{
var fn = node.fn.toString();
var _args;
var res;
var makeNode = createMakeNodeFunction(node);
if (Object(is["B" /* isOperatorNode */])(node) && node.isUnary()) {
_args = [foldFraction(node.args[0], options)];
if (!Object(is["w" /* isNode */])(_args[0])) {
res = _eval(fn, _args, options);
} else {
res = makeNode(_args);
}
} else if (isAssociative(node)) {
_args = allChildren(node);
_args = _args.map(function (arg) {
return foldFraction(arg, options);
});
if (isCommutative(fn)) {
// commutative binary operator
var consts = [];
var vars = [];
for (var i = 0; i < _args.length; i++) {
if (!Object(is["w" /* isNode */])(_args[i])) {
consts.push(_args[i]);
} else {
vars.push(_args[i]);
}
}
if (consts.length > 1) {
res = foldOp(fn, consts, makeNode, options);
vars.unshift(res);
res = foldOp(fn, vars, makeNode, options);
} else {
// we won't change the children order since it's not neccessary
res = foldOp(fn, _args, makeNode, options);
}
} else {
// non-commutative binary operator
res = foldOp(fn, _args, makeNode, options);
}
} else {
// non-associative binary operator
_args = node.args.map(function (arg) {
return foldFraction(arg, options);
});
res = foldOp(fn, _args, makeNode, options);
}
return res;
}
case 'ParenthesisNode':
// remove the uneccessary parenthesis
return foldFraction(node.content, options);
case 'AccessorNode':
/* falls through */
case 'ArrayNode':
/* falls through */
case 'AssignmentNode':
/* falls through */
case 'BlockNode':
/* falls through */
case 'FunctionAssignmentNode':
/* falls through */
case 'IndexNode':
/* falls through */
case 'ObjectNode':
/* falls through */
case 'RangeNode':
/* falls through */
case 'ConditionalNode':
/* falls through */
default:
throw new Error("Unimplemented node type in simplifyConstant: ".concat(node.type));
}
}
return simplifyConstant;
});
// CONCATENATED MODULE: ./src/function/algebra/simplify/resolve.js
var resolve_name = 'resolve';
var resolve_dependencies = ['parse', 'FunctionNode', 'OperatorNode', 'ParenthesisNode'];
var createResolve = /* #__PURE__ */Object(factory["a" /* factory */])(resolve_name, resolve_dependencies, function (_ref) {
var parse = _ref.parse,
FunctionNode = _ref.FunctionNode,
OperatorNode = _ref.OperatorNode,
ParenthesisNode = _ref.ParenthesisNode;
/**
* resolve(expr, scope) replaces variable nodes with their scoped values
*
* Syntax:
*
* simplify.resolve(expr, scope)
*
* Examples:
*
* math.simplify.resolve('x + y', {x:1, y:2}) // Node {1 + 2}
* math.simplify.resolve(math.parse('x+y'), {x:1, y:2}) // Node {1 + 2}
* math.simplify('x+y', {x:2, y:'x+x'}).toString() // "6"
*
* @param {Node} node
* The expression tree to be simplified
* @param {Object} scope with variables to be resolved
*/
function resolve(node, scope) {
if (!scope) {
return node;
}
if (Object(is["J" /* isSymbolNode */])(node)) {
var value = scope[node.name];
if (Object(is["w" /* isNode */])(value)) {
return resolve(value, scope);
} else if (typeof value === 'number') {
return parse(String(value));
}
} else if (Object(is["B" /* isOperatorNode */])(node)) {
var args = node.args.map(function (arg) {
return resolve(arg, scope);
});
return new OperatorNode(node.op, node.fn, args, node.implicit);
} else if (Object(is["C" /* isParenthesisNode */])(node)) {
return new ParenthesisNode(resolve(node.content, scope));
} else if (Object(is["r" /* isFunctionNode */])(node)) {
var _args = node.args.map(function (arg) {
return resolve(arg, scope);
});
return new FunctionNode(node.name, _args);
}
return node;
}
return resolve;
});
// CONCATENATED MODULE: ./src/function/algebra/simplify.js
function simplify_typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { simplify_typeof = function _typeof(obj) { return typeof obj; }; } else { simplify_typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return simplify_typeof(obj); }
var simplify_name = 'simplify';
var simplify_dependencies = ['config', 'typed', 'parse', 'add', 'subtract', 'multiply', 'divide', 'pow', 'isZero', 'equal', '?fraction', '?bignumber', 'mathWithTransform', 'ConstantNode', 'FunctionNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];
var createSimplify = /* #__PURE__ */Object(factory["a" /* factory */])(simplify_name, simplify_dependencies, function (_ref) {
var config = _ref.config,
typed = _ref.typed,
parse = _ref.parse,
add = _ref.add,
subtract = _ref.subtract,
multiply = _ref.multiply,
divide = _ref.divide,
pow = _ref.pow,
isZero = _ref.isZero,
equal = _ref.equal,
fraction = _ref.fraction,
bignumber = _ref.bignumber,
mathWithTransform = _ref.mathWithTransform,
ConstantNode = _ref.ConstantNode,
FunctionNode = _ref.FunctionNode,
OperatorNode = _ref.OperatorNode,
ParenthesisNode = _ref.ParenthesisNode,
SymbolNode = _ref.SymbolNode;
var simplifyConstant = createSimplifyConstant({
typed: typed,
config: config,
mathWithTransform: mathWithTransform,
fraction: fraction,
bignumber: bignumber,
ConstantNode: ConstantNode,
OperatorNode: OperatorNode,
FunctionNode: FunctionNode,
SymbolNode: SymbolNode
});
var simplifyCore = createSimplifyCore({
equal: equal,
isZero: isZero,
add: add,
subtract: subtract,
multiply: multiply,
divide: divide,
pow: pow,
ConstantNode: ConstantNode,
OperatorNode: OperatorNode,
FunctionNode: FunctionNode,
ParenthesisNode: ParenthesisNode
});
var resolve = createResolve({
parse: parse,
FunctionNode: FunctionNode,
OperatorNode: OperatorNode,
ParenthesisNode: ParenthesisNode
});
var _createUtil = createUtil({
FunctionNode: FunctionNode,
OperatorNode: OperatorNode,
SymbolNode: SymbolNode
}),
isCommutative = _createUtil.isCommutative,
isAssociative = _createUtil.isAssociative,
flatten = _createUtil.flatten,
unflattenr = _createUtil.unflattenr,
unflattenl = _createUtil.unflattenl,
createMakeNodeFunction = _createUtil.createMakeNodeFunction;
/**
* Simplify an expression tree.
*
* A list of rules are applied to an expression, repeating over the list until
* no further changes are made.
* It's possible to pass a custom set of rules to the function as second
* argument. A rule can be specified as an object, string, or function:
*
* const rules = [
* { l: 'n1*n3 + n2*n3', r: '(n1+n2)*n3' },
* 'n1*n3 + n2*n3 -> (n1+n2)*n3',
* function (node) {
* // ... return a new node or return the node unchanged
* return node
* }
* ]
*
* String and object rules consist of a left and right pattern. The left is
* used to match against the expression and the right determines what matches
* are replaced with. The main difference between a pattern and a normal
* expression is that variables starting with the following characters are
* interpreted as wildcards:
*
* - 'n' - matches any Node
* - 'c' - matches any ConstantNode
* - 'v' - matches any Node that is not a ConstantNode
*
* The default list of rules is exposed on the function as `simplify.rules`
* and can be used as a basis to built a set of custom rules.
*
* For more details on the theory, see:
*
* - [Strategies for simplifying math expressions (Stackoverflow)](https://stackoverflow.com/questions/7540227/strategies-for-simplifying-math-expressions)
* - [Symbolic computation - Simplification (Wikipedia)](https://en.wikipedia.org/wiki/Symbolic_computation#Simplification)
*
* An optional `options` argument can be passed as last argument of `simplify`.
* There is currently one option available: `exactFractions`, a boolean which
* is `true` by default.
*
* Syntax:
*
* simplify(expr)
* simplify(expr, rules)
* simplify(expr, rules)
* simplify(expr, rules, scope)
* simplify(expr, rules, scope, options)
* simplify(expr, scope)
* simplify(expr, scope, options)
*
* Examples:
*
* math.simplify('2 * 1 * x ^ (2 - 1)') // Node "2 * x"
* math.simplify('2 * 3 * x', {x: 4}) // Node "24"
* const f = math.parse('2 * 1 * x ^ (2 - 1)')
* math.simplify(f) // Node "2 * x"
* math.simplify('0.4 * x', {}, {exactFractions: true}) // Node "x * 2 / 5"
* math.simplify('0.4 * x', {}, {exactFractions: false}) // Node "0.4 * x"
*
* See also:
*
* derivative, parse, evaluate, rationalize
*
* @param {Node | string} expr
* The expression to be simplified
* @param {Array<{l:string, r: string} | string | function>} [rules]
* Optional list with custom rules
* @return {Node} Returns the simplified form of `expr`
*/
var simplify = typed('simplify', {
string: function string(expr) {
return this(parse(expr), this.rules, {}, {});
},
'string, Object': function stringObject(expr, scope) {
return this(parse(expr), this.rules, scope, {});
},
'string, Object, Object': function stringObjectObject(expr, scope, options) {
return this(parse(expr), this.rules, scope, options);
},
'string, Array': function stringArray(expr, rules) {
return this(parse(expr), rules, {}, {});
},
'string, Array, Object': function stringArrayObject(expr, rules, scope) {
return this(parse(expr), rules, scope, {});
},
'string, Array, Object, Object': function stringArrayObjectObject(expr, rules, scope, options) {
return this(parse(expr), rules, scope, options);
},
'Node, Object': function NodeObject(expr, scope) {
return this(expr, this.rules, scope, {});
},
'Node, Object, Object': function NodeObjectObject(expr, scope, options) {
return this(expr, this.rules, scope, options);
},
Node: function Node(expr) {
return this(expr, this.rules, {}, {});
},
'Node, Array': function NodeArray(expr, rules) {
return this(expr, rules, {}, {});
},
'Node, Array, Object': function NodeArrayObject(expr, rules, scope) {
return this(expr, rules, scope, {});
},
'Node, Array, Object, Object': function NodeArrayObjectObject(expr, rules, scope, options) {
rules = _buildRules(rules);
var res = resolve(expr, scope);
res = removeParens(res);
var visited = {};
var str = res.toString({
parenthesis: 'all'
});
while (!visited[str]) {
visited[str] = true;
_lastsym = 0; // counter for placeholder symbols
for (var i = 0; i < rules.length; i++) {
if (typeof rules[i] === 'function') {
res = rules[i](res, options);
} else {
flatten(res);
res = applyRule(res, rules[i]);
}
unflattenl(res); // using left-heavy binary tree here since custom rule functions may expect it
}
str = res.toString({
parenthesis: 'all'
});
}
return res;
}
});
simplify.simplifyCore = simplifyCore;
simplify.resolve = resolve;
function removeParens(node) {
return node.transform(function (node, path, parent) {
return Object(is["C" /* isParenthesisNode */])(node) ? removeParens(node.content) : node;
});
} // All constants that are allowed in rules
var SUPPORTED_CONSTANTS = {
"true": true,
"false": true,
e: true,
i: true,
Infinity: true,
LN2: true,
LN10: true,
LOG2E: true,
LOG10E: true,
NaN: true,
phi: true,
pi: true,
SQRT1_2: true,
SQRT2: true,
tau: true // null: false,
// undefined: false,
// version: false,
}; // Array of strings, used to build the ruleSet.
// Each l (left side) and r (right side) are parsed by
// the expression parser into a node tree.
// Left hand sides are matched to subtrees within the
// expression to be parsed and replaced with the right
// hand side.
// TODO: Add support for constraints on constants (either in the form of a '=' expression or a callback [callback allows things like comparing symbols alphabetically])
// To evaluate lhs constants for rhs constants, use: { l: 'c1+c2', r: 'c3', evaluate: 'c3 = c1 + c2' }. Multiple assignments are separated by ';' in block format.
// It is possible to get into an infinite loop with conflicting rules
simplify.rules = [simplifyCore, // { l: 'n+0', r: 'n' }, // simplifyCore
// { l: 'n^0', r: '1' }, // simplifyCore
// { l: '0*n', r: '0' }, // simplifyCore
// { l: 'n/n', r: '1'}, // simplifyCore
// { l: 'n^1', r: 'n' }, // simplifyCore
// { l: '+n1', r:'n1' }, // simplifyCore
// { l: 'n--n1', r:'n+n1' }, // simplifyCore
{
l: 'log(e)',
r: '1'
}, // temporary rules
{
l: 'n-n1',
r: 'n+-n1'
}, // temporarily replace 'subtract' so we can further flatten the 'add' operator
{
l: '-(c*v)',
r: '(-c) * v'
}, // make non-constant terms positive
{
l: '-v',
r: '(-1) * v'
}, {
l: 'n/n1^n2',
r: 'n*n1^-n2'
}, // temporarily replace 'divide' so we can further flatten the 'multiply' operator
{
l: 'n/n1',
r: 'n*n1^-1'
}, // expand nested exponentiation
{
l: '(n ^ n1) ^ n2',
r: 'n ^ (n1 * n2)'
}, // collect like factors
{
l: 'n*n',
r: 'n^2'
}, {
l: 'n * n^n1',
r: 'n^(n1+1)'
}, {
l: 'n^n1 * n^n2',
r: 'n^(n1+n2)'
}, // collect like terms
{
l: 'n+n',
r: '2*n'
}, {
l: 'n+-n',
r: '0'
}, {
l: 'n1*n2 + n2',
r: '(n1+1)*n2'
}, {
l: 'n1*n3 + n2*n3',
r: '(n1+n2)*n3'
}, // remove parenthesis in the case of negating a quantitiy
{
l: 'n1 + -1 * (n2 + n3)',
r: 'n1 + -1 * n2 + -1 * n3'
}, simplifyConstant, {
l: '(-n)*n1',
r: '-(n*n1)'
}, // make factors positive (and undo 'make non-constant terms positive')
// ordering of constants
{
l: 'c+v',
r: 'v+c',
context: {
add: {
commutative: false
}
}
}, {
l: 'v*c',
r: 'c*v',
context: {
multiply: {
commutative: false
}
}
}, // undo temporary rules
// { l: '(-1) * n', r: '-n' }, // #811 added test which proved this is redundant
{
l: 'n+-n1',
r: 'n-n1'
}, // undo replace 'subtract'
{
l: 'n*(n1^-1)',
r: 'n/n1'
}, // undo replace 'divide'
{
l: 'n*n1^-n2',
r: 'n/n1^n2'
}, {
l: 'n1^-1',
r: '1/n1'
}, {
l: 'n*(n1/n2)',
r: '(n*n1)/n2'
}, // '*' before '/'
{
l: 'n-(n1+n2)',
r: 'n-n1-n2'
}, // '-' before '+'
// { l: '(n1/n2)/n3', r: 'n1/(n2*n3)' },
// { l: '(n*n1)/(n*n2)', r: 'n1/n2' },
{
l: '1*n',
r: 'n'
}, // this pattern can be produced by simplifyConstant
{
l: 'n1/(n2/n3)',
r: '(n1*n3)/n2'
}];
/**
* Parse the string array of rules into nodes
*
* Example syntax for rules:
*
* Position constants to the left in a product:
* { l: 'n1 * c1', r: 'c1 * n1' }
* n1 is any Node, and c1 is a ConstantNode.
*
* Apply difference of squares formula:
* { l: '(n1 - n2) * (n1 + n2)', r: 'n1^2 - n2^2' }
* n1, n2 mean any Node.
*
* Short hand notation:
* 'n1 * c1 -> c1 * n1'
*/
function _buildRules(rules) {
// Array of rules to be used to simplify expressions
var ruleSet = [];
for (var i = 0; i < rules.length; i++) {
var rule = rules[i];
var newRule = void 0;
var ruleType = simplify_typeof(rule);
switch (ruleType) {
case 'string':
{
var lr = rule.split('->');
if (lr.length === 2) {
rule = {
l: lr[0],
r: lr[1]
};
} else {
throw SyntaxError('Could not parse rule: ' + rule);
}
}
/* falls through */
case 'object':
newRule = {
l: removeParens(parse(rule.l)),
r: removeParens(parse(rule.r))
};
if (rule.context) {
newRule.evaluate = rule.context;
}
if (rule.evaluate) {
newRule.evaluate = parse(rule.evaluate);
}
if (isAssociative(newRule.l)) {
var makeNode = createMakeNodeFunction(newRule.l);
var expandsym = _getExpandPlaceholderSymbol();
newRule.expanded = {};
newRule.expanded.l = makeNode([newRule.l.clone(), expandsym]); // Push the expandsym into the deepest possible branch.
// This helps to match the newRule against nodes returned from getSplits() later on.
flatten(newRule.expanded.l);
unflattenr(newRule.expanded.l);
newRule.expanded.r = makeNode([newRule.r, expandsym]);
}
break;
case 'function':
newRule = rule;
break;
default:
throw TypeError('Unsupported type of rule: ' + ruleType);
} // console.log('Adding rule: ' + rules[i])
// console.log(newRule)
ruleSet.push(newRule);
}
return ruleSet;
}
var _lastsym = 0;
function _getExpandPlaceholderSymbol() {
return new SymbolNode('_p' + _lastsym++);
}
/**
* Returns a simplfied form of node, or the original node if no simplification was possible.
*
* @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
* @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} The simplified form of `expr`, or the original node if no simplification was possible.
*/
var applyRule = typed('applyRule', {
'Node, Object': function NodeObject(node, rule) {
// console.log('Entering applyRule(' + node.toString() + ')')
// Do not clone node unless we find a match
var res = node; // First replace our child nodes with their simplified versions
// If a child could not be simplified, the assignments will have
// no effect since the node is returned unchanged
if (res instanceof OperatorNode || res instanceof FunctionNode) {
if (res.args) {
for (var i = 0; i < res.args.length; i++) {
res.args[i] = applyRule(res.args[i], rule);
}
}
} else if (res instanceof ParenthesisNode) {
if (res.content) {
res.content = applyRule(res.content, rule);
}
} // Try to match a rule against this node
var repl = rule.r;
var matches = _ruleMatch(rule.l, res)[0]; // If the rule is associative operator, we can try matching it while allowing additional terms.
// This allows us to match rules like 'n+n' to the expression '(1+x)+x' or even 'x+1+x' if the operator is commutative.
if (!matches && rule.expanded) {
repl = rule.expanded.r;
matches = _ruleMatch(rule.expanded.l, res)[0];
}
if (matches) {
// const before = res.toString({parenthesis: 'all'})
// Create a new node by cloning the rhs of the matched rule
// we keep any implicit multiplication state if relevant
var implicit = res.implicit;
res = repl.clone();
if (implicit && 'implicit' in repl) {
res.implicit = true;
} // Replace placeholders with their respective nodes without traversing deeper into the replaced nodes
res = res.transform(function (node) {
if (node.isSymbolNode && Object(utils_object["f" /* hasOwnProperty */])(matches.placeholders, node.name)) {
return matches.placeholders[node.name].clone();
} else {
return node;
}
}); // const after = res.toString({parenthesis: 'all'})
// console.log('Simplified ' + before + ' to ' + after)
}
return res;
}
});
/**
* Get (binary) combinations of a flattened binary node
* e.g. +(node1, node2, node3) -> [
* +(node1, +(node2, node3)),
* +(node2, +(node1, node3)),
* +(node3, +(node1, node2))]
*
*/
function getSplits(node, context) {
var res = [];
var right, rightArgs;
var makeNode = createMakeNodeFunction(node);
if (isCommutative(node, context)) {
for (var i = 0; i < node.args.length; i++) {
rightArgs = node.args.slice(0);
rightArgs.splice(i, 1);
right = rightArgs.length === 1 ? rightArgs[0] : makeNode(rightArgs);
res.push(makeNode([node.args[i], right]));
}
} else {
rightArgs = node.args.slice(1);
right = rightArgs.length === 1 ? rightArgs[0] : makeNode(rightArgs);
res.push(makeNode([node.args[0], right]));
}
return res;
}
/**
* Returns the set union of two match-placeholders or null if there is a conflict.
*/
function mergeMatch(match1, match2) {
var res = {
placeholders: {}
}; // Some matches may not have placeholders; this is OK
if (!match1.placeholders && !match2.placeholders) {
return res;
} else if (!match1.placeholders) {
return match2;
} else if (!match2.placeholders) {
return match1;
} // Placeholders with the same key must match exactly
for (var key in match1.placeholders) {
if (Object(utils_object["f" /* hasOwnProperty */])(match1.placeholders, key)) {
res.placeholders[key] = match1.placeholders[key];
if (Object(utils_object["f" /* hasOwnProperty */])(match2.placeholders, key)) {
if (!_exactMatch(match1.placeholders[key], match2.placeholders[key])) {
return null;
}
}
}
}
for (var _key in match2.placeholders) {
if (Object(utils_object["f" /* hasOwnProperty */])(match2.placeholders, _key)) {
res.placeholders[_key] = match2.placeholders[_key];
}
}
return res;
}
/**
* Combine two lists of matches by applying mergeMatch to the cartesian product of two lists of matches.
* Each list represents matches found in one child of a node.
*/
function combineChildMatches(list1, list2) {
var res = [];
if (list1.length === 0 || list2.length === 0) {
return res;
}
var merged;
for (var i1 = 0; i1 < list1.length; i1++) {
for (var i2 = 0; i2 < list2.length; i2++) {
merged = mergeMatch(list1[i1], list2[i2]);
if (merged) {
res.push(merged);
}
}
}
return res;
}
/**
* Combine multiple lists of matches by applying mergeMatch to the cartesian product of two lists of matches.
* Each list represents matches found in one child of a node.
* Returns a list of unique matches.
*/
function mergeChildMatches(childMatches) {
if (childMatches.length === 0) {
return childMatches;
}
var sets = childMatches.reduce(combineChildMatches);
var uniqueSets = [];
var unique = {};
for (var i = 0; i < sets.length; i++) {
var s = JSON.stringify(sets[i]);
if (!unique[s]) {
unique[s] = true;
uniqueSets.push(sets[i]);
}
}
return uniqueSets;
}
/**
* Determines whether node matches rule.
*
* @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} rule
* @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
* @return {Object} Information about the match, if it exists.
*/
function _ruleMatch(rule, node, isSplit) {
// console.log('Entering _ruleMatch(' + JSON.stringify(rule) + ', ' + JSON.stringify(node) + ')')
// console.log('rule = ' + rule)
// console.log('node = ' + node)
// console.log('Entering _ruleMatch(' + rule.toString() + ', ' + node.toString() + ')')
var res = [{
placeholders: {}
}];
if (rule instanceof OperatorNode && node instanceof OperatorNode || rule instanceof FunctionNode && node instanceof FunctionNode) {
// If the rule is an OperatorNode or a FunctionNode, then node must match exactly
if (rule instanceof OperatorNode) {
if (rule.op !== node.op || rule.fn !== node.fn) {
return [];
}
} else if (rule instanceof FunctionNode) {
if (rule.name !== node.name) {
return [];
}
} // rule and node match. Search the children of rule and node.
if (node.args.length === 1 && rule.args.length === 1 || !isAssociative(node) || isSplit) {
// Expect non-associative operators to match exactly
var childMatches = [];
for (var i = 0; i < rule.args.length; i++) {
var childMatch = _ruleMatch(rule.args[i], node.args[i]);
if (childMatch.length === 0) {
// Child did not match, so stop searching immediately
return [];
} // The child matched, so add the information returned from the child to our result
childMatches.push(childMatch);
}
res = mergeChildMatches(childMatches);
} else if (node.args.length >= 2 && rule.args.length === 2) {
// node is flattened, rule is not
// Associative operators/functions can be split in different ways so we check if the rule matches each
// them and return their union.
var splits = getSplits(node, rule.context);
var splitMatches = [];
for (var _i = 0; _i < splits.length; _i++) {
var matchSet = _ruleMatch(rule, splits[_i], true); // recursing at the same tree depth here
splitMatches = splitMatches.concat(matchSet);
}
return splitMatches;
} else if (rule.args.length > 2) {
throw Error('Unexpected non-binary associative function: ' + rule.toString());
} else {
// Incorrect number of arguments in rule and node, so no match
return [];
}
} else if (rule instanceof SymbolNode) {
// If the rule is a SymbolNode, then it carries a special meaning
// according to the first character of the symbol node name.
// c.* matches a ConstantNode
// n.* matches any node
if (rule.name.length === 0) {
throw new Error('Symbol in rule has 0 length...!?');
}
if (SUPPORTED_CONSTANTS[rule.name]) {
// built-in constant must match exactly
if (rule.name !== node.name) {
return [];
}
} else if (rule.name[0] === 'n' || rule.name.substring(0, 2) === '_p') {
// rule matches _anything_, so assign this node to the rule.name placeholder
// Assign node to the rule.name placeholder.
// Our parent will check for matches among placeholders.
res[0].placeholders[rule.name] = node;
} else if (rule.name[0] === 'v') {
// rule matches any variable thing (not a ConstantNode)
if (!Object(is["l" /* isConstantNode */])(node)) {
res[0].placeholders[rule.name] = node;
} else {
// Mis-match: rule was expecting something other than a ConstantNode
return [];
}
} else if (rule.name[0] === 'c') {
// rule matches any ConstantNode
if (node instanceof ConstantNode) {
res[0].placeholders[rule.name] = node;
} else {
// Mis-match: rule was expecting a ConstantNode
return [];
}
} else {
throw new Error('Invalid symbol in rule: ' + rule.name);
}
} else if (rule instanceof ConstantNode) {
// Literal constant must match exactly
if (!equal(rule.value, node.value)) {
return [];
}
} else {
// Some other node was encountered which we aren't prepared for, so no match
return [];
} // It's a match!
// console.log('_ruleMatch(' + rule.toString() + ', ' + node.toString() + ') found a match')
return res;
}
/**
* Determines whether p and q (and all their children nodes) are identical.
*
* @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} p
* @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} q
* @return {Object} Information about the match, if it exists.
*/
function _exactMatch(p, q) {
if (p instanceof ConstantNode && q instanceof ConstantNode) {
if (!equal(p.value, q.value)) {
return false;
}
} else if (p instanceof SymbolNode && q instanceof SymbolNode) {
if (p.name !== q.name) {
return false;
}
} else if (p instanceof OperatorNode && q instanceof OperatorNode || p instanceof FunctionNode && q instanceof FunctionNode) {
if (p instanceof OperatorNode) {
if (p.op !== q.op || p.fn !== q.fn) {
return false;
}
} else if (p instanceof FunctionNode) {
if (p.name !== q.name) {
return false;
}
}
if (p.args.length !== q.args.length) {
return false;
}
for (var i = 0; i < p.args.length; i++) {
if (!_exactMatch(p.args[i], q.args[i])) {
return false;
}
}
} else {
return false;
}
return true;
}
return simplify;
});
// CONCATENATED MODULE: ./src/function/algebra/derivative.js
var derivative_name = 'derivative';
var derivative_dependencies = ['typed', 'config', 'parse', 'simplify', 'equal', 'isZero', 'numeric', 'ConstantNode', 'FunctionNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];
var createDerivative = /* #__PURE__ */Object(factory["a" /* factory */])(derivative_name, derivative_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
parse = _ref.parse,
simplify = _ref.simplify,
equal = _ref.equal,
isZero = _ref.isZero,
numeric = _ref.numeric,
ConstantNode = _ref.ConstantNode,
FunctionNode = _ref.FunctionNode,
OperatorNode = _ref.OperatorNode,
ParenthesisNode = _ref.ParenthesisNode,
SymbolNode = _ref.SymbolNode;
/**
* Takes the derivative of an expression expressed in parser Nodes.
* The derivative will be taken over the supplied variable in the
* second parameter. If there are multiple variables in the expression,
* it will return a partial derivative.
*
* This uses rules of differentiation which can be found here:
*
* - [Differentiation rules (Wikipedia)](https://en.wikipedia.org/wiki/Differentiation_rules)
*
* Syntax:
*
* derivative(expr, variable)
* derivative(expr, variable, options)
*
* Examples:
*
* math.derivative('x^2', 'x') // Node {2 * x}
* math.derivative('x^2', 'x', {simplify: false}) // Node {2 * 1 * x ^ (2 - 1)
* math.derivative('sin(2x)', 'x')) // Node {2 * cos(2 * x)}
* math.derivative('2*x', 'x').evaluate() // number 2
* math.derivative('x^2', 'x').evaluate({x: 4}) // number 8
* const f = math.parse('x^2')
* const x = math.parse('x')
* math.derivative(f, x) // Node {2 * x}
*
* See also:
*
* simplify, parse, evaluate
*
* @param {Node | string} expr The expression to differentiate
* @param {SymbolNode | string} variable The variable over which to differentiate
* @param {{simplify: boolean}} [options]
* There is one option available, `simplify`, which
* is true by default. When false, output will not
* be simplified.
* @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} The derivative of `expr`
*/
var derivative = typed('derivative', {
'Node, SymbolNode, Object': function NodeSymbolNodeObject(expr, variable, options) {
var constNodes = {};
constTag(constNodes, expr, variable.name);
var res = _derivative(expr, constNodes);
return options.simplify ? simplify(res) : res;
},
'Node, SymbolNode': function NodeSymbolNode(expr, variable) {
return this(expr, variable, {
simplify: true
});
},
'string, SymbolNode': function stringSymbolNode(expr, variable) {
return this(parse(expr), variable);
},
'string, SymbolNode, Object': function stringSymbolNodeObject(expr, variable, options) {
return this(parse(expr), variable, options);
},
'string, string': function stringString(expr, variable) {
return this(parse(expr), parse(variable));
},
'string, string, Object': function stringStringObject(expr, variable, options) {
return this(parse(expr), parse(variable), options);
},
'Node, string': function NodeString(expr, variable) {
return this(expr, parse(variable));
},
'Node, string, Object': function NodeStringObject(expr, variable, options) {
return this(expr, parse(variable), options);
} // TODO: replace the 8 signatures above with 4 as soon as typed-function supports optional arguments
/* TODO: implement and test syntax with order of derivatives -> implement as an option {order: number}
'Node, SymbolNode, ConstantNode': function (expr, variable, {order}) {
let res = expr
for (let i = 0; i < order; i++) {
let constNodes = {}
constTag(constNodes, expr, variable.name)
res = _derivative(res, constNodes)
}
return res
}
*/
});
derivative._simplify = true;
derivative.toTex = function (deriv) {
return _derivTex.apply(null, deriv.args);
}; // FIXME: move the toTex method of derivative to latex.js. Difficulty is that it relies on parse.
// NOTE: the optional "order" parameter here is currently unused
var _derivTex = typed('_derivTex', {
'Node, SymbolNode': function NodeSymbolNode(expr, x) {
if (Object(is["l" /* isConstantNode */])(expr) && Object(is["M" /* typeOf */])(expr.value) === 'string') {
return _derivTex(parse(expr.value).toString(), x.toString(), 1);
} else {
return _derivTex(expr.toString(), x.toString(), 1);
}
},
'Node, ConstantNode': function NodeConstantNode(expr, x) {
if (Object(is["M" /* typeOf */])(x.value) === 'string') {
return _derivTex(expr, parse(x.value));
} else {
throw new Error("The second parameter to 'derivative' is a non-string constant");
}
},
'Node, SymbolNode, ConstantNode': function NodeSymbolNodeConstantNode(expr, x, order) {
return _derivTex(expr.toString(), x.name, order.value);
},
'string, string, number': function stringStringNumber(expr, x, order) {
var d;
if (order === 1) {
d = '{d\\over d' + x + '}';
} else {
d = '{d^{' + order + '}\\over d' + x + '^{' + order + '}}';
}
return d + "\\left[".concat(expr, "\\right]");
}
});
/**
* Does a depth-first search on the expression tree to identify what Nodes
* are constants (e.g. 2 + 2), and stores the ones that are constants in
* constNodes. Classification is done as follows:
*
* 1. ConstantNodes are constants.
* 2. If there exists a SymbolNode, of which we are differentiating over,
* in the subtree it is not constant.
*
* @param {Object} constNodes Holds the nodes that are constant
* @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
* @param {string} varName Variable that we are differentiating
* @return {boolean} if node is constant
*/
// TODO: can we rewrite constTag into a pure function?
var constTag = typed('constTag', {
'Object, ConstantNode, string': function ObjectConstantNodeString(constNodes, node) {
constNodes[node] = true;
return true;
},
'Object, SymbolNode, string': function ObjectSymbolNodeString(constNodes, node, varName) {
// Treat other variables like constants. For reasoning, see:
// https://en.wikipedia.org/wiki/Partial_derivative
if (node.name !== varName) {
constNodes[node] = true;
return true;
}
return false;
},
'Object, ParenthesisNode, string': function ObjectParenthesisNodeString(constNodes, node, varName) {
return constTag(constNodes, node.content, varName);
},
'Object, FunctionAssignmentNode, string': function ObjectFunctionAssignmentNodeString(constNodes, node, varName) {
if (node.params.indexOf(varName) === -1) {
constNodes[node] = true;
return true;
}
return constTag(constNodes, node.expr, varName);
},
'Object, FunctionNode | OperatorNode, string': function ObjectFunctionNodeOperatorNodeString(constNodes, node, varName) {
if (node.args.length > 0) {
var isConst = constTag(constNodes, node.args[0], varName);
for (var i = 1; i < node.args.length; ++i) {
isConst = constTag(constNodes, node.args[i], varName) && isConst;
}
if (isConst) {
constNodes[node] = true;
return true;
}
}
return false;
}
});
/**
* Applies differentiation rules.
*
* @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
* @param {Object} constNodes Holds the nodes that are constant
* @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} The derivative of `expr`
*/
var _derivative = typed('_derivative', {
'ConstantNode, Object': function ConstantNodeObject(node) {
return createConstantNode(0);
},
'SymbolNode, Object': function SymbolNodeObject(node, constNodes) {
if (constNodes[node] !== undefined) {
return createConstantNode(0);
}
return createConstantNode(1);
},
'ParenthesisNode, Object': function ParenthesisNodeObject(node, constNodes) {
return new ParenthesisNode(_derivative(node.content, constNodes));
},
'FunctionAssignmentNode, Object': function FunctionAssignmentNodeObject(node, constNodes) {
if (constNodes[node] !== undefined) {
return createConstantNode(0);
}
return _derivative(node.expr, constNodes);
},
'FunctionNode, Object': function FunctionNodeObject(node, constNodes) {
if (node.args.length !== 1) {
funcArgsCheck(node);
}
if (constNodes[node] !== undefined) {
return createConstantNode(0);
}
var arg0 = node.args[0];
var arg1;
var div = false; // is output a fraction?
var negative = false; // is output negative?
var funcDerivative;
switch (node.name) {
case 'cbrt':
// d/dx(cbrt(x)) = 1 / (3x^(2/3))
div = true;
funcDerivative = new OperatorNode('*', 'multiply', [createConstantNode(3), new OperatorNode('^', 'pow', [arg0, new OperatorNode('/', 'divide', [createConstantNode(2), createConstantNode(3)])])]);
break;
case 'sqrt':
case 'nthRoot':
// d/dx(sqrt(x)) = 1 / (2*sqrt(x))
if (node.args.length === 1) {
div = true;
funcDerivative = new OperatorNode('*', 'multiply', [createConstantNode(2), new FunctionNode('sqrt', [arg0])]);
} else if (node.args.length === 2) {
// Rearrange from nthRoot(x, a) -> x^(1/a)
arg1 = new OperatorNode('/', 'divide', [createConstantNode(1), node.args[1]]); // Is a variable?
constNodes[arg1] = constNodes[node.args[1]];
return _derivative(new OperatorNode('^', 'pow', [arg0, arg1]), constNodes);
}
break;
case 'log10':
arg1 = createConstantNode(10);
/* fall through! */
case 'log':
if (!arg1 && node.args.length === 1) {
// d/dx(log(x)) = 1 / x
funcDerivative = arg0.clone();
div = true;
} else if (node.args.length === 1 && arg1 || node.args.length === 2 && constNodes[node.args[1]] !== undefined) {
// d/dx(log(x, c)) = 1 / (x*ln(c))
funcDerivative = new OperatorNode('*', 'multiply', [arg0.clone(), new FunctionNode('log', [arg1 || node.args[1]])]);
div = true;
} else if (node.args.length === 2) {
// d/dx(log(f(x), g(x))) = d/dx(log(f(x)) / log(g(x)))
return _derivative(new OperatorNode('/', 'divide', [new FunctionNode('log', [arg0]), new FunctionNode('log', [node.args[1]])]), constNodes);
}
break;
case 'pow':
constNodes[arg1] = constNodes[node.args[1]]; // Pass to pow operator node parser
return _derivative(new OperatorNode('^', 'pow', [arg0, node.args[1]]), constNodes);
case 'exp':
// d/dx(e^x) = e^x
funcDerivative = new FunctionNode('exp', [arg0.clone()]);
break;
case 'sin':
// d/dx(sin(x)) = cos(x)
funcDerivative = new FunctionNode('cos', [arg0.clone()]);
break;
case 'cos':
// d/dx(cos(x)) = -sin(x)
funcDerivative = new OperatorNode('-', 'unaryMinus', [new FunctionNode('sin', [arg0.clone()])]);
break;
case 'tan':
// d/dx(tan(x)) = sec(x)^2
funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('sec', [arg0.clone()]), createConstantNode(2)]);
break;
case 'sec':
// d/dx(sec(x)) = sec(x)tan(x)
funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('tan', [arg0.clone()])]);
break;
case 'csc':
// d/dx(csc(x)) = -csc(x)cot(x)
negative = true;
funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('cot', [arg0.clone()])]);
break;
case 'cot':
// d/dx(cot(x)) = -csc(x)^2
negative = true;
funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('csc', [arg0.clone()]), createConstantNode(2)]);
break;
case 'asin':
// d/dx(asin(x)) = 1 / sqrt(1 - x^2)
div = true;
funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])]);
break;
case 'acos':
// d/dx(acos(x)) = -1 / sqrt(1 - x^2)
div = true;
negative = true;
funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])]);
break;
case 'atan':
// d/dx(atan(x)) = 1 / (x^2 + 1)
div = true;
funcDerivative = new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)]);
break;
case 'asec':
// d/dx(asec(x)) = 1 / (|x|*sqrt(x^2 - 1))
div = true;
funcDerivative = new OperatorNode('*', 'multiply', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);
break;
case 'acsc':
// d/dx(acsc(x)) = -1 / (|x|*sqrt(x^2 - 1))
div = true;
negative = true;
funcDerivative = new OperatorNode('*', 'multiply', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);
break;
case 'acot':
// d/dx(acot(x)) = -1 / (x^2 + 1)
div = true;
negative = true;
funcDerivative = new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)]);
break;
case 'sinh':
// d/dx(sinh(x)) = cosh(x)
funcDerivative = new FunctionNode('cosh', [arg0.clone()]);
break;
case 'cosh':
// d/dx(cosh(x)) = sinh(x)
funcDerivative = new FunctionNode('sinh', [arg0.clone()]);
break;
case 'tanh':
// d/dx(tanh(x)) = sech(x)^2
funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('sech', [arg0.clone()]), createConstantNode(2)]);
break;
case 'sech':
// d/dx(sech(x)) = -sech(x)tanh(x)
negative = true;
funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('tanh', [arg0.clone()])]);
break;
case 'csch':
// d/dx(csch(x)) = -csch(x)coth(x)
negative = true;
funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('coth', [arg0.clone()])]);
break;
case 'coth':
// d/dx(coth(x)) = -csch(x)^2
negative = true;
funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('csch', [arg0.clone()]), createConstantNode(2)]);
break;
case 'asinh':
// d/dx(asinh(x)) = 1 / sqrt(x^2 + 1)
div = true;
funcDerivative = new FunctionNode('sqrt', [new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])]);
break;
case 'acosh':
// d/dx(acosh(x)) = 1 / sqrt(x^2 - 1); XXX potentially only for x >= 1 (the real spectrum)
div = true;
funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])]);
break;
case 'atanh':
// d/dx(atanh(x)) = 1 / (1 - x^2)
div = true;
funcDerivative = new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])]);
break;
case 'asech':
// d/dx(asech(x)) = -1 / (x*sqrt(1 - x^2))
div = true;
negative = true;
funcDerivative = new OperatorNode('*', 'multiply', [arg0.clone(), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])])]);
break;
case 'acsch':
// d/dx(acsch(x)) = -1 / (|x|*sqrt(x^2 + 1))
div = true;
negative = true;
funcDerivative = new OperatorNode('*', 'multiply', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);
break;
case 'acoth':
// d/dx(acoth(x)) = -1 / (1 - x^2)
div = true;
negative = true;
funcDerivative = new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])]);
break;
case 'abs':
// d/dx(abs(x)) = abs(x)/x
funcDerivative = new OperatorNode('/', 'divide', [new FunctionNode(new SymbolNode('abs'), [arg0.clone()]), arg0.clone()]);
break;
case 'gamma': // Needs digamma function, d/dx(gamma(x)) = gamma(x)digamma(x)
default:
throw new Error('Function "' + node.name + '" is not supported by derivative, or a wrong number of arguments is passed');
}
var op, func;
if (div) {
op = '/';
func = 'divide';
} else {
op = '*';
func = 'multiply';
}
/* Apply chain rule to all functions:
F(x) = f(g(x))
F'(x) = g'(x)*f'(g(x)) */
var chainDerivative = _derivative(arg0, constNodes);
if (negative) {
chainDerivative = new OperatorNode('-', 'unaryMinus', [chainDerivative]);
}
return new OperatorNode(op, func, [chainDerivative, funcDerivative]);
},
'OperatorNode, Object': function OperatorNodeObject(node, constNodes) {
if (constNodes[node] !== undefined) {
return createConstantNode(0);
}
if (node.op === '+') {
// d/dx(sum(f(x)) = sum(f'(x))
return new OperatorNode(node.op, node.fn, node.args.map(function (arg) {
return _derivative(arg, constNodes);
}));
}
if (node.op === '-') {
// d/dx(+/-f(x)) = +/-f'(x)
if (node.isUnary()) {
return new OperatorNode(node.op, node.fn, [_derivative(node.args[0], constNodes)]);
} // Linearity of differentiation, d/dx(f(x) +/- g(x)) = f'(x) +/- g'(x)
if (node.isBinary()) {
return new OperatorNode(node.op, node.fn, [_derivative(node.args[0], constNodes), _derivative(node.args[1], constNodes)]);
}
}
if (node.op === '*') {
// d/dx(c*f(x)) = c*f'(x)
var constantTerms = node.args.filter(function (arg) {
return constNodes[arg] !== undefined;
});
if (constantTerms.length > 0) {
var nonConstantTerms = node.args.filter(function (arg) {
return constNodes[arg] === undefined;
});
var nonConstantNode = nonConstantTerms.length === 1 ? nonConstantTerms[0] : new OperatorNode('*', 'multiply', nonConstantTerms);
var newArgs = constantTerms.concat(_derivative(nonConstantNode, constNodes));
return new OperatorNode('*', 'multiply', newArgs);
} // Product Rule, d/dx(f(x)*g(x)) = f'(x)*g(x) + f(x)*g'(x)
return new OperatorNode('+', 'add', node.args.map(function (argOuter) {
return new OperatorNode('*', 'multiply', node.args.map(function (argInner) {
return argInner === argOuter ? _derivative(argInner, constNodes) : argInner.clone();
}));
}));
}
if (node.op === '/' && node.isBinary()) {
var arg0 = node.args[0];
var arg1 = node.args[1]; // d/dx(f(x) / c) = f'(x) / c
if (constNodes[arg1] !== undefined) {
return new OperatorNode('/', 'divide', [_derivative(arg0, constNodes), arg1]);
} // Reciprocal Rule, d/dx(c / f(x)) = -c(f'(x)/f(x)^2)
if (constNodes[arg0] !== undefined) {
return new OperatorNode('*', 'multiply', [new OperatorNode('-', 'unaryMinus', [arg0]), new OperatorNode('/', 'divide', [_derivative(arg1, constNodes), new OperatorNode('^', 'pow', [arg1.clone(), createConstantNode(2)])])]);
} // Quotient rule, d/dx(f(x) / g(x)) = (f'(x)g(x) - f(x)g'(x)) / g(x)^2
return new OperatorNode('/', 'divide', [new OperatorNode('-', 'subtract', [new OperatorNode('*', 'multiply', [_derivative(arg0, constNodes), arg1.clone()]), new OperatorNode('*', 'multiply', [arg0.clone(), _derivative(arg1, constNodes)])]), new OperatorNode('^', 'pow', [arg1.clone(), createConstantNode(2)])]);
}
if (node.op === '^' && node.isBinary()) {
var _arg = node.args[0];
var _arg2 = node.args[1];
if (constNodes[_arg] !== undefined) {
// If is secretly constant; 0^f(x) = 1 (in JS), 1^f(x) = 1
if (Object(is["l" /* isConstantNode */])(_arg) && (isZero(_arg.value) || equal(_arg.value, 1))) {
return createConstantNode(0);
} // d/dx(c^f(x)) = c^f(x)*ln(c)*f'(x)
return new OperatorNode('*', 'multiply', [node, new OperatorNode('*', 'multiply', [new FunctionNode('log', [_arg.clone()]), _derivative(_arg2.clone(), constNodes)])]);
}
if (constNodes[_arg2] !== undefined) {
if (Object(is["l" /* isConstantNode */])(_arg2)) {
// If is secretly constant; f(x)^0 = 1 -> d/dx(1) = 0
if (isZero(_arg2.value)) {
return createConstantNode(0);
} // Ignore exponent; f(x)^1 = f(x)
if (equal(_arg2.value, 1)) {
return _derivative(_arg, constNodes);
}
} // Elementary Power Rule, d/dx(f(x)^c) = c*f'(x)*f(x)^(c-1)
var powMinusOne = new OperatorNode('^', 'pow', [_arg.clone(), new OperatorNode('-', 'subtract', [_arg2, createConstantNode(1)])]);
return new OperatorNode('*', 'multiply', [_arg2.clone(), new OperatorNode('*', 'multiply', [_derivative(_arg, constNodes), powMinusOne])]);
} // Functional Power Rule, d/dx(f^g) = f^g*[f'*(g/f) + g'ln(f)]
return new OperatorNode('*', 'multiply', [new OperatorNode('^', 'pow', [_arg.clone(), _arg2.clone()]), new OperatorNode('+', 'add', [new OperatorNode('*', 'multiply', [_derivative(_arg, constNodes), new OperatorNode('/', 'divide', [_arg2.clone(), _arg.clone()])]), new OperatorNode('*', 'multiply', [_derivative(_arg2, constNodes), new FunctionNode('log', [_arg.clone()])])])]);
}
throw new Error('Operator "' + node.op + '" is not supported by derivative, or a wrong number of arguments is passed');
}
});
/**
* Ensures the number of arguments for a function are correct,
* and will throw an error otherwise.
*
* @param {FunctionNode} node
*/
function funcArgsCheck(node) {
// TODO add min, max etc
if ((node.name === 'log' || node.name === 'nthRoot' || node.name === 'pow') && node.args.length === 2) {
return;
} // There should be an incorrect number of arguments if we reach here
// Change all args to constants to avoid unidentified
// symbol error when compiling function
for (var i = 0; i < node.args.length; ++i) {
node.args[i] = createConstantNode(0);
}
node.compile().evaluate();
throw new Error('Expected TypeError, but none found');
}
/**
* Helper function to create a constant node with a specific type
* (number, BigNumber, Fraction)
* @param {number} value
* @param {string} [valueType]
* @return {ConstantNode}
*/
function createConstantNode(value, valueType) {
return new ConstantNode(numeric(value, valueType || config.number));
}
return derivative;
});
// CONCATENATED MODULE: ./src/function/algebra/rationalize.js
var rationalize_name = 'rationalize';
var rationalize_dependencies = ['config', 'typed', 'equal', 'isZero', 'add', 'subtract', 'multiply', 'divide', 'pow', 'parse', 'simplify', '?bignumber', '?fraction', 'mathWithTransform', 'ConstantNode', 'OperatorNode', 'FunctionNode', 'SymbolNode', 'ParenthesisNode'];
var createRationalize = /* #__PURE__ */Object(factory["a" /* factory */])(rationalize_name, rationalize_dependencies, function (_ref) {
var config = _ref.config,
typed = _ref.typed,
equal = _ref.equal,
isZero = _ref.isZero,
add = _ref.add,
subtract = _ref.subtract,
multiply = _ref.multiply,
divide = _ref.divide,
pow = _ref.pow,
parse = _ref.parse,
simplify = _ref.simplify,
fraction = _ref.fraction,
bignumber = _ref.bignumber,
mathWithTransform = _ref.mathWithTransform,
ConstantNode = _ref.ConstantNode,
OperatorNode = _ref.OperatorNode,
FunctionNode = _ref.FunctionNode,
SymbolNode = _ref.SymbolNode,
ParenthesisNode = _ref.ParenthesisNode;
var simplifyConstant = createSimplifyConstant({
typed: typed,
config: config,
mathWithTransform: mathWithTransform,
fraction: fraction,
bignumber: bignumber,
ConstantNode: ConstantNode,
OperatorNode: OperatorNode,
FunctionNode: FunctionNode,
SymbolNode: SymbolNode
});
var simplifyCore = createSimplifyCore({
equal: equal,
isZero: isZero,
add: add,
subtract: subtract,
multiply: multiply,
divide: divide,
pow: pow,
ConstantNode: ConstantNode,
OperatorNode: OperatorNode,
FunctionNode: FunctionNode,
ParenthesisNode: ParenthesisNode
});
/**
* Transform a rationalizable expression in a rational fraction.
* If rational fraction is one variable polynomial then converts
* the numerator and denominator in canonical form, with decreasing
* exponents, returning the coefficients of numerator.
*
* Syntax:
*
* rationalize(expr)
* rationalize(expr, detailed)
* rationalize(expr, scope)
* rationalize(expr, scope, detailed)
*
* Examples:
*
* math.rationalize('sin(x)+y')
* // Error: There is an unsolved function call
* math.rationalize('2x/y - y/(x+1)')
* // (2*x^2-y^2+2*x)/(x*y+y)
* math.rationalize('(2x+1)^6')
* // 64*x^6+192*x^5+240*x^4+160*x^3+60*x^2+12*x+1
* math.rationalize('2x/( (2x-1) / (3x+2) ) - 5x/ ( (3x+4) / (2x^2-5) ) + 3')
* // -20*x^4+28*x^3+104*x^2+6*x-12)/(6*x^2+5*x-4)
* math.rationalize('x/(1-x)/(x-2)/(x-3)/(x-4) + 2x/ ( (1-2x)/(2-3x) )/ ((3-4x)/(4-5x) )') =
* // (-30*x^7+344*x^6-1506*x^5+3200*x^4-3472*x^3+1846*x^2-381*x)/
* // (-8*x^6+90*x^5-383*x^4+780*x^3-797*x^2+390*x-72)
*
* math.rationalize('x+x+x+y',{y:1}) // 3*x+1
* math.rationalize('x+x+x+y',{}) // 3*x+y
*
* const ret = math.rationalize('x+x+x+y',{},true)
* // ret.expression=3*x+y, ret.variables = ["x","y"]
* const ret = math.rationalize('-2+5x^2',{},true)
* // ret.expression=5*x^2-2, ret.variables = ["x"], ret.coefficients=[-2,0,5]
*
* See also:
*
* simplify
*
* @param {Node|string} expr The expression to check if is a polynomial expression
* @param {Object|boolean} optional scope of expression or true for already evaluated rational expression at input
* @param {Boolean} detailed optional True if return an object, false if return expression node (default)
*
* @return {Object | Node} The rational polynomial of `expr` or na object
* {Object}
* {Expression Node} expression: node simplified expression
* {Expression Node} numerator: simplified numerator of expression
* {Expression Node | boolean} denominator: simplified denominator or false (if there is no denominator)
* {Array} variables: variable names
* {Array} coefficients: coefficients of numerator sorted by increased exponent
* {Expression Node} node simplified expression
*
*/
return typed(rationalize_name, {
string: function string(expr) {
return this(parse(expr), {}, false);
},
'string, boolean': function stringBoolean(expr, detailed) {
return this(parse(expr), {}, detailed);
},
'string, Object': function stringObject(expr, scope) {
return this(parse(expr), scope, false);
},
'string, Object, boolean': function stringObjectBoolean(expr, scope, detailed) {
return this(parse(expr), scope, detailed);
},
Node: function Node(expr) {
return this(expr, {}, false);
},
'Node, boolean': function NodeBoolean(expr, detailed) {
return this(expr, {}, detailed);
},
'Node, Object': function NodeObject(expr, scope) {
return this(expr, scope, false);
},
'Node, Object, boolean': function NodeObjectBoolean(expr, scope, detailed) {
var setRules = rulesRationalize(); // Rules for change polynomial in near canonical form
var polyRet = polynomial(expr, scope, true, setRules.firstRules); // Check if expression is a rationalizable polynomial
var nVars = polyRet.variables.length;
expr = polyRet.expression;
if (nVars >= 1) {
// If expression in not a constant
expr = expandPower(expr); // First expand power of polynomials (cannot be made from rules!)
var sBefore; // Previous expression
var rules;
var eDistrDiv = true;
var redoInic = false;
expr = simplify(expr, setRules.firstRules, {}, {
exactFractions: false
}); // Apply the initial rules, including succ div rules
var s;
while (true) {
// Apply alternately successive division rules and distr.div.rules
rules = eDistrDiv ? setRules.distrDivRules : setRules.sucDivRules;
expr = simplify(expr, rules); // until no more changes
eDistrDiv = !eDistrDiv; // Swap between Distr.Div and Succ. Div. Rules
s = expr.toString();
if (s === sBefore) {
break; // No changes : end of the loop
}
redoInic = true;
sBefore = s;
}
if (redoInic) {
// Apply first rules again without succ div rules (if there are changes)
expr = simplify(expr, setRules.firstRulesAgain, {}, {
exactFractions: false
});
}
expr = simplify(expr, setRules.finalRules, {}, {
exactFractions: false
}); // Apply final rules
} // NVars >= 1
var coefficients = [];
var retRationalize = {};
if (expr.type === 'OperatorNode' && expr.isBinary() && expr.op === '/') {
// Separate numerator from denominator
if (nVars === 1) {
expr.args[0] = polyToCanonical(expr.args[0], coefficients);
expr.args[1] = polyToCanonical(expr.args[1]);
}
if (detailed) {
retRationalize.numerator = expr.args[0];
retRationalize.denominator = expr.args[1];
}
} else {
if (nVars === 1) {
expr = polyToCanonical(expr, coefficients);
}
if (detailed) {
retRationalize.numerator = expr;
retRationalize.denominator = null;
}
} // nVars
if (!detailed) return expr;
retRationalize.coefficients = coefficients;
retRationalize.variables = polyRet.variables;
retRationalize.expression = expr;
return retRationalize;
} // ^^^^^^^ end of rationalize ^^^^^^^^
}); // end of typed rationalize
/**
* Function to simplify an expression using an optional scope and
* return it if the expression is a polynomial expression, i.e.
* an expression with one or more variables and the operators
* +, -, *, and ^, where the exponent can only be a positive integer.
*
* Syntax:
*
* polynomial(expr,scope,extended, rules)
*
* @param {Node | string} expr The expression to simplify and check if is polynomial expression
* @param {object} scope Optional scope for expression simplification
* @param {boolean} extended Optional. Default is false. When true allows divide operator.
* @param {array} rules Optional. Default is no rule.
*
*
* @return {Object}
* {Object} node: node simplified expression
* {Array} variables: variable names
*/
function polynomial(expr, scope, extended, rules) {
var variables = [];
var node = simplify(expr, rules, scope, {
exactFractions: false
}); // Resolves any variables and functions with all defined parameters
extended = !!extended;
var oper = '+-*' + (extended ? '/' : '');
recPoly(node);
var retFunc = {};
retFunc.expression = node;
retFunc.variables = variables;
return retFunc; // -------------------------------------------------------------------------------------------------------
/**
* Function to simplify an expression using an optional scope and
* return it if the expression is a polynomial expression, i.e.
* an expression with one or more variables and the operators
* +, -, *, and ^, where the exponent can only be a positive integer.
*
* Syntax:
*
* recPoly(node)
*
*
* @param {Node} node The current sub tree expression in recursion
*
* @return nothing, throw an exception if error
*/
function recPoly(node) {
var tp = node.type; // node type
if (tp === 'FunctionNode') {
// No function call in polynomial expression
throw new Error('There is an unsolved function call');
} else if (tp === 'OperatorNode') {
if (node.op === '^') {
// TODO: handle negative exponents like in '1/x^(-2)'
if (node.args[1].type !== 'ConstantNode' || !Object(utils_number["i" /* isInteger */])(parseFloat(node.args[1].value))) {
throw new Error('There is a non-integer exponent');
} else {
recPoly(node.args[0]);
}
} else {
if (oper.indexOf(node.op) === -1) {
throw new Error('Operator ' + node.op + ' invalid in polynomial expression');
}
for (var i = 0; i < node.args.length; i++) {
recPoly(node.args[i]);
}
} // type of operator
} else if (tp === 'SymbolNode') {
var _name = node.name; // variable name
var pos = variables.indexOf(_name);
if (pos === -1) {
// new variable in expression
variables.push(_name);
}
} else if (tp === 'ParenthesisNode') {
recPoly(node.content);
} else if (tp !== 'ConstantNode') {
throw new Error('type ' + tp + ' is not allowed in polynomial expression');
}
} // end of recPoly
} // end of polynomial
// ---------------------------------------------------------------------------------------
/**
* Return a rule set to rationalize an polynomial expression in rationalize
*
* Syntax:
*
* rulesRationalize()
*
* @return {array} rule set to rationalize an polynomial expression
*/
function rulesRationalize() {
var oldRules = [simplifyCore, // sCore
{
l: 'n+n',
r: '2*n'
}, {
l: 'n+-n',
r: '0'
}, simplifyConstant, // sConstant
{
l: 'n*(n1^-1)',
r: 'n/n1'
}, {
l: 'n*n1^-n2',
r: 'n/n1^n2'
}, {
l: 'n1^-1',
r: '1/n1'
}, {
l: 'n*(n1/n2)',
r: '(n*n1)/n2'
}, {
l: '1*n',
r: 'n'
}];
var rulesFirst = [{
l: '(-n1)/(-n2)',
r: 'n1/n2'
}, // Unary division
{
l: '(-n1)*(-n2)',
r: 'n1*n2'
}, // Unary multiplication
{
l: 'n1--n2',
r: 'n1+n2'
}, // '--' elimination
{
l: 'n1-n2',
r: 'n1+(-n2)'
}, // Subtraction turn into add with un<75>ry minus
{
l: '(n1+n2)*n3',
r: '(n1*n3 + n2*n3)'
}, // Distributive 1
{
l: 'n1*(n2+n3)',
r: '(n1*n2+n1*n3)'
}, // Distributive 2
{
l: 'c1*n + c2*n',
r: '(c1+c2)*n'
}, // Joining constants
{
l: 'c1*n + n',
r: '(c1+1)*n'
}, // Joining constants
{
l: 'c1*n - c2*n',
r: '(c1-c2)*n'
}, // Joining constants
{
l: 'c1*n - n',
r: '(c1-1)*n'
}, // Joining constants
{
l: 'v/c',
r: '(1/c)*v'
}, // variable/constant (new!)
{
l: 'v/-c',
r: '-(1/c)*v'
}, // variable/constant (new!)
{
l: '-v*-c',
r: 'c*v'
}, // Inversion constant and variable 1
{
l: '-v*c',
r: '-c*v'
}, // Inversion constant and variable 2
{
l: 'v*-c',
r: '-c*v'
}, // Inversion constant and variable 3
{
l: 'v*c',
r: 'c*v'
}, // Inversion constant and variable 4
{
l: '-(-n1*n2)',
r: '(n1*n2)'
}, // Unary propagation
{
l: '-(n1*n2)',
r: '(-n1*n2)'
}, // Unary propagation
{
l: '-(-n1+n2)',
r: '(n1-n2)'
}, // Unary propagation
{
l: '-(n1+n2)',
r: '(-n1-n2)'
}, // Unary propagation
{
l: '(n1^n2)^n3',
r: '(n1^(n2*n3))'
}, // Power to Power
{
l: '-(-n1/n2)',
r: '(n1/n2)'
}, // Division and Unary
{
l: '-(n1/n2)',
r: '(-n1/n2)'
}]; // Divisao and Unary
var rulesDistrDiv = [{
l: '(n1/n2 + n3/n4)',
r: '((n1*n4 + n3*n2)/(n2*n4))'
}, // Sum of fractions
{
l: '(n1/n2 + n3)',
r: '((n1 + n3*n2)/n2)'
}, // Sum fraction with number 1
{
l: '(n1 + n2/n3)',
r: '((n1*n3 + n2)/n3)'
}]; // Sum fraction with number 1
var rulesSucDiv = [{
l: '(n1/(n2/n3))',
r: '((n1*n3)/n2)'
}, // Division simplification
{
l: '(n1/n2/n3)',
r: '(n1/(n2*n3))'
}];
var setRules = {}; // rules set in 4 steps.
// All rules => infinite loop
// setRules.allRules =oldRules.concat(rulesFirst,rulesDistrDiv,rulesSucDiv)
setRules.firstRules = oldRules.concat(rulesFirst, rulesSucDiv); // First rule set
setRules.distrDivRules = rulesDistrDiv; // Just distr. div. rules
setRules.sucDivRules = rulesSucDiv; // Jus succ. div. rules
setRules.firstRulesAgain = oldRules.concat(rulesFirst); // Last rules set without succ. div.
// Division simplification
// Second rule set.
// There is no aggregate expression with parentesis, but the only variable can be scattered.
setRules.finalRules = [simplifyCore, // simplify.rules[0]
{
l: 'n*-n',
r: '-n^2'
}, // Joining multiply with power 1
{
l: 'n*n',
r: 'n^2'
}, // Joining multiply with power 2
simplifyConstant, // simplify.rules[14] old 3rd index in oldRules
{
l: 'n*-n^n1',
r: '-n^(n1+1)'
}, // Joining multiply with power 3
{
l: 'n*n^n1',
r: 'n^(n1+1)'
}, // Joining multiply with power 4
{
l: 'n^n1*-n^n2',
r: '-n^(n1+n2)'
}, // Joining multiply with power 5
{
l: 'n^n1*n^n2',
r: 'n^(n1+n2)'
}, // Joining multiply with power 6
{
l: 'n^n1*-n',
r: '-n^(n1+1)'
}, // Joining multiply with power 7
{
l: 'n^n1*n',
r: 'n^(n1+1)'
}, // Joining multiply with power 8
{
l: 'n^n1/-n',
r: '-n^(n1-1)'
}, // Joining multiply with power 8
{
l: 'n^n1/n',
r: 'n^(n1-1)'
}, // Joining division with power 1
{
l: 'n/-n^n1',
r: '-n^(1-n1)'
}, // Joining division with power 2
{
l: 'n/n^n1',
r: 'n^(1-n1)'
}, // Joining division with power 3
{
l: 'n^n1/-n^n2',
r: 'n^(n1-n2)'
}, // Joining division with power 4
{
l: 'n^n1/n^n2',
r: 'n^(n1-n2)'
}, // Joining division with power 5
{
l: 'n1+(-n2*n3)',
r: 'n1-n2*n3'
}, // Solving useless parenthesis 1
{
l: 'v*(-c)',
r: '-c*v'
}, // Solving useless unary 2
{
l: 'n1+-n2',
r: 'n1-n2'
}, // Solving +- together (new!)
{
l: 'v*c',
r: 'c*v'
}, // inversion constant with variable
{
l: '(n1^n2)^n3',
r: '(n1^(n2*n3))'
} // Power to Power
];
return setRules;
} // End rulesRationalize
// ---------------------------------------------------------------------------------------
/**
* Expand recursively a tree node for handling with expressions with exponents
* (it's not for constants, symbols or functions with exponents)
* PS: The other parameters are internal for recursion
*
* Syntax:
*
* expandPower(node)
*
* @param {Node} node Current expression node
* @param {node} parent Parent current node inside the recursion
* @param (int} Parent number of chid inside the rercursion
*
* @return {node} node expression with all powers expanded.
*/
function expandPower(node, parent, indParent) {
var tp = node.type;
var internal = arguments.length > 1; // TRUE in internal calls
if (tp === 'OperatorNode' && node.isBinary()) {
var does = false;
var val;
if (node.op === '^') {
// First operator: Parenthesis or UnaryMinus
if ((node.args[0].type === 'ParenthesisNode' || node.args[0].type === 'OperatorNode') && node.args[1].type === 'ConstantNode') {
// Second operator: Constant
val = parseFloat(node.args[1].value);
does = val >= 2 && Object(utils_number["i" /* isInteger */])(val);
}
}
if (does) {
// Exponent >= 2
// Before:
// operator A --> Subtree
// parent pow
// constant
//
if (val > 2) {
// Exponent > 2,
// AFTER: (exponent > 2)
// operator A --> Subtree
// parent *
// deep clone (operator A --> Subtree
// pow
// constant - 1
//
var nEsqTopo = node.args[0];
var nDirTopo = new OperatorNode('^', 'pow', [node.args[0].cloneDeep(), new ConstantNode(val - 1)]);
node = new OperatorNode('*', 'multiply', [nEsqTopo, nDirTopo]);
} else {
// Expo = 2 - no power
// AFTER: (exponent = 2)
// operator A --> Subtree
// parent oper
// deep clone (operator A --> Subtree)
//
node = new OperatorNode('*', 'multiply', [node.args[0], node.args[0].cloneDeep()]);
}
if (internal) {
// Change parent references in internal recursive calls
if (indParent === 'content') {
parent.content = node;
} else {
parent.args[indParent] = node;
}
}
} // does
} // binary OperatorNode
if (tp === 'ParenthesisNode') {
// Recursion
expandPower(node.content, node, 'content');
} else if (tp !== 'ConstantNode' && tp !== 'SymbolNode') {
for (var i = 0; i < node.args.length; i++) {
expandPower(node.args[i], node, i);
}
}
if (!internal) {
// return the root node
return node;
}
} // End expandPower
// ---------------------------------------------------------------------------------------
/**
* Auxilary function for rationalize
* Convert near canonical polynomial in one variable in a canonical polynomial
* with one term for each exponent in decreasing order
*
* Syntax:
*
* polyToCanonical(node [, coefficients])
*
* @param {Node | string} expr The near canonical polynomial expression to convert in a a canonical polynomial expression
*
* The string or tree expression needs to be at below syntax, with free spaces:
* ( (^(-)? | [+-]? )cte (*)? var (^expo)? | cte )+
* Where 'var' is one variable with any valid name
* 'cte' are real numeric constants with any value. It can be omitted if equal than 1
* 'expo' are integers greater than 0. It can be omitted if equal than 1.
*
* @param {array} coefficients Optional returns coefficients sorted by increased exponent
*
*
* @return {node} new node tree with one variable polynomial or string error.
*/
function polyToCanonical(node, coefficients) {
if (coefficients === undefined) {
coefficients = [];
} // coefficients.
coefficients[0] = 0; // index is the exponent
var o = {};
o.cte = 1;
o.oper = '+'; // fire: mark with * or ^ when finds * or ^ down tree, reset to "" with + and -.
// It is used to deduce the exponent: 1 for *, 0 for "".
o.fire = '';
var maxExpo = 0; // maximum exponent
var varname = ''; // variable name
recurPol(node, null, o);
maxExpo = coefficients.length - 1;
var first = true;
var no;
for (var i = maxExpo; i >= 0; i--) {
if (coefficients[i] === 0) continue;
var n1 = new ConstantNode(first ? coefficients[i] : Math.abs(coefficients[i]));
var op = coefficients[i] < 0 ? '-' : '+';
if (i > 0) {
// Is not a constant without variable
var n2 = new SymbolNode(varname);
if (i > 1) {
var n3 = new ConstantNode(i);
n2 = new OperatorNode('^', 'pow', [n2, n3]);
}
if (coefficients[i] === -1 && first) {
n1 = new OperatorNode('-', 'unaryMinus', [n2]);
} else if (Math.abs(coefficients[i]) === 1) {
n1 = n2;
} else {
n1 = new OperatorNode('*', 'multiply', [n1, n2]);
}
}
if (first) {
no = n1;
} else if (op === '+') {
no = new OperatorNode('+', 'add', [no, n1]);
} else {
no = new OperatorNode('-', 'subtract', [no, n1]);
}
first = false;
} // for
if (first) {
return new ConstantNode(0);
} else {
return no;
}
/**
* Recursive auxilary function inside polyToCanonical for
* converting expression in canonical form
*
* Syntax:
*
* recurPol(node, noPai, obj)
*
* @param {Node} node The current subpolynomial expression
* @param {Node | Null} noPai The current parent node
* @param {object} obj Object with many internal flags
*
* @return {} No return. If error, throws an exception
*/
function recurPol(node, noPai, o) {
var tp = node.type;
if (tp === 'FunctionNode') {
// ***** FunctionName *****
// No function call in polynomial expression
throw new Error('There is an unsolved function call');
} else if (tp === 'OperatorNode') {
// ***** OperatorName *****
if ('+-*^'.indexOf(node.op) === -1) throw new Error('Operator ' + node.op + ' invalid');
if (noPai !== null) {
// -(unary),^ : children of *,+,-
if ((node.fn === 'unaryMinus' || node.fn === 'pow') && noPai.fn !== 'add' && noPai.fn !== 'subtract' && noPai.fn !== 'multiply') {
throw new Error('Invalid ' + node.op + ' placing');
} // -,+,* : children of +,-
if ((node.fn === 'subtract' || node.fn === 'add' || node.fn === 'multiply') && noPai.fn !== 'add' && noPai.fn !== 'subtract') {
throw new Error('Invalid ' + node.op + ' placing');
} // -,+ : first child
if ((node.fn === 'subtract' || node.fn === 'add' || node.fn === 'unaryMinus') && o.noFil !== 0) {
throw new Error('Invalid ' + node.op + ' placing');
}
} // Has parent
// Firers: ^,* Old: ^,&,-(unary): firers
if (node.op === '^' || node.op === '*') {
o.fire = node.op;
}
for (var _i = 0; _i < node.args.length; _i++) {
// +,-: reset fire
if (node.fn === 'unaryMinus') o.oper = '-';
if (node.op === '+' || node.fn === 'subtract') {
o.fire = '';
o.cte = 1; // default if there is no constant
o.oper = _i === 0 ? '+' : node.op;
}
o.noFil = _i; // number of son
recurPol(node.args[_i], node, o);
} // for in children
} else if (tp === 'SymbolNode') {
// ***** SymbolName *****
if (node.name !== varname && varname !== '') {
throw new Error('There is more than one variable');
}
varname = node.name;
if (noPai === null) {
coefficients[1] = 1;
return;
} // ^: Symbol is First child
if (noPai.op === '^' && o.noFil !== 0) {
throw new Error('In power the variable should be the first parameter');
} // *: Symbol is Second child
if (noPai.op === '*' && o.noFil !== 1) {
throw new Error('In multiply the variable should be the second parameter');
} // Symbol: firers '',* => it means there is no exponent above, so it's 1 (cte * var)
if (o.fire === '' || o.fire === '*') {
if (maxExpo < 1) coefficients[1] = 0;
coefficients[1] += o.cte * (o.oper === '+' ? 1 : -1);
maxExpo = Math.max(1, maxExpo);
}
} else if (tp === 'ConstantNode') {
var valor = parseFloat(node.value);
if (noPai === null) {
coefficients[0] = valor;
return;
}
if (noPai.op === '^') {
// cte: second child of power
if (o.noFil !== 1) throw new Error('Constant cannot be powered');
if (!Object(utils_number["i" /* isInteger */])(valor) || valor <= 0) {
throw new Error('Non-integer exponent is not allowed');
}
for (var _i2 = maxExpo + 1; _i2 < valor; _i2++) {
coefficients[_i2] = 0;
}
if (valor > maxExpo) coefficients[valor] = 0;
coefficients[valor] += o.cte * (o.oper === '+' ? 1 : -1);
maxExpo = Math.max(valor, maxExpo);
return;
}
o.cte = valor; // Cte: firer '' => There is no exponent and no multiplication, so the exponent is 0.
if (o.fire === '') {
coefficients[0] += o.cte * (o.oper === '+' ? 1 : -1);
}
} else {
throw new Error('Type ' + tp + ' is not allowed');
}
} // End of recurPol
} // End of polyToCanonical
});
// CONCATENATED MODULE: ./src/json/reviver.js
var reviver_name = 'reviver';
var reviver_dependencies = ['classes'];
var createReviver = /* #__PURE__ */Object(factory["a" /* factory */])(reviver_name, reviver_dependencies, function (_ref) {
var classes = _ref.classes;
/**
* Instantiate mathjs data types from their JSON representation
* @param {string} key
* @param {*} value
* @returns {*} Returns the revived object
*/
return function reviver(key, value) {
var constructor = classes[value && value.mathjs];
if (constructor && typeof constructor.fromJSON === 'function') {
return constructor.fromJSON(value);
}
return value;
};
});
// CONCATENATED MODULE: ./src/json/replacer.js
var replacer_name = 'replacer';
var replacer_dependencies = [];
var createReplacer = /* #__PURE__ */Object(factory["a" /* factory */])(replacer_name, replacer_dependencies, function () {
/**
* Stringify data types into their JSON representation.
* Most data types can be serialized using their `.toJSON` method,
* but not all, for example the number `Infinity`. For these cases you have
* to use the replacer. Example usage:
*
* JSON.stringify([2, Infinity], math.replacer)
*
* @param {string} key
* @param {*} value
* @returns {*} Returns the replaced object
*/
return function replacer(key, value) {
// the numeric values Infinitiy, -Infinity, and NaN cannot be serialized to JSON
if (typeof value === 'number' && (!isFinite(value) || isNaN(value))) {
return {
mathjs: 'number',
value: String(value)
};
}
return value;
};
});
// CONCATENATED MODULE: ./src/version.js
var version = '7.1.0'; // Note: This file is automatically generated when building math.js.
// Changes made in this file will be overwritten.
// CONCATENATED MODULE: ./src/plain/number/constants.js
var constants_pi = Math.PI;
var tau = 2 * Math.PI;
var constants_e = Math.E;
var constants_phi = 1.61803398874989484820458683436563811772030917980576286213545;
// CONCATENATED MODULE: ./src/constants.js
var createTrue = /* #__PURE__ */Object(factory["a" /* factory */])('true', [], function () {
return true;
});
var createFalse = /* #__PURE__ */Object(factory["a" /* factory */])('false', [], function () {
return false;
});
var createNull = /* #__PURE__ */Object(factory["a" /* factory */])('null', [], function () {
return null;
});
var createInfinity = /* #__PURE__ */recreateFactory('Infinity', ['config', '?BigNumber'], function (_ref) {
var config = _ref.config,
BigNumber = _ref.BigNumber;
return config.number === 'BigNumber' ? new BigNumber(Infinity) : Infinity;
});
var createNaN = /* #__PURE__ */recreateFactory('NaN', ['config', '?BigNumber'], function (_ref2) {
var config = _ref2.config,
BigNumber = _ref2.BigNumber;
return config.number === 'BigNumber' ? new BigNumber(NaN) : NaN;
});
var createPi = /* #__PURE__ */recreateFactory('pi', ['config', '?BigNumber'], function (_ref3) {
var config = _ref3.config,
BigNumber = _ref3.BigNumber;
return config.number === 'BigNumber' ? createBigNumberPi(BigNumber) : constants_pi;
});
var createTau = /* #__PURE__ */recreateFactory('tau', ['config', '?BigNumber'], function (_ref4) {
var config = _ref4.config,
BigNumber = _ref4.BigNumber;
return config.number === 'BigNumber' ? createBigNumberTau(BigNumber) : tau;
});
var createE = /* #__PURE__ */recreateFactory('e', ['config', '?BigNumber'], function (_ref5) {
var config = _ref5.config,
BigNumber = _ref5.BigNumber;
return config.number === 'BigNumber' ? createBigNumberE(BigNumber) : constants_e;
}); // golden ratio, (1+sqrt(5))/2
var createPhi = /* #__PURE__ */recreateFactory('phi', ['config', '?BigNumber'], function (_ref6) {
var config = _ref6.config,
BigNumber = _ref6.BigNumber;
return config.number === 'BigNumber' ? createBigNumberPhi(BigNumber) : constants_phi;
});
var createLN2 = /* #__PURE__ */recreateFactory('LN2', ['config', '?BigNumber'], function (_ref7) {
var config = _ref7.config,
BigNumber = _ref7.BigNumber;
return config.number === 'BigNumber' ? new BigNumber(2).ln() : Math.LN2;
});
var createLN10 = /* #__PURE__ */recreateFactory('LN10', ['config', '?BigNumber'], function (_ref8) {
var config = _ref8.config,
BigNumber = _ref8.BigNumber;
return config.number === 'BigNumber' ? new BigNumber(10).ln() : Math.LN10;
});
var createLOG2E = /* #__PURE__ */recreateFactory('LOG2E', ['config', '?BigNumber'], function (_ref9) {
var config = _ref9.config,
BigNumber = _ref9.BigNumber;
return config.number === 'BigNumber' ? new BigNumber(1).div(new BigNumber(2).ln()) : Math.LOG2E;
});
var createLOG10E = /* #__PURE__ */recreateFactory('LOG10E', ['config', '?BigNumber'], function (_ref10) {
var config = _ref10.config,
BigNumber = _ref10.BigNumber;
return config.number === 'BigNumber' ? new BigNumber(1).div(new BigNumber(10).ln()) : Math.LOG10E;
});
var createSQRT1_2 = /* #__PURE__ */recreateFactory( // eslint-disable-line camelcase
'SQRT1_2', ['config', '?BigNumber'], function (_ref11) {
var config = _ref11.config,
BigNumber = _ref11.BigNumber;
return config.number === 'BigNumber' ? new BigNumber('0.5').sqrt() : Math.SQRT1_2;
});
var createSQRT2 = /* #__PURE__ */recreateFactory('SQRT2', ['config', '?BigNumber'], function (_ref12) {
var config = _ref12.config,
BigNumber = _ref12.BigNumber;
return config.number === 'BigNumber' ? new BigNumber(2).sqrt() : Math.SQRT2;
});
var createI = /* #__PURE__ */recreateFactory('i', ['Complex'], function (_ref13) {
var Complex = _ref13.Complex;
return Complex.I;
}); // for backward compatibility with v5
var createUppercasePi = /* #__PURE__ */Object(factory["a" /* factory */])('PI', ['pi'], function (_ref14) {
var pi = _ref14.pi;
return pi;
});
var createUppercaseE = /* #__PURE__ */Object(factory["a" /* factory */])('E', ['e'], function (_ref15) {
var e = _ref15.e;
return e;
});
var createVersion = /* #__PURE__ */Object(factory["a" /* factory */])('version', [], function () {
return version;
}); // helper function to create a factory with a flag recreateOnConfigChange
// idea: allow passing optional properties to be attached to the factory function as 4th argument?
function recreateFactory(name, dependencies, create) {
return Object(factory["a" /* factory */])(name, dependencies, create, {
recreateOnConfigChange: true
});
}
// CONCATENATED MODULE: ./src/type/unit/physicalConstants.js
// Source: https://en.wikipedia.org/wiki/Physical_constant
// Universal constants
var createSpeedOfLight = /* #__PURE__ */unitFactory('speedOfLight', '299792458', 'm s^-1');
var createGravitationConstant = /* #__PURE__ */unitFactory('gravitationConstant', '6.67430e-11', 'm^3 kg^-1 s^-2');
var createPlanckConstant = /* #__PURE__ */unitFactory('planckConstant', '6.62607015e-34', 'J s');
var createReducedPlanckConstant = /* #__PURE__ */unitFactory('reducedPlanckConstant', '1.0545718176461565e-34', 'J s'); // Electromagnetic constants
var createMagneticConstant = /* #__PURE__ */unitFactory('magneticConstant', '1.25663706212e-6', 'N A^-2');
var createElectricConstant = /* #__PURE__ */unitFactory('electricConstant', '8.8541878128e-12', 'F m^-1');
var createVacuumImpedance = /* #__PURE__ */unitFactory('vacuumImpedance', '376.730313667', 'ohm');
var createCoulomb = /* #__PURE__ */unitFactory('coulomb', '8.987551792261171e9', 'N m^2 C^-2');
var createElementaryCharge = /* #__PURE__ */unitFactory('elementaryCharge', '1.602176634e-19', 'C');
var createBohrMagneton = /* #__PURE__ */unitFactory('bohrMagneton', '9.2740100783e-24', 'J T^-1');
var createConductanceQuantum = /* #__PURE__ */unitFactory('conductanceQuantum', '7.748091729863649e-5', 'S');
var createInverseConductanceQuantum = /* #__PURE__ */unitFactory('inverseConductanceQuantum', '12906.403729652257', 'ohm');
var createMagneticFluxQuantum = /* #__PURE__ */unitFactory('magneticFluxQuantum', '2.0678338484619295e-15', 'Wb');
var createNuclearMagneton = /* #__PURE__ */unitFactory('nuclearMagneton', '5.0507837461e-27', 'J T^-1');
var createKlitzing = /* #__PURE__ */unitFactory('klitzing', '25812.807459304513', 'ohm');
var createJosephson = /* #__PURE__ */unitFactory('josephson', '4.835978484169836e14 Hz V', 'Hz V^-1'); // TODO: support for Hz needed
// Atomic and nuclear constants
var createBohrRadius = /* #__PURE__ */unitFactory('bohrRadius', '5.29177210903e-11', 'm');
var createClassicalElectronRadius = /* #__PURE__ */unitFactory('classicalElectronRadius', '2.8179403262e-15', 'm');
var createElectronMass = /* #__PURE__ */unitFactory('electronMass', '9.1093837015e-31', 'kg');
var createFermiCoupling = /* #__PURE__ */unitFactory('fermiCoupling', '1.1663787e-5', 'GeV^-2');
var createFineStructure = numberFactory('fineStructure', 7.2973525693e-3);
var createHartreeEnergy = /* #__PURE__ */unitFactory('hartreeEnergy', '4.3597447222071e-18', 'J');
var createProtonMass = /* #__PURE__ */unitFactory('protonMass', '1.67262192369e-27', 'kg');
var createDeuteronMass = /* #__PURE__ */unitFactory('deuteronMass', '3.3435830926e-27', 'kg');
var createNeutronMass = /* #__PURE__ */unitFactory('neutronMass', '1.6749271613e-27', 'kg');
var createQuantumOfCirculation = /* #__PURE__ */unitFactory('quantumOfCirculation', '3.6369475516e-4', 'm^2 s^-1');
var createRydberg = /* #__PURE__ */unitFactory('rydberg', '10973731.568160', 'm^-1');
var createThomsonCrossSection = /* #__PURE__ */unitFactory('thomsonCrossSection', '6.6524587321e-29', 'm^2');
var createWeakMixingAngle = numberFactory('weakMixingAngle', 0.22290);
var createEfimovFactor = numberFactory('efimovFactor', 22.7); // Physico-chemical constants
var createAtomicMass = /* #__PURE__ */unitFactory('atomicMass', '1.66053906660e-27', 'kg');
var createAvogadro = /* #__PURE__ */unitFactory('avogadro', '6.02214076e23', 'mol^-1');
var createBoltzmann = /* #__PURE__ */unitFactory('boltzmann', '1.380649e-23', 'J K^-1');
var createFaraday = /* #__PURE__ */unitFactory('faraday', '96485.33212331001', 'C mol^-1');
var createFirstRadiation = /* #__PURE__ */unitFactory('firstRadiation', '3.7417718521927573e-16', 'W m^2'); // export const createSpectralRadiance = /* #__PURE__ */ unitFactory('spectralRadiance', '1.1910429723971881e-16', 'W m^2 sr^-1') // TODO spectralRadiance
var createLoschmidt = /* #__PURE__ */unitFactory('loschmidt', '2.686780111798444e25', 'm^-3');
var createGasConstant = /* #__PURE__ */unitFactory('gasConstant', '8.31446261815324', 'J K^-1 mol^-1');
var createMolarPlanckConstant = /* #__PURE__ */unitFactory('molarPlanckConstant', '3.990312712893431e-10', 'J s mol^-1');
var createMolarVolume = /* #__PURE__ */unitFactory('molarVolume', '0.022413969545014137', 'm^3 mol^-1');
var createSackurTetrode = numberFactory('sackurTetrode', -1.16487052358);
var createSecondRadiation = /* #__PURE__ */unitFactory('secondRadiation', '0.014387768775039337', 'm K');
var createStefanBoltzmann = /* #__PURE__ */unitFactory('stefanBoltzmann', '5.67037441918443e-8', 'W m^-2 K^-4');
var createWienDisplacement = /* #__PURE__ */unitFactory('wienDisplacement', '2.897771955e-3', 'm K'); // Adopted values
var createMolarMass = /* #__PURE__ */unitFactory('molarMass', '0.99999999965e-3', 'kg mol^-1');
var createMolarMassC12 = /* #__PURE__ */unitFactory('molarMassC12', '11.9999999958e-3', 'kg mol^-1');
var createGravity = /* #__PURE__ */unitFactory('gravity', '9.80665', 'm s^-2'); // atm is defined in Unit.js
// Natural units
var createPlanckLength = /* #__PURE__ */unitFactory('planckLength', '1.616255e-35', 'm');
var createPlanckMass = /* #__PURE__ */unitFactory('planckMass', '2.176435e-8', 'kg');
var createPlanckTime = /* #__PURE__ */unitFactory('planckTime', '5.391245e-44', 's');
var createPlanckCharge = /* #__PURE__ */unitFactory('planckCharge', '1.87554603778e-18', 'C');
var createPlanckTemperature = /* #__PURE__ */unitFactory('planckTemperature', '1.416785e+32', 'K'); // helper function to create a factory function which creates a physical constant,
// a Unit with either a number value or a BigNumber value depending on the configuration
function unitFactory(name, valueStr, unitStr) {
var dependencies = ['config', 'Unit', 'BigNumber'];
return Object(factory["a" /* factory */])(name, dependencies, function (_ref) {
var config = _ref.config,
Unit = _ref.Unit,
BigNumber = _ref.BigNumber;
// Note that we can parse into number or BigNumber.
// We do not parse into Fractions as that doesn't make sense: we would lose precision of the values
// Therefore we dont use Unit.parse()
var value = config.number === 'BigNumber' ? new BigNumber(valueStr) : parseFloat(valueStr);
var unit = new Unit(value, unitStr);
unit.fixPrefix = true;
return unit;
});
} // helper function to create a factory function which creates a numeric constant,
// either a number or BigNumber depending on the configuration
function numberFactory(name, value) {
var dependencies = ['config', 'BigNumber'];
return Object(factory["a" /* factory */])(name, dependencies, function (_ref2) {
var config = _ref2.config,
BigNumber = _ref2.BigNumber;
return config.number === 'BigNumber' ? new BigNumber(value) : value;
});
}
// CONCATENATED MODULE: ./src/expression/transform/apply.transform.js
var apply_transform_name = 'apply';
var apply_transform_dependencies = ['typed', 'isInteger'];
/**
* Attach a transform function to math.apply
* Adds a property transform containing the transform function.
*
* This transform changed the last `dim` parameter of function apply
* from one-based to zero based
*/
var createApplyTransform = /* #__PURE__ */Object(factory["a" /* factory */])(apply_transform_name, apply_transform_dependencies, function (_ref) {
var typed = _ref.typed,
isInteger = _ref.isInteger;
var apply = createApply({
typed: typed,
isInteger: isInteger
}); // @see: comment of concat itself
return typed('apply', {
'...any': function any(args) {
// change dim from one-based to zero-based
var dim = args[1];
if (Object(is["y" /* isNumber */])(dim)) {
args[1] = dim - 1;
} else if (Object(is["e" /* isBigNumber */])(dim)) {
args[1] = dim.minus(1);
}
try {
return apply.apply(null, args);
} catch (err) {
throw errorTransform(err);
}
}
});
}, {
isTransformFunction: true
});
// CONCATENATED MODULE: ./src/expression/transform/column.transform.js
var column_transform_name = 'column';
var column_transform_dependencies = ['typed', 'Index', 'matrix', 'range'];
/**
* Attach a transform function to matrix.column
* Adds a property transform containing the transform function.
*
* This transform changed the last `index` parameter of function column
* from zero-based to one-based
*/
var createColumnTransform = /* #__PURE__ */Object(factory["a" /* factory */])(column_transform_name, column_transform_dependencies, function (_ref) {
var typed = _ref.typed,
Index = _ref.Index,
matrix = _ref.matrix,
range = _ref.range;
var column = createColumn({
typed: typed,
Index: Index,
matrix: matrix,
range: range
}); // @see: comment of column itself
return typed('column', {
'...any': function any(args) {
// change last argument from zero-based to one-based
var lastIndex = args.length - 1;
var last = args[lastIndex];
if (Object(is["y" /* isNumber */])(last)) {
args[lastIndex] = last - 1;
}
try {
return column.apply(null, args);
} catch (err) {
throw errorTransform(err);
}
}
});
}, {
isTransformFunction: true
});
// CONCATENATED MODULE: ./src/expression/transform/utils/compileInlineExpression.js
/**
* Compile an inline expression like "x > 0"
* @param {Node} expression
* @param {Object} math
* @param {Object} scope
* @return {function} Returns a function with one argument which fills in the
* undefined variable (like "x") and evaluates the expression
*/
function compileInlineExpression(expression, math, scope) {
// find an undefined symbol
var symbol = expression.filter(function (node) {
return Object(is["J" /* isSymbolNode */])(node) && !(node.name in math) && !(node.name in scope);
})[0];
if (!symbol) {
throw new Error('No undefined variable found in inline expression "' + expression + '"');
} // create a test function for this equation
var name = symbol.name; // variable name
var subScope = Object.create(scope);
var eq = expression.compile();
return function inlineExpression(x) {
subScope[name] = x;
return eq.evaluate(subScope);
};
}
// CONCATENATED MODULE: ./src/expression/transform/filter.transform.js
var filter_transform_name = 'filter';
var filter_transform_dependencies = ['typed'];
var createFilterTransform = /* #__PURE__ */Object(factory["a" /* factory */])(filter_transform_name, filter_transform_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Attach a transform function to math.filter
* Adds a property transform containing the transform function.
*
* This transform adds support for equations as test function for math.filter,
* so you can do something like 'filter([3, -2, 5], x > 0)'.
*/
function filterTransform(args, math, scope) {
var x, callback;
if (args[0]) {
x = args[0].compile().evaluate(scope);
}
if (args[1]) {
if (Object(is["J" /* isSymbolNode */])(args[1]) || Object(is["q" /* isFunctionAssignmentNode */])(args[1])) {
// a function pointer, like filter([3, -2, 5], myTestFunction)
callback = args[1].compile().evaluate(scope);
} else {
// an expression like filter([3, -2, 5], x > 0)
callback = compileInlineExpression(args[1], math, scope);
}
}
return filter(x, callback);
}
filterTransform.rawArgs = true; // one based version of function filter
var filter = typed('filter', {
'Array, function': _filter,
'Matrix, function': function MatrixFunction(x, test) {
return x.create(_filter(x.toArray(), test));
},
'Array, RegExp': utils_array["d" /* filterRegExp */],
'Matrix, RegExp': function MatrixRegExp(x, test) {
return x.create(Object(utils_array["d" /* filterRegExp */])(x.toArray(), test));
}
});
return filterTransform;
}, {
isTransformFunction: true
});
/**
* Filter values in a callback given a callback function
*
* !!! Passes a one-based index !!!
*
* @param {Array} x
* @param {Function} callback
* @return {Array} Returns the filtered array
* @private
*/
function _filter(x, callback) {
// figure out what number of arguments the callback function expects
var args = maxArgumentCount(callback);
return Object(utils_array["c" /* filter */])(x, function (value, index, array) {
// invoke the callback function with the right number of arguments
if (args === 1) {
return callback(value);
} else if (args === 2) {
return callback(value, [index + 1]);
} else {
// 3 or -1
return callback(value, [index + 1], array);
}
});
}
// CONCATENATED MODULE: ./src/expression/transform/forEach.transform.js
var forEach_transform_name = 'forEach';
var forEach_transform_dependencies = ['typed'];
var createForEachTransform = /* #__PURE__ */Object(factory["a" /* factory */])(forEach_transform_name, forEach_transform_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Attach a transform function to math.forEach
* Adds a property transform containing the transform function.
*
* This transform creates a one-based index instead of a zero-based index
*/
function forEachTransform(args, math, scope) {
var x, callback;
if (args[0]) {
x = args[0].compile().evaluate(scope);
}
if (args[1]) {
if (Object(is["J" /* isSymbolNode */])(args[1]) || Object(is["q" /* isFunctionAssignmentNode */])(args[1])) {
// a function pointer, like forEach([3, -2, 5], myTestFunction)
callback = args[1].compile().evaluate(scope);
} else {
// an expression like forEach([3, -2, 5], x > 0 ? callback1(x) : callback2(x) )
callback = compileInlineExpression(args[1], math, scope);
}
}
return _forEach(x, callback);
}
forEachTransform.rawArgs = true; // one-based version of forEach
var _forEach = typed('forEach', {
'Array | Matrix, function': function ArrayMatrixFunction(array, callback) {
// figure out what number of arguments the callback function expects
var args = maxArgumentCount(callback);
var recurse = function recurse(value, index) {
if (Array.isArray(value)) {
Object(utils_array["f" /* forEach */])(value, function (child, i) {
// we create a copy of the index array and append the new index value
recurse(child, index.concat(i + 1)); // one based index, hence i+1
});
} else {
// invoke the callback function with the right number of arguments
if (args === 1) {
callback(value);
} else if (args === 2) {
callback(value, index);
} else {
// 3 or -1
callback(value, index, array);
}
}
};
recurse(array.valueOf(), []); // pass Array
}
});
return forEachTransform;
}, {
isTransformFunction: true
});
// CONCATENATED MODULE: ./src/expression/transform/index.transform.js
var index_transform_name = 'index';
var index_transform_dependencies = ['Index'];
var createIndexTransform = /* #__PURE__ */Object(factory["a" /* factory */])(index_transform_name, index_transform_dependencies, function (_ref) {
var Index = _ref.Index;
/**
* Attach a transform function to math.index
* Adds a property transform containing the transform function.
*
* This transform creates a one-based index instead of a zero-based index
*/
return function indexTransform() {
var args = [];
for (var i = 0, ii = arguments.length; i < ii; i++) {
var arg = arguments[i]; // change from one-based to zero based, and convert BigNumber to number
if (Object(is["D" /* isRange */])(arg)) {
arg.start--;
arg.end -= arg.step > 0 ? 0 : 2;
} else if (arg && arg.isSet === true) {
arg = arg.map(function (v) {
return v - 1;
});
} else if (Object(is["b" /* isArray */])(arg) || Object(is["v" /* isMatrix */])(arg)) {
arg = arg.map(function (v) {
return v - 1;
});
} else if (Object(is["y" /* isNumber */])(arg)) {
arg--;
} else if (Object(is["e" /* isBigNumber */])(arg)) {
arg = arg.toNumber() - 1;
} else if (typeof arg === 'string') {// leave as is
} else {
throw new TypeError('Dimension must be an Array, Matrix, number, string, or Range');
}
args[i] = arg;
}
var res = new Index();
Index.apply(res, args);
return res;
};
}, {
isTransformFunction: true
});
// CONCATENATED MODULE: ./src/expression/transform/map.transform.js
var map_transform_name = 'map';
var map_transform_dependencies = ['typed'];
var createMapTransform = /* #__PURE__ */Object(factory["a" /* factory */])(map_transform_name, map_transform_dependencies, function (_ref) {
var typed = _ref.typed;
/**
* Attach a transform function to math.map
* Adds a property transform containing the transform function.
*
* This transform creates a one-based index instead of a zero-based index
*/
function mapTransform(args, math, scope) {
var x, callback;
if (args[0]) {
x = args[0].compile().evaluate(scope);
}
if (args[1]) {
if (Object(is["J" /* isSymbolNode */])(args[1]) || Object(is["q" /* isFunctionAssignmentNode */])(args[1])) {
// a function pointer, like filter([3, -2, 5], myTestFunction)
callback = args[1].compile().evaluate(scope);
} else {
// an expression like filter([3, -2, 5], x > 0)
callback = compileInlineExpression(args[1], math, scope);
}
}
return map(x, callback);
}
mapTransform.rawArgs = true; // one-based version of map function
var map = typed('map', {
'Array, function': function ArrayFunction(x, callback) {
return map_transform_map(x, callback, x);
},
'Matrix, function': function MatrixFunction(x, callback) {
return x.create(map_transform_map(x.valueOf(), callback, x));
}
});
return mapTransform;
}, {
isTransformFunction: true
});
/**
* Map for a multi dimensional array. One-based indexes
* @param {Array} array
* @param {function} callback
* @param {Array} orig
* @return {Array}
* @private
*/
function map_transform_map(array, callback, orig) {
// figure out what number of arguments the callback function expects
var argsCount = maxArgumentCount(callback);
function recurse(value, index) {
if (Array.isArray(value)) {
return Object(utils_array["k" /* map */])(value, function (child, i) {
// we create a copy of the index array and append the new index value
return recurse(child, index.concat(i + 1)); // one based index, hence i + 1
});
} else {
// invoke the (typed) callback function with the right number of arguments
if (argsCount === 1) {
return callback(value);
} else if (argsCount === 2) {
return callback(value, index);
} else {
// 3 or -1
return callback(value, index, orig);
}
}
}
return recurse(array, []);
}
// CONCATENATED MODULE: ./src/expression/transform/max.transform.js
var max_transform_name = 'max';
var max_transform_dependencies = ['typed', 'config', 'numeric', 'larger'];
var createMaxTransform = /* #__PURE__ */Object(factory["a" /* factory */])(max_transform_name, max_transform_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
numeric = _ref.numeric,
larger = _ref.larger;
var max = createMax({
typed: typed,
config: config,
numeric: numeric,
larger: larger
});
/**
* Attach a transform function to math.max
* Adds a property transform containing the transform function.
*
* This transform changed the last `dim` parameter of function max
* from one-based to zero based
*/
return typed('max', {
'...any': function any(args) {
// change last argument dim from one-based to zero-based
if (args.length === 2 && Object(is["i" /* isCollection */])(args[0])) {
var dim = args[1];
if (Object(is["y" /* isNumber */])(dim)) {
args[1] = dim - 1;
} else if (Object(is["e" /* isBigNumber */])(dim)) {
args[1] = dim.minus(1);
}
}
try {
return max.apply(null, args);
} catch (err) {
throw errorTransform(err);
}
}
});
}, {
isTransformFunction: true
});
// CONCATENATED MODULE: ./src/expression/transform/mean.transform.js
var mean_transform_name = 'mean';
var mean_transform_dependencies = ['typed', 'add', 'divide'];
var createMeanTransform = /* #__PURE__ */Object(factory["a" /* factory */])(mean_transform_name, mean_transform_dependencies, function (_ref) {
var typed = _ref.typed,
add = _ref.add,
divide = _ref.divide;
var mean = createMean({
typed: typed,
add: add,
divide: divide
});
/**
* Attach a transform function to math.mean
* Adds a property transform containing the transform function.
*
* This transform changed the last `dim` parameter of function mean
* from one-based to zero based
*/
return typed('mean', {
'...any': function any(args) {
// change last argument dim from one-based to zero-based
if (args.length === 2 && Object(is["i" /* isCollection */])(args[0])) {
var dim = args[1];
if (Object(is["y" /* isNumber */])(dim)) {
args[1] = dim - 1;
} else if (Object(is["e" /* isBigNumber */])(dim)) {
args[1] = dim.minus(1);
}
}
try {
return mean.apply(null, args);
} catch (err) {
throw errorTransform(err);
}
}
});
}, {
isTransformFunction: true
});
// CONCATENATED MODULE: ./src/expression/transform/min.transform.js
var min_transform_name = 'min';
var min_transform_dependencies = ['typed', 'config', 'numeric', 'smaller'];
var createMinTransform = /* #__PURE__ */Object(factory["a" /* factory */])(min_transform_name, min_transform_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
numeric = _ref.numeric,
smaller = _ref.smaller;
var min = createMin({
typed: typed,
config: config,
numeric: numeric,
smaller: smaller
});
/**
* Attach a transform function to math.min
* Adds a property transform containing the transform function.
*
* This transform changed the last `dim` parameter of function min
* from one-based to zero based
*/
return typed('min', {
'...any': function any(args) {
// change last argument dim from one-based to zero-based
if (args.length === 2 && Object(is["i" /* isCollection */])(args[0])) {
var dim = args[1];
if (Object(is["y" /* isNumber */])(dim)) {
args[1] = dim - 1;
} else if (Object(is["e" /* isBigNumber */])(dim)) {
args[1] = dim.minus(1);
}
}
try {
return min.apply(null, args);
} catch (err) {
throw errorTransform(err);
}
}
});
}, {
isTransformFunction: true
});
// CONCATENATED MODULE: ./src/expression/transform/range.transform.js
var range_transform_name = 'range';
var range_transform_dependencies = ['typed', 'config', '?matrix', '?bignumber', 'smaller', 'smallerEq', 'larger', 'largerEq'];
var createRangeTransform = /* #__PURE__ */Object(factory["a" /* factory */])(range_transform_name, range_transform_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
matrix = _ref.matrix,
bignumber = _ref.bignumber,
smaller = _ref.smaller,
smallerEq = _ref.smallerEq,
larger = _ref.larger,
largerEq = _ref.largerEq;
var range = range_createRange({
typed: typed,
config: config,
matrix: matrix,
bignumber: bignumber,
smaller: smaller,
smallerEq: smallerEq,
larger: larger,
largerEq: largerEq
});
/**
* Attach a transform function to math.range
* Adds a property transform containing the transform function.
*
* This transform creates a range which includes the end value
*/
return typed('range', {
'...any': function any(args) {
var lastIndex = args.length - 1;
var last = args[lastIndex];
if (typeof last !== 'boolean') {
// append a parameter includeEnd=true
args.push(true);
}
return range.apply(null, args);
}
});
}, {
isTransformFunction: true
});
// CONCATENATED MODULE: ./src/expression/transform/row.transform.js
var row_transform_name = 'row';
var row_transform_dependencies = ['typed', 'Index', 'matrix', 'range'];
/**
* Attach a transform function to matrix.column
* Adds a property transform containing the transform function.
*
* This transform changed the last `index` parameter of function column
* from zero-based to one-based
*/
var createRowTransform = /* #__PURE__ */Object(factory["a" /* factory */])(row_transform_name, row_transform_dependencies, function (_ref) {
var typed = _ref.typed,
Index = _ref.Index,
matrix = _ref.matrix,
range = _ref.range;
var row = createRow({
typed: typed,
Index: Index,
matrix: matrix,
range: range
}); // @see: comment of row itself
return typed('row', {
'...any': function any(args) {
// change last argument from zero-based to one-based
var lastIndex = args.length - 1;
var last = args[lastIndex];
if (Object(is["y" /* isNumber */])(last)) {
args[lastIndex] = last - 1;
}
try {
return row.apply(null, args);
} catch (err) {
throw errorTransform(err);
}
}
});
}, {
isTransformFunction: true
});
// CONCATENATED MODULE: ./src/expression/transform/subset.transform.js
var subset_transform_name = 'subset';
var subset_transform_dependencies = ['typed', 'matrix'];
var createSubsetTransform = /* #__PURE__ */Object(factory["a" /* factory */])(subset_transform_name, subset_transform_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix;
var subset = createSubset({
typed: typed,
matrix: matrix
});
/**
* Attach a transform function to math.subset
* Adds a property transform containing the transform function.
*
* This transform creates a range which includes the end value
*/
return typed('subset', {
'...any': function any(args) {
try {
return subset.apply(null, args);
} catch (err) {
throw errorTransform(err);
}
}
});
}, {
isTransformFunction: true
});
// CONCATENATED MODULE: ./src/expression/transform/concat.transform.js
var concat_transform_name = 'concat';
var concat_transform_dependencies = ['typed', 'matrix', 'isInteger'];
var createConcatTransform = /* #__PURE__ */Object(factory["a" /* factory */])(concat_transform_name, concat_transform_dependencies, function (_ref) {
var typed = _ref.typed,
matrix = _ref.matrix,
isInteger = _ref.isInteger;
var concat = createConcat({
typed: typed,
matrix: matrix,
isInteger: isInteger
});
/**
* Attach a transform function to math.range
* Adds a property transform containing the transform function.
*
* This transform changed the last `dim` parameter of function concat
* from one-based to zero based
*/
return typed('concat', {
'...any': function any(args) {
// change last argument from one-based to zero-based
var lastIndex = args.length - 1;
var last = args[lastIndex];
if (Object(is["y" /* isNumber */])(last)) {
args[lastIndex] = last - 1;
} else if (Object(is["e" /* isBigNumber */])(last)) {
args[lastIndex] = last.minus(1);
}
try {
return concat.apply(null, args);
} catch (err) {
throw errorTransform(err);
}
}
});
}, {
isTransformFunction: true
});
// CONCATENATED MODULE: ./src/expression/transform/std.transform.js
var std_transform_name = 'std';
var std_transform_dependencies = ['typed', 'sqrt', 'variance'];
/**
* Attach a transform function to math.std
* Adds a property transform containing the transform function.
*
* This transform changed the `dim` parameter of function std
* from one-based to zero based
*/
var createStdTransform = /* #__PURE__ */Object(factory["a" /* factory */])(std_transform_name, std_transform_dependencies, function (_ref) {
var typed = _ref.typed,
sqrt = _ref.sqrt,
variance = _ref.variance;
var std = createStd({
typed: typed,
sqrt: sqrt,
variance: variance
});
return typed('std', {
'...any': function any(args) {
// change last argument dim from one-based to zero-based
if (args.length >= 2 && Object(is["i" /* isCollection */])(args[0])) {
var dim = args[1];
if (Object(is["y" /* isNumber */])(dim)) {
args[1] = dim - 1;
} else if (Object(is["e" /* isBigNumber */])(dim)) {
args[1] = dim.minus(1);
}
}
try {
return std.apply(null, args);
} catch (err) {
throw errorTransform(err);
}
}
});
}, {
isTransformFunction: true
});
// CONCATENATED MODULE: ./src/expression/transform/sum.transform.js
/**
* Attach a transform function to math.sum
* Adds a property transform containing the transform function.
*
* This transform changed the last `dim` parameter of function mean
* from one-based to zero based
*/
var sum_transform_name = 'sum';
var sum_transform_dependencies = ['typed', 'config', 'add', 'numeric'];
var createSumTransform = /* #__PURE__ */Object(factory["a" /* factory */])(sum_transform_name, sum_transform_dependencies, function (_ref) {
var typed = _ref.typed,
config = _ref.config,
add = _ref.add,
numeric = _ref.numeric;
var sum = createSum({
typed: typed,
config: config,
add: add,
numeric: numeric
});
return typed(sum_transform_name, {
'...any': function any(args) {
// change last argument dim from one-based to zero-based
if (args.length === 2 && Object(is["i" /* isCollection */])(args[0])) {
var dim = args[1];
if (Object(is["y" /* isNumber */])(dim)) {
args[1] = dim - 1;
} else if (Object(is["e" /* isBigNumber */])(dim)) {
args[1] = dim.minus(1);
}
}
try {
return sum.apply(null, args);
} catch (err) {
throw errorTransform(err);
}
}
});
}, {
isTransformFunction: true
});
// CONCATENATED MODULE: ./src/expression/transform/variance.transform.js
var variance_transform_name = 'variance';
var variance_transform_dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'apply', 'isNaN'];
/**
* Attach a transform function to math.var
* Adds a property transform containing the transform function.
*
* This transform changed the `dim` parameter of function var
* from one-based to zero based
*/
var createVarianceTransform = /* #__PURE__ */Object(factory["a" /* factory */])(variance_transform_name, variance_transform_dependencies, function (_ref) {
var typed = _ref.typed,
add = _ref.add,
subtract = _ref.subtract,
multiply = _ref.multiply,
divide = _ref.divide,
apply = _ref.apply,
isNaN = _ref.isNaN;
var variance = createVariance({
typed: typed,
add: add,
subtract: subtract,
multiply: multiply,
divide: divide,
apply: apply,
isNaN: isNaN
});
return typed(variance_transform_name, {
'...any': function any(args) {
// change last argument dim from one-based to zero-based
if (args.length >= 2 && Object(is["i" /* isCollection */])(args[0])) {
var dim = args[1];
if (Object(is["y" /* isNumber */])(dim)) {
args[1] = dim - 1;
} else if (Object(is["e" /* isBigNumber */])(dim)) {
args[1] = dim.minus(1);
}
}
try {
return variance.apply(null, args);
} catch (err) {
throw errorTransform(err);
}
}
});
}, {
isTransformFunction: true
});
// CONCATENATED MODULE: ./src/factoriesAny.js
/***/ }),
/* 21 */
/***/ (function(module, __webpack_exports__, __webpack_require__) {
"use strict";
// ESM COMPAT FLAG
__webpack_require__.r(__webpack_exports__);
// EXPORTS
__webpack_require__.d(__webpack_exports__, "create", function() { return /* binding */ create; });
// EXTERNAL MODULE: ./src/utils/object.js
var utils_object = __webpack_require__(3);
// EXTERNAL MODULE: ./node_modules/tiny-emitter/index.js
var tiny_emitter = __webpack_require__(17);
var tiny_emitter_default = /*#__PURE__*/__webpack_require__.n(tiny_emitter);
// CONCATENATED MODULE: ./src/utils/emitter.js
/**
* Extend given object with emitter functions `on`, `off`, `once`, `emit`
* @param {Object} obj
* @return {Object} obj
*/
function mixin(obj) {
// create event emitter
var emitter = new tiny_emitter_default.a(); // bind methods to obj (we don't want to expose the emitter.e Array...)
obj.on = emitter.on.bind(emitter);
obj.off = emitter.off.bind(emitter);
obj.once = emitter.once.bind(emitter);
obj.emit = emitter.emit.bind(emitter);
return obj;
}
// EXTERNAL MODULE: ./src/utils/is.js
var is = __webpack_require__(1);
// EXTERNAL MODULE: ./src/utils/factory.js
var utils_factory = __webpack_require__(0);
// EXTERNAL MODULE: ./src/utils/array.js
var array = __webpack_require__(2);
// EXTERNAL MODULE: ./src/error/ArgumentsError.js
var ArgumentsError = __webpack_require__(12);
// CONCATENATED MODULE: ./src/core/function/import.js
function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
function _typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
function importFactory(typed, load, math, importedFactories) {
/**
* Import functions from an object or a module.
*
* This function is only available on a mathjs instance created using `create`.
*
* Syntax:
*
* math.import(functions)
* math.import(functions, options)
*
* Where:
*
* - `functions: Object`
* An object with functions or factories to be imported.
* - `options: Object` An object with import options. Available options:
* - `override: boolean`
* If true, existing functions will be overwritten. False by default.
* - `silent: boolean`
* If true, the function will not throw errors on duplicates or invalid
* types. False by default.
* - `wrap: boolean`
* If true, the functions will be wrapped in a wrapper function
* which converts data types like Matrix to primitive data types like Array.
* The wrapper is needed when extending math.js with libraries which do not
* support these data type. False by default.
*
* Examples:
*
* import { create, all } from 'mathjs'
* import * as numbers from 'numbers'
*
* // create a mathjs instance
* const math = create(all)
*
* // define new functions and variables
* math.import({
* myvalue: 42,
* hello: function (name) {
* return 'hello, ' + name + '!'
* }
* })
*
* // use the imported function and variable
* math.myvalue * 2 // 84
* math.hello('user') // 'hello, user!'
*
* // import the npm module 'numbers'
* // (must be installed first with `npm install numbers`)
* math.import(numbers, {wrap: true})
*
* math.fibonacci(7) // returns 13
*
* @param {Object | Array} functions Object with functions to be imported.
* @param {Object} [options] Import options.
*/
function mathImport(functions, options) {
var num = arguments.length;
if (num !== 1 && num !== 2) {
throw new ArgumentsError["a" /* ArgumentsError */]('import', num, 1, 2);
}
if (!options) {
options = {};
}
function flattenImports(flatValues, value, name) {
if (Array.isArray(value)) {
value.forEach(function (item) {
return flattenImports(flatValues, item);
});
} else if (_typeof(value) === 'object') {
for (var _name in value) {
if (Object(utils_object["f" /* hasOwnProperty */])(value, _name)) {
flattenImports(flatValues, value[_name], _name);
}
}
} else if (Object(utils_factory["b" /* isFactory */])(value) || name !== undefined) {
var flatName = Object(utils_factory["b" /* isFactory */])(value) ? isTransformFunctionFactory(value) ? value.fn + '.transform' : // TODO: this is ugly
value.fn : name; // we allow importing the same function twice if it points to the same implementation
if (Object(utils_object["f" /* hasOwnProperty */])(flatValues, flatName) && flatValues[flatName] !== value && !options.silent) {
throw new Error('Cannot import "' + flatName + '" twice');
}
flatValues[flatName] = value;
} else {
if (!options.silent) {
throw new TypeError('Factory, Object, or Array expected');
}
}
}
var flatValues = {};
flattenImports(flatValues, functions);
for (var name in flatValues) {
if (Object(utils_object["f" /* hasOwnProperty */])(flatValues, name)) {
// console.log('import', name)
var value = flatValues[name];
if (Object(utils_factory["b" /* isFactory */])(value)) {
// we ignore name here and enforce the name of the factory
// maybe at some point we do want to allow overriding it
// in that case we can implement an option overrideFactoryNames: true
_importFactory(value, options);
} else if (isSupportedType(value)) {
_import(name, value, options);
} else {
if (!options.silent) {
throw new TypeError('Factory, Object, or Array expected');
}
}
}
}
}
/**
* Add a property to the math namespace
* @param {string} name
* @param {*} value
* @param {Object} options See import for a description of the options
* @private
*/
function _import(name, value, options) {
// TODO: refactor this function, it's to complicated and contains duplicate code
if (options.wrap && typeof value === 'function') {
// create a wrapper around the function
value = _wrap(value);
} // turn a plain function with a typed-function signature into a typed-function
if (hasTypedFunctionSignature(value)) {
value = typed(name, _defineProperty({}, value.signature, value));
}
if (isTypedFunction(math[name]) && isTypedFunction(value)) {
if (options.override) {
// give the typed function the right name
value = typed(name, value.signatures);
} else {
// merge the existing and typed function
value = typed(math[name], value);
}
math[name] = value;
delete importedFactories[name];
_importTransform(name, value);
math.emit('import', name, function resolver() {
return value;
});
return;
}
if (math[name] === undefined || options.override) {
math[name] = value;
delete importedFactories[name];
_importTransform(name, value);
math.emit('import', name, function resolver() {
return value;
});
return;
}
if (!options.silent) {
throw new Error('Cannot import "' + name + '": already exists');
}
}
function _importTransform(name, value) {
if (value && typeof value.transform === 'function') {
math.expression.transform[name] = value.transform;
if (allowedInExpressions(name)) {
math.expression.mathWithTransform[name] = value.transform;
}
} else {
// remove existing transform
delete math.expression.transform[name];
if (allowedInExpressions(name)) {
math.expression.mathWithTransform[name] = value;
}
}
}
function _deleteTransform(name) {
delete math.expression.transform[name];
if (allowedInExpressions(name)) {
math.expression.mathWithTransform[name] = math[name];
} else {
delete math.expression.mathWithTransform[name];
}
}
/**
* Create a wrapper a round an function which converts the arguments
* to their primitive values (like convert a Matrix to Array)
* @param {Function} fn
* @return {Function} Returns the wrapped function
* @private
*/
function _wrap(fn) {
var wrapper = function wrapper() {
var args = [];
for (var i = 0, len = arguments.length; i < len; i++) {
var arg = arguments[i];
args[i] = arg && arg.valueOf();
}
return fn.apply(math, args);
};
if (fn.transform) {
wrapper.transform = fn.transform;
}
return wrapper;
}
/**
* Import an instance of a factory into math.js
* @param {function(scope: object)} factory
* @param {Object} options See import for a description of the options
* @param {string} [name=factory.name] Optional custom name
* @private
*/
function _importFactory(factory, options) {
var name = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : factory.fn;
if (Object(array["b" /* contains */])(name, '.')) {
throw new Error('Factory name should not contain a nested path. ' + 'Name: ' + JSON.stringify(name));
}
var namespace = isTransformFunctionFactory(factory) ? math.expression.transform : math;
var existingTransform = (name in math.expression.transform);
var existing = Object(utils_object["f" /* hasOwnProperty */])(namespace, name) ? namespace[name] : undefined;
var resolver = function resolver() {
// collect all dependencies, handle finding both functions and classes and other special cases
var dependencies = {};
factory.dependencies.map(utils_factory["c" /* stripOptionalNotation */]).forEach(function (dependency) {
if (Object(array["b" /* contains */])(dependency, '.')) {
throw new Error('Factory dependency should not contain a nested path. ' + 'Name: ' + JSON.stringify(dependency));
}
if (dependency === 'math') {
dependencies.math = math;
} else if (dependency === 'mathWithTransform') {
dependencies.mathWithTransform = math.expression.mathWithTransform;
} else if (dependency === 'classes') {
// special case for json reviver
dependencies.classes = math;
} else {
dependencies[dependency] = math[dependency];
}
});
var instance = /* #__PURE__ */factory(dependencies);
if (instance && typeof instance.transform === 'function') {
throw new Error('Transforms cannot be attached to factory functions. ' + 'Please create a separate function for it with exports.path="expression.transform"');
}
if (existing === undefined || options.override) {
return instance;
}
if (isTypedFunction(existing) && isTypedFunction(instance)) {
// merge the existing and new typed function
return typed(existing, instance);
}
if (options.silent) {
// keep existing, ignore imported function
return existing;
} else {
throw new Error('Cannot import "' + name + '": already exists');
}
}; // TODO: add unit test with non-lazy factory
if (!factory.meta || factory.meta.lazy !== false) {
Object(utils_object["h" /* lazy */])(namespace, name, resolver); // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)
if (existing && existingTransform) {
_deleteTransform(name);
} else {
if (isTransformFunctionFactory(factory) || factoryAllowedInExpressions(factory)) {
Object(utils_object["h" /* lazy */])(math.expression.mathWithTransform, name, function () {
return namespace[name];
});
}
}
} else {
namespace[name] = resolver(); // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)
if (existing && existingTransform) {
_deleteTransform(name);
} else {
if (isTransformFunctionFactory(factory) || factoryAllowedInExpressions(factory)) {
Object(utils_object["h" /* lazy */])(math.expression.mathWithTransform, name, function () {
return namespace[name];
});
}
}
} // TODO: improve factories, store a list with imports instead which can be re-played
importedFactories[name] = factory;
math.emit('import', name, resolver);
}
/**
* Check whether given object is a type which can be imported
* @param {Function | number | string | boolean | null | Unit | Complex} object
* @return {boolean}
* @private
*/
function isSupportedType(object) {
return typeof object === 'function' || typeof object === 'number' || typeof object === 'string' || typeof object === 'boolean' || object === null || Object(is["L" /* isUnit */])(object) || Object(is["j" /* isComplex */])(object) || Object(is["e" /* isBigNumber */])(object) || Object(is["o" /* isFraction */])(object) || Object(is["v" /* isMatrix */])(object) || Array.isArray(object);
}
/**
* Test whether a given thing is a typed-function
* @param {*} fn
* @return {boolean} Returns true when `fn` is a typed-function
*/
function isTypedFunction(fn) {
return typeof fn === 'function' && _typeof(fn.signatures) === 'object';
}
function hasTypedFunctionSignature(fn) {
return typeof fn === 'function' && typeof fn.signature === 'string';
}
function allowedInExpressions(name) {
return !Object(utils_object["f" /* hasOwnProperty */])(unsafe, name);
}
function factoryAllowedInExpressions(factory) {
return factory.fn.indexOf('.') === -1 && // FIXME: make checking on path redundant, check on meta data instead
!Object(utils_object["f" /* hasOwnProperty */])(unsafe, factory.fn) && (!factory.meta || !factory.meta.isClass);
}
function isTransformFunctionFactory(factory) {
return factory !== undefined && factory.meta !== undefined && factory.meta.isTransformFunction === true || false;
} // namespaces and functions not available in the parser for safety reasons
var unsafe = {
expression: true,
type: true,
docs: true,
error: true,
json: true,
chain: true // chain method not supported. Note that there is a unit chain too.
};
return mathImport;
}
// CONCATENATED MODULE: ./src/core/config.js
var DEFAULT_CONFIG = {
// minimum relative difference between two compared values,
// used by all comparison functions
epsilon: 1e-12,
// type of default matrix output. Choose 'matrix' (default) or 'array'
matrix: 'Matrix',
// type of default number output. Choose 'number' (default) 'BigNumber', or 'Fraction
number: 'number',
// number of significant digits in BigNumbers
precision: 64,
// predictable output type of functions. When true, output type depends only
// on the input types. When false (default), output type can vary depending
// on input values. For example `math.sqrt(-4)` returns `complex('2i')` when
// predictable is false, and returns `NaN` when true.
predictable: false,
// random seed for seeded pseudo random number generation
// null = randomly seed
randomSeed: null
};
// CONCATENATED MODULE: ./src/core/function/config.js
var MATRIX_OPTIONS = ['Matrix', 'Array']; // valid values for option matrix
var NUMBER_OPTIONS = ['number', 'BigNumber', 'Fraction']; // valid values for option number
function configFactory(config, emit) {
/**
* Set configuration options for math.js, and get current options.
* Will emit a 'config' event, with arguments (curr, prev, changes).
*
* This function is only available on a mathjs instance created using `create`.
*
* Syntax:
*
* math.config(config: Object): Object
*
* Examples:
*
*
* import { create, all } from 'mathjs'
*
* // create a mathjs instance
* const math = create(all)
*
* math.config().number // outputs 'number'
* math.evaluate('0.4') // outputs number 0.4
* math.config({number: 'Fraction'})
* math.evaluate('0.4') // outputs Fraction 2/5
*
* @param {Object} [options] Available options:
* {number} epsilon
* Minimum relative difference between two
* compared values, used by all comparison functions.
* {string} matrix
* A string 'Matrix' (default) or 'Array'.
* {string} number
* A string 'number' (default), 'BigNumber', or 'Fraction'
* {number} precision
* The number of significant digits for BigNumbers.
* Not applicable for Numbers.
* {string} parenthesis
* How to display parentheses in LaTeX and string
* output.
* {string} randomSeed
* Random seed for seeded pseudo random number generator.
* Set to null to randomly seed.
* @return {Object} Returns the current configuration
*/
function _config(options) {
if (options) {
var prev = Object(utils_object["i" /* mapObject */])(config, utils_object["a" /* clone */]); // validate some of the options
validateOption(options, 'matrix', MATRIX_OPTIONS);
validateOption(options, 'number', NUMBER_OPTIONS); // merge options
Object(utils_object["b" /* deepExtend */])(config, options);
var curr = Object(utils_object["i" /* mapObject */])(config, utils_object["a" /* clone */]);
var changes = Object(utils_object["i" /* mapObject */])(options, utils_object["a" /* clone */]); // emit 'config' event
emit('config', curr, prev, changes);
return curr;
} else {
return Object(utils_object["i" /* mapObject */])(config, utils_object["a" /* clone */]);
}
} // attach the valid options to the function so they can be extended
_config.MATRIX_OPTIONS = MATRIX_OPTIONS;
_config.NUMBER_OPTIONS = NUMBER_OPTIONS; // attach the config properties as readonly properties to the config function
Object.keys(DEFAULT_CONFIG).forEach(function (key) {
Object.defineProperty(_config, key, {
get: function get() {
return config[key];
},
enumerable: true,
configurable: true
});
});
return _config;
}
/**
* Test whether an Array contains a specific item.
* @param {Array.<string>} array
* @param {string} item
* @return {boolean}
*/
function contains(array, item) {
return array.indexOf(item) !== -1;
}
/**
* Validate an option
* @param {Object} options Object with options
* @param {string} name Name of the option to validate
* @param {Array.<string>} values Array with valid values for this option
*/
function validateOption(options, name, values) {
if (options[name] !== undefined && !contains(values, options[name])) {
// unknown value
console.warn('Warning: Unknown value "' + options[name] + '" for configuration option "' + name + '". ' + 'Available options: ' + values.map(function (value) {
return JSON.stringify(value);
}).join(', ') + '.');
}
}
// EXTERNAL MODULE: ./src/error/DimensionError.js
var DimensionError = __webpack_require__(6);
// EXTERNAL MODULE: ./src/error/IndexError.js
var IndexError = __webpack_require__(9);
// CONCATENATED MODULE: ./src/core/create.js
function _extends() { _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }
/**
* Create a mathjs instance from given factory functions and optionally config
*
* Usage:
*
* const mathjs1 = create({ createAdd, createMultiply, ...})
* const config = { number: 'BigNumber' }
* const mathjs2 = create(all, config)
*
* @param {Object} [factories] An object with factory functions
* The object can contain nested objects,
* all nested objects will be flattened.
* @param {Object} [config] Available options:
* {number} epsilon
* Minimum relative difference between two
* compared values, used by all comparison functions.
* {string} matrix
* A string 'Matrix' (default) or 'Array'.
* {string} number
* A string 'number' (default), 'BigNumber', or 'Fraction'
* {number} precision
* The number of significant digits for BigNumbers.
* Not applicable for Numbers.
* {boolean} predictable
* Predictable output type of functions. When true,
* output type depends only on the input types. When
* false (default), output type can vary depending
* on input values. For example `math.sqrt(-4)`
* returns `complex('2i')` when predictable is false, and
* returns `NaN` when true.
* {string} randomSeed
* Random seed for seeded pseudo random number generator.
* Set to null to randomly seed.
* @returns {Object} Returns a bare-bone math.js instance containing
* functions:
* - `import` to add new functions
* - `config` to change configuration
* - `on`, `off`, `once`, `emit` for events
*/
function create(factories, config) {
var configInternal = _extends({}, DEFAULT_CONFIG, config); // simple test for ES5 support
if (typeof Object.create !== 'function') {
throw new Error('ES5 not supported by this JavaScript engine. ' + 'Please load the es5-shim and es5-sham library for compatibility.');
} // create the mathjs instance
var math = mixin({
// only here for backward compatibility for legacy factory functions
isNumber: is["y" /* isNumber */],
isComplex: is["j" /* isComplex */],
isBigNumber: is["e" /* isBigNumber */],
isFraction: is["o" /* isFraction */],
isUnit: is["L" /* isUnit */],
isString: is["I" /* isString */],
isArray: is["b" /* isArray */],
isMatrix: is["v" /* isMatrix */],
isCollection: is["i" /* isCollection */],
isDenseMatrix: is["n" /* isDenseMatrix */],
isSparseMatrix: is["H" /* isSparseMatrix */],
isRange: is["D" /* isRange */],
isIndex: is["t" /* isIndex */],
isBoolean: is["g" /* isBoolean */],
isResultSet: is["G" /* isResultSet */],
isHelp: is["s" /* isHelp */],
isFunction: is["p" /* isFunction */],
isDate: is["m" /* isDate */],
isRegExp: is["F" /* isRegExp */],
isObject: is["z" /* isObject */],
isNull: is["x" /* isNull */],
isUndefined: is["K" /* isUndefined */],
isAccessorNode: is["a" /* isAccessorNode */],
isArrayNode: is["c" /* isArrayNode */],
isAssignmentNode: is["d" /* isAssignmentNode */],
isBlockNode: is["f" /* isBlockNode */],
isConditionalNode: is["k" /* isConditionalNode */],
isConstantNode: is["l" /* isConstantNode */],
isFunctionAssignmentNode: is["q" /* isFunctionAssignmentNode */],
isFunctionNode: is["r" /* isFunctionNode */],
isIndexNode: is["u" /* isIndexNode */],
isNode: is["w" /* isNode */],
isObjectNode: is["A" /* isObjectNode */],
isOperatorNode: is["B" /* isOperatorNode */],
isParenthesisNode: is["C" /* isParenthesisNode */],
isRangeNode: is["E" /* isRangeNode */],
isSymbolNode: is["J" /* isSymbolNode */],
isChain: is["h" /* isChain */]
}); // load config function and apply provided config
math.config = configFactory(configInternal, math.emit);
math.expression = {
transform: {},
mathWithTransform: {
config: math.config
}
}; // cached factories and instances used by function load
var legacyFactories = [];
var legacyInstances = [];
/**
* Load a function or data type from a factory.
* If the function or data type already exists, the existing instance is
* returned.
* @param {Function} factory
* @returns {*}
*/
function load(factory) {
if (Object(utils_factory["b" /* isFactory */])(factory)) {
return factory(math);
}
var firstProperty = factory[Object.keys(factory)[0]];
if (Object(utils_factory["b" /* isFactory */])(firstProperty)) {
return firstProperty(math);
}
if (!Object(utils_object["g" /* isLegacyFactory */])(factory)) {
console.warn('Factory object with properties `type`, `name`, and `factory` expected', factory);
throw new Error('Factory object with properties `type`, `name`, and `factory` expected');
}
var index = legacyFactories.indexOf(factory);
var instance;
if (index === -1) {
// doesn't yet exist
if (factory.math === true) {
// pass with math namespace
instance = factory.factory(math.type, configInternal, load, math.typed, math);
} else {
instance = factory.factory(math.type, configInternal, load, math.typed);
} // append to the cache
legacyFactories.push(factory);
legacyInstances.push(instance);
} else {
// already existing function, return the cached instance
instance = legacyInstances[index];
}
return instance;
}
var importedFactories = {}; // load the import function
function lazyTyped() {
for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
args[_key] = arguments[_key];
}
return math.typed.apply(math.typed, args);
}
var internalImport = importFactory(lazyTyped, load, math, importedFactories);
math["import"] = internalImport; // listen for changes in config, import all functions again when changed
// TODO: move this listener into the import function?
math.on('config', function () {
Object(utils_object["k" /* values */])(importedFactories).forEach(function (factory) {
if (factory && factory.meta && factory.meta.recreateOnConfigChange) {
// FIXME: only re-create when the current instance is the same as was initially created
// FIXME: delete the functions/constants before importing them again?
internalImport(factory, {
override: true
});
}
});
}); // the create function exposed on the mathjs instance is bound to
// the factory functions passed before
math.create = create.bind(null, factories); // export factory function
math.factory = utils_factory["a" /* factory */]; // import the factory functions like createAdd as an array instead of object,
// else they will get a different naming (`createAdd` instead of `add`).
math["import"](Object(utils_object["k" /* values */])(Object(utils_object["c" /* deepFlatten */])(factories)));
math.ArgumentsError = ArgumentsError["a" /* ArgumentsError */];
math.DimensionError = DimensionError["a" /* DimensionError */];
math.IndexError = IndexError["a" /* IndexError */];
return math;
}
/***/ })
/******/ ]);
});
Reference in New Issue View Git Blame Kopiuj bezpośredni odnośnik