js-confuser 1.5.9 → 1.7.0

package/dist/transforms/stack.js

@@ -9,6 +9,8 @@ var _assert = require("assert");
 
 var _order = require("../order");
 
+var _probability = require("../probability");
+
 var _template = _interopRequireDefault(require("../templates/template"));
 
 var _traverse = require("../traverse");
@@ -23,6 +25,10 @@ var _random = require("../util/random");
 
 var _transform = _interopRequireDefault(require("./transform"));
 
+var _constants = require("../constants");
+
+var _functionLength = require("../templates/functionLength");
+
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
 
 function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
@@ -31,9 +37,11 @@ class Stack extends _transform.default {
   constructor(o) {
     super(o, _order.ObfuscateOrder.Stack);
 
-    _defineProperty(this, "made", void 0);
+    _defineProperty(this, "mangledExpressionsMade", void 0);
+
+    _defineProperty(this, "functionLengthName", void 0);
 
-    this.made = 0;
+    this.mangledExpressionsMade = 0;
   }
 
   match(object, parents) {
@@ -41,7 +49,11 @@ class Stack extends _transform.default {
   }
 
   transform(object, parents) {
+    var _this = this;
+
     return () => {
+      var _getBlockBody$;
+
       // Uncaught SyntaxError: Getter must not have any formal parameters.
       // Uncaught SyntaxError: Setter must have exactly one formal parameter
       var propIndex = parents.findIndex(x => x.type === "Property" || x.type === "MethodDefinition");
@@ -52,13 +64,40 @@ class Stack extends _transform.default {
             return;
           }
         }
+      } // Don't apply to functions with 'use strict' directive
+
+
+      if ((_getBlockBody$ = (0, _insert.getBlockBody)(object.body)[0]) !== null && _getBlockBody$ !== void 0 && _getBlockBody$.directive) {
+        return;
+      }
+
+      if (!(0, _probability.ComputeProbabilityMap)(this.options.stack)) {
+        return;
       }
 
       var defined = new Set();
       var referenced = new Set();
       var illegal = new Set();
+      /**
+       * Maps old names to new indices
+       */
+
       var subscripts = new Map();
       var deadValues = Object.create(null);
+      var propertyGen = this.getGenerator();
+
+      function isTransformableFunction(functionNode) {
+        if (functionNode.$requiresEval) return false; // Check for 'this'
+
+        var isIllegal = false;
+        (0, _traverse.walk)(functionNode.body, [], (o, p) => {
+          if (o.type === "ThisExpression") {
+            isIllegal = true;
+            return "EXIT";
+          }
+        });
+        return !isIllegal;
+      }
 
       function setSubscript(string, index) {
         subscripts.set(string, index + "");
@@ -70,23 +109,35 @@ class Stack extends _transform.default {
         setSubscript(param.name, subscripts.size);
       });
       var startingSize = subscripts.size;
+      var isIllegal = false;
       (0, _traverse.walk)(object.body, [object, ...parents], (o, p) => {
+        if (o.type === "Identifier" && o.name === "arguments") {
+          isIllegal = true;
+          return "EXIT";
+        }
+
         if (o.type == "Identifier") {
           var info = (0, _identifiers.getIdentifierInfo)(o, p);
 
-          if (!info.spec.isReferenced) {
+          if (!info.spec.isReferenced || info.spec.isExported) {
             return;
           }
 
           var c = info.spec.isDefined ? (0, _insert.getDefiningContext)(o, p) : (0, _insert.getReferencingContexts)(o, p).find(x => (0, _insert.isVarContext)(x));
 
           if (c !== object) {
-            this.log(o.name + " is illegal due to different context");
+            // this.log(o.name + " is illegal due to different context");
+            illegal.add(o.name);
+          }
+
+          if (o.name.startsWith(_constants.noRenameVariablePrefix)) {
             illegal.add(o.name);
           }
 
           if (info.isClauseParameter || info.isFunctionParameter || (0, _insert.isForInitialize)(o, p)) {
-            this.log(o.name + " is illegal due to clause parameter/function parameter");
+            // this.log(
+            //   o.name + " is illegal due to clause parameter/function parameter"
+            // );
             illegal.add(o.name);
           }
 
@@ -100,23 +151,52 @@ class Stack extends _transform.default {
             }
 
             if (info.isFunctionDeclaration) {
-              if (p[0] !== object.body.body[0]) {
+              (0, _assert.ok)(p[0].type === "FunctionDeclaration");
+
+              if (p[0] !== object.body.body[0] || !isTransformableFunction(p[0])) {
                 illegal.add(o.name);
               }
-            }
+            } // The new accessors will either be numbered: [index] or as a string .string
+
+
+            var newSubscript = (0, _random.choice)([subscripts.size, propertyGen.generate()]);
+            setSubscript(o.name, newSubscript);
+            defined.add(o.name); // Stack can only process single VariableDeclarations
 
-            setSubscript(o.name, subscripts.size);
-            defined.add(o.name);
             var varIndex = p.findIndex(x => x.type == "VariableDeclaration");
 
-            if (varIndex !== -1 && (varIndex !== 2 || p[varIndex].declarations.length > 1)) {
-              illegal.add(o.name);
+            if (varIndex !== -1) {
+              // Invalid 'id' property (must be Identifier)
+              if (varIndex !== 2) {
+                illegal.add(o.name);
+              } else if (p[varIndex].declarations.length > 1) {
+                illegal.add(o.name);
+              } else {
+                var value = p[varIndex].declarations[0].init;
+
+                if (value && !isTransformableFunction(value)) {
+                  illegal.add(o.name);
+                }
+              }
             }
           } else if (info.spec.isReferenced) {
+            if (info.spec.isModified) {
+              var assignmentIndex = p.findIndex(x => x.type === "AssignmentExpression");
+
+              if (assignmentIndex !== -1) {
+                var value = p[assignmentIndex].right;
+
+                if (value && !isTransformableFunction(value)) {
+                  illegal.add(o.name);
+                }
+              }
+            }
+
             referenced.add(o.name);
           }
         }
       });
+      if (isIllegal) return;
       illegal.forEach(name => {
         defined.delete(name);
         referenced.delete(name);
@@ -136,14 +216,15 @@ class Stack extends _transform.default {
         return;
       }
 
-      function numberLiteral(number) {
+      const numberLiteral = function (number) {
         let depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
         (0, _assert.ok)(number === number);
 
-        if (typeof number !== "number" || !Object.keys(deadValues).length || depth > 5 || Math.random() > (depth == 0 ? 0.9 : 0.8 / (depth * 2))) {
+        if (typeof number !== "number" || !Object.keys(deadValues).length || depth > 4 || (0, _random.chance)(75 + depth * 15 + _this.mangledExpressionsMade / 25)) {
           return (0, _gen.Literal)(number);
         }
 
+        _this.mangledExpressionsMade++;
         var opposingIndex = (0, _random.choice)(Object.keys(deadValues));
 
         if (typeof opposingIndex === "undefined") {
@@ -153,15 +234,14 @@ class Stack extends _transform.default {
         var actualValue = deadValues[opposingIndex];
         (0, _assert.ok)(typeof actualValue === "number");
         return (0, _gen.BinaryExpression)("-", (0, _gen.MemberExpression)((0, _gen.Identifier)(stackName), numberLiteral(isNaN(parseFloat(opposingIndex)) ? opposingIndex : parseFloat(opposingIndex), depth + 1), true), numberLiteral(actualValue - number, depth + 1));
-      }
+      };
 
       function getMemberExpression(index) {
         (0, _assert.ok)(typeof index === "string", typeof index);
         return (0, _gen.MemberExpression)((0, _gen.Identifier)(stackName), numberLiteral(isNaN(parseFloat(index)) ? index : parseFloat(index)), true);
       }
 
-      var stackName = this.getPlaceholder();
-      var made = 1;
+      var stackName = this.getPlaceholder() + "_stack";
 
       const scan = (o, p) => {
         if (o.type == "Identifier") {
@@ -216,8 +296,7 @@ class Stack extends _transform.default {
           }
         }
 
-        if (o.type == "Literal" && typeof o.value === "number" && Math.floor(o.value) === o.value && Math.abs(o.value) < 100000 && Math.random() < 4 / made && p.find(x => (0, _insert.isFunction)(x)) === object) {
-          made++;
+        if (o.type == "Literal" && typeof o.value === "number" && Math.floor(o.value) === o.value && Math.abs(o.value) < 100000 && p.find(x => (0, _insert.isFunction)(x)) === object && (0, _random.chance)(50)) {
           return () => {
             this.replaceIdentifierOrLiteral(o, numberLiteral(o.value, 0), p);
           };
@@ -228,9 +307,9 @@ class Stack extends _transform.default {
       object.body.body.forEach((stmt, index) => {
         var isFirst = index == 0;
 
-        if (isFirst || Math.random() < 0.9 / index) {
+        if (isFirst || (0, _random.chance)(50 - index * 10)) {
           var exprs = [];
-          var changes = (0, _random.getRandomInteger)(isFirst ? 2 : 1, isFirst ? 3 : 2);
+          var changes = (0, _random.getRandomInteger)(1, 3);
 
           for (var i = 0; i < changes; i++) {
             var expr;
@@ -240,7 +319,7 @@ class Stack extends _transform.default {
             var i = 0;
 
             do {
-              newIndex = (0, _random.getRandomInteger)(0, 250 + subscripts.size + i * 1000) + "";
+              newIndex = (0, _random.choice)([propertyGen.generate(), (0, _random.getRandomInteger)(0, 250 + subscripts.size + i * 1000) + ""]);
               i++;
             } while (valueSet.has(newIndex));
 
@@ -254,9 +333,9 @@ class Stack extends _transform.default {
                 break;
 
               case "deadValue":
-                var rand = (0, _random.getRandomInteger)(-250, 250); // modify an already existing dead value index
+                var rand = (0, _random.getRandomInteger)(-150, 150); // modify an already existing dead value index
 
-                if (Math.random() > 0.5) {
+                if ((0, _random.chance)(50)) {
                   var alreadyExisting = (0, _random.choice)(Object.keys(deadValues));
 
                   if (typeof alreadyExisting === "string") {
@@ -265,7 +344,6 @@ class Stack extends _transform.default {
                 }
 
                 expr = (0, _gen.AssignmentExpression)("=", getMemberExpression(newIndex), numberLiteral(rand));
-                (0, _assert.ok)(!subscripts.has(newIndex));
                 deadValues[newIndex] = rand;
                 break;
             }
@@ -291,11 +369,35 @@ class Stack extends _transform.default {
 
       Object.keys(rotateNodes).forEach((index, i) => {
         object.body.body.splice(parseInt(index) + i, 0, rotateNodes[index]);
-      }); // Set the params for this function to be the stack array
+      }); // Preserve function.length property
+
+      var originalFunctionLength = (0, _insert.computeFunctionLength)(object.params); // Set the params for this function to be the stack array
 
       object.params = [(0, _gen.RestElement)((0, _gen.Identifier)(stackName))]; // Ensure the array is correct length
 
-      (0, _insert.prepend)(object.body, (0, _template.default)("".concat(stackName, ".length = ").concat(startingSize)).single());
+      (0, _insert.prepend)(object.body, (0, _template.default)("".concat(stackName, "[\"length\"] = ").concat(startingSize)).single());
+
+      if (originalFunctionLength !== 0) {
+        if (!this.functionLengthName) {
+          this.functionLengthName = this.getPlaceholder();
+          (0, _insert.prepend)(parents[parents.length - 1] || object, _functionLength.FunctionLengthTemplate.single({
+            name: this.functionLengthName
+          }));
+        }
+
+        if (object.type === "FunctionDeclaration") {
+          var body = parents[0];
+
+          if (Array.isArray(body)) {
+            var index = body.indexOf(object);
+            body.splice(index, 0, (0, _gen.ExpressionStatement)((0, _gen.CallExpression)((0, _gen.Identifier)(this.functionLengthName), [(0, _gen.Identifier)(object.id.name), (0, _gen.Literal)(originalFunctionLength)])));
+          }
+        } else {
+          (0, _assert.ok)(object.type === "FunctionExpression" || object.type === "ArrowFunctionExpression");
+          this.replace(object, (0, _gen.CallExpression)((0, _gen.Identifier)(this.functionLengthName), [{ ...object
+          }, (0, _gen.Literal)(originalFunctionLength)]));
+        }
+      }
     };
   }
 

package/dist/transforms/string/encoding.js

@@ -10,200 +10,171 @@ var _template = _interopRequireDefault(require("../../templates/template"));
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
 
 const Encoding = {
-  ascii85: {
-    encode(a) {
-      var b, c, d, e, f, g, h, i, j, k; // @ts-ignore
-
-      for ( // @ts-ignore
-      !/[^\x00-\xFF]/.test(a), b = "\x00\x00\x00\x00".slice(a.length % 4 || 4), a += b, c = [], d = 0, e = a.length; e > d; d += 4) f = (a.charCodeAt(d) << 24) + (a.charCodeAt(d + 1) << 16) + (a.charCodeAt(d + 2) << 8) + a.charCodeAt(d + 3), 0 !== f ? (k = f % 85, f = (f - k) / 85, j = f % 85, f = (f - j) / 85, i = f % 85, f = (f - i) / 85, h = f % 85, f = (f - h) / 85, g = f % 85, c.push(g + 33, h + 33, i + 33, j + 33, k + 33)) : c.push(122);
-
-      return function (a, b) {
-        for (var c = b; c > 0; c--) a.pop();
-      }(c, b.length), "<~" + String.fromCharCode.apply(String, c) + "~>";
-    },
-
-    decode(a) {
-      var c,
-          d,
-          e,
-          f,
-          g,
-          h = String,
-          l = "length",
-          w = 255,
-          x = "charCodeAt",
-          y = "slice",
-          z = "replace";
-
-      for ("<~" === a[y](0, 2) && "~>" === a[y](-2), a = a[y](2, -2)[z](/s/g, "")[z]("z", "!!!!!"), c = "uuuuu"[y](a[l] % 5 || 5), a += c, e = [], f = 0, g = a[l]; g > f; f += 5) d = 52200625 * (a[x](f) - 33) + 614125 * (a[x](f + 1) - 33) + 7225 * (a[x](f + 2) - 33) + 85 * (a[x](f + 3) - 33) + (a[x](f + 4) - 33), e.push(w & d >> 24, w & d >> 16, w & d >> 8, w & d);
-
-      return function (a, b) {
-        for (var c = b; c > 0; c--) a.pop();
-      }(e, c[l]), h.fromCharCode.apply(h, e);
-    },
-
-    template: (0, _template.default)("\n    function {name}(a, LL = [\"fromCharCode\", \"apply\"]) {\n      var c, d, e, f, g, h = String, l = \"length\", w = 255, x = \"charCodeAt\", y = \"slice\", z = \"replace\";\n      for (\"<~\" === a[y](0, 2) && \"~>\" === a[y](-2), a = a[y](2, -2)[z](/s/g, \"\")[z](\"z\", \"!!!!!\"), \n      c = \"uuuuu\"[y](a[l] % 5 || 5), a += c, e = [], f = 0, g = a[l]; g > f; f += 5) d = 52200625 * (a[x](f) - 33) + 614125 * (a[x](f + 1) - 33) + 7225 * (a[x](f + 2) - 33) + 85 * (a[x](f + 3) - 33) + (a[x](f + 4) - 33), \n      e.push(w & d >> 24, w & d >> 16, w & d >> 8, w & d);\n      return function(a, b) {\n        for (var c = b; c > 0; c--) a.pop();\n      }(e, c[l]), h[LL[0]][LL[1]](h, e);\n    }\n    ")
-  },
-  base32: {
-    encode: function (s) {
-      var a = "!\"#$%&'()*+,-./0123456789:;<=>?@";
-      var len = s.length;
-      var o = "";
-      var w,
-          c,
-          r = 0,
-          sh = 0,
-          i;
-
-      for (i = 0; i < len; i += 5) {
-        // mask top 5 bits
-        c = s.charCodeAt(i);
-        w = 0xf8 & c;
-        o += a.charAt(w >> 3);
-        r = 0x07 & c;
-        sh = 2;
-
-        if (i + 1 < len) {
-          c = s.charCodeAt(i + 1); // mask top 2 bits
-
-          w = 0xc0 & c;
-          o += a.charAt((r << 2) + (w >> 6));
-          o += a.charAt((0x3e & c) >> 1);
-          r = c & 0x01;
-          sh = 4;
-        }
-
-        if (i + 2 < len) {
-          c = s.charCodeAt(i + 2); // mask top 4 bits
-
-          w = 0xf0 & c;
-          o += a.charAt((r << 4) + (w >> 4));
-          r = 0x0f & c;
-          sh = 1;
-        }
-
-        if (i + 3 < len) {
-          c = s.charCodeAt(i + 3); // mask top 1 bit
-
-          w = 0x80 & c;
-          o += a.charAt((r << 1) + (w >> 7));
-          o += a.charAt((0x7c & c) >> 2);
-          r = 0x03 & c;
-          sh = 3;
-        }
-
-        if (i + 4 < len) {
-          c = s.charCodeAt(i + 4); // mask top 3 bits
-
-          w = 0xe0 & c;
-          o += a.charAt((r << 3) + (w >> 5));
-          o += a.charAt(0x1f & c);
-          r = 0;
-          sh = 0;
+  base91: {
+    encode(str) {
+      const table = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789!#$%&()*+,./:;<=>?@[]^_`{|}~"';
+      const raw = Buffer.from(str, "utf-8");
+      const len = raw.length;
+      let ret = "";
+      let n = 0;
+      let b = 0;
+
+      for (let i = 0; i < len; i++) {
+        b |= raw[i] << n;
+        n += 8;
+
+        if (n > 13) {
+          let v = b & 8191;
+
+          if (v > 88) {
+            b >>= 13;
+            n -= 13;
+          } else {
+            v = b & 16383;
+            b >>= 14;
+            n -= 14;
+          }
+
+          ret += table[v % 91] + table[v / 91 | 0];
         }
-      } // Calculate length of pad by getting the
-      // number of words to reach an 8th octet.
-
-
-      if (r != 0) {
-        o += a.charAt(r << sh);
       }
 
-      return o;
-    },
-    decode: function (s) {
-      var v,
-          x,
-          bits = 0,
-          o = "",
-          len = s.length,
-          d = String,
-          e = "charCodeAt",
-          f = "fromCharCode",
-          i;
-
-      for (i = 0; i < len; i += 1) {
-        v = s[e](i) - 33, v >= 0 && v < 32 ? (bits += (x = x << 5 | v, 5), bits >= 8 ? bits -= (o += d[f](x >> bits - 8 & 0xff), 8) : 0) : 0;
+      if (n) {
+        ret += table[b % 91];
+        if (n > 7 || b > 90) ret += table[b / 91 | 0];
       }
 
-      return o;
+      return ret;
     },
-    template: (0, _template.default)("\n    function {name}(s) {\n      var v,\n        x,\n        b = 0,\n        o = \"\",\n        len = s.length,\n        d = String,\n        e = \"charCodeAt\",\n        f = \"fromCharCode\", i;\n  \n      for (i = 0; i < len; i += 1) {\n        (v = s[e](i) - 33),\n          v >= 0 && v < 32\n            ? ((b += ((x = (x << 5) | v), 5)),\n              b >= 8\n                ? (b -= ((o += d[f]((x >> (b - 8)) & 0xff)), 8))\n                : 0)\n            : 0;\n      }\n      return o;\n    }\n    ")
-  },
-  hexTable: {
-    encode: function (str) {
-      var output = "";
 
-      for (var j = 0; j < str.length; j += 3) {
-        var chunk = str.substring(j, j + 3);
-
-        if (!chunk) {
-          continue;
+    decode(str) {
+      const table = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789!#$%&()*+,./:;<=>?@[]^_`{|}~"';
+      const raw = "" + (str || "");
+      const len = raw.length;
+      const ret = [];
+      let b = 0;
+      let n = 0;
+      let v = -1;
+
+      for (let i = 0; i < len; i++) {
+        const p = table.indexOf(raw[i]);
+        if (p === -1) continue;
+
+        if (v < 0) {
+          v = p;
+        } else {
+          v += p * 91;
+          b |= v << n;
+          n += (v & 8191) > 88 ? 13 : 14;
+
+          do {
+            ret.push(b & 0xff);
+            b >>= 8;
+            n -= 8;
+          } while (n > 7);
+
+          v = -1;
         }
-
-        chunk = chunk + "~";
-        var uniqueChars = new Set([]);
-
-        for (var char of chunk) {
-          uniqueChars.add(char);
-        }
-
-        var keys = Array.from(uniqueChars).sort();
-        var table = {},
-            i = 0;
-
-        for (var key of keys) {
-          table[key] = i++;
-        }
-
-        var idx = [];
-
-        for (var char of chunk) {
-          idx.push(table[char]);
-        }
-
-        var table64 = "0x";
-
-        for (var i = keys.length - 1; i >= 0; i--) {
-          table64 += keys[i].charCodeAt(0).toString(16).toUpperCase();
-        }
-
-        var idxInt = 0;
-
-        for (var i = idx.length - 1; i >= 0; i--) {
-          idxInt = idxInt << 3 | idx[i];
-        }
-
-        var idx64 = "0x" + idxInt.toString(16).toUpperCase(); // console.log(chunk, table, idx, table64, idx64);
-
-        output += table64 + "," + idx64 + ",";
       }
 
-      if (output.endsWith(",")) {
-        output = output.substring(0, output.length - 1);
+      if (v > -1) {
+        ret.push((b | v << n) & 0xff);
       }
 
-      return "{" + output + "}";
+      return Buffer.from(ret).toString("utf-8");
     },
-    decode: function (str) {
-      var output = "";
-      str = str.substring(1, str.length - 1);
-      var chunks = str.split(",");
-
-      for (var i = 0; i < chunks.length; i += 2) {
-        var arr = [chunks[i], chunks[i + 1]];
-        var [table, idx] = arr.map(Number); // console.log(table, idx);
-
-        while (idx) {
-          output += String.fromCharCode(table >> 8 * (idx & 7) & 0xff);
-          idx >>= 3;
-        }
-      }
 
-      return output.replace(/~/g, "");
-    },
-    template: (0, _template.default)("\n      function {name}(str){\n        var output = \"\";\n    \n        str = str.substring(1, str.length - 1);\n        var chunks = str.split(\",\");\n      \n        for (var i = 0; i < chunks.length; i += 2) {\n          var arr = [chunks[i], chunks[i + 1]];\n      \n          var [table, idx] = arr.map(Number);\n      \n          // console.log(table, idx);\n          while (idx) {\n            output += String.fromCharCode((table >> (8 * (idx & 7))) & 0xff);\n            idx >>= 3;\n          }\n        }\n      \n        return output.replace(/~/g, \"\");\n      }\n    \n    ")
+    template: (0, _template.default)("  \n      function {name}(str){\n        const table =\n          'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789!#$%&()*+,./:;<=>?@[]^_`{|}~\"';\n\n        const raw = \"\" + (str || \"\");\n        const len = raw.length;\n        const ret = [];\n\n        let b = 0;\n        let n = 0;\n        let v = -1;\n\n        for (let i = 0; i < len; i++) {\n          const p = table.indexOf(raw[i]);\n          if (p === -1) continue;\n          if (v < 0) {\n            v = p;\n          } else {\n            v += p * 91;\n            b |= v << n;\n            n += (v & 8191) > 88 ? 13 : 14;\n            do {\n              ret.push(b & 0xff);\n              b >>= 8;\n              n -= 8;\n            } while (n > 7);\n            v = -1;\n          }\n        }\n\n        if (v > -1) {\n          ret.push((b | (v << n)) & 0xff);\n        }\n\n        return {bufferToString}(ret);\n      }\n    ")
   }
+  /* ascii85: { This implementation is flaky and causes decoding errors 
+    encode(a) {
+      var b, c, d, e, f, g, h, i, j, k;
+      // @ts-ignore
+      for (
+        // @ts-ignore
+        !/[^\x00-\xFF]/.test(a),
+          b = "\x00\x00\x00\x00".slice(a.length % 4 || 4),
+          a += b,
+          c = [],
+          d = 0,
+          e = a.length;
+        e > d;
+        d += 4
+      )
+        (f =
+          (a.charCodeAt(d) << 24) +
+          (a.charCodeAt(d + 1) << 16) +
+          (a.charCodeAt(d + 2) << 8) +
+          a.charCodeAt(d + 3)),
+          0 !== f
+            ? ((k = f % 85),
+              (f = (f - k) / 85),
+              (j = f % 85),
+              (f = (f - j) / 85),
+              (i = f % 85),
+              (f = (f - i) / 85),
+              (h = f % 85),
+              (f = (f - h) / 85),
+              (g = f % 85),
+              c.push(g + 33, h + 33, i + 33, j + 33, k + 33))
+            : c.push(122);
+      return (
+        (function (a, b) {
+          for (var c = b; c > 0; c--) a.pop();
+        })(c, b.length),
+        "<~" + String.fromCharCode.apply(String, c) + "~>"
+      );
+    },
+    decode(a) {
+      var c,
+        d,
+        e,
+        f,
+        g,
+        h = String,
+        l = "length",
+        w = 255,
+        x = "charCodeAt",
+        y = "slice",
+        z = "replace";
+      for (
+        "<~" === a[y](0, 2) && "~>" === a[y](-2),
+          a = a[y](2, -2)[z](/s/g, "")[z]("z", "!!!!!"),
+          c = "uuuuu"[y](a[l] % 5 || 5),
+          a += c,
+          e = [],
+          f = 0,
+          g = a[l];
+        g > f;
+        f += 5
+      )
+        (d =
+          52200625 * (a[x](f) - 33) +
+          614125 * (a[x](f + 1) - 33) +
+          7225 * (a[x](f + 2) - 33) +
+          85 * (a[x](f + 3) - 33) +
+          (a[x](f + 4) - 33)),
+          e.push(w & (d >> 24), w & (d >> 16), w & (d >> 8), w & d);
+      return (
+        (function (a, b) {
+          for (var c = b; c > 0; c--) a.pop();
+        })(e, c[l]),
+        h.fromCharCode.apply(h, e)
+      );
+    },
+    template: Template(`
+    function {name}(a, LL = ["fromCharCode", "apply"]) {
+      var c, d, e, f, g, h = String, l = "length", w = 255, x = "charCodeAt", y = "slice", z = "replace";
+      for ("<~" === a[y](0, 2) && "~>" === a[y](-2), a = a[y](2, -2)[z](/\s/g, "")[z]("z", "!!!!!"), 
+      c = "uuuuu"[y](a[l] % 5 || 5), a += c, e = [], f = 0, g = a[l]; g > f; f += 5) d = 52200625 * (a[x](f) - 33) + 614125 * (a[x](f + 1) - 33) + 7225 * (a[x](f + 2) - 33) + 85 * (a[x](f + 3) - 33) + (a[x](f + 4) - 33), 
+      e.push(w & d >> 24, w & d >> 16, w & d >> 8, w & d);
+      return function(a, b) {
+        for (var c = b; c > 0; c--) a.pop();
+      }(e, c[l]), h[LL[0]][LL[1]](h, e);
+    }
+    `),
+  }, */
+
 };
 var _default = Encoding;
 exports.default = _default;