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

package/dist/PowiainaNum.esm.js

@@ -94,7 +94,7 @@ function compareTuples() {
 function replaceETo10(str) {
   // 使用正则表达式匹配 (e^数字) 的模式
   // 正则解释：\(e\^(\d+)\) 匹配 (e^数字)，其中 \d+ 匹配一个或多个数字
-  return str.replace(/\(e\^(\d+)\)/g, '(10^)^$1 ').replace(/(\d+)\x20*PT/g, '(10^)^$1 ');
+  return str.replace(/\(e\^(\d+)\)/g, "(10^)^$1 ").replace(/(\d+)\x20*PT/g, "(10^)^$1 ");
 }
 /**
  * 把一个字符串很长的数进行以10为底的对数
@@ -241,6 +241,23 @@ function d_lambertw(z) {
   }
   throw Error("Iteration failed to converge: " + z);
 }
+function arraySortFunction(a, b) {
+  return compareTuples([a.megota, a.expans, a.arrow], [b.megota, b.expans, b.arrow]);
+}
+/**
+ * Merge arrays in arrow,expans,megota is all same.
+ * @param x an object has `array` key.
+ */
+function mergeSameArrays(x) {
+  for (var 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;
+    }
+  }
+}
 var PowiainaNum = /*#__PURE__*/function () {
   /**
    * Constructor of PowiainaNum class,
@@ -312,6 +329,10 @@ var PowiainaNum = /*#__PURE__*/function () {
         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 && !((_a = a.array[1]) === null || _a === void 0 ? void 0 : _a.repeat) && !((_b = b.array[1]) === null || _b === void 0 ? void 0 : _b.repeat) && a.sign == b.sign) {
         return new PowiainaNum((a.array[0].repeat + b.array[0].repeat) * a.sign);
@@ -353,7 +374,7 @@ var PowiainaNum = /*#__PURE__*/function () {
       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.eq(PowiainaNum.ZERO) && y.isInfiNaN() && x.eq(PowiainaNum.ZERO)) return PowiainaNum.NaN.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();
@@ -369,6 +390,11 @@ var PowiainaNum = /*#__PURE__*/function () {
         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;
@@ -412,6 +438,7 @@ var PowiainaNum = /*#__PURE__*/function () {
     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();
@@ -432,8 +459,19 @@ var PowiainaNum = /*#__PURE__*/function () {
         // optimize?
         return PowiainaNum.fromNumber(t);
       }
-      // log10(a^b) = b log10(a)
-      return this.log10().mul(other).pow10();
+      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",
@@ -467,6 +505,7 @@ var PowiainaNum = /*#__PURE__*/function () {
       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) {
@@ -693,7 +732,7 @@ var PowiainaNum = /*#__PURE__*/function () {
      * 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  
+    //from HyperCalc source code
     function gamma() {
       if (this.small) {
         return this.rec();
@@ -741,13 +780,13 @@ var PowiainaNum = /*#__PURE__*/function () {
     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.
-       */
+     * 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() {
@@ -1023,6 +1062,17 @@ var PowiainaNum = /*#__PURE__*/function () {
     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) {
+      console.warn("This function is unstable when calculating numbers");
+      return PowiainaNum.BEAF(this, other, 1, 1, 2);
+    }
   }, {
     key: "max",
     value: function max() {
@@ -1072,6 +1122,47 @@ var PowiainaNum = /*#__PURE__*/function () {
       var other = new PowiainaNum(x).abs();
       return this.abs().cmp(other);
     }
+  }, {
+    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();
+    }
+    // public asin_abs(): PowiainaNum {
+    //   const t = this.clone().abs();
+    //   if (t.lte(1)) {
+    //     return PowiainaNum.fromNumber(Math.asin(t.toNumber()));
+    //   }
+    // }
   }, {
     key: "neg",
     value: function neg() {
@@ -1326,9 +1417,7 @@ var PowiainaNum = /*#__PURE__*/function () {
       do {
         renormalize = false;
         // Sort arrays.
-        this.array.sort(function (a, b) {
-          return compareTuples([a.megota, a.expans, a.arrow], [b.megota, b.expans, b.arrow]);
-        });
+        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
@@ -1372,7 +1461,7 @@ var PowiainaNum = /*#__PURE__*/function () {
           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  
+          // 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--;
@@ -1716,6 +1805,146 @@ var PowiainaNum = /*#__PURE__*/function () {
     value: function powerExpansion(t, other) {
       return new PowiainaNum(t).powerExpansion(other);
     }
+  }, {
+    key: "BEAF",
+    value: function BEAF(base2, power2) {
+      for (var _len6 = arguments.length, args = new Array(_len6 > 2 ? _len6 - 2 : 0), _key6 = 2; _key6 < _len6; _key6++) {
+        args[_key6 - 2] = arguments[_key6];
+      }
+      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 _a;
+        return new PowiainaNum((_a = args[a]) !== null && _a !== void 0 ? _a : 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
+      var sufpowiaina = args.slice(4);
+      if (sufpowiaina.filter(function (f) {
+        return new PowiainaNum(f).gte(2);
+      }).length > 0) {
+        return PowiainaNum.POSITIVE_INFINITY;
+      }
+      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)) {
+        return base.tetrate(power);
+      }
+      if (readArg(1).eq(1) && readArg(2).eq(1)) {
+        return base.arrow(readArg(0))(power);
+      }
+      if (readArg(1).eq(2) && readArg(2).eq(1)) {
+        return base.expansionArrow(readArg(0))(power);
+      }
+      readArg(0).toNumber();
+      var expans = readArg(1);
+      var megota = readArg(2);
+      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)) {
+        throw new Error("Not implemented megota > MSI");
+      }
+      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));
+      return function (other2, _r, _r2) {
+        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();
+        if (arrows.eq(0)) {
+          return PowiainaNum.BEAF(t, t, power, expans.sub(1), megota);
+          // {this, this, power, expans-1, megota}
+        }
+        if (expans.eq(0)) {
+          return PowiainaNum.BEAF(t, t, t, power, megota.sub(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);
+        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 (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);
+        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);
+            --f;
+          }
+        }
+        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);
+    }
     /**
      * Select the largest number of arguments.
      */
@@ -1723,8 +1952,8 @@ var PowiainaNum = /*#__PURE__*/function () {
     key: "max",
     value: function max() {
       var max = PowiainaNum.NEGATIVE_INFINITY;
-      for (var _len6 = arguments.length, args = new Array(_len6), _key6 = 0; _key6 < _len6; _key6++) {
-        args[_key6] = arguments[_key6];
+      for (var _len7 = arguments.length, args = new Array(_len7), _key7 = 0; _key7 < _len7; _key7++) {
+        args[_key7] = arguments[_key7];
       }
       for (var i = 0; i < args.length; i++) {
         if (max.lt(args[i])) {
@@ -1740,8 +1969,8 @@ var PowiainaNum = /*#__PURE__*/function () {
     key: "min",
     value: function min() {
       var max = PowiainaNum.POSITIVE_INFINITY;
-      for (var _len7 = arguments.length, args = new Array(_len7), _key7 = 0; _key7 < _len7; _key7++) {
-        args[_key7] = arguments[_key7];
+      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.gt(args[i])) {
@@ -1799,7 +2028,9 @@ var PowiainaNum = /*#__PURE__*/function () {
         return obj;
       } else if (x > 0) obj.sign = 1;
       var y = Math.abs(x);
-      if (y >= MSI_REC && y < 1) {
+      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) {
@@ -1998,7 +2229,7 @@ var PowiainaNum = /*#__PURE__*/function () {
         }
         x.array[0].repeat = b[0];
         if (b[1]) {
-          if (x.array.length >= 2 && x.array[1].arrow == 1) x.array[1].repeat += b[1];else x.array.splice(1, 0, newOperator(b[1], 1, 1, 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));
         }
       }
       if (negateIt) x.sign *= -1;
@@ -2233,5 +2464,6 @@ PowiainaNum.SQRT1_2 = new PowiainaNum(Math.SQRT1_2);
 PowiainaNum.SQRT2 = new PowiainaNum(Math.SQRT2);
 PowiainaNum.maxOps = 100;
 PowiainaNum.arrowFuncMap = new Map();
+PowiainaNum.POW_2_44_MOD_PI = 1.701173079953;
 
-export { PowiainaNum as default };
+export { arraySortFunction, PowiainaNum as default, mergeSameArrays };