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

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`(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`(some missing items that have not been fully developed)
 
 ## Using
 

package/dist/PowiainaNum.cjs.js

@@ -1,5 +1,13 @@
 '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");
 }
@@ -14,6 +22,15 @@ function _createClass(e, r, t) {
     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];
@@ -37,6 +54,13 @@ function _typeof(o) {
     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;
+  }
+}
 
 var powiainaNumError = "[PowiainaNum 0.2 error]";
 var MSI = 9007199254740991;
@@ -228,6 +252,10 @@ function d_lambertw(z) {
   throw Error("Iteration failed to converge: ".concat(z.toString())); //return Decimal.dNaN;
 }
 var PowiainaNum = /*#__PURE__*/function () {
+  /**
+   * Constructor of PowiainaNum class,
+   * If no arguments, return `PowiainaNum.NaN`.
+   */
   function PowiainaNum(arg1) {
     _classCallCheck(this, PowiainaNum);
     this.array = [{
@@ -364,7 +392,11 @@ var PowiainaNum = /*#__PURE__*/function () {
     }
   }, {
     key: "pow10",
-    value: function pow10() {
+    value:
+    /**
+     * @returns 10 to the power of `this`
+     */
+    function pow10() {
       var _a, _b;
       var r = this.clone();
       // inf & nan check
@@ -694,7 +726,7 @@ var PowiainaNum = /*#__PURE__*/function () {
       } 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.layer === 0) {
+        } else if (this.lt(MSI)) {
           return PowiainaNum.fromNumber(f_lambertw(this.sign * this.getOperator(0)));
         } else if (this.lt("eee15")) {
           return d_lambertw(this);
@@ -802,29 +834,51 @@ var PowiainaNum = /*#__PURE__*/function () {
     value: function chain(other, arrows) {
       return this.arrow(arrows)(other);
     }
+    /**
+     * Select the largest number of arguments.
+     */
   }, {
     key: "max",
-    value: function max(x) {
-      var other = new PowiainaNum(x);
-      return this.lt(other) ? other.clone() : this.clone();
+    value: function max() {
+      for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+        args[_key2] = arguments[_key2];
+      }
+      return PowiainaNum.max.apply(PowiainaNum, [this].concat(args));
     }
   }, {
     key: "min",
-    value: function min(x) {
-      var other = new PowiainaNum(x);
-      return this.gte(other) ? other.clone() : this.clone();
+    value: function min() {
+      for (var _len3 = arguments.length, args = new Array(_len3), _key3 = 0; _key3 < _len3; _key3++) {
+        args[_key3] = arguments[_key3];
+      }
+      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(x) {
-      var other = new PowiainaNum(x).abs();
-      return this.abs().lt(other) ? other.clone() : this.clone();
+    value: function maxabs() {
+      for (var _len4 = arguments.length, args = new Array(_len4), _key4 = 0; _key4 < _len4; _key4++) {
+        args[_key4] = arguments[_key4];
+      }
+      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(x) {
-      var other = new PowiainaNum(x).abs();
-      return this.abs().gt(other) ? other.clone() : this.clone();
+    value: function minabs() {
+      for (var _len5 = arguments.length, args = new Array(_len5), _key5 = 0; _key5 < _len5; _key5++) {
+        args[_key5] = arguments[_key5];
+      }
+      var other = args.map(function (x) {
+        return new PowiainaNum(x).abs();
+      });
+      return PowiainaNum.min.apply(PowiainaNum, [this.abs()].concat(_toConsumableArray(other)));
     }
   }, {
     key: "cmpabs",
@@ -1120,7 +1174,7 @@ var PowiainaNum = /*#__PURE__*/function () {
           this.setOperator(Math.pow(10, this.getOperator(0)), 0);
           renormalize = true;
         }
-        if (this.getOperator(0) > MSI) {
+        if (this.getOperator(0) > MSI && !isFinite(this.getOperator(0))) {
           this.setOperator(this.getOperator(1) + 1, 1);
           this.setOperator(Math.log10(this.getOperator(0)), 0);
           renormalize = true;
@@ -1305,7 +1359,7 @@ var PowiainaNum = /*#__PURE__*/function () {
     key: "arr01",
     get:
     /**
-     * A property arary value for version 0.1.x PowiainaNum.
+     * A property array value for version 0.1.x PowiainaNum.
      */
     function get() {
       var res = [0];
@@ -1439,6 +1493,64 @@ var PowiainaNum = /*#__PURE__*/function () {
       // 2--3, 1e10-<e1e10, 10^10^10^0->1
       return PowiainaNum.NaN.clone();*/
     }
+  }, {
+    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 i = 0; i < args.length; i++) {
+        if (max.lt(args[i])) {
+          max = new PowiainaNum(args[i]).clone();
+        }
+      }
+      return max;
+    }
+    /**
+     * Select the smallest number of arguments.
+     */
+  }, {
+    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 i = 0; i < args.length; i++) {
+        if (max.gt(args[i])) {
+          max = new PowiainaNum(args[i]).clone();
+        }
+      }
+      return max;
+    }
+    /**
+     * Restrict a number be not lower than a number
+     *
+     * It's also an alias of `PowiainaNum.max`.
+     * @returns restricted number
+     */
+  }, {
+    key: "clampMin",
+    value: function clampMin() {
+      return PowiainaNum.max.apply(PowiainaNum, arguments);
+    }
+    /**
+     * Restrict a number be not higher than a number
+     *
+     * It's also an alias of `PowiainaNum.min`.
+     * @returns restricted number
+     */
+  }, {
+    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) {
@@ -1706,6 +1818,9 @@ var PowiainaNum = /*#__PURE__*/function () {
     }
   }]);
 }();
+/**
+ * Zero
+ */
 PowiainaNum.ZERO = new PowiainaNum({
   array: [{
     arrow: 0,
@@ -1717,6 +1832,9 @@ PowiainaNum.ZERO = new PowiainaNum({
   layer: 0,
   sign: 0
 });
+/**
+ * One
+ */
 PowiainaNum.ONE = new PowiainaNum({
   array: [{
     arrow: 0,
@@ -1728,12 +1846,22 @@ PowiainaNum.ONE = new PowiainaNum({
   layer: 0,
   sign: 1
 });
+/**
+ * The value of the largest integer n such that n and n + 1 are both
+ * exactly representable as a Number value = 9007199254740991 = 2^53 − 1.
+ */
 PowiainaNum.MSI = new PowiainaNum(MSI);
+/**
+ * MSI's reciprocate value, = 1/9007199254740991.
+ */
 PowiainaNum.MSI_REC = function () {
   var obj = new PowiainaNum(MSI);
   obj.small = true;
   return obj;
 }();
+/**
+ * 10^(MSI) = 10^9007199254740991.
+ */
 PowiainaNum.E_MSI = new PowiainaNum({
   array: [{
     arrow: 0,
@@ -1750,6 +1878,9 @@ PowiainaNum.E_MSI = new PowiainaNum({
   layer: 0,
   sign: 1
 });
+/**
+ * 10^(MSI) 's reciprocate value, = 10^-9007199254740991.
+ */
 PowiainaNum.E_MSI_REC = new PowiainaNum({
   array: [{
     arrow: 0,
@@ -1766,51 +1897,69 @@ PowiainaNum.E_MSI_REC = new PowiainaNum({
   layer: 0,
   sign: 1
 });
+/**
+ * Tetrated MSI, = 10↑↑9007199254740991.
+ */
 PowiainaNum.TETRATED_MSI = new PowiainaNum({
   array: [{
     arrow: 0,
     expans: 1,
     megota: 1,
-    repeat: MSI
+    repeat: 1e10
   }, {
     arrow: 1,
     expans: 1,
     megota: 1,
-    repeat: MSI
+    repeat: MSI - 2
   }],
   small: false,
   layer: 0,
   sign: 1
 });
+/**
+ * Pentated MSI, = 10↑↑↑9007199254740991.
+ */
 PowiainaNum.PENTATED_MSI = new PowiainaNum({
   array: [{
     arrow: 0,
     expans: 1,
     megota: 1,
-    repeat: MSI
-  }, {
-    arrow: 1,
-    expans: 1,
-    megota: 1,
-    repeat: MSI
+    repeat: 10
   }, {
     arrow: 2,
     expans: 1,
     megota: 1,
-    repeat: MSI
+    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: [{
@@ -1823,6 +1972,40 @@ PowiainaNum.NaN = new PowiainaNum({
   layer: 0,
   sign: 0
 });
+/**
+ * The mathematical constant e. This is Euler's number, the base of natural logarithms.
+ */
+PowiainaNum.E = new PowiainaNum(Math.E);
+/**
+ * The natural logarithm of 2 = ln(2).
+ */
+PowiainaNum.LN2 = new PowiainaNum(Math.LN2);
+/**
+ * The natural logarithm of 10.
+ */
+PowiainaNum.LN10 = new PowiainaNum(Math.LN10);
+/**
+ * The base-2 logarithm of e = log_2(e).
+ */
+PowiainaNum.LOG2E = new PowiainaNum(Math.LOG2E);
+/**
+ * The base-10 logarithm of e = log_10(e).
+ */
+PowiainaNum.LOG10E = new PowiainaNum(Math.LOG10E);
+/**
+ * Pi(). This is the ratio of the circumference of a circle to its diameter.
+ */
+PowiainaNum.PI = new PowiainaNum(Math.PI);
+/**
+ * The square root of 0.5, or, equivalently, one divided by the square root of 2.
+ *
+ * = (√2)/2 = √(0.5)
+ */
+PowiainaNum.SQRT1_2 = new PowiainaNum(Math.SQRT1_2);
+/**
+ * The square root of 2 = √2.
+ */
+PowiainaNum.SQRT2 = new PowiainaNum(Math.SQRT2);
 PowiainaNum.maxOps = 100;
 PowiainaNum.arrowFuncMap = new Map();