merging in faster indexOf patch ... arguably faster than the native implementation, but oh well. #245

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;
   };