fast-array-filter

Benchmark created by John-David Dalton on

Description

This is an Array#filter implementation from a recent 140bytes code golf entry. It's faster than native Array#filter when iterating over large sparse arrays because it doesn't use the length property to calculate when it should stop iterating.

Preparation HTML

<script>
Array.prototype.filter2 = function(
  a, //a function to test each value of the array against. Truthy values will be put into the new array and falsey values will be excluded from the new array
  b, // placeholder
  c, // placeholder 
  d, // placeholder
  e // placeholder
) {
  c = this; // cache the array
  d = []; // array to hold the new values which match the expression
  for (e in c) // for each value in the array, 
    ~~e + '' == e && e >= 0 && // coerce the array position and if valid,
    a.call(b, c[e], +e, c) && // pass the current value into the expression and if truthy,
    d.push(c[e]); // add it to the new array
  
  return d // give back the new array
};
</script>

Setup

var array = [];
    array[200] = 'a';
    
    function callback(v) {
      return /\w+/.test(v);
    }

Test runner

Ready to run.

Testing in
TestOps/sec
native
array.filter(callback);
ready
custom
array.filter2(callback);
ready

Revisions

You can edit these tests or add more tests to this page by appending /edit to the URL.