js-confuser 1.5.9 → 1.7.0

package/dist/transforms/controlFlowFlattening/expressionObfuscation.js

@@ -13,6 +13,9 @@ var _transform = _interopRequireDefault(require("../transform"));
 
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
 
+/**
+ * Expression Obfuscation runs before Control Flow Flattening
+ */
 class ExpressionObfuscation extends _transform.default {
   constructor(o) {
     super(o);
@@ -27,7 +30,7 @@ class ExpressionObfuscation extends _transform.default {
       var exprs = [];
       var deleteExprs = [];
       object.body.forEach((stmt, i) => {
-        if (stmt.type == "ExpressionStatement") {
+        if (stmt.type == "ExpressionStatement" && !stmt.directive) {
           var expr = stmt.expression;
 
           if (expr.type == "UnaryExpression" && !(expr.operator === "typeof" && expr.argument.type === "Identifier") && exprs.length // typeof is special

package/dist/transforms/controlFlowFlattening/switchCaseObfuscation.js

@@ -28,22 +28,23 @@ class SwitchCaseObfuscation extends _transform.default {
   }
 
   match(object, parents) {
-    return object.type == "SwitchStatement" && !object.cases.find(x => !(x.test && typeof x.test === "object" && x.test.type == "Literal" && typeof x.test.value === "number" && Math.abs(x.test.value) < 100000));
+    return object.type == "SwitchStatement" && (object.$controlFlowFlattening || !object.cases.find(x => !(x.test && typeof x.test === "object" && x.test.type == "Literal" && typeof x.test.value === "number" && Math.abs(x.test.value) < 100000)));
   }
 
   transform(object, parents) {
     var types = new Set();
     (0, _traverse.walk)(object.discriminant, [object, ...parents], (o, p) => {
       if (o.type) {
-        if (object.$controlFlowFlattening && o.type == "BinaryExpression" && o.operator === "+") {} else {
-          types.add(o.type);
-        }
+        types.add(o.type);
       }
     });
-    types.delete("Identifier");
 
-    if (types.size) {
-      return;
+    if (!object.$controlFlowFlattening) {
+      types.delete("Identifier");
+
+      if (types.size) {
+        return;
+      }
     }
 
     var body = parents[0];
@@ -64,33 +65,25 @@ class SwitchCaseObfuscation extends _transform.default {
       return;
     }
 
-    var factor = (0, _random.getRandomInteger)(-150, 150);
-
-    if (factor == 0) {
-      factor = 2;
-    }
-
+    var factor = (0, _random.getRandomInteger)(2, 100);
     var offset = (0, _random.getRandomInteger)(-250, 250);
     var newVar = this.getPlaceholder();
     var newStates = [];
     var max;
-    object.cases.forEach(x => {
-      var current = x.test.value;
-      var value = current * factor + offset;
-      newStates.push(value);
-
-      if (!max || Math.abs(value) > max) {
-        max = Math.abs(value);
+    object.cases.forEach((caseObject, i) => {
+      if (caseObject.test && caseObject.test.type === "Literal" && typeof caseObject.test.value === "number") {
+        var current = caseObject.test.value;
+        var value = current * factor + offset;
+        newStates[i] = value;
+
+        if (!max || Math.abs(value) > max) {
+          max = Math.abs(value);
+        }
       }
     });
 
     if (max > 100000) {
       return;
-    }
-
-    if (new Set(newStates).size !== newStates.length) {
-      // not possible because of clashing case test
-      return;
     } // State variable declaration
 
 
@@ -98,7 +91,13 @@ class SwitchCaseObfuscation extends _transform.default {
     object.discriminant = (0, _gen.Identifier)(newVar); // possible so override
 
     object.cases.forEach((x, i) => {
-      x.test = (0, _gen.Literal)(newStates[i]);
+      if (x.test) {
+        if (x.test.type === "Literal" && typeof x.test.value === "number") {
+          x.test = (0, _gen.Literal)(newStates[i]);
+        } else {
+          x.test = (0, _gen.BinaryExpression)("+", (0, _gen.BinaryExpression)("*", x.test, (0, _gen.Literal)(factor)), (0, _gen.Literal)(offset));
+        }
+      }
     });
   }
 

package/dist/transforms/deadCode.js

@@ -25,7 +25,7 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { de
 
 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; }
 
-const templates = [(0, _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  }"), (0, _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  }"), (0, _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');"), (0, _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};"), (0, _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}"), (0, _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}"), (0, _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  }"), (0, _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  "), (0, _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  "), (0, _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  /**\n   * @param {TreeNode} root\n   * @return {boolean}\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  ")];
+const templates = [(0, _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  }"), (0, _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  }"), (0, _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');"), (0, _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};"), (0, _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}"), (0, _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}"), (0, _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  }"), (0, _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  "), (0, _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  "), (0, _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  /**\n   * @param {TreeNode} root\n   * @return {boolean}\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  "), (0, _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  "), (0, _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  "), (0, _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  "), (0, _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  "), (0, _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  "), (0, _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  "), (0, _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  "), (0, _template.default)("\n  /**\n   * @param {number} capacity\n   */\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  /** \n   * @param {number} key\n   * @return {number}\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  /** \n   * @param {number} key \n   * @param {number} value\n   * @return {void}\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  "), (0, _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  "), (0, _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  ")];
 /**
  * Adds dead code to blocks.
  *
@@ -37,8 +37,6 @@ class DeadCode extends _transform.default {
   constructor(o) {
     super(o, _order.ObfuscateOrder.DeadCode);
 
-    _defineProperty(this, "usedNames", void 0);
-
     _defineProperty(this, "made", void 0);
 
     this.made = 0;
@@ -49,29 +47,39 @@ class DeadCode extends _transform.default {
   }
 
   transform(object, parents) {
-    if ((0, _probability.ComputeProbabilityMap)(this.options.deadCode)) {
-      return () => {
-        this.made++;
-
-        if (this.made > 100) {
-          return;
-        }
-
-        var name = this.getPlaceholder();
-        var variableDeclaration = (0, _gen.VariableDeclaration)((0, _gen.VariableDeclarator)(name, (0, _gen.Literal)(false)));
-        var body = (0, _insert.getBlockBody)(object);
-        var index = (0, _random.getRandomInteger)(0, body.length);
-        var template;
-
-        do {
-          template = (0, _random.choice)(templates);
-        } while (this.options.es5 && template.source.includes("async"));
-
-        var ifStatement = (0, _gen.IfStatement)((0, _gen.Identifier)(name), template.compile(), null);
-        body.splice(index, 0, ifStatement);
-        (0, _insert.prepend)(object, variableDeclaration);
-      };
+    if (!(0, _probability.ComputeProbabilityMap)(this.options.deadCode)) {
+      return;
+    } // Hard-coded limit of 100 Dead Code insertions
+
+
+    this.made++;
+
+    if (this.made > 100) {
+      return;
     }
+
+    return () => {
+      var body = (0, _insert.getBlockBody)(object); // Do not place code before Import statements or 'use strict' directives
+
+      var safeOffset = 0;
+
+      for (var node of body) {
+        if (node.type === "ImportDeclaration" || node.directive) safeOffset++;else break;
+      }
+
+      var index = (0, _random.getRandomInteger)(safeOffset, body.length);
+      var name = this.getPlaceholder();
+      var variableDeclaration = (0, _gen.VariableDeclaration)((0, _gen.VariableDeclarator)(name, (0, _gen.Literal)(false)));
+      var template;
+
+      do {
+        template = (0, _random.choice)(templates);
+      } while (this.options.es5 && template.source.includes("async"));
+
+      var ifStatement = (0, _gen.IfStatement)((0, _gen.Identifier)(name), template.compile(), null);
+      body.splice(index, 0, ifStatement);
+      (0, _insert.prepend)(object, variableDeclaration);
+    };
   }
 
 }

package/dist/transforms/dispatcher.js

@@ -56,9 +56,12 @@ function _defineProperty(obj, key, value) { if (key in obj) { Object.definePrope
  * 3. using `this`
  */
 class Dispatcher extends _transform.default {
+  // Debug mode preserves function names
   constructor(o) {
     super(o, _order.ObfuscateOrder.Dispatcher);
 
+    _defineProperty(this, "isDebug", false);
+
     _defineProperty(this, "count", void 0);
 
     this.count = 0;
@@ -102,11 +105,12 @@ class Dispatcher extends _transform.default {
 
           if (context === c) {
             if (o.type == "FunctionDeclaration" && o.id.name) {
+              var name = o.id.name;
+
               if (o.$requiresEval || o.async || o.generator || p.find(x => x.$dispatcherSkip || x.type == "MethodDefinition") || o.body.type != "BlockStatement") {
                 illegalFnNames.add(name);
-              }
+              } // If dupe, no routing
 
-              var name = o.id.name; // If dupe, no routing
 
               if (functionDeclarations[name]) {
                 illegalFnNames.add(name);
@@ -157,13 +161,13 @@ class Dispatcher extends _transform.default {
 
         var gen = this.getGenerator();
         Object.keys(functionDeclarations).forEach(name => {
-          newFnNames[name] = gen.generate();
+          newFnNames[name] = this.isDebug ? "_dispatcher_" + this.count + "_" + name : gen.generate();
         }); // set containing new name
 
         var set = new Set(Object.keys(newFnNames)); // Only make a dispatcher function if it caught any functions
 
         if (set.size > 0) {
-          var payloadArg = "$jsc_d".concat(this.count, "_payload");
+          var payloadArg = this.getPlaceholder() + "_dispatcher_" + this.count + "_payload";
           var dispatcherFnName = this.getPlaceholder() + "_dispatcher_" + this.count;
           this.log(dispatcherFnName, set);
           this.count++;

package/dist/transforms/es5/antiDestructuring.js

@@ -158,6 +158,8 @@ class AntiDestructuring extends _transform.default {
         if (x.type == "Identifier") {
           exprs.push((0, _gen.AssignmentExpression)(operator, (0, _insert.clone)(x), realm));
           names.add(x.name);
+        } else if (x.type == "MemberExpression") {
+          exprs.push((0, _gen.AssignmentExpression)(operator, (0, _insert.clone)(x), realm));
         } else if (x.type == "ObjectPattern") {
           x.properties.forEach(property => {
             recursive(property.value, (0, _gen.MemberExpression)(realm, property.key, property.computed));

package/dist/transforms/es5/es5.js

@@ -13,8 +13,6 @@ var _insert = require("../../util/insert");
 
 var _traverse = require("../../traverse");
 
-var _template = _interopRequireDefault(require("../../templates/template"));
-
 var _order = require("../../order");
 
 var _assert = require("assert");
@@ -31,6 +29,8 @@ var _antiES6Object = _interopRequireDefault(require("./antiES6Object"));
 
 var _antiSpreadOperator = _interopRequireDefault(require("./antiSpreadOperator"));
 
+var _es = require("../../templates/es5");
+
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
 
 /**
@@ -93,24 +93,44 @@ class AntiArrowFunction extends _transform.default {
   }
 
 }
+/**
+ * The ES5 options aims to convert ES6 and up features down to ES5-compatible code.
+ *
+ * The obfuscator regularly adds ES6 code (variable destructuring, spread element, etc.)
+ * This transformations goal is undo only these things.
+ */
+
 
 exports.AntiArrowFunction = AntiArrowFunction;
 
-class FixedExpressions extends _transform.default {
+class ES5 extends _transform.default {
   constructor(o) {
-    super(o);
+    super(o, _order.ObfuscateOrder.ES5);
+    this.before.push(new _antiClass.default(o));
+    this.before.push(new _antiTemplate.default(o));
+    this.before.push(new _antiSpreadOperator.default(o));
+    this.before.push(new _antiES6Object.default(o));
+    this.before.push(new AntiArrowFunction(o));
+    this.before.push(new _antiDestructuring.default(o));
+    this.before.push(new AntiConstLet(o));
   }
 
+  apply(tree) {
+    super.apply(tree);
+
+    var nodesToAdd = _es.ES5Template.compile();
+
+    (0, _insert.prepend)(tree, ...nodesToAdd);
+  } // FixedExpressions
+
+
   match(object, parents) {
-    return true;
+    return !!object.type;
   }
 
   transform(object, parents) {
     return () => {
-      if (object.type == "ForStatement" && object.init.type == "ExpressionStatement") {
-        object.init = object.init.expression;
-      }
-
+      // Object.keyword -> Object["keyword"]
       if (object.type == "MemberExpression") {
         if (!object.computed && object.property.type == "Identifier") {
           if (_constants.reservedKeywords.has(object.property.name)) {
@@ -118,7 +138,8 @@ class FixedExpressions extends _transform.default {
             object.computed = true;
           }
         }
-      }
+      } // { keyword: ... } -> { "keyword": ... }
+
 
       if (object.type == "Property") {
         if (!object.computed && object.key.type == "Identifier") {
@@ -132,28 +153,4 @@ class FixedExpressions extends _transform.default {
 
 }
 
-class ES5 extends _transform.default {
-  constructor(o) {
-    super(o, _order.ObfuscateOrder.ES5);
-    this.before.push(new _antiClass.default(o));
-    this.before.push(new _antiTemplate.default(o));
-    this.before.push(new _antiSpreadOperator.default(o));
-    this.before.push(new _antiES6Object.default(o));
-    this.before.push(new AntiArrowFunction(o));
-    this.before.push(new _antiDestructuring.default(o));
-    this.before.push(new AntiConstLet(o));
-    this.concurrent.push(new FixedExpressions(o));
-  }
-
-  match(object, parents) {
-    return object.type == "Program";
-  }
-
-  transform(object, parents) {
-    var block = (0, _traverse.getBlock)(object, parents);
-    (0, _insert.getBlockBody)(block).splice(0, 0, ...(0, _template.default)("\n    !Array.prototype.forEach ? Array.prototype.forEach = function (callback, thisArg) {\n      thisArg = thisArg;\n      for (var i = 0; i < this.length; i++) {\n          callback.call(thisArg, this[i], i, this);\n      }\n    } : 0;\n  \n    !Array.prototype.map ? Array.prototype.map = function (callback, thisArg) {\n      thisArg = thisArg;\n      var array=[];\n      for (var i = 0; i < this.length; i++) {\n        array.push( callback.call(thisArg, this[i], i, this) );\n      }\n      return array;\n    } : 0;\n\n    !Array.prototype.reduce ? Array.prototype.reduce = function(fn, initial) {\n      var values = this;\n      if ( typeof initial === \"undefined\" ) {\n        initial = 0;\n      }\n\n      values.forEach(function(item, index){\n        initial = fn(initial, item, index, this);\n      });\n\n      return initial;\n    } : 0;\n  ").compile());
-  }
-
-}
-
 exports.default = ES5;

package/dist/transforms/extraction/duplicateLiteralsRemoval.js

@@ -23,6 +23,8 @@ var _assert = require("assert");
 
 var _random = require("../../util/random");
 
+var _traverse = require("../../traverse");
+
 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; }
@@ -46,12 +48,19 @@ function _defineProperty(obj, key, value) { if (key in obj) { Object.definePrope
  * ```
  */
 class DuplicateLiteralsRemoval extends _transform.default {
+  // The array holding all the duplicate literals
+  // The array expression node to be inserted into the program
+
+  /**
+   * Literals in the array
+   */
+
   /**
-   * getter fn name -> accumulative shift
+   * Literals are saved here the first time they are seen.
    */
 
   /**
-   * lex context -> getter fn name
+   * Block -> { functionName, indexShift }
    */
   constructor(o) {
     super(o, _order.ObfuscateOrder.DuplicateLiteralsRemoval);
@@ -64,23 +73,45 @@ class DuplicateLiteralsRemoval extends _transform.default {
 
     _defineProperty(this, "first", void 0);
 
-    _defineProperty(this, "fnShifts", void 0);
-
-    _defineProperty(this, "fnGetters", void 0);
+    _defineProperty(this, "functions", void 0);
 
     this.map = new Map();
     this.first = new Map();
-    this.fnShifts = new Map();
-    this.fnGetters = new Map();
+    this.functions = new Map();
   }
 
   apply(tree) {
     super.apply(tree);
 
-    if (this.arrayName && this.arrayExpression.elements.length) {
+    if (this.arrayName && this.arrayExpression.elements.length > 0) {
+      // This function simply returns the array
       var getArrayFn = this.getPlaceholder();
-      (0, _insert.append)(tree, (0, _gen.FunctionDeclaration)(getArrayFn, [], [(0, _gen.ReturnStatement)(this.arrayExpression)]));
-      (0, _insert.prepend)(tree, (0, _gen.VariableDeclaration)((0, _gen.VariableDeclarator)(this.arrayName, (0, _gen.CallExpression)((0, _gen.MemberExpression)((0, _gen.Identifier)(getArrayFn), (0, _gen.Identifier)("call"), false), [(0, _gen.ThisExpression)()]))));
+      (0, _insert.append)(tree, (0, _gen.FunctionDeclaration)(getArrayFn, [], [(0, _gen.ReturnStatement)(this.arrayExpression)])); // This variable holds the array
+
+      (0, _insert.prepend)(tree, (0, _gen.VariableDeclaration)((0, _gen.VariableDeclarator)(this.arrayName, (0, _gen.CallExpression)((0, _gen.MemberExpression)((0, _gen.Identifier)(getArrayFn), (0, _gen.Literal)("call"), true), [(0, _gen.ThisExpression)()])))); // Create all the functions needed
+
+      for (var blockNode of this.functions.keys()) {
+        var {
+          functionName,
+          indexShift
+        } = this.functions.get(blockNode);
+        var propertyNode = (0, _gen.BinaryExpression)("-", (0, _gen.Identifier)("index_param"), (0, _gen.Literal)(indexShift));
+        var indexRangeInclusive = [0 + indexShift - 1, this.map.size + indexShift]; // The function uses mangling to hide the index being accessed
+
+        var mangleCount = (0, _random.getRandomInteger)(1, 10);
+
+        for (var i = 0; i < mangleCount; i++) {
+          var operator = (0, _random.choice)([">", "<"]);
+          var compareValue = (0, _random.choice)(indexRangeInclusive);
+          var test = (0, _gen.BinaryExpression)(operator, (0, _gen.Identifier)("index_param"), (0, _gen.Literal)(compareValue));
+          var alternate = (0, _gen.BinaryExpression)("-", (0, _gen.Identifier)("index_param"), (0, _gen.Literal)((0, _random.getRandomInteger)(-100, 100)));
+          var testValue = operator === ">" && compareValue === indexRangeInclusive[0] || operator === "<" && compareValue === indexRangeInclusive[1];
+          propertyNode = (0, _gen.ConditionalExpression)(test, testValue ? propertyNode : alternate, !testValue ? propertyNode : alternate);
+        }
+
+        var returnArgument = (0, _gen.MemberExpression)((0, _gen.Identifier)(this.arrayName), propertyNode, true);
+        (0, _insert.prepend)(blockNode, (0, _gen.FunctionDeclaration)(functionName, [(0, _gen.Identifier)("index_param")], [(0, _gen.ReturnStatement)(returnArgument)]));
+      }
     }
   }
 
@@ -95,43 +126,39 @@ class DuplicateLiteralsRemoval extends _transform.default {
    */
 
 
-  toCaller(object, parents, index) {
-    // get all the getters defined here or higher
-    var getterNames = [object, ...parents].map(x => this.fnGetters.get(x)).filter(x => x); // use random getter function
+  transformLiteral(object, parents, index) {
+    var blockNode = (0, _random.choice)(parents.filter(x => this.functions.has(x))); // Create initial function if none exist
 
-    var getterName = (0, _random.choice)(getterNames); // get this literals context
+    if (this.functions.size === 0) {
+      var root = parents[parents.length - 1];
+      var rootFunctionName = this.getPlaceholder() + "_dLR_0";
+      this.functions.set(root, {
+        functionName: rootFunctionName,
+        indexShift: (0, _random.getRandomInteger)(-100, 100)
+      });
+      blockNode = root;
+    } // If no function here exist, possibly create new chained function
 
-    var lexContext = (0, _insert.getLexContext)(object, parents);
-    var hasGetterHere = this.fnGetters.has(lexContext); // create one if none are available (or by random chance if none are here locally)
 
-    var shouldCreateNew = !getterName || !hasGetterHere && Math.random() > 0.9;
+    var block = (0, _traverse.getBlock)(object, parents);
 
-    if (shouldCreateNew) {
-      (0, _assert.ok)(!this.fnGetters.has(lexContext));
-      var lexContextIndex = parents.findIndex(x => x !== lexContext && (0, _insert.isLexContext)(x));
-      var basedOn = lexContextIndex !== -1 ? (0, _random.choice)(parents.slice(lexContextIndex + 1).map(x => this.fnGetters.get(x)).filter(x => x)) : null;
-      var body = [];
-      var thisShift = (0, _random.getRandomInteger)(-250, 250); // the name of the getter
+    if (!this.functions.has(block) && (0, _random.chance)(50 - this.functions.size)) {
+      var newFunctionName = this.getPlaceholder() + "_dLR_" + this.functions.size;
+      this.functions.set(block, {
+        functionName: newFunctionName,
+        indexShift: (0, _random.getRandomInteger)(-100, 100)
+      });
+      blockNode = block;
+    } // Derive the function to call from the selected blockNode
 
-      getterName = this.getPlaceholder() + "_dLR_" + this.fnGetters.size;
 
-      if (basedOn) {
-        var shift = this.fnShifts.get(basedOn);
-        (0, _assert.ok)(typeof shift === "number");
-        body = [(0, _gen.ReturnStatement)((0, _gen.CallExpression)((0, _gen.Identifier)(basedOn), [(0, _gen.BinaryExpression)("+", (0, _gen.Identifier)("index"), (0, _gen.Literal)(thisShift))]))];
-        this.fnShifts.set(getterName, shift + thisShift);
-      } else {
-        // from scratch
-        body = [(0, _gen.ReturnStatement)((0, _gen.MemberExpression)((0, _gen.Identifier)(this.arrayName), (0, _gen.BinaryExpression)("+", (0, _gen.Identifier)("index"), (0, _gen.Literal)(thisShift)), true))];
-        this.fnShifts.set(getterName, thisShift);
-      }
+    var {
+      functionName,
+      indexShift
+    } = this.functions.get(blockNode); // Call the function given it's indexShift
 
-      this.fnGetters.set(lexContext, getterName);
-      (0, _insert.prepend)(lexContext, (0, _gen.VariableDeclaration)((0, _gen.VariableDeclarator)(getterName, (0, _gen.CallExpression)((0, _gen.FunctionExpression)([], [(0, _gen.ReturnStatement)((0, _gen.FunctionExpression)([(0, _gen.Identifier)("index")], body))]), []))));
-    }
-
-    var theShift = this.fnShifts.get(getterName);
-    this.replaceIdentifierOrLiteral(object, (0, _gen.CallExpression)((0, _gen.Identifier)(getterName), [(0, _gen.Literal)(index - theShift)]), parents);
+    var callExpression = (0, _gen.CallExpression)((0, _gen.Identifier)(functionName), [(0, _gen.Literal)(index + indexShift)]);
+    this.replaceIdentifierOrLiteral(object, callExpression, parents);
   }
 
   transform(object, parents) {
@@ -144,19 +171,22 @@ class DuplicateLiteralsRemoval extends _transform.default {
 
       if (!(0, _probability.ComputeProbabilityMap)(this.options.duplicateLiteralsRemoval)) {
         return;
-      }
+      } // HARD CODED LIMIT of 10,000 (after 1,000 elements)
+
+
+      if (this.map.size > 1000 && (0, _random.chance)(this.map.size / 100)) return;
 
       if (this.arrayName && parents[0].object && parents[0].object.name == this.arrayName) {
         return;
       }
 
-      var value;
+      var stringValue;
 
       if (object.type == "Literal") {
-        value = typeof object.value + ":" + object.value;
+        stringValue = typeof object.value + ":" + object.value;
 
         if (object.value === null) {
-          value = "null:null";
+          stringValue = "null:null";
         } else {
           // Skip empty strings
           if (typeof object.value === "string" && !object.value) {
@@ -164,38 +194,42 @@ class DuplicateLiteralsRemoval extends _transform.default {
           }
         }
       } else if (object.type == "Identifier") {
-        value = "identifier:" + object.name;
+        stringValue = "identifier:" + object.name;
       } else {
         throw new Error("Unsupported primitive type: " + object.type);
       }
 
-      (0, _assert.ok)(value);
+      (0, _assert.ok)(stringValue);
 
-      if (!this.first.has(value) && !this.map.has(value)) {
-        this.first.set(value, [object, parents]);
-      } else {
+      if (this.map.has(stringValue) || this.first.has(stringValue)) {
+        // Create the array if not already made
         if (!this.arrayName) {
           this.arrayName = this.getPlaceholder();
           this.arrayExpression = (0, _gen.ArrayExpression)([]);
-        }
+        } // Delete with first location
 
-        var firstLocation = this.first.get(value);
+
+        var firstLocation = this.first.get(stringValue);
 
         if (firstLocation) {
-          this.first.set(value, null);
           var index = this.map.size;
-          (0, _assert.ok)(!this.map.has(value));
-          this.map.set(value, index);
+          (0, _assert.ok)(!this.map.has(stringValue));
+          this.map.set(stringValue, index);
+          this.first.delete(stringValue);
           var pushing = (0, _insert.clone)(object);
           this.arrayExpression.elements.push(pushing);
           (0, _assert.ok)(this.arrayExpression.elements[index] === pushing);
-          this.toCaller(firstLocation[0], firstLocation[1], index);
+          this.transformLiteral(firstLocation[0], firstLocation[1], index);
         }
 
-        var index = this.map.get(value);
+        var index = this.map.get(stringValue);
         (0, _assert.ok)(typeof index === "number");
-        this.toCaller(object, parents, index);
-      }
+        this.transformLiteral(object, parents, index);
+        return;
+      } // Save this, maybe a duplicate will be found.
+
+
+      this.first.set(stringValue, [object, parents]);
     };
   }