Benchmark: Some vs indexOf vs Includes 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.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;
Array.includes
var tempResult = !!Math.round(Math.random()) ? hasZero.some(v => v === 0) : withoutZero.includes(v => v === 0);
Array.find
var tempResult = !!Math.round(Math.random()) ? hasZero.some(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.filter
Array.indexOf
Array.includes
Array.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: 2 years ago)

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

Browser/OS: Firefox 98 on Windows

View result in a separate tab

Test name	Executions per second
Array.filter	10966.6 Ops/sec
Array.indexOf	98628.1 Ops/sec
Array.includes	71948.4 Ops/sec
Array.find	31766.3 Ops/sec

Some vs indexOf vs Includes vs Find (version: 0)

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

Created: 2 years ago by: Guest

Jump to the latest result

Array.filter

Array.indexOf

Array.includes

Array.find

Suite status: <idle, ready to run>

Experimental features:

Fastest: N/A

Slowest: N/A