Bump to v4.2.0.

README.md

@@ -1,4 +1,4 @@
-# lodash-es v4.0.0
+# lodash-es v4.2.0
 
 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.0.0-es) for more details.
+See the [package source](https://github.com/lodash/lodash/tree/4.2.0-es) for more details.

_Hash.js

@@ -1,4 +1,4 @@
-import nativeCreate from './nativeCreate';
+import nativeCreate from './_nativeCreate';
 
 /** Used for built-in method references. */
 var objectProto = Object.prototype;

_LazyWrapper.js

@@ -1,5 +1,5 @@
-import baseCreate from './baseCreate';
-import baseLodash from './baseLodash';
+import baseCreate from './_baseCreate';
+import baseLodash from './_baseLodash';
 
 /** Used as references for the maximum length and index of an array. */
 var MAX_ARRAY_LENGTH = 4294967295;

_LodashWrapper.js

@@ -1,5 +1,5 @@
-import baseCreate from './baseCreate';
-import baseLodash from './baseLodash';
+import baseCreate from './_baseCreate';
+import baseLodash from './_baseLodash';
 
 /**
  * The base constructor for creating `lodash` wrapper objects.

_Map.js

@@ -1,5 +1,5 @@
-import getNative from './getNative';
-import root from './root';
+import getNative from './_getNative';
+import root from './_root';
 
 /* Built-in method references that are verified to be native. */
 var Map = getNative(root, 'Map');

_MapCache.js

@@ -1,8 +1,8 @@
-import mapClear from './mapClear';
-import mapDelete from './mapDelete';
-import mapGet from './mapGet';
-import mapHas from './mapHas';
-import mapSet from './mapSet';
+import mapClear from './_mapClear';
+import mapDelete from './_mapDelete';
+import mapGet from './_mapGet';
+import mapHas from './_mapHas';
+import mapSet from './_mapSet';
 
 /**
  * Creates a map cache object to store key-value pairs.

_Reflect.js

@@ -1,4 +1,4 @@
-import root from './root';
+import root from './_root';
 
 /** Built-in value references. */
 var Reflect = root.Reflect;

_Set.js

@@ -1,5 +1,5 @@
-import getNative from './getNative';
-import root from './root';
+import getNative from './_getNative';
+import root from './_root';
 
 /* Built-in method references that are verified to be native. */
 var Set = getNative(root, 'Set');

_SetCache.js

@@ -1,5 +1,5 @@
-import MapCache from './MapCache';
-import cachePush from './cachePush';
+import MapCache from './_MapCache';
+import cachePush from './_cachePush';
 
 /**
  *

_Stack.js

@@ -1,8 +1,8 @@
-import stackClear from './stackClear';
-import stackDelete from './stackDelete';
-import stackGet from './stackGet';
-import stackHas from './stackHas';
-import stackSet from './stackSet';
+import stackClear from './_stackClear';
+import stackDelete from './_stackDelete';
+import stackGet from './_stackGet';
+import stackHas from './_stackHas';
+import stackSet from './_stackSet';
 
 /**
  * Creates a stack cache object to store key-value pairs.

_Symbol.js

@@ -0,0 +1,6 @@
+import root from './_root';
+
+/** Built-in value references. */
+var Symbol = root.Symbol;
+
+export default Symbol;

_Uint8Array.js

@@ -1,4 +1,4 @@
-import root from './root';
+import root from './_root';
 
 /** Built-in value references. */
 var Uint8Array = root.Uint8Array;

_WeakMap.js

@@ -1,5 +1,5 @@
-import getNative from './getNative';
-import root from './root';
+import getNative from './_getNative';
+import root from './_root';
 
 /* Built-in method references that are verified to be native. */
 var WeakMap = getNative(root, 'WeakMap');

_apply.js

@@ -5,11 +5,11 @@
  * @private
  * @param {Function} func The function to invoke.
  * @param {*} thisArg The `this` binding of `func`.
- * @param {...*} [args] The arguments to invoke `func` with.
+ * @param {...*} args The arguments to invoke `func` with.
  * @returns {*} Returns the result of `func`.
  */
 function apply(func, thisArg, args) {
-  var length = args ? args.length : 0;
+  var length = args.length;
   switch (length) {
     case 0: return func.call(thisArg);
     case 1: return func.call(thisArg, args[0]);

_arrayAggregator.js

@@ -0,0 +1,22 @@
+/**
+ * A specialized version of `baseAggregator` for arrays.
+ *
+ * @private
+ * @param {Array} array The array to iterate over.
+ * @param {Function} setter The function to set `accumulator` values.
+ * @param {Function} iteratee The iteratee to transform keys.
+ * @param {Object} accumulator The initial aggregated object.
+ * @returns {Function} Returns `accumulator`.
+ */
+function arrayAggregator(array, setter, iteratee, accumulator) {
+  var index = -1,
+      length = array.length;
+
+  while (++index < length) {
+    var value = array[index];
+    setter(accumulator, value, iteratee(value), array);
+  }
+  return accumulator;
+}
+
+export default arrayAggregator;

_arrayIncludes.js

@@ -1,4 +1,4 @@
-import baseIndexOf from './baseIndexOf';
+import baseIndexOf from './_baseIndexOf';
 
 /**
  * A specialized version of `_.includes` for arrays without support for

_arrayReduce.js

@@ -6,14 +6,14 @@
  * @param {Array} array The array to iterate over.
  * @param {Function} iteratee The function invoked per iteration.
  * @param {*} [accumulator] The initial value.
- * @param {boolean} [initFromArray] Specify using the first element of `array` as the initial value.
+ * @param {boolean} [initAccum] Specify using the first element of `array` as the initial value.
  * @returns {*} Returns the accumulated value.
  */
-function arrayReduce(array, iteratee, accumulator, initFromArray) {
+function arrayReduce(array, iteratee, accumulator, initAccum) {
   var index = -1,
       length = array.length;
 
-  if (initFromArray && length) {
+  if (initAccum && length) {
     accumulator = array[++index];
   }
   while (++index < length) {

_arrayReduceRight.js

@@ -6,12 +6,12 @@
  * @param {Array} array The array to iterate over.
  * @param {Function} iteratee The function invoked per iteration.
  * @param {*} [accumulator] The initial value.
- * @param {boolean} [initFromArray] Specify using the last element of `array` as the initial value.
+ * @param {boolean} [initAccum] Specify using the last element of `array` as the initial value.
  * @returns {*} Returns the accumulated value.
  */
-function arrayReduceRight(array, iteratee, accumulator, initFromArray) {
+function arrayReduceRight(array, iteratee, accumulator, initAccum) {
   var length = array.length;
-  if (initFromArray && length) {
+  if (initAccum && length) {
     accumulator = array[--length];
   }
   while (length--) {

_assignInDefaults.js

@@ -1,4 +1,4 @@
-import eq from '../eq';
+import eq from './eq';
 
 /** Used for built-in method references. */
 var objectProto = Object.prototype;

_assignMergeValue.js

@@ -1,4 +1,4 @@
-import eq from '../eq';
+import eq from './eq';
 
 /**
  * This function is like `assignValue` except that it doesn't assign `undefined` values.

_assignValue.js

@@ -1,4 +1,4 @@
-import eq from '../eq';
+import eq from './eq';
 
 /** Used for built-in method references. */
 var objectProto = Object.prototype;

_assocDelete.js

@@ -1,4 +1,4 @@
-import assocIndexOf from './assocIndexOf';
+import assocIndexOf from './_assocIndexOf';
 
 /** Used for built-in method references. */
 var arrayProto = Array.prototype;

_assocGet.js

@@ -1,4 +1,4 @@
-import assocIndexOf from './assocIndexOf';
+import assocIndexOf from './_assocIndexOf';
 
 /**
  * Gets the associative array value for `key`.

_assocHas.js

@@ -1,4 +1,4 @@
-import assocIndexOf from './assocIndexOf';
+import assocIndexOf from './_assocIndexOf';
 
 /**
  * Checks if an associative array value for `key` exists.

_assocIndexOf.js

@@ -1,4 +1,4 @@
-import eq from '../eq';
+import eq from './eq';
 
 /**
  * Gets the index at which the first occurrence of `key` is found in `array`

_assocSet.js

@@ -1,4 +1,4 @@
-import assocIndexOf from './assocIndexOf';
+import assocIndexOf from './_assocIndexOf';
 
 /**
  * Sets the associative array `key` to `value`.

_baseAggregator.js

@@ -0,0 +1,21 @@
+import baseEach from './_baseEach';
+
+/**
+ * Aggregates elements of `collection` on `accumulator` with keys transformed
+ * by `iteratee` and values set by `setter`.
+ *
+ * @private
+ * @param {Array|Object} collection The collection to iterate over.
+ * @param {Function} setter The function to set `accumulator` values.
+ * @param {Function} iteratee The iteratee to transform keys.
+ * @param {Object} accumulator The initial aggregated object.
+ * @returns {Function} Returns `accumulator`.
+ */
+function baseAggregator(collection, setter, iteratee, accumulator) {
+  baseEach(collection, function(value, key, collection) {
+    setter(accumulator, value, iteratee(value), collection);
+  });
+  return accumulator;
+}
+
+export default baseAggregator;

_baseAssign.js

@@ -1,5 +1,5 @@
-import copyObject from './copyObject';
-import keys from '../keys';
+import copyObject from './_copyObject';
+import keys from './keys';
 
 /**
  * The base implementation of `_.assign` without support for multiple sources

_baseAt.js

@@ -1,4 +1,4 @@
-import get from '../get';
+import get from './get';
 
 /**
  * The base implementation of `_.at` without support for individual paths.

_baseClone.js

@@ -1,17 +1,17 @@
-import Stack from './Stack';
-import arrayEach from './arrayEach';
-import assignValue from './assignValue';
-import baseAssign from './baseAssign';
-import baseForOwn from './baseForOwn';
-import copyArray from './copyArray';
-import copySymbols from './copySymbols';
-import getTag from './getTag';
-import initCloneArray from './initCloneArray';
-import initCloneByTag from './initCloneByTag';
-import initCloneObject from './initCloneObject';
-import isArray from '../isArray';
-import isHostObject from './isHostObject';
-import isObject from '../isObject';
+import Stack from './_Stack';
+import arrayEach from './_arrayEach';
+import assignValue from './_assignValue';
+import baseAssign from './_baseAssign';
+import baseForOwn from './_baseForOwn';
+import copyArray from './_copyArray';
+import copySymbols from './_copySymbols';
+import getTag from './_getTag';
+import initCloneArray from './_initCloneArray';
+import initCloneByTag from './_initCloneByTag';
+import initCloneObject from './_initCloneObject';
+import isArray from './isArray';
+import isHostObject from './_isHostObject';
+import isObject from './isObject';
 
 /** `Object#toString` result references. */
 var argsTag = '[object Arguments]',

_baseConforms.js

@@ -1,4 +1,4 @@
-import keys from '../keys';
+import keys from './keys';
 
 /**
  * The base implementation of `_.conforms` which doesn't clone `source`.

_baseCreate.js

@@ -1,4 +1,4 @@
-import isObject from '../isObject';
+import isObject from './isObject';
 
 /**
  * The base implementation of `_.create` without support for assigning

_baseDifference.js

@@ -1,9 +1,9 @@
-import SetCache from './SetCache';
-import arrayIncludes from './arrayIncludes';
-import arrayIncludesWith from './arrayIncludesWith';
-import arrayMap from './arrayMap';
-import baseUnary from './baseUnary';
-import cacheHas from './cacheHas';
+import SetCache from './_SetCache';
+import arrayIncludes from './_arrayIncludes';
+import arrayIncludesWith from './_arrayIncludesWith';
+import arrayMap from './_arrayMap';
+import baseUnary from './_baseUnary';
+import cacheHas from './_cacheHas';
 
 /** Used as the size to enable large array optimizations. */
 var LARGE_ARRAY_SIZE = 200;

_baseEach.js

@@ -1,5 +1,5 @@
-import baseForOwn from './baseForOwn';
-import createBaseEach from './createBaseEach';
+import baseForOwn from './_baseForOwn';
+import createBaseEach from './_createBaseEach';
 
 /**
  * The base implementation of `_.forEach` without support for iteratee shorthands.

_baseEachRight.js

@@ -1,5 +1,5 @@
-import baseForOwnRight from './baseForOwnRight';
-import createBaseEach from './createBaseEach';
+import baseForOwnRight from './_baseForOwnRight';
+import createBaseEach from './_createBaseEach';
 
 /**
  * The base implementation of `_.forEachRight` without support for iteratee shorthands.

_baseEvery.js

@@ -1,4 +1,4 @@
-import baseEach from './baseEach';
+import baseEach from './_baseEach';
 
 /**
  * The base implementation of `_.every` without support for iteratee shorthands.

_baseFill.js

@@ -1,5 +1,5 @@
-import toInteger from '../toInteger';
-import toLength from '../toLength';
+import toInteger from './toInteger';
+import toLength from './toLength';
 
 /**
  * The base implementation of `_.fill` without an iteratee call guard.

_baseFilter.js

@@ -1,4 +1,4 @@
-import baseEach from './baseEach';
+import baseEach from './_baseEach';
 
 /**
  * The base implementation of `_.filter` without support for iteratee shorthands.

_baseFind.js

@@ -1,7 +1,7 @@
 /**
  * The base implementation of methods like `_.find` and `_.findKey`, without
  * support for iteratee shorthands, which iterates over `collection` using
- * the provided `eachFunc`.
+ * `eachFunc`.
  *
  * @private
  * @param {Array|Object} collection The collection to search.

_baseFlatten.js

@@ -1,7 +1,7 @@
-import arrayPush from './arrayPush';
-import isArguments from '../isArguments';
-import isArray from '../isArray';
-import isArrayLikeObject from '../isArrayLikeObject';
+import arrayPush from './_arrayPush';
+import isArguments from './isArguments';
+import isArray from './isArray';
+import isArrayLikeObject from './isArrayLikeObject';
 
 /**
  * The base implementation of `_.flatten` with support for restricting flattening.

_baseFor.js

@@ -1,4 +1,4 @@
-import createBaseFor from './createBaseFor';
+import createBaseFor from './_createBaseFor';
 
 /**
  * The base implementation of `baseForIn` and `baseForOwn` which iterates

_baseForIn.js

@@ -1,5 +1,5 @@
-import baseFor from './baseFor';
-import keysIn from '../keysIn';
+import baseFor from './_baseFor';
+import keysIn from './keysIn';
 
 /**
  * The base implementation of `_.forIn` without support for iteratee shorthands.

_baseForOwn.js

@@ -1,5 +1,5 @@
-import baseFor from './baseFor';
-import keys from '../keys';
+import baseFor from './_baseFor';
+import keys from './keys';
 
 /**
  * The base implementation of `_.forOwn` without support for iteratee shorthands.

_baseForOwnRight.js

@@ -1,5 +1,5 @@
-import baseForRight from './baseForRight';
-import keys from '../keys';
+import baseForRight from './_baseForRight';
+import keys from './keys';
 
 /**
  * The base implementation of `_.forOwnRight` without support for iteratee shorthands.

_baseForRight.js

@@ -1,4 +1,4 @@
-import createBaseFor from './createBaseFor';
+import createBaseFor from './_createBaseFor';
 
 /**
  * This function is like `baseFor` except that it iterates over properties

_baseFunctions.js

@@ -1,5 +1,5 @@
-import arrayFilter from './arrayFilter';
-import isFunction from '../isFunction';
+import arrayFilter from './_arrayFilter';
+import isFunction from './isFunction';
 
 /**
  * The base implementation of `_.functions` which creates an array of

_baseGet.js

@@ -1,5 +1,5 @@
-import baseToPath from './baseToPath';
-import isKey from './isKey';
+import baseToPath from './_baseToPath';
+import isKey from './_isKey';
 
 /**
  * The base implementation of `_.get` without support for default values.

_baseIndexOf.js

@@ -1,4 +1,4 @@
-import indexOfNaN from './indexOfNaN';
+import indexOfNaN from './_indexOfNaN';
 
 /**
  * The base implementation of `_.indexOf` without `fromIndex` bounds checks.

_baseIntersection.js

@@ -1,9 +1,9 @@
-import SetCache from './SetCache';
-import arrayIncludes from './arrayIncludes';
-import arrayIncludesWith from './arrayIncludesWith';
-import arrayMap from './arrayMap';
-import baseUnary from './baseUnary';
-import cacheHas from './cacheHas';
+import SetCache from './_SetCache';
+import arrayIncludes from './_arrayIncludes';
+import arrayIncludesWith from './_arrayIncludesWith';
+import arrayMap from './_arrayMap';
+import baseUnary from './_baseUnary';
+import cacheHas from './_cacheHas';
 
 /**
  * The base implementation of methods like `_.intersection`, without support

_baseInverter.js

@@ -0,0 +1,21 @@
+import baseForOwn from './_baseForOwn';
+
+/**
+ * The base implementation of `_.invert` and `_.invertBy` which inverts
+ * `object` with values transformed by `iteratee` and set by `setter`.
+ *
+ * @private
+ * @param {Object} object The object to iterate over.
+ * @param {Function} setter The function to set `accumulator` values.
+ * @param {Function} iteratee The iteratee to transform values.
+ * @param {Object} accumulator The initial inverted object.
+ * @returns {Function} Returns `accumulator`.
+ */
+function baseInverter(object, setter, iteratee, accumulator) {
+  baseForOwn(object, function(value, key, object) {
+    setter(accumulator, iteratee(value), key, object);
+  });
+  return accumulator;
+}
+
+export default baseInverter;

_baseInvoke.js

@@ -1,14 +1,13 @@
-import apply from './apply';
-import baseToPath from './baseToPath';
-import isKey from './isKey';
-import last from '../last';
-import parent from './parent';
+import apply from './_apply';
+import baseToPath from './_baseToPath';
+import isKey from './_isKey';
+import last from './last';
+import parent from './_parent';
 
 /**
  * The base implementation of `_.invoke` without support for individual
  * method arguments.
  *
- *
  * @private
  * @param {Object} object The object to query.
  * @param {Array|string} path The path of the method to invoke.

_baseIsEqual.js

@@ -1,6 +1,6 @@
-import baseIsEqualDeep from './baseIsEqualDeep';
-import isObject from '../isObject';
-import isObjectLike from '../isObjectLike';
+import baseIsEqualDeep from './_baseIsEqualDeep';
+import isObject from './isObject';
+import isObjectLike from './isObjectLike';
 
 /**
  * The base implementation of `_.isEqual` which supports partial comparisons

_baseIsEqualDeep.js

@@ -1,11 +1,11 @@
-import Stack from './Stack';
-import equalArrays from './equalArrays';
-import equalByTag from './equalByTag';
-import equalObjects from './equalObjects';
-import getTag from './getTag';
-import isArray from '../isArray';
-import isHostObject from './isHostObject';
-import isTypedArray from '../isTypedArray';
+import Stack from './_Stack';
+import equalArrays from './_equalArrays';
+import equalByTag from './_equalByTag';
+import equalObjects from './_equalObjects';
+import getTag from './_getTag';
+import isArray from './isArray';
+import isHostObject from './_isHostObject';
+import isTypedArray from './isTypedArray';
 
 /** Used to compose bitmasks for comparison styles. */
 var PARTIAL_COMPARE_FLAG = 2;

_baseIsMatch.js

@@ -1,5 +1,5 @@
-import Stack from './Stack';
-import baseIsEqual from './baseIsEqual';
+import Stack from './_Stack';
+import baseIsEqual from './_baseIsEqual';
 
 /** Used to compose bitmasks for comparison styles. */
 var UNORDERED_COMPARE_FLAG = 1,
@@ -47,7 +47,10 @@ function baseIsMatch(object, source, matchData, customizer) {
       var stack = new Stack,
           result = customizer ? customizer(objValue, srcValue, key, object, source, stack) : undefined;
 
-      if (!(result === undefined ? baseIsEqual(srcValue, objValue, customizer, UNORDERED_COMPARE_FLAG | PARTIAL_COMPARE_FLAG, stack) : result)) {
+      if (!(result === undefined
+            ? baseIsEqual(srcValue, objValue, customizer, UNORDERED_COMPARE_FLAG | PARTIAL_COMPARE_FLAG, stack)
+            : result
+          )) {
         return false;
       }
     }

_baseIteratee.js

@@ -1,8 +1,8 @@
-import baseMatches from './baseMatches';
-import baseMatchesProperty from './baseMatchesProperty';
-import identity from '../identity';
-import isArray from '../isArray';
-import property from '../property';
+import baseMatches from './_baseMatches';
+import baseMatchesProperty from './_baseMatchesProperty';
+import identity from './identity';
+import isArray from './isArray';
+import property from './property';
 
 /**
  * The base implementation of `_.iteratee`.

_baseKeysIn.js

@@ -1,5 +1,5 @@
-import Reflect from './Reflect';
-import iteratorToArray from './iteratorToArray';
+import Reflect from './_Reflect';
+import iteratorToArray from './_iteratorToArray';
 
 /** Used for built-in method references. */
 var objectProto = Object.prototype;

_baseMap.js

@@ -1,5 +1,5 @@
-import baseEach from './baseEach';
-import isArrayLike from '../isArrayLike';
+import baseEach from './_baseEach';
+import isArrayLike from './isArrayLike';
 
 /**
  * The base implementation of `_.map` without support for iteratee shorthands.

_baseMatches.js

@@ -1,5 +1,5 @@
-import baseIsMatch from './baseIsMatch';
-import getMatchData from './getMatchData';
+import baseIsMatch from './_baseIsMatch';
+import getMatchData from './_getMatchData';
 
 /**
  * The base implementation of `_.matches` which doesn't clone `source`.

_baseMatchesProperty.js

@@ -1,6 +1,6 @@
-import baseIsEqual from './baseIsEqual';
-import get from '../get';
-import hasIn from '../hasIn';
+import baseIsEqual from './_baseIsEqual';
+import get from './get';
+import hasIn from './hasIn';
 
 /** Used to compose bitmasks for comparison styles. */
 var UNORDERED_COMPARE_FLAG = 1,

_baseMerge.js

@@ -1,11 +1,11 @@
-import Stack from './Stack';
-import arrayEach from './arrayEach';
-import assignMergeValue from './assignMergeValue';
-import baseMergeDeep from './baseMergeDeep';
-import isArray from '../isArray';
-import isObject from '../isObject';
-import isTypedArray from '../isTypedArray';
-import keysIn from '../keysIn';
+import Stack from './_Stack';
+import arrayEach from './_arrayEach';
+import assignMergeValue from './_assignMergeValue';
+import baseMergeDeep from './_baseMergeDeep';
+import isArray from './isArray';
+import isObject from './isObject';
+import isTypedArray from './isTypedArray';
+import keysIn from './keysIn';
 
 /**
  * The base implementation of `_.merge` without support for multiple sources.
@@ -13,10 +13,11 @@ import keysIn from '../keysIn';
  * @private
  * @param {Object} object The destination object.
  * @param {Object} source The source object.
+ * @param {number} srcIndex The index of `source`.
  * @param {Function} [customizer] The function to customize merged values.
  * @param {Object} [stack] Tracks traversed source values and their merged counterparts.
  */
-function baseMerge(object, source, customizer, stack) {
+function baseMerge(object, source, srcIndex, customizer, stack) {
   if (object === source) {
     return;
   }
@@ -28,7 +29,7 @@ function baseMerge(object, source, customizer, stack) {
     }
     if (isObject(srcValue)) {
       stack || (stack = new Stack);
-      baseMergeDeep(object, source, key, baseMerge, customizer, stack);
+      baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);
     }
     else {
       var newValue = customizer ? customizer(object[key], srcValue, (key + ''), object, source, stack) : undefined;

_baseMergeDeep.js

@@ -0,0 +1,78 @@
+import assignMergeValue from './_assignMergeValue';
+import baseClone from './_baseClone';
+import copyArray from './_copyArray';
+import isArguments from './isArguments';
+import isArray from './isArray';
+import isArrayLikeObject from './isArrayLikeObject';
+import isFunction from './isFunction';
+import isObject from './isObject';
+import isPlainObject from './isPlainObject';
+import isTypedArray from './isTypedArray';
+import toPlainObject from './toPlainObject';
+
+/**
+ * A specialized version of `baseMerge` for arrays and objects which performs
+ * deep merges and tracks traversed objects enabling objects with circular
+ * references to be merged.
+ *
+ * @private
+ * @param {Object} object The destination object.
+ * @param {Object} source The source object.
+ * @param {string} key The key of the value to merge.
+ * @param {number} srcIndex The index of `source`.
+ * @param {Function} mergeFunc The function to merge values.
+ * @param {Function} [customizer] The function to customize assigned values.
+ * @param {Object} [stack] Tracks traversed source values and their merged counterparts.
+ */
+function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {
+  var objValue = object[key],
+      srcValue = source[key],
+      stacked = stack.get(srcValue);
+
+  if (stacked) {
+    assignMergeValue(object, key, stacked);
+    return;
+  }
+  var newValue = customizer ? customizer(objValue, srcValue, (key + ''), object, source, stack) : undefined,
+      isCommon = newValue === undefined;
+
+  if (isCommon) {
+    newValue = srcValue;
+    if (isArray(srcValue) || isTypedArray(srcValue)) {
+      if (isArray(objValue)) {
+        newValue = srcIndex ? copyArray(objValue) : objValue;
+      }
+      else if (isArrayLikeObject(objValue)) {
+        newValue = copyArray(objValue);
+      }
+      else {
+        isCommon = false;
+        newValue = baseClone(srcValue);
+      }
+    }
+    else if (isPlainObject(srcValue) || isArguments(srcValue)) {
+      if (isArguments(objValue)) {
+        newValue = toPlainObject(objValue);
+      }
+      else if (!isObject(objValue) || (srcIndex && isFunction(objValue))) {
+        isCommon = false;
+        newValue = baseClone(srcValue);
+      }
+      else {
+        newValue = srcIndex ? baseClone(objValue) : objValue;
+      }
+    }
+    else {
+      isCommon = false;
+    }
+  }
+  stack.set(srcValue, newValue);
+
+  if (isCommon) {
+    // Recursively merge objects and arrays (susceptible to call stack limits).
+    mergeFunc(newValue, srcValue, srcIndex, customizer, stack);
+  }
+  assignMergeValue(object, key, newValue);
+}
+
+export default baseMergeDeep;

_baseOrderBy.js

@@ -1,8 +1,8 @@
-import arrayMap from './arrayMap';
-import baseIteratee from './baseIteratee';
-import baseMap from './baseMap';
-import baseSortBy from './baseSortBy';
-import compareMultiple from './compareMultiple';
+import arrayMap from './_arrayMap';
+import baseIteratee from './_baseIteratee';
+import baseMap from './_baseMap';
+import baseSortBy from './_baseSortBy';
+import compareMultiple from './_compareMultiple';
 
 /**
  * The base implementation of `_.orderBy` without param guards.

_basePick.js

@@ -1,4 +1,4 @@
-import arrayReduce from './arrayReduce';
+import arrayReduce from './_arrayReduce';
 
 /**
  * The base implementation of `_.pick` without support for individual

_basePickBy.js

@@ -1,4 +1,4 @@
-import baseForIn from './baseForIn';
+import baseForIn from './_baseForIn';
 
 /**
  * The base implementation of  `_.pickBy` without support for iteratee shorthands.
@@ -11,7 +11,7 @@ import baseForIn from './baseForIn';
 function basePickBy(object, predicate) {
   var result = {};
   baseForIn(object, function(value, key) {
-    if (predicate(value)) {
+    if (predicate(value, key)) {
       result[key] = value;
     }
   });

_basePropertyDeep.js

@@ -1,4 +1,4 @@
-import baseGet from './baseGet';
+import baseGet from './_baseGet';
 
 /**
  * A specialized version of `baseProperty` which supports deep paths.

_basePullAll.js

@@ -1,4 +1,4 @@
-import basePullAllBy from './basePullAllBy';
+import basePullAllBy from './_basePullAllBy';
 
 /**
  * The base implementation of `_.pullAll`.

_basePullAllBy.js

@@ -1,5 +1,5 @@
-import arrayMap from './arrayMap';
-import baseIndexOf from './baseIndexOf';
+import arrayMap from './_arrayMap';
+import baseIndexOf from './_baseIndexOf';
 
 /** Used for built-in method references. */
 var arrayProto = Array.prototype;

_basePullAt.js

@@ -1,8 +1,8 @@
-import baseToPath from './baseToPath';
-import isIndex from './isIndex';
-import isKey from './isKey';
-import last from '../last';
-import parent from './parent';
+import baseToPath from './_baseToPath';
+import isIndex from './_isIndex';
+import isKey from './_isKey';
+import last from './last';
+import parent from './_parent';
 
 /** Used for built-in method references. */
 var arrayProto = Array.prototype;

_baseReduce.js

@@ -1,20 +1,19 @@
 /**
  * The base implementation of `_.reduce` and `_.reduceRight`, without support
- * for iteratee shorthands, which iterates over `collection` using the provided
- * `eachFunc`.
+ * for iteratee shorthands, which iterates over `collection` using `eachFunc`.
  *
  * @private
  * @param {Array|Object} collection The collection to iterate over.
  * @param {Function} iteratee The function invoked per iteration.
  * @param {*} accumulator The initial value.
- * @param {boolean} initFromCollection Specify using the first or last element of `collection` as the initial value.
+ * @param {boolean} initAccum Specify using the first or last element of `collection` as the initial value.
  * @param {Function} eachFunc The function to iterate over `collection`.
  * @returns {*} Returns the accumulated value.
  */
-function baseReduce(collection, iteratee, accumulator, initFromCollection, eachFunc) {
+function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {
   eachFunc(collection, function(value, index, collection) {
-    accumulator = initFromCollection
-      ? (initFromCollection = false, value)
+    accumulator = initAccum
+      ? (initAccum = false, value)
       : iteratee(accumulator, value, index, collection);
   });
   return accumulator;

_baseSet.js

@@ -1,8 +1,8 @@
-import assignValue from './assignValue';
-import baseToPath from './baseToPath';
-import isIndex from './isIndex';
-import isKey from './isKey';
-import isObject from '../isObject';
+import assignValue from './_assignValue';
+import baseToPath from './_baseToPath';
+import isIndex from './_isIndex';
+import isKey from './_isKey';
+import isObject from './isObject';
 
 /**
  * The base implementation of `_.set`.

_baseSetData.js

@@ -1,5 +1,5 @@
-import identity from '../identity';
-import metaMap from './metaMap';
+import identity from './identity';
+import metaMap from './_metaMap';
 
 /**
  * The base implementation of `setData` without support for hot loop detection.

_baseSome.js

@@ -1,4 +1,4 @@
-import baseEach from './baseEach';
+import baseEach from './_baseEach';
 
 /**
  * The base implementation of `_.some` without support for iteratee shorthands.

_baseSortedIndex.js

@@ -1,5 +1,5 @@
-import baseSortedIndexBy from './baseSortedIndexBy';
-import identity from '../identity';
+import baseSortedIndexBy from './_baseSortedIndexBy';
+import identity from './identity';
 
 /** Used as references for the maximum length and index of an array. */
 var MAX_ARRAY_LENGTH = 4294967295,

_baseSortedUniq.js

@@ -1,4 +1,4 @@
-import baseSortedUniqBy from './baseSortedUniqBy';
+import baseSortedUniqBy from './_baseSortedUniqBy';
 
 /**
  * The base implementation of `_.sortedUniq`.