mathjs 14.3.0 → 14.4.0

package/lib/cjs/core/function/import.js

@@ -75,7 +75,7 @@ function importFactory(typed, load, math, importedFactories) {
     function flattenImports(flatValues, value, name) {
       if (Array.isArray(value)) {
         value.forEach(item => flattenImports(flatValues, item));
-      } else if (typeof value === 'object') {
+      } else if ((0, _is.isObject)(value) || isModule(value)) {
         for (const name in value) {
           if ((0, _object.hasOwnProperty)(value, name)) {
             flattenImports(flatValues, value[name], name);
@@ -316,6 +316,9 @@ function importFactory(typed, load, math, importedFactories) {
   function isSupportedType(object) {
     return typeof object === 'function' || typeof object === 'number' || typeof object === 'string' || typeof object === 'boolean' || object === null || (0, _is.isUnit)(object) || (0, _is.isComplex)(object) || (0, _is.isBigNumber)(object) || (0, _is.isFraction)(object) || (0, _is.isMatrix)(object) || Array.isArray(object);
   }
+  function isModule(object) {
+    return typeof object === 'object' && object[Symbol.toStringTag] === 'Module';
+  }
   function hasTypedFunctionSignature(fn) {
     return typeof fn === 'function' && typeof fn.signature === 'string';
   }

package/lib/cjs/expression/parse.js

@@ -396,7 +396,7 @@ const createParse = exports.createParse = /* #__PURE__ */(0, _factory.factory)(n
           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) + '"');
         }

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

@@ -51,7 +51,7 @@ const createHypot = exports.createHypot = /* #__PURE__ */(0, _factory.factory)(n
   return typed(name, {
     '... number | BigNumber': _hypot,
     Array: _hypot,
-    Matrix: M => _hypot((0, _array.flatten)(M.toArray()))
+    Matrix: M => _hypot((0, _array.flatten)(M.toArray(), true))
   });
 
   /**

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

@@ -70,8 +70,11 @@ const createFilter = exports.createFilter = /* #__PURE__ */(0, _factory.factory)
  */
 function _filterCallback(x, callback) {
   const fastCallback = (0, _optimizeCallback.optimizeCallback)(callback, x, 'filter');
+  if (fastCallback.isUnary) {
+    return (0, _array.filter)(x, fastCallback.fn);
+  }
   return (0, _array.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/cjs/function/matrix/flatten.js

@@ -38,7 +38,7 @@ const createFlatten = exports.createFlatten = /* #__PURE__ */(0, _factory.factor
     Matrix: function (x) {
       // Return the same matrix type as x (Dense or Sparse Matrix)
       // Return the same data type as x
-      return x.create((0, _array.flatten)(x.valueOf()), x.datatype());
+      return x.create((0, _array.flatten)(x.valueOf(), true), x.datatype());
     }
   });
 });

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

@@ -58,5 +58,6 @@ const createForEach = exports.createForEach = /* #__PURE__ */(0, _factory.factor
  * @private
  */
 function _forEach(array, callback) {
-  (0, _array.deepForEach)(array, (0, _optimizeCallback.optimizeCallback)(callback, array, name));
+  const fastCallback = (0, _optimizeCallback.optimizeCallback)(callback, array, name);
+  (0, _array.deepForEach)(array, fastCallback.fn, fastCallback.isUnary);
 }

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

@@ -143,6 +143,7 @@ const createMap = exports.createMap = /* #__PURE__ */(0, _factory.factory)(name,
   * @private
   */
   function _mapArray(array, callback) {
-    return (0, _array.deepMap)(array, (0, _optimizeCallback.optimizeCallback)(callback, array, name));
+    const fastCallback = (0, _optimizeCallback.optimizeCallback)(callback, array, name);
+    return (0, _array.deepMap)(array, fastCallback.fn, fastCallback.isUnary);
   }
 });

package/lib/cjs/header.js

@@ -6,8 +6,8 @@
  * It features real and complex numbers, units, matrices, a large set of
  * mathematical functions, and a flexible expression parser.
  *
- * @version 14.3.0
- * @date    2025-02-28
+ * @version 14.4.0
+ * @date    2025-03-28
  *
  * @license
  * Copyright (C) 2013-2025 Jos de Jong <wjosdejong@gmail.com>

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

@@ -528,39 +528,52 @@ const createDenseMatrixClass = exports.createDenseMatrixClass = /* #__PURE__ */(
    * Applies a callback function to a reference to each element 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 array containing the element,
+   *                              the index of the element within that array (as an integer),
+   *                              and for non unarry callbacks copy of the current index (as an array of integers).
    */
   DenseMatrix.prototype._forEach = function (callback) {
-    const me = this;
-    const s = me.size();
-    const maxDepth = s.length - 1;
-    if (maxDepth < 0) {
+    const isUnary = callback.length === 2; // callback has 2 parameters: value, index
+    const maxDepth = this._size.length - 1;
+    if (maxDepth < 0) return;
+    if (isUnary) {
+      iterateUnary(this._data);
       return;
     }
     if (maxDepth === 0) {
-      const thisSize = s[0];
-      for (let i = 0; i < thisSize; i++) {
-        callback(me._data, i, [i]);
+      for (let i = 0; i < this._data.length; i++) {
+        callback(this._data, i, [i]);
       }
       return;
     }
-    const index = Array(s.length);
-    function recurse(data, depth) {
-      const thisSize = s[depth];
+    const index = new Array(maxDepth + 1);
+    iterate(this._data);
+    function iterate(data) {
+      let depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
       if (depth < maxDepth) {
-        for (let i = 0; i < thisSize; i++) {
+        for (let i = 0; i < data.length; i++) {
           index[depth] = i;
-          recurse(data[i], depth + 1);
+          iterate(data[i], depth + 1);
         }
       } else {
-        for (let i = 0; i < thisSize; i++) {
+        for (let i = 0; i < data.length; i++) {
           index[depth] = i;
           callback(data, i, index.slice());
         }
       }
     }
-    recurse(me._data, 0);
+    function iterateUnary(data) {
+      let depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+      if (depth < maxDepth) {
+        for (let i = 0; i < data.length; i++) {
+          iterateUnary(data[i], depth + 1);
+        }
+      } else {
+        for (let i = 0; i < data.length; i++) {
+          callback(data, i);
+        }
+      }
+    }
   };
 
   /**
@@ -570,16 +583,23 @@ const createDenseMatrixClass = exports.createDenseMatrixClass = /* #__PURE__ */(
    * @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
    *
    * @return {DenseMatrix} matrix
    */
   DenseMatrix.prototype.map = function (callback) {
+    let skipZeros = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+    let isUnary = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
     const me = this;
     const result = new DenseMatrix(me);
-    const fastCallback = (0, _optimizeCallback.optimizeCallback)(callback, me._data, 'map');
-    result._forEach(function (arr, i, index) {
-      arr[i] = fastCallback(arr[i], index, me);
-    });
+    const fastCallback = (0, _optimizeCallback.optimizeCallback)(callback, me._data, 'map', isUnary);
+    const applyCallback = isUnary || fastCallback.isUnary ? (arr, i) => {
+      arr[i] = fastCallback.fn(arr[i]);
+    } : (arr, i, index) => {
+      arr[i] = fastCallback.fn(arr[i], index, me);
+    };
+    result._forEach(applyCallback);
     return result;
   };
 
@@ -589,13 +609,20 @@ const createDenseMatrixClass = exports.createDenseMatrixClass = /* #__PURE__ */(
    * @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) {
+    let skipZeros = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+    let isUnary = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
     const me = this;
-    const fastCallback = (0, _optimizeCallback.optimizeCallback)(callback, me._data, 'map');
-    me._forEach(function (arr, i, index) {
-      fastCallback(arr[i], index, me);
-    });
+    const fastCallback = (0, _optimizeCallback.optimizeCallback)(callback, me._data, 'map', isUnary);
+    const applyCallback = isUnary || fastCallback.isUnary ? (arr, i) => {
+      fastCallback.fn(arr[i]);
+    } : (arr, i, index) => {
+      fastCallback.fn(arr[i], index, me);
+    };
+    me._forEach(applyCallback);
   };
 
   /**

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

@@ -882,7 +882,7 @@ const createSparseMatrixClass = exports.createSparseMatrixClass = /* #__PURE__ *
     // invoke callback
     const invoke = function (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);
@@ -1000,7 +1000,8 @@ const createSparseMatrixClass = exports.createSparseMatrixClass = /* #__PURE__ *
           const 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
@@ -1014,7 +1015,7 @@ const createSparseMatrixClass = exports.createSparseMatrixClass = /* #__PURE__ *
         // and either read the value or zero
         for (let i = 0; i < rows; i++) {
           const value = i in values ? values[i] : 0;
-          fastCallback(value, [i, j], me);
+          fastCallback.fn(value, [i, j], me);
         }
       }
     }

package/lib/cjs/utils/array.js

@@ -278,7 +278,7 @@ function _resize(array, size, dim, defaultValue) {
  *                                not equal that of the old ones
  */
 function reshape(array, sizes) {
-  const flatArray = flatten(array);
+  const flatArray = flatten(array, true); // since it has rectangular
   const currentLength = flatArray.length;
   if (!Array.isArray(array) || !Array.isArray(sizes)) {
     throw new TypeError('Array expected');
@@ -475,22 +475,46 @@ function _unsqueeze(array, dims, dim) {
  * Flatten a multi dimensional array, put all elements in a one dimensional
  * array
  * @param {Array} array   A multi dimensional array
+ * @param {boolean} isRectangular Optional. If the array is rectangular (not jagged)
  * @return {Array}        The flattened array (1 dimensional)
  */
 function flatten(array) {
+  let isRectangular = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
   if (!Array.isArray(array)) {
     // if not an array, return as is
     return array;
   }
+  if (typeof isRectangular !== 'boolean') {
+    throw new TypeError('Boolean expected for second argument of flatten');
+  }
   const flat = [];
-  array.forEach(function callback(value) {
-    if (Array.isArray(value)) {
-      value.forEach(callback); // traverse through sub-arrays recursively
+  if (isRectangular) {
+    _flattenRectangular(array);
+  } else {
+    _flatten(array);
+  }
+  return flat;
+  function _flatten(array) {
+    for (let i = 0; i < array.length; i++) {
+      const item = array[i];
+      if (Array.isArray(item)) {
+        _flatten(item);
+      } else {
+        flat.push(item);
+      }
+    }
+  }
+  function _flattenRectangular(array) {
+    if (Array.isArray(array[0])) {
+      for (let i = 0; i < array.length; i++) {
+        _flattenRectangular(array[i]);
+      }
     } else {
-      flat.push(value);
+      for (let i = 0; i < array.length; i++) {
+        flat.push(array[i]);
+      }
     }
-  });
-  return flat;
+  }
 }
 
 /**

package/lib/cjs/utils/collection.js

@@ -36,7 +36,7 @@ function containsCollections(array) {
  */
 function deepForEach(array, callback) {
   if ((0, _is.isMatrix)(array)) {
-    array.forEach(x => callback(x));
+    array.forEach(x => callback(x), false, true);
   } else {
     (0, _array.deepForEach)(array, callback, true);
   }
@@ -57,14 +57,14 @@ function deepForEach(array, callback) {
 function deepMap(array, callback, skipZeros) {
   if (!skipZeros) {
     if ((0, _is.isMatrix)(array)) {
-      return array.map(x => callback(x));
+      return array.map(x => callback(x), false, true);
     } else {
       return (0, _array.deepMap)(array, callback, true);
     }
   }
   const skipZerosCallback = x => x === 0 ? x : callback(x);
   if ((0, _is.isMatrix)(array)) {
-    return array.map(x => skipZerosCallback(x));
+    return array.map(x => skipZerosCallback(x), false, true);
   } else {
     return (0, _array.deepMap)(array, skipZerosCallback, true);
   }

package/lib/cjs/utils/latex.js

@@ -161,6 +161,9 @@ const latexFunctions = exports.latexFunctions = {
   floor: {
     1: '\\left\\lfloor${args[0]}\\right\\rfloor'
   },
+  fraction: {
+    2: '\\frac{${args[0]}}{${args[1]}}'
+  },
   gcd: '\\gcd\\left(${args}\\right)',
   hypot: '\\hypot\\left(${args}\\right)',
   log: {
@@ -189,7 +192,7 @@ const latexFunctions = exports.latexFunctions = {
     2: '\\sqrt[${args[1]}]{${args[0]}}'
   },
   nthRoots: {
-    2: '\\{y : $y^{args[1]} = {${args[0]}}\\}'
+    2: '\\{y : y^${args[1]} = {${args[0]}}\\}'
   },
   pow: {
     2: `\\left(\${args[0]}\\right)${latexOperators.pow}{\${args[1]}}`

package/lib/cjs/utils/optimizeCallback.js

@@ -14,13 +14,20 @@ var _is = require("./is.js");
  * @param {Function} callback The original callback function to simplify.
  * @param {Array|Matrix} array The array that will be used with the callback function.
  * @param {string} name The name of the function that is using the callback.
+ * @param {boolean} [isUnary=false] If true, the callback function is unary and will be optimized as such.
  * @returns {Function} Returns a simplified version of the callback function.
  */
 function optimizeCallback(callback, array, name) {
+  let isUnary = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : false;
   if (_typedFunction.default.isTypedFunction(callback)) {
-    const firstIndex = (array.isMatrix ? array.size() : (0, _array.arraySize)(array)).map(() => 0);
-    const firstValue = array.isMatrix ? array.get(firstIndex) : (0, _array.get)(array, firstIndex);
-    const numberOfArguments = _findNumberOfArguments(callback, firstValue, firstIndex, array);
+    let numberOfArguments;
+    if (isUnary) {
+      numberOfArguments = 1;
+    } else {
+      const firstIndex = (array.isMatrix ? array.size() : (0, _array.arraySize)(array)).map(() => 0);
+      const firstValue = array.isMatrix ? array.get(firstIndex) : (0, _array.get)(array, firstIndex);
+      numberOfArguments = _findNumberOfArgumentsTyped(callback, firstValue, firstIndex, array);
+    }
     let fastCallback;
     if (array.isMatrix && array.dataType !== 'mixed' && array.dataType !== undefined) {
       const singleSignature = _findSingleSignatureWithArity(callback, numberOfArguments);
@@ -29,21 +36,37 @@ function optimizeCallback(callback, array, name) {
       fastCallback = callback;
     }
     if (numberOfArguments >= 1 && numberOfArguments <= 3) {
-      return function () {
-        for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
-          args[_key] = arguments[_key];
+      return {
+        isUnary: numberOfArguments === 1,
+        fn: function () {
+          for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
+            args[_key] = arguments[_key];
+          }
+          return _tryFunctionWithArgs(fastCallback, args.slice(0, numberOfArguments), name, callback.name);
         }
-        return _tryFunctionWithArgs(fastCallback, args.slice(0, numberOfArguments), name, callback.name);
       };
     }
-    return function () {
-      for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
-        args[_key2] = arguments[_key2];
+    return {
+      isUnary: false,
+      fn: function () {
+        for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+          args[_key2] = arguments[_key2];
+        }
+        return _tryFunctionWithArgs(fastCallback, args, name, callback.name);
       }
-      return _tryFunctionWithArgs(fastCallback, args, name, callback.name);
     };
   }
-  return callback;
+  if (isUnary === undefined) {
+    return {
+      isUnary: _findIfCallbackIsUnary(callback),
+      fn: callback
+    };
+  } else {
+    return {
+      isUnary,
+      fn: callback
+    };
+  }
 }
 function _findSingleSignatureWithArity(callback, arity) {
   const matchingFunctions = [];
@@ -57,7 +80,32 @@ function _findSingleSignatureWithArity(callback, arity) {
     return matchingFunctions[0];
   }
 }
-function _findNumberOfArguments(callback, value, index, array) {
+
+/**
+ * Determines if a given callback function is unary (i.e., takes exactly one argument).
+ *
+ * This function checks the following conditions to determine if the callback is unary:
+ * 1. The callback function should have exactly one parameter.
+ * 2. The callback function should not use the `arguments` object.
+ * 3. The callback function should not use rest parameters (`...`).
+ * If in doubt, this function shall return `false` to be safe
+ *
+ * @param {Function} callback - The callback function to be checked.
+ * @returns {boolean} - Returns `true` if the callback is unary, otherwise `false`.
+ */
+function _findIfCallbackIsUnary(callback) {
+  if (callback.length !== 1) return false;
+  const callbackStr = callback.toString();
+  // Check if the callback function uses `arguments`
+  if (/arguments/.test(callbackStr)) return false;
+
+  // Extract the parameters of the callback function
+  const paramsStr = callbackStr.match(/\(.*?\)/);
+  // Check if the callback function uses rest parameters
+  if (/\.\.\./.test(paramsStr)) return false;
+  return true;
+}
+function _findNumberOfArgumentsTyped(callback, value, index, array) {
   const testArgs = [value, index, array];
   for (let i = 3; i > 0; i--) {
     const args = testArgs.slice(0, i);

package/lib/cjs/version.js

@@ -4,6 +4,6 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.version = void 0;
-const version = exports.version = '14.3.0';
+const version = exports.version = '14.4.0';
 // Note: This file is automatically generated when building math.js.
 // Changes made in this file will be overwritten.

package/lib/esm/core/function/import.js

@@ -1,4 +1,4 @@
-import { isBigNumber, isComplex, isFraction, isMatrix, isUnit } from '../../utils/is.js';
+import { isBigNumber, isComplex, isFraction, isMatrix, isObject, isUnit } from '../../utils/is.js';
 import { isFactory, stripOptionalNotation } from '../../utils/factory.js';
 import { hasOwnProperty, lazy } from '../../utils/object.js';
 import { ArgumentsError } from '../../error/ArgumentsError.js';
@@ -69,7 +69,7 @@ export function importFactory(typed, load, math, importedFactories) {
     function flattenImports(flatValues, value, name) {
       if (Array.isArray(value)) {
         value.forEach(item => flattenImports(flatValues, item));
-      } else if (typeof value === 'object') {
+      } else if (isObject(value) || isModule(value)) {
         for (var _name in value) {
           if (hasOwnProperty(value, _name)) {
             flattenImports(flatValues, value[_name], _name);
@@ -310,6 +310,9 @@ export function importFactory(typed, load, math, importedFactories) {
   function isSupportedType(object) {
     return typeof object === 'function' || typeof object === 'number' || typeof object === 'string' || typeof object === 'boolean' || object === null || isUnit(object) || isComplex(object) || isBigNumber(object) || isFraction(object) || isMatrix(object) || Array.isArray(object);
   }
+  function isModule(object) {
+    return typeof object === 'object' && object[Symbol.toStringTag] === 'Module';
+  }
   function hasTypedFunctionSignature(fn) {
     return typeof fn === 'function' && typeof fn.signature === 'string';
   }

package/lib/esm/expression/parse.js

@@ -389,7 +389,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) + '"');
         }

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);
   }
 });