{"ScriptPreparationCode":"var first = [...Array(100)].map(it =\u003E ~~(Math.random() * 1000));\r\nvar second = [...Array(20)].map(it =\u003E ~~(Math.random() * 1000));\r\n\r\nvar firstSet = new Set(first);\r\nvar secondSet = new Set(second);\r\n","TestCases":[{"Name":"Javascript Set intersection (larger set first)","Code":"new Set(first.filter(item =\u003E secondSet.has(item)));","IsDeferred":false},{"Name":"Lodash intersection","Code":"_.intersection(first, second)","IsDeferred":false},{"Name":"Javascript Array intersection","Code":"first.filter(it =\u003E second.includes(it))","IsDeferred":false},{"Name":"Javascript Set intersection (new feature) (larger set first)","Code":"firstSet.intersection(secondSet)","IsDeferred":false},{"Name":"Javascript Set intersection (smaller set first)","Code":"new Set(second.filter(item =\u003E firstSet.has(item)));","IsDeferred":false},{"Name":"Javascript Set intersection (new feature) (smaller set first)","Code":"secondSet.intersection(firstSet)","IsDeferred":false},{"Name":"Javascript Set intersection (new feature) (smaller set first) (with set init time)","Code":"const newFirstSet = new Set(first);\r\nconst newSecondSet = new Set(second);\r\n\r\nnewFirstSet.intersection(newSecondSet)","IsDeferred":false}]}