powiaina_num.js 0.2.0-beta.1.1 → 0.2.0

package/dist/PowiainaNum.js

@@ -4,51 +4,6 @@
   (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.PowiainaNum = {}));
 })(this, (function (exports) { 'use strict';
 
-  function _arrayLikeToArray(r, a) {
-    (null == a || a > r.length) && (a = r.length);
-    for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e];
-    return n;
-  }
-  function _arrayWithoutHoles(r) {
-    if (Array.isArray(r)) return _arrayLikeToArray(r);
-  }
-  function _classCallCheck(a, n) {
-    if (!(a instanceof n)) throw new TypeError("Cannot call a class as a function");
-  }
-  function _defineProperties(e, r) {
-    for (var t = 0; t < r.length; t++) {
-      var o = r[t];
-      o.enumerable = o.enumerable || !1, o.configurable = !0, "value" in o && (o.writable = !0), Object.defineProperty(e, _toPropertyKey(o.key), o);
-    }
-  }
-  function _createClass(e, r, t) {
-    return r && _defineProperties(e.prototype, r), t && _defineProperties(e, t), Object.defineProperty(e, "prototype", {
-      writable: !1
-    }), e;
-  }
-  function _iterableToArray(r) {
-    if ("undefined" != typeof Symbol && null != r[Symbol.iterator] || null != r["@@iterator"]) return Array.from(r);
-  }
-  function _nonIterableSpread() {
-    throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
-  }
-  function _toConsumableArray(r) {
-    return _arrayWithoutHoles(r) || _iterableToArray(r) || _unsupportedIterableToArray(r) || _nonIterableSpread();
-  }
-  function _toPrimitive(t, r) {
-    if ("object" != typeof t || !t) return t;
-    var e = t[Symbol.toPrimitive];
-    if (void 0 !== e) {
-      var i = e.call(t, r || "default");
-      if ("object" != typeof i) return i;
-      throw new TypeError("@@toPrimitive must return a primitive value.");
-    }
-    return ("string" === r ? String : Number)(t);
-  }
-  function _toPropertyKey(t) {
-    var i = _toPrimitive(t, "string");
-    return "symbol" == typeof i ? i : i + "";
-  }
   function _typeof(o) {
     "@babel/helpers - typeof";
 
@@ -58,16 +13,37 @@
       return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o;
     }, _typeof(o);
   }
-  function _unsupportedIterableToArray(r, a) {
-    if (r) {
-      if ("string" == typeof r) return _arrayLikeToArray(r, a);
-      var t = {}.toString.call(r).slice(8, -1);
-      return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0;
-    }
-  }
 
-  /* Author: VeryrrDefine 0.2.0-beta.1.1*/
-  var _a;
+  /******************************************************************************
+  Copyright (c) Microsoft Corporation.
+
+  Permission to use, copy, modify, and/or distribute this software for any
+  purpose with or without fee is hereby granted.
+
+  THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+  REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
+  AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+  INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
+  LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
+  OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+  PERFORMANCE OF THIS SOFTWARE.
+  ***************************************************************************** */
+
+  function __spreadArray(to, from, pack) {
+      if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+          if (ar || !(i in from)) {
+              if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+              ar[i] = from[i];
+          }
+      }
+      return to.concat(ar || Array.prototype.slice.call(from));
+  }
+
+  typeof SuppressedError === "function" ? SuppressedError : function (error, suppressed, message) {
+      var e = new Error(message);
+      return e.name = "SuppressedError", e.error = error, e.suppressed = suppressed, e;
+  };
+
   var powiainaNumError = "[PowiainaNum 0.2 error]";
   var MSI = 9007199254740991;
   var MSI_LOG10 = 15.954589770191003;
@@ -76,10 +52,16 @@
   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+))$/;
   //#region some useful functions
-  function newOperator(r) {
-    var a = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
-    var e = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;
-    var m = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 1;
+  function newOperator(r, a, e, m) {
+    if (a === void 0) {
+      a = 0;
+    }
+    if (e === void 0) {
+      e = 1;
+    }
+    if (m === void 0) {
+      m = 1;
+    }
     return {
       repeat: r,
       arrow: a,
@@ -89,8 +71,9 @@
     };
   }
   function compareTuples() {
-    for (var _len = arguments.length, tuples = new Array(_len), _key = 0; _key < _len; _key++) {
-      tuples[_key] = arguments[_key];
+    var tuples = [];
+    for (var _i = 0; _i < arguments.length; _i++) {
+      tuples[_i] = arguments[_i];
     }
     for (var i = 0; i < Math.min(tuples[0].length, tuples[1].length); i++) {
       var a = tuples[0][i];
@@ -156,7 +139,13 @@
   //from https://math.stackexchange.com/a/465183
   // 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) {
+  function f_lambertw(z, t, pr) {
+    if (t === void 0) {
+      t = 1e-10;
+    }
+    if (pr === void 0) {
+      pr = true;
+    }
     var tol = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1e-10;
     var principal = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
     var w;
@@ -225,9 +214,13 @@
   // at ``-1/e``. In some corner cases, `lambertw` might currently
   // fail to converge, or can end up on the wrong branch.
   // Evaluates W(x, 0) if principal is true, W(x, -1) if principal is false
-  function d_lambertw(z) {
-    var tol = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1e10;
-    var principal = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
+  function d_lambertw(z, tol, principal) {
+    if (tol === void 0) {
+      tol = 1e10;
+    }
+    if (principal === void 0) {
+      principal = true;
+    }
     z = new PowiainaNum(z);
     var w;
     if (!z.isFinite()) return z;
@@ -268,13 +261,12 @@
     }
   }
   //#endregion
-  var PowiainaNum = /*#__PURE__*/function () {
+  var PowiainaNum = /** @class */function () {
     /**
      * Constructor of PowiainaNum class,
      * If no arguments, return `PowiainaNum.NaN`.
      */
     function PowiainaNum(arg1) {
-      _classCallCheck(this, PowiainaNum);
       this[_a] = "PowiainaNum";
       this.array = [{
         arrow: 0,
@@ -289,11 +281,11 @@
         var obj = PowiainaNum.fromNumber(arg1);
         this.resetFromObject(obj);
       } else if (_typeof(arg1) == "object") {
-        var _obj = PowiainaNum.fromObject(arg1);
-        this.resetFromObject(_obj);
+        var obj = PowiainaNum.fromObject(arg1);
+        this.resetFromObject(obj);
       } else if (typeof arg1 == "string") {
-        var _obj2 = PowiainaNum.fromString(arg1);
-        this.resetFromObject(_obj2);
+        var obj = PowiainaNum.fromString(arg1);
+        this.resetFromObject(obj);
       } else ;
     }
     //#region 4 Basic calculates.
@@ -301,831 +293,647 @@
      * Addition
      * @returns the sum of `this` and `other`
      */
-    return _createClass(PowiainaNum, [{
-      key: "add",
-      value: function add(other) {
-        var _b, _c, _d, _e;
-        var x = this.clone();
-        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();
-        // inf & nan check
-        if (!x.isFinite()) return x.clone();
-        if (!y.isFinite()) return y.clone();
-        // if x or y = 0, return other.
-        if (x.isZero()) return y.clone();
-        if (y.isZero()) return x.clone();
-        // x+ -x = 0
-        if (x.sign == -y.sign && function () {
-          var a = x.abs();
-          var b = y.abs();
-          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) || y.abs().lt(PowiainaNum.E_MSI_REC) || y.abs().gt(PowiainaNum.E_MSI)) {
-          return x.maxabs(y);
-        }
-        if (x.sign == -1) {
-          return x.neg().add(y.neg()).neg();
-        }
-        // if ((x.sign==1&&y.sign==-1&&x.lt(y.abs()))  ) return y.neg().add(x.neg()).neg();
-        var a, b; //a=bigger, b=smaller
-        if (x.cmpabs(y) > 0) {
-          a = x;
-          b = y;
-        } else {
-          b = x;
-          a = y;
-        }
-        var temp = a.toNumber() + b.toNumber();
-        if (isFinite(temp) && temp !== 0) {
-          return PowiainaNum.fromNumber(temp);
-        }
-        var mult = 1;
-        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);
-        }
-        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;
-        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)];
-        } else {
-          r.array = [newOperator(Math.pow(10, Math.abs(l)), 0)];
-        }
-        r.small = l < 0 ? true : false;
-        r.sign *= mult;
-        return r;
-      }
-    }, {
-      key: "sub",
-      value: function sub(a) {
-        return this.add(new PowiainaNum(a).neg());
-      }
-    }, {
-      key: "mul",
-      value: function mul(other) {
-        var x = this.clone();
-        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.eq(PowiainaNum.NEGATIVE_INFINITY) && y.eq(PowiainaNum.NEGATIVE_INFINITY)) return PowiainaNum.POSITIVE_INFINITY.clone();
-        // inf & nan check
-        if (!x.isFinite()) return x.clone();
-        if (!y.isFinite()) return y.clone();
-        if (x.isZero() || y.isZero()) return PowiainaNum.ZERO.clone();
-        // x* x^-1 = 0
-        /* if (x.small==1-y.small&&(function(){
-          let a = x.abs();
-          let b = y.abs();
-          return a.eq(b)
-        })()) return (function () {
-          let a = new PowiainaNum(1);
-          a.sign = x.sign*y.sign as -1|0| 1;
-          return a;
-        })(); */
-        // calculate use number directly using number
-        var t = x.toNumber() * y.toNumber();
-        if (isFinite(t) && t !== 0) {
-          return PowiainaNum.fromNumber(t);
-        }
-        var r;
-        r = x.abs().log10().add(y.abs().log10()).pow10();
-        r.sign = x.sign * y.sign;
-        return r;
+    PowiainaNum.prototype.add = function (other) {
+      var _b, _c, _d, _e;
+      var x = this.clone();
+      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();
+      // inf & nan check
+      if (!x.isFinite()) return x.clone();
+      if (!y.isFinite()) return y.clone();
+      // if x or y = 0, return other.
+      if (x.isZero()) return y.clone();
+      if (y.isZero()) return x.clone();
+      // x+ -x = 0
+      if (x.sign == -y.sign && function () {
+        var a = x.abs();
+        var b = y.abs();
+        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) || y.abs().lt(PowiainaNum.E_MSI_REC) || y.abs().gt(PowiainaNum.E_MSI)) {
+        return x.maxabs(y);
+      }
+      if (x.sign == -1) {
+        return x.neg().add(y.neg()).neg();
+      }
+      // if ((x.sign==1&&y.sign==-1&&x.lt(y.abs()))  ) return y.neg().add(x.neg()).neg();
+      var a, b; //a=bigger, b=smaller
+      if (x.cmpabs(y) > 0) {
+        a = x;
+        b = y;
+      } else {
+        b = x;
+        a = y;
+      }
+      var temp = a.toNumber() + b.toNumber();
+      if (isFinite(temp) && temp !== 0) {
+        return PowiainaNum.fromNumber(temp);
+      }
+      var mult = 1;
+      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);
+      }
+      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;
+      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)];
+      } else {
+        r.array = [newOperator(Math.pow(10, Math.abs(l)), 0)];
       }
-    }, {
-      key: "div",
-      value: function div(other) {
-        var x = new PowiainaNum(other).rec();
-        return this.mul(x);
-      }
-    }, {
-      key: "mod",
-      value: function mod(x) {
-        var other = new PowiainaNum(x);
-        var division = this.div(other);
-        return division.sub(division.floor()).mul(other);
-      }
-      //#endregion
-      //#region power
-      /**
-       * @returns 10 to the power of `this`
-       */
-    }, {
-      key: "pow10",
-      value: function pow10() {
-        var _b, _c;
-        var r = this.clone();
-        // inf & nan check
-        if (!this.isFinite()) return this.clone();
-        if (r.isneg()) {
-          // 10^(-x) = 1/(10^x)
-          r.sign *= -1;
-          return r.pow10().rec();
-        }
-        if (r.lte(308.25471555991675)) {
-          return PowiainaNum.fromNumber(Math.pow(10, r.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)));
-        }
-        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();
+      r.small = l < 0 ? true : false;
+      r.sign *= mult;
+      return r;
+    };
+    PowiainaNum.add = function (t, other) {
+      return new PowiainaNum(t).add(other);
+    };
+    PowiainaNum.prototype.sub = function (a) {
+      return this.add(new PowiainaNum(a).neg());
+    };
+    PowiainaNum.sub = function (t, other) {
+      return new PowiainaNum(t).sub(other);
+    };
+    PowiainaNum.prototype.mul = function (other) {
+      var x = this.clone();
+      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.eq(PowiainaNum.NEGATIVE_INFINITY) && y.eq(PowiainaNum.NEGATIVE_INFINITY)) return PowiainaNum.POSITIVE_INFINITY.clone();
+      // inf & nan check
+      if (!x.isFinite()) return x.clone();
+      if (!y.isFinite()) return y.clone();
+      if (x.isZero() || y.isZero()) return PowiainaNum.ZERO.clone();
+      // x* x^-1 = 0
+      /* if (x.small==1-y.small&&(function(){
+        let a = x.abs();
+        let b = y.abs();
+        return a.eq(b)
+      })()) return (function () {
+        let a = new PowiainaNum(1);
+        a.sign = x.sign*y.sign as -1|0| 1;
+        return a;
+      })(); */
+      // calculate use number directly using number
+      var t = x.toNumber() * y.toNumber();
+      if (isFinite(t) && t !== 0) {
+        return PowiainaNum.fromNumber(t);
+      }
+      var r;
+      r = x.abs().log10().add(y.abs().log10()).pow10();
+      r.sign = x.sign * y.sign;
+      return r;
+    };
+    PowiainaNum.mul = function (t, other) {
+      return new PowiainaNum(t).mul(other);
+    };
+    PowiainaNum.prototype.div = function (other) {
+      var x = new PowiainaNum(other).rec();
+      return this.mul(x);
+    };
+    PowiainaNum.div = function (t, other) {
+      return new PowiainaNum(t).div(other);
+    };
+    PowiainaNum.prototype.mod = function (x) {
+      var other = new PowiainaNum(x);
+      var division = this.div(other);
+      return division.sub(division.floor()).mul(other);
+    };
+    //#endregion
+    //#region power
+    /**
+     * @returns 10 to the power of `this`
+     */
+    PowiainaNum.prototype.pow10 = function () {
+      var _b, _c;
+      var r = this.clone();
+      // inf & nan check
+      if (!this.isFinite()) return this.clone();
+      if (r.isneg()) {
+        // 10^(-x) = 1/(10^x)
+        r.sign *= -1;
+        return r.pow10().rec();
+      }
+      if (r.lte(308.25471555991675)) {
+        return PowiainaNum.fromNumber(Math.pow(10, r.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)));
+      }
+      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;
+    };
+    PowiainaNum.prototype.pow = function (x) {
+      var other = new PowiainaNum(x);
+      if (this.eq(1)) return PowiainaNum.ONE.clone();
+      if (!other.isFinite()) return other.clone();
+      if (!this.isFinite()) return this.clone();
+      if (this.eq(10)) return other.pow10();
+      if (this.isneg()) {
+        if (!other.isInt()) return PowiainaNum.NaN.clone();
+        var r = this.abs().pow(other);
+        r.sign = function () {
+          var a = other.mod(2).round();
+          if (a.eq(0) || a.eq(2)) return 1;
+          return -1;
+        }();
         return r;
       }
-    }, {
-      key: "pow",
-      value: function pow(x) {
-        var other = new PowiainaNum(x);
-        if (this.eq(1)) return PowiainaNum.ONE.clone();
-        if (!other.isFinite()) return other.clone();
-        if (!this.isFinite()) return this.clone();
-        if (this.eq(10)) return other.pow10();
-        if (this.isneg()) {
-          if (!other.isInt()) return PowiainaNum.NaN.clone();
-          var r = this.abs().pow(other);
-          r.sign = function () {
-            var a = other.mod(2).round();
-            if (a.eq(0) || a.eq(2)) return 1;
-            return -1;
-          }();
-          return r;
-        }
-        var a = this.toNumber();
-        var b = other.toNumber();
-        var t = Math.pow(a, b);
-        if (isFinite(t) && t !== 0) {
-          // optimize?
-          return PowiainaNum.fromNumber(t);
-        }
-        if (this.isZero() && other.isZero()) {
-          return PowiainaNum.ONE.clone();
-        }
-        if (this.isZero()) return PowiainaNum.ZERO.clone();
-        if (other.isZero()) return PowiainaNum.ONE.clone();
-        // if this<0, check other' rec is oddd
-        if (this.gt(0)) {
-          // log10(a^b) = b log10(a)
-          return this.log10().mul(other).pow10();
-        } else if (other.rec().mod(2).eq(1)) {
-          return this.neg().log10().mul(other).pow10().neg();
-        }
-        return PowiainaNum.NaN.clone();
-      }
-    }, {
-      key: "pow_base",
-      value: function pow_base(x) {
-        var a = new PowiainaNum(x);
-        return a.pow(this);
-      }
-    }, {
-      key: "root",
-      value: function root(x) {
-        var other = new PowiainaNum(x);
-        return this.pow(other.rec());
-      }
-    }, {
-      key: "sqrt",
-      value: function sqrt() {
-        return this.pow(0.5);
-      }
-    }, {
-      key: "cbrt",
-      value: function cbrt() {
-        return this.abs().root(3).mul(this.sign);
-      }
-    }, {
-      key: "log10",
-      value: function log10() {
-        if (this.isneg()) return PowiainaNum.NaN.clone();
-        if (this.isZero()) return PowiainaNum.NEGATIVE_INFINITY.clone();
-        if (this.small) {
-          var _x = this.clone();
-          _x.small = !_x.small;
-          return _x.log10().neg();
-        }
-        if (this.array.length == 1) return new PowiainaNum(Math.log10(this.array[0].repeat));
-        if (this.gte(PowiainaNum.TETRATED_MSI)) return this.clone();
-        var x = this.clone();
-        x.array[1].repeat = x.array[1].repeat - 1;
-        x.normalize();
-        return x;
-      }
-    }, {
-      key: "log",
-      value: function log() {
-        var base = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : Math.E;
-        // log_a b = log_x b / log_x a;
-        var other = new PowiainaNum(base);
-        return this.log10().div(other.log10());
-      }
-    }, {
-      key: "ln",
-      value: function ln() {
-        return this.log();
+      var a = this.toNumber();
+      var b = other.toNumber();
+      var t = Math.pow(a, b);
+      if (isFinite(t) && t !== 0) {
+        // optimize?
+        return PowiainaNum.fromNumber(t);
+      }
+      if (this.isZero() && other.isZero()) {
+        return PowiainaNum.ONE.clone();
+      }
+      if (this.isZero()) return PowiainaNum.ZERO.clone();
+      if (other.isZero()) return PowiainaNum.ONE.clone();
+      // if this<0, check other' rec is oddd
+      if (this.gt(0)) {
+        // log10(a^b) = b log10(a)
+        return this.log10().mul(other).pow10();
+      } else if (other.rec().mod(2).eq(1)) {
+        return this.neg().log10().mul(other).pow10().neg();
+      }
+      return PowiainaNum.NaN.clone();
+    };
+    PowiainaNum.prototype.pow_base = function (x) {
+      var a = new PowiainaNum(x);
+      return a.pow(this);
+    };
+    PowiainaNum.pow = function (t, other) {
+      return new PowiainaNum(t).pow(other);
+    };
+    PowiainaNum.prototype.root = function (x) {
+      var other = new PowiainaNum(x);
+      return this.pow(other.rec());
+    };
+    PowiainaNum.root = function (t, other) {
+      return new PowiainaNum(t).root(other);
+    };
+    PowiainaNum.prototype.sqrt = function () {
+      return this.pow(0.5);
+    };
+    PowiainaNum.sqrt = function (t) {
+      return new PowiainaNum(t).sqrt();
+    };
+    PowiainaNum.prototype.cbrt = function () {
+      return this.abs().root(3).mul(this.sign);
+    };
+    PowiainaNum.cbrt = function (t) {
+      return new PowiainaNum(t).cbrt();
+    };
+    PowiainaNum.prototype.log10 = function () {
+      if (this.isneg()) return PowiainaNum.NaN.clone();
+      if (this.isZero()) return PowiainaNum.NEGATIVE_INFINITY.clone();
+      if (this.small) {
+        var x_1 = this.clone();
+        x_1.small = !x_1.small;
+        return x_1.log10().neg();
+      }
+      if (this.array.length == 1) return new PowiainaNum(Math.log10(this.array[0].repeat));
+      if (this.gte(PowiainaNum.TETRATED_MSI)) return this.clone();
+      var x = this.clone();
+      x.array[1].repeat = x.array[1].repeat - 1;
+      x.normalize();
+      return x;
+    };
+    PowiainaNum.log10 = function (t) {
+      return new PowiainaNum(t).log10();
+    };
+    PowiainaNum.prototype.log = function (base) {
+      if (base === void 0) {
+        base = Math.E;
       }
-      /**
-       * positive-Log10, Returns the base-10 logarithm of nonnegative Decimals, but returns 0 for negative Decimals.
-       */
-    }, {
-      key: "pLog10",
-      value: function pLog10() {
-        if (this.isneg()) return PowiainaNum.ZERO;
-        return this.log10();
+      // log_a b = log_x b / log_x a;
+      var other = new PowiainaNum(base);
+      return this.log10().div(other.log10());
+    };
+    PowiainaNum.log = function (t, base) {
+      if (base === void 0) {
+        base = Math.E;
       }
-      /**
-       * positive-Log10
-       */
-    }, {
-      key: "exp",
-      value: function exp() {
-        return this.pow_base(Math.E);
+      return new PowiainaNum(t).log(base);
+    };
+    PowiainaNum.prototype.ln = function () {
+      return this.log();
+    };
+    /**
+     * positive-Log10, Returns the base-10 logarithm of nonnegative Decimals, but returns 0 for negative Decimals.
+     */
+    PowiainaNum.prototype.pLog10 = function () {
+      if (this.isneg()) return PowiainaNum.ZERO;
+      return this.log10();
+    };
+    /**
+     * positive-Log10
+     */
+    PowiainaNum.pLog10 = function (t) {
+      return new PowiainaNum(t).pLog10();
+    };
+    PowiainaNum.exp = function (x) {
+      var y = new PowiainaNum(x);
+      return y.pow_base(Math.E);
+    };
+    PowiainaNum.prototype.exp = function () {
+      return this.pow_base(Math.E);
+    };
+    //#endregion
+    //#region some math functions
+    /**
+     * For positive integers, X factorial (written as X!) equals X * (X - 1) * (X - 2) *... * 3 * 2 * 1. 0! equals 1.
+     * This can be extended to real numbers (except for negative integers) via the gamma function, which is what this function does.
+     */
+    //[Code from break_eternity.js]
+    PowiainaNum.prototype.factorial = function () {
+      if (this.abs().lt(MSI)) {
+        return this.add(1).gamma();
+      } else if (this.abs().lt(PowiainaNum.E_MSI)) {
+        return PowiainaNum.exp(this.mul(this.log10().sub(1)));
+      } else {
+        return PowiainaNum.exp(this);
       }
-      //#endregion
-      //#region some math functions
-      /**
-       * For positive integers, X factorial (written as X!) equals X * (X - 1) * (X - 2) *... * 3 * 2 * 1. 0! equals 1.
-       * This can be extended to real numbers (except for negative integers) via the gamma function, which is what this function does.
-       */
-      //[Code from break_eternity.js]
-    }, {
-      key: "factorial",
-      value: function factorial() {
-        if (this.abs().lt(MSI)) {
-          return this.add(1).gamma();
-        } else if (this.abs().lt(PowiainaNum.E_MSI)) {
-          return PowiainaNum.exp(this.mul(this.log10().sub(1)));
-        } else {
-          return PowiainaNum.exp(this);
+    };
+    PowiainaNum.factorial = function (x) {
+      return new PowiainaNum(x).factorial();
+    };
+    /**
+     * The gamma function extends the idea of factorials to non-whole numbers using some calculus.
+     * Gamma(x) is defined as the integral of t^(x-1) * e^-t dt from t = 0 to t = infinity,
+     * and gamma(x) = (x - 1)! for nonnegative integer x, so the factorial for non-whole numbers is defined using the gamma function.
+     */
+    //[Code from break_eternity.js]
+    //from HyperCalc source code
+    PowiainaNum.prototype.gamma = function () {
+      if (this.small) {
+        return this.rec();
+      } else if (this.lte(MSI)) {
+        if (this.lt(24)) {
+          return PowiainaNum.fromNumber(f_gamma(this.sign * this.getOperator(0)));
+        }
+        var t = this.getOperator(0) - 1;
+        var l = 0.9189385332046727; //0.5*Math.log(2*Math.PI)
+        l = l + (t + 0.5) * Math.log(t);
+        l = l - t;
+        var n2 = t * t;
+        var np = t;
+        var lm = 12 * np;
+        var adj = 1 / lm;
+        var l2 = l + adj;
+        if (l2 === l) {
+          return PowiainaNum.exp(l);
         }
-      }
-    }, {
-      key: "gamma",
-      value:
-      /**
-       * The gamma function extends the idea of factorials to non-whole numbers using some calculus.
-       * Gamma(x) is defined as the integral of t^(x-1) * e^-t dt from t = 0 to t = infinity,
-       * and gamma(x) = (x - 1)! for nonnegative integer x, so the factorial for non-whole numbers is defined using the gamma function.
-       */
-      //[Code from break_eternity.js]
-      //from HyperCalc source code
-      function gamma() {
-        if (this.small) {
-          return this.rec();
-        } else if (this.lte(MSI)) {
-          if (this.lt(24)) {
-            return PowiainaNum.fromNumber(f_gamma(this.sign * this.getOperator(0)));
-          }
-          var t = this.getOperator(0) - 1;
-          var l = 0.9189385332046727; //0.5*Math.log(2*Math.PI)
-          l = l + (t + 0.5) * Math.log(t);
-          l = l - t;
-          var n2 = t * t;
-          var np = t;
-          var lm = 12 * np;
-          var adj = 1 / lm;
-          var l2 = l + adj;
-          if (l2 === l) {
-            return PowiainaNum.exp(l);
-          }
-          l = l2;
-          np = np * n2;
-          lm = 360 * np;
-          adj = 1 / lm;
-          l2 = l - adj;
-          if (l2 === l) {
-            return PowiainaNum.exp(l);
-          }
-          l = l2;
-          np = np * n2;
-          lm = 1260 * np;
-          var lt = 1 / lm;
-          l = l + lt;
-          np = np * n2;
-          lm = 1680 * np;
-          lt = 1 / lm;
-          l = l - lt;
+        l = l2;
+        np = np * n2;
+        lm = 360 * np;
+        adj = 1 / lm;
+        l2 = l - adj;
+        if (l2 === l) {
           return PowiainaNum.exp(l);
-        } else if (this.gt(MSI)) {
-          return PowiainaNum.exp(this.mul(this.log().sub(1)));
-        } else {
-          return PowiainaNum.exp(this);
         }
+        l = l2;
+        np = np * n2;
+        lm = 1260 * np;
+        var lt = 1 / lm;
+        l = l + lt;
+        np = np * n2;
+        lm = 1680 * np;
+        lt = 1 / lm;
+        l = l - lt;
+        return PowiainaNum.exp(l);
+      } else if (this.gt(MSI)) {
+        return PowiainaNum.exp(this.mul(this.log().sub(1)));
+      } else {
+        return PowiainaNum.exp(this);
       }
-    }, {
-      key: "lambertw",
-      value:
-      /**
-       * The Lambert W function, also called the omega function or product logarithm, is the solution W(x) === x*e^x.
-       * https://en.wikipedia.org/wiki/Lambert_W_function
-       *
-       * This is a multi-valued function in the complex plane, but only two branches matter for real numbers: the "principal branch" W0, and the "non-principal branch" W_-1.
-       * W_0 works for any number >= -1/e, but W_-1 only works for nonpositive numbers >= -1/e.
-       * The "principal" parameter, which is true by default, decides which branch we're looking for: W_0 is used if principal is true, W_-1 is used if principal is false.
-       */
-      //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;
-        if (this.lt(-0.3678794411710499)) {
+    };
+    PowiainaNum.gamma = function (x) {
+      return new PowiainaNum(x).gamma();
+    };
+    /**
+     * The Lambert W function, also called the omega function or product logarithm, is the solution W(x) === x*e^x.
+     * https://en.wikipedia.org/wiki/Lambert_W_function
+     *
+     * This is a multi-valued function in the complex plane, but only two branches matter for real numbers: the "principal branch" W0, and the "non-principal branch" W_-1.
+     * W_0 works for any number >= -1/e, but W_-1 only works for nonpositive numbers >= -1/e.
+     * The "principal" parameter, which is true by default, decides which branch we're looking for: W_0 is used if principal is true, W_-1 is used if principal is false.
+     */
+    //Code from break_eternity.js
+    //Some special values, for testing: https://en.wikipedia.org/wiki/Lambert_W_function#Special_values
+    PowiainaNum.prototype.lambertw = function (princ) {
+      if (princ === void 0) {
+        princ = true;
+      }
+      var principal = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : true;
+      if (this.lt(-0.3678794411710499)) {
+        return PowiainaNum.NaN.clone(); //complex
+      } else if (principal) {
+        if (this.abs().lt("1e-300")) return new PowiainaNum(this);else if (this.small) {
+          return PowiainaNum.fromNumber(f_lambertw(this.toNumber()));
+        } else if (this.lt(MSI)) {
+          return PowiainaNum.fromNumber(f_lambertw(this.sign * this.getOperator(0)));
+        } else if (this.lt("eee15")) {
+          return d_lambertw(this);
+        } else {
+          // Numbers this large would sometimes fail to converge using d_lambertw, and at this size this.ln() is close enough
+          return this.log();
+        }
+      } else {
+        if (this.sign === 1) {
           return PowiainaNum.NaN.clone(); //complex
-        } else if (principal) {
-          if (this.abs().lt("1e-300")) return new PowiainaNum(this);else if (this.small) {
-            return PowiainaNum.fromNumber(f_lambertw(this.toNumber()));
-          } else if (this.lt(MSI)) {
-            return PowiainaNum.fromNumber(f_lambertw(this.sign * this.getOperator(0)));
-          } else if (this.lt("eee15")) {
-            return d_lambertw(this);
-          } else {
-            // Numbers this large would sometimes fail to converge using d_lambertw, and at this size this.ln() is close enough
-            return this.log();
-          }
+        }
+        if (this.layer === 0) {
+          return PowiainaNum.fromNumber(f_lambertw(this.sign * this.array[0].repeat, 1e-10, false));
+        } else if (this.layer == 1) {
+          return d_lambertw(this, 1e-10, false);
         } else {
-          if (this.sign === 1) {
-            return PowiainaNum.NaN.clone(); //complex
-          }
-          if (this.layer === 0) {
-            return PowiainaNum.fromNumber(f_lambertw(this.sign * this.array[0].repeat, 1e-10, false));
-          } else if (this.layer == 1) {
-            return d_lambertw(this, 1e-10, false);
-          } else {
-            return this.neg().rec().lambertw().neg();
-          }
+          return this.neg().rec().lambertw().neg();
         }
       }
-    }, {
-      key: "tetrate",
-      value:
-      //#endregion
-      //#region higher calculates
-      //#region Tetration
-      // Code from ExpantaNum.js
-      function tetrate(other2) {
-        var payload = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;
-        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.eq(1)) return PowiainaNum.ONE.clone();
-        if (payl.neq(PowiainaNum.ONE)) 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();
+    };
+    PowiainaNum.lambertw = function (x, principal) {
+      if (principal === void 0) {
+        principal = true;
+      }
+      return new PowiainaNum(x).lambertw(principal);
+    };
+    //#endregion
+    //#region higher calculates
+    //#region Tetration
+    // Code from ExpantaNum.js
+    PowiainaNum.prototype.tetrate = function (other2, payload) {
+      if (payload === void 0) {
+        payload = 1;
+      }
+      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.eq(1)) return PowiainaNum.ONE.clone();
+      if (payl.neq(PowiainaNum.ONE)) 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 (t.isZero()) {
+        if (other.isZero()) 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();
+        return PowiainaNum.ONE.clone();
+      }
+      if (other.eq(PowiainaNum.ONE.neg())) return PowiainaNum.ZERO.clone();
+      if (other.eq(PowiainaNum.ZERO)) return PowiainaNum.ONE.clone();
+      if (other.eq(PowiainaNum.ONE)) return t;
+      if (other.eq(2)) return t.pow(t);
+      if (t.eq(2)) {
+        if (other.eq(3)) return PowiainaNum.fromNumber(16);
+        if (other.eq(4)) return PowiainaNum.fromNumber(65536);
+      }
+      var m = t.max(other);
+      if (m.gt(PowiainaNum.PENTATED_MSI)) return m;
+      if (m.gt(PowiainaNum.TETRATED_MSI) || other.gt(MSI)) {
+        if (this.lt(EXP_E_REC)) {
+          negln = t.ln().neg();
           return negln.lambertw().div(negln);
         }
-        if (other.lte(-2)) return PowiainaNum.NaN.clone();
-        if (t.isZero()) {
-          if (other.isZero()) 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();
-          return PowiainaNum.ONE.clone();
-        }
-        if (other.eq(PowiainaNum.ONE.neg())) return PowiainaNum.ZERO.clone();
-        if (other.eq(PowiainaNum.ZERO)) return PowiainaNum.ONE.clone();
-        if (other.eq(PowiainaNum.ONE)) return t;
-        if (other.eq(2)) return t.pow(t);
-        if (t.eq(2)) {
-          if (other.eq(3)) return PowiainaNum.fromNumber(16);
-          if (other.eq(4)) return PowiainaNum.fromNumber(65536);
-        }
-        var m = t.max(other);
-        if (m.gt(PowiainaNum.PENTATED_MSI)) return m;
-        if (m.gt(PowiainaNum.TETRATED_MSI) || other.gt(MSI)) {
-          if (this.lt(EXP_E_REC)) {
-            negln = t.ln().neg();
-            return negln.lambertw().div(negln);
+        var j = t.slog(10).add(other);
+        j.setOperator(j.getOperator(2) + 1, 2);
+        j.normalize();
+        return j;
+      }
+      var y = other.toNumber();
+      var f = Math.floor(y);
+      var r = t.pow(y - f);
+      var l = PowiainaNum.NaN;
+      var i = 0;
+      for (var w = PowiainaNum.E_MSI.clone(); f !== 0 && r.lt(w) && i < 100; ++i) {
+        if (f > 0) {
+          r = t.pow(r);
+          if (l.eq(r)) {
+            f = 0;
+            break;
           }
-          var j = t.slog(10).add(other);
-          j.setOperator(j.getOperator(2) + 1, 2);
-          j.normalize();
-          return j;
-        }
-        var y = other.toNumber();
-        var f = Math.floor(y);
-        var r = t.pow(y - f);
-        var l = PowiainaNum.NaN;
-        var i = 0;
-        for (var w = PowiainaNum.E_MSI.clone(); f !== 0 && r.lt(w) && i < 100; ++i) {
-          if (f > 0) {
-            r = t.pow(r);
-            if (l.eq(r)) {
-              f = 0;
-              break;
-            }
-            l = r;
-            --f;
-          } else {
-            r = r.log(t);
-            if (l.eq(r)) {
-              f = 0;
-              break;
-            }
-            l = r;
-            ++f;
+          l = r;
+          --f;
+        } else {
+          r = r.log(t);
+          if (l.eq(r)) {
+            f = 0;
+            break;
           }
+          l = r;
+          ++f;
         }
-        if (i == 100 || this.lt(EXP_E_REC)) f = 0;
-        r.setOperator(r.getOperator(1) + f, 1);
-        r.normalize();
-        return r;
       }
-      // Code from ExpantaNum.js
-    }, {
-      key: "slog",
-      value: function slog() {
-        var base = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 10;
-        var x = this.clone();
-        var b = new PowiainaNum(base);
-        if (x.isInfiNaN()) return x;
-        if (b.isNaN()) return b;
-        if (b.isInfi()) return PowiainaNum.ZERO.clone();
-        if (x.isZero()) return PowiainaNum.ONE.clone();
-        if (x.eq(PowiainaNum.ONE)) return PowiainaNum.ZERO.clone();
-        if (x.eq(b)) return PowiainaNum.ONE.clone();
-        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.max(b).gt(PowiainaNum.PENTATED_MSI)) {
-          if (x.gt(b)) return x;
-          return PowiainaNum.ZERO.clone();
-        }
-        if (x.max(b).gt(PowiainaNum.TETRATED_MSI)) {
-          if (x.gt(b)) {
-            x.setOperator(x.getOperator(2) - 1, 2);
-            x.normalize();
-            return x.sub(x.getOperator(1));
-          }
-        }
-        if (x.lt(PowiainaNum.ZERO.clone())) return b.pow(x).sub(2);
-        // base^base^... = x? (? bases)
-        var r = 0;
-        // 计算x与base的差距
-        var t = x.getOperator(1) - b.getOperator(1);
-        if (t > 3) {
-          var l = t - 3;
-          r += l;
-          x.setOperator(x.getOperator(1) - l, 1);
-        }
-        // 假设b=3， x=1e19
-        for (var i = 0; i < 100; ++i) {
-          if (x.lt(PowiainaNum.ZERO)) {
-            x = PowiainaNum.pow(base, x);
-            --r;
-          } else if (x.lte(1)) {
-            // 第五次，进入此处
-            // 结果=4+0.08795395574340908-1=3.087953...
-            // 验算3**3**3**(3**.08795395574340908)=10000000000000720000,符合预期
-            return new PowiainaNum(r + x.toNumber() - 1);
-          } else {
-            // 第1-4次迭代，进入此处
-            ++r;
-            x = PowiainaNum.log(x, base);
-            // 第一次：r = 1, x = log_3(1e19) ~ 39.822162211498316
-            // 第二次：r = 2, x = log_3(39.822...) ~ 3.353706885314807
-            // 第三次：r = 3, x = log_3(3.3537...) ~ 1.1014497830508163
-            // 第四次：r = 4, x = log_3(1.1014...) ~ 0.08795395574340908
-          }
+      if (i == 100 || this.lt(EXP_E_REC)) f = 0;
+      r.setOperator(r.getOperator(1) + f, 1);
+      r.normalize();
+      return r;
+    };
+    // Code from ExpantaNum.js
+    PowiainaNum.prototype.slog = function (base) {
+      if (base === void 0) {
+        base = 10;
+      }
+      var x = this.clone();
+      var b = new PowiainaNum(base);
+      if (x.isInfiNaN()) return x;
+      if (b.isNaN()) return b;
+      if (b.isInfi()) return PowiainaNum.ZERO.clone();
+      if (x.isZero()) return PowiainaNum.ONE.clone();
+      if (x.eq(PowiainaNum.ONE)) return PowiainaNum.ZERO.clone();
+      if (x.eq(b)) return PowiainaNum.ONE.clone();
+      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.max(b).gt(PowiainaNum.PENTATED_MSI)) {
+        if (x.gt(b)) return x;
+        return PowiainaNum.ZERO.clone();
+      }
+      if (x.max(b).gt(PowiainaNum.TETRATED_MSI)) {
+        if (x.gt(b)) {
+          x.setOperator(x.getOperator(2) - 1, 2);
+          x.normalize();
+          return x.sub(x.getOperator(1));
+        }
+      }
+      if (x.lt(PowiainaNum.ZERO.clone())) return b.pow(x).sub(2);
+      // base^base^... = x? (? bases)
+      var r = 0;
+      // 计算x与base的差距
+      var t = x.getOperator(1) - b.getOperator(1);
+      if (t > 3) {
+        var l = t - 3;
+        r += l;
+        x.setOperator(x.getOperator(1) - l, 1);
+      }
+      // 假设b=3， x=1e19
+      for (var i = 0; i < 100; ++i) {
+        if (x.lt(PowiainaNum.ZERO)) {
+          x = PowiainaNum.pow(base, x);
+          --r;
+        } else if (x.lte(1)) {
+          // 第五次，进入此处
+          // 结果=4+0.08795395574340908-1=3.087953...
+          // 验算3**3**3**(3**.08795395574340908)=10000000000000720000,符合预期
+          return new PowiainaNum(r + x.toNumber() - 1);
+        } else {
+          // 第1-4次迭代，进入此处
+          ++r;
+          x = PowiainaNum.log(x, base);
+          // 第一次：r = 1, x = log_3(1e19) ~ 39.822162211498316
+          // 第二次：r = 2, x = log_3(39.822...) ~ 3.353706885314807
+          // 第三次：r = 3, x = log_3(3.3537...) ~ 1.1014497830508163
+          // 第四次：r = 4, x = log_3(1.1014...) ~ 0.08795395574340908
         }
-        if (x.gt(10)) return new PowiainaNum(r);
-        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.isFinite()) return x;
-        if (x.gt(PowiainaNum.TETRATED_MSI)) return x;
-        if (x.gt(PowiainaNum.EE_MSI)) {
-          x.setOperator(x.getOperator(1) - 1, 1);
-          return x;
-        }
-        // use lambertw
-        var l = x.ln();
-        return l.div(l.lambertw());
+      if (x.gt(10)) return new PowiainaNum(r);
+      return PowiainaNum.NaN.clone();
+    };
+    PowiainaNum.tetrate = function (t, other2, payload) {
+      if (payload === void 0) {
+        payload = 1;
       }
-    }, {
-      key: "iteratedlog",
-      value:
-      /**
-       * iterated-log
-       *
-       * @example new P("10^10^3").iteratedlog(2,10) == 3
-       */
-      function iteratedlog() {
-        var other2 = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 1;
-        var base2 = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 10;
-        var t = this.clone();
-        var base = new PowiainaNum(base2);
-        var other = new PowiainaNum(other2);
-        if (other.isZero()) return t;
-        if (other.eq(PowiainaNum.ONE)) return t.log(base);
-        return base.tetrate(t.slog(base).sub(other));
-      }
-      //#endregion
-    }, {
-      key: "arrow",
-      value: function arrow(arrows2) {
-        var t = this.clone();
-        var 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) {
-          var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
-          var other = new PowiainaNum(other2);
-          var ctt = PowiainaNum.arrowFuncMap.get("".concat(t.toString(), " ").concat(arrows.toString(), " ").concat(other.toString(), " ").concat(depth));
-          if (ctt) return ctt.clone();
-          var res = function () {
-            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();
-              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;
-            }
-            var 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({
-                small: false,
-                sign: 1,
-                layer: 0,
-                array: [newOperator(10, 0), newOperator(1, arrowsNum)]
-              });
-            }
-            var y = other.toNumber();
-            var f = Math.floor(y);
-            var arrows_m1 = arrows.sub(PowiainaNum.ONE);
-            r = t.arrow(arrows_m1)(y - f, depth + 1);
-            var i = 0;
-            for (var 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("".concat(t.toString(), " ").concat(arrows.toString(), " ").concat(other.toString(), " ").concat(depth), res.clone());
-          }
-          return res;
-        };
+      return new PowiainaNum(t).tetrate(other2, payload);
+    };
+    PowiainaNum.prototype.ssqrt = function () {
+      var x = this.clone();
+      if (x.lt(1 / EXP_E_REC)) return PowiainaNum.NaN.clone();
+      if (!x.isFinite()) return x;
+      if (x.gt(PowiainaNum.TETRATED_MSI)) return x;
+      if (x.gt(PowiainaNum.EE_MSI)) {
+        x.setOperator(x.getOperator(1) - 1, 1);
+        return x;
       }
-    }, {
-      key: "anyarrow_log",
-      value: function anyarrow_log(arrow2) {
-        var x = this.clone();
-        var arrow = new PowiainaNum(arrow2);
-        var arrowsNum = arrow.toNumber();
-        if (arrow.gt(MSI)) {
-          throw new Error(powiainaNumError + "Not implemented");
-        }
-        if (!arrow.isInt() || arrow.lt(0)) return function () {
-          return PowiainaNum.NaN.clone();
-        };
-        if (arrow.eq(0)) return function (base) {
-          return x.div(base);
-        };
-        if (arrow.eq(1)) return function (base) {
-          return x.log(base);
-        };
-        if (arrow.eq(2)) return function (base) {
-          return x.slog(base);
-        };
-        if (x.isInfiNaN()) return function () {
-          return x;
-        };
-        return function (base) {
-          var b = new PowiainaNum(base);
-          if (b.isNaN()) return b;
-          if (b.isInfi()) return PowiainaNum.ZERO.clone();
-          if (x.isZero()) return PowiainaNum.ONE.clone();
-          if (x.eq(PowiainaNum.ONE)) return PowiainaNum.ZERO.clone();
-          if (x.eq(b)) return PowiainaNum.ONE.clone();
-          if (x.max(b).gt(PowiainaNum.arrowMSI(arrowsNum + 1))) {
-            if (x.gt(b)) return x;
-            return PowiainaNum.ZERO.clone();
-          }
-          if (x.max(b).gt(PowiainaNum.arrowMSI(arrowsNum))) {
-            if (x.gt(b)) {
-              x.setOperator(x.getOperator(arrowsNum) - 1, arrowsNum);
-              x.normalize();
-              return x.sub(x.getOperator(arrowsNum - 1));
-            }
-          }
-          if (x.lt(PowiainaNum.ZERO.clone())) 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;
-            r += l;
-            x.setOperator(x.getOperator(arrowsNum) - l, arrowsNum);
-          }
-          // 假设b=3， x=1e19
-          for (var i = 0; i < 100; ++i) {
-            if (x.lt(PowiainaNum.ZERO)) {
-              x = x.arrow(arrowsNum - 1)(base);
-              --r;
-            } else if (x.lte(1)) {
-              return new PowiainaNum(r + x.toNumber() - 1);
-            } else {
-              // 第1-4次迭代，进入此处
-              ++r;
-              x = x.anyarrow_log(arrowsNum - 1)(base);
-            }
-          }
-          if (x.gt(10)) return new PowiainaNum(r);
+      // use lambertw
+      var l = x.ln();
+      return l.div(l.lambertw());
+    };
+    PowiainaNum.tetrate_10 = function (other2) {
+      return PowiainaNum.fromNumber(10).tetrate(other2);
+    };
+    /**
+     * iterated-log
+     *
+     * @example new P("10^10^3").iteratedlog(2,10) == 3
+     */
+    PowiainaNum.prototype.iteratedlog = function (other2, base2) {
+      if (other2 === void 0) {
+        other2 = 1;
+      }
+      if (base2 === void 0) {
+        base2 = 10;
+      }
+      var t = this.clone();
+      var base = new PowiainaNum(base2);
+      var other = new PowiainaNum(other2);
+      if (other.isZero()) return t;
+      if (other.eq(PowiainaNum.ONE)) return t.log(base);
+      return base.tetrate(t.slog(base).sub(other));
+    };
+    //#endregion
+    /**
+     * Arrow operation, return a function
+     * The function has a parameter `other`
+     * call this function returns a powiainanum `this`{`arrow2`}`other`
+     * @param arrows2 arrow count
+     * @returns A function
+     */
+    PowiainaNum.prototype.arrow = function (arrows2) {
+      var t = this.clone();
+      var 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();
         };
       }
-    }, {
-      key: "chain",
-      value: function chain(other, arrows) {
-        return this.arrow(arrows)(other);
-      }
-    }, {
-      key: "pentate",
-      value: function pentate(other) {
-        return this.arrow(3)(other);
-      }
-    }, {
-      key: "hexate",
-      value: function hexate(other) {
-        return this.arrow(4)(other);
-      }
-      /**
-       * Expansion, which is `this`{{1}}`other2`.
-       *
-       * Expansion refers to the binary function a{{1}}b = a{a{...a{b}a...}a}a where there are b a's from the center out. It is {a,b,1,2} in BEAF and a{X+1}b in X-Sequence Hyper-Exponential Notation. The notation a{c}b means {a,b,c}, which is a "c + 2"-ated to b, using the bracket operator.
-       *
-       * @url https://googology.fandom.com/wiki/Expansion
-       */
-    }, {
-      key: "expansion",
-      value: 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.eq(2)) return new PowiainaNum(4);
-        if (other.eq(0)) return PowiainaNum.ONE.clone();
-        var r;
-        // I don't know is this added partrs work correctly...
-        if (t.gt("10{1,2}".concat(MSI)) || other.gt(MSI)) {
-          if (t.gt("10{1,2}".concat(MSI))) {
-            r = t.clone();
-            r.setOperator(r.getOperator(1, 2) - 1, 1, 2);
-            r.normalize();
-          } else if (t.gt("10{".concat(MSI, "}10"))) {
-            r = new PowiainaNum(t.getOperator(Infinity));
-          } else {
-            r = PowiainaNum.ZERO;
-          }
-          var j = r.add(other);
-          j.setOperator(j.getOperator(1, 2) + 1, 1, 2);
-          j.normalize();
-          return j;
+      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, payload2, depth) {
+        if (depth === void 0) {
+          depth = 0;
         }
-        var f = other.toNumber() - 1;
-        r = t.clone();
-        var i;
-        for (i = 0; f !== 0 && r.lt(MSI) && i < 100; ++i) {
-          if (f > 0) {
-            r = t.arrow(r)(t);
-            --f;
-          }
-        }
-        if (i == 100) f = 0;
-        r.setOperator(r.getOperator(Infinity) + f, Infinity);
-        r.normalize();
-        return r;
-      }
-    }, {
-      key: "expansionArrow",
-      value: function expansionArrow(arrow2) {
-        var arrow = new PowiainaNum(arrow2);
-        var t = this.clone();
-        if (arrow.lt(0) || !arrow.isInt() || arrow.isNaN() || this.isNaN()) return function () {
-          return PowiainaNum.NaN.clone();
-        };
-        if (arrow.eq(0)) return function (other) {
-          return t.arrow(other)(t);
-        };
-        if (arrow.eq(1)) return function (other) {
-          return t.expansion(other);
-        };
-        var arrows = arrow;
-        return function (other2) {
-          var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
-          var other = new PowiainaNum(other2);
+        var other = new PowiainaNum(other2);
+        var payload = new PowiainaNum(payload2);
+        var ctt = PowiainaNum.arrowFuncMap.get("".concat(t.toString(), " ").concat(arrows.toString(), " ").concat(other.toString(), " ").concat(depth));
+        if (ctt) return ctt.clone();
+        var res = function () {
           var r;
-          if (t.isNaN() || other.isNaN()) return PowiainaNum.NaN.clone();
+          if (t.isNaN() || other.isNaN() || payload.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 (payload.neq(PowiainaNum.ONE)) other = other.add(payload.anyarrow_log(arrows)(t));
           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,2}, x=arrow;
+          // arrow > 9e15, that using 10{x}, x=arrow;
           if (arrows.gt(PowiainaNum.MSI)) {
             r = arrows.clone();
-            r.setOperator(r.getOperator(Infinity, 2) + 1, Infinity, 2);
+            r.setOperator(r.getOperator(Infinity) + 1, Infinity);
             return r;
           }
           var arrowsNum = arrows.toNumber();
           // arrow < 9e15
           // 10{x}2 = 10{x-1}10
-          if (other.eq(2)) return t.expansionArrow(arrowsNum - 1)(t, depth + 1);
-          if (t.max(other).gt("10{".concat(arrowsNum + 1, ",2}").concat(MSI))) return t.max(other);
-          if (t.gt("10{".concat(arrowsNum, ",2}").concat(MSI)) || other.gt(MSI)) {
-            if (t.gt("10{".concat(arrowsNum, ",2}").concat(MSI))) {
+          if (other.eq(2)) return t.arrow(arrowsNum - 1)(t, payload, 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, 2) - 1, arrowsNum, 2);
+              r.setOperator(r.getOperator(arrowsNum) - 1, arrowsNum);
               r.normalize();
-            } else if (t.gt("10{".concat(arrowsNum - 1, ",2}").concat(MSI))) {
-              r = new PowiainaNum(t.getOperator(arrowsNum - 1, 2));
+            } 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, 2) + 1, arrowsNum, 2);
+            j.setOperator(j.getOperator(arrowsNum) + 1, arrowsNum);
             j.normalize();
             return j;
           }
@@ -1134,1550 +942,1587 @@
               small: false,
               sign: 1,
               layer: 0,
-              array: [newOperator(10, 0), newOperator(1, arrowsNum, 2)]
+              array: [newOperator(10, 0), newOperator(1, arrowsNum)]
             });
           }
           var y = other.toNumber();
           var f = Math.floor(y);
           var arrows_m1 = arrows.sub(PowiainaNum.ONE);
-          r = t.expansionArrow(arrows_m1)(y - f, depth + 1);
+          r = t.arrow(arrows_m1)(y - f, payload, depth + 1);
           var i = 0;
-          for (var m = new PowiainaNum("10{".concat(arrowsNum - 1, ",2}").concat(MSI)); f !== 0 && r.lt(m) && i < 100; i++) {
+          for (var m = PowiainaNum.arrowMSI(arrowsNum - 1); f !== 0 && r.lt(m) && i < 100; i++) {
             if (f > 0) {
-              r = t.expansionArrow(arrows_m1)(r, depth + 1);
+              r = t.arrow(arrows_m1)(r, payload, depth + 1);
               --f;
             }
           }
           if (i == 100) f = 0;
-          r.setOperator(r.getOperator(arrowsNum - 1, 2) + f, arrowsNum - 1, 2);
+          r.setOperator(r.getOperator(arrowsNum - 1) + f, arrowsNum - 1);
           r.normalize();
           return r;
-        };
-      }
-    }, {
-      key: "multiExpansion",
-      value: function multiExpansion(other) {
-        return this.expansionArrow(2)(other);
-      }
-    }, {
-      key: "powerExpansion",
-      value: function powerExpansion(other) {
-        return this.expansionArrow(3)(other);
-      }
-    }, {
-      key: "explosion",
-      value: function explosion(other) {
-        return PowiainaNum.BEAF(this, other, 1, 3);
-      }
-    }, {
-      key: "megotion",
-      value: function megotion(other) {
-        return PowiainaNum.BEAF(this, other, 1, 1, 2);
-      }
-    }, {
-      key: "powiaination",
-      value: function powiaination(other) {
-        return PowiainaNum.BEAF(this, other, 1, 1, 1, 2);
-      }
-    }, {
-      key: "abs",
-      value:
-      //#endregion
-      //#region comparsion
-      function abs() {
-        var obj = this.clone();
-        if (obj.sign < 0) obj.sign *= -1;
-        return obj;
-      }
-    }, {
-      key: "clampMin",
-      value:
-      /**
-       * Restrict a number be not lower than a number
-       *
-       * It's also an alias of `PowiainaNum.max`.
-       * @returns restricted number
-       */
-      function clampMin() {
-        for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
-          args[_key2] = arguments[_key2];
+        }();
+        if (depth < PowiainaNum.maxOps + 10) {
+          PowiainaNum.arrowFuncMap.set("".concat(t.toString(), " ").concat(arrows.toString(), " ").concat(other.toString(), " ").concat(depth), res.clone());
         }
-        return PowiainaNum.max.apply(PowiainaNum, [this].concat(args));
-      }
-      /**
-       * Restrict a number be not higher than a number
-       *
-       * It's also an alias of `PowiainaNum.min`.
-       * @returns restricted number
-       */
-    }, {
-      key: "clampMax",
-      value:
-      /**
-       * Restrict a number be not higher than a number
-       *
-       * It's also an alias of `PowiainaNum.min`.
-       * @returns restricted number
-       */
-      function clampMax() {
-        for (var _len3 = arguments.length, args = new Array(_len3), _key3 = 0; _key3 < _len3; _key3++) {
-          args[_key3] = arguments[_key3];
+        return res;
+      };
+    };
+    /**
+     * return `base`{`arrow2`}`x` = `this` which `x` is.
+     *
+     * @param arrow2
+     * @returns
+     */
+    PowiainaNum.prototype.anyarrow_log = function (arrow2) {
+      var x = this.clone();
+      var arrow = new PowiainaNum(arrow2);
+      var arrowsNum = arrow.toNumber();
+      if (arrow.gt(MSI)) {
+        throw new Error(powiainaNumError + "Not implemented");
+      }
+      if (!arrow.isInt() || arrow.lt(0)) return function () {
+        return PowiainaNum.NaN.clone();
+      };
+      if (arrow.eq(0)) return function (base) {
+        return x.div(base);
+      };
+      if (arrow.eq(1)) return function (base) {
+        return x.log(base);
+      };
+      if (arrow.eq(2)) return function (base) {
+        return x.slog(base);
+      };
+      if (x.isInfiNaN()) return function () {
+        return x;
+      };
+      return function (base, depth) {
+        if (depth === void 0) {
+          depth = 0;
         }
-        return PowiainaNum.min.apply(PowiainaNum, [this].concat(args));
-      }
-      /**
-       * A combination of minimum and maximum: the value returned by clamp is normally 'this', but it won't go below 'min' and it won't go above 'max'.
-       * Therefore, if 'this' < 'min', then 'min' is returned, and if 'this' > 'max', then 'max' is returned.
-       */
-    }, {
-      key: "clamp",
-      value: function clamp(min, max) {
-        return this.max(min).min(max);
-      }
-    }, {
-      key: "max",
-      value: function max() {
-        for (var _len4 = arguments.length, args = new Array(_len4), _key4 = 0; _key4 < _len4; _key4++) {
-          args[_key4] = arguments[_key4];
+        var b = new PowiainaNum(base);
+        if (b.isNaN()) return b;
+        if (b.isInfi()) return PowiainaNum.ZERO.clone();
+        if (x.isZero()) return PowiainaNum.ONE.clone();
+        if (x.eq(PowiainaNum.ONE)) return PowiainaNum.ZERO.clone();
+        if (x.eq(b)) return PowiainaNum.ONE.clone();
+        if (x.max(b).gt(PowiainaNum.arrowMSI(arrowsNum + 1))) {
+          if (x.gt(b)) return x;
+          return PowiainaNum.ZERO.clone();
         }
-        return PowiainaNum.max.apply(PowiainaNum, [this].concat(args));
-      }
-    }, {
-      key: "min",
-      value: function min() {
-        for (var _len5 = arguments.length, args = new Array(_len5), _key5 = 0; _key5 < _len5; _key5++) {
-          args[_key5] = arguments[_key5];
+        if (x.max(b).gt(PowiainaNum.arrowMSI(arrowsNum))) {
+          if (x.gt(b)) {
+            x.setOperator(x.getOperator(arrowsNum) - 1, arrowsNum);
+            x.normalize();
+            return x.sub(x.getOperator(arrowsNum - 1));
+          }
         }
-        return PowiainaNum.min.apply(PowiainaNum, [this].concat(args));
-      }
-      /**
-       * Compare what PowiainaNum's absolute value is max
-       * @param args
-       * @returns absolute value max number's absolute value
-       */
-    }, {
-      key: "maxabs",
-      value: function maxabs() {
-        for (var _len6 = arguments.length, args = new Array(_len6), _key6 = 0; _key6 < _len6; _key6++) {
-          args[_key6] = arguments[_key6];
-        }
-        var other = args.map(function (x) {
-          return new PowiainaNum(x).abs();
-        });
-        return PowiainaNum.max.apply(PowiainaNum, [this.abs()].concat(_toConsumableArray(other)));
-      }
-    }, {
-      key: "minabs",
-      value: function minabs() {
-        for (var _len7 = arguments.length, args = new Array(_len7), _key7 = 0; _key7 < _len7; _key7++) {
-          args[_key7] = arguments[_key7];
+        if (x.lt(PowiainaNum.ZERO.clone())) 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;
+          r += l;
+          x.setOperator(x.getOperator(arrowsNum) - l, arrowsNum);
         }
-        var other = args.map(function (x) {
-          return new PowiainaNum(x).abs();
-        });
-        return PowiainaNum.min.apply(PowiainaNum, [this.abs()].concat(_toConsumableArray(other)));
-      }
-    }, {
-      key: "cmpabs",
-      value: function cmpabs(x) {
-        var other = new PowiainaNum(x).abs();
-        return this.abs().cmp(other);
-      }
-    }, {
-      key: "compare",
-      value: function compare(x) {
-        var other = new PowiainaNum(x);
-        if (this.isNaN() || other.isNaN()) return 2;
-        if (this.sign < other.sign) return -1;
-        if (this.sign > other.sign) return 1;
-        //this.sign = other.sign
-        var allneg = this.sign == -1 && other.sign == -1;
-        if (this.small && !other.small) return -1 * (allneg ? -1 : 1);
-        if (other.small && !this.small) return 1 * (allneg ? -1 : 1);
-        var resultreverse = 1;
-        if (this.small && other.small) resultreverse *= -1;
-        if (allneg) resultreverse *= -1;
-        var result = 0;
-        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];
-          var cmp = compareTuples([op1.megota, op1.expans, op1.arrow, op1.repeat], [op2.megota, op2.expans, op2.arrow, op2.repeat]);
-          if (cmp == 1) {
-            result = 1;
-            break;
-          } else if (cmp == -1) {
-            result = -1;
-            break;
+        // 假设b=3， x=1e19
+        for (var i = 0; i < 100; ++i) {
+          if (x.lt(PowiainaNum.ZERO)) {
+            x = x.arrow(arrowsNum - 1)(base);
+            --r;
+          } else if (x.lte(1)) {
+            return new PowiainaNum(r + x.toNumber() - 1);
+          } else {
+            // 第1-4次迭代，进入此处
+            ++r;
+            x = x.anyarrow_log(arrowsNum - 1)(base, depth + 1);
           }
         }
-        return result * resultreverse + 1 - 1;
-      }
-    }, {
-      key: "cmp",
-      value: function cmp(other) {
-        return this.compare(other);
-      }
-    }, {
-      key: "eq",
-      value: function eq(other) {
-        return this.cmp(other) === 0;
-      }
-    }, {
-      key: "neq",
-      value: function neq(other) {
-        return this.cmp(other) !== 0;
-      }
-    }, {
-      key: "lt",
-      value: function lt(other) {
-        return this.cmp(other) === -1;
-      }
-    }, {
-      key: "lte",
-      value: function lte(other) {
-        return this.cmp(other) <= 0;
-      }
-    }, {
-      key: "gt",
-      value: function gt(other) {
-        return this.cmp(other) == 1;
-      }
-    }, {
-      key: "gte",
-      value: function gte(other) {
-        var t = this.cmp(other);
-        return t == 0 || t == 1;
-      }
-    }, {
-      key: "eq_tolerance",
-      value: function eq_tolerance(value) {
-        var tolerance = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1e-7;
-        var dec = new PowiainaNum(value);
-        return this.sub(dec).lte(this.max(dec).mul(tolerance));
-      }
-      //#endregion
-      //#region geometry
-    }, {
-      key: "sin",
-      value: function sin() {
-        var x = this.clone();
-        if (x.isneg()) {
-          return x.neg().sin().neg();
-        }
-        var y = x.mod(7074237752028440);
-        return PowiainaNum.fromNumber(Math.sin(y.toNumber()));
-      }
-    }, {
-      key: "cos",
-      value: function cos() {
-        return this.sub(Math.PI / 2).sin();
-      }
-    }, {
-      key: "tan",
-      value: function tan() {
-        return this.sin().div(this.cos());
-      }
-    }, {
-      key: "cot",
-      value: function cot() {
-        return this.cos().div(this.sin());
-      }
-    }, {
-      key: "sec",
-      value: function sec() {
-        return this.cos().rec();
-      }
-    }, {
-      key: "csc",
-      value: function csc() {
-        return this.sin().rec();
-      }
-      //#endregion
-      //#region neg, rec, floor, ceil, round, trunc, sign
-    }, {
-      key: "neg",
-      value: function neg() {
-        var a = this.clone();
-        a.sign *= -1;
-        a.normalize();
-        return a;
+        if (x.gt(10)) return new PowiainaNum(r);
+        return PowiainaNum.NaN.clone();
+      };
+    };
+    /**
+     * Arrow height inverse (ExpantaNum.js), an alias of `anyarrow_log`
+     * @param arrows
+     * @returns
+     */
+    PowiainaNum.prototype.arrow_height_inverse = function (arrows) {
+      return this.anyarrow_log(arrows);
+    };
+    PowiainaNum.arrowMSI = function (arrowsNum) {
+      return new PowiainaNum("10{".concat(arrowsNum, "}").concat(MSI));
+    };
+    PowiainaNum.prototype.chain = function (other, arrows) {
+      return this.arrow(arrows)(other);
+    };
+    PowiainaNum.hyper = function (arr) {
+      var z = new PowiainaNum(arr);
+      if (z.eq(0)) return function (x, y) {
+        return new PowiainaNum(y).eq(0) ? new PowiainaNum(x) : new PowiainaNum(x).add(1);
+      };
+      if (z.eq(1)) return PowiainaNum.add;else if (z.eq(2)) return PowiainaNum.mul;else if (z.eq(3)) return PowiainaNum.pow;else {
+        return function (x, y) {
+          return new PowiainaNum(x).arrow(z.sub(2))(y);
+        };
       }
-    }, {
-      key: "rec",
-      value: function rec() {
-        var a = this.clone();
-        a.small = !a.small;
-        return a;
+    };
+    PowiainaNum.prototype.pentate = function (other) {
+      return this.arrow(3)(other);
+    };
+    PowiainaNum.prototype.hexate = function (other) {
+      return this.arrow(4)(other);
+    };
+    PowiainaNum.prototype.penta_log = function (base) {
+      if (base === void 0) {
+        base = 10;
       }
-    }, {
-      key: "floor",
-      value: function floor() {
-        if (this.isInt()) return this.clone();
-        if (this.small) {
-          if (this.sign == 1) return PowiainaNum.ZERO.clone();else return PowiainaNum.ONE.neg().clone();
+      return this.anyarrow_log(3)(base);
+    };
+    /**
+     * Expansion, which is `this`{{1}}`other2`.
+     *
+     * Expansion refers to the binary function a{{1}}b = a{a{...a{b}a...}a}a where there are b a's from the center out. It is {a,b,1,2} in BEAF and a{X+1}b in X-Sequence Hyper-Exponential Notation. The notation a{c}b means {a,b,c}, which is a "c + 2"-ated to b, using the bracket operator.
+     *
+     * @url https://googology.fandom.com/wiki/Expansion
+     */
+    PowiainaNum.prototype.expansion = function (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.eq(2)) return new PowiainaNum(4);
+      if (other.eq(0)) return PowiainaNum.ONE.clone();
+      var r;
+      // I don't know is this added partrs work correctly...
+      if (t.gt("10{1,2}".concat(MSI)) || other.gt(MSI)) {
+        if (t.gt("10{1,2}".concat(MSI))) {
+          r = t.clone();
+          r.setOperator(r.getOperator(1, 2) - 1, 1, 2);
+          r.normalize();
+        } else if (t.gt("10{".concat(MSI, "}10"))) {
+          r = new PowiainaNum(t.getOperator(Infinity));
+        } else {
+          r = PowiainaNum.ZERO;
+        }
+        var j = r.add(other);
+        j.setOperator(j.getOperator(1, 2) + 1, 1, 2);
+        j.normalize();
+        return j;
+      }
+      var f = other.toNumber() - 1;
+      r = t.clone();
+      var i;
+      for (i = 0; f !== 0 && r.lt(MSI) && i < 100; ++i) {
+        if (f > 0) {
+          r = t.arrow(r)(t);
+          --f;
+        }
+      }
+      if (i == 100) f = 0;
+      r.setOperator(r.getOperator(Infinity) + f, Infinity);
+      r.normalize();
+      return r;
+    };
+    PowiainaNum.prototype.expansionArrow = function (arrow2) {
+      var arrow = new PowiainaNum(arrow2);
+      var t = this.clone();
+      if (arrow.lt(0) || !arrow.isInt() || arrow.isNaN() || this.isNaN()) return function () {
+        return PowiainaNum.NaN.clone();
+      };
+      if (arrow.eq(0)) return function (other) {
+        return t.arrow(other)(t);
+      };
+      if (arrow.eq(1)) return function (other) {
+        return t.expansion(other);
+      };
+      var arrows = arrow;
+      return function (other2, depth) {
+        if (depth === void 0) {
+          depth = 0;
         }
-        var r = this.abs();
-        r.array[0].repeat = Math[this.sign == 1 ? "floor" : "ceil"](r.getOperator(0));
-        return r;
-      }
-    }, {
-      key: "ceil",
-      value: function ceil() {
-        if (this.isInt()) return this.clone();
-        if (this.small) {
-          if (this.sign == 1) return PowiainaNum.ONE.clone();else return PowiainaNum.ZERO.clone();
+        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();
+          return PowiainaNum.NaN.clone();
         }
-        var r = this.abs();
-        r.array[0].repeat = Math[this.sign == 1 ? "ceil" : "floor"](r.getOperator(0));
-        r.sign = this.sign;
-        return r;
-      }
-    }, {
-      key: "round",
-      value: function round() {
-        if (this.isInt()) return this.clone();
-        if (this.small) {
-          if (this.sign == 1) {
-            if (this.rec().lte(2)) return PowiainaNum.ONE.clone();else return PowiainaNum.ZERO.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,2}, x=arrow;
+        if (arrows.gt(PowiainaNum.MSI)) {
+          r = arrows.clone();
+          r.setOperator(r.getOperator(Infinity, 2) + 1, Infinity, 2);
+          return r;
+        }
+        var arrowsNum = arrows.toNumber();
+        // arrow < 9e15
+        // 10{x}2 = 10{x-1}10
+        if (other.eq(2)) return t.expansionArrow(arrowsNum - 1)(t, depth + 1);
+        if (t.max(other).gt("10{".concat(arrowsNum + 1, ",2}").concat(MSI))) return t.max(other);
+        if (t.gt("10{".concat(arrowsNum, ",2}").concat(MSI)) || other.gt(MSI)) {
+          if (t.gt("10{".concat(arrowsNum, ",2}").concat(MSI))) {
+            r = t.clone();
+            r.setOperator(r.getOperator(arrowsNum, 2) - 1, arrowsNum, 2);
+            r.normalize();
+          } else if (t.gt("10{".concat(arrowsNum - 1, ",2}").concat(MSI))) {
+            r = new PowiainaNum(t.getOperator(arrowsNum - 1, 2));
           } else {
-            if (this.abs().rec().lte(2)) return PowiainaNum.ZERO.clone();else return PowiainaNum.ONE.neg().clone();
+            r = PowiainaNum.ZERO;
+          }
+          var j = r.add(other);
+          j.setOperator(j.getOperator(arrowsNum, 2) + 1, arrowsNum, 2);
+          j.normalize();
+          return j;
+        }
+        if (depth >= PowiainaNum.maxOps + 10) {
+          return new PowiainaNum({
+            small: false,
+            sign: 1,
+            layer: 0,
+            array: [newOperator(10, 0), newOperator(1, arrowsNum, 2)]
+          });
+        }
+        var y = other.toNumber();
+        var f = Math.floor(y);
+        var arrows_m1 = arrows.sub(PowiainaNum.ONE);
+        r = t.expansionArrow(arrows_m1)(y - f, depth + 1);
+        var i = 0;
+        for (var m = new PowiainaNum("10{".concat(arrowsNum - 1, ",2}").concat(MSI)); f !== 0 && r.lt(m) && i < 100; i++) {
+          if (f > 0) {
+            r = t.expansionArrow(arrows_m1)(r, depth + 1);
+            --f;
           }
         }
-        var r = this.abs();
-        r.array[0].repeat = Math.round(r.array[0].repeat);
-        r.sign = this.sign;
+        if (i == 100) f = 0;
+        r.setOperator(r.getOperator(arrowsNum - 1, 2) + f, arrowsNum - 1, 2);
+        r.normalize();
+        return r;
+      };
+    };
+    PowiainaNum.expansion = function (t, other) {
+      return new PowiainaNum(t).expansion(other);
+    };
+    PowiainaNum.prototype.multiExpansion = function (other) {
+      return this.expansionArrow(2)(other);
+    };
+    PowiainaNum.multiExpansion = function (t, other) {
+      return new PowiainaNum(t).multiExpansion(other);
+    };
+    PowiainaNum.prototype.powerExpansion = function (other) {
+      return this.expansionArrow(3)(other);
+    };
+    PowiainaNum.powerExpansion = function (t, other) {
+      return new PowiainaNum(t).powerExpansion(other);
+    };
+    PowiainaNum.prototype.explosion = function (other) {
+      return PowiainaNum.BEAF(this, other, 1, 3);
+    };
+    PowiainaNum.prototype.megotion = function (other) {
+      return PowiainaNum.BEAF(this, other, 1, 1, 2);
+    };
+    PowiainaNum.prototype.powiaination = function (other) {
+      return PowiainaNum.BEAF(this, other, 1, 1, 1, 2);
+    };
+    PowiainaNum.BEAF = function (base2, power2, arrow2, expans2, megota2, powiaina2, depth) {
+      if (arrow2 === void 0) {
+        arrow2 = 1;
+      }
+      if (expans2 === void 0) {
+        expans2 = 1;
+      }
+      if (megota2 === void 0) {
+        megota2 = 1;
+      }
+      if (powiaina2 === void 0) {
+        powiaina2 = 1;
+      }
+      if (depth === void 0) {
+        depth = 0;
+      }
+      // console.warn(
+      //   "This function is unstable when calculating numbers greater than *megotion*",
+      // );
+      var base = new PowiainaNum(base2);
+      var power = new PowiainaNum(power2);
+      function readArg(a) {
+        var _b;
+        return new PowiainaNum((_b = [arrow2, expans2, megota2, powiaina2][a]) !== null && _b !== void 0 ? _b : 1);
+      }
+      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();
+      // // check infinite
+      // let sufpowiaina = args.slice(4);
+      // if (sufpowiaina.filter((f) => new PowiainaNum(f).gte(2)).length > 0) {
+      //   return PowiainaNum.POSITIVE_INFINITY;
+      // }
+      if (new PowiainaNum(powiaina2).gte(3)) return PowiainaNum.POSITIVE_INFINITY.clone();
+      if (readArg(0).eq(1) && readArg(1).eq(1) && readArg(2).eq(1)) {
+        return base.pow(power);
+      }
+      if (readArg(0).eq(2) && readArg(1).eq(1) && readArg(2).eq(1) && readArg(3).eq(1)) {
+        return base.tetrate(power);
+      }
+      if (readArg(1).eq(1) && readArg(2).eq(1) && readArg(3).eq(1)) {
+        return base.arrow(readArg(0))(power);
+      }
+      if (readArg(1).eq(2) && readArg(2).eq(1) && readArg(3).eq(1)) {
+        return base.expansionArrow(readArg(0))(power);
+      }
+      var arrow = readArg(0).toNumber();
+      var expans = readArg(1);
+      var megota = readArg(2);
+      var powiaina = readArg(3);
+      if (powiaina.eq(2)) {
+        if (arrow != 1) return PowiainaNum.POSITIVE_INFINITY.clone();
+        if (expans.neq(1)) return PowiainaNum.POSITIVE_INFINITY.clone();
+        if (megota.neq(1)) return PowiainaNum.POSITIVE_INFINITY.clone();
+        if (power.gte(MSI)) return PowiainaNum.POSITIVE_INFINITY.clone();
+        var r = new PowiainaNum(10);
+        r.layer = power.toNumber();
+        r.normalize();
         return r;
       }
-      /**
-       * Work like `Math.trunc`,
-       *
-       * if `this > 0`, return `floor(this)`
-       *
-       * if `this < 0`, return `ceil(this)`
-       *
-       * @example
-       * new PowiainaNum(3.3).trunc() == new PowiainaNum(3)
-       * new PowiainaNum(-1.114514).trunc() == new PowiainaNum(-1)
-       * @returns
-       */
-    }, {
-      key: "trunc",
-      value: function trunc() {
-        var y = this.clone();
-        return y.gte(0) ? y.floor() : y.ceil();
+      function convertOperator(arrows, expans, megota) {
+        var a = arrows;
+        var e = expans;
+        var m = megota;
+        if (a == 0 && e > 1) {
+          return [1 / 0, e - 1, m];
+        }
+        if (a == 0 && e == 1 && m > 1) {
+          return [1, 1 / 0, m - 1];
+        }
+        return [a, e, m];
       }
-      /**
-       * @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) {
-        function isNaN() {
-          return _isNaN.apply(this, arguments);
-        }
-        isNaN.toString = function () {
-          return _isNaN.toString();
-        };
-        return isNaN;
-      }(
-      //#endregion
-      //#region judge-numbers
-      function () {
-        return isNaN(this.getOperator(0));
-      })
-    }, {
-      key: "isZero",
-      value: function isZero() {
-        return Boolean(this.small && !isFinite(this.getOperator(0)));
-      }
-    }, {
-      key: "isFinite",
-      value: function (_isFinite) {
-        function isFinite() {
-          return _isFinite.apply(this, arguments);
-        }
-        isFinite.toString = function () {
-          return _isFinite.toString();
-        };
-        return isFinite;
-      }(function () {
-        return Boolean(this.small || isFinite(this.getOperator(0))) && !this.isNaN();
-      })
-    }, {
-      key: "isInfi",
-      value: function isInfi() {
-        return this.rec().isZero();
-      }
-    }, {
-      key: "isInfiNaN",
-      value: function isInfiNaN() {
-        return this.isInfi() || this.isNaN();
-      }
-    }, {
-      key: "isInt",
-      value: function isInt() {
-        if (this.isZero()) return true;
-        if (!this.small && Number.isInteger(this.getOperator(0))) return true;
-        if (this.abs().gte(MSI / 2)) return true;
-        return false;
-      }
-    }, {
-      key: "ispos",
-      value: function ispos() {
-        return this.sign > 0;
-      }
-    }, {
-      key: "isneg",
-      value: function isneg() {
-        return this.sign < 0;
-      }
-    }, {
-      key: "normalize",
-      value:
-      //#endregion
-      /**
-       * Normalize functions will make this number convert into standard format.(it also change `this`, like [].sort)
-       * @returns normalized number
-       */
-      function normalize() {
-        //TODO: normalize
-        var renormalize = true;
-        var x = this;
-        for (var _i = 0; _i < this.array.length; _i++) {
-          // Check what is infinity
-          if (this.array[_i].repeat == Infinity) {
-            this.array = [{
-              arrow: 0,
-              expans: 1,
-              megota: 1,
-              repeat: Infinity
-            }];
-            this.layer = 0;
-            return this;
-          }
+      if (megota.gt(MSI)) {
+        var temp = new PowiainaNum(megota);
+        temp.layer++;
+        temp.normalize();
+        return temp;
+      }
+      function infToBang(x) {
+        if (!isFinite(x)) return "!";
+        return x.toString();
+      }
+      function getMSIForm(arrow, expans, megota) {
+        return "10{".concat(infToBang(arrow), ",").concat(infToBang(expans), ",").concat(megota, "}").concat(MSI);
+      }
+      var t = base.clone();
+      var arrows = new PowiainaNum(readArg(0));
+      var result = function (other2, depth) {
+        if (depth === void 0) {
+          depth = 0;
         }
-        for (var i = 1; i < x.array.length; ++i) {
-          var e = x.array[i];
-          if (e.arrow === null || e.arrow === undefined) {
-            e.arrow = 0;
-          }
-          if (e.expans === null || e.expans === undefined) {
-            e.expans = 1;
-          }
-          if (e.megota === null || e.megota === undefined) {
-            e.megota = 1;
-          }
-          if (isNaN(e.arrow) || isNaN(e.repeat) || isNaN(e.expans) || isNaN(e.megota)) {
-            x.array = [newOperator(NaN, 0, 1, 1)];
-            return x;
-          }
-          if (!isFinite(e.repeat) || !isFinite(e.megota)) {
-            x.array = [newOperator(Infinity, 0, 1, 1)];
-            return x;
-          }
-          if (!Number.isInteger(e.arrow)) e.arrow = Math.floor(e.arrow);
-          if (!Number.isInteger(e.repeat)) e.repeat = Math.floor(e.repeat);
-          if (!Number.isInteger(e.expans)) e.expans = Math.floor(e.expans);
-          if (!Number.isInteger(e.megota)) e.megota = Math.floor(e.megota);
-        }
-        if (!x.array.length) {
-          x.small = !x.small;
-          x.array = [newOperator(Infinity)]; // if no array set zero
-        }
-        do {
-          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) {
-              // same array's merge
-              x.array[i].repeat += x.array[i + 1].repeat;
-              x.array.splice(i + 1, 1);
-              --i;
-              renormalize = true;
-            }
-          }
-          for (i = 1; i < x.array.length; ++i) {
-            // 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;
-              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.length > PowiainaNum.maxOps) x.array.splice(1, x.array.length - PowiainaNum.maxOps); // max operators check
-          // for any 10^a but a >log10(MSI), replace to regular 10^a
-          if (this.array.length >= 2 && this.array[1].arrow == 1 && this.array[1].repeat >= 1 && this.array[0].repeat < MSI_LOG10) {
-            this.setOperator(this.array[1].repeat - 1, 1);
-            this.setOperator(Math.pow(10, this.array[0].repeat), 0);
-            renormalize = true;
-          }
-          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;
-          }
-          if (this.array[this.array.length - 1].megota > MSI) {
-            this.layer++;
-            this.array = [newOperator(this.array[this.array.length - 1].megota)];
-            renormalize = true;
-          } else if (this.layer && this.array.length == 1 && this.array[0].arrow === 0) {
-            this.layer--;
-            this.array = [newOperator(10), newOperator(1, 10, 10, this.array[0].repeat)];
-            renormalize = true;
-          }
-          // for a<1, turn into reciprocate
-          if (this.array.length == 1 && this.array[0].repeat < 1) {
-            this.array[0].repeat = 1 / this.array[0].repeat;
-            this.small = !this.small;
-            renormalize = true;
-          }
-          while (x.array.length >= 2 && x.array[0].repeat == 1 && x.array[1].repeat) {
-            // for any 10{X}10{X} 1, turn into 10{X}10
-            // [1, [R=sth, A=sth, E=sth, M=sth]]
-            if (x.array[1].repeat > 1) {
-              x.array[1].repeat--;
-            } else {
-              x.array.splice(1, 1);
-            }
-            x.array[0].repeat = 10;
-            renormalize = true;
-          }
-          if (x.array.length >= 2 && x.array[0].repeat < MSI && x.array[1].arrow >= 2 && x.array[1].repeat == 1 &&
-          //10^^^ 10
-          isFinite(x.array[1].arrow)) {
-            // for any 10{A sample=2}1e9, turn into (10{A-1})^1e9-1 10
-            // But dont convert when a is infinite
-            // [1e9, [R=1, A=2, sth, sth]]
-            x.array.splice(1, 1, newOperator(x.array[0].repeat - 1, x.array[1].arrow - 1, x.array[1].expans, x.array[1].megota));
-            x.array[0].repeat = 10;
-            renormalize = true;
-          }
-          // for any (10{A=2})^1e16 10, turn into (10{A+1}) 1e16
-          if (x.array.length >= 2 && x.array[1].repeat > MSI && x.array[1].arrow !== Infinity) {
-            x.array[1].arrow++;
-            x.array[0].repeat = x.array[1].repeat;
-            x.array[1].repeat = 1;
-            renormalize = true;
+        console.log("".concat("-".repeat(depth), " {").concat(base2, ",").concat(power2, ",").concat(arrow2, ",").concat(expans2, ",").concat(megota2, "}"));
+        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();
+          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();
+        if (arrows.eq(0)) {
+          return PowiainaNum.BEAF(t, t, power, expans.sub(1), megota, powiaina2, depth + 1);
+          // {this, this, power, expans-1, megota}
+        }
+        if (megota.eq(0)) {
+          return PowiainaNum.BEAF(t, t, t, t, expans, new PowiainaNum(powiaina2).sub(1), depth + 1);
+        }
+        // expans > 9e15, that using 10{?, x}, x=expans;
+        if (expans.gt(MSI)) {
+          r = new PowiainaNum(expans);
+          r.setOperator(r.getOperator(1, Infinity, megota.toNumber()) + 1, 1, Infinity, megota.toNumber());
+          return r;
+        }
+        // arrow > 9e15, that using 10{x,2}, x=arrow;
+        if (arrows.gt(PowiainaNum.MSI)) {
+          r = arrows.clone();
+          r.setOperator(r.getOperator(Infinity, expans.toNumber(), megota.toNumber()) + 1, Infinity, expans.toNumber(), megota.toNumber());
+          return r;
+        }
+        var arrowsNum = arrows.toNumber();
+        // arrow < 9e15
+        // 10{x}2 = 10{x-1}10
+        if (other.eq(2)) return PowiainaNum.BEAF(t, t, arrowsNum - 1, expans, megota, powiaina2, depth + 1);
+        if (t.max(other).gt(getMSIForm(arrowsNum + 1, expans.toNumber(), megota.toNumber()))) return t.max(other);
+        if (t.gt(getMSIForm(arrowsNum, expans.toNumber(), megota.toNumber())) || other.gt(MSI)) {
+          if (t.gt(getMSIForm(arrowsNum, expans.toNumber(), megota.toNumber()))) {
+            r = t.clone();
+            r.setOperator(r.getOperator(arrowsNum, expans.toNumber(), megota.toNumber()) - 1, arrowsNum, expans.toNumber(), megota.toNumber());
+            r.normalize();
+          } else if (t.gt(getMSIForm.apply(void 0, convertOperator(arrowsNum - 1, expans.toNumber(), megota.toNumber())))) {
+            r = new PowiainaNum(t.getOperator.apply(t, convertOperator(arrowsNum - 1, expans.toNumber(), megota.toNumber())));
+          } else {
+            r = PowiainaNum.ZERO;
           }
-          // for any (10{x})^1e16 10, turn into (10{1,2}) 1e16
-          if (x.array.length >= 2 && x.array[1].repeat > MSI && x.array[1].arrow === Infinity) {
-            x.array[1].arrow = 1;
-            x.array[1].expans++;
-            x.array[0].repeat = x.array[1].repeat;
-            x.array[1].repeat = 1;
-            renormalize = true;
+          var j = r.add(other);
+          j.setOperator(j.getOperator(arrowsNum, expans.toNumber(), megota.toNumber()) + 1, arrowsNum, expans.toNumber(), megota.toNumber());
+          j.normalize();
+          return j;
+        }
+        if (depth >= PowiainaNum.maxOps + 10) {
+          return new PowiainaNum({
+            small: false,
+            sign: 1,
+            layer: 0,
+            array: [newOperator(10, 0), newOperator(1, arrowsNum, expans.toNumber(), megota.toNumber())]
+          });
+        }
+        var y = other.toNumber();
+        var f = Math.floor(y);
+        var arrows_m1 = arrows.sub(PowiainaNum.ONE);
+        r = PowiainaNum.BEAF(t, y - f, arrows_m1.toNumber(), expans, megota, powiaina2, depth + 1);
+        var i = 0;
+        for (var m = new PowiainaNum(getMSIForm.apply(void 0, convertOperator(arrowsNum - 1, expans.toNumber(), megota.toNumber()))); f !== 0 && r.lt(m) && i < 100; i++) {
+          if (f > 0) {
+            r = PowiainaNum.BEAF(base, r, arrows_m1.toNumber(), expans, megota, powiaina2, depth + 1);
+            --f;
           }
-        } while (renormalize);
-        return this;
+        }
+        if (i == 100) f = 0;
+        r.setOperator.apply(r, __spreadArray([r.getOperator.apply(r, convertOperator(arrowsNum - 1, expans.toNumber(), megota.toNumber())) + f], convertOperator(arrowsNum - 1, expans.toNumber(), megota.toNumber()), false));
+        r.normalize();
+        return r;
+      }(power, depth);
+      console.log("".concat("-".repeat(depth), " = ").concat(result));
+      return result;
+    };
+    //#endregion
+    //#region comparsion
+    PowiainaNum.prototype.abs = function () {
+      var obj = this.clone();
+      if (obj.sign < 0) obj.sign *= -1;
+      return obj;
+    };
+    PowiainaNum.abs = function (x) {
+      return new PowiainaNum(x).abs();
+    };
+    /**
+     * Select the largest number of arguments.
+     */
+    PowiainaNum.max = function () {
+      var args = [];
+      for (var _i = 0; _i < arguments.length; _i++) {
+        args[_i] = arguments[_i];
       }
-      //#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]!
+      var max = PowiainaNum.NEGATIVE_INFINITY;
+      for (var i = 0; i < args.length; i++) {
+        if (max.lt(args[i])) {
+          max = new PowiainaNum(args[i]).clone();
         }
-        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;
+      return max;
+    };
+    /**
+     * Select the smallest number of arguments.
+     */
+    PowiainaNum.min = function () {
+      var args = [];
+      for (var _i = 0; _i < arguments.length; _i++) {
+        args[_i] = arguments[_i];
       }
-      /**
-       * 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;
+      var max = PowiainaNum.POSITIVE_INFINITY;
+      for (var i = 0; i < args.length; i++) {
+        if (max.gt(args[i])) {
+          max = new PowiainaNum(args[i]).clone();
         }
-        this.array[index].repeat = val;
-        // this.normalize()
-        return false;
       }
-      //#endregion
-      /**
-       * @returns  a PowiainaNum object which deep copied from `this` object.
-       */
-    }, {
-      key: "clone",
-      value: function clone() {
-        var obj = new PowiainaNum();
-        obj.resetFromObject(this);
-        return obj;
+      return max;
+    };
+    /**
+     * Restrict a number be not lower than a number
+     *
+     * It's also an alias of `PowiainaNum.max`.
+     * @returns restricted number
+     */
+    PowiainaNum.clampMin = function () {
+      var args = [];
+      for (var _i = 0; _i < arguments.length; _i++) {
+        args[_i] = arguments[_i];
       }
-      /**
-       * Set `this` from a object(deep-copy)
-       * @param powlikeObject
-       * @returns
-       */
-    }, {
-      key: "resetFromObject",
-      value: function resetFromObject(powlikeObject) {
-        this.array = [];
-        for (var i = 0; i < powlikeObject.array.length; i++) {
-          this.array[i] = {
-            arrow: powlikeObject.array[i].arrow,
-            expans: powlikeObject.array[i].expans,
-            megota: powlikeObject.array[i].megota,
-            repeat: powlikeObject.array[i].repeat,
-            valuereplaced: powlikeObject.array[i].valuereplaced
-          };
-        }
-        this.small = powlikeObject.small;
-        this.sign = powlikeObject.sign;
-        this.layer = powlikeObject.layer;
-        return this;
+      return PowiainaNum.max.apply(PowiainaNum, args);
+    };
+    /**
+     * Restrict a number be not lower than a number
+     *
+     * It's also an alias of `PowiainaNum.max`.
+     * @returns restricted number
+     */
+    PowiainaNum.prototype.clampMin = function () {
+      var args = [];
+      for (var _i = 0; _i < arguments.length; _i++) {
+        args[_i] = arguments[_i];
       }
-      //#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;
+      return PowiainaNum.max.apply(PowiainaNum, __spreadArray([this], args, false));
+    };
+    /**
+     * Restrict a number be not higher than a number
+     *
+     * It's also an alias of `PowiainaNum.min`.
+     * @returns restricted number
+     */
+    PowiainaNum.clampMax = function () {
+      var args = [];
+      for (var _i = 0; _i < arguments.length; _i++) {
+        args[_i] = arguments[_i];
       }
-      /**
-       * 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;
+      return PowiainaNum.min.apply(PowiainaNum, args);
+    };
+    /**
+     * Restrict a number be not higher than a number
+     *
+     * It's also an alias of `PowiainaNum.min`.
+     * @returns restricted number
+     */
+    PowiainaNum.prototype.clampMax = function () {
+      var args = [];
+      for (var _i = 0; _i < arguments.length; _i++) {
+        args[_i] = arguments[_i];
       }
-    }, {
-      key: "toJSON",
-      value:
-      /**
-       * Convert `this` to a JSON object
-       * @returns a JSON object
-       */
-      function toJSON() {
-        return "PN" + this.toString();
+      return PowiainaNum.min.apply(PowiainaNum, __spreadArray([this], args, false));
+    };
+    /**
+     * A combination of minimum and maximum: the value returned by clamp is normally 'this', but it won't go below 'min' and it won't go above 'max'.
+     * Therefore, if 'this' < 'min', then 'min' is returned, and if 'this' > 'max', then 'max' is returned.
+     */
+    PowiainaNum.prototype.clamp = function (min, max) {
+      return this.max(min).min(max);
+    };
+    PowiainaNum.prototype.max = function () {
+      var args = [];
+      for (var _i = 0; _i < arguments.length; _i++) {
+        args[_i] = arguments[_i];
       }
-    }, {
-      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;
+      return PowiainaNum.max.apply(PowiainaNum, __spreadArray([this], args, false));
+    };
+    PowiainaNum.prototype.min = function () {
+      var args = [];
+      for (var _i = 0; _i < arguments.length; _i++) {
+        args[_i] = arguments[_i];
       }
-    }], [{
-      key: "add",
-      value: function add(t, other) {
-        return new PowiainaNum(t).add(other);
-      }
-    }, {
-      key: "sub",
-      value: function sub(t, other) {
-        return new PowiainaNum(t).sub(other);
-      }
-    }, {
-      key: "mul",
-      value: function mul(t, other) {
-        return new PowiainaNum(t).mul(other);
-      }
-    }, {
-      key: "div",
-      value: function div(t, other) {
-        return new PowiainaNum(t).div(other);
-      }
-    }, {
-      key: "pow",
-      value: function pow(t, other) {
-        return new PowiainaNum(t).pow(other);
-      }
-    }, {
-      key: "root",
-      value: function root(t, other) {
-        return new PowiainaNum(t).root(other);
-      }
-    }, {
-      key: "sqrt",
-      value: function sqrt(t) {
-        return new PowiainaNum(t).sqrt();
-      }
-    }, {
-      key: "cbrt",
-      value: function cbrt(t) {
-        return new PowiainaNum(t).cbrt();
-      }
-    }, {
-      key: "log10",
-      value: function log10(t) {
-        return new PowiainaNum(t).log10();
-      }
-    }, {
-      key: "log",
-      value: function log(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) {
-        return new PowiainaNum(t).pLog10();
-      }
-    }, {
-      key: "exp",
-      value: function exp(x) {
-        var y = new PowiainaNum(x);
-        return y.pow_base(Math.E);
-      }
-    }, {
-      key: "factorial",
-      value: function factorial(x) {
-        return new PowiainaNum(x).factorial();
-      }
-    }, {
-      key: "gamma",
-      value: function gamma(x) {
-        return new PowiainaNum(x).gamma();
-      }
-    }, {
-      key: "lambertw",
-      value: function lambertw(x) {
-        var principal = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
-        return new PowiainaNum(x).lambertw(principal);
-      }
-    }, {
-      key: "tetrate",
-      value: function tetrate(t, other2) {
-        var payload = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;
-        return new PowiainaNum(t).tetrate(other2, payload);
-      }
-    }, {
-      key: "tetrate_10",
-      value: function tetrate_10(other2) {
-        return PowiainaNum.fromNumber(10).tetrate(other2);
-      }
-    }, {
-      key: "arrowMSI",
-      value: function arrowMSI(arrowsNum) {
-        return new PowiainaNum("10{".concat(arrowsNum, "}").concat(MSI));
-      }
-    }, {
-      key: "hyper",
-      value: function hyper(arr) {
-        var z = new PowiainaNum(arr);
-        if (z.eq(0)) return function (x, y) {
-          return new PowiainaNum(y).eq(0) ? new PowiainaNum(x) : new PowiainaNum(x).add(1);
-        };
-        if (z.eq(1)) return PowiainaNum.add;else if (z.eq(2)) return PowiainaNum.mul;else if (z.eq(3)) return PowiainaNum.pow;else {
-          return function (x, y) {
-            return new PowiainaNum(x).arrow(z.sub(2))(y);
-          };
+      return PowiainaNum.min.apply(PowiainaNum, __spreadArray([this], args, false));
+    };
+    /**
+     * Compare what PowiainaNum's absolute value is max
+     * @param args
+     * @returns absolute value max number's absolute value
+     */
+    PowiainaNum.prototype.maxabs = function () {
+      var args = [];
+      for (var _i = 0; _i < arguments.length; _i++) {
+        args[_i] = arguments[_i];
+      }
+      var other = args.map(function (x) {
+        return new PowiainaNum(x).abs();
+      });
+      return PowiainaNum.max.apply(PowiainaNum, __spreadArray([this.abs()], other, false));
+    };
+    PowiainaNum.prototype.minabs = function () {
+      var args = [];
+      for (var _i = 0; _i < arguments.length; _i++) {
+        args[_i] = arguments[_i];
+      }
+      var other = args.map(function (x) {
+        return new PowiainaNum(x).abs();
+      });
+      return PowiainaNum.min.apply(PowiainaNum, __spreadArray([this.abs()], other, false));
+    };
+    PowiainaNum.prototype.cmpabs = function (x) {
+      var other = new PowiainaNum(x).abs();
+      return this.abs().cmp(other);
+    };
+    PowiainaNum.prototype.compare = function (x) {
+      var other = new PowiainaNum(x);
+      if (this.isNaN() || other.isNaN()) return 2;
+      if (this.sign < other.sign) return -1;
+      if (this.sign > other.sign) return 1;
+      //this.sign = other.sign
+      var allneg = this.sign == -1 && other.sign == -1;
+      if (this.small && !other.small) return -1 * (allneg ? -1 : 1);
+      if (other.small && !this.small) return 1 * (allneg ? -1 : 1);
+      var resultreverse = 1;
+      if (this.small && other.small) resultreverse *= -1;
+      if (allneg) resultreverse *= -1;
+      var result = 0;
+      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];
+        var cmp = compareTuples([op1.megota, op1.expans, op1.arrow, op1.repeat], [op2.megota, op2.expans, op2.arrow, op2.repeat]);
+        if (cmp == 1) {
+          result = 1;
+          break;
+        } else if (cmp == -1) {
+          result = -1;
+          break;
+        }
+      }
+      return result * resultreverse + 1 - 1;
+    };
+    PowiainaNum.prototype.cmp = function (other) {
+      return this.compare(other);
+    };
+    PowiainaNum.prototype.eq = function (other) {
+      return this.cmp(other) === 0;
+    };
+    PowiainaNum.prototype.neq = function (other) {
+      return this.cmp(other) !== 0;
+    };
+    PowiainaNum.prototype.lt = function (other) {
+      return this.cmp(other) === -1;
+    };
+    PowiainaNum.prototype.lte = function (other) {
+      return this.cmp(other) <= 0;
+    };
+    PowiainaNum.prototype.gt = function (other) {
+      return this.cmp(other) == 1;
+    };
+    PowiainaNum.prototype.gte = function (other) {
+      var t = this.cmp(other);
+      return t == 0 || t == 1;
+    };
+    PowiainaNum.prototype.eq_tolerance = function (value, tolerance) {
+      if (tolerance === void 0) {
+        tolerance = 1e-7;
+      }
+      var dec = new PowiainaNum(value);
+      return this.sub(dec).lte(this.max(dec).mul(tolerance));
+    };
+    //#endregion
+    //#region geometry
+    PowiainaNum.prototype.sin = function () {
+      var x = this.clone();
+      if (x.isneg()) {
+        return x.neg().sin().neg();
+      }
+      var y = x.mod(7074237752028440);
+      return PowiainaNum.fromNumber(Math.sin(y.toNumber()));
+    };
+    PowiainaNum.prototype.cos = function () {
+      return this.sub(Math.PI / 2).sin();
+    };
+    PowiainaNum.prototype.tan = function () {
+      return this.sin().div(this.cos());
+    };
+    PowiainaNum.prototype.cot = function () {
+      return this.cos().div(this.sin());
+    };
+    PowiainaNum.prototype.sec = function () {
+      return this.cos().rec();
+    };
+    PowiainaNum.prototype.csc = function () {
+      return this.sin().rec();
+    };
+    //#endregion
+    //#region neg, rec, floor, ceil, round, trunc, sign
+    PowiainaNum.prototype.neg = function () {
+      var a = this.clone();
+      a.sign *= -1;
+      a.normalize();
+      return a;
+    };
+    PowiainaNum.prototype.rec = function () {
+      var a = this.clone();
+      a.small = !a.small;
+      return a;
+    };
+    PowiainaNum.prototype.floor = function () {
+      if (this.isInt()) return this.clone();
+      if (this.small) {
+        if (this.sign == 1) return PowiainaNum.ZERO.clone();else return PowiainaNum.ONE.neg().clone();
+      }
+      var r = this.abs();
+      r.array[0].repeat = Math[this.sign == 1 ? "floor" : "ceil"](r.getOperator(0));
+      return r;
+    };
+    PowiainaNum.prototype.ceil = function () {
+      if (this.isInt()) return this.clone();
+      if (this.small) {
+        if (this.sign == 1) return PowiainaNum.ONE.clone();else return PowiainaNum.ZERO.clone();
+      }
+      var r = this.abs();
+      r.array[0].repeat = Math[this.sign == 1 ? "ceil" : "floor"](r.getOperator(0));
+      r.sign = this.sign;
+      return r;
+    };
+    PowiainaNum.prototype.round = function () {
+      if (this.isInt()) return this.clone();
+      if (this.small) {
+        if (this.sign == 1) {
+          if (this.rec().lte(2)) return PowiainaNum.ONE.clone();else return PowiainaNum.ZERO.clone();
+        } else {
+          if (this.abs().rec().lte(2)) return PowiainaNum.ZERO.clone();else return PowiainaNum.ONE.neg().clone();
         }
       }
-    }, {
-      key: "expansion",
-      value: function expansion(t, other) {
-        return new PowiainaNum(t).expansion(other);
-      }
-    }, {
-      key: "multiExpansion",
-      value: function multiExpansion(t, other) {
-        return new PowiainaNum(t).multiExpansion(other);
-      }
-    }, {
-      key: "powerExpansion",
-      value: function powerExpansion(t, other) {
-        return new PowiainaNum(t).powerExpansion(other);
-      }
-    }, {
-      key: "BEAF",
-      value: function BEAF(base2, power2) {
-        var arrow2 = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;
-        var expans2 = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 1;
-        var megota2 = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : 1;
-        var powiaina2 = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : 1;
-        var depth = arguments.length > 6 && arguments[6] !== undefined ? arguments[6] : 0;
-        // console.warn(
-        //   "This function is unstable when calculating numbers greater than *megotion*",
-        // );
-        var base = new PowiainaNum(base2);
-        var power = new PowiainaNum(power2);
-        function readArg(a) {
-          var _b;
-          return new PowiainaNum((_b = [arrow2, expans2, megota2, powiaina2][a]) !== null && _b !== void 0 ? _b : 1);
-        }
-        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();
-        // // check infinite
-        // let sufpowiaina = args.slice(4);
-        // if (sufpowiaina.filter((f) => new PowiainaNum(f).gte(2)).length > 0) {
-        //   return PowiainaNum.POSITIVE_INFINITY;
-        // }
-        if (new PowiainaNum(powiaina2).gte(3)) return PowiainaNum.POSITIVE_INFINITY.clone();
-        if (readArg(0).eq(1) && readArg(1).eq(1) && readArg(2).eq(1)) {
-          return base.pow(power);
-        }
-        if (readArg(0).eq(2) && readArg(1).eq(1) && readArg(2).eq(1) && readArg(3).eq(1)) {
-          return base.tetrate(power);
-        }
-        if (readArg(1).eq(1) && readArg(2).eq(1) && readArg(3).eq(1)) {
-          return base.arrow(readArg(0))(power);
-        }
-        if (readArg(1).eq(2) && readArg(2).eq(1) && readArg(3).eq(1)) {
-          return base.expansionArrow(readArg(0))(power);
-        }
-        var arrow = readArg(0).toNumber();
-        var expans = readArg(1);
-        var megota = readArg(2);
-        var powiaina = readArg(3);
-        if (powiaina.eq(2)) {
-          if (arrow != 1) return PowiainaNum.POSITIVE_INFINITY.clone();
-          if (expans.neq(1)) return PowiainaNum.POSITIVE_INFINITY.clone();
-          if (megota.neq(1)) return PowiainaNum.POSITIVE_INFINITY.clone();
-          if (power.gte(MSI)) return PowiainaNum.POSITIVE_INFINITY.clone();
-          var r = new PowiainaNum(10);
-          r.layer = power.toNumber();
-          r.normalize();
-          return r;
+      var r = this.abs();
+      r.array[0].repeat = Math.round(r.array[0].repeat);
+      r.sign = this.sign;
+      return r;
+    };
+    /**
+     * Work like `Math.trunc`,
+     *
+     * if `this > 0`, return `floor(this)`
+     *
+     * if `this < 0`, return `ceil(this)`
+     *
+     * @example
+     * new PowiainaNum(3.3).trunc() == new PowiainaNum(3)
+     * new PowiainaNum(-1.114514).trunc() == new PowiainaNum(-1)
+     * @returns
+     */
+    PowiainaNum.prototype.trunc = function () {
+      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
+     */
+    PowiainaNum.sign = function (a) {
+      return new PowiainaNum(a).sign;
+    };
+    //#endregion
+    //#region judge-numbers
+    PowiainaNum.prototype.isNaN = function () {
+      return isNaN(this.getOperator(0));
+    };
+    PowiainaNum.prototype.isZero = function () {
+      return Boolean(this.small && !isFinite(this.getOperator(0)));
+    };
+    PowiainaNum.prototype.isFinite = function () {
+      return Boolean(this.small || isFinite(this.getOperator(0))) && !this.isNaN();
+    };
+    PowiainaNum.prototype.isInfi = function () {
+      return this.rec().isZero();
+    };
+    PowiainaNum.prototype.isInfiNaN = function () {
+      return this.isInfi() || this.isNaN();
+    };
+    PowiainaNum.prototype.isInt = function () {
+      if (this.isZero()) return true;
+      if (!this.small && Number.isInteger(this.getOperator(0))) return true;
+      if (this.abs().gte(MSI / 2)) return true;
+      return false;
+    };
+    PowiainaNum.prototype.ispos = function () {
+      return this.sign > 0;
+    };
+    PowiainaNum.prototype.isneg = function () {
+      return this.sign < 0;
+    };
+    PowiainaNum.isNaN = function (x) {
+      return new PowiainaNum(x).isNaN();
+    };
+    //#endregion
+    /**
+     * Normalize functions will make this number convert into standard format.(it also change `this`, like [].sort)
+     * @returns normalized number
+     */
+    PowiainaNum.prototype.normalize = function () {
+      //TODO: normalize
+      var renormalize = true;
+      var x = this;
+      for (var i_1 = 0; i_1 < this.array.length; i_1++) {
+        // Check what is infinity
+        if (this.array[i_1].repeat == Infinity) {
+          this.array = [{
+            arrow: 0,
+            expans: 1,
+            megota: 1,
+            repeat: Infinity
+          }];
+          this.layer = 0;
+          return this;
+        }
+      }
+      for (var i = 1; i < x.array.length; ++i) {
+        var e = x.array[i];
+        if (e.arrow === null || e.arrow === undefined) {
+          e.arrow = 0;
+        }
+        if (e.expans === null || e.expans === undefined) {
+          e.expans = 1;
+        }
+        if (e.megota === null || e.megota === undefined) {
+          e.megota = 1;
+        }
+        if (isNaN(e.arrow) || isNaN(e.repeat) || isNaN(e.expans) || isNaN(e.megota)) {
+          x.array = [newOperator(NaN, 0, 1, 1)];
+          return x;
         }
-        function convertOperator(arrows, expans, megota) {
-          var a = arrows;
-          var e = expans;
-          var m = megota;
-          if (a == 0 && e > 1) {
-            return [1 / 0, e - 1, m];
-          }
-          if (a == 0 && e == 1 && m > 1) {
-            return [1, 1 / 0, m - 1];
-          }
-          return [a, e, m];
-        }
-        if (megota.gt(MSI)) {
-          var temp = new PowiainaNum(megota);
-          temp.layer++;
-          temp.normalize();
-          return temp;
-        }
-        function infToBang(x) {
-          if (!isFinite(x)) return "!";
-          return x.toString();
-        }
-        function getMSIForm(arrow, expans, megota) {
-          return "10{".concat(infToBang(arrow), ",").concat(infToBang(expans), ",").concat(megota, "}").concat(MSI);
-        }
-        var t = base.clone();
-        var arrows = new PowiainaNum(readArg(0));
-        var result = function (other2) {
-          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, "}"));
-          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();
-            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();
-          if (arrows.eq(0)) {
-            return PowiainaNum.BEAF(t, t, power, expans.sub(1), megota, powiaina2, depth + 1);
-            // {this, this, power, expans-1, megota}
-          }
-          if (megota.eq(0)) {
-            return PowiainaNum.BEAF(t, t, t, t, expans, new PowiainaNum(powiaina2).sub(1), depth + 1);
-          }
-          // expans > 9e15, that using 10{?, x}, x=expans;
-          if (expans.gt(MSI)) {
-            r = new PowiainaNum(expans);
-            r.setOperator(r.getOperator(1, Infinity, megota.toNumber()) + 1, 1, Infinity, megota.toNumber());
-            return r;
-          }
-          // arrow > 9e15, that using 10{x,2}, x=arrow;
-          if (arrows.gt(PowiainaNum.MSI)) {
-            r = arrows.clone();
-            r.setOperator(r.getOperator(Infinity, expans.toNumber(), megota.toNumber()) + 1, Infinity, expans.toNumber(), megota.toNumber());
-            return r;
-          }
-          var arrowsNum = arrows.toNumber();
-          // arrow < 9e15
-          // 10{x}2 = 10{x-1}10
-          if (other.eq(2)) return PowiainaNum.BEAF(t, t, arrowsNum - 1, expans, megota, powiaina2, depth + 1);
-          if (t.max(other).gt(getMSIForm(arrowsNum + 1, expans.toNumber(), megota.toNumber()))) return t.max(other);
-          if (t.gt(getMSIForm(arrowsNum, expans.toNumber(), megota.toNumber())) || other.gt(MSI)) {
-            if (t.gt(getMSIForm(arrowsNum, expans.toNumber(), megota.toNumber()))) {
-              r = t.clone();
-              r.setOperator(r.getOperator(arrowsNum, expans.toNumber(), megota.toNumber()) - 1, arrowsNum, expans.toNumber(), megota.toNumber());
-              r.normalize();
-            } else if (t.gt(getMSIForm.apply(void 0, _toConsumableArray(convertOperator(arrowsNum - 1, expans.toNumber(), megota.toNumber()))))) {
-              r = new PowiainaNum(t.getOperator.apply(t, _toConsumableArray(convertOperator(arrowsNum - 1, expans.toNumber(), megota.toNumber()))));
-            } else {
-              r = PowiainaNum.ZERO;
-            }
-            var j = r.add(other);
-            j.setOperator(j.getOperator(arrowsNum, expans.toNumber(), megota.toNumber()) + 1, arrowsNum, expans.toNumber(), megota.toNumber());
-            j.normalize();
-            return j;
+        if (!isFinite(e.repeat) || !isFinite(e.megota)) {
+          x.array = [newOperator(Infinity, 0, 1, 1)];
+          return x;
+        }
+        if (!Number.isInteger(e.arrow)) e.arrow = Math.floor(e.arrow);
+        if (!Number.isInteger(e.repeat)) e.repeat = Math.floor(e.repeat);
+        if (!Number.isInteger(e.expans)) e.expans = Math.floor(e.expans);
+        if (!Number.isInteger(e.megota)) e.megota = Math.floor(e.megota);
+      }
+      if (!x.array.length) {
+        x.small = !x.small;
+        x.array = [newOperator(Infinity)]; // if no array set zero
+      }
+      do {
+        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) {
+            // same array's merge
+            x.array[i].repeat += x.array[i + 1].repeat;
+            x.array.splice(i + 1, 1);
+            --i;
+            renormalize = true;
           }
-          if (depth >= PowiainaNum.maxOps + 10) {
-            return new PowiainaNum({
-              small: false,
-              sign: 1,
-              layer: 0,
-              array: [newOperator(10, 0), newOperator(1, arrowsNum, expans.toNumber(), megota.toNumber())]
-            });
+        }
+        for (i = 1; i < x.array.length; ++i) {
+          // 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;
+            continue;
           }
-          var y = other.toNumber();
-          var f = Math.floor(y);
-          var arrows_m1 = arrows.sub(PowiainaNum.ONE);
-          r = PowiainaNum.BEAF(t, y - f, arrows_m1.toNumber(), expans, megota, powiaina2, depth + 1);
-          var i = 0;
-          for (var m = new PowiainaNum(getMSIForm.apply(void 0, _toConsumableArray(convertOperator(arrowsNum - 1, expans.toNumber(), megota.toNumber())))); f !== 0 && r.lt(m) && i < 100; i++) {
-            if (f > 0) {
-              r = PowiainaNum.BEAF(base, r, arrows_m1.toNumber(), expans, megota, powiaina2, depth + 1);
-              --f;
-            }
+          // 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 (i == 100) f = 0;
-          (_r = r).setOperator.apply(_r, [(_r2 = r).getOperator.apply(_r2, _toConsumableArray(convertOperator(arrowsNum - 1, expans.toNumber(), megota.toNumber()))) + f].concat(_toConsumableArray(convertOperator(arrowsNum - 1, expans.toNumber(), megota.toNumber()))));
-          r.normalize();
-          return r;
-        }(power, depth);
-        console.log("".concat('-'.repeat(depth), " = ").concat(result));
-        return result;
+        }
+        if (x.array.length > PowiainaNum.maxOps) x.array.splice(1, x.array.length - PowiainaNum.maxOps); // max operators check
+        // for any 10^a but a >log10(MSI), replace to regular 10^a
+        if (this.array.length >= 2 && this.array[1].arrow == 1 && this.array[1].repeat >= 1 && this.array[0].repeat < MSI_LOG10) {
+          this.setOperator(this.array[1].repeat - 1, 1);
+          this.setOperator(Math.pow(10, this.array[0].repeat), 0);
+          renormalize = true;
+        }
+        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;
+        }
+        if (this.array[this.array.length - 1].megota > MSI) {
+          this.layer++;
+          this.array = [newOperator(this.array[this.array.length - 1].megota)];
+          renormalize = true;
+        } else if (this.layer && this.array.length == 1 && this.array[0].arrow === 0) {
+          this.layer--;
+          this.array = [newOperator(10), newOperator(1, 10, 10, this.array[0].repeat)];
+          renormalize = true;
+        }
+        // for a<1, turn into reciprocate
+        if (this.array.length == 1 && this.array[0].repeat < 1) {
+          this.array[0].repeat = 1 / this.array[0].repeat;
+          this.small = !this.small;
+          renormalize = true;
+        }
+        while (x.array.length >= 2 && x.array[0].repeat == 1 && x.array[1].repeat) {
+          // for any 10{X}10{X} 1, turn into 10{X}10
+          // [1, [R=sth, A=sth, E=sth, M=sth]]
+          if (x.array[1].repeat > 1) {
+            x.array[1].repeat--;
+          } else {
+            x.array.splice(1, 1);
+          }
+          x.array[0].repeat = 10;
+          renormalize = true;
+        }
+        if (x.array.length >= 2 && x.array[0].repeat < MSI && x.array[1].arrow >= 2 && x.array[1].repeat > 1 &&
+        //10^^^ 10
+        isFinite(x.array[1].arrow)) {
+          // for any (10{A sample=2})^k 1e9, turn into (10{A})^k-1  (10{A-1})^1e9-1 10
+          // But dont convert when a is infinite
+          // [1e9, [R=K, A=2, sth, sth]]
+          x.array[1].repeat--;
+          x.array.splice(1, 0, newOperator(x.array[0].repeat - 1, x.array[1].arrow - 1, x.array[1].expans, x.array[1].megota));
+          x.array[0].repeat = 10;
+          renormalize = true;
+        }
+        if (x.array.length >= 2 && x.array[0].repeat < MSI && x.array[1].arrow >= 2 && x.array[1].repeat == 1 &&
+        //10^^^ 10
+        isFinite(x.array[1].arrow)) {
+          // for any 10{A sample=2}1e9, turn into (10{A-1})^1e9-1 10
+          // But dont convert when a is infinite
+          // [1e9, [R=1, A=2, sth, sth]]
+          x.array.splice(1, 1, newOperator(x.array[0].repeat - 1, x.array[1].arrow - 1, x.array[1].expans, x.array[1].megota));
+          x.array[0].repeat = 10;
+          renormalize = true;
+        }
+        // for any (10{A=2})^1e16 10, turn into (10{A+1}) 1e16
+        if (x.array.length >= 2 && x.array[1].repeat > MSI && x.array[1].arrow !== Infinity) {
+          x.array[1].arrow++;
+          x.array[0].repeat = x.array[1].repeat;
+          x.array[1].repeat = 1;
+          renormalize = true;
+        }
+        // for any (10{x})^1e16 10, turn into (10{1,2}) 1e16
+        if (x.array.length >= 2 && x.array[1].repeat > MSI && x.array[1].arrow === Infinity) {
+          x.array[1].arrow = 1;
+          x.array[1].expans++;
+          x.array[0].repeat = x.array[1].repeat;
+          x.array[1].repeat = 1;
+          renormalize = true;
+        }
+      } 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.
+     */
+    PowiainaNum.prototype.getOperatorIndex = function (arrow, expans, megota) {
+      if (expans === void 0) {
+        expans = 1;
       }
-    }, {
-      key: "abs",
-      value: function abs(x) {
-        return new PowiainaNum(x).abs();
+      if (megota === void 0) {
+        megota = 1;
       }
-      /**
-       * Select the largest number of arguments.
-       */
-    }, {
-      key: "max",
-      value: function max() {
-        var max = PowiainaNum.NEGATIVE_INFINITY;
-        for (var _len8 = arguments.length, args = new Array(_len8), _key8 = 0; _key8 < _len8; _key8++) {
-          args[_key8] = arguments[_key8];
-        }
-        for (var i = 0; i < args.length; i++) {
-          if (max.lt(args[i])) {
-            max = new PowiainaNum(args[i]).clone();
-          }
-        }
-        return max;
+      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]!
       }
-      /**
-       * Select the smallest number of arguments.
-       */
-    }, {
-      key: "min",
-      value: function min() {
-        var max = PowiainaNum.POSITIVE_INFINITY;
-        for (var _len9 = arguments.length, args = new Array(_len9), _key9 = 0; _key9 < _len9; _key9++) {
-          args[_key9] = arguments[_key9];
-        }
-        for (var i = 0; i < args.length; i++) {
-          if (max.gt(args[i])) {
-            max = new PowiainaNum(args[i]).clone();
-          }
-        }
-        return max;
+      return this.array.length - 0.5;
+    };
+    /**
+     * @returns number repeats of operators with given arguments.
+     */
+    PowiainaNum.prototype.getOperator = function (arrow, expans, megota) {
+      if (expans === void 0) {
+        expans = 1;
       }
-      /**
-       * Restrict a number be not lower than a number
-       *
-       * It's also an alias of `PowiainaNum.max`.
-       * @returns restricted number
-       */
-    }, {
-      key: "clampMin",
-      value: function clampMin() {
-        return PowiainaNum.max.apply(PowiainaNum, arguments);
-      }
-    }, {
-      key: "clampMax",
-      value: function clampMax() {
-        return PowiainaNum.min.apply(PowiainaNum, arguments);
-      }
-    }, {
-      key: "sign",
-      value: function sign(a) {
-        return new PowiainaNum(a).sign;
-      }
-    }, {
-      key: "isNaN",
-      value: function isNaN(x) {
-        return new PowiainaNum(x).isNaN();
-      }
-    }, {
-      key: "fromNumber",
-      value: function fromNumber(x) {
-        var obj = new PowiainaNum(); // NaN
-        if (x < 0) obj.sign = -1; // negative
-        else if (x == 0) {
-          obj.sign = 0;
-          obj.small = true;
-          obj.array = [newOperator(Infinity, 0)];
-          return obj;
-        } else if (x > 0) obj.sign = 1;
-        var y = Math.abs(x);
-        if (y == Infinity) {
-          obj.array = [newOperator(Infinity, 0)];
-        } else if (y >= MSI_REC && y < 1) {
-          obj.small = true;
-          obj.array = [newOperator(1 / y, 0)];
-        } else if (y < MSI_REC) {
-          obj.small = true;
-          obj.array = [newOperator(-Math.log10(y), 0), newOperator(1, 1)];
-        } else if (y <= MSI) {
-          obj.array = [newOperator(y, 0)];
+      if (megota === void 0) {
+        megota = 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?
+     */
+    PowiainaNum.prototype.setOperator = function (val, arrow, expans, megota) {
+      if (expans === void 0) {
+        expans = 1;
+      }
+      if (megota === void 0) {
+        megota = 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.
+     */
+    PowiainaNum.prototype.clone = function () {
+      var obj = new PowiainaNum();
+      obj.resetFromObject(this);
+      return obj;
+    };
+    /**
+     * Set `this` from a object(deep-copy)
+     * @param powlikeObject
+     * @returns
+     */
+    PowiainaNum.prototype.resetFromObject = function (powlikeObject) {
+      this.array = [];
+      for (var i = 0; i < powlikeObject.array.length; i++) {
+        this.array[i] = {
+          arrow: powlikeObject.array[i].arrow,
+          expans: powlikeObject.array[i].expans,
+          megota: powlikeObject.array[i].megota,
+          repeat: powlikeObject.array[i].repeat,
+          valuereplaced: powlikeObject.array[i].valuereplaced
+        };
+      }
+      this.small = powlikeObject.small;
+      this.sign = powlikeObject.sign;
+      this.layer = powlikeObject.layer;
+      return this;
+    };
+    //#region converters
+    /**
+     * Convert `this` to Javascript `number`
+     *
+     * returns `Infinity` when the number is greater than `Number.MAX_VALUE`
+     */
+    PowiainaNum.prototype.toNumber = function () {
+      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
+     */
+    PowiainaNum.prototype.toString = function () {
+      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 {
-          obj.setOperator(Math.log10(y), 0);
-          obj.array = [newOperator(Math.log10(y), 0), newOperator(1, 1)];
+          calc = "".concat(calc);
         }
+        res += "".concat(calc);
+      }
+      return res;
+    };
+    PowiainaNum.fromNumber = function (x) {
+      var obj = new PowiainaNum(); // NaN
+      if (x < 0) obj.sign = -1; // negative
+      else if (x == 0) {
+        obj.sign = 0;
+        obj.small = true;
+        obj.array = [newOperator(Infinity, 0)];
         return obj;
+      } else if (x > 0) obj.sign = 1;
+      var y = Math.abs(x);
+      if (y == Infinity) {
+        obj.array = [newOperator(Infinity, 0)];
+      } else if (y >= MSI_REC && y < 1) {
+        obj.small = true;
+        obj.array = [newOperator(1 / y, 0)];
+      } else if (y < MSI_REC) {
+        obj.small = true;
+        obj.array = [newOperator(-Math.log10(y), 0), newOperator(1, 1)];
+      } else if (y <= MSI) {
+        obj.array = [newOperator(y, 0)];
+      } else {
+        obj.setOperator(Math.log10(y), 0);
+        obj.array = [newOperator(Math.log10(y), 0), newOperator(1, 1)];
       }
-    }, {
-      key: "fromString",
-      value: function fromString(input) {
-        var _b, _c, _d, _e, _f, _g;
-        var x = new PowiainaNum();
-        // Judge the string was a number
-        if (input.startsWith("PN")) input = input.substring(2);
-        if (!isNaN(Number(input))) {
-          var res = Number(input);
-          var _a2 = false;
-          if (res == 0) {
-            if (/^((0)|(0*\.0+e\d+)|(0*\.0*))$/.test(input)) {
-              _a2 = true;
-            }
-          } else {
-            _a2 = true;
+      return obj;
+    };
+    /**
+     * Convert `this` to a JSON object
+     * @returns a JSON object
+     */
+    PowiainaNum.prototype.toJSON = function () {
+      return "PN" + this.toString();
+    };
+    PowiainaNum.fromString = function (input) {
+      var _b, _c, _d, _e, _f, _g;
+      var x = new PowiainaNum();
+      // Judge the string was a number
+      if (input.startsWith("PN")) input = input.substring(2);
+      if (!isNaN(Number(input))) {
+        var res = Number(input);
+        var a_1 = false;
+        if (res == 0) {
+          if (/^((0)|(0*\.0+e\d+)|(0*\.0*))$/.test(input)) {
+            a_1 = true;
           }
-          if (!_a2) {
-            var m = input.search(/e/);
-            var exponent = input.substring((m == -1 ? input.length : m) + 1);
-            var mantissa = input.substring(0, m == -1 ? undefined : m);
-            var mantissaME = [0, 0];
-            // Handle mantissa to ME
-            mantissaME[1] = Number(exponent ? exponent : "0");
-            // 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) - 1;
-              var log10float = log10mant - log10int;
-              mantissaME[0] = Math.pow(10, log10float);
-              mantissaME[1] += log10float;
-            } else {
-              // If not , count how many zeros until reached non-zero numbers
-              var zeros = countLeadingZerosAfterDecimal(mantissa);
-              mantissa = mantissa.substring(mantissa.search(/[1-9]/));
-              mantissa = mantissa.charAt(0) + "." + mantissa.substring(1);
-              zeros += 1;
-              mantissaME[0] = Number(mantissa);
-              mantissaME[1] += -zeros;
-            }
-            // 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))
-            return PowiainaNum.pow(10, -mantissaME[1] - 1).mul(Math.pow(mantissaME[0], -1) * 10).rec();
+        } else {
+          a_1 = true;
+        }
+        if (!a_1) {
+          var m = input.search(/e/);
+          var exponent = input.substring((m == -1 ? input.length : m) + 1);
+          var mantissa = input.substring(0, m == -1 ? undefined : m);
+          var mantissaME = [0, 0];
+          // Handle mantissa to ME
+          mantissaME[1] = Number(exponent ? exponent : "0");
+          // 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) - 1;
+            var log10float = log10mant - log10int;
+            mantissaME[0] = Math.pow(10, log10float);
+            mantissaME[1] += log10float;
+          } else {
+            // If not , count how many zeros until reached non-zero numbers
+            var zeros = countLeadingZerosAfterDecimal(mantissa);
+            mantissa = mantissa.substring(mantissa.search(/[1-9]/));
+            mantissa = mantissa.charAt(0) + "." + mantissa.substring(1);
+            zeros += 1;
+            mantissaME[0] = Number(mantissa);
+            mantissaME[1] += -zeros;
           }
-          if (isFinite(res) && _a2) {
-            x = PowiainaNum.fromNumber(Number(input));
-            return x;
+          // 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))
+          return PowiainaNum.pow(10, -mantissaME[1] - 1).mul(Math.pow(mantissaME[0], -1) * 10).rec();
+        }
+        if (isFinite(res) && a_1) {
+          x = PowiainaNum.fromNumber(Number(input));
+          return x;
+        }
+      }
+      input = replaceETo10(input);
+      if (!isPowiainaNum.test(input)) {
+        throw powiainaNumError + "malformed input: " + input;
+      }
+      var negateIt = false;
+      var recipIt = false;
+      if (input[0] == "-" || input[0] == "+") {
+        var numSigns = input.search(/[^-\+]/);
+        var signs = input.substring(0, numSigns);
+        negateIt = ((_c = (_b = signs.match(/-/g)) === null || _b === void 0 ? void 0 : _b.length) !== null && _c !== void 0 ? _c : 0) % 2 == 1;
+        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);
+      }
+      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;
+        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);
+          } else {
+            a = input.search(/[^P]/);
+            x.layer = a;
+            input = input.substring(a);
           }
         }
-        input = replaceETo10(input);
-        if (!isPowiainaNum.test(input)) {
-          throw powiainaNumError + "malformed input: " + input;
-        }
-        var negateIt = false;
-        var recipIt = false;
-        if (input[0] == "-" || input[0] == "+") {
-          var numSigns = input.search(/[^-\+]/);
-          var signs = input.substring(0, numSigns);
-          negateIt = ((_c = (_b = signs.match(/-/g)) === null || _b === void 0 ? void 0 : _b.length) !== null && _c !== void 0 ? _c : 0) % 2 == 1;
-          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);
-        }
-        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;
-          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);
+        while (input) {
+          if (/^(\(?10[\^\{])/.test(input)) {
+            /*
+              10^ - 匹配
+              10{ - 匹配
+              (10^ - 匹配
+              (10{ - 匹配
+              10x - 不匹配（最后一个字符不是 ^ 或 {）
+              110^ - 不匹配（不是以 10 开头）
+            */
+            if (input[0] == "(") input = input.substring(1);
+            //cutted, 10^.... or 10{....
+            var arrows, expans, megota;
+            if (input[2] == "^") {
+              a = input.substring(2).search(/[^\^]/);
+              //cut input to ^^...^^, and search how numbers
+              arrows = a;
+              // 10^^^
+              b = a + 2; // b points to after ^'s.
             } else {
-              a = input.search(/[^P]/);
-              x.layer = a;
-              input = input.substring(a);
+              // 10{...}
+              a = input.indexOf("}");
+              // select contents between {...}
+              var tmp = input.substring(3, a).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 points to after }.
             }
-          }
-          while (input) {
-            if (/^(\(?10[\^\{])/.test(input)) {
-              /*
-                10^ - 匹配
-                10{ - 匹配
-                (10^ - 匹配
-                (10{ - 匹配
-                10x - 不匹配（最后一个字符不是 ^ 或 {）
-                110^ - 不匹配（不是以 10 开头）
-              */
-              if (input[0] == "(") input = input.substring(1);
-              //cutted, 10^.... or 10{....
-              var arrows, expans, megota;
-              if (input[2] == "^") {
-                a = input.substring(2).search(/[^\^]/);
-                //cut input to ^^...^^, and search how numbers
-                arrows = a;
-                // 10^^^
-                b = a + 2; // b points to after ^'s.
-              } else {
-                // 10{...}
-                a = input.indexOf("}");
-                // select contents between {...}
-                var tmp = input.substring(3, a).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 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>
-              } else {
-                c = 1; // There is only spaces, count as <ONE>
-              }
-              if (arrows == 1 && expans == 1 && megota == 1) {
-                if (x.array.length >= 2 && x.array[1].arrow == 1) {
-                  x.array[1].repeat += c;
-                } else {
-                  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;
-                b = x.array[0].repeat;
-                if (b >= 1e10) ++a;
-                if (b >= 10) ++a;
-                x.array[0].repeat = a;
-                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);
-                b = x.getOperator(arrows - 2);
-                if (b >= 10) ++a;
-                d = x.getOperatorIndex(arrows);
-                x.array.splice(1, Math.ceil(d) - 1);
-                x.array[0].repeat = a;
-                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));
-              }
+            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>
             } else {
-              break;
+              c = 1; // There is only spaces, count as <ONE>
             }
-          }
-          a = input.split(/[Ee]/);
-          b = [x.array[0].repeat, 0];
-          c = 1;
-          for (var _i2 = a.length - 1; _i2 >= 0; --_i2) {
-            //The things that are already there
-            if (b[0] < MSI_LOG10 && b[1] === 0) {
-              b[0] = Math.pow(10, c * b[0]);
-            } else if (c == -1) {
-              if (b[1] === 0) {
-                b[0] = Math.pow(10, c * b[0]);
-              } else if (b[1] == 1 && b[0] <= Math.log10(Number.MAX_VALUE)) {
-                b[0] = Math.pow(10, c * Math.pow(10, b[0]));
+            if (arrows == 1 && expans == 1 && megota == 1) {
+              if (x.array.length >= 2 && x.array[1].arrow == 1) {
+                x.array[1].repeat += c;
               } else {
-                b[0] = 0;
+                x.array.splice(1, 0, newOperator(c, 1, expans, megota));
               }
-              b[1] = 0;
+            } else if (arrows == 2 && expans == 1 && megota == 1) {
+              a = 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 (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);
+              b = x.getOperator(arrows - 2);
+              if (b >= 10) ++a;
+              d = x.getOperatorIndex(arrows);
+              x.array.splice(1, Math.ceil(d) - 1);
+              x.array[0].repeat = a;
+              if (Number.isInteger(d)) x.array[1].repeat += c;else x.array.splice(1, 0, newOperator(c, arrows, expans, megota));
             } else {
-              b[1]++;
+              x.array.splice(1, 0, newOperator(c, arrows, expans, megota));
             }
-            //Multiplying coefficient
-            var decimalPointPos = a[_i2].indexOf(".");
-            var intPartLen = decimalPointPos == -1 ? a[_i2].length : decimalPointPos;
+          } else {
+            break;
+          }
+        }
+        a = input.split(/[Ee]/);
+        b = [x.array[0].repeat, 0];
+        c = 1;
+        for (var i_2 = a.length - 1; i_2 >= 0; --i_2) {
+          //The things that are already there
+          if (b[0] < MSI_LOG10 && b[1] === 0) {
+            b[0] = Math.pow(10, c * b[0]);
+          } else if (c == -1) {
             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]);
+              b[0] = Math.pow(10, c * b[0]);
+            } else if (b[1] == 1 && b[0] <= Math.log10(Number.MAX_VALUE)) {
+              b[0] = Math.pow(10, c * Math.pow(10, b[0]));
             } else {
-              d = intPartLen >= LONG_STRING_MIN_LENGTH ? log10LongString(a[_i2].substring(0, intPartLen)) : a[_i2] ? Math.log10(Number(a[_i2])) : 0;
-              if (b[1] == 1) {
-                b[0] += d;
-              } else if (b[1] == 2 && b[0] < MSI_LOG10 + Math.log10(d)) {
-                b[0] += Math.log10(1 + Math.pow(10, Math.log10(d) - b[0]));
-              }
+              b[0] = 0;
             }
-            //Carrying
-            if (b[0] < MSI_LOG10 && b[1]) {
-              b[0] = Math.pow(10, b[0]);
-              b[1]--;
-            } else if (b[0] > MSI) {
-              b[0] = Math.log10(b[0]);
-              b[1]++;
+            b[1] = 0;
+          } else {
+            b[1]++;
+          }
+          //Multiplying coefficient
+          var decimalPointPos = a[i_2].indexOf(".");
+          var intPartLen = decimalPointPos == -1 ? a[i_2].length : decimalPointPos;
+          if (b[1] === 0) {
+            if (intPartLen >= LONG_STRING_MIN_LENGTH) b[0] = Math.log10(b[0]) + log10LongString(a[i_2].substring(0, intPartLen)), b[1] = 1;else if (a[i_2]) b[0] *= Number(a[i_2]);
+          } else {
+            d = intPartLen >= LONG_STRING_MIN_LENGTH ? log10LongString(a[i_2].substring(0, intPartLen)) : a[i_2] ? Math.log10(Number(a[i_2])) : 0;
+            if (b[1] == 1) {
+              b[0] += d;
+            } else if (b[1] == 2 && b[0] < MSI_LOG10 + Math.log10(d)) {
+              b[0] += Math.log10(1 + Math.pow(10, Math.log10(d) - b[0]));
             }
           }
-          x.array[0].repeat = b[0];
-          if (b[1]) {
-            if (x.array.length >= 2 && x.array[1].arrow == 1 && x.array[1].expans == 1 && x.array[1].megota == 1) x.array[1].repeat += b[1];else x.array.splice(1, 0, newOperator(b[1], 1, 1, 1));
+          //Carrying
+          if (b[0] < MSI_LOG10 && b[1]) {
+            b[0] = Math.pow(10, b[0]);
+            b[1]--;
+          } else if (b[0] > MSI) {
+            b[0] = Math.log10(b[0]);
+            b[1]++;
           }
         }
-        if (negateIt) x.sign *= -1;
-        if (recipIt) x.small = !x.small;
-        x.normalize();
-        x.normalize();
-        return x;
+        x.array[0].repeat = b[0];
+        if (b[1]) {
+          if (x.array.length >= 2 && x.array[1].arrow == 1 && x.array[1].expans == 1 && x.array[1].megota == 1) x.array[1].repeat += b[1];else x.array.splice(1, 0, newOperator(b[1], 1, 1, 1));
+        }
       }
-    }, {
-      key: "fromObject",
-      value: function fromObject(powlikeObject) {
-        var obj = new PowiainaNum();
-        obj.array = [];
-        if (isExpantaNumArray(powlikeObject)) {
-          for (var i = 0; i < powlikeObject.length; i++) {
-            obj.array[i] = {
-              arrow: powlikeObject[i][0],
-              expans: 1,
-              megota: 1,
-              repeat: powlikeObject[i][1]
-            };
-          }
-          obj.small = false;
-          obj.sign = 1;
-          obj.layer = 0;
-          return obj;
-        } else {
-          for (var _i3 = 0; _i3 < powlikeObject.array.length; _i3++) {
-            obj.array[_i3] = {
-              arrow: powlikeObject.array[_i3].arrow,
-              expans: powlikeObject.array[_i3].expans,
-              megota: powlikeObject.array[_i3].megota,
-              repeat: powlikeObject.array[_i3].repeat,
-              valuereplaced: powlikeObject.array[_i3].valuereplaced
-            };
-          }
-          obj.small = powlikeObject.small;
-          obj.sign = powlikeObject.sign;
-          obj.layer = powlikeObject.layer;
-          return obj;
+      if (negateIt) x.sign *= -1;
+      if (recipIt) x.small = !x.small;
+      x.normalize();
+      x.normalize();
+      return x;
+    };
+    PowiainaNum.fromObject = function (powlikeObject) {
+      var obj = new PowiainaNum();
+      obj.array = [];
+      if (isExpantaNumArray(powlikeObject)) {
+        for (var i = 0; i < powlikeObject.length; i++) {
+          obj.array[i] = {
+            arrow: powlikeObject[i][0],
+            expans: 1,
+            megota: 1,
+            repeat: powlikeObject[i][1]
+          };
+        }
+        obj.small = false;
+        obj.sign = 1;
+        obj.layer = 0;
+        return obj;
+      } else {
+        for (var i = 0; i < powlikeObject.array.length; i++) {
+          obj.array[i] = {
+            arrow: powlikeObject.array[i].arrow,
+            expans: powlikeObject.array[i].expans,
+            megota: powlikeObject.array[i].megota,
+            repeat: powlikeObject.array[i].repeat,
+            valuereplaced: powlikeObject.array[i].valuereplaced
+          };
         }
+        obj.small = powlikeObject.small;
+        obj.sign = powlikeObject.sign;
+        obj.layer = powlikeObject.layer;
+        return obj;
       }
-    }]);
-  }();
-  _a = Symbol.toStringTag;
-  //#endregion
-  //#region constants
-  /**
-   * Zero
-   */
-  PowiainaNum.ZERO = new PowiainaNum({
-    array: [{
-      arrow: 0,
-      expans: 1,
-      megota: 1,
-      repeat: Infinity
-    }],
-    small: true,
-    layer: 0,
-    sign: 0
-  });
-  /**
-   * One
-   */
-  PowiainaNum.ONE = new PowiainaNum({
-    array: [{
-      arrow: 0,
-      expans: 1,
-      megota: 1,
-      repeat: 1
-    }],
-    small: false,
-    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 () {
-    var obj = new PowiainaNum(MSI);
-    obj.small = true;
-    return obj;
+    };
+    Object.defineProperty(PowiainaNum.prototype, "arr01", {
+      /**
+       * A property array value for version 0.1.x PowiainaNum.
+       */
+      get: 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;
+      },
+      enumerable: false,
+      configurable: true
+    });
+    var _a;
+    _a = Symbol.toStringTag;
+    //#endregion
+    //#region constants
+    /**
+     * Zero
+     */
+    PowiainaNum.ZERO = new PowiainaNum({
+      array: [{
+        arrow: 0,
+        expans: 1,
+        megota: 1,
+        repeat: Infinity
+      }],
+      small: true,
+      layer: 0,
+      sign: 0
+    });
+    /**
+     * One
+     */
+    PowiainaNum.ONE = new PowiainaNum({
+      array: [{
+        arrow: 0,
+        expans: 1,
+        megota: 1,
+        repeat: 1
+      }],
+      small: false,
+      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 () {
+      var obj = new PowiainaNum(MSI);
+      obj.small = true;
+      return obj;
+    }();
+    /**
+     * 10^(MSI) = 10^9007199254740991.
+     */
+    PowiainaNum.E_MSI = new PowiainaNum({
+      array: [{
+        arrow: 0,
+        expans: 1,
+        megota: 1,
+        repeat: MSI
+      }, {
+        arrow: 1,
+        expans: 1,
+        megota: 1,
+        repeat: 1
+      }],
+      small: false,
+      layer: 0,
+      sign: 1
+    });
+    /**
+     * 10^10^(MSI) = 10^10^9007199254740991.
+     */
+    PowiainaNum.EE_MSI = new PowiainaNum({
+      array: [{
+        arrow: 0,
+        expans: 1,
+        megota: 1,
+        repeat: MSI
+      }, {
+        arrow: 1,
+        expans: 1,
+        megota: 1,
+        repeat: 2
+      }],
+      small: false,
+      layer: 0,
+      sign: 1
+    });
+    /**
+     * 10^(MSI) 's reciprocate value, = 10^-9007199254740991.
+     */
+    PowiainaNum.E_MSI_REC = new PowiainaNum({
+      array: [{
+        arrow: 0,
+        expans: 1,
+        megota: 1,
+        repeat: MSI
+      }, {
+        arrow: 1,
+        expans: 1,
+        megota: 1,
+        repeat: 1
+      }],
+      small: true,
+      layer: 0,
+      sign: 1
+    });
+    /**
+     * Tetrated MSI, = 10↑↑9007199254740991.
+     */
+    PowiainaNum.TETRATED_MSI = new PowiainaNum({
+      array: [{
+        arrow: 0,
+        expans: 1,
+        megota: 1,
+        repeat: 1e10
+      }, {
+        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: 10
+      }, {
+        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: [newOperator(3638334640023.7783, 0, 1, 1), 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: [{
+        arrow: 0,
+        expans: 1,
+        megota: 1,
+        repeat: NaN
+      }],
+      small: false,
+      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.POW_2_44_MOD_PI = 1.701173079953;
+    //#endregion
+    PowiainaNum.arrowFuncMap = new Map();
+    return PowiainaNum;
   }();
-  /**
-   * 10^(MSI) = 10^9007199254740991.
-   */
-  PowiainaNum.E_MSI = new PowiainaNum({
-    array: [{
-      arrow: 0,
-      expans: 1,
-      megota: 1,
-      repeat: MSI
-    }, {
-      arrow: 1,
-      expans: 1,
-      megota: 1,
-      repeat: 1
-    }],
-    small: false,
-    layer: 0,
-    sign: 1
-  });
-  /**
-   * 10^10^(MSI) = 10^10^9007199254740991.
-   */
-  PowiainaNum.EE_MSI = new PowiainaNum({
-    array: [{
-      arrow: 0,
-      expans: 1,
-      megota: 1,
-      repeat: MSI
-    }, {
-      arrow: 1,
-      expans: 1,
-      megota: 1,
-      repeat: 2
-    }],
-    small: false,
-    layer: 0,
-    sign: 1
-  });
-  /**
-   * 10^(MSI) 's reciprocate value, = 10^-9007199254740991.
-   */
-  PowiainaNum.E_MSI_REC = new PowiainaNum({
-    array: [{
-      arrow: 0,
-      expans: 1,
-      megota: 1,
-      repeat: MSI
-    }, {
-      arrow: 1,
-      expans: 1,
-      megota: 1,
-      repeat: 1
-    }],
-    small: true,
-    layer: 0,
-    sign: 1
-  });
-  /**
-   * Tetrated MSI, = 10↑↑9007199254740991.
-   */
-  PowiainaNum.TETRATED_MSI = new PowiainaNum({
-    array: [{
-      arrow: 0,
-      expans: 1,
-      megota: 1,
-      repeat: 1e10
-    }, {
-      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: 10
-    }, {
-      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: [newOperator(3638334640023.7783, 0, 1, 1), 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: [{
-      arrow: 0,
-      expans: 1,
-      megota: 1,
-      repeat: NaN
-    }],
-    small: false,
-    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.POW_2_44_MOD_PI = 1.701173079953;
-  //#endregion
-  PowiainaNum.arrowFuncMap = new Map();
 
   exports.arraySortFunction = arraySortFunction;
   exports["default"] = PowiainaNum;