{"ScriptPreparationCode":"var shortSize = 100;\r\nvar longSize = 10000;\r\n\r\nvar shortArr1 = Array.from({\r\n length: shortSize\r\n}, () =\u003E Math.floor(Math.random() * shortSize));\r\nvar shortArr2 = Array.from({\r\n length: shortSize\r\n}, () =\u003E Math.floor(Math.random() * shortSize));\r\n\r\nfunction intersect_for(a, b) {\r\n const result = [];\r\n const alen = a.length;\r\n const blen = b.length;\r\n for (let i = 0; i \u003C alen; \u002B\u002Bi) {\r\n const ai = a[i];\r\n for (let j = 0; j \u003C blen; \u002B\u002Bj) {\r\n if (ai === b[j]) {\r\n result.push(ai);\r\n break;\r\n }\r\n }\r\n }\r\n return result;\r\n}\r\n\r\nfunction intersect_filter_indexOf(a, b) {\r\n return a.filter(el =\u003E b.indexOf(el) !== -1);\r\n}\r\n\r\nfunction intersect_filter_in(a, b) {\r\n const map = b.reduce((map, el) =\u003E {\r\n map[el] = true;\r\n return map\r\n }, {});\r\n return a.filter(el =\u003E el in map);\r\n}\r\n\r\nfunction intersect_for_in(a, b) {\r\n const result = [];\r\n const map = {};\r\n for (let i = 0, length = b.length; i \u003C length; \u002B\u002Bi) {\r\n map[b[i]] = true;\r\n }\r\n for (let i = 0, length = a.length; i \u003C length; \u002B\u002Bi) {\r\n if (a[i] in map) result.push(a[i]);\r\n }\r\n return result;\r\n}\r\n\r\nfunction intersect_filter_includes(a, b) {\r\n return a.filter(el =\u003E b.includes(el));\r\n}\r\n\r\nfunction intersect_filter_has_this(a, b) {\r\n return a.filter(Set.prototype.has, new Set(b));\r\n}\r\n\r\nfunction intersect_filter_has_arrow(a, b) {\r\n const set = new Set(b);\r\n return a.filter(el =\u003E set.has(el));\r\n}\r\n\r\nfunction intersect_for_has(a, b) {\r\n const result = [];\r\n const set = new Set(b);\r\n for (let i = 0, length = a.length; i \u003C length; \u002B\u002Bi) {\r\n if (set.has(a[i])) result.push(a[i]);\r\n }\r\n return result;\r\n}","TestCases":[{"Name":"intersect_for(shortArr1, shortArr2)","Code":"intersect_for(shortArr1, shortArr2)","IsDeferred":false},{"Name":"intersect_filter_indexOf(shortArr1, shortArr2)","Code":"intersect_filter_indexOf(shortArr1, shortArr2)","IsDeferred":false},{"Name":"intersect_filter_in(shortArr1, shortArr2)","Code":"intersect_filter_in(shortArr1, shortArr2)","IsDeferred":false},{"Name":"intersect_for_in(shortArr1, shortArr2)","Code":"intersect_for_in(shortArr1, shortArr2)","IsDeferred":false},{"Name":"intersect_filter_includes(shortArr1, shortArr2)","Code":"intersect_filter_includes(shortArr1, shortArr2)","IsDeferred":false},{"Name":"intersect_filter_has_this(shortArr1, shortArr2)","Code":"intersect_filter_has_this(shortArr1, shortArr2)","IsDeferred":false},{"Name":"intersect_filter_has_arrow(shortArr1, shortArr2)","Code":"intersect_filter_has_arrow(shortArr1, shortArr2)","IsDeferred":false},{"Name":"intersect_for_has(shortArr1, shortArr2)","Code":"intersect_for_has(shortArr1, shortArr2)","IsDeferred":false}]}