mathjs 10.6.2 → 11.0.0

package/lib/esm/function/probability/gamma.js

@@ -1,4 +1,3 @@
-import { deepMap } from '../../utils/collection.js';
 import { factory } from '../../utils/factory.js';
 import { gammaG, gammaNumber, gammaP } from '../../plain/number/index.js';
 var name = 'gamma';
@@ -10,14 +9,15 @@ export var createGamma = /* #__PURE__ */factory(name, dependencies, _ref => {
     multiplyScalar,
     pow,
     BigNumber: _BigNumber,
-    Complex: _Complex
+    Complex
   } = _ref;
 
   /**
    * Compute the gamma function of a value using Lanczos approximation for
    * small values, and an extended Stirling approximation for large values.
    *
-   * For matrices, the function is evaluated element wise.
+   * To avoid confusion with the matrix Gamma function, this function does
+   * not apply to matrices.
    *
    * Syntax:
    *
@@ -33,51 +33,53 @@ export var createGamma = /* #__PURE__ */factory(name, dependencies, _ref => {
    *
    *    combinations, factorial, permutations
    *
-   * @param {number | Array | Matrix} n   A real or complex number
-   * @return {number | Array | Matrix}    The gamma of `n`
+   * @param {number | BigNumber | Complex} n   A real or complex number
+   * @return {number | BigNumber | Complex}    The gamma of `n`
    */
-  return typed(name, {
-    number: gammaNumber,
-    Complex: function Complex(n) {
-      if (n.im === 0) {
-        return this(n.re);
-      } // Lanczos approximation doesn't work well with real part lower than 0.5
-      // So reflection formula is required
+  function gammaComplex(n) {
+    if (n.im === 0) {
+      return gammaNumber(n.re);
+    } // Lanczos approximation doesn't work well with real part lower than 0.5
+    // So reflection formula is required
+
 
+    if (n.re < 0.5) {
+      // Euler's reflection formula
+      // gamma(1-z) * gamma(z) = PI / sin(PI * z)
+      // real part of Z should not be integer [sin(PI) == 0 -> 1/0 - undefined]
+      // thanks to imperfect sin implementation sin(PI * n) != 0
+      // we can safely use it anyway
+      var _t = new Complex(1 - n.re, -n.im);
 
-      if (n.re < 0.5) {
-        // Euler's reflection formula
-        // gamma(1-z) * gamma(z) = PI / sin(PI * z)
-        // real part of Z should not be integer [sin(PI) == 0 -> 1/0 - undefined]
-        // thanks to imperfect sin implementation sin(PI * n) != 0
-        // we can safely use it anyway
-        var _t = new _Complex(1 - n.re, -n.im);
+      var r = new Complex(Math.PI * n.re, Math.PI * n.im);
+      return new Complex(Math.PI).div(r.sin()).div(gammaComplex(_t));
+    } // Lanczos approximation
+    // z -= 1
 
-        var r = new _Complex(Math.PI * n.re, Math.PI * n.im);
-        return new _Complex(Math.PI).div(r.sin()).div(this(_t));
-      } // Lanczos approximation
-      // z -= 1
 
+    n = new Complex(n.re - 1, n.im); // x = gammaPval[0]
 
-      n = new _Complex(n.re - 1, n.im); // x = gammaPval[0]
+    var x = new Complex(gammaP[0], 0); // for (i, gammaPval) in enumerate(gammaP):
 
-      var x = new _Complex(gammaP[0], 0); // for (i, gammaPval) in enumerate(gammaP):
+    for (var i = 1; i < gammaP.length; ++i) {
+      // x += gammaPval / (z + i)
+      var gammaPval = new Complex(gammaP[i], 0);
+      x = x.add(gammaPval.div(n.add(i)));
+    } // t = z + gammaG + 0.5
 
-      for (var i = 1; i < gammaP.length; ++i) {
-        // x += gammaPval / (z + i)
-        var gammaPval = new _Complex(gammaP[i], 0);
-        x = x.add(gammaPval.div(n.add(i)));
-      } // t = z + gammaG + 0.5
 
+    var t = new Complex(n.re + gammaG + 0.5, n.im); // y = sqrt(2 * pi) * t ** (z + 0.5) * exp(-t) * x
 
-      var t = new _Complex(n.re + gammaG + 0.5, n.im); // y = sqrt(2 * pi) * t ** (z + 0.5) * exp(-t) * x
+    var twoPiSqrt = Math.sqrt(2 * Math.PI);
+    var tpow = t.pow(n.add(0.5));
+    var expt = t.neg().exp(); // y = [x] * [sqrt(2 * pi)] * [t ** (z + 0.5)] * [exp(-t)]
 
-      var twoPiSqrt = Math.sqrt(2 * Math.PI);
-      var tpow = t.pow(n.add(0.5));
-      var expt = t.neg().exp(); // y = [x] * [sqrt(2 * pi)] * [t ** (z + 0.5)] * [exp(-t)]
+    return x.mul(twoPiSqrt).mul(tpow).mul(expt);
+  }
 
-      return x.mul(twoPiSqrt).mul(tpow).mul(expt);
-    },
+  return typed(name, {
+    number: gammaNumber,
+    Complex: gammaComplex,
     BigNumber: function BigNumber(n) {
       if (n.isInteger()) {
         return n.isNegative() || n.isZero() ? new _BigNumber(Infinity) : bigFactorial(n.minus(1));
@@ -88,9 +90,6 @@ export var createGamma = /* #__PURE__ */factory(name, dependencies, _ref => {
       }
 
       throw new Error('Integer BigNumber expected');
-    },
-    'Array | Matrix': function ArrayMatrix(n) {
-      return deepMap(n, this);
     }
   });
   /**

package/lib/esm/function/probability/kldivergence.js

@@ -1,6 +1,6 @@
 import { factory } from '../../utils/factory.js';
 var name = 'kldivergence';
-var dependencies = ['typed', 'matrix', 'divide', 'sum', 'multiply', 'dotDivide', 'log', 'isNumeric'];
+var dependencies = ['typed', 'matrix', 'divide', 'sum', 'multiply', 'map', 'dotDivide', 'log', 'isNumeric'];
 export var createKldivergence = /* #__PURE__ */factory(name, dependencies, _ref => {
   var {
     typed,
@@ -8,6 +8,7 @@ export var createKldivergence = /* #__PURE__ */factory(name, dependencies, _ref
     divide,
     sum,
     multiply,
+    map,
     dotDivide,
     log,
     isNumeric
@@ -75,7 +76,7 @@ export var createKldivergence = /* #__PURE__ */factory(name, dependencies, _ref
 
     var qnorm = divide(q, sum(q));
     var pnorm = divide(p, sum(p));
-    var result = sum(multiply(qnorm, log(dotDivide(qnorm, pnorm))));
+    var result = sum(multiply(qnorm, map(dotDivide(qnorm, pnorm), x => log(x))));
 
     if (isNumeric(result)) {
       return result;

package/lib/esm/function/probability/lgamma.js

@@ -10,7 +10,7 @@ var name = 'lgamma';
 var dependencies = ['Complex', 'typed'];
 export var createLgamma = /* #__PURE__ */factory(name, dependencies, _ref => {
   var {
-    Complex: _Complex,
+    Complex,
     typed
   } = _ref;
   // Stirling series is non-convergent, we need to use the recurrence `lgamma(z) = lgamma(z+1) - log z` to get
@@ -57,37 +57,37 @@ export var createLgamma = /* #__PURE__ */factory(name, dependencies, _ref => {
 
   return typed(name, {
     number: lgammaNumber,
-    Complex: function Complex(n) {
-      var TWOPI = 6.2831853071795864769252842; // 2*pi
+    Complex: lgammaComplex,
+    BigNumber: function BigNumber() {
+      throw new Error("mathjs doesn't yet provide an implementation of the algorithm lgamma for BigNumber");
+    }
+  });
 
-      var LOGPI = 1.1447298858494001741434262; // log(pi)
+  function lgammaComplex(n) {
+    var TWOPI = 6.2831853071795864769252842; // 2*pi
 
-      var REFLECTION = 0.1;
+    var LOGPI = 1.1447298858494001741434262; // log(pi)
 
-      if (n.isNaN()) {
-        return new _Complex(NaN, NaN);
-      } else if (n.im === 0) {
-        return new _Complex(lgammaNumber(n.re), 0);
-      } else if (n.re >= SMALL_RE || Math.abs(n.im) >= SMALL_IM) {
-        return lgammaStirling(n);
-      } else if (n.re <= REFLECTION) {
-        // Reflection formula. see Proposition 3.1 in [1]
-        var tmp = copysign(TWOPI, n.im) * Math.floor(0.5 * n.re + 0.25); // TODO: `complex.js sin` doesn't have extremely high precision, so this value `a` may lose a little precision,
-        // causing the computation results to be less accurate than the lgamma of real numbers
+    var REFLECTION = 0.1;
 
-        var a = n.mul(Math.PI).sin().log();
-        var b = this(new _Complex(1 - n.re, -n.im));
-        return new _Complex(LOGPI, tmp).sub(a).sub(b);
-      } else if (n.im >= 0) {
-        return lgammaRecurrence(n);
-      } else {
-        return lgammaRecurrence(n.conjugate()).conjugate();
-      }
-    },
-    BigNumber: function BigNumber() {
-      throw new Error("mathjs doesn't yet provide an implementation of the algorithm lgamma for BigNumber");
+    if (n.isNaN()) {
+      return new Complex(NaN, NaN);
+    } else if (n.im === 0) {
+      return new Complex(lgammaNumber(n.re), 0);
+    } else if (n.re >= SMALL_RE || Math.abs(n.im) >= SMALL_IM) {
+      return lgammaStirling(n);
+    } else if (n.re <= REFLECTION) {
+      // Reflection formula. see Proposition 3.1 in [1]
+      var tmp = copysign(TWOPI, n.im) * Math.floor(0.5 * n.re + 0.25);
+      var a = n.mul(Math.PI).sin().log();
+      var b = lgammaComplex(new Complex(1 - n.re, -n.im));
+      return new Complex(LOGPI, tmp).sub(a).sub(b);
+    } else if (n.im >= 0) {
+      return lgammaRecurrence(n);
+    } else {
+      return lgammaRecurrence(n.conjugate()).conjugate();
     }
-  });
+  }
 
   function lgammaStirling(z) {
     // formula ref in [2]
@@ -98,7 +98,7 @@ export var createLgamma = /* #__PURE__ */factory(name, dependencies, _ref => {
     // => (x - 0.5) * log(x) - x + log(2PI) / 2
     var leftPart = z.sub(0.5).mul(z.log()).sub(z).add(lnSqrt2PI); // right part
 
-    var rz = new _Complex(1, 0).div(z);
+    var rz = new Complex(1, 0).div(z);
     var rzz = rz.div(z);
     var a = coeffs[0];
     var b = coeffs[1];
@@ -132,6 +132,6 @@ export var createLgamma = /* #__PURE__ */factory(name, dependencies, _ref => {
       z = z.add(1);
     }
 
-    return lgammaStirling(z).sub(shiftprod.log()).sub(new _Complex(0, signflips * 2 * Math.PI * 1));
+    return lgammaStirling(z).sub(shiftprod.log()).sub(new Complex(0, signflips * 2 * Math.PI * 1));
   }
 });

package/lib/esm/function/relational/compare.js

@@ -1,11 +1,11 @@
 import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';
 import { nearlyEqual } from '../../utils/number.js';
 import { factory } from '../../utils/factory.js';
-import { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';
-import { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';
-import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
-import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
-import { createAlgorithm05 } from '../../type/matrix/utils/algorithm05.js';
+import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';
+import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
+import { createMatAlgo05xSfSf } from '../../type/matrix/utils/matAlgo05xSfSf.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+import { createCompareUnits } from './compareUnits.js';
 var name = 'compare';
 var dependencies = ['typed', 'config', 'matrix', 'equalScalar', 'BigNumber', 'Fraction', 'DenseMatrix'];
 export var createCompare = /* #__PURE__ */factory(name, dependencies, _ref => {
@@ -18,21 +18,22 @@ export var createCompare = /* #__PURE__ */factory(name, dependencies, _ref => {
     Fraction,
     DenseMatrix
   } = _ref;
-  var algorithm03 = createAlgorithm03({
+  var matAlgo03xDSf = createMatAlgo03xDSf({
     typed
   });
-  var algorithm05 = createAlgorithm05({
+  var matAlgo05xSfSf = createMatAlgo05xSfSf({
     typed,
     equalScalar
   });
-  var algorithm12 = createAlgorithm12({
+  var matAlgo12xSfs = createMatAlgo12xSfs({
     typed,
     DenseMatrix
   });
-  var algorithm13 = createAlgorithm13({
-    typed
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix
   });
-  var algorithm14 = createAlgorithm14({
+  var compareUnits = createCompareUnits({
     typed
   });
   /**
@@ -73,13 +74,13 @@ export var createCompare = /* #__PURE__ */factory(name, dependencies, _ref => {
    *                                                          1 when x > y, -1 when x < y, and 0 when x == y.
    */
 
-  return typed(name, {
+  return typed(name, createCompareNumber({
+    typed,
+    config
+  }), {
     'boolean, boolean': function booleanBoolean(x, y) {
       return x === y ? 0 : x > y ? 1 : -1;
     },
-    'number, number': function numberNumber(x, y) {
-      return nearlyEqual(x, y, config.epsilon) ? 0 : x > y ? 1 : -1;
-    },
     'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
       return bigNearlyEqual(x, y, config.epsilon) ? new BigNumber(0) : new BigNumber(x.cmp(y));
     },
@@ -88,59 +89,12 @@ export var createCompare = /* #__PURE__ */factory(name, dependencies, _ref => {
     },
     'Complex, Complex': function ComplexComplex() {
       throw new TypeError('No ordering relation is defined for complex numbers');
-    },
-    'Unit, Unit': function UnitUnit(x, y) {
-      if (!x.equalBase(y)) {
-        throw new Error('Cannot compare units with different base');
-      }
-
-      return this(x.value, y.value);
-    },
-    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
-      return algorithm05(x, y, this);
-    },
-    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
-      return algorithm03(y, x, this, true);
-    },
-    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
-      return algorithm03(x, y, this, false);
-    },
-    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
-      return algorithm13(x, y, this);
-    },
-    'Array, Array': function ArrayArray(x, y) {
-      // use matrix implementation
-      return this(matrix(x), matrix(y)).valueOf();
-    },
-    'Array, Matrix': function ArrayMatrix(x, y) {
-      // use matrix implementation
-      return this(matrix(x), y);
-    },
-    'Matrix, Array': function MatrixArray(x, y) {
-      // use matrix implementation
-      return this(x, matrix(y));
-    },
-    'SparseMatrix, any': function SparseMatrixAny(x, y) {
-      return algorithm12(x, y, this, false);
-    },
-    'DenseMatrix, any': function DenseMatrixAny(x, y) {
-      return algorithm14(x, y, this, false);
-    },
-    'any, SparseMatrix': function anySparseMatrix(x, y) {
-      return algorithm12(y, x, this, true);
-    },
-    'any, DenseMatrix': function anyDenseMatrix(x, y) {
-      return algorithm14(y, x, this, true);
-    },
-    'Array, any': function ArrayAny(x, y) {
-      // use matrix implementation
-      return algorithm14(matrix(x), y, this, false).valueOf();
-    },
-    'any, Array': function anyArray(x, y) {
-      // use matrix implementation
-      return algorithm14(matrix(y), x, this, true).valueOf();
     }
-  });
+  }, compareUnits, matrixAlgorithmSuite({
+    SS: matAlgo05xSfSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
 });
 export var createCompareNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {
   var {

package/lib/esm/function/relational/compareNatural.js

@@ -79,75 +79,79 @@ export var createCompareNatural = /* #__PURE__ */factory(name, dependencies, _re
    */
 
   return typed(name, {
-    'any, any': function anyAny(x, y) {
-      var typeX = typeOf(x);
-      var typeY = typeOf(y);
-      var c; // numeric types
+    'any, any': _compareNatural
+  }); // just to check # args
 
-      if ((typeX === 'number' || typeX === 'BigNumber' || typeX === 'Fraction') && (typeY === 'number' || typeY === 'BigNumber' || typeY === 'Fraction')) {
-        c = compare(x, y);
+  function _compareNatural(x, y) {
+    var typeX = typeOf(x);
+    var typeY = typeOf(y);
+    var c; // numeric types
 
-        if (c.toString() !== '0') {
-          // c can be number, BigNumber, or Fraction
-          return c > 0 ? 1 : -1; // return a number
-        } else {
-          return naturalSort(typeX, typeY);
-        }
-      } // matrix types
+    if ((typeX === 'number' || typeX === 'BigNumber' || typeX === 'Fraction') && (typeY === 'number' || typeY === 'BigNumber' || typeY === 'Fraction')) {
+      c = compare(x, y);
 
+      if (c.toString() !== '0') {
+        // c can be number, BigNumber, or Fraction
+        return c > 0 ? 1 : -1; // return a number
+      } else {
+        return naturalSort(typeX, typeY);
+      }
+    } // matrix types
 
-      if (typeX === 'Array' || typeX === 'Matrix' || typeY === 'Array' || typeY === 'Matrix') {
-        c = compareMatricesAndArrays(this, x, y);
 
-        if (c !== 0) {
-          return c;
-        } else {
-          return naturalSort(typeX, typeY);
-        }
-      } // in case of different types, order by name of type, i.e. 'BigNumber' < 'Complex'
+    var matTypes = ['Array', 'DenseMatrix', 'SparseMatrix'];
 
+    if (matTypes.includes(typeX) || matTypes.includes(typeY)) {
+      c = compareMatricesAndArrays(_compareNatural, x, y);
 
-      if (typeX !== typeY) {
+      if (c !== 0) {
+        return c;
+      } else {
         return naturalSort(typeX, typeY);
       }
+    } // in case of different types, order by name of type, i.e. 'BigNumber' < 'Complex'
 
-      if (typeX === 'Complex') {
-        return compareComplexNumbers(x, y);
-      }
-
-      if (typeX === 'Unit') {
-        if (x.equalBase(y)) {
-          return this(x.value, y.value);
-        } // compare by units
 
+    if (typeX !== typeY) {
+      return naturalSort(typeX, typeY);
+    }
 
-        return compareArrays(this, x.formatUnits(), y.formatUnits());
-      }
+    if (typeX === 'Complex') {
+      return compareComplexNumbers(x, y);
+    }
 
-      if (typeX === 'boolean') {
-        return compareBooleans(x, y);
-      }
+    if (typeX === 'Unit') {
+      if (x.equalBase(y)) {
+        return _compareNatural(x.value, y.value);
+      } // compare by units
 
-      if (typeX === 'string') {
-        return naturalSort(x, y);
-      }
 
-      if (typeX === 'Object') {
-        return compareObjects(this, x, y);
-      }
+      return compareArrays(_compareNatural, x.formatUnits(), y.formatUnits());
+    }
 
-      if (typeX === 'null') {
-        return 0;
-      }
+    if (typeX === 'boolean') {
+      return compareBooleans(x, y);
+    }
 
-      if (typeX === 'undefined') {
-        return 0;
-      } // this should not occur...
+    if (typeX === 'string') {
+      return naturalSort(x, y);
+    }
 
+    if (typeX === 'Object') {
+      return compareObjects(_compareNatural, x, y);
+    }
 
-      throw new TypeError('Unsupported type of value "' + typeX + '"');
+    if (typeX === 'null') {
+      return 0;
     }
-  });
+
+    if (typeX === 'undefined') {
+      return 0;
+    } // this should not occur...
+
+
+    throw new TypeError('Unsupported type of value "' + typeX + '"');
+  }
   /**
    * Compare mixed matrix/array types, by converting to same-shaped array.
    * This comparator is non-deterministic regarding input types.
@@ -156,6 +160,7 @@ export var createCompareNatural = /* #__PURE__ */factory(name, dependencies, _re
    * @returns {number} Returns the comparison result: -1, 0, or 1
    */
 
+
   function compareMatricesAndArrays(compareNatural, x, y) {
     if (isSparseMatrix(x) && isSparseMatrix(y)) {
       return compareArrays(compareNatural, x.toJSON().values, y.toJSON().values);

package/lib/esm/function/relational/compareText.js

@@ -1,19 +1,17 @@
 import { compareText as _compareText } from '../../utils/string.js';
 import { factory } from '../../utils/factory.js';
-import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
-import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
 var name = 'compareText';
 var dependencies = ['typed', 'matrix'];
+_compareText.signature = 'any, any';
 export var createCompareText = /* #__PURE__ */factory(name, dependencies, _ref => {
   var {
     typed,
     matrix
   } = _ref;
-  var algorithm13 = createAlgorithm13({
-    typed
-  });
-  var algorithm14 = createAlgorithm14({
-    typed
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix
   });
   /**
    * Compare two strings lexically. Comparison is case sensitive.
@@ -44,44 +42,14 @@ export var createCompareText = /* #__PURE__ */factory(name, dependencies, _ref =
    *                                        1 when x > y, -1 when x < y, and 0 when x == y.
    */
 
-  return typed(name, {
-    'any, any': _compareText,
-    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
-      return algorithm13(x, y, _compareText);
-    },
-    'Array, Array': function ArrayArray(x, y) {
-      // use matrix implementation
-      return this(matrix(x), matrix(y)).valueOf();
-    },
-    'Array, Matrix': function ArrayMatrix(x, y) {
-      // use matrix implementation
-      return this(matrix(x), y);
-    },
-    'Matrix, Array': function MatrixArray(x, y) {
-      // use matrix implementation
-      return this(x, matrix(y));
-    },
-    'DenseMatrix, any': function DenseMatrixAny(x, y) {
-      return algorithm14(x, y, _compareText, false);
-    },
-    'any, DenseMatrix': function anyDenseMatrix(x, y) {
-      return algorithm14(y, x, _compareText, true);
-    },
-    'Array, any': function ArrayAny(x, y) {
-      // use matrix implementation
-      return algorithm14(matrix(x), y, _compareText, false).valueOf();
-    },
-    'any, Array': function anyArray(x, y) {
-      // use matrix implementation
-      return algorithm14(matrix(y), x, _compareText, true).valueOf();
-    }
-  });
+  return typed(name, _compareText, matrixAlgorithmSuite({
+    elop: _compareText,
+    Ds: true
+  }));
 });
 export var createCompareTextNumber = /* #__PURE__ */factory(name, ['typed'], _ref2 => {
   var {
     typed
   } = _ref2;
-  return typed(name, {
-    'any, any': _compareText
-  });
+  return typed(name, _compareText);
 });

package/lib/esm/function/relational/compareUnits.js

@@ -0,0 +1,15 @@
+import { factory } from '../../utils/factory.js';
+export var createCompareUnits = /* #__PURE__ */factory('compareUnits', ['typed'], _ref => {
+  var {
+    typed
+  } = _ref;
+  return {
+    'Unit, Unit': typed.referToSelf(self => (x, y) => {
+      if (!x.equalBase(y)) {
+        throw new Error('Cannot compare units with different base');
+      }
+
+      return typed.find(self, [x.valueType(), y.valueType()])(x.value, y.value);
+    })
+  };
+});