Toggle navigation
MeasureThat.net
Create a benchmark
Tools
Feedback
FAQ
Register
Log In
Run results for:
Array find VS Array indexOf VS Map has VS Map get VS Set has
Go to the benchmark
Embed
Embed Benchmark Result
<iframe src="https://measurethat.net/Embed?id=626617" width="100%" height="500px"></iframe>
Run details:
User agent:
Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/148.0.0.0 Safari/537.36
Browser:
Chrome 148
Operating system:
Mac OS X 10.15.7
Device Platform:
Desktop
Date tested:
one month ago
Test name
Executions per second
Array find
0.7 Ops/sec
Array indexOf
1.4 Ops/sec
Map has
79.1 Ops/sec
Map get
83.7 Ops/sec
Set has
88.3 Ops/sec
Tests:
Array find
const positions = Array.from({ length: 10_000 }, () => [Math.random(), Math.random()]); const existing = []; let counter = 0; for (const p of positions) { existing.push([p[0], [1]]); } for (const p of positions) { const exists = existing.find((e) => e[0] === [0] && e[1] === p[1]); }
Array indexOf
const positions = Array.from({ length: 10_000 }, () => [Math.random(), Math.random()]); const existing = []; let counter = 0; for (const p of positions) { existing.push(`${p[0]}-${p[1]}`); } for (const p of positions) { const exists = existing.indexOf(`${p[0]}-${p[1]}`) > -1; if (exists) { counter++; } }
Map has
const positions = Array.from({ length: 10_000 }, () => [Math.random(), Math.random()]); const existing = new Map(); let counter = 0; for (const p of positions) { existing.set(`${p[0]}-${p[1]}`, true); } for (const p of positions) { const exists = existing.has(`${p[0]}-${p[1]}`); if (exists) { counter++; } }
Map get
const positions = Array.from({ length: 10_000 }, () => [Math.random(), Math.random()]); const existing = new Map(); let counter = 0; for (const p of positions) { existing.set(`${p[0]}-${p[1]}`, true); } for (const p of positions) { const exists = existing.get(`${p[0]}-${p[1]}`) === true; if (exists) { counter++; } }
Set has
const positions = Array.from({ length: 10_000 }, () => [Math.random(), Math.random()]); const existing = new Set(); let counter = 0; for (const p of positions) { existing.add(`${p[0]}-${p[1]}`, true); } for (const p of positions) { const exists = existing.has(`${p[0]}-${p[1]}`); if (exists) { counter++; } }