Run results for: Some vs. Filter vs. indexOf vs. includes vs reduce

Run details:

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

Browser: Firefox 122

Operating system: Windows

Device Platform: Desktop

Date tested: 2 years ago

Benchmark engine: Benchmark.js

Array.includes

7.1M/s

Array.indexOf

4.8M/s

Array.some

4.0M/s

Array.filter

3.7M/s

Array.reduce

1.1M/s

View exact numbers

Test name	Executions per second
✓ Array.includes	7,117,279 Ops/sec
Array.indexOf	4,754,044 Ops/sec
Array.some	3,977,914 Ops/sec
Array.filter	3,718,112 Ops/sec
Array.reduce	1,146,334 Ops/sec

Script Preparation code:

var hasZero = [];
var withoutZero = [];
for (var i = 0; i < 100; 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;
Array.includes
var tempResult = !!Math.round(Math.random()) ? hasZero.includes(0) : withoutZero.includes(0);
Array.reduce
var tempResult = !!Math.round(Math.random()) ? hasZero.reduce((pre, curr) => pre || curr === 0, false) : withoutZero.reduce((pre, curr) => pre || curr === 0, false);