Bump to v3.10.1.

This commit is contained in:
John-David Dalton
2015-12-16 17:52:47 -08:00
parent 75c633becb
commit 94d714007e
40 changed files with 105 additions and 103 deletions

View File

@@ -3,7 +3,7 @@ define(['../internal/createSortedIndex'], function(createSortedIndex) {
/**
* Uses a binary search to determine the lowest index at which `value` should
* be inserted into `array` in order to maintain its sort order. If an iteratee
* function is provided it is invoked for `value` and each element of `array`
* function is provided it's invoked for `value` and each element of `array`
* to compute their sort ranking. The iteratee is bound to `thisArg` and
* invoked with one argument; (value).
*