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

Run details:

User agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/131.0.0.0 Safari/537.36

Browser: Chrome 131

Operating system: Mac OS X 10.15.7

Device Platform: Desktop

Date tested: one year ago

Benchmark engine: Benchmark.js

Array.includes

32.4M/s

Array.indexOf

32.3M/s

Array.reduce

27.2M/s

Array.some

15.6M/s

Array.filter

8.7M/s

View exact numbers

Test name	Executions per second
✓ Array.includes	32,446,706 Ops/sec
Array.indexOf	32,282,058 Ops/sec
Array.reduce	27,186,264 Ops/sec
Array.some	15,618,159 Ops/sec
Array.filter	8,743,960 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);