indexof vs vanilla (v3)

Revision 3 of this benchmark created by Filip Smets on October 20, 2013

Setup

var r;
     var array = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
    
     Array.prototype.indexOf2 = function (searchElement /*, fromIndex */ ) {
        'use strict';
        if (this == null) {
          throw new TypeError();
        }
        var n, k, t = Object(this),
            len = t.length >>> 0;
    
        if (len === 0) {
          return -1;
        }
        n = 0;
        if (arguments.length > 1) {
          n = Number(arguments[1]);
          if (n != n) { // shortcut for verifying if it's NaN
            n = 0;
          } else if (n != 0 && n != Infinity && n != -Infinity) {
            n = (n > 0 || -1) * Math.floor(Math.abs(n));
          }
        }
        if (n >= len) {
          return -1;
        }
        for (k = n >= 0 ? n : Math.max(len - Math.abs(n), 0); k < len; k++) {
          if (k in t && t[k] === searchElement) {
            return k;
          }
        }
        return -1;
      };

Test runner

r = array.indexOf(10);

r = array.indexOf2(array, 10);

Revisions

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

• Revision 3: published by Filip Smets on October 20, 2013