diff --git a/docs/underscore.html b/docs/underscore.html index 3c213270e..183abb96b 100644 --- a/docs/underscore.html +++ b/docs/underscore.html @@ -198,8 +198,8 @@ (result[key] || (result[key] = [])).push(value); }); return result; - };

Use a comparator function to figure out at what index an object should -be inserted so as to maintain order. Uses binary search.

  _.sortedIndex = function(array, obj, iterator) {
+  };

Use a comparator function to figure out the smallest index at which +an object should be inserted so as to maintain order. Uses binary search.

  _.sortedIndex = function(array, obj, iterator) {
     iterator || (iterator = _.identity);
     var low = 0, high = array.length;
     while (low < high) {
diff --git a/underscore.js b/underscore.js
index 26c69e183..86e555331 100644
--- a/underscore.js
+++ b/underscore.js
@@ -285,8 +285,8 @@
     return result;
   };
 
-  // Use a comparator function to figure out at what index an object should
-  // be inserted so as to maintain order. Uses binary search.
+  // Use a comparator function to figure out the smallest index at which
+  // an object should be inserted so as to maintain order. Uses binary search.
   _.sortedIndex = function(array, obj, iterator) {
     iterator || (iterator = _.identity);
     var low = 0, high = array.length;