Benchmark: Some vs. Filter vs. indexOf vs Find

Script Preparation code:

var hasZero = [];
var withoutZero = [];
for (var i = 0; i < 10000; i++) {
  hasZero.push(Math.floor(Math.random() * 1000));
  withoutZero.push(Math.floor(Math.random() * 1000) + 1)
}

Tests:

Array.some
var tempResult = !!Math.round(Math.random()) ? hasZero.some(v => v === 0) : withoutZero.some(v => v === 0);
Array.filter
var tempResult = !!Math.round(Math.random()) ? hasZero.filter(v => v === 0) : withoutZero.filter(v => v === 0);
Array.indexOf
var tempResult = !!Math.round(Math.random()) ? hasZero.indexOf(0) > -1 : withoutZero.indexOf(0) > -1;
find
var tempResult = !!Math.round(Math.random()) ? hasZero.find(v => v === 0) : withoutZero.find(v => v === 0);

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
Array.some
Array.filter
Array.indexOf
find

Fastest: N/A

Slowest: N/A

ⓘ Get performance results from real users on your website with Request Metrics.

Website Performance Monitoring by Request Metrics

Latest run results:

Run details: (Test run date: 3 years ago)

User agent: Mozilla/5.0 (Windows NT 6.1; Win64; x64; rv:83.0) Gecko/20100101 Firefox/83.0

Browser/OS: Firefox 83 on Windows 7

View result in a separate tab

Test name	Executions per second
Array.some	20925.4 Ops/sec
Array.filter	11772.3 Ops/sec
Array.indexOf	71112.0 Ops/sec
find	20113.5 Ops/sec

Some vs. Filter vs. indexOf vs Find (version: 0)

Comparing performance of: Array.some vs Array.filter vs Array.indexOf vs find

Created: 4 years ago by: Guest

Jump to the latest result

Array.some

Array.filter

Array.indexOf

find

Suite status: <idle, ready to run>

Experimental features:

Fastest: N/A

Slowest: N/A