Bump to v4.0.2.

This commit is contained in:
John-David Dalton
2016-01-24 22:41:24 -08:00
parent c033f79116
commit a9140d2c8f
545 changed files with 6999 additions and 2625 deletions

View File

@@ -1,5 +1,5 @@
/**
* lodash 4.0.1 (Custom Build) <https://lodash.com/>
* lodash 4.0.2 (Custom Build) <https://lodash.com/>
* Build: `lodash modularize exports="npm" -o ./`
* Copyright 2012-2016 The Dojo Foundation <http://dojofoundation.org/>
* Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
@@ -45,15 +45,17 @@ function baseSortedIndex(array, value, retHighest) {
}
/**
* Uses a binary search to determine the lowest index at which `value` should
* be inserted into `array` in order to maintain its sort order.
* Uses a binary search to determine the lowest index at which `value`
* should be inserted into `array` in order to maintain its sort order.
*
* @static
* @memberOf _
* @since 0.1.0
* @category Array
* @param {Array} array The sorted array to inspect.
* @param {*} value The value to evaluate.
* @returns {number} Returns the index at which `value` should be inserted into `array`.
* @returns {number} Returns the index at which `value` should be inserted
* into `array`.
* @example
*
* _.sortedIndex([30, 50], 40);
@@ -70,6 +72,7 @@ function sortedIndex(array, value) {
* This method returns the first argument given to it.
*
* @static
* @since 0.1.0
* @memberOf _
* @category Util
* @param {*} value Any value.