powiaina_num.js 0.2.0-alpha.3.4 → 0.2.0-alpha.4

package/README.md

@@ -19,7 +19,7 @@ If arrow count or expans count is Infinite, the count replaces to the next opera
 
 Some codes snippet from [ExpantaNum.js by Naruyoko](https://github.com/Naruyoko/ExpantaNum.js)
 
-Functions are as follows `abs, neg, add, sub, mul, div, rec, pow, pow10, pow_base, sqrt, cbrt, root, log10, log, cmp, rec, gamma, mod, exp, ln, slog, factorial, tetrate_10, isFinite, isInfinite, isNaN, tetrate, lambertw, toString, toJSON, floor, ceil, round, trunc, clampMax, clampMin`(some missing items that have not been fully developed)
+Functions are as follows `abs, neg, add, sub, mul, div, rec, pow, pow10, pow_base, sqrt, cbrt, root, log10, log, cmp, rec, gamma, mod, exp, ln, slog, factorial, tetrate_10, isFinite, isInfinite, isNaN, tetrate, lambertw, toString, toJSON, floor, ceil, round, trunc, clampMax, clampMin, arrow, expansion, expansionArrow, multiExpansion, powerExpansion`(some missing items that have not been fully developed)
 
 ## Using
 

package/dist/PowiainaNum.cjs.js

@@ -219,37 +219,29 @@ function countLeadingZerosAfterDecimal(numStr) {
 // 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] : 1e-10;
+  var tol = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1e10;
   var principal = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
+  z = new PowiainaNum(z);
   var w;
-  var ew, wewz, wn;
-  if (z.isInfiNaN()) return z;
+  if (!z.isFinite()) return z;
   if (principal) {
-    if (z.eq(PowiainaNum.ZERO)) {
-      return PowiainaNum.ZERO.clone();
-    }
-    if (z.eq(PowiainaNum.ONE)) {
-      //Split out this case because the asymptotic series blows up
-      return PowiainaNum.fromNumber(OMEGA);
-    } //Get an initial guess for Halley's method
-    w = z.log();
+    if (z.eq(PowiainaNum.ZERO)) return z;
+    if (z.eq(PowiainaNum.ONE)) return new PowiainaNum(OMEGA);
+    w = PowiainaNum.log(z);
   } else {
-    if (z.eq(PowiainaNum.ZERO)) {
-      return PowiainaNum.NEGATIVE_INFINITY.clone();
-    } //Get an initial guess for Halley's method
-    w = z.neg().log();
-  } //Halley's method; see 5.9 in [1]
+    if (z.eq(PowiainaNum.ZERO)) return PowiainaNum.NEGATIVE_INFINITY.clone();
+    w = PowiainaNum.log(z.neg());
+  }
   for (var i = 0; i < 100; ++i) {
-    ew = w.neg().exp();
-    wewz = w.sub(z.mul(ew));
-    wn = w.sub(wewz.div(w.add(1).sub(w.add(2).mul(wewz).div(w.mul(2).add(2)))));
-    if (wn.sub(w).abs().lt(wn.abs().mul(tol))) {
-      return wn;
-    } else {
-      w = wn;
-    }
+    var ew = w.neg().exp();
+    var wewz = w.sub(z.mul(ew));
+    var dd = w.add(PowiainaNum.ONE).sub(w.add(2).mul(wewz).div(PowiainaNum.mul(2, w).add(2)));
+    if (dd.eq(PowiainaNum.ZERO)) return w;
+    var wn = w.sub(wewz.div(dd));
+    if (PowiainaNum.abs(wn.sub(w)).lt(PowiainaNum.abs(wn).mul(tol))) return wn;
+    w = wn;
   }
-  throw Error("Iteration failed to converge: ".concat(z.toString())); //return Decimal.dNaN;
+  throw Error("Iteration failed to converge: " + z);
 }
 var PowiainaNum = /*#__PURE__*/function () {
   /**
@@ -438,7 +430,7 @@ var PowiainaNum = /*#__PURE__*/function () {
       var a = this.toNumber();
       var b = other.toNumber();
       var t = Math.pow(a, b);
-      if (isFinite(t)) {
+      if (isFinite(t) && t !== 0) {
         // optimize?
         return PowiainaNum.fromNumber(t);
       }
@@ -885,9 +877,154 @@ var PowiainaNum = /*#__PURE__*/function () {
     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);
+    }
     /**
-     * Select the largest number of arguments.
+     * 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;
+      }
+      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 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,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 {
+            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;
+          }
+        }
+        if (i == 100) f = 0;
+        r.setOperator(r.getOperator(arrowsNum - 1, 2) + f, arrowsNum - 1, 2);
+        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: "max",
     value: function max() {
@@ -1220,12 +1357,12 @@ var PowiainaNum = /*#__PURE__*/function () {
         }
         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[1].arrow == 1 && this.array[1].repeat >= 1 && this.array[0].repeat < MSI_LOG10) {
+        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))) {
+        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;
@@ -1258,12 +1395,20 @@ var PowiainaNum = /*#__PURE__*/function () {
           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) {
+        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;
     }
@@ -1474,6 +1619,11 @@ var PowiainaNum = /*#__PURE__*/function () {
       var payload = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;
       return new PowiainaNum(t).tetrate(other2, payload);
     }
+  }, {
+    key: "abs",
+    value: function abs(x) {
+      return new PowiainaNum(x).abs();
+    }
   }, {
     key: "log10",
     value: function log10(t) {
@@ -1553,6 +1703,24 @@ var PowiainaNum = /*#__PURE__*/function () {
       // 2--3, 1e10-<e1e10, 10^10^10^0->1
       return PowiainaNum.NaN.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);
+    }
+    /**
+     * Select the largest number of arguments.
+     */
   }, {
     key: "max",
     value: function max() {

package/dist/PowiainaNum.esm.js

@@ -217,37 +217,29 @@ function countLeadingZerosAfterDecimal(numStr) {
 // 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] : 1e-10;
+  var tol = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1e10;
   var principal = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
+  z = new PowiainaNum(z);
   var w;
-  var ew, wewz, wn;
-  if (z.isInfiNaN()) return z;
+  if (!z.isFinite()) return z;
   if (principal) {
-    if (z.eq(PowiainaNum.ZERO)) {
-      return PowiainaNum.ZERO.clone();
-    }
-    if (z.eq(PowiainaNum.ONE)) {
-      //Split out this case because the asymptotic series blows up
-      return PowiainaNum.fromNumber(OMEGA);
-    } //Get an initial guess for Halley's method
-    w = z.log();
+    if (z.eq(PowiainaNum.ZERO)) return z;
+    if (z.eq(PowiainaNum.ONE)) return new PowiainaNum(OMEGA);
+    w = PowiainaNum.log(z);
   } else {
-    if (z.eq(PowiainaNum.ZERO)) {
-      return PowiainaNum.NEGATIVE_INFINITY.clone();
-    } //Get an initial guess for Halley's method
-    w = z.neg().log();
-  } //Halley's method; see 5.9 in [1]
+    if (z.eq(PowiainaNum.ZERO)) return PowiainaNum.NEGATIVE_INFINITY.clone();
+    w = PowiainaNum.log(z.neg());
+  }
   for (var i = 0; i < 100; ++i) {
-    ew = w.neg().exp();
-    wewz = w.sub(z.mul(ew));
-    wn = w.sub(wewz.div(w.add(1).sub(w.add(2).mul(wewz).div(w.mul(2).add(2)))));
-    if (wn.sub(w).abs().lt(wn.abs().mul(tol))) {
-      return wn;
-    } else {
-      w = wn;
-    }
+    var ew = w.neg().exp();
+    var wewz = w.sub(z.mul(ew));
+    var dd = w.add(PowiainaNum.ONE).sub(w.add(2).mul(wewz).div(PowiainaNum.mul(2, w).add(2)));
+    if (dd.eq(PowiainaNum.ZERO)) return w;
+    var wn = w.sub(wewz.div(dd));
+    if (PowiainaNum.abs(wn.sub(w)).lt(PowiainaNum.abs(wn).mul(tol))) return wn;
+    w = wn;
   }
-  throw Error("Iteration failed to converge: ".concat(z.toString())); //return Decimal.dNaN;
+  throw Error("Iteration failed to converge: " + z);
 }
 var PowiainaNum = /*#__PURE__*/function () {
   /**
@@ -436,7 +428,7 @@ var PowiainaNum = /*#__PURE__*/function () {
       var a = this.toNumber();
       var b = other.toNumber();
       var t = Math.pow(a, b);
-      if (isFinite(t)) {
+      if (isFinite(t) && t !== 0) {
         // optimize?
         return PowiainaNum.fromNumber(t);
       }
@@ -883,9 +875,154 @@ var PowiainaNum = /*#__PURE__*/function () {
     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);
+    }
     /**
-     * Select the largest number of arguments.
+     * 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;
+      }
+      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 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,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 {
+            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;
+          }
+        }
+        if (i == 100) f = 0;
+        r.setOperator(r.getOperator(arrowsNum - 1, 2) + f, arrowsNum - 1, 2);
+        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: "max",
     value: function max() {
@@ -1218,12 +1355,12 @@ var PowiainaNum = /*#__PURE__*/function () {
         }
         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[1].arrow == 1 && this.array[1].repeat >= 1 && this.array[0].repeat < MSI_LOG10) {
+        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))) {
+        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;
@@ -1256,12 +1393,20 @@ var PowiainaNum = /*#__PURE__*/function () {
           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) {
+        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;
     }
@@ -1472,6 +1617,11 @@ var PowiainaNum = /*#__PURE__*/function () {
       var payload = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;
       return new PowiainaNum(t).tetrate(other2, payload);
     }
+  }, {
+    key: "abs",
+    value: function abs(x) {
+      return new PowiainaNum(x).abs();
+    }
   }, {
     key: "log10",
     value: function log10(t) {
@@ -1551,6 +1701,24 @@ var PowiainaNum = /*#__PURE__*/function () {
       // 2--3, 1e10-<e1e10, 10^10^10^0->1
       return PowiainaNum.NaN.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);
+    }
+    /**
+     * Select the largest number of arguments.
+     */
   }, {
     key: "max",
     value: function max() {