mathjs 14.3.1 → 14.5.0

package/lib/esm/expression/embeddedDocs/construction/index.js

@@ -4,5 +4,5 @@ export var indexDocs = {
   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: ['A = [1, 2, 3; 4, 5, 6]', 'A[1, :]', 'A[1, 2] = 50', 'A[1:2, 1:2] = 1', 'B = [1, 2, 3]', 'B[B>1 and B<3]'],
-  seealso: ['bignumber', 'boolean', 'complex', 'matrix,', 'number', 'range', 'string', 'unit']
+  seealso: ['bignumber', 'boolean', 'complex', 'matrix', 'number', 'range', 'string', 'unit']
 };

package/lib/esm/expression/embeddedDocs/embeddedDocs.js

@@ -104,6 +104,9 @@ import { conjDocs } from './function/complex/conj.js';
 import { imDocs } from './function/complex/im.js';
 import { reDocs } from './function/complex/re.js';
 import { evaluateDocs } from './function/expression/evaluate.js';
+import { parserDocs } from './function/expression/parser.js';
+import { parseDocs } from './function/expression/parse.js';
+import { compileDocs } from './function/expression/compile.js';
 import { helpDocs } from './function/expression/help.js';
 import { distanceDocs } from './function/geometry/distance.js';
 import { intersectDocs } from './function/geometry/intersect.js';
@@ -564,6 +567,9 @@ export var embeddedDocs = {
   // functions - expression
   evaluate: evaluateDocs,
   help: helpDocs,
+  parse: parseDocs,
+  parser: parserDocs,
+  compile: compileDocs,
   // functions - geometry
   distance: distanceDocs,
   intersect: intersectDocs,

package/lib/esm/expression/embeddedDocs/function/expression/compile.js

@@ -0,0 +1,8 @@
+export var compileDocs = {
+  name: 'compile',
+  category: 'Expression',
+  syntax: ['compile(expr) ', 'compile([expr1, expr2, expr3, ...])'],
+  description: 'Parse and compile an expression. Returns a an object with a function evaluate([scope]) to evaluate the compiled expression.',
+  examples: ['code1 = compile("sqrt(3^2 + 4^2)")', 'code1.evaluate() ', 'code2 = compile("a * b")', 'code2.evaluate({a: 3, b: 4})'],
+  seealso: ['parser', 'parse', 'evaluate']
+};

package/lib/esm/expression/embeddedDocs/function/expression/evaluate.js

@@ -4,5 +4,5 @@ export var evaluateDocs = {
   syntax: ['evaluate(expression)', 'evaluate(expression, scope)', 'evaluate([expr1, expr2, expr3, ...])', 'evaluate([expr1, expr2, expr3, ...], scope)'],
   description: 'Evaluate an expression or an array with expressions.',
   examples: ['evaluate("2 + 3")', 'evaluate("sqrt(16)")', 'evaluate("2 inch to cm")', 'evaluate("sin(x * pi)", { "x": 1/2 })', 'evaluate(["width=2", "height=4","width*height"])'],
-  seealso: []
+  seealso: ['parser', 'parse', 'compile']
 };

package/lib/esm/expression/embeddedDocs/function/expression/parse.js

@@ -0,0 +1,8 @@
+export var parseDocs = {
+  name: 'parse',
+  category: 'Expression',
+  syntax: ['parse(expr)', 'parse(expr, options)', 'parse([expr1, expr2, expr3, ...])', 'parse([expr1, expr2, expr3, ...], options)'],
+  description: 'Parse an expression. Returns a node tree, which can be evaluated by invoking node.evaluate() or transformed into a functional object via node.compile().',
+  examples: ['node1 = parse("sqrt(3^2 + 4^2)")', 'node1.evaluate()', 'code1 = node1.compile()', 'code1.evaluate()', 'scope = {a: 3, b: 4}', 'node2 = parse("a * b")', 'node2.evaluate(scope)', 'code2 = node2.compile()', 'code2.evaluate(scope)'],
+  seealso: ['parser', 'evaluate', 'compile']
+};

package/lib/esm/expression/embeddedDocs/function/expression/parser.js

@@ -0,0 +1,8 @@
+export var parserDocs = {
+  name: 'parser',
+  category: 'Expression',
+  syntax: ['parser()'],
+  description: 'Create a parser object that keeps a context of variables and their values, allowing the evaluation of expressions in that context.',
+  examples: ['myParser = parser()', 'myParser.evaluate("sqrt(3^2 + 4^2)")', 'myParser.set("x", 3)', 'myParser.evaluate("y = x + 3")', 'myParser.evaluate(["y = x + 3", "y = y + 1"])', 'myParser.get("y")'],
+  seealso: ['evaluate', 'parse', 'compile']
+};

package/lib/esm/expression/embeddedDocs/function/statistics/sum.js

@@ -4,5 +4,5 @@ export var sumDocs = {
   syntax: ['sum(a, b, c, ...)', 'sum(A)', 'sum(A, dimension)'],
   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']
+  seealso: ['max', 'mean', 'median', 'min', 'prod', 'std', 'variance']
 };

package/lib/esm/expression/function/parser.js

@@ -7,7 +7,7 @@ export var createParser = /* #__PURE__ */factory(name, dependencies, _ref => {
     Parser
   } = _ref;
   /**
-   * Create a parser. The function creates a new `math.Parser` object.
+   * Create a `math.Parser` object that keeps a context of variables and their values, allowing the evaluation of expressions in that context.
    *
    * Syntax:
    *

package/lib/esm/expression/parse.js

@@ -29,7 +29,7 @@ export var createParse = /* #__PURE__ */factory(name, dependencies, _ref => {
   } = _ref;
   /**
    * Parse an expression. Returns a node tree, which can be evaluated by
-   * invoking node.evaluate().
+   * invoking node.evaluate() or transformed into a functional object via node.compile().
    *
    * 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.
@@ -48,6 +48,7 @@ export var createParse = /* #__PURE__ */factory(name, dependencies, _ref => {
    *
    *     let scope = {a:3, b:4}
    *     const node2 = math.parse('a * b') // 12
+   *     node2.evaluate(scope) // 12
    *     const code2 = node2.compile()
    *     code2.evaluate(scope) // 12
    *     scope.a = 5
@@ -389,7 +390,7 @@ export var createParse = /* #__PURE__ */factory(name, dependencies, _ref => {
           if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {
             throw createSyntaxError(state, 'Digit expected, got "' + currentCharacter(state) + '"');
           }
-        } else if (nextCharacter(state) === '.') {
+        } else if (parse.isDecimalMark(nextCharacter(state), state.expression.charAt(state.index + 2))) {
           next(state);
           throw createSyntaxError(state, 'Digit expected, got "' + currentCharacter(state) + '"');
         }
@@ -870,7 +871,7 @@ export var createParse = /* #__PURE__ */factory(name, dependencies, _ref => {
       name = state.token;
       fn = operators[name];
       getTokenSkipNewline(state);
-      if (name === 'in' && state.token === '') {
+      if (name === 'in' && '])},;'.includes(state.token)) {
         // end of expression -> this is the unit 'in' ('inch')
         node = new OperatorNode('*', 'multiply', [node, new SymbolNode('in')], true);
       } else {

package/lib/esm/function/arithmetic/add.js

@@ -32,39 +32,39 @@ export var createAdd = /* #__PURE__ */factory(name, dependencies, _ref => {
     concat
   });
   /**
-  * 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 | bigint | Fraction | Complex | Unit | Array | Matrix} x First value to add
-  * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} y Second value to add
-  * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} Sum of `x` and `y`
-  */
+   * 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 | bigint | Fraction | Complex | Unit | Array | Matrix} x First value to add
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} y Second value to add
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} Sum of `x` and `y`
+   */
   return typed(name, {
     'any, any': addScalar,
     'any, any, ...any': typed.referToSelf(self => (x, y, rest) => {

package/lib/esm/function/arithmetic/hypot.js

@@ -45,7 +45,7 @@ export var createHypot = /* #__PURE__ */factory(name, dependencies, _ref => {
   return typed(name, {
     '... number | BigNumber': _hypot,
     Array: _hypot,
-    Matrix: M => _hypot(flatten(M.toArray()))
+    Matrix: M => _hypot(flatten(M.toArray(), true))
   });
 
   /**

package/lib/esm/function/matrix/filter.js

@@ -64,8 +64,11 @@ export var createFilter = /* #__PURE__ */factory(name, dependencies, _ref => {
  */
 function _filterCallback(x, callback) {
   var fastCallback = optimizeCallback(callback, x, 'filter');
+  if (fastCallback.isUnary) {
+    return filter(x, fastCallback.fn);
+  }
   return filter(x, function (value, index, array) {
     // invoke the callback function with the right number of arguments
-    return fastCallback(value, [index], array);
+    return fastCallback.fn(value, [index], array);
   });
 }

package/lib/esm/function/matrix/flatten.js

@@ -32,7 +32,7 @@ export var createFlatten = /* #__PURE__ */factory(name, dependencies, _ref => {
     Matrix: function Matrix(x) {
       // Return the same matrix type as x (Dense or Sparse Matrix)
       // Return the same data type as x
-      return x.create(flattenArray(x.valueOf()), x.datatype());
+      return x.create(flattenArray(x.valueOf(), true), x.datatype());
     }
   });
 });

package/lib/esm/function/matrix/forEach.js

@@ -52,5 +52,6 @@ export var createForEach = /* #__PURE__ */factory(name, dependencies, _ref => {
  * @private
  */
 function _forEach(array, callback) {
-  deepForEach(array, optimizeCallback(callback, array, name));
+  var fastCallback = optimizeCallback(callback, array, name);
+  deepForEach(array, fastCallback.fn, fastCallback.isUnary);
 }

package/lib/esm/function/matrix/map.js

@@ -137,6 +137,7 @@ export var createMap = /* #__PURE__ */factory(name, dependencies, _ref => {
   * @private
   */
   function _mapArray(array, callback) {
-    return deepMap(array, optimizeCallback(callback, array, name));
+    var fastCallback = optimizeCallback(callback, array, name);
+    return deepMap(array, fastCallback.fn, fastCallback.isUnary);
   }
 });

package/lib/esm/type/matrix/DenseMatrix.js

@@ -241,36 +241,46 @@ export var createDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, _
       }
 
       // 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);
+      var returnMatrix = new DenseMatrix([]);
+      var submatrix = _getSubmatrix(matrix._data, index);
+      returnMatrix._size = submatrix.size;
+      returnMatrix._datatype = matrix._datatype;
+      returnMatrix._data = submatrix.data;
+      return returnMatrix;
     }
   }
 
   /**
-   * Recursively get a submatrix of a multi dimensional matrix.
+   * 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) {
-        validateIndex(i, data.length);
-        return data[i];
-      }).valueOf();
-    } else {
-      return range.map(function (i) {
-        validateIndex(i, data.length);
-        var child = data[i];
-        return _getSubmatrix(child, index, dims, dim + 1);
-      }).valueOf();
+  function _getSubmatrix(data, index) {
+    var maxDepth = index.size().length - 1;
+    var size = Array(maxDepth);
+    return {
+      data: getSubmatrixRecursive(data),
+      size
+    };
+    function getSubmatrixRecursive(data) {
+      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+      var ranges = index.dimension(depth);
+      size[depth] = ranges.size()[0];
+      if (depth < maxDepth) {
+        return ranges.map(rangeIndex => {
+          validateIndex(rangeIndex, data.length);
+          return getSubmatrixRecursive(data[rangeIndex], depth + 1);
+        }).valueOf();
+      } else {
+        return ranges.map(rangeIndex => {
+          validateIndex(rangeIndex, data.length);
+          return data[rangeIndex];
+        }).valueOf();
+      }
     }
   }
 
@@ -358,9 +368,7 @@ export var createDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, _
       _fit(matrix, size, defaultValue);
 
       // insert the sub matrix
-      var dims = iSize.length;
-      var dim = 0;
-      _setSubmatrix(matrix._data, index, submatrix, dims, dim);
+      _setSubmatrix(matrix._data, index, submatrix);
     }
     return matrix;
   }
@@ -371,23 +379,25 @@ export var createDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, _
    * @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) {
-        validateIndex(dataIndex);
-        data[dataIndex] = submatrix[subIndex[0]];
-      });
-    } else {
-      range.forEach(function (dataIndex, subIndex) {
-        validateIndex(dataIndex);
-        _setSubmatrix(data[dataIndex], index, submatrix[subIndex[0]], dims, dim + 1);
-      });
+  function _setSubmatrix(data, index, submatrix) {
+    var maxDepth = index.size().length - 1;
+    setSubmatrixRecursive(data, submatrix);
+    function setSubmatrixRecursive(data, submatrix) {
+      var depth = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
+      var range = index.dimension(depth);
+      if (depth < maxDepth) {
+        range.forEach((rangeIndex, i) => {
+          validateIndex(rangeIndex, data.length);
+          setSubmatrixRecursive(data[rangeIndex], submatrix[i[0]], depth + 1);
+        });
+      } else {
+        range.forEach((rangeIndex, i) => {
+          validateIndex(rangeIndex, data.length);
+          data[rangeIndex] = submatrix[i[0]];
+        });
+      }
     }
   }
 
@@ -518,62 +528,73 @@ export var createDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, _
   };
 
   /**
-   * Applies a callback function to a reference to each element of the matrix
+   * 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: an array, an integer index to that
-   *                              array, and the Matrix being traversed.
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @param {boolean} skipZeros   If true, the callback function is invoked only for non-zero entries
+   * @param {boolean} isUnary     If true, the callback function is invoked with one parameter
+   *
+   * @return {DenseMatrix} matrix
    */
-  DenseMatrix.prototype._forEach = function (callback) {
+  DenseMatrix.prototype.map = function (callback) {
+    var skipZeros = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+    var isUnary = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
     var me = this;
-    var s = me.size();
-    var maxDepth = s.length - 1;
-    if (maxDepth < 0) {
-      return;
+    var maxDepth = me._size.length - 1;
+    if (maxDepth < 0) return me.clone();
+    var fastCallback = optimizeCallback(callback, me, 'map', isUnary);
+    var fastCallbackFn = fastCallback.fn;
+    var result = me.create(undefined, me._datatype);
+    result._size = me._size;
+    if (isUnary || fastCallback.isUnary) {
+      result._data = iterateUnary(me._data);
+      return result;
     }
     if (maxDepth === 0) {
-      var thisSize = s[0];
-      for (var i = 0; i < thisSize; i++) {
-        callback(me._data, i, [i]);
+      var inputData = me.valueOf();
+      var data = Array(inputData.length);
+      for (var i = 0; i < inputData.length; i++) {
+        data[i] = fastCallbackFn(inputData[i], [i], me);
       }
-      return;
+      result._data = data;
+      return result;
     }
-    var index = Array(s.length);
-    function recurse(data, depth) {
-      var thisSize = s[depth];
+    var index = [];
+    result._data = iterate(me._data);
+    return result;
+    function iterate(data) {
+      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+      var result = Array(data.length);
       if (depth < maxDepth) {
-        for (var _i = 0; _i < thisSize; _i++) {
+        for (var _i = 0; _i < data.length; _i++) {
           index[depth] = _i;
-          recurse(data[_i], depth + 1);
+          result[_i] = iterate(data[_i], depth + 1);
         }
       } else {
-        for (var _i2 = 0; _i2 < thisSize; _i2++) {
+        for (var _i2 = 0; _i2 < data.length; _i2++) {
           index[depth] = _i2;
-          callback(data, _i2, index.slice());
+          result[_i2] = fastCallbackFn(data[_i2], index.slice(), me);
         }
       }
+      return result;
+    }
+    function iterateUnary(data) {
+      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+      var result = Array(data.length);
+      if (depth < maxDepth) {
+        for (var _i3 = 0; _i3 < data.length; _i3++) {
+          result[_i3] = iterateUnary(data[_i3], depth + 1);
+        }
+      } else {
+        for (var _i4 = 0; _i4 < data.length; _i4++) {
+          result[_i4] = fastCallbackFn(data[_i4]);
+        }
+      }
+      return result;
     }
-    recurse(me._data, 0);
-  };
-
-  /**
-   * 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) {
-    var me = this;
-    var result = new DenseMatrix(me);
-    var fastCallback = optimizeCallback(callback, me._data, 'map');
-    result._forEach(function (arr, i, index) {
-      arr[i] = fastCallback(arr[i], index, me);
-    });
-    return result;
   };
 
   /**
@@ -582,13 +603,55 @@ export var createDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, _
    * @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   If true, the callback function is invoked only for non-zero entries
+   * @param {boolean} isUnary     If true, the callback function is invoked with one parameter
    */
   DenseMatrix.prototype.forEach = function (callback) {
+    var skipZeros = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+    var isUnary = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
     var me = this;
-    var fastCallback = optimizeCallback(callback, me._data, 'map');
-    me._forEach(function (arr, i, index) {
-      fastCallback(arr[i], index, me);
-    });
+    var maxDepth = me._size.length - 1;
+    if (maxDepth < 0) return;
+    var fastCallback = optimizeCallback(callback, me, 'map', isUnary);
+    var fastCallbackFn = fastCallback.fn;
+    if (isUnary || fastCallback.isUnary) {
+      iterateUnary(me._data);
+      return;
+    }
+    if (maxDepth === 0) {
+      for (var i = 0; i < me._data.length; i++) {
+        fastCallbackFn(me._data[i], [i], me);
+      }
+      return;
+    }
+    var index = [];
+    iterate(me._data);
+    function iterate(data) {
+      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+      if (depth < maxDepth) {
+        for (var _i5 = 0; _i5 < data.length; _i5++) {
+          index[depth] = _i5;
+          iterate(data[_i5], depth + 1);
+        }
+      } else {
+        for (var _i6 = 0; _i6 < data.length; _i6++) {
+          index[depth] = _i6;
+          fastCallbackFn(data[_i6], index.slice(), me);
+        }
+      }
+    }
+    function iterateUnary(data) {
+      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+      if (depth < maxDepth) {
+        for (var _i7 = 0; _i7 < data.length; _i7++) {
+          iterateUnary(data[_i7], depth + 1);
+        }
+      } else {
+        for (var _i8 = 0; _i8 < data.length; _i8++) {
+          fastCallbackFn(data[_i8]);
+        }
+      }
+    }
   };
 
   /**
@@ -612,15 +675,15 @@ export var createDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, _
     var index = [];
     var _recurse = function* recurse(value, depth) {
       if (depth < maxDepth) {
-        for (var _i3 = 0; _i3 < value.length; _i3++) {
-          index[depth] = _i3;
-          yield* _recurse(value[_i3], depth + 1);
+        for (var _i9 = 0; _i9 < value.length; _i9++) {
+          index[depth] = _i9;
+          yield* _recurse(value[_i9], depth + 1);
         }
       } else {
-        for (var _i4 = 0; _i4 < value.length; _i4++) {
-          index[depth] = _i4;
+        for (var _i0 = 0; _i0 < value.length; _i0++) {
+          index[depth] = _i0;
           yield {
-            value: value[_i4],
+            value: value[_i0],
             index: index.slice()
           };
         }

package/lib/esm/type/matrix/SparseMatrix.js

@@ -876,7 +876,7 @@ export var createSparseMatrixClass = /* #__PURE__ */factory(name, dependencies,
     // invoke callback
     var invoke = function invoke(v, i, j) {
       // invoke callback
-      return fastCallback(v, [i, j], me);
+      return fastCallback.fn(v, [i, j], me);
     };
     // invoke _map
     return _map(this, 0, rows - 1, 0, columns - 1, invoke, skipZeros);
@@ -994,7 +994,8 @@ export var createSparseMatrixClass = /* #__PURE__ */factory(name, dependencies,
           var i = this._index[k];
 
           // value @ k
-          fastCallback(this._values[k], [i, j], me);
+          // TODO apply a non indexed version of algorithm in case fastCallback is not optimized
+          fastCallback.fn(this._values[k], [i, j], me);
         }
       } else {
         // create a cache holding all defined values
@@ -1008,7 +1009,7 @@ export var createSparseMatrixClass = /* #__PURE__ */factory(name, dependencies,
         // and either read the value or zero
         for (var _i7 = 0; _i7 < rows; _i7++) {
           var value = _i7 in values ? values[_i7] : 0;
-          fastCallback(value, [_i7, j], me);
+          fastCallback.fn(value, [_i7, j], me);
         }
       }
     }

package/lib/esm/type/unit/Unit.js

@@ -618,8 +618,8 @@ export var createUnitClass = /* #__PURE__ */factory(name, dependencies, _ref =>
 
     // 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;
+      var valThis = this.value === null ? this._normalize(one(other.value)) : this.value;
+      var valOther = other.value === null ? other._normalize(one(this.value)) : other.value;
       res.value = multiplyScalar(valThis, valOther);
     } else {
       res.value = null;
@@ -666,8 +666,8 @@ export var createUnitClass = /* #__PURE__ */factory(name, dependencies, _ref =>
 
     // 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;
+      var valThis = this.value === null ? this._normalize(one(other.value)) : this.value;
+      var valOther = other.value === null ? other._normalize(one(this.value)) : other.value;
       res.value = divideScalar(valThis, valOther);
     } else {
       res.value = null;
@@ -723,6 +723,21 @@ export var createUnitClass = /* #__PURE__ */factory(name, dependencies, _ref =>
     }
   }
 
+  /**
+   * Create a value one with the numeric type of `typeOfValue`.
+   * For example, `one(new BigNumber(3))` returns `BigNumber(1)`
+   * @param {number | Fraction | BigNumber} typeOfValue
+   * @returns {number | Fraction | BigNumber}
+   */
+  function one(typeOfValue) {
+    // TODO: this is a workaround to prevent the following BigNumber conversion error from throwing:
+    //  "TypeError: Cannot implicitly convert a number with >15 significant digits to BigNumber"
+    //  see https://github.com/josdejong/mathjs/issues/3450
+    //      https://github.com/josdejong/mathjs/pull/3375
+    var convert = Unit._getNumberConverter(typeOf(typeOfValue));
+    return convert(1);
+  }
+
   /**
    * Calculate the absolute value of a unit
    * @memberof Unit