mathjs 11.2.1 → 11.3.1

package/lib/cjs/utils/function.js

@@ -1,18 +1,14 @@
 "use strict";
 
 var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.maxArgumentCount = maxArgumentCount;
 exports.memoize = memoize;
 exports.memoizeCompare = memoizeCompare;
-
 var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
-
 var _lruQueue = require("./lruQueue.js");
-
 // function utils
 
 /**
@@ -32,9 +28,8 @@ var _lruQueue = require("./lruQueue.js");
  */
 function memoize(fn) {
   var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},
-      hasher = _ref.hasher,
-      limit = _ref.limit;
-
+    hasher = _ref.hasher,
+    limit = _ref.limit;
   limit = limit == null ? Number.POSITIVE_INFINITY : limit;
   hasher = hasher == null ? JSON.stringify : hasher;
   return function memoize() {
@@ -44,26 +39,22 @@ function memoize(fn) {
         lru: (0, _lruQueue.lruQueue)(limit || Number.POSITIVE_INFINITY)
       };
     }
-
     var args = [];
-
     for (var i = 0; i < arguments.length; i++) {
       args[i] = arguments[i];
     }
-
     var hash = hasher(args);
-
     if (memoize.cache.values.has(hash)) {
       memoize.cache.lru.hit(hash);
       return memoize.cache.values.get(hash);
     }
-
     var newVal = fn.apply(fn, args);
     memoize.cache.values.set(hash, newVal);
     memoize.cache.values["delete"](memoize.cache.lru.hit(hash));
     return newVal;
   };
 }
+
 /**
  * Memoize a given function by caching all results and the arguments,
  * and comparing against the arguments of previous results before
@@ -78,25 +69,19 @@ function memoize(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,
@@ -104,18 +89,16 @@ function memoizeCompare(fn, isEqual) {
     });
     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;

package/lib/cjs/utils/is.js

@@ -1,7 +1,6 @@
 "use strict";
 
 var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
@@ -46,9 +45,7 @@ exports.isUndefined = isUndefined;
 exports.isUnit = isUnit;
 exports.rule2Node = rule2Node;
 exports.typeOf = typeOf;
-
 var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
-
 // type checks for all known types
 //
 // note that:
@@ -62,134 +59,106 @@ var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
 // - 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) {
   if (!x || (0, _typeof2["default"])(x) !== 'object' || typeof x.constructor !== 'function') {
     return false;
   }
-
   if (x.isBigNumber === true && (0, _typeof2["default"])(x.constructor.prototype) === 'object' && x.constructor.prototype.isBigNumber === true) {
     return true;
   }
-
   if (typeof x.constructor.isDecimal === 'function' && x.constructor.isDecimal(x) === true) {
     return true;
   }
-
   return false;
 }
-
 function isComplex(x) {
   return x && (0, _typeof2["default"])(x) === 'object' && Object.getPrototypeOf(x).isComplex === true || false;
 }
-
 function isFraction(x) {
   return x && (0, _typeof2["default"])(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;
 exports.isArray = 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 && (0, _typeof2["default"])(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;
 }
+
 /* Very specialized: returns true for those nodes which in the numerator of
    a fraction means that the division in that fraction has precedence over implicit
    multiplication, e.g. -2/3 x parses as (-2/3) x and 3/4 x parses as (3/4) x but
@@ -200,63 +169,47 @@ function isConstantNode(x) {
    Its name does not start with 'is' to prevent utils/snapshot.js from thinking
    it should be exported.
 */
-
-
 function rule2Node(node) {
   return isConstantNode(node) || isOperatorNode(node) && node.args.length === 1 && isConstantNode(node.args[0]) && '-+~'.includes(node.op);
 }
-
 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 isRelationalNode(x) {
   return x && x.isRelationalNode === 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 = (0, _typeof2["default"])(x);
-
   if (t === 'object') {
     if (x === null) return 'null';
     if (isBigNumber(x)) return 'BigNumber'; // Special: weird mashup with Decimal
-
     if (x.constructor && x.constructor.name) return x.constructor.name;
     return 'Object'; // just in case
   }

package/lib/cjs/utils/latex.js

@@ -1,7 +1,6 @@
 "use strict";
 
 var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
@@ -9,12 +8,10 @@ exports.defaultTemplate = void 0;
 exports.escapeLatex = escapeLatex;
 exports.latexSymbols = exports.latexOperators = exports.latexFunctions = void 0;
 exports.toSymbol = toSymbol;
-
 var _escapeLatex = _interopRequireDefault(require("escape-latex"));
-
 var _object = require("./object.js");
-
 /* eslint no-template-curly-in-string: "off" */
+
 var latexSymbols = {
   // GREEK LETTERS
   Alpha: 'A',
@@ -189,8 +186,8 @@ var latexFunctions = {
   norm: {
     1: '\\left\\|${args[0]}\\right\\|',
     2: undefined // use default template
-
   },
+
   nthRoot: {
     2: '\\sqrt[${args[1]}]{${args[0]}}'
   },
@@ -203,8 +200,8 @@ var latexFunctions = {
   round: {
     1: '\\left\\lfloor${args[0]}\\right\\rceil',
     2: undefined // use default template
-
   },
+
   sign: {
     1: '\\mathrm{${name}}\\left(${args[0]}\\right)'
   },
@@ -479,29 +476,24 @@ exports.defaultTemplate = defaultTemplate;
 var latexUnits = {
   deg: '^\\circ'
 };
-
 function escapeLatex(string) {
   return (0, _escapeLatex["default"])(string, {
     preserveFormatting: true
   });
-} // @param {string} name
-// @param {boolean} isUnit
-
+}
 
+// @param {string} name
+// @param {boolean} isUnit
 function toSymbol(name, isUnit) {
   isUnit = typeof isUnit === 'undefined' ? false : isUnit;
-
   if (isUnit) {
     if ((0, _object.hasOwnProperty)(latexUnits, name)) {
       return latexUnits[name];
     }
-
     return '\\mathrm{' + escapeLatex(name) + '}';
   }
-
   if ((0, _object.hasOwnProperty)(latexSymbols, name)) {
     return latexSymbols[name];
   }
-
   return escapeLatex(name);
 }

package/lib/cjs/utils/log.js

@@ -4,7 +4,6 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.warnOnce = void 0;
-
 /**
  * Log a console.warn message only once
  */
@@ -14,17 +13,12 @@ var warnOnce = function () {
     for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
       args[_key] = arguments[_key];
     }
-
     var message = args.join(', ');
-
     if (!messages[message]) {
       var _console;
-
       messages[message] = true;
-
       (_console = console).warn.apply(_console, ['Warning:'].concat(args));
     }
   };
 }();
-
 exports.warnOnce = warnOnce;

package/lib/cjs/utils/lruQueue.js

@@ -4,7 +4,6 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.lruQueue = lruQueue;
-
 // (c) 2018, Mariusz Nowak
 // SPDX-License-Identifier: ISC
 // Derived from https://github.com/medikoo/lru-queue
@@ -14,7 +13,6 @@ function lruQueue(limit) {
   var queue = Object.create(null);
   var map = Object.create(null);
   var index = 0;
-
   var del = function del(id) {
     var oldIndex = map[id];
     if (!oldIndex) return;
@@ -22,18 +20,15 @@ function lruQueue(limit) {
     delete map[id];
     --size;
     if (base !== oldIndex) return;
-
     if (!size) {
       index = 0;
       base = 1;
       return;
     }
-
     while (!hasOwnProperty.call(queue, ++base)) {
       continue;
     }
   };
-
   limit = Math.abs(limit);
   return {
     hit: function hit(id) {
@@ -41,7 +36,6 @@ function lruQueue(limit) {
       var nuIndex = ++index;
       queue[nuIndex] = id;
       map[id] = nuIndex;
-
       if (!oldIndex) {
         ++size;
         if (size <= limit) return undefined;
@@ -49,14 +43,11 @@ function lruQueue(limit) {
         del(id);
         return id;
       }
-
       delete queue[oldIndex];
       if (base !== oldIndex) return undefined;
-
       while (!hasOwnProperty.call(queue, ++base)) {
         continue;
       }
-
       return undefined;
     },
     "delete": del,

package/lib/cjs/utils/map.js

@@ -1,7 +1,6 @@
 "use strict";
 
 var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
@@ -11,21 +10,13 @@ exports.createEmptyMap = createEmptyMap;
 exports.createMap = createMap;
 exports.isMap = isMap;
 exports.toObject = toObject;
-
 var _classCallCheck2 = _interopRequireDefault(require("@babel/runtime/helpers/classCallCheck"));
-
 var _createClass2 = _interopRequireDefault(require("@babel/runtime/helpers/createClass"));
-
 var _customs = require("./customs.js");
-
 var _is = require("./is.js");
-
 function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
-
 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 _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; }
-
 /**
  * A map facade on a bare object.
  *
@@ -33,13 +24,11 @@ function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len
  * forwarding on to the SafeProperty functions. Over time, the codebase
  * will stop using this method, as all objects will be Maps, rather than
  * more security prone objects.
- */
-var ObjectWrappingMap = /*#__PURE__*/function () {
+ */var ObjectWrappingMap = /*#__PURE__*/function () {
   function ObjectWrappingMap(object) {
     (0, _classCallCheck2["default"])(this, ObjectWrappingMap);
     this.wrappedObject = object;
   }
-
   (0, _createClass2["default"])(ObjectWrappingMap, [{
     key: "keys",
     value: function keys() {
@@ -63,60 +52,48 @@ var ObjectWrappingMap = /*#__PURE__*/function () {
     }
   }]);
   return ObjectWrappingMap;
-}();
-/**
- * Creates an empty map, or whatever your platform's polyfill is.
- *
- * @returns an empty Map or Map like object.
- */
-
-
+}(); /**
+      * Creates an empty map, or whatever your platform's polyfill is.
+      *
+      * @returns an empty Map or Map like object.
+      */
 exports.ObjectWrappingMap = ObjectWrappingMap;
-
 function createEmptyMap() {
   return new Map();
 }
+
 /**
  * Creates a Map from the given object.
  *
  * @param { Map | { [key: string]: unknown } | undefined } mapOrObject
  * @returns
  */
-
-
 function createMap(mapOrObject) {
   if (!mapOrObject) {
     return createEmptyMap();
   }
-
   if (isMap(mapOrObject)) {
     return mapOrObject;
   }
-
   if ((0, _is.isObject)(mapOrObject)) {
     return new ObjectWrappingMap(mapOrObject);
   }
-
   throw new Error('createMap can create maps from objects or Maps');
 }
+
 /**
  * Unwraps a map into an object.
  *
  * @param {Map} map
  * @returns { [key: string]: unknown }
  */
-
-
 function toObject(map) {
   if (map instanceof ObjectWrappingMap) {
     return map.wrappedObject;
   }
-
   var object = {};
-
   var _iterator = _createForOfIteratorHelper(map.keys()),
-      _step;
-
+    _step;
   try {
     for (_iterator.s(); !(_step = _iterator.n()).done;) {
       var key = _step.value;
@@ -128,9 +105,9 @@ function toObject(map) {
   } finally {
     _iterator.f();
   }
-
   return object;
 }
+
 /**
  * Returns `true` if the passed object appears to be a Map (i.e. duck typing).
  *
@@ -139,17 +116,15 @@ function toObject(map) {
  * @param {Map | object} object
  * @returns
  */
-
-
 function isMap(object) {
   // We can use the fast instanceof, or a slower duck typing check.
   // The duck typing method needs to cover enough methods to not be confused with DenseMatrix.
   if (!object) {
     return false;
   }
-
   return object instanceof Map || object instanceof ObjectWrappingMap || typeof object.set === 'function' && typeof object.get === 'function' && typeof object.keys === 'function' && typeof object.has === 'function';
 }
+
 /**
  * Copies the contents of key-value pairs from each `objects` in to `map`.
  *
@@ -157,24 +132,18 @@ function isMap(object) {
  *
  * This is the `Map` analog to `Object.assign`.
  */
-
-
 function assign(map) {
   for (var _len = arguments.length, objects = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
     objects[_key - 1] = arguments[_key];
   }
-
   for (var _i = 0, _objects = objects; _i < _objects.length; _i++) {
     var args = _objects[_i];
-
     if (!args) {
       continue;
     }
-
     if (isMap(args)) {
       var _iterator2 = _createForOfIteratorHelper(args.keys()),
-          _step2;
-
+        _step2;
       try {
         for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
           var key = _step2.value;
@@ -192,6 +161,5 @@ function assign(map) {
       }
     }
   }
-
   return map;
 }

package/lib/cjs/utils/noop.js

@@ -8,23 +8,18 @@ exports.noFraction = noFraction;
 exports.noIndex = noIndex;
 exports.noMatrix = noMatrix;
 exports.noSubset = noSubset;
-
 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');
 }