js-confuser 1.7.2 → 2.0.0-alpha.0

package/dist/order.js

@@ -3,36 +3,36 @@
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.ObfuscateOrder = void 0;
+exports.Order = void 0;
 /**
  * Describes the order of transformations.
  */
-let ObfuscateOrder = exports.ObfuscateOrder = /*#__PURE__*/function (ObfuscateOrder) {
-  ObfuscateOrder[ObfuscateOrder["Preparation"] = 0] = "Preparation";
-  ObfuscateOrder[ObfuscateOrder["ObjectExtraction"] = 1] = "ObjectExtraction";
-  ObfuscateOrder[ObfuscateOrder["Flatten"] = 2] = "Flatten";
-  ObfuscateOrder[ObfuscateOrder["RGF"] = 3] = "RGF";
-  ObfuscateOrder[ObfuscateOrder["Lock"] = 4] = "Lock";
-  ObfuscateOrder[ObfuscateOrder["Dispatcher"] = 6] = "Dispatcher";
-  ObfuscateOrder[ObfuscateOrder["DeadCode"] = 8] = "DeadCode";
-  ObfuscateOrder[ObfuscateOrder["Calculator"] = 9] = "Calculator";
-  ObfuscateOrder[ObfuscateOrder["ControlFlowFlattening"] = 10] = "ControlFlowFlattening";
-  ObfuscateOrder[ObfuscateOrder["Eval"] = 11] = "Eval";
-  ObfuscateOrder[ObfuscateOrder["GlobalConcealing"] = 12] = "GlobalConcealing";
-  ObfuscateOrder[ObfuscateOrder["OpaquePredicates"] = 13] = "OpaquePredicates";
-  ObfuscateOrder[ObfuscateOrder["StringSplitting"] = 16] = "StringSplitting";
-  ObfuscateOrder[ObfuscateOrder["StringConcealing"] = 17] = "StringConcealing";
-  ObfuscateOrder[ObfuscateOrder["StringCompression"] = 18] = "StringCompression";
-  ObfuscateOrder[ObfuscateOrder["Stack"] = 20] = "Stack";
-  ObfuscateOrder[ObfuscateOrder["DuplicateLiteralsRemoval"] = 22] = "DuplicateLiteralsRemoval";
-  ObfuscateOrder[ObfuscateOrder["Shuffle"] = 24] = "Shuffle";
-  ObfuscateOrder[ObfuscateOrder["NameRecycling"] = 25] = "NameRecycling";
-  ObfuscateOrder[ObfuscateOrder["MovedDeclarations"] = 26] = "MovedDeclarations";
-  ObfuscateOrder[ObfuscateOrder["RenameLabels"] = 27] = "RenameLabels";
-  ObfuscateOrder[ObfuscateOrder["Minify"] = 28] = "Minify";
-  ObfuscateOrder[ObfuscateOrder["AntiTooling"] = 29] = "AntiTooling";
-  ObfuscateOrder[ObfuscateOrder["RenameVariables"] = 30] = "RenameVariables";
-  ObfuscateOrder[ObfuscateOrder["ES5"] = 31] = "ES5";
-  ObfuscateOrder[ObfuscateOrder["Finalizer"] = 35] = "Finalizer";
-  return ObfuscateOrder;
-}({});
+var Order = exports.Order = /*#__PURE__*/function (Order) {
+  Order[Order["Preparation"] = 0] = "Preparation";
+  Order[Order["ObjectExtraction"] = 1] = "ObjectExtraction";
+  Order[Order["Flatten"] = 2] = "Flatten";
+  Order[Order["Lock"] = 3] = "Lock";
+  Order[Order["RGF"] = 4] = "RGF";
+  Order[Order["Dispatcher"] = 6] = "Dispatcher";
+  Order[Order["DeadCode"] = 8] = "DeadCode";
+  Order[Order["Calculator"] = 9] = "Calculator";
+  Order[Order["GlobalConcealing"] = 12] = "GlobalConcealing";
+  Order[Order["OpaquePredicates"] = 13] = "OpaquePredicates";
+  Order[Order["StringSplitting"] = 16] = "StringSplitting";
+  Order[Order["StringConcealing"] = 17] = "StringConcealing";
+  Order[Order["StringCompression"] = 18] = "StringCompression";
+  Order[Order["VariableMasking"] = 20] = "VariableMasking";
+  Order[Order["DuplicateLiteralsRemoval"] = 22] = "DuplicateLiteralsRemoval";
+  Order[Order["Shuffle"] = 23] = "Shuffle";
+  Order[Order["ControlFlowFlattening"] = 24] = "ControlFlowFlattening";
+  Order[Order["MovedDeclarations"] = 25] = "MovedDeclarations";
+  Order[Order["FunctionOutlining"] = 26] = "FunctionOutlining";
+  Order[Order["RenameLabels"] = 27] = "RenameLabels";
+  Order[Order["Minify"] = 28] = "Minify";
+  Order[Order["AstScrambler"] = 29] = "AstScrambler";
+  Order[Order["RenameVariables"] = 30] = "RenameVariables";
+  Order[Order["Finalizer"] = 35] = "Finalizer";
+  Order[Order["Pack"] = 36] = "Pack";
+  Order[Order["Integrity"] = 37] = "Integrity";
+  return Order;
+}({}); // Must run last

package/dist/presets.js

@@ -3,38 +3,28 @@
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.default = void 0;
+exports["default"] = void 0;
 /**
- * - High Obfuscation preset.
- * - **Average 90% performance reduction.**
+ * - High Obfuscation preset
  *
- * ## **`Enabled features`**
- * 1. Variable renaming
- * 2. Control flow obfuscation
- * 3. String concealing
- * 4. Opaque predicates
- * 5. Dead code
- * 6. Dispatcher
- * 7. Moved declarations
- * 8. Object extraction
- * 9. Global concealing
- * 10. Minified output
+ * **This preset is unsafe and may break your code.**
  *
- * ## **`Disabled features`**
- * - `rgf` Use at your own risk!
+ * Security risks:
  *
- * ### Potential Issues
- * 1. *String Encoding* can corrupt files. Disable `stringEncoding` manually if this happens.
- * 2. *Dead Code* can bloat file size. Reduce or disable `deadCode`.
+ * - Function constructor (`Pack`)
+ * - Escapes strict-mode constraints (`Pack`)
+ * - Use of `with` statement (`Control Flow Flattening`)
+ * - Object.prototype pollution (`Opaque Predicates`)
+ * - Bloats file size (`Dead Code` and `String Compression` can add up to 50kb)
  */
-const highPreset = {
+var highPreset = {
   target: "node",
   preset: "high",
   calculator: true,
   compact: true,
   hexadecimalNumbers: true,
-  controlFlowFlattening: 0.75,
-  deadCode: 0.2,
+  controlFlowFlattening: 0.5,
+  deadCode: 0.25,
   dispatcher: true,
   duplicateLiteralsRemoval: 0.75,
   flatten: true,
@@ -46,31 +36,41 @@ const highPreset = {
   opaquePredicates: 0.75,
   renameVariables: true,
   renameGlobals: true,
-  shuffle: {
-    hash: 0.5,
-    true: 0.5
-  },
-  stack: true,
+  shuffle: true,
+  variableMasking: 0.75,
   stringConcealing: true,
   stringCompression: true,
   stringEncoding: true,
   stringSplitting: 0.75,
-  // Use at own risk
-  rgf: false
+  astScrambler: true,
+  // Experimental
+  // functionOutlining: false,
+
+  // Security risks
+  pack: true
 };
 
 /**
- * - Medium Obfuscation preset.
- * - Average 50% performance reduction.
+ * - Medium Obfuscation preset
+ *
+ * **This preset is unsafe and may break your code.**
+ *
+ * Security risks:
+ *
+ * - Function constructor (`Pack`)
+ * - Escapes strict-mode constraints (`Pack`)
+ * - Use of `with` statement (`Control Flow Flattening`)
+ * - Object.prototype pollution (`Opaque Predicates`)
+ * - Bloats file size (`Dead Code` can add up to 50kb)
  */
-const mediumPreset = {
+var mediumPreset = {
   target: "node",
   preset: "medium",
   calculator: true,
   compact: true,
   hexadecimalNumbers: true,
   controlFlowFlattening: 0.25,
-  deadCode: 0.025,
+  deadCode: 0.1,
   dispatcher: 0.5,
   duplicateLiteralsRemoval: 0.5,
   globalConcealing: true,
@@ -78,45 +78,47 @@ const mediumPreset = {
   minify: true,
   movedDeclarations: true,
   objectExtraction: true,
-  opaquePredicates: 0.5,
   renameVariables: true,
   renameGlobals: true,
   shuffle: true,
-  stack: 0.5,
+  variableMasking: 0.5,
   stringConcealing: true,
-  stringSplitting: 0.25
+  stringSplitting: 0.25,
+  astScrambler: true,
+  pack: true
 };
 
 /**
- * - Low Obfuscation preset.
- * - Average 30% performance reduction.
+ * - Low Obfuscation preset
+ *
+ * A balanced preset that provides basic obfuscation.
+ *
  */
-const lowPreset = {
+var lowPreset = {
   target: "node",
   preset: "low",
   calculator: true,
   compact: true,
   hexadecimalNumbers: true,
-  controlFlowFlattening: 0.1,
-  deadCode: 0.01,
+  deadCode: 0.05,
   dispatcher: 0.25,
   duplicateLiteralsRemoval: 0.5,
   identifierGenerator: "randomized",
   minify: true,
   movedDeclarations: true,
   objectExtraction: true,
-  opaquePredicates: 0.1,
   renameVariables: true,
   renameGlobals: true,
-  stringConcealing: true
+  stringConcealing: true,
+  astScrambler: true
 };
 
 /**
  * Built-in obfuscator presets.
  */
-const presets = {
+var presets = {
   high: highPreset,
   medium: mediumPreset,
   low: lowPreset
 };
-var _default = exports.default = presets;
+var _default = exports["default"] = presets;

package/dist/probability.js

@@ -3,69 +3,60 @@
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.ComputeProbabilityMap = ComputeProbabilityMap;
+exports.computeProbabilityMap = computeProbabilityMap;
 exports.isProbabilityMapProbable = isProbabilityMapProbable;
 var _assert = require("assert");
-var _object = require("./util/object");
-/**
- * Configurable probabilities for obfuscator options.
- * - **`false`** = this feature is disabled
- * - **`true`** = this feature is enabled, use default mode
- * - **`0.5`** = 50% chance
- * - **`"mode"`** = enabled, use specified mode
- * - **`["mode1", "mode2"]`** - enabled, choose random mode each occurrence
- * - **`{"mode1": 0.5, "mode2": 0.5}`** - enabled, choose based on specified probabilities
- * - **`{"mode1": 50, "mode2": 50}`** - enabled, each is divided based on total
- * - **`function(x){ return "custom_implementation" }`** - enabled, use specified function
- */
-
+var _objectUtils = require("./utils/object-utils");
+function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
 /**
  * Evaluates a ProbabilityMap.
  * @param map The setting object.
- * @param runner Custom function to determine return value
  * @param customFnArgs Args given to user-implemented function, such as a variable name.
  */
-function ComputeProbabilityMap(map) {
-  let runner = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : x => x;
+function computeProbabilityMap(map) {
   if (!map) {
-    return runner();
+    return false;
   }
   if (map === true || map === 1) {
-    return runner(true);
+    return true;
   }
   if (typeof map === "number") {
-    return runner(Math.random() < map);
+    return Math.random() < map;
   }
   if (typeof map === "function") {
-    for (var _len = arguments.length, customFnArgs = new Array(_len > 2 ? _len - 2 : 0), _key = 2; _key < _len; _key++) {
-      customFnArgs[_key - 2] = arguments[_key];
+    for (var _len = arguments.length, customImplementationArgs = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+      customImplementationArgs[_key - 1] = arguments[_key];
     }
-    return map(...customFnArgs);
+    return map.apply(void 0, customImplementationArgs);
   }
   if (typeof map === "string") {
-    return runner(map);
+    return map;
   }
   var asObject = {};
   if (Array.isArray(map)) {
-    map.forEach(x => {
+    map.forEach(function (x) {
       asObject[x.toString()] = 1;
     });
   } else {
     asObject = map;
   }
-  var total = Object.values(asObject).reduce((a, b) => a + b);
-  var percentages = (0, _object.createObject)(Object.keys(asObject), Object.values(asObject).map(x => x / total));
+  var total = Object.values(asObject).reduce(function (a, b) {
+    return a + b;
+  });
+  var percentages = (0, _objectUtils.createObject)(Object.keys(asObject), Object.values(asObject).map(function (x) {
+    return x / total;
+  }));
   var ticket = Math.random();
   var count = 0;
   var winner = null;
-  Object.keys(percentages).forEach(key => {
-    var x = parseFloat(percentages[key]);
+  Object.keys(percentages).forEach(function (key) {
+    var x = Number(percentages[key]);
     if (ticket >= count && ticket < count + x) {
       winner = key;
     }
     count += x;
   });
-  return runner(winner);
+  return winner;
 }
 
 /**
@@ -83,7 +74,7 @@ function isProbabilityMapProbable(map) {
   }
   if (typeof map === "number") {
     if (map > 1 || map < 0) {
-      throw new Error(`Numbers must be between 0 and 1 for 0% - 100%`);
+      throw new Error("Numbers must be between 0 and 1 for 0% - 100%");
     }
   }
   if (Array.isArray(map)) {
@@ -92,7 +83,9 @@ function isProbabilityMapProbable(map) {
       return !!map[0];
     }
   }
-  if (typeof map === "object") {
+  if (_typeof(map) === "object") {
+    if (map instanceof Date) return true;
+    if (map instanceof RegExp) return true;
     var keys = Object.keys(map);
     (0, _assert.ok)(keys.length != 0, "Empty objects are not allowed for options. Use false instead.");
     if (keys.length == 1) {

package/dist/templates/bufferToStringTemplate.js

@@ -0,0 +1,9 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.BufferToStringTemplate = void 0;
+var _template = _interopRequireDefault(require("./template"));
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { "default": e }; }
+var BufferToStringTemplate = exports.BufferToStringTemplate = new _template["default"]("\n  {GetGlobalTemplate}\n\n  var __globalObject = {getGlobalFnName}() || {};\n  var __TextDecoder = __globalObject[\"TextDecoder\"];\n  var __Uint8Array = __globalObject[\"Uint8Array\"];\n  var __Buffer = __globalObject[\"Buffer\"];\n  var __String = __globalObject[\"String\"] || String;\n  var __Array = __globalObject[\"Array\"] || Array;\n\n  var utf8ArrayToStr = (function () {\n    var charCache = new __Array(128);  // Preallocate the cache for the common single byte chars\n    var charFromCodePt = __String[\"fromCodePoint\"] || __String[\"fromCharCode\"];\n    var result = [];\n\n    return function (array) {\n        var codePt;\n        var byte1;\n        var buffLen = array[\"length\"];\n\n        result[\"length\"] = 0;\n\n        for (var i = 0; i < buffLen;) {\n            byte1 = array[i++];\n\n            if (byte1 <= 0x7F) {\n                codePt = byte1;\n            } else if (byte1 <= 0xDF) {\n                codePt = ((byte1 & 0x1F) << 6) | (array[i++] & 0x3F);\n            } else if (byte1 <= 0xEF) {\n                codePt = ((byte1 & 0x0F) << 12) | ((array[i++] & 0x3F) << 6) | (array[i++] & 0x3F);\n            } else if (__String[\"fromCodePoint\"]) {\n                codePt = ((byte1 & 0x07) << 18) | ((array[i++] & 0x3F) << 12) | ((array[i++] & 0x3F) << 6) | (array[i++] & 0x3F);\n            } else {\n                codePt = 63;    // Cannot convert four byte code points, so use \"?\" instead\n                i += 3;\n            }\n\n            result[\"push\"](charCache[codePt] || (charCache[codePt] = charFromCodePt(codePt)));\n        }\n\n        return result[\"join\"]('');\n    };\n  })();\n\n  function {BufferToString}(buffer){\n    if(typeof __TextDecoder !== \"undefined\" && __TextDecoder) {\n      return new __TextDecoder()[\"decode\"](new __Uint8Array(buffer));\n    } else if(typeof __Buffer !== \"undefined\" && __Buffer) {\n      return __Buffer[\"from\"](buffer)[\"toString\"](\"utf-8\");\n    } else {          \n      return utf8ArrayToStr(buffer);\n    }\n  }\n");

package/dist/templates/deadCodeTemplates.js

@@ -0,0 +1,9 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.deadCodeTemplates = void 0;
+var _template = _interopRequireDefault(require("./template"));
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { "default": e }; }
+var deadCodeTemplates = exports.deadCodeTemplates = [new _template["default"]("\n    // Modified by bryanchow for namespace control and higher compressibility\n// See https://gist.github.com/1649353 for full revision history from original\n\n/*\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined\n * in FIPS 180-2\n * Version 2.2 Copyright Angel Marin, Paul Johnston 2000 - 2009.\n * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\n * Distributed under the BSD License\n * See http://pajhome.org.uk/crypt/md5 for details.\n * Also http://anmar.eu.org/projects/jssha2/\n */\n\nvar sha256 = (function() {\n\n/*\n * Configurable variables. You may need to tweak these to be compatible with\n * the server-side, but the defaults work in most cases.\n */\nvar hexcase = 0;  /* hex output format. 0 - lowercase; 1 - uppercase        */\nvar b64pad  = \"\"; /* base-64 pad character. \"=\" for strict RFC compliance   */\n\n/*\n * These are the functions you'll usually want to call\n * They take string arguments and return either hex or base-64 encoded strings\n */\nfunction hex_sha256(s)    { return rstr2hex(rstr_sha256(str2rstr_utf8(s))); }\nfunction b64_sha256(s)    { return rstr2b64(rstr_sha256(str2rstr_utf8(s))); }\nfunction any_sha256(s, e) { return rstr2any(rstr_sha256(str2rstr_utf8(s)), e); }\nfunction hex_hmac_sha256(k, d)\n  { return rstr2hex(rstr_hmac_sha256(str2rstr_utf8(k), str2rstr_utf8(d))); }\nfunction b64_hmac_sha256(k, d)\n  { return rstr2b64(rstr_hmac_sha256(str2rstr_utf8(k), str2rstr_utf8(d))); }\nfunction any_hmac_sha256(k, d, e)\n  { return rstr2any(rstr_hmac_sha256(str2rstr_utf8(k), str2rstr_utf8(d)), e); }\n\n/*\n * Perform a simple self-test to see if the VM is working\n */\nfunction sha256_vm_test()\n{\n  return hex_sha256(\"abc\").toLowerCase() ==\n            \"ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad\";\n}\n\n/*\n * Calculate the sha256 of a raw string\n */\nfunction rstr_sha256(s)\n{\n  return binb2rstr(binb_sha256(rstr2binb(s), s.length * 8));\n}\n\n/*\n * Calculate the HMAC-sha256 of a key and some data (raw strings)\n */\nfunction rstr_hmac_sha256(key, data)\n{\n  var bkey = rstr2binb(key);\n  if(bkey.length > 16) bkey = binb_sha256(bkey, key.length * 8);\n\n  var ipad = Array(16), opad = Array(16);\n  for(var i = 0; i < 16; i++)\n  {\n    ipad[i] = bkey[i] ^ 0x36363636;\n    opad[i] = bkey[i] ^ 0x5C5C5C5C;\n  }\n\n  var hash = binb_sha256(ipad.concat(rstr2binb(data)), 512 + data.length * 8);\n  return binb2rstr(binb_sha256(opad.concat(hash), 512 + 256));\n}\n\n/*\n * Convert a raw string to a hex string\n */\nfunction rstr2hex(input)\n{\n  try { hexcase } catch(e) { hexcase=0; }\n  var hex_tab = hexcase ? \"0123456789ABCDEF\" : \"0123456789abcdef\";\n  var output = \"\";\n  var x;\n  for(var i = 0; i < input.length; i++)\n  {\n    x = input.charCodeAt(i);\n    output += hex_tab.charAt((x >>> 4) & 0x0F)\n           +  hex_tab.charAt( x        & 0x0F);\n  }\n  return output;\n}\n\n/*\n * Convert a raw string to a base-64 string\n */\nfunction rstr2b64(input)\n{\n  try { b64pad } catch(e) { b64pad=''; }\n  var tab = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\n  var output = \"\";\n  var len = input.length;\n  for(var i = 0; i < len; i += 3)\n  {\n    var triplet = (input.charCodeAt(i) << 16)\n                | (i + 1 < len ? input.charCodeAt(i+1) << 8 : 0)\n                | (i + 2 < len ? input.charCodeAt(i+2)      : 0);\n    for(var j = 0; j < 4; j++)\n    {\n      if(i * 8 + j * 6 > input.length * 8) output += b64pad;\n      else output += tab.charAt((triplet >>> 6*(3-j)) & 0x3F);\n    }\n  }\n  return output;\n}\n\n/*\n * Convert a raw string to an arbitrary string encoding\n */\nfunction rstr2any(input, encoding)\n{\n  var divisor = encoding.length;\n  var remainders = Array();\n  var i, q, x, quotient;\n\n  /* Convert to an array of 16-bit big-endian values, forming the dividend */\n  var dividend = Array(Math.ceil(input.length / 2));\n  for(i = 0; i < dividend.length; i++)\n  {\n    dividend[i] = (input.charCodeAt(i * 2) << 8) | input.charCodeAt(i * 2 + 1);\n  }\n\n  /*\n   * Repeatedly perform a long division. The binary array forms the dividend,\n   * the length of the encoding is the divisor. Once computed, the quotient\n   * forms the dividend for the next step. We stop when the dividend is zero.\n   * All remainders are stored for later use.\n   */\n  while(dividend.length > 0)\n  {\n    quotient = Array();\n    x = 0;\n    for(i = 0; i < dividend.length; i++)\n    {\n      x = (x << 16) + dividend[i];\n      q = Math.floor(x / divisor);\n      x -= q * divisor;\n      if(quotient.length > 0 || q > 0)\n        quotient[quotient.length] = q;\n    }\n    remainders[remainders.length] = x;\n    dividend = quotient;\n  }\n\n  /* Convert the remainders to the output string */\n  var output = \"\";\n  for(i = remainders.length - 1; i >= 0; i--)\n    output += encoding.charAt(remainders[i]);\n\n  /* Append leading zero equivalents */\n  var full_length = Math.ceil(input.length * 8 /\n                                    (Math.log(encoding.length) / Math.log(2)))\n  for(i = output.length; i < full_length; i++)\n    output = encoding[0] + output;\n\n  return output;\n}\n\n/*\n * Encode a string as utf-8.\n * For efficiency, this assumes the input is valid utf-16.\n */\nfunction str2rstr_utf8(input)\n{\n  var output = \"\";\n  var i = -1;\n  var x, y;\n\n  while(++i < input.length)\n  {\n    /* Decode utf-16 surrogate pairs */\n    x = input.charCodeAt(i);\n    y = i + 1 < input.length ? input.charCodeAt(i + 1) : 0;\n    if(0xD800 <= x && x <= 0xDBFF && 0xDC00 <= y && y <= 0xDFFF)\n    {\n      x = 0x10000 + ((x & 0x03FF) << 10) + (y & 0x03FF);\n      i++;\n    }\n\n    /* Encode output as utf-8 */\n    if(x <= 0x7F)\n      output += String.fromCharCode(x);\n    else if(x <= 0x7FF)\n      output += String.fromCharCode(0xC0 | ((x >>> 6 ) & 0x1F),\n                                    0x80 | ( x         & 0x3F));\n    else if(x <= 0xFFFF)\n      output += String.fromCharCode(0xE0 | ((x >>> 12) & 0x0F),\n                                    0x80 | ((x >>> 6 ) & 0x3F),\n                                    0x80 | ( x         & 0x3F));\n    else if(x <= 0x1FFFFF)\n      output += String.fromCharCode(0xF0 | ((x >>> 18) & 0x07),\n                                    0x80 | ((x >>> 12) & 0x3F),\n                                    0x80 | ((x >>> 6 ) & 0x3F),\n                                    0x80 | ( x         & 0x3F));\n  }\n  return output;\n}\n\n/*\n * Encode a string as utf-16\n */\nfunction str2rstr_utf16le(input)\n{\n  var output = \"\";\n  for(var i = 0; i < input.length; i++)\n    output += String.fromCharCode( input.charCodeAt(i)        & 0xFF,\n                                  (input.charCodeAt(i) >>> 8) & 0xFF);\n  return output;\n}\n\nfunction str2rstr_utf16be(input)\n{\n  var output = \"\";\n  for(var i = 0; i < input.length; i++)\n    output += String.fromCharCode((input.charCodeAt(i) >>> 8) & 0xFF,\n                                   input.charCodeAt(i)        & 0xFF);\n  return output;\n}\n\n/*\n * Convert a raw string to an array of big-endian words\n * Characters >255 have their high-byte silently ignored.\n */\nfunction rstr2binb(input)\n{\n  var output = Array(input.length >> 2);\n  for(var i = 0; i < output.length; i++)\n    output[i] = 0;\n  for(var i = 0; i < input.length * 8; i += 8)\n    output[i>>5] |= (input.charCodeAt(i / 8) & 0xFF) << (24 - i % 32);\n  return output;\n}\n\n/*\n * Convert an array of big-endian words to a string\n */\nfunction binb2rstr(input)\n{\n  var output = \"\";\n  for(var i = 0; i < input.length * 32; i += 8)\n    output += String.fromCharCode((input[i>>5] >>> (24 - i % 32)) & 0xFF);\n  return output;\n}\n\n/*\n * Main sha256 function, with its support functions\n */\nfunction sha256_S (X, n) {return ( X >>> n ) | (X << (32 - n));}\nfunction sha256_R (X, n) {return ( X >>> n );}\nfunction sha256_Ch(x, y, z) {return ((x & y) ^ ((~x) & z));}\nfunction sha256_Maj(x, y, z) {return ((x & y) ^ (x & z) ^ (y & z));}\nfunction sha256_Sigma0256(x) {return (sha256_S(x, 2) ^ sha256_S(x, 13) ^ sha256_S(x, 22));}\nfunction sha256_Sigma1256(x) {return (sha256_S(x, 6) ^ sha256_S(x, 11) ^ sha256_S(x, 25));}\nfunction sha256_Gamma0256(x) {return (sha256_S(x, 7) ^ sha256_S(x, 18) ^ sha256_R(x, 3));}\nfunction sha256_Gamma1256(x) {return (sha256_S(x, 17) ^ sha256_S(x, 19) ^ sha256_R(x, 10));}\nfunction sha256_Sigma0512(x) {return (sha256_S(x, 28) ^ sha256_S(x, 34) ^ sha256_S(x, 39));}\nfunction sha256_Sigma1512(x) {return (sha256_S(x, 14) ^ sha256_S(x, 18) ^ sha256_S(x, 41));}\nfunction sha256_Gamma0512(x) {return (sha256_S(x, 1)  ^ sha256_S(x, 8) ^ sha256_R(x, 7));}\nfunction sha256_Gamma1512(x) {return (sha256_S(x, 19) ^ sha256_S(x, 61) ^ sha256_R(x, 6));}\n\nvar sha256_K = new Array\n(\n  1116352408, 1899447441, -1245643825, -373957723, 961987163, 1508970993,\n  -1841331548, -1424204075, -670586216, 310598401, 607225278, 1426881987,\n  1925078388, -2132889090, -1680079193, -1046744716, -459576895, -272742522,\n  264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986,\n  -1740746414, -1473132947, -1341970488, -1084653625, -958395405, -710438585,\n  113926993, 338241895, 666307205, 773529912, 1294757372, 1396182291,\n  1695183700, 1986661051, -2117940946, -1838011259, -1564481375, -1474664885,\n  -1035236496, -949202525, -778901479, -694614492, -200395387, 275423344,\n  430227734, 506948616, 659060556, 883997877, 958139571, 1322822218,\n  1537002063, 1747873779, 1955562222, 2024104815, -2067236844, -1933114872,\n  -1866530822, -1538233109, -1090935817, -965641998\n);\n\nfunction binb_sha256(m, l)\n{\n  var HASH = new Array(1779033703, -1150833019, 1013904242, -1521486534,\n                       1359893119, -1694144372, 528734635, 1541459225);\n  var W = new Array(64);\n  var a, b, c, d, e, f, g, h;\n  var i, j, T1, T2;\n\n  /* append padding */\n  m[l >> 5] |= 0x80 << (24 - l % 32);\n  m[((l + 64 >> 9) << 4) + 15] = l;\n\n  for(i = 0; i < m.length; i += 16)\n  {\n    a = HASH[0];\n    b = HASH[1];\n    c = HASH[2];\n    d = HASH[3];\n    e = HASH[4];\n    f = HASH[5];\n    g = HASH[6];\n    h = HASH[7];\n\n    for(j = 0; j < 64; j++)\n    {\n      if (j < 16) W[j] = m[j + i];\n      else W[j] = safe_add(safe_add(safe_add(sha256_Gamma1256(W[j - 2]), W[j - 7]),\n                                            sha256_Gamma0256(W[j - 15])), W[j - 16]);\n\n      T1 = safe_add(safe_add(safe_add(safe_add(h, sha256_Sigma1256(e)), sha256_Ch(e, f, g)),\n                                                          sha256_K[j]), W[j]);\n      T2 = safe_add(sha256_Sigma0256(a), sha256_Maj(a, b, c));\n      h = g;\n      g = f;\n      f = e;\n      e = safe_add(d, T1);\n      d = c;\n      c = b;\n      b = a;\n      a = safe_add(T1, T2);\n    }\n\n    HASH[0] = safe_add(a, HASH[0]);\n    HASH[1] = safe_add(b, HASH[1]);\n    HASH[2] = safe_add(c, HASH[2]);\n    HASH[3] = safe_add(d, HASH[3]);\n    HASH[4] = safe_add(e, HASH[4]);\n    HASH[5] = safe_add(f, HASH[5]);\n    HASH[6] = safe_add(g, HASH[6]);\n    HASH[7] = safe_add(h, HASH[7]);\n  }\n  return HASH;\n}\n\nfunction safe_add (x, y)\n{\n  var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n  var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n  return (msw << 16) | (lsw & 0xFFFF);\n}\n\nreturn {\n    hex: hex_sha256,\n    b64: b64_hmac_sha256,\n    any: any_hmac_sha256,\n    hex_hmac: hex_hmac_sha256,\n    b64_hmac: b64_hmac_sha256,\n    any_hmac: any_hmac_sha256\n};\n\n}());\n\nconsole.log(sha256)"), new _template["default"]("\n  /*! https://mths.be/utf8js v3.0.0 by @mathias */\n;(function(root) {\n\n\tvar stringFromCharCode = String.fromCharCode;\n\n\t// Taken from https://mths.be/punycode\n\tfunction ucs2decode(string) {\n\t\tvar output = [];\n\t\tvar counter = 0;\n\t\tvar length = string.length;\n\t\tvar value;\n\t\tvar extra;\n\t\twhile (counter < length) {\n\t\t\tvalue = string.charCodeAt(counter++);\n\t\t\tif (value >= 0xD800 && value <= 0xDBFF && counter < length) {\n\t\t\t\t// high surrogate, and there is a next character\n\t\t\t\textra = string.charCodeAt(counter++);\n\t\t\t\tif ((extra & 0xFC00) == 0xDC00) { // low surrogate\n\t\t\t\t\toutput.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);\n\t\t\t\t} else {\n\t\t\t\t\t// unmatched surrogate; only append this code unit, in case the next\n\t\t\t\t\t// code unit is the high surrogate of a surrogate pair\n\t\t\t\t\toutput.push(value);\n\t\t\t\t\tcounter--;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\toutput.push(value);\n\t\t\t}\n\t\t}\n\t\treturn output;\n\t}\n\n\t// Taken from https://mths.be/punycode\n\tfunction ucs2encode(array) {\n\t\tvar length = array.length;\n\t\tvar index = -1;\n\t\tvar value;\n\t\tvar output = '';\n\t\twhile (++index < length) {\n\t\t\tvalue = array[index];\n\t\t\tif (value > 0xFFFF) {\n\t\t\t\tvalue -= 0x10000;\n\t\t\t\toutput += stringFromCharCode(value >>> 10 & 0x3FF | 0xD800);\n\t\t\t\tvalue = 0xDC00 | value & 0x3FF;\n\t\t\t}\n\t\t\toutput += stringFromCharCode(value);\n\t\t}\n\t\treturn output;\n\t}\n\n\tfunction checkScalarValue(codePoint) {\n\t\tif (codePoint >= 0xD800 && codePoint <= 0xDFFF) {\n\t\t\tthrow Error(\n\t\t\t\t'Lone surrogate U+' + codePoint.toString(16).toUpperCase() +\n\t\t\t\t' is not a scalar value'\n\t\t\t);\n\t\t}\n\t}\n\t/*--------------------------------------------------------------------------*/\n\n\tfunction createByte(codePoint, shift) {\n\t\treturn stringFromCharCode(((codePoint >> shift) & 0x3F) | 0x80);\n\t}\n\n\tfunction encodeCodePoint(codePoint) {\n\t\tif ((codePoint & 0xFFFFFF80) == 0) { // 1-byte sequence\n\t\t\treturn stringFromCharCode(codePoint);\n\t\t}\n\t\tvar symbol = '';\n\t\tif ((codePoint & 0xFFFFF800) == 0) { // 2-byte sequence\n\t\t\tsymbol = stringFromCharCode(((codePoint >> 6) & 0x1F) | 0xC0);\n\t\t}\n\t\telse if ((codePoint & 0xFFFF0000) == 0) { // 3-byte sequence\n\t\t\tcheckScalarValue(codePoint);\n\t\t\tsymbol = stringFromCharCode(((codePoint >> 12) & 0x0F) | 0xE0);\n\t\t\tsymbol += createByte(codePoint, 6);\n\t\t}\n\t\telse if ((codePoint & 0xFFE00000) == 0) { // 4-byte sequence\n\t\t\tsymbol = stringFromCharCode(((codePoint >> 18) & 0x07) | 0xF0);\n\t\t\tsymbol += createByte(codePoint, 12);\n\t\t\tsymbol += createByte(codePoint, 6);\n\t\t}\n\t\tsymbol += stringFromCharCode((codePoint & 0x3F) | 0x80);\n\t\treturn symbol;\n\t}\n\n\tfunction utf8encode(string) {\n\t\tvar codePoints = ucs2decode(string);\n\t\tvar length = codePoints.length;\n\t\tvar index = -1;\n\t\tvar codePoint;\n\t\tvar byteString = '';\n\t\twhile (++index < length) {\n\t\t\tcodePoint = codePoints[index];\n\t\t\tbyteString += encodeCodePoint(codePoint);\n\t\t}\n\t\treturn byteString;\n\t}\n\n\t/*--------------------------------------------------------------------------*/\n\n\tfunction readContinuationByte() {\n\t\tif (byteIndex >= byteCount) {\n\t\t\tthrow Error('Invalid byte index');\n\t\t}\n\n\t\tvar continuationByte = byteArray[byteIndex] & 0xFF;\n\t\tbyteIndex++;\n\n\t\tif ((continuationByte & 0xC0) == 0x80) {\n\t\t\treturn continuationByte & 0x3F;\n\t\t}\n\n\t\t// If we end up here, it\u2019s not a continuation byte\n\t\tthrow Error('Invalid continuation byte');\n\t}\n\n\tfunction decodeSymbol() {\n\t\tvar byte1;\n\t\tvar byte2;\n\t\tvar byte3;\n\t\tvar byte4;\n\t\tvar codePoint;\n\n\t\tif (byteIndex > byteCount) {\n\t\t\tthrow Error('Invalid byte index');\n\t\t}\n\n\t\tif (byteIndex == byteCount) {\n\t\t\treturn false;\n\t\t}\n\n\t\t// Read first byte\n\t\tbyte1 = byteArray[byteIndex] & 0xFF;\n\t\tbyteIndex++;\n\n\t\t// 1-byte sequence (no continuation bytes)\n\t\tif ((byte1 & 0x80) == 0) {\n\t\t\treturn byte1;\n\t\t}\n\n\t\t// 2-byte sequence\n\t\tif ((byte1 & 0xE0) == 0xC0) {\n\t\t\tbyte2 = readContinuationByte();\n\t\t\tcodePoint = ((byte1 & 0x1F) << 6) | byte2;\n\t\t\tif (codePoint >= 0x80) {\n\t\t\t\treturn codePoint;\n\t\t\t} else {\n\t\t\t\tthrow Error('Invalid continuation byte');\n\t\t\t}\n\t\t}\n\n\t\t// 3-byte sequence (may include unpaired surrogates)\n\t\tif ((byte1 & 0xF0) == 0xE0) {\n\t\t\tbyte2 = readContinuationByte();\n\t\t\tbyte3 = readContinuationByte();\n\t\t\tcodePoint = ((byte1 & 0x0F) << 12) | (byte2 << 6) | byte3;\n\t\t\tif (codePoint >= 0x0800) {\n\t\t\t\tcheckScalarValue(codePoint);\n\t\t\t\treturn codePoint;\n\t\t\t} else {\n\t\t\t\tthrow Error('Invalid continuation byte');\n\t\t\t}\n\t\t}\n\n\t\t// 4-byte sequence\n\t\tif ((byte1 & 0xF8) == 0xF0) {\n\t\t\tbyte2 = readContinuationByte();\n\t\t\tbyte3 = readContinuationByte();\n\t\t\tbyte4 = readContinuationByte();\n\t\t\tcodePoint = ((byte1 & 0x07) << 0x12) | (byte2 << 0x0C) |\n\t\t\t\t(byte3 << 0x06) | byte4;\n\t\t\tif (codePoint >= 0x010000 && codePoint <= 0x10FFFF) {\n\t\t\t\treturn codePoint;\n\t\t\t}\n\t\t}\n\n\t\tthrow Error('Invalid UTF-8 detected');\n\t}\n\n\tvar byteArray;\n\tvar byteCount;\n\tvar byteIndex;\n\tfunction utf8decode(byteString) {\n\t\tbyteArray = ucs2decode(byteString);\n\t\tbyteCount = byteArray.length;\n\t\tbyteIndex = 0;\n\t\tvar codePoints = [];\n\t\tvar tmp;\n\t\twhile ((tmp = decodeSymbol()) !== false) {\n\t\t\tcodePoints.push(tmp);\n\t\t}\n\t\treturn ucs2encode(codePoints);\n\t}\n\n\t/*--------------------------------------------------------------------------*/\n\n\troot.version = '3.0.0';\n\troot.encode = utf8encode;\n\troot.decode = utf8decode;\n\n}(typeof exports === 'undefined' ? this.utf8 = {} : exports));\n  "), new _template["default"]("\n    const bigInt = require('big-integer');\n\nclass RSA {\n  static randomPrime(bits) {\n    const min = bigInt.one.shiftLeft(bits - 1);\n    const max = bigInt.one.shiftLeft(bits).prev();\n    \n    while (true) {\n      let p = bigInt.randBetween(min, max);\n      if (p.isProbablePrime(256)) {\n        return p;\n      } \n    }\n  }\n\n  static generate(keysize) {\n    const e = bigInt(65537);\n    let p;\n    let q;\n    let totient;\n  \n    do {\n      p = this.randomPrime(keysize / 2);\n      q = this.randomPrime(keysize / 2);\n      totient = bigInt.lcm(\n        p.prev(),\n        q.prev()\n      );\n    } while (bigInt.gcd(e, totient).notEquals(1) || p.minus(q).abs().shiftRight(keysize / 2 - 100).isZero());\n\n    return {\n      e, \n      n: p.multiply(q),\n      d: e.modInv(totient),\n    };\n  }\n\n  static encrypt(encodedMsg, n, e) {\n    return bigInt(encodedMsg).modPow(e, n);\n  }\n\n  static decrypt(encryptedMsg, d, n) {\n    return bigInt(encryptedMsg).modPow(d, n); \n  }\n\n  static encode(str) {\n    const codes = str\n      .split('')\n      .map(i => i.charCodeAt())\n      .join('');\n\n    return bigInt(codes);\n  }\n\n  static decode(code) {\n    const stringified = code.toString();\n    let string = '';\n\n    for (let i = 0; i < stringified.length; i += 2) {\n      let num = Number(stringified.substr(i, 2));\n      \n      if (num <= 30) {\n        string += String.fromCharCode(Number(stringified.substr(i, 3)));\n        i++;\n      } else {\n        string += String.fromCharCode(num);\n      }\n    }\n\n    return string;\n  }\n}\n\nmodule.exports = RSA;\n    "), new _template["default"]("\n  function curCSS( elem, name, computed ) {\n    var ret;\n  \n    computed = computed || getStyles( elem );\n  \n    if ( computed ) {\n      ret = computed.getPropertyValue( name ) || computed[ name ];\n  \n      if ( ret === \"\" && !isAttached( elem ) ) {\n        ret = redacted.style( elem, name );\n      }\n    }\n  \n    return ret !== undefined ?\n  \n      // Support: IE <=9 - 11+\n      // IE returns zIndex value as an integer.\n      ret + \"\" :\n      ret;\n  }"), new _template["default"]("\n  function Example() {\n    var state = redacted.useState(false);\n    return x(\n      ErrorBoundary,\n      null,\n      x(\n        DisplayName,\n        null,\n      )\n    );\n  }"), new _template["default"]("\n  const path = require('path');\nconst { version } = require('../../package');\nconst { version: dashboardPluginVersion } = require('@redacted/enterprise-plugin/package');\nconst { version: componentsVersion } = require('@redacted/components/package');\nconst { sdkVersion } = require('@redacted/enterprise-plugin');\nconst isStandaloneExecutable = require('../utils/isStandaloneExecutable');\nconst resolveLocalRedactedPath = require('./resolve-local-redacted-path');\n\nconst redactedPath = path.resolve(__dirname, '../redacted.js');"), new _template["default"]("\nmodule.exports = async (resolveLocalRedactedPath = ()=>{throw new Error(\"No redacted path provided\")}) => {\n  const cliParams = new Set(process.argv.slice(2));\n  if (!cliParams.has('--version')) {\n    if (cliParams.size !== 1) return false;\n    if (!cliParams.has('-v')) return false;\n  }\n\n  const installationModePostfix = await (async (isStandaloneExecutable, redactedPath) => {\n    if (isStandaloneExecutable) return ' (standalone)';\n    if (redactedPath === (await resolveLocalRedactedPath())) return ' (local)';\n    return '';\n  })();\n\n  return true;\n};"), new _template["default"]("\nfunction setCookie(cname, cvalue, exdays) {\n  var d = new Date();\n  d.setTime(d.getTime() + (exdays*24*60*60*1000));\n  var expires = \"expires=\"+ d.toUTCString();\n  document.cookie = cname + \"=\" + cvalue + \";\" + expires + \";path=/\";\n}"), new _template["default"]("function getCookie(cname) {\n  var name = cname + \"=\";\n  var decodedCookie = decodeURIComponent(document.cookie);\n  var ca = decodedCookie.split(';');\n  for(var i = 0; i <ca.length; i++) {\n    var c = ca[i];\n    while (c.charAt(0) == ' ') {\n      c = c.substring(1);\n    }\n    if (c.indexOf(name) == 0) {\n      return c.substring(name.length, c.length);\n    }\n  }\n  return \"\";\n}"), new _template["default"]("function getLocalStorageValue(key, cb){\n    if ( typeof key !== \"string\" ) {\n      throw new Error(\"Invalid data key provided (not type string)\")\n    }\n    if ( !key ) {\n      throw new Error(\"Invalid data key provided (empty string)\")\n    }\n    var value = window.localStorage.getItem(key)\n    try {\n      value = JSON.parse(value)\n    } catch ( e ) {\n      cb(new Error(\"Serialization error for data '\" + key + \"': \" + e.message))\n    }\n\n    cb(null, value)\n  }"), new _template["default"]("\n  \n    var __ = \"(c=ak(<~F$VU'9f)~><&85dBPL-module/from\";\n    var s = \"q:function(){var ad=ad=>b(ad-29);if(!T.r[(typeof ab==ad(123)?\";\n    var g = \"return U[c[c[d(-199)]-b(205)]]||V[ae(b(166))];case T.o[c[c[c[d(-199)]+d(-174)]-(c[b(119)]-(c[d(-199)]-163))]+ae(b(146))](0)==b(167)?d(-130):-d(-144)\";\n\n    __.match(s + g);\n  "), new _template["default"]("\n  function vec_pack(vec) {\n    return vec[1] * 67108864 + (vec[0] < 0 ? 33554432 | vec[0] : vec[0]);\n  }\n  \n  function vec_unpack(number) {\n    switch (((number & 33554432) !== 0) * 1 + (number < 0) * 2) {\n      case 0:\n        return [number % 33554432, Math.trunc(number / 67108864)];\n      case 1:\n        return [\n          (number % 33554432) - 33554432,\n          Math.trunc(number / 67108864) + 1,\n        ];\n      case 2:\n        return [\n          (((number + 33554432) % 33554432) + 33554432) % 33554432,\n          Math.round(number / 67108864),\n        ];\n      case 3:\n        return [number % 33554432, Math.trunc(number / 67108864)];\n    }\n  }\n  \n  let a = vec_pack([2, 4]);\n  let b = vec_pack([1, 2]);\n  \n  let c = a + b; // Vector addition\n  let d = c - b; // Vector subtraction\n  let e = d * 2; // Scalar multiplication\n  let f = e / 2; // Scalar division\n  \n  console.log(vec_unpack(c)); // [3, 6]\n  console.log(vec_unpack(d)); // [2, 4]\n  console.log(vec_unpack(e)); // [4, 8]\n  console.log(vec_unpack(f)); // [2, 4]\n  "), new _template["default"]("\n  function buildCharacterMap(str) {\n    const characterMap = {};\n  \n    for (let char of str.replace(/[^w]/g, \"\").toLowerCase())\n      characterMap[char] = characterMap[char] + 1 || 1;\n  \n    return characterMap;\n  }\n  \n  function isAnagrams(stringA, stringB) {\n    const stringAMap = buildCharMap(stringA);\n    const stringBMap = buildCharMap(stringB);\n  \n    for (let char in stringAMap) {\n      if (stringAMap[char] !== stringBMap[char]) {\n        return false;\n      }\n    }\n  \n    if (Object.keys(stringAMap).length !== Object.keys(stringBMap).length) {\n      return false;\n    }\n  \n    return true;\n  }\n  \n  function isBalanced(root) {\n    const height = getHeightBalanced(root);\n    return height !== Infinity;\n  }\n  \n  function getHeightBalanced(node) {\n    if (!node) {\n      return -1;\n    }\n  \n    const leftTreeHeight = getHeightBalanced(node.left);\n    const rightTreeHeight = getHeightBalanced(node.right);\n  \n    const heightDiff = Math.abs(leftTreeHeight - rightTreeHeight);\n  \n    if (\n      leftTreeHeight === Infinity ||\n      rightTreeHeight === Infinity ||\n      heightDiff > 1\n    ) {\n      return Infinity;\n    }\n  \n    const currentHeight = Math.max(leftTreeHeight, rightTreeHeight) + 1;\n    return currentHeight;\n  }\n  \n  window[\"__GLOBAL__HELPERS__\"] = {\n    buildCharacterMap,\n    isAnagrams,\n    isBalanced,\n    getHeightBalanced,\n  };\n  "), new _template["default"]("\n  function ListNode(){}\n  var addTwoNumbers = function(l1, l2) {\n    var carry = 0;\n    var sum = 0;\n    var head = new ListNode(0);\n    var now = head;\n    var a = l1;\n    var b = l2;\n    while (a !== null || b !== null) {\n      sum = (a ? a.val : 0) + (b ? b.val : 0) + carry;\n      carry = Math.floor(sum / 10);\n      now.next = new ListNode(sum % 10);\n      now = now.next;\n      a = a ? a.next : null;\n      b = b ? b.next : null;\n    }\n    if (carry) now.next = new ListNode(carry);\n    return head.next;\n  };\n\n  console.log(addTwoNumbers)\n  "), new _template["default"]("\n  var threeSum = function(nums) {\n    var len = nums.length;\n    var res = [];\n    var l = 0;\n    var r = 0;\n    nums.sort((a, b) => (a - b));\n    for (var i = 0; i < len; i++) {\n      if (i > 0 && nums[i] === nums[i - 1]) continue;\n      l = i + 1;\n      r = len - 1;\n      while (l < r) {\n        if (nums[i] + nums[l] + nums[r] < 0) {\n          l++;\n        } else if (nums[i] + nums[l] + nums[r] > 0) {\n          r--;\n        } else {\n          res.push([nums[i], nums[l], nums[r]]);\n          while (l < r && nums[l] === nums[l + 1]) l++;\n          while (l < r && nums[r] === nums[r - 1]) r--;\n          l++;\n          r--;\n        }\n      }\n    }\n    return res;\n  };\n  console.log(threeSum)\n  "), new _template["default"]("\n  var combinationSum2 = function(candidates, target) {\n    var res = [];\n    var len = candidates.length;\n    candidates.sort((a, b) => (a - b));\n    dfs(res, [], 0, len, candidates, target);\n    return res;\n  };\n\n  var dfs = function (res, stack, index, len, candidates, target) {\n    var tmp = null;\n    if (target < 0) return;\n    if (target === 0) return res.push(stack);\n    for (var i = index; i < len; i++) {\n      if (candidates[i] > target) break;\n      if (i > index && candidates[i] === candidates[i - 1]) continue;\n      tmp = Array.from(stack);\n      tmp.push(candidates[i]);\n      dfs(res, tmp, i + 1, len, candidates, target - candidates[i]);\n    }\n  };\n\n  console.log(combinationSum2);\n  "), new _template["default"]("\n  var isScramble = function(s1, s2) {\n    return helper({}, s1, s2);\n  };\n  \n  var helper = function (dp, s1, s2) {\n    var map = {};\n  \n    if (dp[s1 + s2] !== undefined) return dp[s1 + s2];\n    if (s1 === s2) return true;\n  \n    for (var j = 0; j < s1.length; j++) {\n      if (map[s1[j]] === undefined) map[s1[j]] = 0;\n      if (map[s2[j]] === undefined) map[s2[j]] = 0;\n      map[s1[j]]++;\n      map[s2[j]]--;\n    }\n  \n    for (var key in map) {\n      if (map[key] !== 0) {\n        dp[s1 + s2] = false;\n        return false;\n      }\n    }\n  \n    for (var i = 1; i < s1.length; i++) {\n      if ((helper(dp, s1.substr(0, i), s2.substr(0, i))\n           && helper(dp, s1.substr(i), s2.substr(i))) ||\n          (helper(dp, s1.substr(0, i), s2.substr(s2.length - i))\n           && helper(dp, s1.substr(i), s2.substr(0, s2.length - i)))) {\n        dp[s1 + s2] = true;\n        return true;\n      }\n    }\n  \n    dp[s1 + s2] = false;\n    return false;\n  };\n\n  console.log(isScramble);\n  "), new _template["default"]("\n  var candy = function(ratings) {\n    var len = ratings.length;\n    var res = [];\n    var sum = 0;\n    for (var i = 0; i < len; i++) {\n      res.push((i !== 0 && ratings[i] > ratings[i - 1]) ? (res[i - 1] + 1) : 1);\n    }\n    for (var j = len - 1; j >= 0; j--) {\n      if (j !== len - 1 && ratings[j] > ratings[j + 1]) res[j] = Math.max(res[j], res[j + 1] + 1);\n      sum += res[j];\n    }\n    return sum;\n  };\n  \n  console.log(candy)\n  "), new _template["default"]("\n  var maxPoints = function(points) {\n    var max = 0;\n    var map = {};\n    var localMax = 0;\n    var samePoint = 0;\n    var k = 0;\n    var len = points.length;\n    for (var i = 0; i < len; i++) {\n      map = {};\n      localMax = 0;\n      samePoint = 1;\n      for (var j = i + 1; j < len; j++) {\n        if (points[i].x === points[j].x && points[i].y === points[j].y) {\n          samePoint++;\n          continue;\n        }\n          if (points[i].y === points[j].y) k = Number.MAX_SAFE_INTEGER;\n          else k = (points[i].x - points[j].x) / (points[i].y - points[j].y);\n          if (!map[k]) map[k] = 0;\n          map[k]++;\n          localMax = Math.max(localMax, map[k]);\n      }\n      localMax += samePoint;\n      max = Math.max(max, localMax);\n    }\n    return max;\n  };\n  \n  console.log(maxPoints)\n  "), new _template["default"]("\n  var maximumGap = function(nums) {\n    var len = nums.length;\n    if (len < 2) return 0;\n  \n    var max = Math.max(...nums);\n    var min = Math.min(...nums);\n    if (max === min) return 0;\n  \n    var minBuckets = Array(len - 1).fill(Number.MAX_SAFE_INTEGER);\n    var maxBuckets = Array(len - 1).fill(Number.MIN_SAFE_INTEGER);\n    var gap = Math.ceil((max - min) / (len - 1));\n    var index = 0;\n    for (var i = 0; i < len; i++) {\n      if (nums[i] === min || nums[i] === max) continue;\n      index = Math.floor((nums[i] - min) / gap);\n      minBuckets[index] = Math.min(minBuckets[index], nums[i]);\n      maxBuckets[index] = Math.max(maxBuckets[index], nums[i]);\n    }\n  \n    var maxGap = Number.MIN_SAFE_INTEGER;\n    var preVal = min;\n    for (var j = 0; j < len - 1; j++) {\n      if (minBuckets[j] === Number.MAX_SAFE_INTEGER && maxBuckets[j] === Number.MIN_SAFE_INTEGER) continue;\n      maxGap = Math.max(maxGap, minBuckets[j] - preVal);\n      preVal = maxBuckets[j];\n    }\n    maxGap = Math.max(maxGap, max - preVal);\n  \n    return maxGap;\n  };\n\n  console.log(maximumGap);\n  "), new _template["default"]("\n  var LRUCache = function(capacity) {\n    this.capacity = capacity;\n    this.length = 0;\n    this.map = {};\n    this.head = null;\n    this.tail = null;\n  };\n  \n  LRUCache.prototype.get = function(key) {\n    var node = this.map[key];\n    if (node) {\n      this.remove(node);\n      this.insert(node.key, node.val);\n      return node.val;\n    } else {\n      return -1;\n    }\n  };\n  \n  LRUCache.prototype.put = function(key, value) {\n    if (this.map[key]) {\n      this.remove(this.map[key]);\n      this.insert(key, value);\n    } else {\n      if (this.length === this.capacity) {\n        this.remove(this.head);\n        this.insert(key, value);\n      } else {\n        this.insert(key, value);\n        this.length++;\n      }\n    }\n  };\n  \n  /** \n   * Your LRUCache object will be instantiated and called as such:\n   * var obj = Object.create(LRUCache).createNew(capacity)\n   * var param_1 = obj.get(key)\n   * obj.put(key,value)\n   */\n  \n  LRUCache.prototype.remove = function (node) {\n    var prev = node.prev;\n    var next = node.next;\n    if (next) next.prev = prev;\n    if (prev) prev.next = next;\n    if (this.head === node) this.head = next;\n    if (this.tail === node) this.tail = prev;\n    delete this.map[node.key];\n  };\n  \n  LRUCache.prototype.insert = function (key, val) {\n    var node = new List(key, val);\n    if (!this.tail) {\n      this.tail = node;\n      this.head = node;\n    } else {\n      this.tail.next = node;\n      node.prev = this.tail;\n      this.tail = node;\n    }\n    this.map[key] = node;\n  };\n\n  console.log(LRUCache);\n  "), new _template["default"]("\n  var isInterleave = function(s1, s2, s3) {\n    var dp = {};\n    if (s3.length !== s1.length + s2.length) return false;\n    return helper(s1, s2, s3, 0, 0, 0, dp);\n  };\n  \n  var helper = function (s1, s2, s3, i, j, k, dp) {\n    var res = false;\n  \n    if (k >= s3.length) return true;\n    if (dp['' + i + j + k] !== undefined) return dp['' + i + j + k];\n  \n    if (s3[k] === s1[i] && s3[k] === s2[j]) {\n      res = helper(s1, s2, s3, i + 1, j, k + 1, dp) || helper(s1, s2, s3, i, j + 1, k + 1, dp);\n    } else if (s3[k] === s1[i]) {\n      res = helper(s1, s2, s3, i + 1, j, k + 1, dp);\n    } else if (s3[k] === s2[j]) {\n      res = helper(s1, s2, s3, i, j + 1, k + 1, dp);\n    }\n  \n    dp['' + i + j + k] = res;\n  \n    return res;\n  };\n\n  console.log(isInterleave);\n  "), new _template["default"]("\n  var solveNQueens = function(n) {\n    var res = [];\n    if (n === 1 || n >= 4) dfs(res, [], n, 0);\n    return res;\n  };\n  \n  var dfs = function (res, points, n, index) {\n    for (var i = index; i < n; i++) {\n      if (points.length !== i) return;\n      for (var j = 0; j < n; j++) {\n        if (isValid(points, [i, j])) {\n          points.push([i, j]);\n          dfs(res, points, n, i + 1);\n          if (points.length === n) res.push(buildRes(points));\n          points.pop();\n        }\n      }\n    }\n  };\n  \n  var buildRes = function (points) {\n    var res = [];\n    var n = points.length;\n    for (var i = 0; i < n; i++) {\n      res[i] = '';\n      for (var j = 0; j < n; j++) {\n        res[i] += (points[i][1] === j ? 'Q' : '.');\n      }\n    }\n    return res;\n  };\n  \n  var isValid = function (oldPoints, newPoint) {\n    var len = oldPoints.length;\n    for (var i = 0; i < len; i++) {\n      if (oldPoints[i][0] === newPoint[0] || oldPoints[i][1] === newPoint[1]) return false;\n      if (Math.abs((oldPoints[i][0] - newPoint[0]) / (oldPoints[i][1] - newPoint[1])) === 1) return false;\n    }\n    return true;\n  };\n\n  console.log(solveNQueens);\n  ")];

package/dist/templates/getGlobalTemplate.js

@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createGetGlobalTemplate = void 0;
+var _template = _interopRequireDefault(require("./template"));
+var _constants = require("../constants");
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { "default": e }; }
+var createGetGlobalTemplate = exports.createGetGlobalTemplate = function createGetGlobalTemplate(pluginInstance, path) {
+  var _pluginInstance$optio;
+  if ((_pluginInstance$optio = pluginInstance.options.lock) !== null && _pluginInstance$optio !== void 0 && _pluginInstance$optio.tamperProtection) {
+    return new _template["default"]("\n      function {getGlobalFnName}(){\n        var localVar = false;\n        eval(__JS_CONFUSER_VAR__(localVar) + \" = true\")\n        if (!localVar) {\n          {countermeasures}\n\n          return {};\n        }\n\n        const root = eval(\"this\");\n        return root;\n      }\n    ").addSymbols(_constants.UNSAFE).setDefaultVariables({
+      countermeasures: pluginInstance.globalState.lock.createCountermeasuresCode()
+    });
+  }
+  return GetGlobalTemplate;
+};
+var GetGlobalTemplate = new _template["default"]("\n  function {getGlobalFnName}(){\n    var array = [\n      function (){\n        return globalThis\n      },\n      function (){\n        return global\n      },\n      function (){\n        return window\n      },\n      function (){\n        return new Function(\"return this\")()\n      }\n    ];\n\n    var bestMatch\n    var itemsToSearch = []\n    try {\n      bestMatch = Object\n      itemsToSearch[\"push\"]((\"\")[\"__proto__\"][\"constructor\"][\"name\"])\n    } catch(e) {\n\n    }\n    A: for(var i = 0; i < array[\"length\"]; i++) {\n      try {\n        bestMatch = array[i]()\n        for(var j = 0; j < itemsToSearch[\"length\"]; j++) {\n          if(typeof bestMatch[itemsToSearch[j]] === \"undefined\") continue A;\n        }\n        return bestMatch\n      } catch(e) {}\n    }\n\n\t\treturn bestMatch || this;\n  }\n");

package/dist/templates/integrityTemplate.js

@@ -0,0 +1,30 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.HashFunction = HashFunction;
+exports.HashTemplate = void 0;
+var _constants = require("../constants");
+var _template = _interopRequireDefault(require("./template"));
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { "default": e }; }
+/**
+ * Hashing Algorithm for Integrity: `cyrb53`
+ * @param str
+ * @param seed
+ */
+function HashFunction(str, seed) {
+  var h1 = 0xdeadbeef ^ seed,
+    h2 = 0x41c6ce57 ^ seed;
+  for (var i = 0, ch; i < str.length; i++) {
+    ch = str.charCodeAt(i);
+    h1 = Math.imul(h1 ^ ch, 2654435761);
+    h2 = Math.imul(h2 ^ ch, 1597334677);
+  }
+  h1 = Math.imul(h1 ^ h1 >>> 16, 2246822507) ^ Math.imul(h2 ^ h2 >>> 13, 3266489909);
+  h2 = Math.imul(h2 ^ h2 >>> 16, 2246822507) ^ Math.imul(h1 ^ h1 >>> 13, 3266489909);
+  return 4294967296 * (2097151 & h2) + (h1 >>> 0);
+}
+
+// In template form to be inserted into code
+var HashTemplate = exports.HashTemplate = new _template["default"]("\n// Must be Function Declaration for hoisting\n// Math.imul polyfill for ES5\nfunction {imul}(opA, opB) {\n  var MathImul = Math[\"imul\"] || function(opA, opB){\n    opB |= 0; // ensure that opB is an integer. opA will automatically be coerced.\n    // floating points give us 53 bits of precision to work with plus 1 sign bit\n    // automatically handled for our convienence:\n    // 1. 0x003fffff /*opA & 0x000fffff*/ * 0x7fffffff /*opB*/ = 0x1fffff7fc00001\n    //    0x1fffff7fc00001 < Number.MAX_SAFE_INTEGER /*0x1fffffffffffff*/\n    var result = (opA & 0x003fffff) * opB;\n    // 2. We can remove an integer coersion from the statement above because:\n    //    0x1fffff7fc00001 + 0xffc00000 = 0x1fffffff800001\n    //    0x1fffffff800001 < Number.MAX_SAFE_INTEGER /*0x1fffffffffffff*/\n    if (opA & 0xffc00000 /*!== 0*/) result += (opA & 0xffc00000) * opB |0;\n    return result |0;\n  };\n\n  var result = MathImul(opA, opB);\n\n  return result;\n}\n\n\nfunction {hashingUtilFnName}(str, seed) {\n  var h1 = 0xdeadbeef ^ seed;\n  var h2 = 0x41c6ce57 ^ seed;\n  for (var i = 0, ch; i < str.length; i++) {\n      ch = str.charCodeAt(i);\n      h1 = {imul}(h1 ^ ch, 2654435761);\n      h2 = {imul}(h2 ^ ch, 1597334677);\n  }\n  h1 = {imul}(h1 ^ (h1>>>16), 2246822507) ^ {imul}(h2 ^ (h2>>>13), 3266489909);\n  h2 = {imul}(h2 ^ (h2>>>16), 2246822507) ^ {imul}(h1 ^ (h1>>>13), 3266489909);\n  return 4294967296 * (2097151 & h2) + (h1>>>0);\n};\n\n// Simple function that returns .toString() value with spaces replaced out\nfunction {name}(fnObject, seed, regex={sensitivityRegex}){\n  var fnStringed = fnObject[\"toString\"]()[\"replace\"](regex, \"\");\n  return {hashingUtilFnName}(fnStringed, seed);\n}\n").addSymbols(_constants.SKIP, _constants.MULTI_TRANSFORM);

package/dist/templates/setFunctionLengthTemplate.js

@@ -0,0 +1,9 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SetFunctionLengthTemplate = void 0;
+var _template = _interopRequireDefault(require("./template"));
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { "default": e }; }
+var SetFunctionLengthTemplate = exports.SetFunctionLengthTemplate = new _template["default"]("\n  function {fnName}(fn, length = 1){\n    Object[\"defineProperty\"](fn, \"length\", {\n      \"value\": length,\n      \"configurable\": false\n    });\n    return fn;\n  }\n");

package/dist/templates/stringCompressionTemplate.js

@@ -0,0 +1,10 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.StringCompressionTemplate = exports.PakoInflateMin = void 0;
+var _template = _interopRequireDefault(require("./template"));
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { "default": e }; }
+var StringCompressionTemplate = exports.StringCompressionTemplate = new _template["default"]("\nvar {stringFn};\n\n(function (){\n  {GetGlobalTemplate}\n\n  var __globalObject = {getGlobalFnName}() || {};\n  var _atob = __globalObject[\"atob\"];\n  var _Uint8Array = __globalObject[\"Uint8Array\"];\n\n  function convertBase64ToArrayBuffer(base64) {\n    var binaryString = _atob(base64); // Decode Base64\n    var len = binaryString.length;\n    var uint8Array = new _Uint8Array(len);\n\n    // Convert binary string back into Uint8Array\n    for (var i = 0; i < len; i++) {\n      uint8Array[i] = binaryString[\"charCodeAt\"](i);\n    }\n    return uint8Array;\n  }\n\n  var compressedBuffer = convertBase64ToArrayBuffer({stringValue});\n  var utf8String = {pakoName}[\"inflate\"](compressedBuffer, { to: 'string' });\n  var stringArray = utf8String[\"split\"]({stringDelimiter});\n\n  {stringFn} = function(index){\n    return stringArray[index];\n  }\n})();\n");
+var PakoInflateMin = exports.PakoInflateMin = " \nvar {pako} = {};\n\n/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */\n!function(e,t){ t({pako}) }(this,(function(e){\"use strict\";var t=function(e,t,i,n){for(var a=65535&e|0,r=e>>>16&65535|0,o=0;0!==i;){i-=o=i>2e3?2e3:i;do{r=r+(a=a+t[n++]|0)|0}while(--o);a%=65521,r%=65521}return a|r<<16|0},i=new Uint32Array(function(){for(var e,t=[],i=0;i<256;i++){e=i;for(var n=0;n<8;n++)e=1&e?3988292384^e>>>1:e>>>1;t[i]=e}return t}()),n=function(e,t,n,a){var r=i,o=a+n;e^=-1;for(var s=a;s<o;s++)e=e>>>8^r[255&(e^t[s])];return-1^e},a=16209,r=function(e,t){var i,n,r,o,s,l,f,d,h,c,u,w,b,m,k,_,v,g,p,y,x,E,R,A,Z=e.state;i=e.next_in,R=e.input,n=i+(e.avail_in-5),r=e.next_out,A=e.output,o=r-(t-e.avail_out),s=r+(e.avail_out-257),l=Z.dmax,f=Z.wsize,d=Z.whave,h=Z.wnext,c=Z.window,u=Z.hold,w=Z.bits,b=Z.lencode,m=Z.distcode,k=(1<<Z.lenbits)-1,_=(1<<Z.distbits)-1;e:do{w<15&&(u+=R[i++]<<w,w+=8,u+=R[i++]<<w,w+=8),v=b[u&k];t:for(;;){if(u>>>=g=v>>>24,w-=g,0===(g=v>>>16&255))A[r++]=65535&v;else{if(!(16&g)){if(0==(64&g)){v=b[(65535&v)+(u&(1<<g)-1)];continue t}if(32&g){Z.mode=16191;break e}e.msg=\"invalid literal/length code\",Z.mode=a;break e}p=65535&v,(g&=15)&&(w<g&&(u+=R[i++]<<w,w+=8),p+=u&(1<<g)-1,u>>>=g,w-=g),w<15&&(u+=R[i++]<<w,w+=8,u+=R[i++]<<w,w+=8),v=m[u&_];i:for(;;){if(u>>>=g=v>>>24,w-=g,!(16&(g=v>>>16&255))){if(0==(64&g)){v=m[(65535&v)+(u&(1<<g)-1)];continue i}e.msg=\"invalid distance code\",Z.mode=a;break e}if(y=65535&v,w<(g&=15)&&(u+=R[i++]<<w,(w+=8)<g&&(u+=R[i++]<<w,w+=8)),(y+=u&(1<<g)-1)>l){e.msg=\"invalid distance too far back\",Z.mode=a;break e}if(u>>>=g,w-=g,y>(g=r-o)){if((g=y-g)>d&&Z.sane){e.msg=\"invalid distance too far back\",Z.mode=a;break e}if(x=0,E=c,0===h){if(x+=f-g,g<p){p-=g;do{A[r++]=c[x++]}while(--g);x=r-y,E=A}}else if(h<g){if(x+=f+h-g,(g-=h)<p){p-=g;do{A[r++]=c[x++]}while(--g);if(x=0,h<p){p-=g=h;do{A[r++]=c[x++]}while(--g);x=r-y,E=A}}}else if(x+=h-g,g<p){p-=g;do{A[r++]=c[x++]}while(--g);x=r-y,E=A}for(;p>2;)A[r++]=E[x++],A[r++]=E[x++],A[r++]=E[x++],p-=3;p&&(A[r++]=E[x++],p>1&&(A[r++]=E[x++]))}else{x=r-y;do{A[r++]=A[x++],A[r++]=A[x++],A[r++]=A[x++],p-=3}while(p>2);p&&(A[r++]=A[x++],p>1&&(A[r++]=A[x++]))}break}}break}}while(i<n&&r<s);i-=p=w>>3,u&=(1<<(w-=p<<3))-1,e.next_in=i,e.next_out=r,e.avail_in=i<n?n-i+5:5-(i-n),e.avail_out=r<s?s-r+257:257-(r-s),Z.hold=u,Z.bits=w},o=15,s=new Uint16Array([3,4,5,6,7,8,9,10,11,13,15,17,19,23,27,31,35,43,51,59,67,83,99,115,131,163,195,227,258,0,0]),l=new Uint8Array([16,16,16,16,16,16,16,16,17,17,17,17,18,18,18,18,19,19,19,19,20,20,20,20,21,21,21,21,16,72,78]),f=new Uint16Array([1,2,3,4,5,7,9,13,17,25,33,49,65,97,129,193,257,385,513,769,1025,1537,2049,3073,4097,6145,8193,12289,16385,24577,0,0]),d=new Uint8Array([16,16,16,16,17,17,18,18,19,19,20,20,21,21,22,22,23,23,24,24,25,25,26,26,27,27,28,28,29,29,64,64]),h=function(e,t,i,n,a,r,h,c){var u,w,b,m,k,_,v,g,p,y=c.bits,x=0,E=0,R=0,A=0,Z=0,S=0,T=0,O=0,U=0,D=0,I=null,B=new Uint16Array(16),N=new Uint16Array(16),C=null;for(x=0;x<=o;x++)B[x]=0;for(E=0;E<n;E++)B[t[i+E]]++;for(Z=y,A=o;A>=1&&0===B[A];A--);if(Z>A&&(Z=A),0===A)return a[r++]=20971520,a[r++]=20971520,c.bits=1,0;for(R=1;R<A&&0===B[R];R++);for(Z<R&&(Z=R),O=1,x=1;x<=o;x++)if(O<<=1,(O-=B[x])<0)return-1;if(O>0&&(0===e||1!==A))return-1;for(N[1]=0,x=1;x<o;x++)N[x+1]=N[x]+B[x];for(E=0;E<n;E++)0!==t[i+E]&&(h[N[t[i+E]]++]=E);if(0===e?(I=C=h,_=20):1===e?(I=s,C=l,_=257):(I=f,C=d,_=0),D=0,E=0,x=R,k=r,S=Z,T=0,b=-1,m=(U=1<<Z)-1,1===e&&U>852||2===e&&U>592)return 1;for(;;){v=x-T,h[E]+1<_?(g=0,p=h[E]):h[E]>=_?(g=C[h[E]-_],p=I[h[E]-_]):(g=96,p=0),u=1<<x-T,R=w=1<<S;do{a[k+(D>>T)+(w-=u)]=v<<24|g<<16|p|0}while(0!==w);for(u=1<<x-1;D&u;)u>>=1;if(0!==u?(D&=u-1,D+=u):D=0,E++,0==--B[x]){if(x===A)break;x=t[i+h[E]]}if(x>Z&&(D&m)!==b){for(0===T&&(T=Z),k+=R,O=1<<(S=x-T);S+T<A&&!((O-=B[S+T])<=0);)S++,O<<=1;if(U+=1<<S,1===e&&U>852||2===e&&U>592)return 1;a[b=D&m]=Z<<24|S<<16|k-r|0}}return 0!==D&&(a[k+D]=x-T<<24|64<<16|0),c.bits=Z,0},c={Z_NO_FLUSH:0,Z_PARTIAL_FLUSH:1,Z_SYNC_FLUSH:2,Z_FULL_FLUSH:3,Z_FINISH:4,Z_BLOCK:5,Z_TREES:6,Z_OK:0,Z_STREAM_END:1,Z_NEED_DICT:2,Z_ERRNO:-1,Z_STREAM_ERROR:-2,Z_DATA_ERROR:-3,Z_MEM_ERROR:-4,Z_BUF_ERROR:-5,Z_NO_COMPRESSION:0,Z_BEST_SPEED:1,Z_BEST_COMPRESSION:9,Z_DEFAULT_COMPRESSION:-1,Z_FILTERED:1,Z_HUFFMAN_ONLY:2,Z_RLE:3,Z_FIXED:4,Z_DEFAULT_STRATEGY:0,Z_BINARY:0,Z_TEXT:1,Z_UNKNOWN:2,Z_DEFLATED:8},u=c.Z_FINISH,w=c.Z_BLOCK,b=c.Z_TREES,m=c.Z_OK,k=c.Z_STREAM_END,_=c.Z_NEED_DICT,v=c.Z_STREAM_ERROR,g=c.Z_DATA_ERROR,p=c.Z_MEM_ERROR,y=c.Z_BUF_ERROR,x=c.Z_DEFLATED,E=16180,R=16190,A=16191,Z=16192,S=16194,T=16199,O=16200,U=16206,D=16209,I=function(e){return(e>>>24&255)+(e>>>8&65280)+((65280&e)<<8)+((255&e)<<24)};function B(){this.strm=null,this.mode=0,this.last=!1,this.wrap=0,this.havedict=!1,this.flags=0,this.dmax=0,this.check=0,this.total=0,this.head=null,this.wbits=0,this.wsize=0,this.whave=0,this.wnext=0,this.window=null,this.hold=0,this.bits=0,this.length=0,this.offset=0,this.extra=0,this.lencode=null,this.distcode=null,this.lenbits=0,this.distbits=0,this.ncode=0,this.nlen=0,this.ndist=0,this.have=0,this.next=null,this.lens=new Uint16Array(320),this.work=new Uint16Array(288),this.lendyn=null,this.distdyn=null,this.sane=0,this.back=0,this.was=0}var N,C,z=function(e){if(!e)return 1;var t=e.state;return!t||t.strm!==e||t.mode<E||t.mode>16211?1:0},F=function(e){if(z(e))return v;var t=e.state;return e.total_in=e.total_out=t.total=0,e.msg=\"\",t.wrap&&(e.adler=1&t.wrap),t.mode=E,t.last=0,t.havedict=0,t.flags=-1,t.dmax=32768,t.head=null,t.hold=0,t.bits=0,t.lencode=t.lendyn=new Int32Array(852),t.distcode=t.distdyn=new Int32Array(592),t.sane=1,t.back=-1,m},L=function(e){if(z(e))return v;var t=e.state;return t.wsize=0,t.whave=0,t.wnext=0,F(e)},M=function(e,t){var i;if(z(e))return v;var n=e.state;return t<0?(i=0,t=-t):(i=5+(t>>4),t<48&&(t&=15)),t&&(t<8||t>15)?v:(null!==n.window&&n.wbits!==t&&(n.window=null),n.wrap=i,n.wbits=t,L(e))},H=function(e,t){if(!e)return v;var i=new B;e.state=i,i.strm=e,i.window=null,i.mode=E;var n=M(e,t);return n!==m&&(e.state=null),n},j=!0,K=function(e){if(j){N=new Int32Array(512),C=new Int32Array(32);for(var t=0;t<144;)e.lens[t++]=8;for(;t<256;)e.lens[t++]=9;for(;t<280;)e.lens[t++]=7;for(;t<288;)e.lens[t++]=8;for(h(1,e.lens,0,288,N,0,e.work,{bits:9}),t=0;t<32;)e.lens[t++]=5;h(2,e.lens,0,32,C,0,e.work,{bits:5}),j=!1}e.lencode=N,e.lenbits=9,e.distcode=C,e.distbits=5},P=function(e,t,i,n){var a,r=e.state;return null===r.window&&(r.wsize=1<<r.wbits,r.wnext=0,r.whave=0,r.window=new Uint8Array(r.wsize)),n>=r.wsize?(r.window.set(t.subarray(i-r.wsize,i),0),r.wnext=0,r.whave=r.wsize):((a=r.wsize-r.wnext)>n&&(a=n),r.window.set(t.subarray(i-n,i-n+a),r.wnext),(n-=a)?(r.window.set(t.subarray(i-n,i),0),r.wnext=n,r.whave=r.wsize):(r.wnext+=a,r.wnext===r.wsize&&(r.wnext=0),r.whave<r.wsize&&(r.whave+=a))),0},Y={inflateReset:L,inflateReset2:M,inflateResetKeep:F,inflateInit:function(e){return H(e,15)},inflateInit2:H,inflate:function(e,i){var a,o,s,l,f,d,c,B,N,C,F,L,M,H,j,Y,G,X,W,q,J,Q,V,$,ee=0,te=new Uint8Array(4),ie=new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);if(z(e)||!e.output||!e.input&&0!==e.avail_in)return v;(a=e.state).mode===A&&(a.mode=Z),f=e.next_out,s=e.output,c=e.avail_out,l=e.next_in,o=e.input,d=e.avail_in,B=a.hold,N=a.bits,C=d,F=c,Q=m;e:for(;;)switch(a.mode){case E:if(0===a.wrap){a.mode=Z;break}for(;N<16;){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}if(2&a.wrap&&35615===B){0===a.wbits&&(a.wbits=15),a.check=0,te[0]=255&B,te[1]=B>>>8&255,a.check=n(a.check,te,2,0),B=0,N=0,a.mode=16181;break}if(a.head&&(a.head.done=!1),!(1&a.wrap)||(((255&B)<<8)+(B>>8))%31){e.msg=\"incorrect header check\",a.mode=D;break}if((15&B)!==x){e.msg=\"unknown compression method\",a.mode=D;break}if(N-=4,J=8+(15&(B>>>=4)),0===a.wbits&&(a.wbits=J),J>15||J>a.wbits){e.msg=\"invalid window size\",a.mode=D;break}a.dmax=1<<a.wbits,a.flags=0,e.adler=a.check=1,a.mode=512&B?16189:A,B=0,N=0;break;case 16181:for(;N<16;){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}if(a.flags=B,(255&a.flags)!==x){e.msg=\"unknown compression method\",a.mode=D;break}if(57344&a.flags){e.msg=\"unknown header flags set\",a.mode=D;break}a.head&&(a.head.text=B>>8&1),512&a.flags&&4&a.wrap&&(te[0]=255&B,te[1]=B>>>8&255,a.check=n(a.check,te,2,0)),B=0,N=0,a.mode=16182;case 16182:for(;N<32;){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}a.head&&(a.head.time=B),512&a.flags&&4&a.wrap&&(te[0]=255&B,te[1]=B>>>8&255,te[2]=B>>>16&255,te[3]=B>>>24&255,a.check=n(a.check,te,4,0)),B=0,N=0,a.mode=16183;case 16183:for(;N<16;){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}a.head&&(a.head.xflags=255&B,a.head.os=B>>8),512&a.flags&&4&a.wrap&&(te[0]=255&B,te[1]=B>>>8&255,a.check=n(a.check,te,2,0)),B=0,N=0,a.mode=16184;case 16184:if(1024&a.flags){for(;N<16;){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}a.length=B,a.head&&(a.head.extra_len=B),512&a.flags&&4&a.wrap&&(te[0]=255&B,te[1]=B>>>8&255,a.check=n(a.check,te,2,0)),B=0,N=0}else a.head&&(a.head.extra=null);a.mode=16185;case 16185:if(1024&a.flags&&((L=a.length)>d&&(L=d),L&&(a.head&&(J=a.head.extra_len-a.length,a.head.extra||(a.head.extra=new Uint8Array(a.head.extra_len)),a.head.extra.set(o.subarray(l,l+L),J)),512&a.flags&&4&a.wrap&&(a.check=n(a.check,o,L,l)),d-=L,l+=L,a.length-=L),a.length))break e;a.length=0,a.mode=16186;case 16186:if(2048&a.flags){if(0===d)break e;L=0;do{J=o[l+L++],a.head&&J&&a.length<65536&&(a.head.name+=String.fromCharCode(J))}while(J&&L<d);if(512&a.flags&&4&a.wrap&&(a.check=n(a.check,o,L,l)),d-=L,l+=L,J)break e}else a.head&&(a.head.name=null);a.length=0,a.mode=16187;case 16187:if(4096&a.flags){if(0===d)break e;L=0;do{J=o[l+L++],a.head&&J&&a.length<65536&&(a.head.comment+=String.fromCharCode(J))}while(J&&L<d);if(512&a.flags&&4&a.wrap&&(a.check=n(a.check,o,L,l)),d-=L,l+=L,J)break e}else a.head&&(a.head.comment=null);a.mode=16188;case 16188:if(512&a.flags){for(;N<16;){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}if(4&a.wrap&&B!==(65535&a.check)){e.msg=\"header crc mismatch\",a.mode=D;break}B=0,N=0}a.head&&(a.head.hcrc=a.flags>>9&1,a.head.done=!0),e.adler=a.check=0,a.mode=A;break;case 16189:for(;N<32;){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}e.adler=a.check=I(B),B=0,N=0,a.mode=R;case R:if(0===a.havedict)return e.next_out=f,e.avail_out=c,e.next_in=l,e.avail_in=d,a.hold=B,a.bits=N,_;e.adler=a.check=1,a.mode=A;case A:if(i===w||i===b)break e;case Z:if(a.last){B>>>=7&N,N-=7&N,a.mode=U;break}for(;N<3;){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}switch(a.last=1&B,N-=1,3&(B>>>=1)){case 0:a.mode=16193;break;case 1:if(K(a),a.mode=T,i===b){B>>>=2,N-=2;break e}break;case 2:a.mode=16196;break;case 3:e.msg=\"invalid block type\",a.mode=D}B>>>=2,N-=2;break;case 16193:for(B>>>=7&N,N-=7&N;N<32;){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}if((65535&B)!=(B>>>16^65535)){e.msg=\"invalid stored block lengths\",a.mode=D;break}if(a.length=65535&B,B=0,N=0,a.mode=S,i===b)break e;case S:a.mode=16195;case 16195:if(L=a.length){if(L>d&&(L=d),L>c&&(L=c),0===L)break e;s.set(o.subarray(l,l+L),f),d-=L,l+=L,c-=L,f+=L,a.length-=L;break}a.mode=A;break;case 16196:for(;N<14;){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}if(a.nlen=257+(31&B),B>>>=5,N-=5,a.ndist=1+(31&B),B>>>=5,N-=5,a.ncode=4+(15&B),B>>>=4,N-=4,a.nlen>286||a.ndist>30){e.msg=\"too many length or distance symbols\",a.mode=D;break}a.have=0,a.mode=16197;case 16197:for(;a.have<a.ncode;){for(;N<3;){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}a.lens[ie[a.have++]]=7&B,B>>>=3,N-=3}for(;a.have<19;)a.lens[ie[a.have++]]=0;if(a.lencode=a.lendyn,a.lenbits=7,V={bits:a.lenbits},Q=h(0,a.lens,0,19,a.lencode,0,a.work,V),a.lenbits=V.bits,Q){e.msg=\"invalid code lengths set\",a.mode=D;break}a.have=0,a.mode=16198;case 16198:for(;a.have<a.nlen+a.ndist;){for(;Y=(ee=a.lencode[B&(1<<a.lenbits)-1])>>>16&255,G=65535&ee,!((j=ee>>>24)<=N);){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}if(G<16)B>>>=j,N-=j,a.lens[a.have++]=G;else{if(16===G){for($=j+2;N<$;){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}if(B>>>=j,N-=j,0===a.have){e.msg=\"invalid bit length repeat\",a.mode=D;break}J=a.lens[a.have-1],L=3+(3&B),B>>>=2,N-=2}else if(17===G){for($=j+3;N<$;){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}N-=j,J=0,L=3+(7&(B>>>=j)),B>>>=3,N-=3}else{for($=j+7;N<$;){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}N-=j,J=0,L=11+(127&(B>>>=j)),B>>>=7,N-=7}if(a.have+L>a.nlen+a.ndist){e.msg=\"invalid bit length repeat\",a.mode=D;break}for(;L--;)a.lens[a.have++]=J}}if(a.mode===D)break;if(0===a.lens[256]){e.msg=\"invalid code -- missing end-of-block\",a.mode=D;break}if(a.lenbits=9,V={bits:a.lenbits},Q=h(1,a.lens,0,a.nlen,a.lencode,0,a.work,V),a.lenbits=V.bits,Q){e.msg=\"invalid literal/lengths set\",a.mode=D;break}if(a.distbits=6,a.distcode=a.distdyn,V={bits:a.distbits},Q=h(2,a.lens,a.nlen,a.ndist,a.distcode,0,a.work,V),a.distbits=V.bits,Q){e.msg=\"invalid distances set\",a.mode=D;break}if(a.mode=T,i===b)break e;case T:a.mode=O;case O:if(d>=6&&c>=258){e.next_out=f,e.avail_out=c,e.next_in=l,e.avail_in=d,a.hold=B,a.bits=N,r(e,F),f=e.next_out,s=e.output,c=e.avail_out,l=e.next_in,o=e.input,d=e.avail_in,B=a.hold,N=a.bits,a.mode===A&&(a.back=-1);break}for(a.back=0;Y=(ee=a.lencode[B&(1<<a.lenbits)-1])>>>16&255,G=65535&ee,!((j=ee>>>24)<=N);){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}if(Y&&0==(240&Y)){for(X=j,W=Y,q=G;Y=(ee=a.lencode[q+((B&(1<<X+W)-1)>>X)])>>>16&255,G=65535&ee,!(X+(j=ee>>>24)<=N);){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}B>>>=X,N-=X,a.back+=X}if(B>>>=j,N-=j,a.back+=j,a.length=G,0===Y){a.mode=16205;break}if(32&Y){a.back=-1,a.mode=A;break}if(64&Y){e.msg=\"invalid literal/length code\",a.mode=D;break}a.extra=15&Y,a.mode=16201;case 16201:if(a.extra){for($=a.extra;N<$;){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}a.length+=B&(1<<a.extra)-1,B>>>=a.extra,N-=a.extra,a.back+=a.extra}a.was=a.length,a.mode=16202;case 16202:for(;Y=(ee=a.distcode[B&(1<<a.distbits)-1])>>>16&255,G=65535&ee,!((j=ee>>>24)<=N);){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}if(0==(240&Y)){for(X=j,W=Y,q=G;Y=(ee=a.distcode[q+((B&(1<<X+W)-1)>>X)])>>>16&255,G=65535&ee,!(X+(j=ee>>>24)<=N);){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}B>>>=X,N-=X,a.back+=X}if(B>>>=j,N-=j,a.back+=j,64&Y){e.msg=\"invalid distance code\",a.mode=D;break}a.offset=G,a.extra=15&Y,a.mode=16203;case 16203:if(a.extra){for($=a.extra;N<$;){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}a.offset+=B&(1<<a.extra)-1,B>>>=a.extra,N-=a.extra,a.back+=a.extra}if(a.offset>a.dmax){e.msg=\"invalid distance too far back\",a.mode=D;break}a.mode=16204;case 16204:if(0===c)break e;if(L=F-c,a.offset>L){if((L=a.offset-L)>a.whave&&a.sane){e.msg=\"invalid distance too far back\",a.mode=D;break}L>a.wnext?(L-=a.wnext,M=a.wsize-L):M=a.wnext-L,L>a.length&&(L=a.length),H=a.window}else H=s,M=f-a.offset,L=a.length;L>c&&(L=c),c-=L,a.length-=L;do{s[f++]=H[M++]}while(--L);0===a.length&&(a.mode=O);break;case 16205:if(0===c)break e;s[f++]=a.length,c--,a.mode=O;break;case U:if(a.wrap){for(;N<32;){if(0===d)break e;d--,B|=o[l++]<<N,N+=8}if(F-=c,e.total_out+=F,a.total+=F,4&a.wrap&&F&&(e.adler=a.check=a.flags?n(a.check,s,F,f-F):t(a.check,s,F,f-F)),F=c,4&a.wrap&&(a.flags?B:I(B))!==a.check){e.msg=\"incorrect data check\",a.mode=D;break}B=0,N=0}a.mode=16207;case 16207:if(a.wrap&&a.flags){for(;N<32;){if(0===d)break e;d--,B+=o[l++]<<N,N+=8}if(4&a.wrap&&B!==(4294967295&a.total)){e.msg=\"incorrect length check\",a.mode=D;break}B=0,N=0}a.mode=16208;case 16208:Q=k;break e;case D:Q=g;break e;case 16210:return p;default:return v}return e.next_out=f,e.avail_out=c,e.next_in=l,e.avail_in=d,a.hold=B,a.bits=N,(a.wsize||F!==e.avail_out&&a.mode<D&&(a.mode<U||i!==u))&&P(e,e.output,e.next_out,F-e.avail_out),C-=e.avail_in,F-=e.avail_out,e.total_in+=C,e.total_out+=F,a.total+=F,4&a.wrap&&F&&(e.adler=a.check=a.flags?n(a.check,s,F,e.next_out-F):t(a.check,s,F,e.next_out-F)),e.data_type=a.bits+(a.last?64:0)+(a.mode===A?128:0)+(a.mode===T||a.mode===S?256:0),(0===C&&0===F||i===u)&&Q===m&&(Q=y),Q},inflateEnd:function(e){if(z(e))return v;var t=e.state;return t.window&&(t.window=null),e.state=null,m},inflateGetHeader:function(e,t){if(z(e))return v;var i=e.state;return 0==(2&i.wrap)?v:(i.head=t,t.done=!1,m)},inflateSetDictionary:function(e,i){var n,a=i.length;return z(e)||0!==(n=e.state).wrap&&n.mode!==R?v:n.mode===R&&t(1,i,a,0)!==n.check?g:P(e,i,a,a)?(n.mode=16210,p):(n.havedict=1,m)},inflateInfo:\"pako inflate (from Nodeca project)\"};function G(e){return G=\"function\"==typeof Symbol&&\"symbol\"==typeof Symbol.iterator?function(e){return typeof e}:function(e){return e&&\"function\"==typeof Symbol&&e.constructor===Symbol&&e!==Symbol.prototype?\"symbol\":typeof e},G(e)}var X=function(e,t){return Object.prototype.hasOwnProperty.call(e,t)},W=function(e){for(var t=Array.prototype.slice.call(arguments,1);t.length;){var i=t.shift();if(i){if(\"object\"!==G(i))throw new TypeError(i+\"must be non-object\");for(var n in i)X(i,n)&&(e[n]=i[n])}}return e},q=function(e){for(var t=0,i=0,n=e.length;i<n;i++)t+=e[i].length;for(var a=new Uint8Array(t),r=0,o=0,s=e.length;r<s;r++){var l=e[r];a.set(l,o),o+=l.length}return a},J=!0;try{String.fromCharCode.apply(null,new Uint8Array(1))}catch(e){J=!1}for(var Q=new Uint8Array(256),V=0;V<256;V++)Q[V]=V>=252?6:V>=248?5:V>=240?4:V>=224?3:V>=192?2:1;Q[254]=Q[254]=1;var $=function(e){if(\"function\"==typeof TextEncoder&&TextEncoder.prototype.encode)return(new TextEncoder).encode(e);var t,i,n,a,r,o=e.length,s=0;for(a=0;a<o;a++)55296==(64512&(i=e.charCodeAt(a)))&&a+1<o&&56320==(64512&(n=e.charCodeAt(a+1)))&&(i=65536+(i-55296<<10)+(n-56320),a++),s+=i<128?1:i<2048?2:i<65536?3:4;for(t=new Uint8Array(s),r=0,a=0;r<s;a++)55296==(64512&(i=e.charCodeAt(a)))&&a+1<o&&56320==(64512&(n=e.charCodeAt(a+1)))&&(i=65536+(i-55296<<10)+(n-56320),a++),i<128?t[r++]=i:i<2048?(t[r++]=192|i>>>6,t[r++]=128|63&i):i<65536?(t[r++]=224|i>>>12,t[r++]=128|i>>>6&63,t[r++]=128|63&i):(t[r++]=240|i>>>18,t[r++]=128|i>>>12&63,t[r++]=128|i>>>6&63,t[r++]=128|63&i);return t},ee=function(e,t){var i,n,a=t||e.length;if(\"function\"==typeof TextDecoder&&TextDecoder.prototype.decode)return(new TextDecoder).decode(e.subarray(0,t));var r=new Array(2*a);for(n=0,i=0;i<a;){var o=e[i++];if(o<128)r[n++]=o;else{var s=Q[o];if(s>4)r[n++]=65533,i+=s-1;else{for(o&=2===s?31:3===s?15:7;s>1&&i<a;)o=o<<6|63&e[i++],s--;s>1?r[n++]=65533:o<65536?r[n++]=o:(o-=65536,r[n++]=55296|o>>10&1023,r[n++]=56320|1023&o)}}}return function(e,t){if(t<65534&&e.subarray&&J)return String.fromCharCode.apply(null,e.length===t?e:e.subarray(0,t));for(var i=\"\",n=0;n<t;n++)i+=String.fromCharCode(e[n]);return i}(r,n)},te=function(e,t){(t=t||e.length)>e.length&&(t=e.length);for(var i=t-1;i>=0&&128==(192&e[i]);)i--;return i<0||0===i?t:i+Q[e[i]]>t?i:t},ie={2:\"need dictionary\",1:\"stream end\",0:\"\",\"-1\":\"file error\",\"-2\":\"stream error\",\"-3\":\"data error\",\"-4\":\"insufficient memory\",\"-5\":\"buffer error\",\"-6\":\"incompatible version\"};var ne=function(){this.input=null,this.next_in=0,this.avail_in=0,this.total_in=0,this.output=null,this.next_out=0,this.avail_out=0,this.total_out=0,this.msg=\"\",this.state=null,this.data_type=2,this.adler=0};var ae=function(){this.text=0,this.time=0,this.xflags=0,this.os=0,this.extra=null,this.extra_len=0,this.name=\"\",this.comment=\"\",this.hcrc=0,this.done=!1},re=Object.prototype.toString,oe=c.Z_NO_FLUSH,se=c.Z_FINISH,le=c.Z_OK,fe=c.Z_STREAM_END,de=c.Z_NEED_DICT,he=c.Z_STREAM_ERROR,ce=c.Z_DATA_ERROR,ue=c.Z_MEM_ERROR;function we(e){this.options=W({chunkSize:65536,windowBits:15,to:\"\"},e||{});var t=this.options;t.raw&&t.windowBits>=0&&t.windowBits<16&&(t.windowBits=-t.windowBits,0===t.windowBits&&(t.windowBits=-15)),!(t.windowBits>=0&&t.windowBits<16)||e&&e.windowBits||(t.windowBits+=32),t.windowBits>15&&t.windowBits<48&&0==(15&t.windowBits)&&(t.windowBits|=15),this.err=0,this.msg=\"\",this.ended=!1,this.chunks=[],this.strm=new ne,this.strm.avail_out=0;var i=Y.inflateInit2(this.strm,t.windowBits);if(i!==le)throw new Error(ie[i]);if(this.header=new ae,Y.inflateGetHeader(this.strm,this.header),t.dictionary&&(\"string\"==typeof t.dictionary?t.dictionary=$(t.dictionary):\"[object ArrayBuffer]\"===re.call(t.dictionary)&&(t.dictionary=new Uint8Array(t.dictionary)),t.raw&&(i=Y.inflateSetDictionary(this.strm,t.dictionary))!==le))throw new Error(ie[i])}function be(e,t){var i=new we(t);if(i.push(e),i.err)throw i.msg||ie[i.err];return i.result}we.prototype.push=function(e,t){var i,n,a,r=this.strm,o=this.options.chunkSize,s=this.options.dictionary;if(this.ended)return!1;for(n=t===~~t?t:!0===t?se:oe,\"[object ArrayBuffer]\"===re.call(e)?r.input=new Uint8Array(e):r.input=e,r.next_in=0,r.avail_in=r.input.length;;){for(0===r.avail_out&&(r.output=new Uint8Array(o),r.next_out=0,r.avail_out=o),(i=Y.inflate(r,n))===de&&s&&((i=Y.inflateSetDictionary(r,s))===le?i=Y.inflate(r,n):i===ce&&(i=de));r.avail_in>0&&i===fe&&r.state.wrap>0&&0!==e[r.next_in];)Y.inflateReset(r),i=Y.inflate(r,n);switch(i){case he:case ce:case de:case ue:return this.onEnd(i),this.ended=!0,!1}if(a=r.avail_out,r.next_out&&(0===r.avail_out||i===fe))if(\"string\"===this.options.to){var l=te(r.output,r.next_out),f=r.next_out-l,d=ee(r.output,l);r.next_out=f,r.avail_out=o-f,f&&r.output.set(r.output.subarray(l,l+f),0),this.onData(d)}else this.onData(r.output.length===r.next_out?r.output:r.output.subarray(0,r.next_out));if(i!==le||0!==a){if(i===fe)return i=Y.inflateEnd(this.strm),this.onEnd(i),this.ended=!0,!0;if(0===r.avail_in)break}}return!0},we.prototype.onData=function(e){this.chunks.push(e)},we.prototype.onEnd=function(e){e===le&&(\"string\"===this.options.to?this.result=this.chunks.join(\"\"):this.result=q(this.chunks)),this.chunks=[],this.err=e,this.msg=this.strm.msg};var me=we,ke=be,_e=function(e,t){return(t=t||{}).raw=!0,be(e,t)},ve=be,ge=c,pe={Inflate:me,inflate:ke,inflateRaw:_e,ungzip:ve,constants:ge};e.Inflate=me,e.constants=ge,e.default=pe,e.inflate=ke,e.inflateRaw=_e,e.ungzip=ve,Object.defineProperty(e,\"__esModule\",{value:!0})}));\n  ";

package/dist/templates/tamperProtectionTemplates.js

@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createEvalIntegrityTemplate = exports.StrictModeTemplate = exports.NativeFunctionTemplate = exports.IndexOfTemplate = void 0;
+var _template = _interopRequireDefault(require("./template"));
+var _constants = require("../constants");
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { "default": e }; }
+var StrictModeTemplate = exports.StrictModeTemplate = new _template["default"]("\n  (function(){\n    function isStrictMode(){\n      try {\n        var arr = []\n        delete arr[\"length\"]\n      } catch(e) {\n        return true;\n      }\n      return false;\n    }\n\n    if(isStrictMode()) {\n      {countermeasures}\n      {nativeFunctionName} = undefined;\n    }\n  })()\n  ");
+var IndexOfTemplate = exports.IndexOfTemplate = new _template["default"]("\nfunction indexOf(str, substr) {\n  const len = str.length;\n  const sublen = substr.length;\n  let count = 0;\n\n  if (sublen > len) {\n    return -1;\n  }\n\n  for (let i = 0; i <= len - sublen; i++) {\n    for (let j = 0; j < sublen; j++) {\n      if (str[i + j] === substr[j]) {\n        count++;\n        if (count === sublen) {\n          return i;\n        }\n      } else {\n        count = 0;\n        break;\n      }\n    }\n  }\n\n  return -1;\n}\n");
+var NativeFunctionTemplate = exports.NativeFunctionTemplate = new _template["default"]("\nfunction {nativeFunctionName}() {\n  {IndexOfTemplate}\n\n  function checkFunction(fn) {\n    if (\n      indexOf(\"\" + fn, \"{ [native code] }\") === -1 ||\n      typeof Object.getOwnPropertyDescriptor(fn, \"toString\") !== \"undefined\"\n    ) {\n      {countermeasures}\n\n      return undefined;\n    }\n\n    return fn;\n  }\n\n  var args = arguments;\n  if (args.length === 1) {\n    return checkFunction(args[0]);\n  } else if (args.length === 2) {\n    var object = args[0];\n    var property = args[1];\n\n    var fn = object[property];\n    fn = checkFunction(fn);\n\n    return fn.bind(object);\n  }\n}").addSymbols(_constants.UNSAFE, _constants.MULTI_TRANSFORM);
+var createEvalIntegrityTemplate = exports.createEvalIntegrityTemplate = function createEvalIntegrityTemplate(pluginInstance, path) {
+  var _pluginInstance$optio;
+  if ((_pluginInstance$optio = pluginInstance.options.lock) !== null && _pluginInstance$optio !== void 0 && _pluginInstance$optio.tamperProtection) {
+    return new _template["default"]("\n      function {EvalIntegrityName}(){\n        var localVar = false;\n        eval(__JS_CONFUSER_VAR__(localVar) + \" = true\")\n\n        if (!localVar) {\n          // Eval was tampered!\n          {countermeasures}\n\n          return false;\n        }\n\n        return true;\n      }\n    ").addSymbols(_constants.UNSAFE).setDefaultVariables({
+      countermeasures: pluginInstance.globalState.lock.createCountermeasuresCode()
+    });
+  }
+  return new _template["default"]("\n    function {EvalIntegrityName}(a = true){\n      return a;\n    }\n  ");
+};