Benchmark: Array filter performance

Script Preparation code:

var arr = [];
for (var i = 0; i < 1000; i++) {
  arr[i] = i;
}

function someFn(i) {
  return (i * 3 * 8 / 1200 * 0.002 / 40 * 0.2);
}

var sumForEach = 0,
  sumReduce = 0,
  sumMap = 0,
  sumFilter = 0,
  sumFor = 0;

Tests:

filter
arr.filter(item => (sumFilter += someFn(item)));
reduce
sumReduce = arr.reduce((lastValue, item) => { return sumReduce += someFn(item); });

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
filter
reduce

Fastest: N/A

Slowest: N/A

Latest run results:

No previous run results

This benchmark does not have any results yet. Be the first one to run it!

Related benchmarks:

forEach vs reduce vs map vs filter vs for tiny
forEach vs reduce vs map vs filter vs for v2292U9I2JIR2J0IEJ02JE0IJ20EJ
filter map vs reduce
forEach vs reduce vs map vs filter vs for (slightly optimized for)
forEach vs reduce vs map vs filter vs for (slightly optimized for, fixed fn)

Array filter performance (version: 0)

Comparing performance of: filter vs reduce

Created: 5 years ago by: Guest

Jump to the latest result

filter

reduce

Suite status: <idle, ready to run>

Fastest: N/A

Slowest: N/A

No previous run results