mathjs-min 11.7.2

package/lib/cjs/function/bitwise/rightArithShift.js

@@ -0,0 +1,127 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRightArithShift = void 0;
+var _bitwise = require("../../utils/bignumber/bitwise.js");
+var _matAlgo02xDS = require("../../type/matrix/utils/matAlgo02xDS0.js");
+var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
+var _matAlgo14xDs = require("../../type/matrix/utils/matAlgo14xDs.js");
+var _matAlgo01xDSid = require("../../type/matrix/utils/matAlgo01xDSid.js");
+var _matAlgo10xSids = require("../../type/matrix/utils/matAlgo10xSids.js");
+var _matAlgo08xS0Sid = require("../../type/matrix/utils/matAlgo08xS0Sid.js");
+var _factory = require("../../utils/factory.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+var _useMatrixForArrayScalar = require("./useMatrixForArrayScalar.js");
+var _index = require("../../plain/number/index.js");
+var name = 'rightArithShift';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix', 'concat'];
+var createRightArithShift = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+    matrix = _ref.matrix,
+    equalScalar = _ref.equalScalar,
+    zeros = _ref.zeros,
+    DenseMatrix = _ref.DenseMatrix,
+    concat = _ref.concat;
+  var matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({
+    typed: typed
+  });
+  var matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var matAlgo08xS0Sid = (0, _matAlgo08xS0Sid.createMatAlgo08xS0Sid)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var matAlgo10xSids = (0, _matAlgo10xSids.createMatAlgo10xSids)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({
+    typed: typed
+  });
+  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed: typed,
+    matrix: matrix,
+    concat: concat
+  });
+  var useMatrixForArrayScalar = (0, _useMatrixForArrayScalar.createUseMatrixForArrayScalar)({
+    typed: typed,
+    matrix: matrix
+  });
+
+  /**
+   * 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, 4]
+   *
+   * 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` zero-filled shifted right `y` times
+   */
+  return typed(name, {
+    'number, number': _index.rightArithShiftNumber,
+    'BigNumber, BigNumber': _bitwise.rightArithShiftBigNumber,
+    'SparseMatrix, number | BigNumber': typed.referToSelf(function (self) {
+      return function (x, y) {
+        // check scalar
+        if (equalScalar(y, 0)) {
+          return x.clone();
+        }
+        return matAlgo11xS0s(x, y, self, false);
+      };
+    }),
+    'DenseMatrix, number | BigNumber': typed.referToSelf(function (self) {
+      return function (x, y) {
+        // check scalar
+        if (equalScalar(y, 0)) {
+          return x.clone();
+        }
+        return matAlgo14xDs(x, y, self, false);
+      };
+    }),
+    'number | BigNumber, SparseMatrix': typed.referToSelf(function (self) {
+      return function (x, y) {
+        // check scalar
+        if (equalScalar(x, 0)) {
+          return zeros(y.size(), y.storage());
+        }
+        return matAlgo10xSids(y, x, self, true);
+      };
+    }),
+    'number | BigNumber, DenseMatrix': typed.referToSelf(function (self) {
+      return function (x, y) {
+        // check scalar
+        if (equalScalar(x, 0)) {
+          return zeros(y.size(), y.storage());
+        }
+        return matAlgo14xDs(y, x, self, true);
+      };
+    })
+  }, useMatrixForArrayScalar, matrixAlgorithmSuite({
+    SS: matAlgo08xS0Sid,
+    DS: matAlgo01xDSid,
+    SD: matAlgo02xDS0
+  }));
+});
+exports.createRightArithShift = createRightArithShift;

package/lib/cjs/function/bitwise/rightLogShift.js

@@ -0,0 +1,128 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRightLogShift = void 0;
+var _matAlgo02xDS = require("../../type/matrix/utils/matAlgo02xDS0.js");
+var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
+var _matAlgo14xDs = require("../../type/matrix/utils/matAlgo14xDs.js");
+var _matAlgo01xDSid = require("../../type/matrix/utils/matAlgo01xDSid.js");
+var _matAlgo10xSids = require("../../type/matrix/utils/matAlgo10xSids.js");
+var _matAlgo08xS0Sid = require("../../type/matrix/utils/matAlgo08xS0Sid.js");
+var _factory = require("../../utils/factory.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+var _index = require("../../plain/number/index.js");
+var _useMatrixForArrayScalar = require("./useMatrixForArrayScalar.js");
+var name = 'rightLogShift';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix', 'concat'];
+var createRightLogShift = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+    matrix = _ref.matrix,
+    equalScalar = _ref.equalScalar,
+    zeros = _ref.zeros,
+    DenseMatrix = _ref.DenseMatrix,
+    concat = _ref.concat;
+  var matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({
+    typed: typed
+  });
+  var matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var matAlgo08xS0Sid = (0, _matAlgo08xS0Sid.createMatAlgo08xS0Sid)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var matAlgo10xSids = (0, _matAlgo10xSids.createMatAlgo10xSids)({
+    typed: typed,
+    DenseMatrix: DenseMatrix
+  });
+  var matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({
+    typed: typed,
+    equalScalar: equalScalar
+  });
+  var matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({
+    typed: typed
+  });
+  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed: typed,
+    matrix: matrix,
+    concat: concat
+  });
+  var useMatrixForArrayScalar = (0, _useMatrixForArrayScalar.createUseMatrixForArrayScalar)({
+    typed: typed,
+    matrix: matrix
+  });
+
+  /**
+   * 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, 4]
+   *
+   * 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(name, {
+    'number, number': _index.rightLogShiftNumber,
+    // 'BigNumber, BigNumber': ..., // TODO: implement BigNumber support for rightLogShift
+
+    'SparseMatrix, number | BigNumber': typed.referToSelf(function (self) {
+      return function (x, y) {
+        // check scalar
+        if (equalScalar(y, 0)) {
+          return x.clone();
+        }
+        return matAlgo11xS0s(x, y, self, false);
+      };
+    }),
+    'DenseMatrix, number | BigNumber': typed.referToSelf(function (self) {
+      return function (x, y) {
+        // check scalar
+        if (equalScalar(y, 0)) {
+          return x.clone();
+        }
+        return matAlgo14xDs(x, y, self, false);
+      };
+    }),
+    'number | BigNumber, SparseMatrix': typed.referToSelf(function (self) {
+      return function (x, y) {
+        // check scalar
+        if (equalScalar(x, 0)) {
+          return zeros(y.size(), y.storage());
+        }
+        return matAlgo10xSids(y, x, self, true);
+      };
+    }),
+    'number | BigNumber, DenseMatrix': typed.referToSelf(function (self) {
+      return function (x, y) {
+        // check scalar
+        if (equalScalar(x, 0)) {
+          return zeros(y.size(), y.storage());
+        }
+        return matAlgo14xDs(y, x, self, true);
+      };
+    })
+  }, useMatrixForArrayScalar, matrixAlgorithmSuite({
+    SS: matAlgo08xS0Sid,
+    DS: matAlgo01xDSid,
+    SD: matAlgo02xDS0
+  }));
+});
+exports.createRightLogShift = createRightLogShift;

package/lib/cjs/function/bitwise/useMatrixForArrayScalar.js

@@ -0,0 +1,34 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUseMatrixForArrayScalar = void 0;
+var _factory = require("../../utils/factory.js");
+var createUseMatrixForArrayScalar = /* #__PURE__ */(0, _factory.factory)('useMatrixForArrayScalar', ['typed', 'matrix'], function (_ref) {
+  var typed = _ref.typed,
+    matrix = _ref.matrix;
+  return {
+    'Array, number': typed.referTo('DenseMatrix, number', function (selfDn) {
+      return function (x, y) {
+        return selfDn(matrix(x), y).valueOf();
+      };
+    }),
+    'Array, BigNumber': typed.referTo('DenseMatrix, BigNumber', function (selfDB) {
+      return function (x, y) {
+        return selfDB(matrix(x), y).valueOf();
+      };
+    }),
+    'number, Array': typed.referTo('number, DenseMatrix', function (selfnD) {
+      return function (x, y) {
+        return selfnD(x, matrix(y)).valueOf();
+      };
+    }),
+    'BigNumber, Array': typed.referTo('BigNumber, DenseMatrix', function (selfBD) {
+      return function (x, y) {
+        return selfBD(x, matrix(y)).valueOf();
+      };
+    })
+  };
+});
+exports.createUseMatrixForArrayScalar = createUseMatrixForArrayScalar;

package/lib/cjs/function/combinatorics/bellNumbers.js

@@ -0,0 +1,52 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBellNumbers = void 0;
+var _factory = require("../../utils/factory.js");
+var name = 'bellNumbers';
+var dependencies = ['typed', 'addScalar', 'isNegative', 'isInteger', 'stirlingS2'];
+var createBellNumbers = /* #__PURE__ */(0, _factory.factory)(name, 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(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;
+    }
+  });
+});
+exports.createBellNumbers = createBellNumbers;

package/lib/cjs/function/combinatorics/catalan.js

@@ -0,0 +1,48 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCatalan = void 0;
+var _factory = require("../../utils/factory.js");
+var name = 'catalan';
+var dependencies = ['typed', 'addScalar', 'divideScalar', 'multiplyScalar', 'combinations', 'isNegative', 'isInteger'];
+var createCatalan = /* #__PURE__ */(0, _factory.factory)(name, 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(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));
+    }
+  });
+});
+exports.createCatalan = createCatalan;

package/lib/cjs/function/combinatorics/composition.js

@@ -0,0 +1,51 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createComposition = void 0;
+var _factory = require("../../utils/factory.js");
+var name = 'composition';
+var dependencies = ['typed', 'addScalar', 'combinations', 'isNegative', 'isPositive', 'isInteger', 'larger'];
+var createComposition = /* #__PURE__ */(0, _factory.factory)(name, 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(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));
+    }
+  });
+});
+exports.createComposition = createComposition;

package/lib/cjs/function/combinatorics/stirlingS2.js

@@ -0,0 +1,91 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createStirlingS2 = void 0;
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+var name = 'stirlingS2';
+var dependencies = ['typed', 'addScalar', 'subtract', 'multiplyScalar', 'divideScalar', 'pow', 'factorial', 'combinations', 'isNegative', 'isInteger', 'number', '?bignumber', 'larger'];
+var createStirlingS2 = /* #__PURE__ */(0, _factory.factory)(name, 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,
+    number = _ref.number,
+    bignumber = _ref.bignumber,
+    larger = _ref.larger;
+  var smallCache = [];
+  var bigCache = [];
+  /**
+   * 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 <= n, then s(n,k) = 1
+   *  If k = 0 < n, then s(n,k) = 0
+   *
+   * Note that if either n or k is supplied as a BigNumber, the result will be
+   * as well.
+   *
+   * 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(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');
+      }
+      var big = !((0, _is.isNumber)(n) && (0, _is.isNumber)(k));
+      var cache = big ? bigCache : smallCache;
+      var make = big ? bignumber : number;
+      var nn = number(n);
+      var nk = number(k);
+      /* See if we already have the value: */
+      if (cache[nn] && cache[nn].length > nk) {
+        return cache[nn][nk];
+      }
+      /* Fill the cache */
+      for (var m = 0; m <= nn; ++m) {
+        if (!cache[m]) {
+          cache[m] = [m === 0 ? make(1) : make(0)];
+        }
+        if (m === 0) continue;
+        var row = cache[m];
+        var prev = cache[m - 1];
+        for (var i = row.length; i <= m && i <= nk; ++i) {
+          if (i === m) {
+            row[i] = 1;
+          } else {
+            row[i] = addScalar(multiplyScalar(make(i), prev[i]), prev[i - 1]);
+          }
+        }
+      }
+      return cache[nn][nk];
+    }
+  });
+});
+exports.createStirlingS2 = createStirlingS2;

package/lib/cjs/function/complex/arg.js

@@ -0,0 +1,59 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createArg = void 0;
+var _factory = require("../../utils/factory.js");
+var _collection = require("../../utils/collection.js");
+var name = 'arg';
+var dependencies = ['typed'];
+var createArg = /* #__PURE__ */(0, _factory.factory)(name, 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(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': typed.referToSelf(function (self) {
+      return function (x) {
+        return (0, _collection.deepMap)(x, self);
+      };
+    })
+  });
+});
+exports.createArg = createArg;

package/lib/cjs/function/complex/conj.js

@@ -0,0 +1,52 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createConj = void 0;
+var _factory = require("../../utils/factory.js");
+var _collection = require("../../utils/collection.js");
+var name = 'conj';
+var dependencies = ['typed'];
+var createConj = /* #__PURE__ */(0, _factory.factory)(name, 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(name, {
+    'number | BigNumber | Fraction': function numberBigNumberFraction(x) {
+      return x;
+    },
+    Complex: function Complex(x) {
+      return x.conjugate();
+    },
+    'Array | Matrix': typed.referToSelf(function (self) {
+      return function (x) {
+        return (0, _collection.deepMap)(x, self);
+      };
+    })
+  });
+});
+exports.createConj = createConj;