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

package/README.md

@@ -1,72 +1,98 @@
-# PowiainaNum.js
-
-A JavaScript library that handles arithmetic for numbers as large as {10,9e15,1,1,1,2}.
-
-This reaches level f<sub>ω<sup>3</sup>+1</sub>.
-
-Internally, it is represented as an sign,layer, small and array. Sign is 1 or -1. It's 10{oper.arrow, oper.expans, oper.megota}, If arrow count or expans count is Infinite, the count replaces from the next operators.
-
-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, sqrt, cbrt, root, log10, log, cmp, isFinite, isInfinite, isNaN`(some missing items that have not been fully developed)
-
-## Using
-
-The library exports a class,
-Create a PowiainaNum.js object like this:
-
-```javascript
-import PowiainaNum from "powiaina_num.js"; // static import 
-const { default: PowiainaNum } = await import("powiaina_num.js") // dynamic import
-
-let a = new PowiainaNum(); // create PN.js number with NaN
-let b = new PowiainaNum(3); // create PN.js number with number 3
-let c = new PowiainaNum("1e114514"); // create PN.js number with number 10^114514
-
-let d = new PowiainaNum(c); // create PN.js number from a PN.js number
-```
-
-Javascript operators will not work such as `+`, `-`, etc.
-You should call the equivalent functions instead.
-
-```javascript
-let a = new PowiainaNum(114514);
-let b = new PowiainaNum(1919810);
-
-// Calculate a+b:
-let c = a.add(b); // 1919810+114514
-
-// Calculate a-b:
-let c = a.sub(b);
-
-a.mul(b); // a*b
-a.div(b); // a/b
-a.pow(b); // a^b
-
-a.log10(); // log10(a)
-
-// comparing PN.js numbers
-
-a.lt(b); // a is less than b
-a.gt(b); // a is greater than b
-a.eq(b); // a is equals to b
-```
-
-## Future ideas
-
-Extend `Operator` to nearly infinite keys to reach level f<sub>ω<sup>ω</sup></sub>
-
-```typescript
-interface Operator {
-  /*P3*/ arrow: number;
-  /*P4*/ expans: number;
-  /*P5*/ megota: number;
-  /*P6*/ powiaina: number;
-  P7: number;
-  .....
-
-  repeat: number;
-
-  valuereplaced?: -1 | 0 | 1 | 2 | ...
-}
-```
+# PowiainaNum.js
+
+A JavaScript library that handles arithmetic for numbers as large as {10,9e15,1,1,1,2}.
+
+This reaches level f<sub>ω<sup>3</sup>+1</sub>.
+
+Internally, it is represented as an sign, array, small, and layer. Sign is 1 or -1. . Layer is a non-negative integer. 
+
+The operator interface is `interface {arrow: number; expans: number; megota: number; repeat: number;}`, which respents {10, {10, ...{10, X, arrow, expans, megota}..., arrow, expans, megota}, arrow, expans, megota} (repeat means counts of 10's);
+
+The array is `Operator[]`
+
+when $$f(x) = \{10, 10, 10, 10, 10, x\}$$
+$$g_{a,b,c}(x) = \{10,x,a,b,c\}$$
+$$o_x = \text{last }x\text{th operator of array}  $$
+They together respents $s_{ign}\times f^{l_{ayer}} g_{o_1.arrow, o_1.expans, o_1.megota} g_{o_2.arrow, o_2.expans, o_2.megota} ...$
+
+If arrow count or expans count is Infinite, the count replaces to the next operators.
+
+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)
+
+## Using
+
+The library exports a class,
+Create a PowiainaNum.js object like this:
+
+```javascript
+import PowiainaNum from "powiaina_num.js"; // static import 
+const { default: PowiainaNum } = await import("powiaina_num.js") // dynamic import
+
+let a = new PowiainaNum(); // create PN.js number with NaN
+let b = new PowiainaNum(3); // create PN.js number with number 3
+let c = new PowiainaNum("1e114514"); // create PN.js number with number 10^114514
+
+let d = new PowiainaNum(c); // create PN.js number from a PN.js number
+
+let e = new PowiainaNum([[0,23.2352],[1,2],[2,6],[3,0],[4,1],[5,4]]); // You can also use a pair number array which from ExpantaNum.js
+
+let f = new PowiainaNum("(10^^^)^114514 e1919810") // ExpantaNum.js string form 
+
+let g = new PowiainaNum("10{!}e1919810") // 10{!} = 10{x}10, x points to e1919810, 10{!} = J in ExpantaNum.js
+let h = new PowiainaNum("10{1,2}ee114514") // {10, ee114514, 1, 2}
+let i = new PowiainaNum("10{1,514,114}ee114514") // {10, ee114514, 1, 514, 114}
+let j = new PowiainaNum("/10{1,514,114}ee114514") // Very small numbers ({10, ee114514, 1, 514, 114})^-1
+let k = new PowiainaNum("(e^114514)1919810") // break_eternity.js (e^x) form
+```
+
+In browser, you can download `dist/PowiainaNum.min.js` or use 
+```html
+<script src="https://unpkg.com/powiaina_num.js@alpha"></script>
+```
+
+Javascript operators will not work such as `+`, `-`, etc.
+You should call the equivalent functions instead.
+
+```javascript
+let a = new PowiainaNum(114514);
+let b = new PowiainaNum(1919810);
+
+// Calculate a+b:
+let c = a.add(b); // 1919810+114514
+
+// Calculate a-b:
+let c = a.sub(b);
+
+a.mul(b); // a*b
+a.div(b); // a/b
+a.pow(b); // a^b
+
+a.log10(); // log10(a)
+
+// comparing PN.js numbers
+
+a.lt(b); // a is less than b
+a.gt(b); // a is greater than b
+a.eq(b); // a is equals to b
+```
+
+## Future ideas
+
+Extend `Operator` to nearly infinite keys to reach level f<sub>ω<sup>ω</sup></sub>
+
+```typescript
+interface Operator {
+  /*P3*/ arrow: number;
+  /*P4*/ expans: number;
+  /*P5*/ megota: number;
+  /*P6*/ powiaina: number;
+  P7: number;
+  .....
+
+  repeat: number;
+
+  valuereplaced?: -1 | 0 | 1 | 2 | ...
+}
+```

package/dist/PowiainaNum.cjs.js

@@ -44,7 +44,7 @@ var MSI_LOG10 = 15.954589770191003;
 var MSI_REC = 1.1102230246251568e-16;
 var LONG_STRING_MIN_LENGTH = 17;
 var EXP_E_REC = 1.444667861009766;
-var isPowiainaNum = /^\/*[-\+]*(Infinity|NaN|(10(\^+|\{([1-9]\d*|!)(,([1-9]\d*|!))?(,[1-9]\d*)?\})|\(10(\^+|\{([1-9]\d*|!)(,([1-9]\d*|!))?(,[1-9]\d*)?\})\)\^[1-9]\d* )*((\d+(\.\d*)?|\d*\.\d+)?([Ee][-\+]*))*(0|\d+(\.\d*)?|\d*\.\d+))$/;
+var isPowiainaNum = /^(PN)?\/*[-\+]*(Infinity|NaN|(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+))$/;
 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;
@@ -69,6 +69,16 @@ function compareTuples() {
   }
   return 0;
 }
+function replaceETo10(str) {
+  // 使用正则表达式匹配 (e^数字) 的模式
+  // 正则解释：\(e\^(\d+)\) 匹配 (e^数字)，其中 \d+ 匹配一个或多个数字
+  return str.replace(/\(e\^(\d+)\)/g, '(10^)^$1 ').replace(/(\d+)\x20*PT/g, '(10^)^$1 ');
+}
+/**
+ * 把一个字符串很长的数进行以10为底的对数
+ * @param str 被进行的字符串
+ * @returns 字符串以10为底的对数；
+ */
 function log10LongString(str) {
   return Math.log10(Number(str.substring(0, LONG_STRING_MIN_LENGTH))) + (str.length - LONG_STRING_MIN_LENGTH);
 }
@@ -153,6 +163,32 @@ function f_lambertw(z) {
   }
   throw Error("Iteration failed to converge: ".concat(z.toString())); //return Number.NaN;
 }
+function isTwoLengthArray(x) {
+  return x.length == 2;
+}
+function isTwoNumberArray(x) {
+  return typeof x[0] === "number" && typeof x[1] === "number";
+}
+function isExpantaNumArray(x) {
+  if (!Array.isArray(x)) return false;
+  for (var i = 0; i < x.length; i++) {
+    var arr = x[i];
+    if (!Array.isArray(arr)) return false;
+    if (!isTwoLengthArray(arr)) return false;
+    if (!isTwoNumberArray(arr)) return false;
+  }
+  return true;
+}
+function countLeadingZerosAfterDecimal(numStr) {
+  var match = numStr.match(/^0\.(0*)[1-9]/);
+  return match ? match[1].length : 0;
+}
+/*
+function countLeadingZerosAfterDecimal(numStr) {
+    const match = numStr.match(/^0\.(0*)[1-9]/);
+    return match ? match[1].length : 0;
+}
+*/
 //from https://github.com/scipy/scipy/blob/8dba340293fe20e62e173bdf2c10ae208286692f/scipy/special/lambertw.pxd
 // The evaluation can become inaccurate very close to the branch point
 // at ``-1/e``. In some corner cases, `lambertw` might currently
@@ -238,6 +274,10 @@ var PowiainaNum = /*#__PURE__*/function () {
         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);
@@ -341,6 +381,7 @@ var PowiainaNum = /*#__PURE__*/function () {
         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(((_b = (_a = r.array[1]) === null || _a === void 0 ? void 0 : _a.repeat) !== null && _b !== void 0 ? _b : 0) + 1, 1);
       r.normalize();
       return r;
@@ -533,6 +574,7 @@ var PowiainaNum = /*#__PURE__*/function () {
         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();
@@ -673,6 +715,93 @@ var PowiainaNum = /*#__PURE__*/function () {
         }
       }
     }
+  }, {
+    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()));
+        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();
+          if (arrows.gt(PowiainaNum.MSI)) {
+            r = arrows.clone();
+            r.setOperator(r.getOperator(Infinity) + 1, Infinity);
+            return r;
+          }
+          var arrowsNum = arrows.toNumber();
+          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([[0, 10], [arrowsNum, 1]]);
+          }
+          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;
+        }();
+        PowiainaNum.arrowFuncMap.set("".concat(t.toString(), " ").concat(arrows.toString(), " ").concat(other.toString()), res.clone());
+        return res;
+      };
+    }
+  }, {
+    key: "chain",
+    value: function chain(other, arrows) {
+      return this.arrow(arrows)(other);
+    }
   }, {
     key: "max",
     value: function max(x) {
@@ -1003,7 +1132,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--;
@@ -1013,8 +1142,9 @@ var PowiainaNum = /*#__PURE__*/function () {
           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) {
+        if (x.array.length >= 2 && x.array[0].repeat < MSI && x.array[1].arrow >= 2 && x.array[1].repeat == 1 && 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, x.array[1].arrow - 1, x.array[1].expans, x.array[1].megota));
           x.array[0].repeat = 10;
@@ -1030,12 +1160,13 @@ var PowiainaNum = /*#__PURE__*/function () {
       } while (renormalize);
       return this;
     }
+  }, {
+    key: "getOperatorIndex",
+    value:
     /**
      * @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) {
+    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;
       if (this.array.length == 1 && arrow == 0) return 0;
@@ -1088,7 +1219,7 @@ var PowiainaNum = /*#__PURE__*/function () {
       return false;
     }
     /**
-     * @returns PowiainaNum a PowiainaNum object which deep copied from `this` object.
+     * @returns  a PowiainaNum object which deep copied from `this` object.
      */
   }, {
     key: "clone",
@@ -1115,6 +1246,11 @@ var PowiainaNum = /*#__PURE__*/function () {
       this.layer = powlikeObject.layer;
       return this;
     }
+    /**
+     * Convert `this` to Javascript `number`
+     *
+     * returns `Infinity` when the number is greater than `Number.MAX_VALUE`
+     */
   }, {
     key: "toNumber",
     value: function toNumber() {
@@ -1124,13 +1260,16 @@ var PowiainaNum = /*#__PURE__*/function () {
       if (this.array.length == 1) return this.array[0].repeat;else if (this.array.length == 2 && this.array[1].arrow == 1 && this.array[1].expans == 1 && this.array[1].megota == 1 && this.array[1].repeat == 1) return Math.pow(10, this.getOperator(0));
       return NaN;
     }
+    /**
+     * Convert `this` to a string
+     */
   }, {
     key: "toString",
     value: function toString() {
       if (this.isNaN()) return "NaN";
       if (this.sign == -1) return "-".concat(this.neg().toString());
       if (this.small) {
-        if (this.eq(PowiainaNum.ZERO)) return "0";
+        if (this.isZero()) return "0";
         return "/".concat(this.rec().toString());
       }
       if (this.isInfi()) return "Infinity";
@@ -1146,12 +1285,22 @@ var PowiainaNum = /*#__PURE__*/function () {
         } else if (oper.repeat > 1) {
           calc = "(".concat(calc, ")^").concat(oper.repeat, " ");
         } else {
-          calc = "".concat(calc, " ");
+          calc = "".concat(calc);
         }
         res += "".concat(calc);
       }
       return res;
     }
+  }, {
+    key: "toJSON",
+    value:
+    /**
+     * Convert `this` to a JSON object
+     * @returns a JSON object
+     */
+    function toJSON() {
+      return "PN" + this.toString();
+    }
   }, {
     key: "arr01",
     get:
@@ -1295,6 +1444,11 @@ var PowiainaNum = /*#__PURE__*/function () {
     value: function isNaN(x) {
       return new PowiainaNum(x).isNaN();
     }
+  }, {
+    key: "arrowMSI",
+    value: function arrowMSI(arrowsNum) {
+      return new PowiainaNum("10".concat(arrowsNum).concat(MSI));
+    }
   }, {
     key: "fromNumber",
     value: function fromNumber(x) {
@@ -1327,14 +1481,52 @@ var PowiainaNum = /*#__PURE__*/function () {
       var _a, _b, _c, _d, _e, _f;
       var x = new PowiainaNum();
       // Judge the string was a number
-      // @ts-ignore
+      if (input.startsWith("PN")) input = input.substring(2);
       if (!isNaN(Number(input))) {
-        // @ts-ignore
-        if (isFinite(Number(input))) {
+        var res = Number(input);
+        var _a2 = false;
+        if (res == 0) {
+          if (/^(0*\.0*e)|(0*\.0*)$/.test(input)) {
+            _a2 = true;
+          }
+        } else {
+          _a2 = 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();
+        }
+        if (isFinite(res) && _a2) {
           x.resetFromObject(PowiainaNum.fromNumber(Number(input)));
           return x;
         }
       }
+      input = replaceETo10(input);
       if (!isPowiainaNum.test(input)) {
         throw powiainaNumError + "malformed input: " + input;
       }
@@ -1482,19 +1674,35 @@ var PowiainaNum = /*#__PURE__*/function () {
     value: function fromObject(powlikeObject) {
       var obj = new PowiainaNum();
       obj.array = [];
-      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
-        };
+      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;
+        obj.normalize();
+        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;
       }
-      obj.small = powlikeObject.small;
-      obj.sign = powlikeObject.sign;
-      obj.layer = powlikeObject.layer;
-      return obj;
     }
   }]);
 }();
@@ -1616,5 +1824,6 @@ PowiainaNum.NaN = new PowiainaNum({
   sign: 0
 });
 PowiainaNum.maxOps = 100;
+PowiainaNum.arrowFuncMap = new Map();
 
 module.exports = PowiainaNum;