powiaina_num.js 0.2.0-alpha.3.2 → 0.2.0-alpha.3.3

package/dist/index.js

@@ -4,7 +4,7 @@ const MSI_LOG10 = 15.954589770191003;
 const MSI_REC = 1.1102230246251568e-16;
 const LONG_STRING_MIN_LENGTH = 17;
 const EXP_E_REC = 1.444667861009766;
-const isPowiainaNum = /^(PN)?\/*[-\+]*(Infinity|NaN|(10(\^+|\{([1-9]\d*|!)(,([1-9]\d*|!))?(,[1-9]\d*)?\})|\(10(\^+|\{([1-9]\d*|!)(,([1-9]\d*|!))?(,[1-9]\d*)?\})\)\^[1-9]\d*\x20*)*((\d+(\.\d*)?|\d*\.\d+)?([Ee][-\+]*))*(0|\d+(\.\d*)?|\d*\.\d+))$/;
+const isPowiainaNum = /^(PN)?[\/\-\+]*(Infinity|NaN|(10(\^+|\{([1-9]\d*|!)(,([1-9]\d*|!))?(,[1-9]\d*)?\})|\(10(\^+|\{([1-9]\d*|!)(,([1-9]\d*|!))?(,[1-9]\d*)?\})\)\^[1-9]\d*\x20*)*((\d+(\.\d*)?|\d*\.\d+)?([Ee][-\+]*))*(0|\d+(\.\d*)?|\d*\.\d+))$/;
 function newOperator(r, a = 0, e = 1, m = 1) {
     return {
         repeat: r,
@@ -175,6 +175,12 @@ function countLeadingZerosAfterDecimal(numStr) {
     const match = numStr.match(/^0\.(0*)[1-9]/);
     return match ? match[1].length : 0;
 }
+/*
+function countLeadingZerosAfterDecimal(numStr) {
+    const match = numStr.match(/^0\.(0*)[1-9]/);
+    return match ? match[1].length : 0;
+}
+*/
 //from https://github.com/scipy/scipy/blob/8dba340293fe20e62e173bdf2c10ae208286692f/scipy/special/lambertw.pxd
 // The evaluation can become inaccurate very close to the branch point
 // at ``-1/e``. In some corner cases, `lambertw` might currently
@@ -217,6 +223,10 @@ function d_lambertw(z, t = 1e-10, pr = true) {
     throw Error("Iteration failed to converge: ".concat(z.toString())); //return Decimal.dNaN;
 }
 class PowiainaNum {
+    /**
+     * Constructor of PowiainaNum class,
+     * If no arguments, return `PowiainaNum.NaN`.
+     */
     constructor(arg1) {
         this.array = [{ arrow: 0, expans: 1, megota: 1, repeat: NaN }];
         this.small = false;
@@ -274,6 +284,10 @@ class PowiainaNum {
                 return a.eq(b);
             })())
             return PowiainaNum.ZERO.clone();
+        // Run pure number calculates in there
+        if (x.abs().lt(MSI) && y.abs().lt(MSI)) {
+            return PowiainaNum.fromNumber(x.toNumber() + y.toNumber());
+        }
         // calculate anything > e9e15 or <e-9e15, take absval bigger.
         if (x.abs().lt(PowiainaNum.E_MSI_REC) ||
             x.abs().gt(PowiainaNum.E_MSI) ||
@@ -389,6 +403,9 @@ class PowiainaNum {
     static div(t, other) {
         return new PowiainaNum(t).div(other);
     }
+    /**
+     * @returns 10 to the power of `this`
+     */
     pow10() {
         var _a, _b;
         const r = this.clone();
@@ -408,6 +425,8 @@ class PowiainaNum {
                 return PowiainaNum.ONE;
             return new PowiainaNum(Math.pow(10, (Math.pow(r.array[0].repeat, -1))));
         }
+        if (r.gt(PowiainaNum.TETRATED_MSI))
+            return r;
         r.setOperator(((_b = (_a = r.array[1]) === null || _a === void 0 ? void 0 : _a.repeat) !== null && _b !== void 0 ? _b : 0) + 1, 1);
         r.normalize();
         return r;
@@ -463,7 +482,7 @@ class PowiainaNum {
         return new PowiainaNum(t).sqrt();
     }
     cbrt() {
-        return this.root(3);
+        return this.abs().root(3).mul(this.sign);
     }
     static cbrt(t) {
         return new PowiainaNum(t).cbrt();
@@ -600,13 +619,21 @@ class PowiainaNum {
             r += l;
             x.setOperator(x.getOperator(1) - l, 1);
         }
-        for (let i = 0; i < 100; ++i) {
-            if (x.lte(PowiainaNum.ONE))
-                return new PowiainaNum(r + x.toNumber());
-            ++r;
-            x = PowiainaNum.log(x, base);
+        for (var i = 0; i < 100; ++i) {
+            if (x.lt(PowiainaNum.ZERO)) {
+                x = PowiainaNum.pow(base, x);
+                --r;
+            }
+            else if (x.lte(1)) {
+                return new PowiainaNum(r + x.toNumber() - 1);
+            }
+            else {
+                ++r;
+                x = PowiainaNum.log(x, base);
+            }
         }
-        console.warn("Failed to converage");
+        if (x.gt(10))
+            return new PowiainaNum(r);
         return PowiainaNum.NaN.clone();
     }
     static tetrate(t, other2, payload = 1) {
@@ -630,6 +657,8 @@ class PowiainaNum {
         }
         if (this.array.length == 1)
             return new PowiainaNum(Math.log10(this.array[0].repeat));
+        if (this.gte(PowiainaNum.TETRATED_MSI))
+            return this.clone();
         let x = this.clone();
         x.array[1].repeat = x.array[1].repeat - 1;
         x.normalize();
@@ -649,6 +678,38 @@ class PowiainaNum {
     ln() {
         return this.log();
     }
+    /**
+     * plog10, beware unexpected errors.
+     */
+    plog10() {
+        return this.max(1).log10();
+    }
+    /**
+     * plog10, beware unexpected errors.
+     */
+    static plog10(t) {
+        return new PowiainaNum(t).plog10();
+    }
+    /**
+     * plog, beware unexpected errors.
+     */
+    plog(base = Math.E) {
+        // log_a b = log_x b / log_x a;
+        const other = new PowiainaNum(base);
+        return this.plog10().div(other.plog10());
+    }
+    /**
+     * plog, beware unexpected errors.
+     */
+    static plog(t, base = Math.E) {
+        return new PowiainaNum(t).plog(base);
+    }
+    /**
+     * pln, beware unexpected errors.
+     */
+    pln() {
+        return this.plog();
+    }
     static exp(x) {
         let y = new PowiainaNum(x);
         return y.pow_base(Math.E);
@@ -757,7 +818,7 @@ class PowiainaNum {
             else if (this.small) {
                 return PowiainaNum.fromNumber(f_lambertw(this.toNumber()));
             }
-            else if (this.layer === 0) {
+            else if (this.lt(MSI)) {
                 return PowiainaNum.fromNumber(f_lambertw(this.sign * this.getOperator(0)));
             }
             else if (this.lt("eee15")) {
@@ -821,21 +882,160 @@ class PowiainaNum {
         // 2--3, 1e10-<e1e10, 10^10^10^0->1
         return PowiainaNum.NaN.clone();*/
     }
-    max(x) {
-        const other = new PowiainaNum(x);
-        return this.lt(other) ? other.clone() : this.clone();
+    arrow(arrows2) {
+        const t = this.clone();
+        const arrows = new PowiainaNum(arrows2);
+        if (!arrows.isInt() || arrows.lt(PowiainaNum.ZERO)) {
+            console.warn("The arrow is <0 or not a integer, the returned function will return NaN.");
+            return function () { return PowiainaNum.NaN.clone(); };
+        }
+        if (arrows.eq(0))
+            return function (other) { return t.mul(other); };
+        if (arrows.eq(1))
+            return function (other) { return t.pow(other); };
+        if (arrows.eq(2))
+            return function (other) { return t.tetrate(other); };
+        return function (other2, depth = 0) {
+            const other = new PowiainaNum(other2);
+            let ctt = PowiainaNum.arrowFuncMap.get(`${t.toString()} ${arrows.toString()} ${other.toString()}`);
+            if (ctt)
+                return ctt.clone();
+            let res = (function () {
+                let r;
+                if (t.isNaN() || other.isNaN())
+                    return PowiainaNum.NaN.clone();
+                if (other.lt(PowiainaNum.ZERO))
+                    return PowiainaNum.NaN.clone();
+                if (t.eq(PowiainaNum.ZERO)) {
+                    if (other.eq(PowiainaNum.ONE))
+                        return PowiainaNum.ZERO.clone();
+                    return PowiainaNum.NaN.clone();
+                }
+                if (t.eq(PowiainaNum.ONE))
+                    return PowiainaNum.ONE.clone();
+                if (other.eq(PowiainaNum.ZERO))
+                    return PowiainaNum.ONE.clone();
+                if (other.eq(PowiainaNum.ONE))
+                    return t.clone();
+                // arrow > 9e15, that using 10{x}, x=arrow;
+                if (arrows.gt(PowiainaNum.MSI)) {
+                    r = arrows.clone();
+                    r.setOperator(r.getOperator(Infinity) + 1, Infinity);
+                    return r;
+                }
+                let arrowsNum = arrows.toNumber();
+                // arrow < 9e15
+                // 10{x}2 = 10{x-1}10
+                if (other.eq(2))
+                    return t.arrow(arrowsNum - 1)(t, depth + 1);
+                if (t.max(other).gt(PowiainaNum.arrowMSI(arrowsNum + 1)))
+                    return t.max(other);
+                if (t.gt(PowiainaNum.arrowMSI(arrowsNum)) || other.gt(MSI)) {
+                    if (t.gt(PowiainaNum.arrowMSI(arrowsNum))) {
+                        r = t.clone();
+                        r.setOperator(r.getOperator(arrowsNum) - 1, arrowsNum);
+                        r.normalize();
+                    }
+                    else if (t.gt(PowiainaNum.arrowMSI(arrowsNum - 1))) {
+                        r = new PowiainaNum(t.getOperator(arrowsNum - 1));
+                    }
+                    else {
+                        r = PowiainaNum.ZERO;
+                    }
+                    var j = r.add(other);
+                    j.setOperator(j.getOperator(arrowsNum) + 1, arrowsNum);
+                    j.normalize();
+                    return j;
+                }
+                if (depth >= PowiainaNum.maxOps + 10) {
+                    return new PowiainaNum([[0, 10], [arrowsNum, 1]]);
+                }
+                const y = other.toNumber();
+                let f = Math.floor(y);
+                const arrows_m1 = arrows.sub(PowiainaNum.ONE);
+                r = t.arrow(arrows_m1)(y - f, depth + 1);
+                let i = 0;
+                for (let m = PowiainaNum.arrowMSI(arrowsNum - 1); f !== 0 && r.lt(m) && i < 100; i++) {
+                    if (f > 0) {
+                        r = t.arrow(arrows_m1)(r, depth + 1);
+                        --f;
+                    }
+                }
+                if (i == 100)
+                    f = 0;
+                r.setOperator(r.getOperator(arrowsNum - 1) + f, arrowsNum - 1);
+                r.normalize();
+                return r;
+            })();
+            if (depth < PowiainaNum.maxOps + 10) {
+                PowiainaNum.arrowFuncMap.set(`${t.toString()} ${arrows.toString()} ${other.toString()}`, res.clone());
+            }
+            return res;
+        };
     }
-    min(x) {
-        const other = new PowiainaNum(x);
-        return this.gte(other) ? other.clone() : this.clone();
+    chain(other, arrows) {
+        return this.arrow(arrows)(other);
     }
-    maxabs(x) {
-        const other = new PowiainaNum(x).abs();
-        return this.abs().lt(other) ? other.clone() : this.clone();
+    /**
+     * Select the largest number of arguments.
+     */
+    static max(...args) {
+        let max = PowiainaNum.NEGATIVE_INFINITY;
+        for (let i = 0; i < args.length; i++) {
+            if (max.lt(args[i])) {
+                max = new PowiainaNum(args[i]).clone();
+            }
+        }
+        return max;
     }
-    minabs(x) {
-        const other = new PowiainaNum(x).abs();
-        return this.abs().gt(other) ? other.clone() : this.clone();
+    /**
+     * Select the smallest number of arguments.
+     */
+    static min(...args) {
+        let max = PowiainaNum.POSITIVE_INFINITY;
+        for (let i = 0; i < args.length; i++) {
+            if (max.gt(args[i])) {
+                max = new PowiainaNum(args[i]).clone();
+            }
+        }
+        return max;
+    }
+    /**
+     * Restrict a number be not lower than a number
+     *
+     * It's also an alias of `PowiainaNum.max`.
+     * @returns restricted number
+     */
+    static clampMin(...args) {
+        return PowiainaNum.max(...args);
+    }
+    /**
+     * Restrict a number be not higher than a number
+     *
+     * It's also an alias of `PowiainaNum.min`.
+     * @returns restricted number
+     */
+    static clampMax(...args) {
+        return PowiainaNum.min(...args);
+    }
+    max(...args) {
+        return PowiainaNum.max(this, ...args);
+    }
+    min(...args) {
+        return PowiainaNum.min(this, ...args);
+    }
+    /**
+     * Compare what PowiainaNum's absolute value is max
+     * @param args
+     * @returns absolute value max number's absolute value
+     */
+    maxabs(...args) {
+        const other = args.map((x) => new PowiainaNum(x).abs());
+        return PowiainaNum.max(this.abs(), ...other);
+    }
+    minabs(...args) {
+        const other = args.map((x) => new PowiainaNum(x).abs());
+        return PowiainaNum.min(this.abs(), ...other);
     }
     cmpabs(x) {
         const other = new PowiainaNum(x).abs();
@@ -977,6 +1177,9 @@ class PowiainaNum {
         let t = this.cmp(other);
         return t == 0 || t == 1;
     }
+    static sign(a) {
+        return new PowiainaNum(a).sign;
+    }
     isNaN() {
         return isNaN(this.getOperator(0));
     }
@@ -1111,7 +1314,7 @@ class PowiainaNum {
                 this.setOperator(Math.pow(10, this.getOperator(0)), 0);
                 renormalize = true;
             }
-            if (this.getOperator(0) > MSI) {
+            if (this.getOperator(0) > MSI && !isFinite(this.getOperator(0))) {
                 this.setOperator(this.getOperator(1) + 1, 1);
                 this.setOperator(Math.log10(this.getOperator(0)), 0);
                 renormalize = true;
@@ -1159,6 +1362,9 @@ class PowiainaNum {
         } while (renormalize);
         return this;
     }
+    static arrowMSI(arrowsNum) {
+        return new PowiainaNum(`10${arrowsNum}${MSI}`);
+    }
     /**
      * @returns number will return the index of the operator in array. return as x.5 if it's between the xth and x+1th operators.
      */
@@ -1349,23 +1555,12 @@ class PowiainaNum {
                 a = true;
             }
             if (!a) {
-                /**
-                 * Possible forms:
-                 * 1.33e-114514
-                 * 0.000000114514e-114514
-                 * 0.00....00114514e-1919810
-                 *
-                 * 0.0000000...0000000114514
-                 * 100000.....000000e-1919810
-                 * TODO: 1.0000e-1000000....00000
-                 */
                 let m = input.search(/e/);
-                let exponent = input.substring((m == -2 ? input.length : m) + 1);
-                let mantissa = input.substring(0, m == -2 ? undefined : m);
+                let exponent = input.substring((m == -1 ? input.length : m) + 1);
+                let mantissa = input.substring(0, m == -1 ? undefined : m);
                 let mantissaME = [0, 0];
                 // Handle mantissa to ME
                 mantissaME[1] = Number(exponent ? exponent : "0");
-                console.log(mantissa);
                 // Is regular number gte 1:
                 if (Number(mantissa) >= 1) {
                     // check The mantissa is very long?
@@ -1374,14 +1569,12 @@ class PowiainaNum {
                     let log10float = log10mant - log10int;
                     mantissaME[0] = Math.pow(10, log10float);
                     mantissaME[1] += log10float;
-                    console.log(mantissaME);
                 }
                 else {
                     // If not , count how many zeros until reached non-zero numbers
                     let zeros = countLeadingZerosAfterDecimal(mantissa);
                     mantissa = mantissa.substring(mantissa.search(/[1-9]/));
-                    console.log(mantissa);
-                    mantissa = mantissa[0].charAt(0) + "." + mantissa.substring(1);
+                    mantissa = mantissa.charAt(0) + "." + mantissa.substring(1);
                     zeros += 1;
                     mantissaME[0] = Number(mantissa);
                     mantissaME[1] += -zeros;
@@ -1389,7 +1582,6 @@ class PowiainaNum {
                 // We'll get [a, b] which respents a*10^b;
                 // actually b < 0; So we can ^-1
                 // /((a*10^b)^-1) = /(a^-1*10^-b) = /(a^-1 * 10 * 10^(-b-1))
-                console.log(mantissaME);
                 return PowiainaNum.pow(10, -mantissaME[1] - 1).mul(Math.pow(mantissaME[0], -1) * 10).rec();
             }
             if (isFinite(res) && a) {
@@ -1623,7 +1815,7 @@ class PowiainaNum {
         }
     }
     /**
-     * A property arary value for version 0.1.x PowiainaNum.
+     * A property array value for version 0.1.x PowiainaNum.
      */
     get arr01() {
         let res = [0];
@@ -1646,6 +1838,9 @@ class PowiainaNum {
         return res;
     }
 }
+/**
+ * Zero
+ */
 PowiainaNum.ZERO = new PowiainaNum({
     array: [
         {
@@ -1659,6 +1854,9 @@ PowiainaNum.ZERO = new PowiainaNum({
     layer: 0,
     sign: 0,
 });
+/**
+ * One
+ */
 PowiainaNum.ONE = new PowiainaNum({
     array: [
         {
@@ -1672,12 +1870,22 @@ PowiainaNum.ONE = new PowiainaNum({
     layer: 0,
     sign: 1,
 });
+/**
+ * The value of the largest integer n such that n and n + 1 are both
+ * exactly representable as a Number value = 9007199254740991 = 2^53 − 1.
+ */
 PowiainaNum.MSI = new PowiainaNum(MSI);
+/**
+ * MSI's reciprocate value, = 1/9007199254740991.
+ */
 PowiainaNum.MSI_REC = (function () {
     let obj = new PowiainaNum(MSI);
     obj.small = true;
     return obj;
 })();
+/**
+ * 10^(MSI) = 10^9007199254740991.
+ */
 PowiainaNum.E_MSI = new PowiainaNum({
     array: [
         {
@@ -1692,6 +1900,9 @@ PowiainaNum.E_MSI = new PowiainaNum({
     layer: 0,
     sign: 1,
 });
+/**
+ * 10^(MSI) 's reciprocate value, = 10^-9007199254740991.
+ */
 PowiainaNum.E_MSI_REC = new PowiainaNum({
     array: [
         {
@@ -1706,35 +1917,43 @@ PowiainaNum.E_MSI_REC = new PowiainaNum({
     layer: 0,
     sign: 1,
 });
+/**
+ * Tetrated MSI, = 10↑↑9007199254740991.
+ */
 PowiainaNum.TETRATED_MSI = new PowiainaNum({
     array: [
         {
             arrow: 0,
             expans: 1,
             megota: 1,
-            repeat: MSI,
+            repeat: 1e10,
         },
-        { arrow: 1, expans: 1, megota: 1, repeat: MSI },
+        { arrow: 1, expans: 1, megota: 1, repeat: MSI - 2 },
     ],
     small: false,
     layer: 0,
     sign: 1,
 });
+/**
+ * Pentated MSI, = 10↑↑↑9007199254740991.
+ */
 PowiainaNum.PENTATED_MSI = new PowiainaNum({
     array: [
         {
             arrow: 0,
             expans: 1,
             megota: 1,
-            repeat: MSI,
+            repeat: 10,
         },
-        { arrow: 1, expans: 1, megota: 1, repeat: MSI },
-        { arrow: 2, expans: 1, megota: 1, repeat: MSI },
+        { arrow: 2, expans: 1, megota: 1, repeat: MSI - 1 },
     ],
     small: false,
     layer: 0,
     sign: 1,
 });
+/**
+ * Tritri, = 3↑↑↑3 = power tower with height 7625597484987 base 3.
+ */
 PowiainaNum.TRITRI = new PowiainaNum({
     small: false, layer: 0, sign: 1,
     array: [
@@ -1742,8 +1961,22 @@ PowiainaNum.TRITRI = new PowiainaNum({
         newOperator(7625587484984, 1, 1, 1)
     ]
 });
+/**
+ * The Graham's Number, = G^64(4)
+ *
+ * = 3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{
+ * 3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3{3↑↑↑↑3
+ * }3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3
+ * }3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3}3
+ */
 PowiainaNum.GRAHAMS_NUMBER = new PowiainaNum("(10{!})^63 10^^^(10^)^7625597484984 3638334640023.7783");
+/**
+ * Positive Infinity.
+ */
 PowiainaNum.POSITIVE_INFINITY = new PowiainaNum(Infinity);
+/**
+ * Negative Infinity.
+ */
 PowiainaNum.NEGATIVE_INFINITY = new PowiainaNum(-Infinity);
 PowiainaNum.NaN = new PowiainaNum({
     array: [
@@ -1758,5 +1991,40 @@ PowiainaNum.NaN = new PowiainaNum({
     layer: 0,
     sign: 0,
 });
+/**
+ * The mathematical constant e. This is Euler's number, the base of natural logarithms.
+ */
+PowiainaNum.E = new PowiainaNum(Math.E);
+/**
+ * The natural logarithm of 2 = ln(2).
+ */
+PowiainaNum.LN2 = new PowiainaNum(Math.LN2);
+/**
+ * The natural logarithm of 10.
+ */
+PowiainaNum.LN10 = new PowiainaNum(Math.LN10);
+/**
+ * The base-2 logarithm of e = log_2(e).
+ */
+PowiainaNum.LOG2E = new PowiainaNum(Math.LOG2E);
+/**
+ * The base-10 logarithm of e = log_10(e).
+ */
+PowiainaNum.LOG10E = new PowiainaNum(Math.LOG10E);
+/**
+ * Pi(). This is the ratio of the circumference of a circle to its diameter.
+ */
+PowiainaNum.PI = new PowiainaNum(Math.PI);
+/**
+ * The square root of 0.5, or, equivalently, one divided by the square root of 2.
+ *
+ * = (√2)/2 = √(0.5)
+ */
+PowiainaNum.SQRT1_2 = new PowiainaNum(Math.SQRT1_2);
+/**
+ * The square root of 2 = √2.
+ */
+PowiainaNum.SQRT2 = new PowiainaNum(Math.SQRT2);
 PowiainaNum.maxOps = 100;
+PowiainaNum.arrowFuncMap = new Map();
 export default PowiainaNum;