Bump to v3.10.1.

This commit is contained in:
John-David Dalton
2015-08-03 08:35:01 -07:00
parent 4bd2890bbd
commit 1d77dfa4b7
40 changed files with 53 additions and 52 deletions

View File

@@ -3,7 +3,7 @@ import createSortedIndex from '../internal/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).
*