Menu

jsPerf.app is an online JavaScript performance benchmark test runner & jsperf.com mirror. It is a complete rewrite in homage to the once excellent jsperf.com now with hopefully a more modern & maintainable codebase.

jsperf.com URLs are mirrored at the same path, e.g:

https://jsperf.com/negative-modulo/2

Can be accessed at:

https://jsperf.app/negative-modulo/2

Test case details

Title *

Description
(Markdown syntax is allowed)

Preparation Code

Preparation HTML
(this will be inserted in the <body> of a valid HTML5 document in standards mode)
(useful when testing DOM operations or including libraries)

<script>
  
</script>

Setup JS

// Populate the base array
    var arr = [];
    for (var i = 0; i < 100000; i++) {
      arr[i] = i;
    }
  var len= arr.length;
    function someFn(ix) {
      return ix * 5 + 1 / 3 * 8;
    }

Teardown JS

Test cases

Test #1

Title *

Async

Code *

for (var i = 0, l = arr.length; i !== l; i++) {
  someFn(arr[i]);
}

Test #2

Title *

Async

Code *

for (var i = 0; i < len; i++) {
  someFn(arr[i]);
}

Test #3

Title *

Async

Code *

var i = 0
for (; i < arr[i]; i++) {
  someFn(arr[i]);
}

Test #4

Title *

Async

Code *

for (var i = 0; i < arr.length; i++) {
  someFn(arr[i]);
}

Test #5

Title *

Async

Code *

while( (i = arr.shift()) !== undefined ) {
  someFn(i);
}

Test #6

Title *

Async

Code *

while( i = arr.shift() ) {
  someFn(i);
}

Test #7

Title *

Async

Code *

var i = 0;
while (i < arr.length) {
  someFn(arr[i]);
  i++;
}

Test #8

Title *

Async

Code *

for (var i = 0, len = arr.length; i < len; i++) {
  someFn(arr[i]);
}

Test #9

Title *

Async

Code *

var l = arr.length;
while(l--) {
  someFn(arr[l]);
}