powiaina_num.js 0.2.12 → 0.2.14

package/dist/PowiainaNum.js

@@ -68,6 +68,8 @@
 
   /* Author: VeryrrDefine 0.2.0-beta.1.1*/
   var _a;
+  //#endregion
+  //#region constants
   var powiainaNumError = "[PowiainaNum 0.2 error]";
   var MSI = 9007199254740991;
   var MSI_LOG10 = 15.954589770191003;
@@ -75,6 +77,8 @@
   var LONG_STRING_MIN_LENGTH = 17;
   var EXP_E_REC = 1.444667861009766;
   var isPowiainaNum = /^(PN)?[\/\-\+]*(Infinity|NaN|(P+|P\^\d+ )?(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+))$/;
+  var BE_REGEX = /^((\d+(\.\d*)?|\d*\.\d+)?([EeFf]([-\+]?)))*(0|\d+(\.\d*)?|\d*\.\d+)$/;
+  //#endregion
   //#region some useful functions
   function newOperator(r) {
     var a = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
@@ -88,6 +92,29 @@
       valuereplaced: a == Infinity ? 0 : e == Infinity ? 1 : -1
     };
   }
+  function removeCommasOutsideBraces(input) {
+    var result = "";
+    var inBraces = false;
+    for (var i = 0; i < input.length; i++) {
+      var _char = input[i];
+      if (_char === "{") {
+        inBraces = true;
+        result += _char;
+      } else if (_char === "}") {
+        inBraces = false;
+        result += _char;
+      } else if (_char === ",") {
+        // 只有在花括号内部才保留逗号
+        if (inBraces) {
+          result += _char;
+        }
+        // 如果在花括号外部，就不添加到结果中（相当于删除）
+      } else {
+        result += _char;
+      }
+    }
+    return result;
+  }
   // parse 0.1.x PowiainaNum.js string
   function parseLegacyPowiainaNumString(str) {
     var pattern = /l(\d+)\s+s(\d+)\s+a(\[.*\])/;
@@ -120,7 +147,7 @@
   function replaceETo10(str) {
     // 使用正则表达式匹配 (e^数字) 的模式
     // 正则解释：\(e\^(\d+)\) 匹配 (e^数字)，其中 \d+ 匹配一个或多个数字
-    return str.replace(/\(e\^(\d+)\)/g, "(10^)^$1 ").replace(/(\d+)\x20*PT/g, "(10^)^$1 ");
+    return str.replace(/\(e\^(\d+)\)/g, "(10^)^$1 ").replace(/(\d+)[Pp][Tt]/g, "(10^)^$1 ");
   }
   /**
    * 把一个字符串很长的数进行以10为底的对数
@@ -174,8 +201,10 @@
   // The evaluation can become inaccurate very close to the branch point
   // Evaluates W(x, 0) if principal is true, W(x, -1) if principal is false
   function f_lambertw(z) {
-    var tol = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1e-10;
-    var principal = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
+    var t = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1e-10;
+    var pr = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
+    var tol = t;
+    var principal = pr;
     var w;
     var wn;
     if (!Number.isFinite(z)) {
@@ -338,16 +367,27 @@
       this.small = false;
       this.sign = 0;
       this.layer = 0;
-      if (typeof arg1 == "undefined") ; else if (typeof arg1 == "number") {
-        var obj = PowiainaNum.fromNumber(arg1);
-        this.resetFromObject(obj);
-      } else if (_typeof(arg1) == "object") {
-        var _obj = PowiainaNum.fromObject(arg1);
-        this.resetFromObject(_obj);
-      } else if (typeof arg1 == "string") {
-        var _obj2 = PowiainaNum.fromString(arg1);
-        this.resetFromObject(_obj2);
-      } else ;
+      if (PowiainaNum.blankArgumentConstructorReturnZero) {
+        this.resetFromObject(PowiainaNum.ZERO);
+      }
+      try {
+        if (typeof arg1 == "undefined") {} else if (typeof arg1 == "number") {
+          var obj = PowiainaNum.fromNumber(arg1);
+          this.resetFromObject(obj);
+        } else if (_typeof(arg1) == "object") {
+          var _obj = PowiainaNum.fromObject(arg1);
+          this.resetFromObject(_obj);
+        } else if (typeof arg1 == "string") {
+          var _obj2 = PowiainaNum.fromString(arg1);
+          this.resetFromObject(_obj2);
+        } else {
+          var isn = arg1;
+        }
+      } catch (e) {
+        console.error("Malformed input");
+        console.error(e);
+        if (PowiainaNum.throwErrorOnResultNaN && PowiainaNum.isNaN(this)) throw new Error("NaN");
+      }
     }
     //#region 4 Basic calculates.
     /**
@@ -358,10 +398,13 @@
       key: "add",
       value: function add(other) {
         var _b, _c, _d, _e;
-        var x = this.clone();
+        var x = this.clone().normalize();
         var y = new PowiainaNum(other);
         // inf + -inf = nan
-        if (x.eq(PowiainaNum.POSITIVE_INFINITY) && y.eq(PowiainaNum.NEGATIVE_INFINITY) || x.eq(PowiainaNum.NEGATIVE_INFINITY) && y.eq(PowiainaNum.POSITIVE_INFINITY)) return PowiainaNum.NaN.clone();
+        if (x.eq(PowiainaNum.POSITIVE_INFINITY) && y.eq(PowiainaNum.NEGATIVE_INFINITY) || x.eq(PowiainaNum.NEGATIVE_INFINITY) && y.eq(PowiainaNum.POSITIVE_INFINITY)) {
+          if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
+          return PowiainaNum.NaN.clone();
+        }
         // inf & nan check
         if (!x.isFinite()) return x.clone();
         if (!y.isFinite()) return y.clone();
@@ -401,40 +444,56 @@
         if (isFinite(temp) && temp !== 0) {
           return PowiainaNum.fromNumber(temp);
         }
-        var mult = 1;
+        var signMult = 1;
+        /**Calculate numbers [1, 9e15] (useless) */
         if (!a.small && !b.small && !((_b = a.array[1]) === null || _b === void 0 ? void 0 : _b.repeat) && !((_c = b.array[1]) === null || _c === void 0 ? void 0 : _c.repeat) && a.sign == b.sign) {
           return new PowiainaNum((a.array[0].repeat + b.array[0].repeat) * a.sign);
         }
+        // Calculate a & b's 10-logarithm
         var alog10 = (a.small ? -1 : 1) * (((_d = a.array[1]) === null || _d === void 0 ? void 0 : _d.repeat) ? a.array[0].repeat : Math.log10(a.array[0].repeat));
         var blog10 = (b.small ? -1 : 1) * (((_e = b.array[1]) === null || _e === void 0 ? void 0 : _e.repeat) ? b.array[0].repeat : Math.log10(b.array[0].repeat));
         if (alog10 - blog10 > MSI_LOG10) return a;
+        /**
+         * Offset, a number can make 10^ a+off calculatable not very small or big
+         */
         var offset = -Math.floor(alog10); //a number can make a+off in [0,1)
-        var r,
-          l = 0,
-          t;
-        t = a.sign * Math.pow(10, alog10 + offset) + b.sign * Math.pow(10, blog10 + offset);
-        if (t > 0) l = Math.log10(t) - offset;
-        if (t < 0) {
-          l = Math.log10(-t) - offset;
-          mult *= -1;
-        }
-        if (t == 0) throw Error("Encounter a calculate error");
-        r = new PowiainaNum();
-        r.sign = 1;
-        if (l > MSI_LOG10 || l < -MSI_LOG10) {
-          r.array = [newOperator(l, 0), newOperator(1, 1)];
+        var resultLogarithm = 0;
+        /** 10^(a+off) + 10^(b+off). */
+        var offsetedResult = a.sign * Math.pow(10, alog10 + offset) + b.sign * Math.pow(10, blog10 + offset);
+        if (offsetedResult > 0) resultLogarithm = Math.log10(offsetedResult) - offset;
+        if (offsetedResult < 0) {
+          resultLogarithm = Math.log10(-offsetedResult) - offset;
+          signMult *= -1;
+        }
+        if (offsetedResult == 0) return PowiainaNum.ZERO.clone();
+        var resultPN = PowiainaNum.NaN.clone();
+        resultPN.sign = 1;
+        /** abs(resultLogarithm) > 15.9, use 10^x form. */
+        if (resultLogarithm > MSI_LOG10 || resultLogarithm < -MSI_LOG10) {
+          resultPN.array = [newOperator(resultLogarithm, 0), newOperator(1, 1)];
+          /**otherwise, use 10** abs(resultLogarithm) */
         } else {
-          r.array = [newOperator(Math.pow(10, Math.abs(l)), 0)];
+          resultPN.array = [newOperator(Math.pow(10, Math.abs(resultLogarithm)), 0)];
         }
-        r.small = l < 0 ? true : false;
-        r.sign *= mult;
-        return r;
+        resultPN.small = resultLogarithm < 0 ? true : false;
+        resultPN.sign *= signMult;
+        return resultPN;
+      }
+    }, {
+      key: "plus",
+      value: function plus(other) {
+        return this.add(other);
       }
     }, {
       key: "sub",
       value: function sub(a) {
         return this.add(new PowiainaNum(a).neg());
       }
+    }, {
+      key: "minus",
+      value: function minus(other) {
+        return this.sub(other);
+      }
     }, {
       key: "mul",
       value: function mul(other) {
@@ -442,7 +501,10 @@
         var y = new PowiainaNum(other);
         // inf * -inf = -inf
         if (x.eq(PowiainaNum.POSITIVE_INFINITY) && y.eq(PowiainaNum.NEGATIVE_INFINITY) || y.eq(PowiainaNum.POSITIVE_INFINITY) && x.eq(PowiainaNum.NEGATIVE_INFINITY)) return PowiainaNum.NEGATIVE_INFINITY.clone();
-        if (x.isInfiNaN() && y.isZero() || y.isInfiNaN() && x.isZero()) return PowiainaNum.NaN.clone();
+        if (x.isInfiNaN() && y.isZero() || y.isInfiNaN() && x.isZero()) {
+          if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
+          return PowiainaNum.NaN.clone();
+        }
         if (x.eq(PowiainaNum.NEGATIVE_INFINITY) && y.eq(PowiainaNum.NEGATIVE_INFINITY)) return PowiainaNum.POSITIVE_INFINITY.clone();
         // inf & nan check
         if (!x.isFinite()) return x.clone();
@@ -468,12 +530,22 @@
         r.sign = x.sign * y.sign;
         return r;
       }
+    }, {
+      key: "times",
+      value: function times(other) {
+        return this.mul(other);
+      }
     }, {
       key: "div",
       value: function div(other) {
         var x = new PowiainaNum(other).rec();
         return this.mul(x);
       }
+    }, {
+      key: "divide",
+      value: function divide(other) {
+        return this.div(other);
+      }
     }, {
       key: "mod",
       value: function mod(x) {
@@ -481,34 +553,45 @@
         var division = this.div(other);
         return division.sub(division.floor()).mul(other);
       }
+    }, {
+      key: "modulus",
+      value: function modulus(x) {
+        return this.mod(x);
+      }
+    }, {
+      key: "pow10",
+      value:
       //#endregion
       //#region power
       /**
        * @returns 10 to the power of `this`
        */
-    }, {
-      key: "pow10",
-      value: function pow10() {
+      function pow10() {
         var _b, _c;
-        var r = this.clone();
+        var thisObject = this.clone();
         // inf & nan check
         if (!this.isFinite()) return this.clone();
-        if (r.isneg()) {
+        /** when 10^(t), t<0, use 10^(-t) reciprocate. */
+        if (thisObject.isneg()) {
           // 10^(-x) = 1/(10^x)
-          r.sign *= -1;
-          return r.pow10().rec();
+          thisObject.sign *= -1;
+          return thisObject.pow10().rec();
         }
-        if (r.lte(308.25471555991675)) {
-          return PowiainaNum.fromNumber(Math.pow(10, r.toNumber()));
+        /**if t lessthan log10 2^1024, use fromNumber. */
+        if (thisObject.lte(308.25471555991675)) {
+          return PowiainaNum.fromNumber(Math.pow(10, thisObject.toNumber()));
         }
-        if (r.small) {
-          if (r.lt(PowiainaNum.MSI_REC)) return PowiainaNum.ONE;
-          return new PowiainaNum(Math.pow(10, Math.pow(r.array[0].repeat, -1)));
+        /**calculate directly */
+        if (thisObject.small) {
+          if (thisObject.lt(PowiainaNum.MSI_REC)) return PowiainaNum.ONE;
+          return new PowiainaNum(Math.pow(10, Math.pow(thisObject.array[0].repeat, -1)));
         }
-        if (r.gt(PowiainaNum.TETRATED_MSI)) return r;
-        r.setOperator(((_c = (_b = r.array[1]) === null || _b === void 0 ? void 0 : _b.repeat) !== null && _c !== void 0 ? _c : 0) + 1, 1);
-        r.normalize();
-        return r;
+        /** indistinguishable above 10^^9e15 */
+        if (thisObject.gt(PowiainaNum.TETRATED_MSI)) return thisObject;
+        /**otherwise add 10^ directly */
+        thisObject.setOperator(((_c = (_b = thisObject.array[1]) === null || _b === void 0 ? void 0 : _b.repeat) !== null && _c !== void 0 ? _c : 0) + 1, 1);
+        thisObject.normalize();
+        return thisObject;
       }
     }, {
       key: "pow",
@@ -518,8 +601,17 @@
         if (!other.isFinite()) return other.clone();
         if (!this.isFinite()) return this.clone();
         if (this.eq(10)) return other.pow10();
+        if (other.isneg()) return this.pow(other.neg()).rec();
         if (this.isneg()) {
-          if (!other.isInt()) return PowiainaNum.NaN.clone();
+          if (!other.isInt()) {
+            if (other.small) {
+              if (other.rec().div(2).eq(1)) {
+                return this.neg().pow(other).neg();
+              }
+            }
+            if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
+            return PowiainaNum.NaN.clone();
+          }
           var r = this.abs().pow(other);
           r.sign = function () {
             var a = other.mod(2).round();
@@ -547,6 +639,7 @@
         } else if (other.rec().mod(2).eq(1)) {
           return this.neg().log10().mul(other).pow10().neg();
         }
+        if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
         return PowiainaNum.NaN.clone();
       }
     }, {
@@ -574,7 +667,10 @@
     }, {
       key: "log10",
       value: function log10() {
-        if (this.isneg()) return PowiainaNum.NaN.clone();
+        if (this.isneg()) {
+          if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
+          return PowiainaNum.NaN.clone();
+        }
         if (this.isZero()) return PowiainaNum.NEGATIVE_INFINITY.clone();
         if (this.small) {
           var _x = this.clone();
@@ -596,6 +692,16 @@
         var other = new PowiainaNum(base);
         return this.log10().div(other.log10());
       }
+    }, {
+      key: "log2",
+      value: function log2() {
+        return this.log(2);
+      }
+    }, {
+      key: "logBase",
+      value: function logBase(a) {
+        return this.log(a);
+      }
     }, {
       key: "ln",
       value: function ln() {
@@ -703,8 +809,10 @@
       //Code from break_eternity.js
       //Some special values, for testing: https://en.wikipedia.org/wiki/Lambert_W_function#Special_values
       function lambertw() {
-        var principal = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : true;
+        var princ = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : true;
+        var principal = princ;
         if (this.lt(-0.3678794411710499)) {
+          if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
           return PowiainaNum.NaN.clone(); //complex
         } else if (principal) {
           if (this.abs().lt("1e-300")) return new PowiainaNum(this);else if (this.small) {
@@ -718,12 +826,13 @@
             return this.log();
           }
         } else {
-          if (this.sign === 1) {
+          if (this.sign === -1) {
+            if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
             return PowiainaNum.NaN.clone(); //complex
           }
-          if (this.layer === 0) {
+          if (this.lt(9e15)) {
             return PowiainaNum.fromNumber(f_lambertw(this.sign * this.array[0].repeat, 1e-10, false));
-          } else if (this.layer == 1) {
+          } else if (this.lt(PowiainaNum.E_MSI)) {
             return d_lambertw(this, 1e-10, false);
           } else {
             return this.neg().rec().lambertw().neg();
@@ -742,23 +851,37 @@
         var t = this.clone();
         var other = new PowiainaNum(other2);
         var payl = new PowiainaNum(payload);
-        if (t.isNaN() || other.isNaN() || payl.isNaN()) return PowiainaNum.NaN.clone();
+        if (t.isNaN() || other.isNaN() || payl.isNaN()) {
+          if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
+          return PowiainaNum.NaN.clone();
+        }
         if (t.eq(1)) return PowiainaNum.ONE.clone();
-        if (payl.neq(PowiainaNum.ONE)) other = other.add(payl.slog(t));
+        if (payl.neq(PowiainaNum.ONE) && t.gte(EXP_E_REC)) {
+          other = other.add(payl.slog(t));
+        }
         var negln;
         if (other.isInfi() && other.sign > 0) {
           if (t.gte(EXP_E_REC)) return PowiainaNum.POSITIVE_INFINITY.clone();
           negln = this.log().neg();
           return negln.lambertw().div(negln);
         }
-        if (other.lte(-2)) return PowiainaNum.NaN.clone();
+        if (other.lte(-2)) {
+          if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
+          return PowiainaNum.NaN.clone();
+        }
         if (t.isZero()) {
-          if (other.isZero()) return PowiainaNum.NaN.clone();
+          if (other.isZero()) {
+            if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
+            return PowiainaNum.NaN.clone();
+          }
           if (other.gte(MSI / 2) || other.toNumber() % 2 == 0) return PowiainaNum.ZERO.clone();
           return PowiainaNum.ONE.clone();
         }
         if (t.eq(PowiainaNum.ONE)) {
-          if (other.eq(PowiainaNum.ONE.neg())) return PowiainaNum.NaN.clone();
+          if (other.eq(PowiainaNum.ONE.neg())) {
+            if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
+            return PowiainaNum.NaN.clone();
+          }
           return PowiainaNum.ONE.clone();
         }
         if (other.eq(PowiainaNum.ONE.neg())) return PowiainaNum.ZERO.clone();
@@ -832,7 +955,10 @@
         if (b.lt(EXP_E_REC)) {
           var a = b.tetrate(Infinity);
           if (x.eq(a)) return PowiainaNum.POSITIVE_INFINITY.clone();
-          if (x.gt(a)) return PowiainaNum.NaN.clone();
+          if (x.gt(a)) {
+            if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
+            return PowiainaNum.NaN.clone();
+          }
         }
         if (x.max(b).gt(PowiainaNum.PENTATED_MSI)) {
           if (x.gt(b)) return x;
@@ -876,13 +1002,17 @@
           }
         }
         if (x.gt(10)) return new PowiainaNum(r);
+        if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
         return PowiainaNum.NaN.clone();
       }
     }, {
       key: "ssqrt",
       value: function ssqrt() {
         var x = this.clone();
-        if (x.lt(1 / EXP_E_REC)) return PowiainaNum.NaN.clone();
+        if (x.lt(1 / EXP_E_REC)) {
+          if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
+          return PowiainaNum.NaN.clone();
+        }
         if (!x.isFinite()) return x;
         if (x.gt(PowiainaNum.TETRATED_MSI)) return x;
         if (x.gt(PowiainaNum.EE_MSI)) {
@@ -933,6 +1063,7 @@
         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 () {
+            if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
             return PowiainaNum.NaN.clone();
           };
         }
@@ -958,6 +1089,7 @@
             if (other.lt(PowiainaNum.ZERO)) return PowiainaNum.NaN.clone();
             if (t.eq(PowiainaNum.ZERO)) {
               if (other.eq(PowiainaNum.ONE)) return PowiainaNum.ZERO.clone();
+              if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
               return PowiainaNum.NaN.clone();
             }
             if (payload.neq(PowiainaNum.ONE)) other = other.add(payload.anyarrow_log(arrows)(t));
@@ -1037,6 +1169,7 @@
           throw new Error(powiainaNumError + "Not implemented");
         }
         if (!arrow.isInt() || arrow.lt(0)) return function () {
+          if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
           return PowiainaNum.NaN.clone();
         };
         if (arrow.eq(0)) return function (base) {
@@ -1070,13 +1203,16 @@
               return x.sub(x.getOperator(arrowsNum - 1));
             }
           }
-          if (x.lt(PowiainaNum.ZERO.clone())) return PowiainaNum.NaN.clone();
+          if (x.lt(PowiainaNum.ZERO.clone())) {
+            if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
+            return PowiainaNum.NaN.clone();
+          }
           // base^base^... = x? (? bases)
           var r = 0;
           // 计算x与base的差距
-          var t = x.getOperator(arrowsNum) - b.getOperator(arrowsNum);
-          if (t > 3) {
-            var l = t - 3;
+          var distanceLayerOf = x.getOperator(arrowsNum) - b.getOperator(arrowsNum);
+          if (distanceLayerOf > 3) {
+            var l = distanceLayerOf - 3;
             r += l;
             x.setOperator(x.getOperator(arrowsNum) - l, arrowsNum);
           }
@@ -1094,6 +1230,7 @@
             }
           }
           if (x.gt(10)) return new PowiainaNum(r);
+          if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
           return PowiainaNum.NaN.clone();
         };
       }
@@ -1118,18 +1255,18 @@
       }
     }, {
       key: "pentate",
-      value: function pentate(other) {
-        return this.arrow(3)(other);
+      value: function pentate(other, payload) {
+        return this.arrow(3)(other, payload);
       }
     }, {
       key: "hexate",
-      value: function hexate(other) {
-        return this.arrow(4)(other);
+      value: function hexate(other, payload) {
+        return this.arrow(4)(other, payload);
       }
     }, {
       key: "pent",
-      value: function pent(other) {
-        return this.arrow(3)(other);
+      value: function pent(other, payload) {
+        return this.arrow(3)(other, payload);
       }
     }, {
       key: "penta_log",
@@ -1137,6 +1274,9 @@
         var base = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 10;
         return this.anyarrow_log(3)(base);
       }
+    }, {
+      key: "expansion",
+      value:
       /**
        * Expansion, which is `this`{{1}}`other2`.
        *
@@ -1144,15 +1284,16 @@
        *
        * @url https://googology.fandom.com/wiki/Expansion
        */
-    }, {
-      key: "expansion",
-      value: function expansion(other2) {
+      function expansion(other2) {
         var other = new PowiainaNum(other2);
         var t = this.clone();
         if (other.lt(PowiainaNum.ZERO) || !other.isInt()) return PowiainaNum.NaN.clone();
         if (other.eq(PowiainaNum.ONE)) return this.clone();
         if (this.eq(PowiainaNum.ONE)) return PowiainaNum.ONE.clone();
-        if (!this.isInt()) return PowiainaNum.NaN.clone();
+        if (!this.isInt()) {
+          if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
+          return PowiainaNum.NaN.clone();
+        }
         if (this.eq(2)) return new PowiainaNum(4);
         if (other.eq(0)) return PowiainaNum.ONE.clone();
         var r;
@@ -1192,6 +1333,7 @@
         var arrow = new PowiainaNum(arrow2);
         var t = this.clone();
         if (arrow.lt(0) || !arrow.isInt() || arrow.isNaN() || this.isNaN()) return function () {
+          if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
           return PowiainaNum.NaN.clone();
         };
         if (arrow.eq(0)) return function (other) {
@@ -1206,9 +1348,13 @@
           var other = new PowiainaNum(other2);
           var r;
           if (t.isNaN() || other.isNaN()) return PowiainaNum.NaN.clone();
-          if (other.lt(PowiainaNum.ZERO)) return PowiainaNum.NaN.clone();
+          if (other.lt(PowiainaNum.ZERO)) {
+            if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
+            return PowiainaNum.NaN.clone();
+          }
           if (t.eq(PowiainaNum.ZERO)) {
             if (other.eq(PowiainaNum.ONE)) return PowiainaNum.ZERO.clone();
+            if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
             return PowiainaNum.NaN.clone();
           }
           if (t.eq(PowiainaNum.ONE)) return PowiainaNum.ONE.clone();
@@ -1394,6 +1540,12 @@
         var other = new PowiainaNum(x).abs();
         return this.abs().cmp(other);
       }
+      /**
+       * -1: `this` is smaller
+       * 0: equals
+       * 1: `x` is smaller
+       * 2: NaN
+       */
     }, {
       key: "compare",
       value: function compare(x) {
@@ -1401,6 +1553,7 @@
         if (this.isNaN() || other.isNaN()) return 2;
         if (this.sign < other.sign) return -1;
         if (this.sign > other.sign) return 1;
+        var t = this;
         //this.sign = other.sign
         var allneg = this.sign == -1 && other.sign == -1;
         if (this.small && !other.small) return -1 * (allneg ? -1 : 1);
@@ -1412,6 +1565,18 @@
         for (var i = 0; this.array.length - 1 - i >= 0 && other.array.length - 1 - i >= 0; i++) {
           var op1 = this.array[this.array.length - 1 - i];
           var op2 = other.array[other.array.length - 1 - i];
+          if (op1.repeat === Infinity && op2.repeat === Infinity) {
+            if (t.small === other.small) return 0;
+            return other.small ? 1 : -1;
+          }
+          if (op1.repeat === Infinity) {
+            result = 1;
+            break;
+          }
+          if (op2.repeat === Infinity) {
+            result = -1;
+            break;
+          }
           var cmp = compareTuples([op1.megota, op1.expans, op1.arrow, op1.repeat], [op2.megota, op2.expans, op2.arrow, op2.repeat]);
           if (cmp == 1) {
             result = 1;
@@ -1459,6 +1624,16 @@
         var t = this.cmp(other);
         return t == 0 || t == 1;
       }
+    }, {
+      key: "equals",
+      value: function equals(other) {
+        return this.eq(other);
+      }
+    }, {
+      key: "notEquals",
+      value: function notEquals(other) {
+        return this.neq(other);
+      }
     }, {
       key: "eq_tolerance",
       value: function eq_tolerance(value) {
@@ -1468,6 +1643,7 @@
       }
       //#endregion
       //#region geometry
+      /**this function is indistinguishable above 4503599627370496*/
     }, {
       key: "sin",
       value: function sin() {
@@ -1520,6 +1696,16 @@
         a.small = !a.small;
         return a;
       }
+    }, {
+      key: "recip",
+      value: function recip() {
+        return this.rec();
+      }
+    }, {
+      key: "reciprocate",
+      value: function reciprocate() {
+        return this.rec();
+      }
     }, {
       key: "floor",
       value: function floor() {
@@ -1560,6 +1746,9 @@
         r.sign = this.sign;
         return r;
       }
+    }, {
+      key: "trunc",
+      value:
       /**
        * Work like `Math.trunc`,
        *
@@ -1572,15 +1761,10 @@
        * new PowiainaNum(-1.114514).trunc() == new PowiainaNum(-1)
        * @returns
        */
-    }, {
-      key: "trunc",
-      value: function trunc() {
+      function trunc() {
         var y = this.clone();
         return y.gte(0) ? y.floor() : y.ceil();
       }
-      /**
-       * @returns if this<other, return -1, if this=other, return 0, if this>other, return 1, if this!<=>, return 2
-       */
     }, {
       key: "isNaN",
       value: function (_isNaN) {
@@ -1643,10 +1827,164 @@
       value: function isneg() {
         return this.sign < 0;
       }
+    }, {
+      key: "getOperatorIndex",
+      value:
+      //#endregion
+      //#region operators
+      /**
+       * @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.
+       */
+      function getOperatorIndex(arrow) {
+        var expans = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;
+        var megota = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;
+        for (var i = 0; i < this.array.length; i++) {
+          var cmp = compareTuples([this.array[i].megota, this.array[i].expans, this.array[i].arrow], [megota, expans, arrow]);
+          if (cmp == 0) return i; // I find it was [xx,xxx,*xxx*,xxx]!
+          if (cmp == 1) return i - 0.5; // It's between [xx, xx,xx*,?,*xx]!
+        }
+        return this.array.length - 0.5;
+      }
+      /**
+       * @returns number repeats of operators with given arguments.
+       */
+    }, {
+      key: "getOperator",
+      value: function getOperator(arrow) {
+        var expans = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;
+        var megota = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;
+        var index = this.getOperatorIndex(arrow, expans, megota);
+        if (!this.array[index]) return 0;
+        return this.array[index].repeat;
+      }
+      /**
+       * Modify the repeat of operator
+       * @param number val the repeat of operator will modify to array.
+       * @returns bool Is the operators array changed?
+       */
+    }, {
+      key: "setOperator",
+      value: function setOperator(val, arrow) {
+        var expans = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;
+        var megota = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 1;
+        // if (arrow!=0&&val==0) return false;
+        var index = this.getOperatorIndex(arrow, expans, megota);
+        if (!this.array[index]) {
+          this.array.splice(Math.ceil(index), 0, {
+            arrow: arrow,
+            expans: expans,
+            megota: megota,
+            valuereplaced: expans === Infinity ? 1 : arrow == Infinity ? 0 : -1,
+            repeat: val
+          });
+          return true;
+        }
+        this.array[index].repeat = val;
+        // this.normalize()
+        return false;
+      }
+      //#endregion
+      //#region converters
+      /**
+       * Convert `this` to Javascript `number`
+       *
+       * returns `Infinity` when the number is greater than `Number.MAX_VALUE`
+       */
+    }, {
+      key: "toNumber",
+      value: function toNumber() {
+        if (this.sign == -1) return -this.neg().toNumber();
+        if (this.small) return 1 / this.rec().toNumber();
+        if (this.array.length > 2) return Infinity;
+        if (this.array.length == 1) return this.array[0].repeat;else if (this.array.length == 2 && this.array[1].arrow == 1 && this.array[1].expans == 1 && this.array[1].megota == 1 && this.array[1].repeat == 1) return Math.pow(10, this.getOperator(0));
+        return NaN;
+      }
+      /**
+       * Convert `this` to a string
+       */
+    }, {
+      key: "toString_core",
+      value: function toString_core() {
+        if (this.isNaN()) return "NaN";
+        if (this.sign == -1) return "-".concat(this.neg().toString());
+        if (this.small) {
+          if (this.isZero()) return "0";
+          return "/".concat(this.rec().toString());
+        }
+        if (this.isInfi()) return "Infinity";
+        // P^a (10{arrow,expans,megota})^repeation base
+        var res = "";
+        if (!this.layer) res += "";else if (this.layer < 3) res += "P".repeat(this.layer);else res += "P^" + this.layer + " ";
+        for (var i = this.array.length - 1; i >= 0; i--) {
+          var oper = this.array[i];
+          var calc = "10{".concat(oper.arrow === Infinity ? "!" : oper.arrow).concat(oper.expans > 1 || oper.megota > 1 ? ",".concat(oper.expans === Infinity ? "!" : oper.expans) : "").concat(oper.megota > 1 ? ",".concat(oper.megota) : "", "}");
+          if (oper.arrow == 1 && oper.expans == 1 && oper.megota == 1 && oper.repeat < 5) {
+            calc = "e".repeat(oper.repeat);
+          } else if (oper.arrow == 0 && oper.expans == 1 && oper.megota == 1) {
+            calc = oper.repeat.toString();
+          } else if (oper.repeat > 1) {
+            calc = "(".concat(calc, ")^").concat(oper.repeat, " ");
+          } else {
+            calc = "".concat(calc);
+          }
+          res += "".concat(calc);
+        }
+        return res;
+      }
+    }, {
+      key: "toString",
+      value: function toString() {
+        try {
+          return this.toString_core();
+        } catch (_b) {
+          console.error("Checked error when converting to string");
+          return "NaN";
+        }
+      }
+    }, {
+      key: "toJSON",
+      value:
+      /**
+       * Convert `this` to a JSON object
+       * @returns a JSON object
+       */
+      function toJSON() {
+        return "PN" + this.toString();
+      }
+    }, {
+      key: "arr01",
+      get:
+      /**
+       * A property array value for version 0.1.x PowiainaNum.
+       */
+      function get() {
+        var res = [0];
+        for (var i = 0; i < this.array.length; i++) {
+          if (i == 0) res[0] = this.array[i].repeat;else {
+            // @ts-ignore
+            res[i] = [0, 0, 0, 0];
+            // @ts-ignore
+            res[i][0] = this.array[i].arrow == Infinity ? "x" : this.array[i].arrow;
+            // @ts-ignore
+            res[i][1] = this.array[i].repeat;
+            // @ts-ignore
+            res[i][2] = this.array[i].expans == Infinity ? "x" : this.array[i].expans;
+            // @ts-ignore
+            res[i][3] = this.array[i].megota;
+          }
+        }
+        return res;
+      }
+      //#endregion
+      //#region useless functions
+      /**
+       * This function is for NaNe308, if you want to calculate G(x), use this function directly.
+       */
     }, {
       key: "normalize",
       value:
       //#endregion
+      //#region other functions
       /**
        * Normalize functions will make this number convert into standard format.(it also change `this`, like [].sort)
        * @returns normalized number
@@ -1655,9 +1993,14 @@
         //TODO: normalize
         var renormalize = true;
         var x = this;
-        for (var _i = 0; _i < this.array.length; _i++) {
+        if (this.array === undefined) {
+          x.array = [newOperator(NaN, 0, 1, 1)];
+        }
+        if (this.sign === undefined) this.sign = 0;
+        if (this.layer === undefined) this.layer = 0;
+        for (var i = 0; i < this.array.length; i++) {
           // Check what is infinity
-          if (this.array[_i].repeat == Infinity) {
+          if (this.array[i].repeat == Infinity) {
             this.array = [{
               arrow: 0,
               expans: 1,
@@ -1668,8 +2011,8 @@
             return this;
           }
         }
-        for (var i = 1; i < x.array.length; ++i) {
-          var e = x.array[i];
+        for (var _i = 1; _i < x.array.length; ++_i) {
+          var e = x.array[_i];
           if (e.arrow === null || e.arrow === undefined) {
             e.arrow = 0;
           }
@@ -1700,28 +2043,28 @@
           renormalize = false;
           // Sort arrays.
           this.array.sort(arraySortFunction);
-          for (i = 1; i < x.array.length - 1; ++i) {
-            if (x.array[i].arrow == x.array[i + 1].arrow && x.array[i].expans == x.array[i + 1].expans && x.array[i].megota == x.array[i + 1].megota) {
+          for (var _i2 = 1; _i2 < x.array.length - 1; ++_i2) {
+            if (x.array[_i2].arrow == x.array[_i2 + 1].arrow && x.array[_i2].expans == x.array[_i2 + 1].expans && x.array[_i2].megota == x.array[_i2 + 1].megota) {
               // same array's merge
-              x.array[i].repeat += x.array[i + 1].repeat;
-              x.array.splice(i + 1, 1);
-              --i;
+              x.array[_i2].repeat += x.array[_i2 + 1].repeat;
+              x.array.splice(_i2 + 1, 1);
+              --_i2;
               renormalize = true;
             }
           }
-          for (i = 1; i < x.array.length; ++i) {
+          for (var _i3 = 1; _i3 < x.array.length; ++_i3) {
             // If there is a 0 repeat operator, remove it.
-            if (x.array[i].arrow !== 0 && (x.array[i].repeat === 0 || x.array[i].repeat === null || x.array[i].repeat === undefined)) {
-              x.array.splice(i, 1);
-              --i;
+            if (x.array[_i3].arrow !== 0 && (x.array[_i3].repeat === 0 || x.array[_i3].repeat === null || x.array[_i3].repeat === undefined)) {
+              x.array.splice(_i3, 1);
+              --_i3;
               continue;
             }
             // If there is a operator which arrow 0 and brace count >=2
             // replace it as arrow replacement operaotr
-            if (x.array[i].arrow == 0 && x.array[i].expans >= 2) {
-              x.array[i].arrow = Infinity;
-              x.array[i].valuereplaced = 0;
-              x.array[i].expans = x.array[i].expans - 1;
+            if (x.array[_i3].arrow == 0 && x.array[_i3].expans >= 2) {
+              x.array[_i3].arrow = Infinity;
+              x.array[_i3].valuereplaced = 0;
+              x.array[_i3].expans = x.array[_i3].expans - 1;
             }
           }
           if (x.array.length > PowiainaNum.maxOps) x.array.splice(1, x.array.length - PowiainaNum.maxOps); // max operators check
@@ -1751,6 +2094,11 @@
             this.small = !this.small;
             renormalize = true;
           }
+          // for a = 1, small should false.
+          if (this.array.length == 1 && this.array[0].repeat == 1 && this.small) {
+            this.small = false;
+            renormalize = true;
+          }
           // for any 10{X>9e15}10, replace into 10{!}X;
           if (this.array.length >= 2 && this.array[1].arrow >= MSI) {
             this.array[0].repeat = this.array[1].arrow;
@@ -1806,61 +2154,6 @@
         } while (renormalize);
         return this;
       }
-      //#region operators
-      /**
-       * @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.
-       */
-    }, {
-      key: "getOperatorIndex",
-      value: function getOperatorIndex(arrow) {
-        var expans = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;
-        var megota = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;
-        for (var i = 0; i < this.array.length; i++) {
-          var cmp = compareTuples([this.array[i].megota, this.array[i].expans, this.array[i].arrow], [megota, expans, arrow]);
-          if (cmp == 0) return i; // I find it was [xx,xxx,*xxx*,xxx]!
-          if (cmp == 1) return i - 0.5; // It's between [xx, xx,xx*,?,*xx]!
-        }
-        return this.array.length - 0.5;
-      }
-      /**
-       * @returns number repeats of operators with given arguments.
-       */
-    }, {
-      key: "getOperator",
-      value: function getOperator(arrow) {
-        var expans = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;
-        var megota = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;
-        var index = this.getOperatorIndex(arrow, expans, megota);
-        if (!this.array[index]) return 0;
-        return this.array[index].repeat;
-      }
-      /**
-       * Modify the repeat of operator
-       * @param number val the repeat of operator will modify to array.
-       * @returns bool Is the operators array changed?
-       */
-    }, {
-      key: "setOperator",
-      value: function setOperator(val, arrow) {
-        var expans = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;
-        var megota = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 1;
-        // if (arrow!=0&&val==0) return false;
-        var index = this.getOperatorIndex(arrow, expans, megota);
-        if (!this.array[index]) {
-          this.array.splice(Math.ceil(index), 0, {
-            arrow: arrow,
-            expans: expans,
-            megota: megota,
-            valuereplaced: expans === Infinity ? 1 : arrow == Infinity ? 0 : -1,
-            repeat: val
-          });
-          return true;
-        }
-        this.array[index].repeat = val;
-        // this.normalize()
-        return false;
-      }
-      //#endregion
       /**
        * @returns  a PowiainaNum object which deep copied from `this` object.
        */
@@ -1879,6 +2172,9 @@
     }, {
       key: "resetFromObject",
       value: function resetFromObject(powlikeObject) {
+        if (!powlikeObject.array) {
+          return;
+        }
         this.array = [];
         for (var i = 0; i < powlikeObject.array.length; i++) {
           this.array[i] = {
@@ -1894,107 +2190,56 @@
         this.layer = powlikeObject.layer;
         return this;
       }
-      //#region converters
-      /**
-       * Convert `this` to Javascript `number`
-       *
-       * returns `Infinity` when the number is greater than `Number.MAX_VALUE`
-       */
-    }, {
-      key: "toNumber",
-      value: function toNumber() {
-        if (this.sign == -1) return -this.neg().toNumber();
-        if (this.small) return 1 / this.rec().toNumber();
-        if (this.array.length > 2) return Infinity;
-        if (this.array.length == 1) return this.array[0].repeat;else if (this.array.length == 2 && this.array[1].arrow == 1 && this.array[1].expans == 1 && this.array[1].megota == 1 && this.array[1].repeat == 1) return Math.pow(10, this.getOperator(0));
-        return NaN;
-      }
-      /**
-       * Convert `this` to a string
-       */
-    }, {
-      key: "toString",
-      value: function toString() {
-        if (this.isNaN()) return "NaN";
-        if (this.sign == -1) return "-".concat(this.neg().toString());
-        if (this.small) {
-          if (this.isZero()) return "0";
-          return "/".concat(this.rec().toString());
-        }
-        if (this.isInfi()) return "Infinity";
-        // P^a (10{arrow,expans,megota})^repeation base
-        var res = "";
-        if (!this.layer) res += "";else if (this.layer < 3) res += "P".repeat(this.layer);else res += "P^" + this.layer + " ";
-        for (var i = this.array.length - 1; i >= 0; i--) {
-          var oper = this.array[i];
-          var calc = "10{".concat(oper.arrow === Infinity ? "!" : oper.arrow).concat(oper.expans > 1 || oper.megota > 1 ? ",".concat(oper.expans === Infinity ? "!" : oper.expans) : "").concat(oper.megota > 1 ? ",".concat(oper.megota) : "", "}");
-          if (oper.arrow == 1 && oper.expans == 1 && oper.megota == 1 && oper.repeat < 5) {
-            calc = "e".repeat(oper.repeat);
-          } else if (oper.arrow == 0 && oper.expans == 1 && oper.megota == 1) {
-            calc = oper.repeat.toString();
-          } else if (oper.repeat > 1) {
-            calc = "(".concat(calc, ")^").concat(oper.repeat, " ");
-          } else {
-            calc = "".concat(calc);
-          }
-          res += "".concat(calc);
-        }
-        return res;
-      }
-    }, {
-      key: "toJSON",
-      value:
-      /**
-       * Convert `this` to a JSON object
-       * @returns a JSON object
-       */
-      function toJSON() {
-        return "PN" + this.toString();
-      }
-    }, {
-      key: "arr01",
-      get:
-      /**
-       * A property array value for version 0.1.x PowiainaNum.
-       */
-      function get() {
-        var res = [0];
-        for (var i = 0; i < this.array.length; i++) {
-          if (i == 0) res[0] = this.array[i].repeat;else {
-            // @ts-ignore
-            res[i] = [0, 0, 0, 0];
-            // @ts-ignore
-            res[i][0] = this.array[i].arrow == Infinity ? "x" : this.array[i].arrow;
-            // @ts-ignore
-            res[i][1] = this.array[i].repeat;
-            // @ts-ignore
-            res[i][2] = this.array[i].expans == Infinity ? "x" : this.array[i].expans;
-            // @ts-ignore
-            res[i][3] = this.array[i].megota;
-          }
-        }
-        return res;
-      }
     }], [{
       key: "add",
       value: function add(t, other) {
         return new PowiainaNum(t).add(other);
       }
+    }, {
+      key: "plus",
+      value: function plus(t, other) {
+        return new PowiainaNum(t).add(other);
+      }
     }, {
       key: "sub",
       value: function sub(t, other) {
         return new PowiainaNum(t).sub(other);
       }
+    }, {
+      key: "minus",
+      value: function minus(t, other) {
+        return new PowiainaNum(t).sub(other);
+      }
     }, {
       key: "mul",
       value: function mul(t, other) {
         return new PowiainaNum(t).mul(other);
       }
+    }, {
+      key: "times",
+      value: function times(t, other) {
+        return new PowiainaNum(t).mul(other);
+      }
     }, {
       key: "div",
       value: function div(t, other) {
         return new PowiainaNum(t).div(other);
       }
+    }, {
+      key: "divide",
+      value: function divide(t, other) {
+        return new PowiainaNum(t).div(other);
+      }
+    }, {
+      key: "mod",
+      value: function mod(x, y) {
+        return new PowiainaNum(x).mod(y);
+      }
+    }, {
+      key: "modulus",
+      value: function modulus(x, y) {
+        return new PowiainaNum(x).mod(y);
+      }
     }, {
       key: "pow",
       value: function pow(t, other) {
@@ -2026,6 +2271,17 @@
         var base = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : Math.E;
         return new PowiainaNum(t).log(base);
       }
+    }, {
+      key: "log2",
+      value: function log2(t) {
+        return new PowiainaNum(t).log2();
+      }
+    }, {
+      key: "logBase",
+      value: function logBase(t) {
+        var base = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : Math.E;
+        return new PowiainaNum(t).log(base);
+      }
     }, {
       key: "pLog10",
       value: function pLog10(t) {
@@ -2177,6 +2433,27 @@
           };
         }
       }
+    }, {
+      key: "pentate",
+      value: function pentate(x, other, payload) {
+        return new PowiainaNum(x).arrow(3)(other, payload);
+      }
+    }, {
+      key: "hexate",
+      value: function hexate(x, other, payload) {
+        return new PowiainaNum(x).arrow(4)(other, payload);
+      }
+    }, {
+      key: "pent",
+      value: function pent(x, other, payload) {
+        return new PowiainaNum(x).arrow(3)(other, payload);
+      }
+    }, {
+      key: "penta_log",
+      value: function penta_log(x) {
+        var base = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 10;
+        return new PowiainaNum(x).anyarrow_log(3)(base);
+      }
     }, {
       key: "expansion",
       value: function expansion(t, other) {
@@ -2232,7 +2509,10 @@
         if (base.eq(1)) return new PowiainaNum(1);
         if (power.eq(1)) return new PowiainaNum(base);
         if (power.isZero()) return new PowiainaNum(1);
-        if (base.lt(0)) return PowiainaNum.NaN.clone();
+        if (base.lt(0)) {
+          if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
+          return PowiainaNum.NaN.clone();
+        }
         // // check infinite
         // let sufpowiaina = args.slice(4);
         // if (sufpowiaina.filter((f) => new PowiainaNum(f).gte(2)).length > 0) {
@@ -2275,9 +2555,6 @@
           if (a == 0 && e == 1 && m > 1) {
             return [1, 1 / 0, m - 1];
           }
-          if (e == 0 && m > 1) {
-            return [1, 1 / 0, m - 1];
-          }
           return [a, e, m];
         }
         if (megota.gt(MSI)) {
@@ -2291,8 +2568,7 @@
           return x.toString();
         }
         function getMSIForm(arrow, expans, megota) {
-          var conv = convertOperator(arrow, expans, megota);
-          return "10{".concat(infToBang(conv[0]), ",").concat(infToBang(conv[1]), ",").concat(conv[2], "}").concat(MSI);
+          return "10{".concat(infToBang(arrow), ",").concat(infToBang(expans), ",").concat(megota, "}").concat(MSI);
         }
         var t = base.clone();
         var arrows = new PowiainaNum(readArg(0));
@@ -2300,20 +2576,13 @@
           var _r, _r2;
           var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
           console.log("".concat("-".repeat(depth), " {").concat(base2, ",").concat(power2, ",").concat(arrow2, ",").concat(expans2, ",").concat(megota2, "}"));
-          if (depth >= 200) {
-            return new PowiainaNum({
-              layer: 0,
-              array: [newOperator(10), newOperator(1, new PowiainaNum(arrow2).clampMax(MSI).toNumber(), new PowiainaNum(expans2).clampMax(MSI).toNumber(), new PowiainaNum(megota2).clampMax(MSI).toNumber())],
-              sign: 1,
-              small: false
-            }).normalize();
-          }
           var other = new PowiainaNum(other2);
           var 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();
+            if (PowiainaNum.throwErrorOnResultNaN) throw new Error("NaN");
             return PowiainaNum.NaN.clone();
           }
           if (t.eq(PowiainaNum.ONE)) return PowiainaNum.ONE.clone();
@@ -2325,7 +2594,7 @@
           }
           if (expans.eq(0)) {
             return PowiainaNum.BEAF(t, t, t, power, megota.sub(1), powiaina2, depth + 1);
-            // {this, this, power, expans-1, megota}
+            // {this, this, this, power, megota-1}
           }
           if (megota.eq(0)) {
             return PowiainaNum.BEAF(t, t, t, t, expans, new PowiainaNum(powiaina2).sub(1), depth + 1);
@@ -2444,6 +2713,84 @@
       value: function clampMax() {
         return PowiainaNum.min.apply(PowiainaNum, arguments);
       }
+    }, {
+      key: "eq",
+      value: function eq(a, o) {
+        return new PowiainaNum(a).eq(o);
+      }
+    }, {
+      key: "equals",
+      value: function equals(a, o) {
+        return new PowiainaNum(a).eq(o);
+      }
+    }, {
+      key: "neq",
+      value: function neq(a, o) {
+        return new PowiainaNum(a).neq(o);
+      }
+    }, {
+      key: "notEquals",
+      value: function notEquals(a, o) {
+        return new PowiainaNum(a).notEquals(o);
+      }
+    }, {
+      key: "lt",
+      value: function lt(a, o) {
+        return new PowiainaNum(a).lt(o);
+      }
+    }, {
+      key: "gt",
+      value: function gt(a, o) {
+        return new PowiainaNum(a).gt(o);
+      }
+    }, {
+      key: "lte",
+      value: function lte(a, o) {
+        return new PowiainaNum(a).lte(o);
+      }
+    }, {
+      key: "gte",
+      value: function gte(a, o) {
+        return new PowiainaNum(a).gte(o);
+      }
+    }, {
+      key: "rec",
+      value: function rec(t) {
+        return new PowiainaNum(t).rec();
+      }
+    }, {
+      key: "recip",
+      value: function recip(t) {
+        return new PowiainaNum(t).rec();
+      }
+    }, {
+      key: "reciprocate",
+      value: function reciprocate(t) {
+        return new PowiainaNum(t).rec();
+      }
+    }, {
+      key: "floor",
+      value: function floor(x) {
+        return new PowiainaNum(x).floor();
+      }
+    }, {
+      key: "ceil",
+      value: function ceil(x) {
+        return new PowiainaNum(x).ceil();
+      }
+    }, {
+      key: "round",
+      value: function round(x) {
+        return new PowiainaNum(x).round();
+      }
+    }, {
+      key: "trunc",
+      value: function trunc(x) {
+        return new PowiainaNum(x).trunc();
+      }
+      /**
+       * @returns if this<other, return -1, if this=other, return 0, if this>other, return 1, if this!<=>, return 2
+       */
     }, {
       key: "sign",
       value: function sign(a) {
@@ -2457,7 +2804,19 @@
     }, {
       key: "fromNumber",
       value: function fromNumber(x) {
-        var obj = new PowiainaNum(); // NaN
+        var obj = new PowiainaNum();
+        obj.resetFromObject({
+          array: [{
+            arrow: 0,
+            expans: 1,
+            megota: 1,
+            repeat: NaN
+          }],
+          small: false,
+          layer: 0,
+          sign: 0
+        });
+        if (Number.isNaN(x)) return obj;
         if (x < 0) obj.sign = -1; // negative
         else if (x == 0) {
           obj.sign = 0;
@@ -2485,10 +2844,26 @@
     }, {
       key: "fromString",
       value: function fromString(input) {
+        if (PowiainaNum.usingBreakEternityLikeFromString && BE_REGEX.test(input)) {
+          /*
+           * 0i00000000a7 says that eee-3000 will wrongly parse to 1. So i added this
+           */
+          var a = input.match(/(e+-)(\d+(.\d+)?)/);
+          if (a) {
+            var e_s = a[1].length;
+            input = "e-" + "e".repeat(e_s - 1) + a[2];
+          }
+        }
+        return this.fromString_core(input);
+      }
+    }, {
+      key: "fromString_core",
+      value: function fromString_core(input) {
         var _b, _c, _d, _e, _f, _g;
-        var x = new PowiainaNum();
+        var x = new PowiainaNum(NaN);
         // Judge the string was a number
         if (input.startsWith("PN")) input = input.substring(2);
+        if (input == "NaN") return PowiainaNum.NaN.clone();
         input = input.replace(/J\^(\d+)/g, "(10{!})^$1");
         input = input.replace(/J/g, "10{!}");
         input = input.replace(/K\^(\d+)/g, "(10{1,2})^$1");
@@ -2499,17 +2874,20 @@
         input = input.replace(/M/g, "10{!,2}");
         input = input.replace(/N\^(\d+)/g, "(10{1,!})^$1");
         input = input.replace(/N/g, "10{1,!}");
+        if (/^.*e-.*(e|\^).*/.test(input)) {
+          input = "/10^" + input.substring(input.indexOf("e-"));
+        }
         if (!isNaN(Number(input))) {
           var res = Number(input);
-          var _a3 = false;
+          var a = false;
           if (res == 0) {
             if (/^((0)|(0*\.0+e\d+)|(0*\.0*))$/.test(input)) {
-              _a3 = true;
+              a = true;
             }
           } else {
-            _a3 = true;
+            a = true;
           }
-          if (!_a3) {
+          if (!a) {
             var m = input.search(/e/);
             var exponent = input.substring((m == -1 ? input.length : m) + 1);
             var mantissa = input.substring(0, m == -1 ? undefined : m);
@@ -2519,11 +2897,11 @@
             // Is regular number gte 1:
             if (Number(mantissa) >= 1) {
               // check The mantissa is very long?
-              var log10mant = mantissa.length >= LONG_STRING_MIN_LENGTH ? log10LongString(mantissa) : Math.log10(Number(mantissa));
-              var log10int = Math.floor(log10mant);
-              var log10float = log10mant - log10int;
+              var log10mant = mantissa.length >= LONG_STRING_MIN_LENGTH ? log10LongString(mantissa) : Math.log10(Number(mantissa)); // sample 10
+              var log10int = Math.floor(log10mant); // sample 1
+              var log10float = log10mant - log10int; // sample 0;
               mantissaME[0] = Math.pow(10, log10float);
-              mantissaME[1] += log10float;
+              mantissaME[1] += log10int;
             } else {
               // If not , count how many zeros until reached non-zero numbers
               var zeros = countLeadingZerosAfterDecimal(mantissa);
@@ -2538,7 +2916,7 @@
             // /((a*10^b)^-1) = /(a^-1*10^-b) = /(a^-1 * 10 * 10^(-b-1))
             return PowiainaNum.pow(10, -mantissaME[1] - 1).mul(Math.pow(mantissaME[0], -1) * 10).rec();
           }
-          if (isFinite(res) && _a3) {
+          if (isFinite(res) && a) {
             x = PowiainaNum.fromNumber(Number(input));
             return x;
           }
@@ -2555,6 +2933,7 @@
           return x;
         }
         input = replaceETo10(input);
+        input = removeCommasOutsideBraces(input);
         if (!isPowiainaNum.test(input)) {
           throw powiainaNumError + "malformed input: " + input;
         }
@@ -2567,28 +2946,31 @@
           input = input.substring(numSigns);
         }
         if (input[0] == "/") {
-          var numSigns = input.search(/[^\/]/);
-          var signs = input.substring(0, numSigns);
-          recipIt = ((_e = (_d = signs.match(/\//g)) === null || _d === void 0 ? void 0 : _d.length) !== null && _e !== void 0 ? _e : 0) % 2 == 1;
-          input = input.substring(numSigns);
+          var _numSigns = input.search(/[^\/]/);
+          var _signs = input.substring(0, _numSigns);
+          recipIt = ((_e = (_d = _signs.match(/\//g)) === null || _d === void 0 ? void 0 : _d.length) !== null && _e !== void 0 ? _e : 0) % 2 == 1;
+          input = input.substring(_numSigns);
         }
         if (input == "NaN") x.array = [newOperator(NaN)];else if (input == "Infinity") x.array = [newOperator(Infinity)];else {
           x.sign = 1;
           x.array = [newOperator(0)];
-          var a, b, c, d;
+          var _a3, b, c, d;
           if (input[0] == "P") {
             if (input[1] == "^") {
-              a = input.substring(2).search(/[^0-9]/) + 2;
-              x.layer = Number(input.substring(2, a));
-              input = input.substring(a + 1);
+              _a3 = input.substring(2).search(/[^0-9]/) + 2;
+              x.layer = Number(input.substring(2, _a3));
+              input = input.substring(_a3 + 1);
             } else {
-              a = input.search(/[^P]/);
-              x.layer = a;
-              input = input.substring(a);
+              _a3 = input.search(/[^P]/);
+              x.layer = _a3;
+              input = input.substring(_a3);
             }
           }
           while (input) {
             if (/^(\(?10[\^\{])/.test(input)) {
+              var arrows = void 0,
+                expans = void 0,
+                megota = void 0;
               /*
                 10^ - 匹配
                 10{ - 匹配
@@ -2599,30 +2981,29 @@
               */
               if (input[0] == "(") input = input.substring(1);
               //cutted, 10^.... or 10{....
-              var arrows, expans, megota;
               if (input[2] == "^") {
-                a = input.substring(2).search(/[^\^]/);
+                _a3 = input.substring(2).search(/[^\^]/);
                 //cut input to ^^...^^, and search how numbers
-                arrows = a;
+                arrows = _a3;
                 // 10^^^
-                b = a + 2; // b points to after ^'s.
+                b = _a3 + 2; // b points to after ^'s.
               } else {
                 // 10{...}
-                a = input.indexOf("}");
+                _a3 = input.indexOf("}");
                 // select contents between {...}
-                var tmp = input.substring(3, a).split(",");
+                var tmp = input.substring(3, _a3).split(",");
                 arrows = Number(tmp[0] == "!" ? Infinity : tmp[0]);
                 expans = Number((_f = tmp[1] == "!" ? Infinity : tmp[1]) !== null && _f !== void 0 ? _f : 1);
                 megota = Number((_g = tmp[2]) !== null && _g !== void 0 ? _g : 1);
-                b = a + 1;
+                b = _a3 + 1;
                 // b points to after }.
               }
               input = input.substring(b);
               if (input[0] == ")") {
                 // )^....<Space>
-                a = input.indexOf(" ");
-                c = Number(input.substring(2, a)); // Select contents between )^....<Space>
-                input = input.substring(a + 1); // c points to after <Space>
+                _a3 = input.indexOf(" ");
+                c = Number(input.substring(2, _a3)); // Select contents between )^....<Space>
+                input = input.substring(_a3 + 1); // c points to after <Space>
               } else {
                 c = 1; // There is only spaces, count as <ONE>
               }
@@ -2633,21 +3014,21 @@
                   x.array.splice(1, 0, newOperator(c, 1, expans, megota));
                 }
               } else if (arrows == 2 && expans == 1 && megota == 1) {
-                a = x.array.length >= 2 && x.array[1].arrow == 1 ? x.array[1].repeat : 0;
+                _a3 = x.array.length >= 2 && x.array[1].arrow == 1 ? x.array[1].repeat : 0;
                 b = x.array[0].repeat;
-                if (b >= 1e10) ++a;
-                if (b >= 10) ++a;
-                x.array[0].repeat = a;
+                if (b >= 1e10) ++_a3;
+                if (b >= 10) ++_a3;
+                x.array[0].repeat = _a3;
                 if (x.array.length >= 2 && x.array[1].arrow == 1) x.array.splice(1, 1);
                 d = x.getOperatorIndex(2);
                 if (Number.isInteger(d)) x.array[d].repeat += c;else x.array.splice(Math.ceil(d), 0, newOperator(c, 2, expans, megota));
               } else if (isFinite(arrows)) {
-                a = x.getOperator(arrows - 1);
+                _a3 = x.getOperator(arrows - 1);
                 b = x.getOperator(arrows - 2);
-                if (b >= 10) ++a;
+                if (b >= 10) ++_a3;
                 d = x.getOperatorIndex(arrows);
                 x.array.splice(1, Math.ceil(d) - 1);
-                x.array[0].repeat = a;
+                x.array[0].repeat = _a3;
                 if (Number.isInteger(d)) x.array[1].repeat += c;else x.array.splice(1, 0, newOperator(c, arrows, expans, megota));
               } else {
                 x.array.splice(1, 0, newOperator(c, arrows, expans, megota));
@@ -2656,10 +3037,10 @@
               break;
             }
           }
-          a = input.split(/[Ee]/);
+          _a3 = input.split(/[Ee]/);
           b = [x.array[0].repeat, 0];
           c = 1;
-          for (var _i2 = a.length - 1; _i2 >= 0; --_i2) {
+          for (var i = _a3.length - 1; i >= 0; --i) {
             //The things that are already there
             if (b[0] < MSI_LOG10 && b[1] === 0) {
               b[0] = Math.pow(10, c * b[0]);
@@ -2676,12 +3057,12 @@
               b[1]++;
             }
             //Multiplying coefficient
-            var decimalPointPos = a[_i2].indexOf(".");
-            var intPartLen = decimalPointPos == -1 ? a[_i2].length : decimalPointPos;
+            var decimalPointPos = _a3[i].indexOf(".");
+            var intPartLen = decimalPointPos == -1 ? _a3[i].length : decimalPointPos;
             if (b[1] === 0) {
-              if (intPartLen >= LONG_STRING_MIN_LENGTH) b[0] = Math.log10(b[0]) + log10LongString(a[_i2].substring(0, intPartLen)), b[1] = 1;else if (a[_i2]) b[0] *= Number(a[_i2]);
+              if (intPartLen >= LONG_STRING_MIN_LENGTH) b[0] = Math.log10(b[0]) + log10LongString(_a3[i].substring(0, intPartLen)), b[1] = 1;else if (_a3[i]) b[0] *= Number(_a3[i]);
             } else {
-              d = intPartLen >= LONG_STRING_MIN_LENGTH ? log10LongString(a[_i2].substring(0, intPartLen)) : a[_i2] ? Math.log10(Number(a[_i2])) : 0;
+              d = intPartLen >= LONG_STRING_MIN_LENGTH ? log10LongString(_a3[i].substring(0, intPartLen)) : _a3[i] ? Math.log10(Number(_a3[i])) : 0;
               if (b[1] == 1) {
                 b[0] += d;
               } else if (b[1] == 2 && b[0] < MSI_LOG10 + Math.log10(d)) {
@@ -2712,6 +3093,17 @@
       key: "fromObject",
       value: function fromObject(powlikeObject) {
         var obj = new PowiainaNum();
+        obj.resetFromObject({
+          array: [{
+            arrow: 0,
+            expans: 1,
+            megota: 1,
+            repeat: NaN
+          }],
+          small: false,
+          layer: 0,
+          sign: 0
+        });
         obj.array = [];
         if (isExpantaNumArray(powlikeObject)) {
           for (var i = 0; i < powlikeObject.length; i++) {
@@ -2729,8 +3121,8 @@
         } else if (isPowiainaNum01XArray(powlikeObject)) {
           var arrayobj = powlikeObject;
           obj.array[0] = newOperator(arrayobj[0]);
-          for (var _i3 = 1; _i3 < arrayobj.length; _i3++) {
-            var b = arrayobj[_i3];
+          for (var _i4 = 1; _i4 < arrayobj.length; _i4++) {
+            var b = arrayobj[_i4];
             obj.array[1] = newOperator(b[1], replaceXToInfinity(b[0]), replaceXToInfinity(b[2]), b[3]);
           }
           obj.small = false;
@@ -2738,21 +3130,21 @@
           obj.layer = 0;
           return obj;
         } else {
-          for (var _i4 = 0; _i4 < powlikeObject.array.length; _i4++) {
-            obj.array[_i4] = {
-              arrow: powlikeObject.array[_i4].arrow,
-              expans: powlikeObject.array[_i4].expans,
-              megota: powlikeObject.array[_i4].megota,
-              repeat: powlikeObject.array[_i4].repeat,
-              valuereplaced: powlikeObject.array[_i4].valuereplaced
-            };
-          }
-          obj.small = powlikeObject.small;
-          obj.sign = powlikeObject.sign;
-          obj.layer = powlikeObject.layer;
+          obj.resetFromObject(powlikeObject);
           return obj;
         }
       }
+    }, {
+      key: "grahalFunction",
+      value: function grahalFunction(layers2) {
+        var layers = new PowiainaNum(layers2);
+        if (!layers.isInt() || layers.lt(0) || layers.isNaN()) return PowiainaNum.NaN.clone();
+        if (layers.eq(1)) return new PowiainaNum("10^^^(10^)^7625597484984 3638334640023.7783");else if (layers.lte(MSI)) {
+          return new PowiainaNum("(10{!})^".concat(layers.toNumber(), " 10^^^(10^)^7625597484984 3638334640023.7783"));
+        } else {
+          return PowiainaNum.BEAF(3, layers, 1, 2);
+        }
+      }
     }]);
   }();
   _a = Symbol.toStringTag;
@@ -2969,6 +3361,20 @@
   PowiainaNum.POW_2_44_MOD_PI = 1.701173079953;
   //#endregion
   PowiainaNum.arrowFuncMap = new Map();
+  //#region configurations
+  /**
+   * If you set this config to true,
+   *  the `fromString` method will try to parse the string to `PowiainaNum` class with `break_eternity.js` similar `fromString` method, if cannot parse correctly, the program will use `PowiainaNum.js` `fromString` method.
+   */
+  PowiainaNum.usingBreakEternityLikeFromString = true;
+  /**
+   * If you set this config to true, the `constructor` method will return Zero instead of NaN when call new PowiainaNum() with no arguments.
+   */
+  PowiainaNum.blankArgumentConstructorReturnZero = false;
+  /**
+   * If you set this config to true, when calucation returns NaN, the program will throw error.
+   */
+  PowiainaNum.throwErrorOnResultNaN = false;
 
   exports.arraySortFunction = arraySortFunction;
   exports["default"] = PowiainaNum;