From f099038a9d85116ea71c5c8914eb7eaa21a56e80 Mon Sep 17 00:00:00 2001
From: Jeremy Ashkenas <jashkenas@gmail.com>
Date: Wed, 13 Jul 2011 15:12:50 -0400
Subject: [PATCH] merging in faster indexOf patch ... arguably faster than the
 native implementation, but oh well. #245

---
 underscore.js | 5 ++---
 1 file changed, 2 insertions(+), 3 deletions(-)

diff --git a/underscore.js b/underscore.js
index ed09b2f68..a73ab93ba 100644
--- a/underscore.js
+++ b/underscore.js
@@ -381,14 +381,13 @@
   // for **isSorted** to use binary search.
   _.indexOf = function(array, item, isSorted) {
     if (array == null) return -1;
-    var i, l;
+    var obj, i = 0;
     if (isSorted) {
       i = _.sortedIndex(array, item);
       return array[i] === item ? i : -1;
     }
     if (nativeIndexOf && array.indexOf === nativeIndexOf) return array.indexOf(item);
-    var o,i=0;
-    while( o = array[i++] ) if (o === item) return i-1;
+    while (obj = array[i++]) if (obj === item) return i - 1;
     return -1;
   };