@cortex-js/compute-engine 0.12.0 → 0.12.2

package/dist/compute-engine.esm.js

@@ -1,4 +1,4 @@
-/** CortexJS Compute Engine 0.12.0 */
+/** CortexJS Compute Engine 0.12.2 */
 /** @internal */
 function isSymbolEntry(entry) {
     return !('kind' in entry) || entry.kind === 'symbol';
@@ -14267,12 +14267,21 @@ function bigint(a) {
     return BigInt(s);
 }
 function gcd(a, b) {
-    while (b !== 0n)
+    while (b !== BigInt(0))
         [a, b] = [b, a % b];
-    return a < 0n ? -a : a;
+    return a < 0 ? -a : a;
 }
 // Difference between primes from 7 to 31
-const PRIME_WHEEL_INC = [4n, 2n, 4n, 2n, 4n, 6n, 2n, 6n];
+const PRIME_WHEEL_INC = [
+    BigInt(4),
+    BigInt(2),
+    BigInt(4),
+    BigInt(2),
+    BigInt(4),
+    BigInt(6),
+    BigInt(2),
+    BigInt(6),
+];
 function primeFactors(d) {
     if (d < Number.MAX_SAFE_INTEGER) {
         const factors = primeFactors$1(Number(d));
@@ -14289,24 +14298,24 @@ function primeFactors(d) {
     let count2 = 0;
     let count3 = 0;
     let count5 = 0;
-    let k = 10n;
-    while (n % k === 0n) {
+    let k = BigInt(10);
+    while (n % k === BigInt(0)) {
         count2 += 1;
         count5 += 1;
         n = n / k;
     }
-    k = 5n;
-    while (n % k === 0n) {
+    k = BigInt(5);
+    while (n % k === BigInt(0)) {
         count5 += 1;
         n = n / k;
     }
-    k = 3n;
-    while (n % k === 0n) {
+    k = BigInt(3);
+    while (n % k === BigInt(0)) {
         count3 += 1;
         n = n / k;
     }
-    k = 2n;
-    while (n % k === 0n) {
+    k = BigInt(2);
+    while (n % k === BigInt(0)) {
         count2 += 1;
         n = n / k;
     }
@@ -14316,11 +14325,11 @@ function primeFactors(d) {
         result.set('3', count3);
     if (count5 > 0)
         result.set('5', count5);
-    k = 7n;
+    k = BigInt(7);
     let kIndex = '';
     let i = 0;
     while (k * k < n) {
-        if (n % k === 0n) {
+        if (n % k === BigInt(0)) {
             if (!kIndex)
                 kIndex = k.toString();
             result.set(kIndex, (result.get(kIndex) ?? 0) + 1);
@@ -14332,7 +14341,7 @@ function primeFactors(d) {
             i = i < 7 ? i + 1 : 0;
         }
     }
-    if (n !== 1n)
+    if (n !== BigInt(1))
         result.set(n.toString(), (result.get(n.toString()) ?? 0) + 1);
     const r = new Map();
     for (const [k, v] of result)
@@ -14348,8 +14357,8 @@ function primeFactors(d) {
 function factorPower(n, exponent) {
     // @todo: handle negative n
     const factors = primeFactors(n);
-    let f = 1n;
-    let r = 1n;
+    let f = BigInt(1);
+    let r = BigInt(1);
     const exp = bigint(exponent);
     for (const [k, v] of factors) {
         const v2 = bigint(v);
@@ -14703,7 +14712,7 @@ function asRational(expr) {
     if (typeof num === 'number' && Number.isInteger(num))
         return [num, 1];
     if (num instanceof Decimal && num.isInteger())
-        return [bigint(num), 1n];
+        return [bigint(num), BigInt(1)];
     return undefined;
 }
 function asMachineRational(r) {
@@ -14815,7 +14824,7 @@ function reducedRational(r) {
         //  If the gcd is 0, return the rational unchanged
         return g <= 1 ? r : [r[0] / g, r[1] / g];
     }
-    if (r[0] === 1n || r[1] === 1n)
+    if (r[0] === BigInt(1) || r[1] === BigInt(1))
         return r;
     if (r[1] < 0)
         r = [-r[0], -r[1]];
@@ -14977,7 +14986,7 @@ function asCoefficient(expr) {
     if (n !== null) {
         if (n instanceof Decimal) {
             if (n.isInteger())
-                return [[bigint(n.toString()), 1n], ce._ONE];
+                return [[bigint(n.toString()), BigInt(1)], ce._ONE];
             if (n.isNegative())
                 return [[-1, 1], ce.number(n.neg())];
         }
@@ -16414,7 +16423,7 @@ class Product {
         this._isCanonical = options.canonical;
         this.engine = ce;
         this._sign = 1;
-        this._rational = bignumPreferred(ce) ? [1n, 1n] : [1, 1];
+        this._rational = bignumPreferred(ce) ? [BigInt(1), BigInt(1)] : [1, 1];
         // this._squareRootRational = this._rational;
         this._complex = Complex.ONE;
         this._bignum = ce._BIGNUM_ONE;
@@ -16492,7 +16501,7 @@ class Product {
                         num = num.neg();
                     }
                     if (num.isInteger())
-                        this._rational = mul(this._rational, [bigint(num), 1n]);
+                        this._rational = mul(this._rational, [bigint(num), BigInt(1)]);
                     else if (bignumPreferred(this.engine))
                         this._bignum = this._bignum.mul(num);
                     else
@@ -18958,7 +18967,7 @@ class BoxedNumber extends AbstractBoxedExpression {
             console.assert(typeof n !== 'number' ||
                 (Number.isInteger(n) && Number.isInteger(d) && d !== n && d !== 1));
             console.assert(!(typeof n === 'bigint' && typeof d == 'bigint') ||
-                (d !== n && d !== 1n));
+                (d !== n && d !== BigInt(1)));
             if (options?.canonical ?? true) {
                 this._value = canonicalNumber(ce, value);
                 this._isCanonical = true;
@@ -19378,10 +19387,10 @@ function canonicalNumber(ce, value) {
         else {
             if (d < 0)
                 [n, d] = [-n, -d];
-            if (d === 1n)
+            if (d === BigInt(1))
                 return ce.bignum(n);
-            if (d === 0n) {
-                if (n === 0n)
+            if (d === BigInt(0)) {
+                if (n === d)
                     return NaN;
                 return n < 0 ? -Infinity : +Infinity;
             }
@@ -19539,12 +19548,12 @@ function boxNumber(ce, num, options) {
         const [n, d] = num;
         if (typeof n === 'bigint' && typeof d === 'bigint') {
             if (n === d)
-                return d === 0n ? ce._NAN : ce._ONE;
-            if (d === 1n)
+                return d === BigInt(0) ? ce._NAN : ce._ONE;
+            if (d === BigInt(1))
                 return ce.number(n, options);
-            if (d === -1n)
+            if (d === BigInt(-1))
                 return ce.number(-n, options);
-            if (n === 1n && d === 2n)
+            if (n === BigInt(1) && d === BigInt(2))
                 return ce._HALF;
             return new BoxedNumber(ce, [n, d], options);
         }
@@ -19935,7 +19944,7 @@ class Sum {
             options.canonical = true;
         this._isCanonical = options.canonical;
         this.engine = ce;
-        this._rational = bignumPreferred(ce) ? [0n, 1n] : [0, 1];
+        this._rational = bignumPreferred(ce) ? [BigInt(0), BigInt(1)] : [0, 1];
         this._bignum = ce._BIGNUM_ZERO;
         this._number = 0;
         if (xs)
@@ -21257,7 +21266,7 @@ function evalSummation(ce, expr, range, mode) {
         ce.context = savedContext;
         return ce.add(terms).evaluate();
     }
-    let sum = bignumPreferred(ce) ? [1n, 1n] : [0, 1];
+    let sum = bignumPreferred(ce) ? [BigInt(1), BigInt(1)] : [0, 1];
     if (!fn.scope)
         for (let i = lower; i <= upper; i++) {
             const term = fn.N();
@@ -21585,7 +21594,7 @@ function numEvalPower(ce, base, exponent) {
 }
 function processPower(ce, base, exponent, mode) {
     if (base.head === 'Multiply') {
-        let c = bignumPreferred(ce) ? [1n, 1n] : [1, 1];
+        let c = bignumPreferred(ce) ? [BigInt(1), BigInt(1)] : [1, 1];
         const xs = [];
         for (const op of base.ops) {
             const r = asRational(op);
@@ -21645,12 +21654,15 @@ function processPower(ce, base, exponent, mode) {
                         return ce._NAN;
                     const sign = bigBase < 0 ? (d % 2 === 0 ? ce._I : ce._NEGATIVE_ONE) : ce._ONE;
                     const [factor, root] = factorPower(bigBase > 0 ? bigBase : -bigBase, d);
-                    if (root === 1n && factor === 1n)
+                    if (root === BigInt(1) && factor === BigInt(1))
                         return sign;
                     // If factor === 1, nothing special to do, fall through
-                    if (factor !== 1n) {
-                        if (root === 1n)
-                            return ce.mul([sign, ce.number(n >= 0 ? factor : [1n, factor])]);
+                    if (factor !== BigInt(1)) {
+                        if (root === BigInt(1))
+                            return ce.mul([
+                                sign,
+                                ce.number(n >= 0 ? factor : [BigInt(1), factor]),
+                            ]);
                         return ce.mul([
                             sign,
                             ce.number(factor),
@@ -21823,25 +21835,20 @@ function simplifyMultiply(ce, ops) {
     }
     return product.asExpression();
 }
-function fastEvalMultiply(ops) {
-    let prod = 1;
-    for (const op of ops) {
-        if (typeof op.numericValue !== 'number')
-            return null;
-        prod *= op.numericValue;
-    }
-    return prod;
-}
 function evalMultiply(ce, ops, mode = 'evaluate') {
     console.assert(ops.length > 1, 'evalMultiply(): no arguments');
     //
     // @fastpath
     //
-    if (mode === 'N' && ce.numericMode === 'machine') {
+    if (mode === 'N') {
         ops = ops.map((x) => x.N());
-        const result = fastEvalMultiply(ops);
-        if (result !== null)
-            return ce.number(result);
+        if (ce.numericMode === 'machine' &&
+            ops.every((x) => typeof x.numericValue === 'number')) {
+            let prod = 1;
+            for (const op of ops)
+                prod *= op.numericValue;
+            return ce.number(prod);
+        }
     }
     //
     // First pass: looking for early exits
@@ -21931,9 +21938,8 @@ function multiply2(op1, op2, metadata) {
             return ce._fn('Multiply', [c, t], metadata);
         }
     }
-    if (c.hash === t.hash && c.isSame(t)) {
+    if (c.hash === t.hash && c.isSame(t))
         return square(ce, c);
-    }
     const product = new Product(ce, [c, t]);
     if (sign > 0)
         return product.asExpression();
@@ -22009,7 +22015,7 @@ function evalMultiplication(ce, expr, range, mode) {
         const product = ce.mul(terms);
         return mode === 'simplify' ? product.simplify() : product.evaluate();
     }
-    let product = bignumPreferred(ce) ? [1n, 1n] : [1, 1];
+    let product = bignumPreferred(ce) ? [BigInt(1), BigInt(1)] : [1, 1];
     for (let i = lower; i <= upper; i++) {
         const n = ce.number(i);
         const r = fn.subs({ _1: n, _: n });
@@ -27990,7 +27996,7 @@ class ComputeEngine {
             // Is the denominator 1?
             if (isMachineRational(exponent) && exponent[1] === 1)
                 e = exponent[0];
-            else if (isBigRational(exponent) && exponent[1] === 1n)
+            else if (isBigRational(exponent) && exponent[1] === BigInt(1))
                 e = Number(exponent[0]);
         }
         // x^1
@@ -28002,7 +28008,7 @@ class ComputeEngine {
             if (typeof r === 'number' && Number.isInteger(r))
                 return this.number([1, r]);
             else if (r instanceof Decimal && r.isInteger())
-                return this.number([1n, bigint(r)]);
+                return this.number([BigInt(1), bigint(r)]);
             else if (isRational(r))
                 return this.number([r[1], r[0]]);
         }
@@ -28025,7 +28031,7 @@ class ComputeEngine {
             if (typeof n === 'number' && Number.isInteger(n))
                 return this.number([1, n], { metadata });
             if (n instanceof Decimal && n.isInteger())
-                return this.number([1n, bigint(n)], { metadata });
+                return this.number([BigInt(1), bigint(n)], { metadata });
             return this._fn('Divide', [this._ONE, expr], metadata);
         }
         if (expr.head === 'Sqrt')
@@ -28136,11 +28142,11 @@ class ComputeEngine {
         //
         if (options.metadata === undefined) {
             if (typeof value === 'bigint') {
-                if (value === 1n)
+                if (value === BigInt(1))
                     return this._ONE;
-                if (value === 0n)
+                if (value === BigInt(0))
                     return this._ZERO;
-                if (value === -1n)
+                if (value === BigInt(-1))
                     return this._NEGATIVE_ONE;
             }
             if (typeof value === 'number') {
@@ -28343,6 +28349,10 @@ class ComputeEngine {
 }
 
 // This file is the root of the `compute-engine` package
-const version = '0.12.0';
+const version = '0.12.2';
+globalThis[Symbol.for('io.cortexjs.compute-engine')] = {
+    ComputeEngine: ComputeEngine.prototype.constructor,
+    version: '0.12.2',
+};
 
 export { ComputeEngine, isEnvironmentEntry, isFunctionEntry, isInfixEntry, isMatchfixEntry, isPostfixEntry, isPrefixEntry, isSymbolEntry, version };