Bump to v4.5.1.

LICENSE

@@ -1,22 +1,23 @@
+The MIT License (MIT)
+
 Copyright 2012-2016 The Dojo Foundation <http://dojofoundation.org/>
 Based on Underscore.js, copyright 2009-2016 Jeremy Ashkenas,
 DocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>
 
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-"Software"), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
 
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
 
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
-LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
-OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
-WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

README.md

@@ -1,4 +1,4 @@
-# lodash-es v4.2.1
+# lodash-es v4.5.1
 
 The [lodash](https://lodash.com/) library exported as [ES](http://www.ecma-international.org/ecma-262/6.0/) modules.
 
@@ -7,4 +7,4 @@ Generated using [lodash-cli](https://www.npmjs.com/package/lodash-cli):
 $ lodash modularize exports=es -o ./
 ```
 
-See the [package source](https://github.com/lodash/lodash/tree/4.2.1-es) for more details.
+See the [package source](https://github.com/lodash/lodash/tree/4.5.1-es) for more details.

_Hash.js

@@ -7,6 +7,7 @@ var objectProto = Object.prototype;
  * Creates an hash object.
  *
  * @private
+ * @constructor
  * @returns {Object} Returns the new hash object.
  */
 function Hash() {}

_LazyWrapper.js

@@ -8,6 +8,7 @@ var MAX_ARRAY_LENGTH = 4294967295;
  * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.
  *
  * @private
+ * @constructor
  * @param {*} value The value to wrap.
  */
 function LazyWrapper(value) {

_MapCache.js

@@ -8,6 +8,7 @@ import mapSet from './_mapSet';
  * Creates a map cache object to store key-value pairs.
  *
  * @private
+ * @constructor
  * @param {Array} [values] The values to cache.
  */
 function MapCache(values) {

_SetCache.js

@@ -6,6 +6,7 @@ import cachePush from './_cachePush';
  * Creates a set cache object to store unique values.
  *
  * @private
+ * @constructor
  * @param {Array} [values] The values to cache.
  */
 function SetCache(values) {

_Stack.js

@@ -8,6 +8,7 @@ import stackSet from './_stackSet';
  * Creates a stack cache object to store key-value pairs.
  *
  * @private
+ * @constructor
  * @param {Array} [values] The values to cache.
  */
 function Stack(values) {

_assignValue.js

@@ -18,8 +18,7 @@ var hasOwnProperty = objectProto.hasOwnProperty;
  */
 function assignValue(object, key, value) {
   var objValue = object[key];
-  if ((!eq(objValue, value) ||
-        (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) ||
+  if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||
       (value === undefined && !(key in object))) {
     object[key] = value;
   }

_baseCastArrayLikeObject.js

@@ -0,0 +1,14 @@
+import isArrayLikeObject from './isArrayLikeObject';
+
+/**
+ * Casts `value` to an empty array if it's not an array like object.
+ *
+ * @private
+ * @param {*} value The value to inspect.
+ * @returns {Array} Returns the array-like object.
+ */
+function baseCastArrayLikeObject(value) {
+  return isArrayLikeObject(value) ? value : [];
+}
+
+export default baseCastArrayLikeObject;

_baseCastFunction.js

@@ -0,0 +1,14 @@
+import identity from './identity';
+
+/**
+ * Casts `value` to `identity` if it's not a function.
+ *
+ * @private
+ * @param {*} value The value to inspect.
+ * @returns {Array} Returns the array-like object.
+ */
+function baseCastFunction(value) {
+  return typeof value == 'function' ? value : identity;
+}
+
+export default baseCastFunction;

_baseCastPath.js

@@ -0,0 +1,15 @@
+import isArray from './isArray';
+import stringToPath from './_stringToPath';
+
+/**
+ * Casts `value` to a path array if it's not one.
+ *
+ * @private
+ * @param {*} value The value to inspect.
+ * @returns {Array} Returns the cast property path array.
+ */
+function baseCastPath(value) {
+  return isArray(value) ? value : stringToPath(value);
+}
+
+export default baseCastPath;

_baseClone.js

@@ -3,6 +3,7 @@ import arrayEach from './_arrayEach';
 import assignValue from './_assignValue';
 import baseAssign from './_baseAssign';
 import baseForOwn from './_baseForOwn';
+import cloneBuffer from './_cloneBuffer';
 import copyArray from './_copyArray';
 import copySymbols from './_copySymbols';
 import getTag from './_getTag';
@@ -10,6 +11,7 @@ import initCloneArray from './_initCloneArray';
 import initCloneByTag from './_initCloneByTag';
 import initCloneObject from './_initCloneObject';
 import isArray from './isArray';
+import isBuffer from './isBuffer';
 import isHostObject from './_isHostObject';
 import isObject from './isObject';
 
@@ -91,6 +93,9 @@ function baseClone(value, isDeep, customizer, key, object, stack) {
     var tag = getTag(value),
         isFunc = tag == funcTag || tag == genTag;
 
+    if (isBuffer(value)) {
+      return cloneBuffer(value, isDeep);
+    }
     if (tag == objectTag || tag == argsTag || (isFunc && !object)) {
       if (isHostObject(value)) {
         return object ? value : {};
@@ -100,9 +105,10 @@ function baseClone(value, isDeep, customizer, key, object, stack) {
         return copySymbols(value, baseAssign(result, value));
       }
     } else {
-      return cloneableTags[tag]
-        ? initCloneByTag(value, tag, isDeep)
-        : (object ? value : {});
+      if (!cloneableTags[tag]) {
+        return object ? value : {};
+      }
+      result = initCloneByTag(value, tag, isDeep);
     }
   }
   // Check for circular references and return its corresponding clone.

_baseCreate.js

@@ -1,5 +1,8 @@
 import isObject from './isObject';
 
+/** Built-in value references. */
+var objectCreate = Object.create;
+
 /**
  * The base implementation of `_.create` without support for assigning
  * properties to the created object.
@@ -8,16 +11,8 @@ import isObject from './isObject';
  * @param {Object} prototype The object to inherit from.
  * @returns {Object} Returns the new object.
  */
-var baseCreate = (function() {
-  function object() {}
-  return function(prototype) {
-    if (isObject(prototype)) {
-      object.prototype = prototype;
-      var result = new object;
-      object.prototype = undefined;
-    }
-    return result || {};
-  };
-}());
+function baseCreate(proto) {
+  return isObject(proto) ? objectCreate(proto) : {};
+}
 
 export default baseCreate;

_baseDelay.js

@@ -8,7 +8,7 @@ var FUNC_ERROR_TEXT = 'Expected a function';
  * @private
  * @param {Function} func The function to delay.
  * @param {number} wait The number of milliseconds to delay invocation.
- * @param {Object} args The arguments provide to `func`.
+ * @param {Object} args The arguments to provide to `func`.
  * @returns {number} Returns the timer id.
  */
 function baseDelay(func, wait, args) {

_baseFlatten.js

@@ -8,12 +8,12 @@ import isArrayLikeObject from './isArrayLikeObject';
  *
  * @private
  * @param {Array} array The array to flatten.
- * @param {boolean} [isDeep] Specify a deep flatten.
+ * @param {number} depth The maximum recursion depth.
  * @param {boolean} [isStrict] Restrict flattening to arrays-like objects.
  * @param {Array} [result=[]] The initial result value.
  * @returns {Array} Returns the new flattened array.
  */
-function baseFlatten(array, isDeep, isStrict, result) {
+function baseFlatten(array, depth, isStrict, result) {
   result || (result = []);
 
   var index = -1,
@@ -21,11 +21,11 @@ function baseFlatten(array, isDeep, isStrict, result) {
 
   while (++index < length) {
     var value = array[index];
-    if (isArrayLikeObject(value) &&
+    if (depth > 0 && isArrayLikeObject(value) &&
         (isStrict || isArray(value) || isArguments(value))) {
-      if (isDeep) {
+      if (depth > 1) {
         // Recursively flatten arrays (susceptible to call stack limits).
-        baseFlatten(value, isDeep, isStrict, result);
+        baseFlatten(value, depth - 1, isStrict, result);
       } else {
         arrayPush(result, value);
       }

_baseFunctions.js

@@ -3,7 +3,7 @@ import isFunction from './isFunction';
 
 /**
  * The base implementation of `_.functions` which creates an array of
- * `object` function property names filtered from those provided.
+ * `object` function property names filtered from `props`.
  *
  * @private
  * @param {Object} object The object to inspect.

_baseGet.js

@@ -1,4 +1,4 @@
-import baseToPath from './_baseToPath';
+import baseCastPath from './_baseCastPath';
 import isKey from './_isKey';
 
 /**
@@ -10,7 +10,7 @@ import isKey from './_isKey';
  * @returns {*} Returns the resolved value.
  */
 function baseGet(object, path) {
-  path = isKey(path, object) ? [path + ''] : baseToPath(path);
+  path = isKey(path, object) ? [path + ''] : baseCastPath(path);
 
   var index = 0,
       length = path.length;

_baseIntersection.js

@@ -42,11 +42,17 @@ function baseIntersection(arrays, iteratee, comparator) {
     var value = array[index],
         computed = iteratee ? iteratee(value) : value;
 
-    if (!(seen ? cacheHas(seen, computed) : includes(result, computed, comparator))) {
+    if (!(seen
+          ? cacheHas(seen, computed)
+          : includes(result, computed, comparator)
+        )) {
       var othIndex = othLength;
       while (--othIndex) {
         var cache = caches[othIndex];
-        if (!(cache ? cacheHas(cache, computed) : includes(arrays[othIndex], computed, comparator))) {
+        if (!(cache
+              ? cacheHas(cache, computed)
+              : includes(arrays[othIndex], computed, comparator))
+            ) {
           continue outer;
         }
       }

_baseInvoke.js

@@ -1,5 +1,5 @@
 import apply from './_apply';
-import baseToPath from './_baseToPath';
+import baseCastPath from './_baseCastPath';
 import isKey from './_isKey';
 import last from './last';
 import parent from './_parent';
@@ -16,7 +16,7 @@ import parent from './_parent';
  */
 function baseInvoke(object, path, args) {
   if (!isKey(path, object)) {
-    path = baseToPath(path);
+    path = baseCastPath(path);
     object = parent(object, path);
     path = last(path);
   }

_baseKeys.js

@@ -6,7 +6,6 @@ var nativeKeys = Object.keys;
  * property of prototypes or treat sparse arrays as dense.
  *
  * @private
- * @type Function
  * @param {Object} object The object to query.
  * @returns {Array} Returns the array of property names.
  */

_baseMerge.js

@@ -21,7 +21,10 @@ function baseMerge(object, source, srcIndex, customizer, stack) {
   if (object === source) {
     return;
   }
-  var props = (isArray(source) || isTypedArray(source)) ? undefined : keysIn(source);
+  var props = (isArray(source) || isTypedArray(source))
+    ? undefined
+    : keysIn(source);
+
   arrayEach(props || source, function(srcValue, key) {
     if (props) {
       key = srcValue;
@@ -32,7 +35,10 @@ function baseMerge(object, source, srcIndex, customizer, stack) {
       baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);
     }
     else {
-      var newValue = customizer ? customizer(object[key], srcValue, (key + ''), object, source, stack) : undefined;
+      var newValue = customizer
+        ? customizer(object[key], srcValue, (key + ''), object, source, stack)
+        : undefined;
+
       if (newValue === undefined) {
         newValue = srcValue;
       }

_baseMergeDeep.js

@@ -33,21 +33,24 @@ function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, sta
     assignMergeValue(object, key, stacked);
     return;
   }
-  var newValue = customizer ? customizer(objValue, srcValue, (key + ''), object, source, stack) : undefined,
-      isCommon = newValue === undefined;
+  var newValue = customizer
+    ? customizer(objValue, srcValue, (key + ''), object, source, stack)
+    : undefined;
+
+  var isCommon = newValue === undefined;
 
   if (isCommon) {
     newValue = srcValue;
     if (isArray(srcValue) || isTypedArray(srcValue)) {
       if (isArray(objValue)) {
-        newValue = srcIndex ? copyArray(objValue) : objValue;
+        newValue = objValue;
       }
       else if (isArrayLikeObject(objValue)) {
         newValue = copyArray(objValue);
       }
       else {
         isCommon = false;
-        newValue = baseClone(srcValue);
+        newValue = baseClone(srcValue, true);
       }
     }
     else if (isPlainObject(srcValue) || isArguments(srcValue)) {
@@ -56,10 +59,10 @@ function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, sta
       }
       else if (!isObject(objValue) || (srcIndex && isFunction(objValue))) {
         isCommon = false;
-        newValue = baseClone(srcValue);
+        newValue = baseClone(srcValue, true);
       }
       else {
-        newValue = srcIndex ? baseClone(objValue) : objValue;
+        newValue = objValue;
       }
     }
     else {

_basePullAt.js

@@ -1,4 +1,4 @@
-import baseToPath from './_baseToPath';
+import baseCastPath from './_baseCastPath';
 import isIndex from './_isIndex';
 import isKey from './_isKey';
 import last from './last';
@@ -31,7 +31,7 @@ function basePullAt(array, indexes) {
         splice.call(array, index, 1);
       }
       else if (!isKey(index, array)) {
-        var path = baseToPath(index),
+        var path = baseCastPath(index),
             object = parent(array, path);
 
         if (object != null) {

_baseSet.js

@@ -1,5 +1,5 @@
 import assignValue from './_assignValue';
-import baseToPath from './_baseToPath';
+import baseCastPath from './_baseCastPath';
 import isIndex from './_isIndex';
 import isKey from './_isKey';
 import isObject from './isObject';
@@ -15,7 +15,7 @@ import isObject from './isObject';
  * @returns {Object} Returns `object`.
  */
 function baseSet(object, path, value, customizer) {
-  path = isKey(path, object) ? [path + ''] : baseToPath(path);
+  path = isKey(path, object) ? [path + ''] : baseCastPath(path);
 
   var index = -1,
       length = path.length,
@@ -30,7 +30,9 @@ function baseSet(object, path, value, customizer) {
         var objValue = nested[key];
         newValue = customizer ? customizer(objValue, key, nested) : undefined;
         if (newValue === undefined) {
-          newValue = objValue == null ? (isIndex(path[index + 1]) ? [] : {}) : objValue;
+          newValue = objValue == null
+            ? (isIndex(path[index + 1]) ? [] : {})
+            : objValue;
         }
       }
       assignValue(nested, key, newValue);

_baseToPath.js

@@ -1,16 +0,0 @@
-import isArray from './isArray';
-import stringToPath from './_stringToPath';
-
-/**
- * The base implementation of `_.toPath` which only converts `value` to a
- * path if it's not one.
- *
- * @private
- * @param {*} value The value to process.
- * @returns {Array} Returns the property path array.
- */
-function baseToPath(value) {
-  return isArray(value) ? value : stringToPath(value);
-}
-
-export default baseToPath;

_baseUnset.js

@@ -1,4 +1,4 @@
-import baseToPath from './_baseToPath';
+import baseCastPath from './_baseCastPath';
 import has from './has';
 import isKey from './_isKey';
 import last from './last';
@@ -13,7 +13,7 @@ import parent from './_parent';
  * @returns {boolean} Returns `true` if the property is deleted, else `false`.
  */
 function baseUnset(object, path) {
-  path = isKey(path, object) ? [path + ''] : baseToPath(path);
+  path = isKey(path, object) ? [path + ''] : baseCastPath(path);
   object = parent(object, path);
   var key = last(path);
   return (object != null && has(object, key)) ? delete object[key] : true;

_cloneArrayBuffer.js

@@ -0,0 +1,19 @@
+import Uint8Array from './_Uint8Array';
+
+/**
+ * Creates a clone of `arrayBuffer`.
+ *
+ * @private
+ * @param {ArrayBuffer} arrayBuffer The array buffer to clone.
+ * @returns {ArrayBuffer} Returns the cloned array buffer.
+ */
+function cloneArrayBuffer(arrayBuffer) {
+  var Ctor = arrayBuffer.constructor,
+      result = new Ctor(arrayBuffer.byteLength),
+      view = new Uint8Array(result);
+
+  view.set(new Uint8Array(arrayBuffer));
+  return result;
+}
+
+export default cloneArrayBuffer;

_cloneBuffer.js

@@ -1,18 +1,19 @@
-import Uint8Array from './_Uint8Array';
-
 /**
- * Creates a clone of `buffer`.
+ * Creates a clone of  `buffer`.
  *
  * @private
- * @param {ArrayBuffer} buffer The array buffer to clone.
- * @returns {ArrayBuffer} Returns the cloned array buffer.
+ * @param {Buffer} buffer The buffer to clone.
+ * @param {boolean} [isDeep] Specify a deep clone.
+ * @returns {Buffer} Returns the cloned buffer.
  */
-function cloneBuffer(buffer) {
+function cloneBuffer(buffer, isDeep) {
+  if (isDeep) {
+    return buffer.slice();
+  }
   var Ctor = buffer.constructor,
-      result = new Ctor(buffer.byteLength),
-      view = new Uint8Array(result);
+      result = new Ctor(buffer.length);
 
-  view.set(new Uint8Array(buffer));
+  buffer.copy(result);
   return result;
 }
 

_cloneTypedArray.js

@@ -1,4 +1,4 @@
-import cloneBuffer from './_cloneBuffer';
+import cloneArrayBuffer from './_cloneArrayBuffer';
 
 /**
  * Creates a clone of `typedArray`.
@@ -9,10 +9,11 @@ import cloneBuffer from './_cloneBuffer';
  * @returns {Object} Returns the cloned typed array.
  */
 function cloneTypedArray(typedArray, isDeep) {
-  var buffer = typedArray.buffer,
+  var arrayBuffer = typedArray.buffer,
+      buffer = isDeep ? cloneArrayBuffer(arrayBuffer) : arrayBuffer,
       Ctor = typedArray.constructor;
 
-  return new Ctor(isDeep ? cloneBuffer(buffer) : buffer, typedArray.byteOffset, typedArray.length);
+  return new Ctor(buffer, typedArray.byteOffset, typedArray.length);
 }
 
 export default cloneTypedArray;

_composeArgs.js

@@ -9,23 +9,28 @@ var nativeMax = Math.max;
  * @param {Array|Object} args The provided arguments.
  * @param {Array} partials The arguments to prepend to those provided.
  * @param {Array} holders The `partials` placeholder indexes.
+ * @params {boolean} [isCurried] Specify composing for a curried function.
  * @returns {Array} Returns the new array of composed arguments.
  */
-function composeArgs(args, partials, holders) {
-  var holdersLength = holders.length,
-      argsIndex = -1,
-      argsLength = nativeMax(args.length - holdersLength, 0),
+function composeArgs(args, partials, holders, isCurried) {
+  var argsIndex = -1,
+      argsLength = args.length,
+      holdersLength = holders.length,
       leftIndex = -1,
       leftLength = partials.length,
-      result = Array(leftLength + argsLength);
+      rangeLength = nativeMax(argsLength - holdersLength, 0),
+      result = Array(leftLength + rangeLength),
+      isUncurried = !isCurried;
 
   while (++leftIndex < leftLength) {
     result[leftIndex] = partials[leftIndex];
   }
   while (++argsIndex < holdersLength) {
-    result[holders[argsIndex]] = args[argsIndex];
+    if (isUncurried || argsIndex < argsLength) {
+      result[holders[argsIndex]] = args[argsIndex];
+    }
   }
-  while (argsLength--) {
+  while (rangeLength--) {
     result[leftIndex++] = args[argsIndex++];
   }
   return result;

_composeArgsRight.js

@@ -9,18 +9,21 @@ var nativeMax = Math.max;
  * @param {Array|Object} args The provided arguments.
  * @param {Array} partials The arguments to append to those provided.
  * @param {Array} holders The `partials` placeholder indexes.
+ * @params {boolean} [isCurried] Specify composing for a curried function.
  * @returns {Array} Returns the new array of composed arguments.
  */
-function composeArgsRight(args, partials, holders) {
-  var holdersIndex = -1,
+function composeArgsRight(args, partials, holders, isCurried) {
+  var argsIndex = -1,
+      argsLength = args.length,
+      holdersIndex = -1,
       holdersLength = holders.length,
-      argsIndex = -1,
-      argsLength = nativeMax(args.length - holdersLength, 0),
       rightIndex = -1,
       rightLength = partials.length,
-      result = Array(argsLength + rightLength);
+      rangeLength = nativeMax(argsLength - holdersLength, 0),
+      result = Array(rangeLength + rightLength),
+      isUncurried = !isCurried;
 
-  while (++argsIndex < argsLength) {
+  while (++argsIndex < rangeLength) {
     result[argsIndex] = args[argsIndex];
   }
   var offset = argsIndex;
@@ -28,7 +31,9 @@ function composeArgsRight(args, partials, holders) {
     result[offset + rightIndex] = partials[rightIndex];
   }
   while (++holdersIndex < holdersLength) {
-    result[offset + holders[holdersIndex]] = args[argsIndex++];
+    if (isUncurried || argsIndex < argsLength) {
+      result[offset + holders[holdersIndex]] = args[argsIndex++];
+    }
   }
   return result;
 }

_copyObjectWith.js

@@ -18,8 +18,11 @@ function copyObjectWith(source, props, object, customizer) {
       length = props.length;
 
   while (++index < length) {
-    var key = props[index],
-        newValue = customizer ? customizer(object[key], source[key], key, object, source) : source[key];
+    var key = props[index];
+
+    var newValue = customizer
+      ? customizer(object[key], source[key], key, object, source)
+      : source[key];
 
     assignValue(object, key, newValue);
   }

_countHolders.js

@@ -0,0 +1,21 @@
+/**
+ * Gets the number of `placeholder` occurrences in `array`.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {*} placeholder The placeholder to search for.
+ * @returns {number} Returns the placeholder count.
+ */
+function countHolders(array, placeholder) {
+  var length = array.length,
+      result = 0;
+
+  while (length--) {
+    if (array[length] === placeholder) {
+      result++;
+    }
+  }
+  return result;
+}
+
+export default countHolders;

_createAssigner.js

@@ -15,7 +15,10 @@ function createAssigner(assigner) {
         customizer = length > 1 ? sources[length - 1] : undefined,
         guard = length > 2 ? sources[2] : undefined;
 
-    customizer = typeof customizer == 'function' ? (length--, customizer) : undefined;
+    customizer = typeof customizer == 'function'
+      ? (length--, customizer)
+      : undefined;
+
     if (guard && isIterateeCall(sources[0], sources[1], guard)) {
       customizer = length < 3 ? undefined : customizer;
       length = 1;

_createCaseFirst.js

@@ -24,8 +24,11 @@ function createCaseFirst(methodName) {
   return function(string) {
     string = toString(string);
 
-    var strSymbols = reHasComplexSymbol.test(string) ? stringToArray(string) : undefined,
-        chr = strSymbols ? strSymbols[0] : string.charAt(0),
+    var strSymbols = reHasComplexSymbol.test(string)
+      ? stringToArray(string)
+      : undefined;
+
+    var chr = strSymbols ? strSymbols[0] : string.charAt(0),
         trailing = strSymbols ? strSymbols.slice(1).join('') : string.slice(1);
 
     return chr[methodName]() + trailing;

_createCurryWrapper.js

@@ -2,6 +2,7 @@ import apply from './_apply';
 import createCtorWrapper from './_createCtorWrapper';
 import createHybridWrapper from './_createHybridWrapper';
 import createRecurryWrapper from './_createRecurryWrapper';
+import getPlaceholder from './_getPlaceholder';
 import replaceHolders from './_replaceHolders';
 import root from './_root';
 
@@ -19,10 +20,9 @@ function createCurryWrapper(func, bitmask, arity) {
 
   function wrapper() {
     var length = arguments.length,
-        index = length,
         args = Array(length),
-        fn = (this && this !== root && this instanceof wrapper) ? Ctor : func,
-        placeholder = wrapper.placeholder;
+        index = length,
+        placeholder = getPlaceholder(wrapper);
 
     while (index--) {
       args[index] = arguments[index];
@@ -32,9 +32,13 @@ function createCurryWrapper(func, bitmask, arity) {
       : replaceHolders(args, placeholder);
 
     length -= holders.length;
-    return length < arity
-      ? createRecurryWrapper(func, bitmask, createHybridWrapper, placeholder, undefined, args, holders, undefined, undefined, arity - length)
-      : apply(fn, this, args);
+    if (length < arity) {
+      return createRecurryWrapper(
+        func, bitmask, createHybridWrapper, wrapper.placeholder, undefined,
+        args, holders, undefined, undefined, arity - length);
+    }
+    var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;
+    return apply(fn, this, args);
   }
   return wrapper;
 }

_createFlow.js

@@ -27,7 +27,7 @@ var FUNC_ERROR_TEXT = 'Expected a function';
  */
 function createFlow(fromRight) {
   return rest(function(funcs) {
-    funcs = baseFlatten(funcs);
+    funcs = baseFlatten(funcs, 1);
 
     var length = funcs.length,
         index = length,
@@ -52,7 +52,10 @@ function createFlow(fromRight) {
       var funcName = getFuncName(func),
           data = funcName == 'wrapper' ? getData(func) : undefined;
 
-      if (data && isLaziable(data[0]) && data[1] == (ARY_FLAG | CURRY_FLAG | PARTIAL_FLAG | REARG_FLAG) && !data[4].length && data[9] == 1) {
+      if (data && isLaziable(data[0]) &&
+            data[1] == (ARY_FLAG | CURRY_FLAG | PARTIAL_FLAG | REARG_FLAG) &&
+            !data[4].length && data[9] == 1
+          ) {
         wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);
       } else {
         wrapper = (func.length == 1 && isLaziable(func)) ? wrapper[funcName]() : wrapper.thru(func);
@@ -62,7 +65,8 @@ function createFlow(fromRight) {
       var args = arguments,
           value = args[0];
 
-      if (wrapper && args.length == 1 && isArray(value) && value.length >= LARGE_ARRAY_SIZE) {
+      if (wrapper && args.length == 1 &&
+          isArray(value) && value.length >= LARGE_ARRAY_SIZE) {
         return wrapper.plant(value).value();
       }
       var index = 0,

_createHybridWrapper.js

@@ -1,7 +1,9 @@
 import composeArgs from './_composeArgs';
 import composeArgsRight from './_composeArgsRight';
+import countHolders from './_countHolders';
 import createCtorWrapper from './_createCtorWrapper';
 import createRecurryWrapper from './_createRecurryWrapper';
+import getPlaceholder from './_getPlaceholder';
 import reorder from './_reorder';
 import replaceHolders from './_replaceHolders';
 import root from './_root';
@@ -35,8 +37,7 @@ function createHybridWrapper(func, bitmask, thisArg, partials, holders, partials
   var isAry = bitmask & ARY_FLAG,
       isBind = bitmask & BIND_FLAG,
       isBindKey = bitmask & BIND_KEY_FLAG,
-      isCurry = bitmask & CURRY_FLAG,
-      isCurryRight = bitmask & CURRY_RIGHT_FLAG,
+      isCurried = bitmask & (CURRY_FLAG | CURRY_RIGHT_FLAG),
       isFlip = bitmask & FLIP_FLAG,
       Ctor = isBindKey ? undefined : createCtorWrapper(func);
 
@@ -48,30 +49,34 @@ function createHybridWrapper(func, bitmask, thisArg, partials, holders, partials
     while (index--) {
       args[index] = arguments[index];
     }
+    if (isCurried) {
+      var placeholder = getPlaceholder(wrapper),
+          holdersCount = countHolders(args, placeholder);
+    }
     if (partials) {
-      args = composeArgs(args, partials, holders);
+      args = composeArgs(args, partials, holders, isCurried);
     }
     if (partialsRight) {
-      args = composeArgsRight(args, partialsRight, holdersRight);
+      args = composeArgsRight(args, partialsRight, holdersRight, isCurried);
     }
-    if (isCurry || isCurryRight) {
-      var placeholder = wrapper.placeholder,
-          argsHolders = replaceHolders(args, placeholder);
-
-      length -= argsHolders.length;
-      if (length < arity) {
-        return createRecurryWrapper(func, bitmask, createHybridWrapper, placeholder, thisArg, args, argsHolders, argPos, ary, arity - length);
-      }
+    length -= holdersCount;
+    if (isCurried && length < arity) {
+      var newHolders = replaceHolders(args, placeholder);
+      return createRecurryWrapper(
+        func, bitmask, createHybridWrapper, wrapper.placeholder, thisArg,
+        args, newHolders, argPos, ary, arity - length
+      );
     }
     var thisBinding = isBind ? thisArg : this,
         fn = isBindKey ? thisBinding[func] : func;
 
+    length = args.length;
     if (argPos) {
       args = reorder(args, argPos);
-    } else if (isFlip && args.length > 1) {
+    } else if (isFlip && length > 1) {
       args.reverse();
     }
-    if (isAry && ary < args.length) {
+    if (isAry && ary < length) {
       args.length = ary;
     }
     if (this && this !== root && this instanceof wrapper) {

_createOver.js

@@ -13,7 +13,7 @@ import rest from './rest';
  */
 function createOver(arrayFunc) {
   return rest(function(iteratees) {
-    iteratees = arrayMap(baseFlatten(iteratees), baseIteratee);
+    iteratees = arrayMap(baseFlatten(iteratees, 1), baseIteratee);
     return rest(function(args) {
       var thisArg = this;
       return arrayFunc(iteratees, function(iteratee) {

_createRecurryWrapper.js

@@ -17,7 +17,7 @@ var BIND_FLAG = 1,
  * @param {Function} func The function to wrap.
  * @param {number} bitmask The bitmask of wrapper flags. See `createWrapper` for more details.
  * @param {Function} wrapFunc The function to create the `func` wrapper.
- * @param {*} placeholder The placeholder to replace.
+ * @param {*} placeholder The placeholder value.
  * @param {*} [thisArg] The `this` binding of `func`.
  * @param {Array} [partials] The arguments to prepend to those provided to the new function.
  * @param {Array} [holders] The `partials` placeholder indexes.
@@ -29,7 +29,7 @@ var BIND_FLAG = 1,
 function createRecurryWrapper(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {
   var isCurry = bitmask & CURRY_FLAG,
       newArgPos = argPos ? copyArray(argPos) : undefined,
-      newsHolders = isCurry ? holders : undefined,
+      newHolders = isCurry ? holders : undefined,
       newHoldersRight = isCurry ? undefined : holders,
       newPartials = isCurry ? partials : undefined,
       newPartialsRight = isCurry ? undefined : partials;
@@ -40,9 +40,12 @@ function createRecurryWrapper(func, bitmask, wrapFunc, placeholder, thisArg, par
   if (!(bitmask & CURRY_BOUND_FLAG)) {
     bitmask &= ~(BIND_FLAG | BIND_KEY_FLAG);
   }
-  var newData = [func, bitmask, thisArg, newPartials, newsHolders, newPartialsRight, newHoldersRight, newArgPos, ary, arity],
-      result = wrapFunc.apply(undefined, newData);
+  var newData = [
+    func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,
+    newHoldersRight, newArgPos, ary, arity
+  ];
 
+  var result = wrapFunc.apply(undefined, newData);
   if (isLaziable(func)) {
     setData(result, newData);
   }

_createWrapper.js

@@ -67,8 +67,12 @@ function createWrapper(func, bitmask, thisArg, partials, holders, argPos, ary, a
 
     partials = holders = undefined;
   }
-  var data = isBindKey ? undefined : getData(func),
-      newData = [func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity];
+  var data = isBindKey ? undefined : getData(func);
+
+  var newData = [
+    func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,
+    argPos, ary, arity
+  ];
 
   if (data) {
     mergeData(newData, data);

_getPlaceholder.js

@@ -0,0 +1,13 @@
+/**
+ * Gets the argument placeholder value for `func`.
+ *
+ * @private
+ * @param {Function} func The function to inspect.
+ * @returns {*} Returns the placeholder value.
+ */
+function getPlaceholder(func) {
+  var object = func;
+  return object.placeholder;
+}
+
+export default getPlaceholder;

_getTag.js

@@ -1,10 +1,12 @@
 import Map from './_Map';
 import Set from './_Set';
+import WeakMap from './_WeakMap';
 
 /** `Object#toString` result references. */
 var mapTag = '[object Map]',
     objectTag = '[object Object]',
-    setTag = '[object Set]';
+    setTag = '[object Set]',
+    weakMapTag = '[object WeakMap]';
 
 /** Used for built-in method references. */
 var objectProto = Object.prototype;
@@ -18,9 +20,10 @@ var funcToString = Function.prototype.toString;
  */
 var objectToString = objectProto.toString;
 
-/** Used to detect maps and sets. */
+/** Used to detect maps, sets, and weakmaps. */
 var mapCtorString = Map ? funcToString.call(Map) : '',
-    setCtorString = Set ? funcToString.call(Set) : '';
+    setCtorString = Set ? funcToString.call(Set) : '',
+    weakMapCtorString = WeakMap ? funcToString.call(WeakMap) : '';
 
 /**
  * Gets the `toStringTag` of `value`.
@@ -33,19 +36,20 @@ function getTag(value) {
   return objectToString.call(value);
 }
 
-// Fallback for IE 11 providing `toStringTag` values for maps and sets.
-if ((Map && getTag(new Map) != mapTag) || (Set && getTag(new Set) != setTag)) {
+// Fallback for IE 11 providing `toStringTag` values for maps, sets, and weakmaps.
+if ((Map && getTag(new Map) != mapTag) ||
+    (Set && getTag(new Set) != setTag) ||
+    (WeakMap && getTag(new WeakMap) != weakMapTag)) {
   getTag = function(value) {
     var result = objectToString.call(value),
         Ctor = result == objectTag ? value.constructor : null,
         ctorString = typeof Ctor == 'function' ? funcToString.call(Ctor) : '';
 
     if (ctorString) {
-      if (ctorString == mapCtorString) {
-        return mapTag;
-      }
-      if (ctorString == setCtorString) {
-        return setTag;
+      switch (ctorString) {
+        case mapCtorString: return mapTag;
+        case setCtorString: return setTag;
+        case weakMapCtorString: return weakMapTag;
       }
     }
     return result;

_hasPath.js

@@ -1,4 +1,4 @@
-import baseToPath from './_baseToPath';
+import baseCastPath from './_baseCastPath';
 import isArguments from './isArguments';
 import isArray from './isArray';
 import isIndex from './_isIndex';
@@ -23,7 +23,7 @@ function hasPath(object, path, hasFunc) {
   }
   var result = hasFunc(object, path);
   if (!result && !isKey(path)) {
-    path = baseToPath(path);
+    path = baseCastPath(path);
     object = parent(object, path);
     if (object != null) {
       path = last(path);

_initCloneByTag.js

@@ -1,4 +1,4 @@
-import cloneBuffer from './_cloneBuffer';
+import cloneArrayBuffer from './_cloneArrayBuffer';
 import cloneMap from './_cloneMap';
 import cloneRegExp from './_cloneRegExp';
 import cloneSet from './_cloneSet';
@@ -42,7 +42,7 @@ function initCloneByTag(object, tag, isDeep) {
   var Ctor = object.constructor;
   switch (tag) {
     case arrayBufferTag:
-      return cloneBuffer(object);
+      return cloneArrayBuffer(object);
 
     case boolTag:
     case dateTag:

_initCloneObject.js

@@ -2,6 +2,9 @@ import baseCreate from './_baseCreate';
 import isFunction from './isFunction';
 import isPrototype from './_isPrototype';
 
+/** Built-in value references. */
+var getPrototypeOf = Object.getPrototypeOf;
+
 /**
  * Initializes an object clone.
  *
@@ -10,11 +13,9 @@ import isPrototype from './_isPrototype';
  * @returns {Object} Returns the initialized clone.
  */
 function initCloneObject(object) {
-  if (isPrototype(object)) {
-    return {};
-  }
-  var Ctor = object.constructor;
-  return baseCreate(isFunction(Ctor) ? Ctor.prototype : undefined);
+  return (isFunction(object.constructor) && !isPrototype(object))
+    ? baseCreate(getPrototypeOf(object))
+    : {};
 }
 
 export default initCloneObject;

_isIterateeCall.js

@@ -4,7 +4,7 @@ import isIndex from './_isIndex';
 import isObject from './isObject';
 
 /**
- * Checks if the provided arguments are from an iteratee call.
+ * Checks if the given arguments are from an iteratee call.
  *
  * @private
  * @param {*} value The potential iteratee value argument.

_isKeyable.js

@@ -8,7 +8,7 @@
 function isKeyable(value) {
   var type = typeof value;
   return type == 'number' || type == 'boolean' ||
-    (type == 'string' && value !== '__proto__') || value == null;
+    (type == 'string' && value != '__proto__') || value == null;
 }
 
 export default isKeyable;

_isPrototype.js

@@ -1,3 +1,5 @@
+import isFunction from './isFunction';
+
 /** Used for built-in method references. */
 var objectProto = Object.prototype;
 
@@ -10,7 +12,7 @@ var objectProto = Object.prototype;
  */
 function isPrototype(value) {
   var Ctor = value && value.constructor,
-      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;
+      proto = (isFunction(Ctor) && Ctor.prototype) || objectProto;
 
   return value === proto;
 }

_lazyValue.js

@@ -36,7 +36,8 @@ function lazyValue() {
       resIndex = 0,
       takeCount = nativeMin(length, this.__takeCount__);
 
-  if (!isArr || arrLength < LARGE_ARRAY_SIZE || (arrLength == length && takeCount == length)) {
+  if (!isArr || arrLength < LARGE_ARRAY_SIZE ||
+      (arrLength == length && takeCount == length)) {
     return baseWrapperValue(array, this.__actions__);
   }
   var result = [];

_mapClear.js

@@ -9,7 +9,11 @@ import Map from './_Map';
  * @memberOf MapCache
  */
 function mapClear() {
-  this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };
+  this.__data__ = {
+    'hash': new Hash,
+    'map': Map ? new Map : [],
+    'string': new Hash
+  };
 }
 
 export default mapClear;

_mergeData.js

@@ -39,9 +39,9 @@ function mergeData(data, source) {
       isCommon = newBitmask < (BIND_FLAG | BIND_KEY_FLAG | ARY_FLAG);
 
   var isCombo =
-    (srcBitmask == ARY_FLAG && (bitmask == CURRY_FLAG)) ||
-    (srcBitmask == ARY_FLAG && (bitmask == REARG_FLAG) && (data[7].length <= source[8])) ||
-    (srcBitmask == (ARY_FLAG | REARG_FLAG) && (source[7].length <= source[8]) && (bitmask == CURRY_FLAG));
+    ((srcBitmask == ARY_FLAG) && (bitmask == CURRY_FLAG)) ||
+    ((srcBitmask == ARY_FLAG) && (bitmask == REARG_FLAG) && (data[7].length <= source[8])) ||
+    ((srcBitmask == (ARY_FLAG | REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == CURRY_FLAG));
 
   // Exit early if metadata can't be merged.
   if (!(isCommon || isCombo)) {
@@ -51,7 +51,7 @@ function mergeData(data, source) {
   if (srcBitmask & BIND_FLAG) {
     data[2] = source[2];
     // Set when currying a bound function.
-    newBitmask |= (bitmask & BIND_FLAG) ? 0 : CURRY_BOUND_FLAG;
+    newBitmask |= bitmask & BIND_FLAG ? 0 : CURRY_BOUND_FLAG;
   }
   // Compose partial arguments.
   var value = source[3];

_replaceHolders.js

@@ -17,7 +17,8 @@ function replaceHolders(array, placeholder) {
       result = [];
 
   while (++index < length) {
-    if (array[index] === placeholder) {
+    var value = array[index];
+    if (value === placeholder || value === PLACEHOLDER) {
       array[index] = PLACEHOLDER;
       result[++resIndex] = index;
     }

_root.js

@@ -7,10 +7,14 @@ var objectTypes = {
 };
 
 /** Detect free variable `exports`. */
-var freeExports = (objectTypes[typeof exports] && exports && !exports.nodeType) ? exports : null;
+var freeExports = (objectTypes[typeof exports] && exports && !exports.nodeType)
+  ? exports
+  : undefined;
 
 /** Detect free variable `module`. */
-var freeModule = (objectTypes[typeof module] && module && !module.nodeType) ? module : null;
+var freeModule = (objectTypes[typeof module] && module && !module.nodeType)
+  ? module
+  : undefined;
 
 /** Detect free variable `global` from Node.js. */
 var freeGlobal = checkGlobal(freeExports && freeModule && typeof global == 'object' && global);
@@ -30,6 +34,8 @@ var thisGlobal = checkGlobal(objectTypes[typeof this] && this);
  * The `this` value is used if it's the global object to avoid Greasemonkey's
  * restricted `window` object, otherwise the `window` object is used.
  */
-var root = freeGlobal || ((freeWindow !== (thisGlobal && thisGlobal.window)) && freeWindow) || freeSelf || thisGlobal || Function('return this')();
+var root = freeGlobal ||
+  ((freeWindow !== (thisGlobal && thisGlobal.window)) && freeWindow) ||
+    freeSelf || thisGlobal || Function('return this')();
 
 export default root;

_toArrayLikeObject.js

@@ -1,14 +0,0 @@
-import isArrayLikeObject from './isArrayLikeObject';
-
-/**
- * Converts `value` to an array-like object if it's not one.
- *
- * @private
- * @param {*} value The value to process.
- * @returns {Array} Returns the array-like object.
- */
-function toArrayLikeObject(value) {
-  return isArrayLikeObject(value) ? value : [];
-}
-
-export default toArrayLikeObject;

_toFunction.js

@@ -1,14 +0,0 @@
-import identity from './identity';
-
-/**
- * Converts `value` to a function if it's not one.
- *
- * @private
- * @param {*} value The value to process.
- * @returns {Function} Returns the function.
- */
-function toFunction(value) {
-  return typeof value == 'function' ? value : identity;
-}
-
-export default toFunction;

add.js

@@ -14,6 +14,9 @@
  */
 function add(augend, addend) {
   var result;
+  if (augend === undefined && addend === undefined) {
+    return 0;
+  }
   if (augend !== undefined) {
     result = augend;
   }

array.default.js

@@ -13,6 +13,7 @@ import findIndex from './findIndex';
 import findLastIndex from './findLastIndex';
 import flatten from './flatten';
 import flattenDeep from './flattenDeep';
+import flattenDepth from './flattenDepth';
 import fromPairs from './fromPairs';
 import head from './head';
 import indexOf from './indexOf';
@@ -64,14 +65,14 @@ export default {
   chunk, compact, concat, difference, differenceBy,
   differenceWith, drop, dropRight, dropRightWhile, dropWhile,
   fill, findIndex, findLastIndex, flatten, flattenDeep,
-  fromPairs, head, indexOf, initial, intersection,
-  intersectionBy, intersectionWith, join, last, lastIndexOf,
-  pull, pullAll, pullAllBy, pullAt, remove,
-  reverse, slice, sortedIndex, sortedIndexBy, sortedIndexOf,
-  sortedLastIndex, sortedLastIndexBy, sortedLastIndexOf, sortedUniq, sortedUniqBy,
-  tail, take, takeRight, takeRightWhile, takeWhile,
-  union, unionBy, unionWith, uniq, uniqBy,
-  uniqWith, unzip, unzipWith, without, xor,
-  xorBy, xorWith, zip, zipObject, zipObjectDeep,
-  zipWith
+  flattenDepth, fromPairs, head, indexOf, initial,
+  intersection, intersectionBy, intersectionWith, join, last,
+  lastIndexOf, pull, pullAll, pullAllBy, pullAt,
+  remove, reverse, slice, sortedIndex, sortedIndexBy,
+  sortedIndexOf, sortedLastIndex, sortedLastIndexBy, sortedLastIndexOf, sortedUniq,
+  sortedUniqBy, tail, take, takeRight, takeRightWhile,
+  takeWhile, union, unionBy, unionWith, uniq,
+  uniqBy, uniqWith, unzip, unzipWith, without,
+  xor, xorBy, xorWith, zip, zipObject,
+  zipObjectDeep, zipWith
 };

array.js

@@ -13,6 +13,7 @@ export { default as findIndex } from './findIndex';
 export { default as findLastIndex } from './findLastIndex';
 export { default as flatten } from './flatten';
 export { default as flattenDeep } from './flattenDeep';
+export { default as flattenDepth } from './flattenDepth';
 export { default as fromPairs } from './fromPairs';
 export { default as head } from './head';
 export { default as indexOf } from './indexOf';

at.js

@@ -23,7 +23,7 @@ import rest from './rest';
  * // => ['a', 'c']
  */
 var at = rest(function(object, paths) {
-  return baseAt(object, baseFlatten(paths));
+  return baseAt(object, baseFlatten(paths, 1));
 });
 
 export default at;

attempt.js

@@ -1,5 +1,5 @@
 import apply from './_apply';
-import isObject from './isObject';
+import isError from './isError';
 import rest from './rest';
 
 /**
@@ -26,7 +26,7 @@ var attempt = rest(function(func, args) {
   try {
     return apply(func, undefined, args);
   } catch (e) {
-    return isObject(e) ? e : new Error(e);
+    return isError(e) ? e : new Error(e);
   }
 });
 

bind.js

@@ -1,4 +1,5 @@
 import createWrapper from './_createWrapper';
+import getPlaceholder from './_getPlaceholder';
 import replaceHolders from './_replaceHolders';
 import rest from './rest';
 
@@ -44,12 +45,13 @@ var BIND_FLAG = 1,
 var bind = rest(function(func, thisArg, partials) {
   var bitmask = BIND_FLAG;
   if (partials.length) {
-    var placeholder = bind.placeholder,
-        holders = replaceHolders(partials, placeholder);
-
+    var holders = replaceHolders(partials, getPlaceholder(bind));
     bitmask |= PARTIAL_FLAG;
   }
   return createWrapper(func, bitmask, thisArg, partials, holders);
 });
 
+// Assign default placeholders.
+bind.placeholder = {};
+
 export default bind;

bindAll.js

@@ -30,7 +30,7 @@ import rest from './rest';
  * // => logs 'clicked docs' when clicked
  */
 var bindAll = rest(function(object, methodNames) {
-  arrayEach(baseFlatten(methodNames), function(key) {
+  arrayEach(baseFlatten(methodNames, 1), function(key) {
     object[key] = bind(object[key], object);
   });
   return object;

bindKey.js

@@ -1,4 +1,5 @@
 import createWrapper from './_createWrapper';
+import getPlaceholder from './_getPlaceholder';
 import replaceHolders from './_replaceHolders';
 import rest from './rest';
 
@@ -54,12 +55,13 @@ var BIND_FLAG = 1,
 var bindKey = rest(function(object, key, partials) {
   var bitmask = BIND_FLAG | BIND_KEY_FLAG;
   if (partials.length) {
-    var placeholder = bindKey.placeholder,
-        holders = replaceHolders(partials, placeholder);
-
+    var holders = replaceHolders(partials, getPlaceholder(bindKey));
     bitmask |= PARTIAL_FLAG;
   }
   return createWrapper(key, bitmask, object, partials, holders);
 });
 
+// Assign default placeholders.
+bindKey.placeholder = {};
+
 export default bindKey;

castArray.js

@@ -0,0 +1,43 @@
+import isArray from './isArray';
+
+/**
+ * Casts `value` as an array if it's not one.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to inspect.
+ * @returns {Array} Returns the cast array.
+ * @example
+ *
+ * _.castArray(1);
+ * // => [1]
+ *
+ * _.castArray({ 'a': 1 });
+ * // => [{ 'a': 1 }]
+ *
+ * _.castArray('abc');
+ * // => ['abc']
+ *
+ * _.castArray(null);
+ * // => [null]
+ *
+ * _.castArray(undefined);
+ * // => [undefined]
+ *
+ * _.castArray();
+ * // => []
+ *
+ * var array = [1, 2, 3];
+ * console.log(_.castArray(array) === array);
+ * // => true
+ */
+function castArray() {
+  if (!arguments.length) {
+    return [];
+  }
+  var value = arguments[0];
+  return isArray(value) ? value : [value];
+}
+
+export default castArray;

concat.js

@@ -28,7 +28,7 @@ var concat = rest(function(array, values) {
   if (!isArray(array)) {
     array = array == null ? [] : [Object(array)];
   }
-  values = baseFlatten(values);
+  values = baseFlatten(values, 1);
   return arrayConcat(array, values);
 });
 

create.js

@@ -3,7 +3,7 @@ import baseCreate from './_baseCreate';
 
 /**
  * Creates an object that inherits from the `prototype` object. If a `properties`
- * object is provided its own enumerable properties are assigned to the created object.
+ * object is given its own enumerable properties are assigned to the created object.
  *
  * @static
  * @memberOf _

curry.js

@@ -50,4 +50,7 @@ function curry(func, arity, guard) {
   return result;
 }
 
+// Assign default placeholders.
+curry.placeholder = {};
+
 export default curry;

curryRight.js

@@ -47,4 +47,7 @@ function curryRight(func, arity, guard) {
   return result;
 }
 
+// Assign default placeholders.
+curryRight.placeholder = {};
+
 export default curryRight;

debounce.js

@@ -135,11 +135,13 @@ function debounce(func, wait, options) {
     if (maxWait === false) {
       var leadingCall = leading && !timeoutId;
     } else {
-      if (!maxTimeoutId && !leading) {
+      if (!lastCalled && !maxTimeoutId && !leading) {
         lastCalled = stamp;
       }
-      var remaining = maxWait - (stamp - lastCalled),
-          isCalled = remaining <= 0 || remaining > maxWait;
+      var remaining = maxWait - (stamp - lastCalled);
+
+      var isCalled = (remaining <= 0 || remaining > maxWait) &&
+        (leading || maxTimeoutId);
 
       if (isCalled) {
         if (maxTimeoutId) {

difference.js

@@ -5,7 +5,7 @@ import rest from './rest';
 
 /**
  * Creates an array of unique `array` values not included in the other
- * provided arrays using [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
+ * given arrays using [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
  * for equality comparisons.
  *
  * @static
@@ -21,7 +21,7 @@ import rest from './rest';
  */
 var difference = rest(function(array, values) {
   return isArrayLikeObject(array)
-    ? baseDifference(array, baseFlatten(values, false, true))
+    ? baseDifference(array, baseFlatten(values, 1, true))
     : [];
 });
 

differenceBy.js

@@ -32,7 +32,7 @@ var differenceBy = rest(function(array, values) {
     iteratee = undefined;
   }
   return isArrayLikeObject(array)
-    ? baseDifference(array, baseFlatten(values, false, true), baseIteratee(iteratee))
+    ? baseDifference(array, baseFlatten(values, 1, true), baseIteratee(iteratee))
     : [];
 });
 

differenceWith.js

@@ -29,7 +29,7 @@ var differenceWith = rest(function(array, values) {
     comparator = undefined;
   }
   return isArrayLikeObject(array)
-    ? baseDifference(array, baseFlatten(values, false, true), undefined, comparator)
+    ? baseDifference(array, baseFlatten(values, 1, true), undefined, comparator)
     : [];
 });
 

flatMap.js

@@ -22,7 +22,7 @@ import map from './map';
  * // => [1, 1, 2, 2]
  */
 function flatMap(collection, iteratee) {
-  return baseFlatten(map(collection, iteratee));
+  return baseFlatten(map(collection, iteratee), 1);
 }
 
 export default flatMap;

flatten.js

@@ -1,7 +1,7 @@
 import baseFlatten from './_baseFlatten';
 
 /**
- * Flattens `array` a single level.
+ * Flattens `array` a single level deep.
  *
  * @static
  * @memberOf _
@@ -10,12 +10,12 @@ import baseFlatten from './_baseFlatten';
  * @returns {Array} Returns the new flattened array.
  * @example
  *
- * _.flatten([1, [2, 3, [4]]]);
- * // => [1, 2, 3, [4]]
+ * _.flatten([1, [2, [3, [4]], 5]]);
+ * // => [1, 2, [3, [4]], 5]
  */
 function flatten(array) {
   var length = array ? array.length : 0;
-  return length ? baseFlatten(array) : [];
+  return length ? baseFlatten(array, 1) : [];
 }
 
 export default flatten;

flattenDeep.js

@@ -1,21 +1,24 @@
 import baseFlatten from './_baseFlatten';
 
+/** Used as references for various `Number` constants. */
+var INFINITY = 1 / 0;
+
 /**
- * This method is like `_.flatten` except that it recursively flattens `array`.
+ * Recursively flattens `array`.
  *
  * @static
  * @memberOf _
  * @category Array
- * @param {Array} array The array to recursively flatten.
+ * @param {Array} array The array to flatten.
  * @returns {Array} Returns the new flattened array.
  * @example
  *
- * _.flattenDeep([1, [2, 3, [4]]]);
- * // => [1, 2, 3, 4]
+ * _.flattenDeep([1, [2, [3, [4]], 5]]);
+ * // => [1, 2, 3, 4, 5]
  */
 function flattenDeep(array) {
   var length = array ? array.length : 0;
-  return length ? baseFlatten(array, true) : [];
+  return length ? baseFlatten(array, INFINITY) : [];
 }
 
 export default flattenDeep;

flattenDepth.js

@@ -0,0 +1,32 @@
+import baseFlatten from './_baseFlatten';
+import toInteger from './toInteger';
+
+/**
+ * Recursively flatten `array` up to `depth` times.
+ *
+ * @static
+ * @memberOf _
+ * @category Array
+ * @param {Array} array The array to flatten.
+ * @param {number} [depth=1] The maximum recursion depth.
+ * @returns {Array} Returns the new flattened array.
+ * @example
+ *
+ * var array = [1, [2, [3, [4]], 5]];
+ *
+ * _.flattenDepth(array, 1);
+ * // => [1, 2, [3, [4]], 5]
+ *
+ * _.flattenDepth(array, 2);
+ * // => [1, 2, 3, [4], 5]
+ */
+function flattenDepth(array, depth) {
+  var length = array ? array.length : 0;
+  if (!length) {
+    return [];
+  }
+  depth = depth === undefined ? 1 : toInteger(depth);
+  return baseFlatten(array, depth);
+}
+
+export default flattenDepth;

flow.js

@@ -1,9 +1,9 @@
 import createFlow from './_createFlow';
 
 /**
- * Creates a function that returns the result of invoking the provided
- * functions with the `this` binding of the created function, where each
- * successive invocation is supplied the return value of the previous.
+ * Creates a function that returns the result of invoking the given functions
+ * with the `this` binding of the created function, where each successive
+ * invocation is supplied the return value of the previous.
  *
  * @static
  * @memberOf _

flowRight.js

@@ -2,7 +2,7 @@ import createFlow from './_createFlow';
 
 /**
  * This method is like `_.flow` except that it creates a function that
- * invokes the provided functions from right to left.
+ * invokes the given functions from right to left.
  *
  * @static
  * @memberOf _

forEach.js

@@ -1,7 +1,7 @@
 import arrayEach from './_arrayEach';
+import baseCastFunction from './_baseCastFunction';
 import baseEach from './_baseEach';
 import isArray from './isArray';
-import toFunction from './_toFunction';
 
 /**
  * Iterates over elements of `collection` invoking `iteratee` for each element.
@@ -34,7 +34,7 @@ import toFunction from './_toFunction';
 function forEach(collection, iteratee) {
   return (typeof iteratee == 'function' && isArray(collection))
     ? arrayEach(collection, iteratee)
-    : baseEach(collection, toFunction(iteratee));
+    : baseEach(collection, baseCastFunction(iteratee));
 }
 
 export default forEach;

forEachRight.js

@@ -1,7 +1,7 @@
 import arrayEachRight from './_arrayEachRight';
+import baseCastFunction from './_baseCastFunction';
 import baseEachRight from './_baseEachRight';
 import isArray from './isArray';
-import toFunction from './_toFunction';
 
 /**
  * This method is like `_.forEach` except that it iterates over elements of
@@ -24,7 +24,7 @@ import toFunction from './_toFunction';
 function forEachRight(collection, iteratee) {
   return (typeof iteratee == 'function' && isArray(collection))
     ? arrayEachRight(collection, iteratee)
-    : baseEachRight(collection, toFunction(iteratee));
+    : baseEachRight(collection, baseCastFunction(iteratee));
 }
 
 export default forEachRight;

forIn.js

@@ -1,6 +1,6 @@
+import baseCastFunction from './_baseCastFunction';
 import baseFor from './_baseFor';
 import keysIn from './keysIn';
-import toFunction from './_toFunction';
 
 /**
  * Iterates over own and inherited enumerable properties of an object invoking
@@ -29,7 +29,9 @@ import toFunction from './_toFunction';
  * // => logs 'a', 'b', then 'c' (iteration order is not guaranteed)
  */
 function forIn(object, iteratee) {
-  return object == null ? object : baseFor(object, toFunction(iteratee), keysIn);
+  return object == null
+    ? object
+    : baseFor(object, baseCastFunction(iteratee), keysIn);
 }
 
 export default forIn;

forInRight.js

@@ -1,6 +1,6 @@
+import baseCastFunction from './_baseCastFunction';
 import baseForRight from './_baseForRight';
 import keysIn from './keysIn';
-import toFunction from './_toFunction';
 
 /**
  * This method is like `_.forIn` except that it iterates over properties of
@@ -27,7 +27,9 @@ import toFunction from './_toFunction';
  * // => logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'
  */
 function forInRight(object, iteratee) {
-  return object == null ? object : baseForRight(object, toFunction(iteratee), keysIn);
+  return object == null
+    ? object
+    : baseForRight(object, baseCastFunction(iteratee), keysIn);
 }
 
 export default forInRight;

forOwn.js

@@ -1,5 +1,5 @@
+import baseCastFunction from './_baseCastFunction';
 import baseForOwn from './_baseForOwn';
-import toFunction from './_toFunction';
 
 /**
  * Iterates over own enumerable properties of an object invoking `iteratee`
@@ -28,7 +28,7 @@ import toFunction from './_toFunction';
  * // => logs 'a' then 'b' (iteration order is not guaranteed)
  */
 function forOwn(object, iteratee) {
-  return object && baseForOwn(object, toFunction(iteratee));
+  return object && baseForOwn(object, baseCastFunction(iteratee));
 }
 
 export default forOwn;

forOwnRight.js

@@ -1,5 +1,5 @@
+import baseCastFunction from './_baseCastFunction';
 import baseForOwnRight from './_baseForOwnRight';
-import toFunction from './_toFunction';
 
 /**
  * This method is like `_.forOwn` except that it iterates over properties of
@@ -26,7 +26,7 @@ import toFunction from './_toFunction';
  * // => logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'
  */
 function forOwnRight(object, iteratee) {
-  return object && baseForOwnRight(object, toFunction(iteratee));
+  return object && baseForOwnRight(object, baseCastFunction(iteratee));
 }
 
 export default forOwnRight;

identity.js

@@ -1,5 +1,5 @@
 /**
- * This method returns the first argument provided to it.
+ * This method returns the first argument given to it.
  *
  * @static
  * @memberOf _

intersection.js

@@ -1,11 +1,11 @@
 import arrayMap from './_arrayMap';
+import baseCastArrayLikeObject from './_baseCastArrayLikeObject';
 import baseIntersection from './_baseIntersection';
 import rest from './rest';
-import toArrayLikeObject from './_toArrayLikeObject';
 
 /**
- * Creates an array of unique values that are included in all of the provided
- * arrays using [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
+ * Creates an array of unique values that are included in all given arrays
+ * using [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
  * for equality comparisons.
  *
  * @static
@@ -19,7 +19,7 @@ import toArrayLikeObject from './_toArrayLikeObject';
  * // => [2]
  */
 var intersection = rest(function(arrays) {
-  var mapped = arrayMap(arrays, toArrayLikeObject);
+  var mapped = arrayMap(arrays, baseCastArrayLikeObject);
   return (mapped.length && mapped[0] === arrays[0])
     ? baseIntersection(mapped)
     : [];

intersectionBy.js

@@ -1,9 +1,9 @@
 import arrayMap from './_arrayMap';
+import baseCastArrayLikeObject from './_baseCastArrayLikeObject';
 import baseIntersection from './_baseIntersection';
 import baseIteratee from './_baseIteratee';
 import last from './last';
 import rest from './rest';
-import toArrayLikeObject from './_toArrayLikeObject';
 
 /**
  * This method is like `_.intersection` except that it accepts `iteratee`
@@ -27,7 +27,7 @@ import toArrayLikeObject from './_toArrayLikeObject';
  */
 var intersectionBy = rest(function(arrays) {
   var iteratee = last(arrays),
-      mapped = arrayMap(arrays, toArrayLikeObject);
+      mapped = arrayMap(arrays, baseCastArrayLikeObject);
 
   if (iteratee === last(mapped)) {
     iteratee = undefined;

intersectionWith.js

@@ -1,8 +1,8 @@
 import arrayMap from './_arrayMap';
+import baseCastArrayLikeObject from './_baseCastArrayLikeObject';
 import baseIntersection from './_baseIntersection';
 import last from './last';
 import rest from './rest';
-import toArrayLikeObject from './_toArrayLikeObject';
 
 /**
  * This method is like `_.intersection` except that it accepts `comparator`
@@ -25,7 +25,7 @@ import toArrayLikeObject from './_toArrayLikeObject';
  */
 var intersectionWith = rest(function(arrays) {
   var comparator = last(arrays),
-      mapped = arrayMap(arrays, toArrayLikeObject);
+      mapped = arrayMap(arrays, baseCastArrayLikeObject);
 
   if (comparator === last(mapped)) {
     comparator = undefined;

isArray.js

@@ -3,7 +3,7 @@
  *
  * @static
  * @memberOf _
- * @type Function
+ * @type {Function}
  * @category Lang
  * @param {*} value The value to check.
  * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.

isArrayBuffer.js

@@ -0,0 +1,34 @@
+import isObjectLike from './isObjectLike';
+
+var arrayBufferTag = '[object ArrayBuffer]';
+
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
+
+/**
+ * Used to resolve the [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)
+ * of values.
+ */
+var objectToString = objectProto.toString;
+
+/**
+ * Checks if `value` is classified as an `ArrayBuffer` object.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+ * @example
+ *
+ * _.isArrayBuffer(new ArrayBuffer(2));
+ * // => true
+ *
+ * _.isArrayBuffer(new Array(2));
+ * // => false
+ */
+function isArrayBuffer(value) {
+  return isObjectLike(value) && objectToString.call(value) == arrayBufferTag;
+}
+
+export default isArrayBuffer;

isArrayLike.js

@@ -9,7 +9,6 @@ import isLength from './isLength';
  *
  * @static
  * @memberOf _
- * @type Function
  * @category Lang
  * @param {*} value The value to check.
  * @returns {boolean} Returns `true` if `value` is array-like, else `false`.

isArrayLikeObject.js

@@ -7,7 +7,6 @@ import isObjectLike from './isObjectLike';
  *
  * @static
  * @memberOf _
- * @type Function
  * @category Lang
  * @param {*} value The value to check.
  * @returns {boolean} Returns `true` if `value` is an array-like object, else `false`.

isBuffer.js

@@ -0,0 +1,48 @@
+import constant from './constant';
+import root from './_root';
+
+/** Used to determine if values are of the language type `Object`. */
+var objectTypes = {
+  'function': true,
+  'object': true
+};
+
+/** Detect free variable `exports`. */
+var freeExports = (objectTypes[typeof exports] && exports && !exports.nodeType)
+  ? exports
+  : undefined;
+
+/** Detect free variable `module`. */
+var freeModule = (objectTypes[typeof module] && module && !module.nodeType)
+  ? module
+  : undefined;
+
+/** Detect the popular CommonJS extension `module.exports`. */
+var moduleExports = (freeModule && freeModule.exports === freeExports)
+  ? freeExports
+  : undefined;
+
+/** Built-in value references. */
+var Buffer = moduleExports ? root.Buffer : undefined;
+
+/**
+ * Checks if `value` is a buffer.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.
+ * @example
+ *
+ * _.isBuffer(new Buffer(2));
+ * // => true
+ *
+ * _.isBuffer(new Uint8Array(2));
+ * // => false
+ */
+var isBuffer = !Buffer ? constant(false) : function(value) {
+  return value instanceof Buffer;
+};
+
+export default isBuffer;

isEmpty.js

@@ -39,7 +39,8 @@ var hasOwnProperty = objectProto.hasOwnProperty;
  */
 function isEmpty(value) {
   if (isArrayLike(value) &&
-      (isArray(value) || isString(value) || isFunction(value.splice) || isArguments(value))) {
+      (isArray(value) || isString(value) ||
+        isFunction(value.splice) || isArguments(value))) {
     return !value.length;
   }
   for (var key in value) {

isEqualWith.js

@@ -1,10 +1,10 @@
 import baseIsEqual from './_baseIsEqual';
 
 /**
- * This method is like `_.isEqual` except that it accepts `customizer` which is
- * invoked to compare values. If `customizer` returns `undefined` comparisons are
- * handled by the method instead. The `customizer` is invoked with up to six arguments:
- * (objValue, othValue [, index|key, object, other, stack]).
+ * This method is like `_.isEqual` except that it accepts `customizer` which
+ * is invoked to compare values. If `customizer` returns `undefined` comparisons
+ * are handled by the method instead. The `customizer` is invoked with up to
+ * six arguments: (objValue, othValue [, index|key, object, other, stack]).
  *
  * @static
  * @memberOf _

isError.js

@@ -30,8 +30,11 @@ var objectToString = objectProto.toString;
  * // => false
  */
 function isError(value) {
-  return isObjectLike(value) &&
-    typeof value.message == 'string' && objectToString.call(value) == errorTag;
+  if (!isObjectLike(value)) {
+    return false;
+  }
+  return (objectToString.call(value) == errorTag) ||
+    (typeof value.message == 'string' && typeof value.name == 'string');
 }
 
 export default isError;

isLength.js

@@ -26,7 +26,8 @@ var MAX_SAFE_INTEGER = 9007199254740991;
  * // => false
  */
 function isLength(value) {
-  return typeof value == 'number' && value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;
+  return typeof value == 'number' &&
+    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;
 }
 
 export default isLength;

isMap.js

@@ -0,0 +1,27 @@
+import getTag from './_getTag';
+import isObjectLike from './isObjectLike';
+
+/** `Object#toString` result references. */
+var mapTag = '[object Map]';
+
+/**
+ * Checks if `value` is classified as a `Map` object.
+ *
+ * @static
+ * @memberOf _
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+ * @example
+ *
+ * _.isMap(new Map);
+ * // => true
+ *
+ * _.isMap(new WeakMap);
+ * // => false
+ */
+function isMap(value) {
+  return isObjectLike(value) && getTag(value) == mapTag;
+}
+
+export default isMap;

isMatch.js

@@ -2,8 +2,9 @@ import baseIsMatch from './_baseIsMatch';
 import getMatchData from './_getMatchData';
 
 /**
- * Performs a deep comparison between `object` and `source` to determine if
- * `object` contains equivalent property values.
+ * Performs a partial deep comparison between `object` and `source` to
+ * determine if `object` contains equivalent property values. This method is
+ * equivalent to a `_.matches` function when `source` is partially applied.
  *
  * **Note:** This method supports comparing the same values as `_.isEqual`.
  *