Bump to v4.12.0.

LICENSE

@@ -1,23 +1,47 @@
-The MIT License (MIT)
+Copyright jQuery Foundation and other contributors <https://jquery.org/>
 
-Copyright 2012-2016 The Dojo Foundation <http://dojofoundation.org/>
+Based on Underscore.js, copyright Jeremy Ashkenas,
-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
+This software consists of voluntary contributions made by many
-of this software and associated documentation files (the "Software"), to deal
+individuals. For exact contribution history, see the revision history
-in the Software without restriction, including without limitation the rights
+available at https://github.com/lodash/lodash
-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
+The following license applies to all parts of this software except as
-copies or substantial portions of the Software.
+documented below:
 
-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
+Permission is hereby granted, free of charge, to any person obtaining
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+a copy of this software and associated documentation files (the
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+"Software"), to deal in the Software without restriction, including
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+without limitation the rights to use, copy, modify, merge, publish,
-SOFTWARE.
+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 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.
+
+====
+
+Copyright and related rights for sample code are waived via CC0. Sample
+code is defined as all source code displayed within the prose of the
+documentation.
+
+CC0: http://creativecommons.org/publicdomain/zero/1.0/
+
+====
+
+Files located in the node_modules and vendor directories are externally
+maintained libraries used by this software which have their own
+licenses; we recommend you read them, as their terms may differ from the
+terms above.

README.md

@@ -1,10 +1,10 @@
-# lodash-es v4.6.1
+# lodash-es v4.12.0
 
-The [lodash](https://lodash.com/) library exported as [ES](http://www.ecma-international.org/ecma-262/6.0/) modules.
+The [Lodash](https://lodash.com/) library exported as [ES](http://www.ecma-international.org/ecma-262/6.0/) modules.
 
 Generated using [lodash-cli](https://www.npmjs.com/package/lodash-cli):
 ```bash
 $ lodash modularize exports=es -o ./
 ```
 
-See the [package source](https://github.com/lodash/lodash/tree/4.6.1-es) for more details.
+See the [package source](https://github.com/lodash/lodash/tree/4.12.0-es) for more details.

_DataView.js

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

_Hash.js

@@ -1,18 +1,32 @@
-import nativeCreate from './_nativeCreate';
+import hashClear from './_hashClear';
-
+import hashDelete from './_hashDelete';
-/** Used for built-in method references. */
+import hashGet from './_hashGet';
-var objectProto = Object.prototype;
+import hashHas from './_hashHas';
+import hashSet from './_hashSet';
 
 /**
- * Creates an hash object.
+ * Creates a hash object.
  *
  * @private
  * @constructor
- * @returns {Object} Returns the new hash object.
+ * @param {Array} [entries] The key-value pairs to cache.
  */
-function Hash() {}
+function Hash(entries) {
+  var index = -1,
+      length = entries ? entries.length : 0;
 
-// Avoid inheriting from `Object.prototype` when possible.
+  this.clear();
-Hash.prototype = nativeCreate ? nativeCreate(null) : objectProto;
+  while (++index < length) {
+    var entry = entries[index];
+    this.set(entry[0], entry[1]);
+  }
+}
+
+// Add methods to `Hash`.
+Hash.prototype.clear = hashClear;
+Hash.prototype['delete'] = hashDelete;
+Hash.prototype.get = hashGet;
+Hash.prototype.has = hashHas;
+Hash.prototype.set = hashSet;
 
 export default Hash;

_LazyWrapper.js

@@ -21,6 +21,7 @@ function LazyWrapper(value) {
   this.__views__ = [];
 }
 
+// Ensure `LazyWrapper` is an instance of `baseLodash`.
 LazyWrapper.prototype = baseCreate(baseLodash.prototype);
 LazyWrapper.prototype.constructor = LazyWrapper;
 

_ListCache.js

@@ -0,0 +1,32 @@
+import listCacheClear from './_listCacheClear';
+import listCacheDelete from './_listCacheDelete';
+import listCacheGet from './_listCacheGet';
+import listCacheHas from './_listCacheHas';
+import listCacheSet from './_listCacheSet';
+
+/**
+ * Creates an list cache object.
+ *
+ * @private
+ * @constructor
+ * @param {Array} [entries] The key-value pairs to cache.
+ */
+function ListCache(entries) {
+  var index = -1,
+      length = entries ? entries.length : 0;
+
+  this.clear();
+  while (++index < length) {
+    var entry = entries[index];
+    this.set(entry[0], entry[1]);
+  }
+}
+
+// Add methods to `ListCache`.
+ListCache.prototype.clear = listCacheClear;
+ListCache.prototype['delete'] = listCacheDelete;
+ListCache.prototype.get = listCacheGet;
+ListCache.prototype.has = listCacheHas;
+ListCache.prototype.set = listCacheSet;
+
+export default ListCache;

_LodashWrapper.js

@@ -6,7 +6,7 @@ import baseLodash from './_baseLodash';
  *
  * @private
  * @param {*} value The value to wrap.
- * @param {boolean} [chainAll] Enable chaining for all wrapper methods.
+ * @param {boolean} [chainAll] Enable explicit method chain sequences.
  */
 function LodashWrapper(value, chainAll) {
   this.__wrapped__ = value;

_MapCache.js

@@ -1,32 +1,32 @@
-import mapClear from './_mapClear';
+import mapCacheClear from './_mapCacheClear';
-import mapDelete from './_mapDelete';
+import mapCacheDelete from './_mapCacheDelete';
-import mapGet from './_mapGet';
+import mapCacheGet from './_mapCacheGet';
-import mapHas from './_mapHas';
+import mapCacheHas from './_mapCacheHas';
-import mapSet from './_mapSet';
+import mapCacheSet from './_mapCacheSet';
 
 /**
  * Creates a map cache object to store key-value pairs.
  *
  * @private
  * @constructor
- * @param {Array} [values] The values to cache.
+ * @param {Array} [entries] The key-value pairs to cache.
  */
-function MapCache(values) {
+function MapCache(entries) {
   var index = -1,
-      length = values ? values.length : 0;
+      length = entries ? entries.length : 0;
 
   this.clear();
   while (++index < length) {
-    var entry = values[index];
+    var entry = entries[index];
     this.set(entry[0], entry[1]);
   }
 }
 
-// Add functions to the `MapCache`.
+// Add methods to `MapCache`.
-MapCache.prototype.clear = mapClear;
+MapCache.prototype.clear = mapCacheClear;
-MapCache.prototype['delete'] = mapDelete;
+MapCache.prototype['delete'] = mapCacheDelete;
-MapCache.prototype.get = mapGet;
+MapCache.prototype.get = mapCacheGet;
-MapCache.prototype.has = mapHas;
+MapCache.prototype.has = mapCacheHas;
-MapCache.prototype.set = mapSet;
+MapCache.prototype.set = mapCacheSet;
 
 export default MapCache;

_Promise.js

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

_SetCache.js

@@ -1,9 +1,10 @@
 import MapCache from './_MapCache';
-import cachePush from './_cachePush';
+import setCacheAdd from './_setCacheAdd';
+import setCacheHas from './_setCacheHas';
 
 /**
  *
- * Creates a set cache object to store unique values.
+ * Creates an array cache object to store unique values.
  *
  * @private
  * @constructor
@@ -15,11 +16,12 @@ function SetCache(values) {
 
   this.__data__ = new MapCache;
   while (++index < length) {
-    this.push(values[index]);
+    this.add(values[index]);
   }
 }
 
-// Add functions to the `SetCache`.
+// Add methods to `SetCache`.
-SetCache.prototype.push = cachePush;
+SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;
+SetCache.prototype.has = setCacheHas;
 
 export default SetCache;

_Stack.js

@@ -1,3 +1,4 @@
+import ListCache from './_ListCache';
 import stackClear from './_stackClear';
 import stackDelete from './_stackDelete';
 import stackGet from './_stackGet';
@@ -9,20 +10,13 @@ import stackSet from './_stackSet';
  *
  * @private
  * @constructor
- * @param {Array} [values] The values to cache.
+ * @param {Array} [entries] The key-value pairs to cache.
  */
-function Stack(values) {
+function Stack(entries) {
-  var index = -1,
+  this.__data__ = new ListCache(entries);
-      length = values ? values.length : 0;
-
-  this.clear();
-  while (++index < length) {
-    var entry = values[index];
-    this.set(entry[0], entry[1]);
-  }
 }
 
-// Add functions to the `Stack` cache.
+// Add methods to `Stack`.
 Stack.prototype.clear = stackClear;
 Stack.prototype['delete'] = stackDelete;
 Stack.prototype.get = stackGet;

_apply.js

@@ -5,7 +5,7 @@
  * @private
  * @param {Function} func The function to invoke.
  * @param {*} thisArg The `this` binding of `func`.
- * @param {...*} args The arguments to invoke `func` with.
+ * @param {Array} args The arguments to invoke `func` with.
  * @returns {*} Returns the result of `func`.
  */
 function apply(func, thisArg, args) {

_arrayConcat.js

@@ -1,25 +0,0 @@
-/**
- * Creates a new array concatenating `array` with `other`.
- *
- * @private
- * @param {Array} array The first array to concatenate.
- * @param {Array} other The second array to concatenate.
- * @returns {Array} Returns the new concatenated array.
- */
-function arrayConcat(array, other) {
-  var index = -1,
-      length = array.length,
-      othIndex = -1,
-      othLength = other.length,
-      result = Array(length + othLength);
-
-  while (++index < length) {
-    result[index] = array[index];
-  }
-  while (++othIndex < othLength) {
-    result[index++] = other[othIndex];
-  }
-  return result;
-}
-
-export default arrayConcat;

_arrayEvery.js

@@ -5,7 +5,8 @@
  * @private
  * @param {Array} array The array to iterate over.
  * @param {Function} predicate The function invoked per iteration.
- * @returns {boolean} Returns `true` if all elements pass the predicate check, else `false`.
+ * @returns {boolean} Returns `true` if all elements pass the predicate check,
+ *  else `false`.
  */
 function arrayEvery(array, predicate) {
   var index = -1,

_arrayReduce.js

@@ -6,7 +6,8 @@
  * @param {Array} array The array to iterate over.
  * @param {Function} iteratee The function invoked per iteration.
  * @param {*} [accumulator] The initial value.
- * @param {boolean} [initAccum] 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, initAccum) {

_arrayReduceRight.js

@@ -6,7 +6,8 @@
  * @param {Array} array The array to iterate over.
  * @param {Function} iteratee The function invoked per iteration.
  * @param {*} [accumulator] The initial value.
- * @param {boolean} [initAccum] 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, initAccum) {

_arraySome.js

@@ -5,7 +5,8 @@
  * @private
  * @param {Array} array The array to iterate over.
  * @param {Function} predicate The function invoked per iteration.
- * @returns {boolean} Returns `true` if any element passes the predicate check, else `false`.
+ * @returns {boolean} Returns `true` if any element passes the predicate check,
+ *  else `false`.
  */
 function arraySome(array, predicate) {
   var index = -1,

_assocGet.js

@@ -1,16 +0,0 @@
-import assocIndexOf from './_assocIndexOf';
-
-/**
- * Gets the associative array value for `key`.
- *
- * @private
- * @param {Array} array The array to query.
- * @param {string} key The key of the value to get.
- * @returns {*} Returns the entry value.
- */
-function assocGet(array, key) {
-  var index = assocIndexOf(array, key);
-  return index < 0 ? undefined : array[index][1];
-}
-
-export default assocGet;

_assocIndexOf.js

@@ -1,8 +1,7 @@
 import eq from './eq';
 
 /**
- * Gets the index at which the first occurrence of `key` is found in `array`
+ * Gets the index at which the `key` is found in `array` of key-value pairs.
- * of key-value pairs.
  *
  * @private
  * @param {Array} array The array to search.

_assocSet.js

@@ -1,20 +0,0 @@
-import assocIndexOf from './_assocIndexOf';
-
-/**
- * Sets the associative array `key` to `value`.
- *
- * @private
- * @param {Array} array The array to modify.
- * @param {string} key The key of the value to set.
- * @param {*} value The value to set.
- */
-function assocSet(array, key, value) {
-  var index = assocIndexOf(array, key);
-  if (index < 0) {
-    array.push([key, value]);
-  } else {
-    array[index][1] = value;
-  }
-}
-
-export default assocSet;

_baseAt.js

@@ -6,7 +6,7 @@ import get from './get';
  * @private
  * @param {Object} object The object to iterate over.
  * @param {string[]} paths The property paths of elements to pick.
- * @returns {Array} Returns the new array of picked elements.
+ * @returns {Array} Returns the picked elements.
  */
 function baseAt(object, paths) {
   var index = -1,

_baseClone.js

@@ -2,10 +2,10 @@ import Stack from './_Stack';
 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 getAllKeys from './_getAllKeys';
 import getTag from './_getTag';
 import initCloneArray from './_initCloneArray';
 import initCloneByTag from './_initCloneByTag';
@@ -14,6 +14,7 @@ import isArray from './isArray';
 import isBuffer from './isBuffer';
 import isHostObject from './_isHostObject';
 import isObject from './isObject';
+import keys from './keys';
 
 /** `Object#toString` result references. */
 var argsTag = '[object Arguments]',
@@ -33,6 +34,7 @@ var argsTag = '[object Arguments]',
     weakMapTag = '[object WeakMap]';
 
 var arrayBufferTag = '[object ArrayBuffer]',
+    dataViewTag = '[object DataView]',
     float32Tag = '[object Float32Array]',
     float64Tag = '[object Float64Array]',
     int8Tag = '[object Int8Array]',
@@ -46,16 +48,16 @@ var arrayBufferTag = '[object ArrayBuffer]',
 /** Used to identify `toStringTag` values supported by `_.clone`. */
 var cloneableTags = {};
 cloneableTags[argsTag] = cloneableTags[arrayTag] =
-cloneableTags[arrayBufferTag] = cloneableTags[boolTag] =
+cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =
-cloneableTags[dateTag] = cloneableTags[float32Tag] =
+cloneableTags[boolTag] = cloneableTags[dateTag] =
-cloneableTags[float64Tag] = cloneableTags[int8Tag] =
+cloneableTags[float32Tag] = cloneableTags[float64Tag] =
-cloneableTags[int16Tag] = cloneableTags[int32Tag] =
+cloneableTags[int8Tag] = cloneableTags[int16Tag] =
-cloneableTags[mapTag] = cloneableTags[numberTag] =
+cloneableTags[int32Tag] = cloneableTags[mapTag] =
-cloneableTags[objectTag] = cloneableTags[regexpTag] =
+cloneableTags[numberTag] = cloneableTags[objectTag] =
-cloneableTags[setTag] = cloneableTags[stringTag] =
+cloneableTags[regexpTag] = cloneableTags[setTag] =
-cloneableTags[symbolTag] = cloneableTags[uint8Tag] =
+cloneableTags[stringTag] = cloneableTags[symbolTag] =
-cloneableTags[uint8ClampedTag] = cloneableTags[uint16Tag] =
+cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =
-cloneableTags[uint32Tag] = true;
+cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;
 cloneableTags[errorTag] = cloneableTags[funcTag] =
 cloneableTags[weakMapTag] = false;
 
@@ -103,14 +105,13 @@ function baseClone(value, isDeep, isFull, customizer, key, object, stack) {
       }
       result = initCloneObject(isFunc ? {} : value);
       if (!isDeep) {
-        result = baseAssign(result, value);
+        return copySymbols(value, baseAssign(result, value));
-        return isFull ? copySymbols(value, result) : result;
       }
     } else {
       if (!cloneableTags[tag]) {
         return object ? value : {};
       }
-      result = initCloneByTag(value, tag, isDeep);
+      result = initCloneByTag(value, tag, baseClone, isDeep);
     }
   }
   // Check for circular references and return its corresponding clone.
@@ -121,11 +122,18 @@ function baseClone(value, isDeep, isFull, customizer, key, object, stack) {
   }
   stack.set(value, result);
 
+  if (!isArr) {
+    var props = isFull ? getAllKeys(value) : keys(value);
+  }
   // Recursively populate clone (susceptible to call stack limits).
-  (isArr ? arrayEach : baseForOwn)(value, function(subValue, key) {
+  arrayEach(props || value, function(subValue, key) {
+    if (props) {
+      key = subValue;
+      subValue = value[key];
+    }
     assignValue(result, key, baseClone(subValue, isDeep, isFull, customizer, key, value, stack));
   });
-  return (isFull && !isArr) ? copySymbols(value, result) : result;
+  return result;
 }
 
 export default baseClone;

_baseConforms.js

@@ -5,7 +5,7 @@ import keys from './keys';
  *
  * @private
  * @param {Object} source The object of property predicates to conform to.
- * @returns {Function} Returns the new function.
+ * @returns {Function} Returns the new spec function.
  */
 function baseConforms(source) {
   var props = keys(source),
@@ -21,7 +21,8 @@ function baseConforms(source) {
           predicate = source[key],
           value = object[key];
 
-      if ((value === undefined && !(key in Object(object))) || !predicate(value)) {
+      if ((value === undefined &&
+          !(key in Object(object))) || !predicate(value)) {
         return false;
       }
     }

_baseDifference.js

@@ -9,8 +9,8 @@ import cacheHas from './_cacheHas';
 var LARGE_ARRAY_SIZE = 200;
 
 /**
- * The base implementation of methods like `_.difference` without support for
+ * The base implementation of methods like `_.difference` without support
- * excluding multiple arrays or iteratee shorthands.
+ * for excluding multiple arrays or iteratee shorthands.
  *
  * @private
  * @param {Array} array The array to inspect.
@@ -47,6 +47,7 @@ function baseDifference(array, values, iteratee, comparator) {
     var value = array[index],
         computed = iteratee ? iteratee(value) : value;
 
+    value = (comparator || value !== 0) ? value : 0;
     if (isCommon && computed === computed) {
       var valuesIndex = valuesLength;
       while (valuesIndex--) {

_baseEvery.js

@@ -6,7 +6,8 @@ import baseEach from './_baseEach';
  * @private
  * @param {Array|Object} collection The collection to iterate over.
  * @param {Function} predicate The function invoked per iteration.
- * @returns {boolean} Returns `true` if all elements pass the predicate check, else `false`
+ * @returns {boolean} Returns `true` if all elements pass the predicate check,
+ *  else `false`
  */
 function baseEvery(collection, predicate) {
   var result = true;

_baseExtremum.js

@@ -1,3 +1,5 @@
+import isSymbol from './isSymbol';
+
 /**
  * The base implementation of methods like `_.max` and `_.min` which accepts a
  * `comparator` to determine the extremum value.
@@ -17,7 +19,7 @@ function baseExtremum(array, iteratee, comparator) {
         current = iteratee(value);
 
     if (current != null && (computed === undefined
-          ? current === current
+          ? (current === current && !isSymbol(current))
           : comparator(current, computed)
         )) {
       var computed = current,

_baseFind.js

@@ -7,7 +7,8 @@
  * @param {Array|Object} collection The collection to search.
  * @param {Function} predicate The function invoked per iteration.
  * @param {Function} eachFunc The function to iterate over `collection`.
- * @param {boolean} [retKey] Specify returning the key of the found element instead of the element itself.
+ * @param {boolean} [retKey] Specify returning the key of the found element
+ *  instead of the element itself.
  * @returns {*} Returns the found element or its key, else `undefined`.
  */
 function baseFind(collection, predicate, eachFunc, retKey) {

_baseFlatten.js

@@ -1,7 +1,5 @@
 import arrayPush from './_arrayPush';
-import isArguments from './isArguments';
+import isFlattenable from './_isFlattenable';
-import isArray from './isArray';
-import isArrayLikeObject from './isArrayLikeObject';
 
 /**
  * The base implementation of `_.flatten` with support for restricting flattening.
@@ -9,23 +7,24 @@ import isArrayLikeObject from './isArrayLikeObject';
  * @private
  * @param {Array} array The array to flatten.
  * @param {number} depth The maximum recursion depth.
- * @param {boolean} [isStrict] Restrict flattening to arrays-like objects.
+ * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.
+ * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.
  * @param {Array} [result=[]] The initial result value.
  * @returns {Array} Returns the new flattened array.
  */
-function baseFlatten(array, depth, isStrict, result) {
+function baseFlatten(array, depth, predicate, isStrict, result) {
-  result || (result = []);
-
   var index = -1,
       length = array.length;
 
+  predicate || (predicate = isFlattenable);
+  result || (result = []);
+
   while (++index < length) {
     var value = array[index];
-    if (depth > 0 && isArrayLikeObject(value) &&
+    if (depth > 0 && predicate(value)) {
-        (isStrict || isArray(value) || isArguments(value))) {
       if (depth > 1) {
         // Recursively flatten arrays (susceptible to call stack limits).
-        baseFlatten(value, depth - 1, isStrict, result);
+        baseFlatten(value, depth - 1, predicate, isStrict, result);
       } else {
         arrayPush(result, value);
       }

_baseFor.js

@@ -1,10 +1,9 @@
 import createBaseFor from './_createBaseFor';
 
 /**
- * The base implementation of `baseForIn` and `baseForOwn` which iterates
+ * The base implementation of `baseForOwn` which iterates over `object`
- * over `object` properties returned by `keysFunc` invoking `iteratee` for
+ * properties returned by `keysFunc` and invokes `iteratee` for each property.
- * each property. Iteratee functions may exit iteration early by explicitly
+ * Iteratee functions may exit iteration early by explicitly returning `false`.
- * returning `false`.
  *
  * @private
  * @param {Object} object The object to iterate over.

_baseForIn.js

@@ -1,16 +0,0 @@
-import baseFor from './_baseFor';
-import keysIn from './keysIn';
-
-/**
- * The base implementation of `_.forIn` without support for iteratee shorthands.
- *
- * @private
- * @param {Object} object The object to iterate over.
- * @param {Function} iteratee The function invoked per iteration.
- * @returns {Object} Returns `object`.
- */
-function baseForIn(object, iteratee) {
-  return object == null ? object : baseFor(object, iteratee, keysIn);
-}
-
-export default baseForIn;

_baseFunctions.js

@@ -8,7 +8,7 @@ import isFunction from './isFunction';
  * @private
  * @param {Object} object The object to inspect.
  * @param {Array} props The property names to filter.
- * @returns {Array} Returns the new array of filtered property names.
+ * @returns {Array} Returns the function names.
  */
 function baseFunctions(object, props) {
   return arrayFilter(props, function(key) {

_baseGet.js

@@ -1,5 +1,6 @@
-import baseCastPath from './_baseCastPath';
+import castPath from './_castPath';
 import isKey from './_isKey';
+import toKey from './_toKey';
 
 /**
  * The base implementation of `_.get` without support for default values.
@@ -10,13 +11,13 @@ import isKey from './_isKey';
  * @returns {*} Returns the resolved value.
  */
 function baseGet(object, path) {
-  path = isKey(path, object) ? [path + ''] : baseCastPath(path);
+  path = isKey(path, object) ? [path] : castPath(path);
 
   var index = 0,
       length = path.length;
 
   while (object != null && index < length) {
-    object = object[path[index++]];
+    object = object[toKey(path[index++])];
   }
   return (index && index == length) ? object : undefined;
 }

_baseGetAllKeys.js

@@ -0,0 +1,20 @@
+import arrayPush from './_arrayPush';
+import isArray from './isArray';
+
+/**
+ * The base implementation of `getAllKeys` and `getAllKeysIn` which uses
+ * `keysFunc` and `symbolsFunc` to get the enumerable property names and
+ * symbols of `object`.
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @param {Function} keysFunc The function to get the keys of `object`.
+ * @param {Function} symbolsFunc The function to get the symbols of `object`.
+ * @returns {Array} Returns the array of property names and symbols.
+ */
+function baseGetAllKeys(object, keysFunc, symbolsFunc) {
+  var result = keysFunc(object);
+  return isArray(object) ? result : arrayPush(result, symbolsFunc(object));
+}
+
+export default baseGetAllKeys;

_baseGt.js

@@ -0,0 +1,14 @@
+/**
+ * The base implementation of `_.gt` which doesn't coerce arguments to numbers.
+ *
+ * @private
+ * @param {*} value The value to compare.
+ * @param {*} other The other value to compare.
+ * @returns {boolean} Returns `true` if `value` is greater than `other`,
+ *  else `false`.
+ */
+function baseGt(value, other) {
+  return value > other;
+}
+
+export default baseGt;

_baseHas.js

@@ -1,12 +1,11 @@
+import getPrototype from './_getPrototype';
+
 /** Used for built-in method references. */
 var objectProto = Object.prototype;
 
 /** Used to check objects for own properties. */
 var hasOwnProperty = objectProto.hasOwnProperty;
 
-/** Built-in value references. */
-var getPrototypeOf = Object.getPrototypeOf;
-
 /**
  * The base implementation of `_.has` without support for deep paths.
  *
@@ -20,7 +19,7 @@ function baseHas(object, key) {
   // that are composed entirely of index properties, return `false` for
   // `hasOwnProperty` checks of them.
   return hasOwnProperty.call(object, key) ||
-    (typeof object == 'object' && key in object && getPrototypeOf(object) === null);
+    (typeof object == 'object' && key in object && getPrototype(object) === null);
 }
 
 export default baseHas;

_baseIntersection.js

@@ -47,6 +47,7 @@ function baseIntersection(arrays, iteratee, comparator) {
     var value = array[index],
         computed = iteratee ? iteratee(value) : value;
 
+    value = (comparator || value !== 0) ? value : 0;
     if (!(seen
           ? cacheHas(seen, computed)
           : includes(result, computed, comparator)

_baseInvoke.js

@@ -1,8 +1,9 @@
 import apply from './_apply';
-import baseCastPath from './_baseCastPath';
+import castPath from './_castPath';
 import isKey from './_isKey';
 import last from './last';
 import parent from './_parent';
+import toKey from './_toKey';
 
 /**
  * The base implementation of `_.invoke` without support for individual
@@ -16,11 +17,11 @@ import parent from './_parent';
  */
 function baseInvoke(object, path, args) {
   if (!isKey(path, object)) {
-    path = baseCastPath(path);
+    path = castPath(path);
     object = parent(object, path);
     path = last(path);
   }
-  var func = object == null ? object : object[path];
+  var func = object == null ? object : object[toKey(path)];
   return func == null ? undefined : apply(func, object, args);
 }
 

_baseIsEqualDeep.js

@@ -31,7 +31,8 @@ var hasOwnProperty = objectProto.hasOwnProperty;
  * @param {Object} other The other object to compare.
  * @param {Function} equalFunc The function to determine equivalents of values.
  * @param {Function} [customizer] The function to customize comparisons.
- * @param {number} [bitmask] The bitmask of comparison flags. See `baseIsEqual` for more details.
+ * @param {number} [bitmask] The bitmask of comparison flags. See `baseIsEqual`
+ *  for more details.
  * @param {Object} [stack] Tracks traversed `object` and `other` objects.
  * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
  */
@@ -64,8 +65,11 @@ function baseIsEqualDeep(object, other, equalFunc, customizer, bitmask, stack) {
         othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');
 
     if (objIsWrapped || othIsWrapped) {
+      var objUnwrapped = objIsWrapped ? object.value() : object,
+          othUnwrapped = othIsWrapped ? other.value() : other;
+
       stack || (stack = new Stack);
-      return equalFunc(objIsWrapped ? object.value() : object, othIsWrapped ? other.value() : other, customizer, bitmask, stack);
+      return equalFunc(objUnwrapped, othUnwrapped, customizer, bitmask, stack);
     }
   }
   if (!isSameTag) {

_baseIsMatch.js

@@ -44,9 +44,10 @@ function baseIsMatch(object, source, matchData, customizer) {
         return false;
       }
     } else {
-      var stack = new Stack,
+      var stack = new Stack;
-          result = customizer ? customizer(objValue, srcValue, key, object, source, stack) : undefined;
+      if (customizer) {
-
+        var result = customizer(objValue, srcValue, key, object, source, stack);
+      }
       if (!(result === undefined
             ? baseIsEqual(srcValue, objValue, customizer, UNORDERED_COMPARE_FLAG | PARTIAL_COMPARE_FLAG, stack)
             : result

_baseIteratee.js

@@ -12,14 +12,15 @@ import property from './property';
  * @returns {Function} Returns the iteratee.
  */
 function baseIteratee(value) {
-  var type = typeof value;
+  // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.
-  if (type == 'function') {
+  // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.
+  if (typeof value == 'function') {
     return value;
   }
   if (value == null) {
     return identity;
   }
-  if (type == 'object') {
+  if (typeof value == 'object') {
     return isArray(value)
       ? baseMatchesProperty(value[0], value[1])
       : baseMatches(value);

_baseLodash.js

@@ -1,5 +1,5 @@
 /**
- * The function whose prototype all chaining wrappers inherit from.
+ * The function whose prototype chain sequence wrappers inherit from.
  *
  * @private
  */

_baseLt.js

@@ -0,0 +1,14 @@
+/**
+ * The base implementation of `_.lt` which doesn't coerce arguments to numbers.
+ *
+ * @private
+ * @param {*} value The value to compare.
+ * @param {*} other The other value to compare.
+ * @returns {boolean} Returns `true` if `value` is less than `other`,
+ *  else `false`.
+ */
+function baseLt(value, other) {
+  return value < other;
+}
+
+export default baseLt;

_baseMatches.js

@@ -1,26 +1,18 @@
 import baseIsMatch from './_baseIsMatch';
 import getMatchData from './_getMatchData';
+import matchesStrictComparable from './_matchesStrictComparable';
 
 /**
  * The base implementation of `_.matches` which doesn't clone `source`.
  *
  * @private
  * @param {Object} source The object of property values to match.
- * @returns {Function} Returns the new function.
+ * @returns {Function} Returns the new spec function.
  */
 function baseMatches(source) {
   var matchData = getMatchData(source);
   if (matchData.length == 1 && matchData[0][2]) {
-    var key = matchData[0][0],
+    return matchesStrictComparable(matchData[0][0], matchData[0][1]);
-        value = matchData[0][1];
-
-    return function(object) {
-      if (object == null) {
-        return false;
-      }
-      return object[key] === value &&
-        (value !== undefined || (key in Object(object)));
-    };
   }
   return function(object) {
     return object === source || baseIsMatch(object, source, matchData);

_baseMatchesProperty.js

@@ -1,6 +1,10 @@
 import baseIsEqual from './_baseIsEqual';
 import get from './get';
 import hasIn from './hasIn';
+import isKey from './_isKey';
+import isStrictComparable from './_isStrictComparable';
+import matchesStrictComparable from './_matchesStrictComparable';
+import toKey from './_toKey';
 
 /** Used to compose bitmasks for comparison styles. */
 var UNORDERED_COMPARE_FLAG = 1,
@@ -12,9 +16,12 @@ var UNORDERED_COMPARE_FLAG = 1,
  * @private
  * @param {string} path The path of the property to get.
  * @param {*} srcValue The value to match.
- * @returns {Function} Returns the new function.
+ * @returns {Function} Returns the new spec function.
  */
 function baseMatchesProperty(path, srcValue) {
+  if (isKey(path) && isStrictComparable(srcValue)) {
+    return matchesStrictComparable(toKey(path), srcValue);
+  }
   return function(object) {
     var objValue = get(object, path);
     return (objValue === undefined && objValue === srcValue)

_baseMean.js

@@ -0,0 +1,20 @@
+import baseSum from './_baseSum';
+
+/** Used as references for various `Number` constants. */
+var NAN = 0 / 0;
+
+/**
+ * The base implementation of `_.mean` and `_.meanBy` without support for
+ * iteratee shorthands.
+ *
+ * @private
+ * @param {Array} array The array to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {number} Returns the mean.
+ */
+function baseMean(array, iteratee) {
+  var length = array ? array.length : 0;
+  return length ? (baseSum(array, iteratee) / length) : NAN;
+}
+
+export default baseMean;

_baseMerge.js

@@ -15,16 +15,16 @@ import keysIn from './keysIn';
  * @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.
+ * @param {Object} [stack] Tracks traversed source values and their merged
+ *  counterparts.
  */
 function baseMerge(object, source, srcIndex, customizer, stack) {
   if (object === source) {
     return;
   }
-  var props = (isArray(source) || isTypedArray(source))
+  if (!(isArray(source) || isTypedArray(source))) {
-    ? undefined
+    var props = keysIn(source);
-    : keysIn(source);
+  }
-
   arrayEach(props || source, function(srcValue, key) {
     if (props) {
       key = srcValue;

_baseMergeDeep.js

@@ -22,7 +22,8 @@ import toPlainObject from './toPlainObject';
  * @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.
+ * @param {Object} [stack] Tracks traversed source values and their merged
+ *  counterparts.
  */
 function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {
   var objValue = object[key],
@@ -50,7 +51,7 @@ function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, sta
       }
       else {
         isCommon = false;
-        newValue = baseClone(srcValue, !customizer);
+        newValue = baseClone(srcValue, true);
       }
     }
     else if (isPlainObject(srcValue) || isArguments(srcValue)) {
@@ -59,7 +60,7 @@ function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, sta
       }
       else if (!isObject(objValue) || (srcIndex && isFunction(objValue))) {
         isCommon = false;
-        newValue = baseClone(srcValue, !customizer);
+        newValue = baseClone(srcValue, true);
       }
       else {
         newValue = objValue;

_baseNth.js

@@ -0,0 +1,20 @@
+import isIndex from './_isIndex';
+
+/**
+ * The base implementation of `_.nth` which doesn't coerce `n` to an integer.
+ *
+ * @private
+ * @param {Array} array The array to query.
+ * @param {number} n The index of the element to return.
+ * @returns {*} Returns the nth element of `array`.
+ */
+function baseNth(array, n) {
+  var length = array.length;
+  if (!length) {
+    return;
+  }
+  n += n < 0 ? length : 0;
+  return isIndex(n, length) ? array[n] : undefined;
+}
+
+export default baseNth;

_baseOrderBy.js

@@ -2,7 +2,9 @@ import arrayMap from './_arrayMap';
 import baseIteratee from './_baseIteratee';
 import baseMap from './_baseMap';
 import baseSortBy from './_baseSortBy';
+import baseUnary from './_baseUnary';
 import compareMultiple from './_compareMultiple';
+import identity from './identity';
 
 /**
  * The base implementation of `_.orderBy` without param guards.
@@ -15,7 +17,7 @@ import compareMultiple from './_compareMultiple';
  */
 function baseOrderBy(collection, iteratees, orders) {
   var index = -1;
-  iteratees = arrayMap(iteratees.length ? iteratees : Array(1), baseIteratee);
+  iteratees = arrayMap(iteratees.length ? iteratees : [identity], baseUnary(baseIteratee));
 
   var result = baseMap(collection, function(value, key, collection) {
     var criteria = arrayMap(iteratees, function(iteratee) {

_basePick.js

@@ -2,11 +2,11 @@ import arrayReduce from './_arrayReduce';
 
 /**
  * The base implementation of `_.pick` without support for individual
- * property names.
+ * property identifiers.
  *
  * @private
  * @param {Object} object The source object.
- * @param {string[]} props The property names to pick.
+ * @param {string[]} props The property identifiers to pick.
  * @returns {Object} Returns the new object.
  */
 function basePick(object, props) {

_basePickBy.js

@@ -1,4 +1,4 @@
-import baseForIn from './_baseForIn';
+import getAllKeysIn from './_getAllKeysIn';
 
 /**
  * The base implementation of  `_.pickBy` without support for iteratee shorthands.
@@ -9,12 +9,19 @@ import baseForIn from './_baseForIn';
  * @returns {Object} Returns the new object.
  */
 function basePickBy(object, predicate) {
-  var result = {};
+  var index = -1,
-  baseForIn(object, function(value, key) {
+      props = getAllKeysIn(object),
+      length = props.length,
+      result = {};
+
+  while (++index < length) {
+    var key = props[index],
+        value = object[key];
+
     if (predicate(value, key)) {
       result[key] = value;
     }
-  });
+  }
   return result;
 }
 

_baseProperty.js

@@ -3,7 +3,7 @@
  *
  * @private
  * @param {string} key The key of the property to get.
- * @returns {Function} Returns the new function.
+ * @returns {Function} Returns the new accessor function.
  */
 function baseProperty(key) {
   return function(object) {

_basePropertyDeep.js

@@ -5,7 +5,7 @@ import baseGet from './_baseGet';
  *
  * @private
  * @param {Array|string} path The path of the property to get.
- * @returns {Function} Returns the new function.
+ * @returns {Function} Returns the new accessor function.
  */
 function basePropertyDeep(path) {
   return function(object) {

_basePullAt.js

@@ -1,8 +1,9 @@
-import baseCastPath from './_baseCastPath';
+import castPath from './_castPath';
 import isIndex from './_isIndex';
 import isKey from './_isKey';
 import last from './last';
 import parent from './_parent';
+import toKey from './_toKey';
 
 /** Used for built-in method references. */
 var arrayProto = Array.prototype;
@@ -25,21 +26,21 @@ function basePullAt(array, indexes) {
 
   while (length--) {
     var index = indexes[length];
-    if (lastIndex == length || index != previous) {
+    if (length == lastIndex || index !== previous) {
       var previous = index;
       if (isIndex(index)) {
         splice.call(array, index, 1);
       }
       else if (!isKey(index, array)) {
-        var path = baseCastPath(index),
+        var path = castPath(index),
             object = parent(array, path);
 
         if (object != null) {
-          delete object[last(path)];
+          delete object[toKey(last(path))];
         }
       }
       else {
-        delete array[index];
+        delete array[toKey(index)];
       }
     }
   }

_baseRange.js

@@ -11,7 +11,7 @@ var nativeCeil = Math.ceil,
  * @param {number} end The end of the range.
  * @param {number} step The value to increment or decrement by.
  * @param {boolean} [fromRight] Specify iterating from right to left.
- * @returns {Array} Returns the new array of numbers.
+ * @returns {Array} Returns the range of numbers.
  */
 function baseRange(start, end, step, fromRight) {
   var index = -1,

_baseReduce.js

@@ -6,7 +6,8 @@
  * @param {Array|Object} collection The collection to iterate over.
  * @param {Function} iteratee The function invoked per iteration.
  * @param {*} accumulator The initial value.
- * @param {boolean} initAccum 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.
  */

_baseRepeat.js

@@ -0,0 +1,35 @@
+/** Used as references for various `Number` constants. */
+var MAX_SAFE_INTEGER = 9007199254740991;
+
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeFloor = Math.floor;
+
+/**
+ * The base implementation of `_.repeat` which doesn't coerce arguments.
+ *
+ * @private
+ * @param {string} string The string to repeat.
+ * @param {number} n The number of times to repeat the string.
+ * @returns {string} Returns the repeated string.
+ */
+function baseRepeat(string, n) {
+  var result = '';
+  if (!string || n < 1 || n > MAX_SAFE_INTEGER) {
+    return result;
+  }
+  // Leverage the exponentiation by squaring algorithm for a faster repeat.
+  // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.
+  do {
+    if (n % 2) {
+      result += string;
+    }
+    n = nativeFloor(n / 2);
+    if (n) {
+      string += string;
+    }
+  } while (n);
+
+  return result;
+}
+
+export default baseRepeat;

_baseSet.js

@@ -1,8 +1,9 @@
 import assignValue from './_assignValue';
-import baseCastPath from './_baseCastPath';
+import castPath from './_castPath';
 import isIndex from './_isIndex';
 import isKey from './_isKey';
 import isObject from './isObject';
+import toKey from './_toKey';
 
 /**
  * The base implementation of `_.set`.
@@ -15,7 +16,7 @@ import isObject from './isObject';
  * @returns {Object} Returns `object`.
  */
 function baseSet(object, path, value, customizer) {
-  path = isKey(path, object) ? [path + ''] : baseCastPath(path);
+  path = isKey(path, object) ? [path] : castPath(path);
 
   var index = -1,
       length = path.length,
@@ -23,7 +24,7 @@ function baseSet(object, path, value, customizer) {
       nested = object;
 
   while (nested != null && ++index < length) {
-    var key = path[index];
+    var key = toKey(path[index]);
     if (isObject(nested)) {
       var newValue = value;
       if (index != lastIndex) {

_baseSome.js

@@ -6,7 +6,8 @@ import baseEach from './_baseEach';
  * @private
  * @param {Array|Object} collection The collection to iterate over.
  * @param {Function} predicate The function invoked per iteration.
- * @returns {boolean} Returns `true` if any element passes the predicate check, else `false`.
+ * @returns {boolean} Returns `true` if any element passes the predicate check,
+ *  else `false`.
  */
 function baseSome(collection, predicate) {
   var result;

_baseSortedIndex.js

@@ -1,5 +1,6 @@
 import baseSortedIndexBy from './_baseSortedIndexBy';
 import identity from './identity';
+import isSymbol from './isSymbol';
 
 /** Used as references for the maximum length and index of an array. */
 var MAX_ARRAY_LENGTH = 4294967295,
@@ -26,7 +27,8 @@ function baseSortedIndex(array, value, retHighest) {
       var mid = (low + high) >>> 1,
           computed = array[mid];
 
-      if ((retHighest ? (computed <= value) : (computed < value)) && computed !== null) {
+      if (computed !== null && !isSymbol(computed) &&
+          (retHighest ? (computed <= value) : (computed < value))) {
         low = mid + 1;
       } else {
         high = mid;

_baseSortedIndexBy.js

@@ -1,3 +1,5 @@
+import isSymbol from './isSymbol';
+
 /** Used as references for the maximum length and index of an array. */
 var MAX_ARRAY_LENGTH = 4294967295,
     MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1;
@@ -16,7 +18,8 @@ var nativeFloor = Math.floor,
  * @param {*} value The value to evaluate.
  * @param {Function} iteratee The iteratee invoked per element.
  * @param {boolean} [retHighest] Specify returning the highest qualified index.
- * @returns {number} Returns the index at which `value` should be inserted into `array`.
+ * @returns {number} Returns the index at which `value` should be inserted
+ *  into `array`.
  */
 function baseSortedIndexBy(array, value, iteratee, retHighest) {
   value = iteratee(value);
@@ -25,21 +28,26 @@ function baseSortedIndexBy(array, value, iteratee, retHighest) {
       high = array ? array.length : 0,
       valIsNaN = value !== value,
       valIsNull = value === null,
-      valIsUndef = value === undefined;
+      valIsSymbol = isSymbol(value),
+      valIsUndefined = value === undefined;
 
   while (low < high) {
     var mid = nativeFloor((low + high) / 2),
         computed = iteratee(array[mid]),
-        isDef = computed !== undefined,
+        othIsDefined = computed !== undefined,
-        isReflexive = computed === computed;
+        othIsNull = computed === null,
+        othIsReflexive = computed === computed,
+        othIsSymbol = isSymbol(computed);
 
     if (valIsNaN) {
-      var setLow = isReflexive || retHighest;
+      var setLow = retHighest || othIsReflexive;
+    } else if (valIsUndefined) {
+      setLow = othIsReflexive && (retHighest || othIsDefined);
     } else if (valIsNull) {
-      setLow = isReflexive && isDef && (retHighest || computed != null);
+      setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);
-    } else if (valIsUndef) {
+    } else if (valIsSymbol) {
-      setLow = isReflexive && (retHighest || isDef);
+      setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);
-    } else if (computed == null) {
+    } else if (othIsNull || othIsSymbol) {
       setLow = false;
     } else {
       setLow = retHighest ? (computed <= value) : (computed < value);

_baseSortedUniq.js

@@ -1,14 +1,30 @@
-import baseSortedUniqBy from './_baseSortedUniqBy';
+import eq from './eq';
 
 /**
- * The base implementation of `_.sortedUniq`.
+ * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without
+ * support for iteratee shorthands.
  *
  * @private
  * @param {Array} array The array to inspect.
+ * @param {Function} [iteratee] The iteratee invoked per element.
  * @returns {Array} Returns the new duplicate free array.
  */
-function baseSortedUniq(array) {
+function baseSortedUniq(array, iteratee) {
-  return baseSortedUniqBy(array);
+  var index = -1,
+      length = array.length,
+      resIndex = 0,
+      result = [];
+
+  while (++index < length) {
+    var value = array[index],
+        computed = iteratee ? iteratee(value) : value;
+
+    if (!index || !eq(computed, seen)) {
+      var seen = computed;
+      result[resIndex++] = value === 0 ? 0 : value;
+    }
+  }
+  return result;
 }
 
 export default baseSortedUniq;

_baseSortedUniqBy.js

@@ -1,33 +0,0 @@
-import eq from './eq';
-
-/**
- * The base implementation of `_.sortedUniqBy` without support for iteratee
- * shorthands.
- *
- * @private
- * @param {Array} array The array to inspect.
- * @param {Function} [iteratee] The iteratee invoked per element.
- * @returns {Array} Returns the new duplicate free array.
- */
-function baseSortedUniqBy(array, iteratee) {
-  var index = 0,
-      length = array.length,
-      value = array[0],
-      computed = iteratee ? iteratee(value) : value,
-      seen = computed,
-      resIndex = 1,
-      result = [value];
-
-  while (++index < length) {
-    value = array[index],
-    computed = iteratee ? iteratee(value) : value;
-
-    if (!eq(computed, seen)) {
-      seen = computed;
-      result[resIndex++] = value;
-    }
-  }
-  return result;
-}
-
-export default baseSortedUniqBy;

_baseSum.js

@@ -1,5 +1,6 @@
 /**
- * The base implementation of `_.sum` without support for iteratee shorthands.
+ * The base implementation of `_.sum` and `_.sumBy` without support for
+ * iteratee shorthands.
  *
  * @private
  * @param {Array} array The array to iterate over.

_baseToNumber.js

@@ -0,0 +1,24 @@
+import isSymbol from './isSymbol';
+
+/** Used as references for various `Number` constants. */
+var NAN = 0 / 0;
+
+/**
+ * The base implementation of `_.toNumber` which doesn't ensure correct
+ * conversions of binary, hexadecimal, or octal string values.
+ *
+ * @private
+ * @param {*} value The value to process.
+ * @returns {number} Returns the number.
+ */
+function baseToNumber(value) {
+  if (typeof value == 'number') {
+    return value;
+  }
+  if (isSymbol(value)) {
+    return NAN;
+  }
+  return +value;
+}
+
+export default baseToNumber;

_baseToPairs.js

@@ -7,7 +7,7 @@ import arrayMap from './_arrayMap';
  * @private
  * @param {Object} object The object to query.
  * @param {Array} props The property names to get values for.
- * @returns {Object} Returns the new array of key-value pairs.
+ * @returns {Object} Returns the key-value pairs.
  */
 function baseToPairs(object, props) {
   return arrayMap(props, function(key) {

_baseToString.js

@@ -0,0 +1,31 @@
+import Symbol from './_Symbol';
+import isSymbol from './isSymbol';
+
+/** Used as references for various `Number` constants. */
+var INFINITY = 1 / 0;
+
+/** Used to convert symbols to primitives and strings. */
+var symbolProto = Symbol ? Symbol.prototype : undefined,
+    symbolToString = symbolProto ? symbolProto.toString : undefined;
+
+/**
+ * The base implementation of `_.toString` which doesn't convert nullish
+ * values to empty strings.
+ *
+ * @private
+ * @param {*} value The value to process.
+ * @returns {string} Returns the string.
+ */
+function baseToString(value) {
+  // Exit early for strings to avoid a performance hit in some environments.
+  if (typeof value == 'string') {
+    return value;
+  }
+  if (isSymbol(value)) {
+    return symbolToString ? symbolToString.call(value) : '';
+  }
+  var result = (value + '');
+  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;
+}
+
+export default baseToString;

_baseUnary.js

@@ -3,7 +3,7 @@
  *
  * @private
  * @param {Function} func The function to cap arguments for.
- * @returns {Function} Returns the new function.
+ * @returns {Function} Returns the new capped function.
  */
 function baseUnary(func) {
   return function(value) {

_baseUniq.js

@@ -46,6 +46,7 @@ function baseUniq(array, iteratee, comparator) {
     var value = array[index],
         computed = iteratee ? iteratee(value) : value;
 
+    value = (comparator || value !== 0) ? value : 0;
     if (isCommon && computed === computed) {
       var seenIndex = seen.length;
       while (seenIndex--) {

_baseUnset.js

@@ -1,8 +1,9 @@
-import baseCastPath from './_baseCastPath';
+import baseHas from './_baseHas';
-import has from './has';
+import castPath from './_castPath';
 import isKey from './_isKey';
 import last from './last';
 import parent from './_parent';
+import toKey from './_toKey';
 
 /**
  * The base implementation of `_.unset`.
@@ -13,10 +14,11 @@ import parent from './_parent';
  * @returns {boolean} Returns `true` if the property is deleted, else `false`.
  */
 function baseUnset(object, path) {
-  path = isKey(path, object) ? [path + ''] : baseCastPath(path);
+  path = isKey(path, object) ? [path] : castPath(path);
   object = parent(object, path);
-  var key = last(path);
+
-  return (object != null && has(object, key)) ? delete object[key] : true;
+  var key = toKey(last(path));
+  return !(object != null && baseHas(object, key)) || delete object[key];
 }
 
 export default baseUnset;

_baseZipObject.js

@@ -2,7 +2,7 @@
  * This base implementation of `_.zipObject` which assigns values using `assignFunc`.
  *
  * @private
- * @param {Array} props The property names.
+ * @param {Array} props The property identifiers.
  * @param {Array} values The property values.
  * @param {Function} assignFunc The function to assign values.
  * @returns {Object} Returns the new object.
@@ -14,7 +14,8 @@ function baseZipObject(props, values, assignFunc) {
       result = {};
 
   while (++index < length) {
-    assignFunc(result, props[index], index < valsLength ? values[index] : undefined);
+    var value = index < valsLength ? values[index] : undefined;
+    assignFunc(result, props[index], value);
   }
   return result;
 }

_cacheHas.js

@@ -1,25 +1,13 @@
-import isKeyable from './_isKeyable';
-
-/** Used to stand-in for `undefined` hash values. */
-var HASH_UNDEFINED = '__lodash_hash_undefined__';
-
 /**
- * Checks if `value` is in `cache`.
+ * Checks if a cache value for `key` exists.
  *
  * @private
- * @param {Object} cache The set cache to search.
+ * @param {Object} cache The cache to query.
- * @param {*} value The value to search for.
+ * @param {string} key The key of the entry to check.
- * @returns {number} Returns `true` if `value` is found, else `false`.
+ * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
  */
-function cacheHas(cache, value) {
+function cacheHas(cache, key) {
-  var map = cache.__data__;
+  return cache.has(key);
-  if (isKeyable(value)) {
-    var data = map.__data__,
-        hash = typeof value == 'string' ? data.string : data.hash;
-
-    return hash[value] === HASH_UNDEFINED;
-  }
-  return map.has(value);
 }
 
 export default cacheHas;

_cachePush.js

@@ -1,27 +0,0 @@
-import isKeyable from './_isKeyable';
-
-/** Used to stand-in for `undefined` hash values. */
-var HASH_UNDEFINED = '__lodash_hash_undefined__';
-
-/**
- * Adds `value` to the set cache.
- *
- * @private
- * @name push
- * @memberOf SetCache
- * @param {*} value The value to cache.
- */
-function cachePush(value) {
-  var map = this.__data__;
-  if (isKeyable(value)) {
-    var data = map.__data__,
-        hash = typeof value == 'string' ? data.string : data.hash;
-
-    hash[value] = HASH_UNDEFINED;
-  }
-  else {
-    map.set(value, HASH_UNDEFINED);
-  }
-}
-
-export default cachePush;

_castArrayLikeObject.js

@@ -5,10 +5,10 @@ import isArrayLikeObject from './isArrayLikeObject';
  *
  * @private
  * @param {*} value The value to inspect.
- * @returns {Array} Returns the array-like object.
+ * @returns {Array|Object} Returns the cast array-like object.
  */
-function baseCastArrayLikeObject(value) {
+function castArrayLikeObject(value) {
   return isArrayLikeObject(value) ? value : [];
 }
 
-export default baseCastArrayLikeObject;
+export default castArrayLikeObject;

_castFunction.js

@@ -5,10 +5,10 @@ import identity from './identity';
  *
  * @private
  * @param {*} value The value to inspect.
- * @returns {Array} Returns the array-like object.
+ * @returns {Function} Returns cast function.
  */
-function baseCastFunction(value) {
+function castFunction(value) {
   return typeof value == 'function' ? value : identity;
 }
 
-export default baseCastFunction;
+export default castFunction;

_castPath.js

@@ -8,8 +8,8 @@ import stringToPath from './_stringToPath';
  * @param {*} value The value to inspect.
  * @returns {Array} Returns the cast property path array.
  */
-function baseCastPath(value) {
+function castPath(value) {
   return isArray(value) ? value : stringToPath(value);
 }
 
-export default baseCastPath;
+export default castPath;

_castSlice.js

@@ -0,0 +1,18 @@
+import baseSlice from './_baseSlice';
+
+/**
+ * Casts `array` to a slice if it's needed.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {number} start The start position.
+ * @param {number} [end=array.length] The end position.
+ * @returns {Array} Returns the cast slice.
+ */
+function castSlice(array, start, end) {
+  var length = array.length;
+  end = end === undefined ? length : end;
+  return (!start && end >= length) ? array : baseSlice(array, start, end);
+}
+
+export default castSlice;

_cloneDataView.js

@@ -0,0 +1,16 @@
+import cloneArrayBuffer from './_cloneArrayBuffer';
+
+/**
+ * Creates a clone of `dataView`.
+ *
+ * @private
+ * @param {Object} dataView The data view to clone.
+ * @param {boolean} [isDeep] Specify a deep clone.
+ * @returns {Object} Returns the cloned data view.
+ */
+function cloneDataView(dataView, isDeep) {
+  var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;
+  return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);
+}
+
+export default cloneDataView;

_cloneMap.js

@@ -7,10 +7,13 @@ import mapToArray from './_mapToArray';
  *
  * @private
  * @param {Object} map The map to clone.
+ * @param {Function} cloneFunc The function to clone values.
+ * @param {boolean} [isDeep] Specify a deep clone.
  * @returns {Object} Returns the cloned map.
  */
-function cloneMap(map) {
+function cloneMap(map, isDeep, cloneFunc) {
-  return arrayReduce(mapToArray(map), addMapEntry, new map.constructor);
+  var array = isDeep ? cloneFunc(mapToArray(map), true) : mapToArray(map);
+  return arrayReduce(array, addMapEntry, new map.constructor);
 }
 
 export default cloneMap;

_cloneSet.js

@@ -7,10 +7,13 @@ import setToArray from './_setToArray';
  *
  * @private
  * @param {Object} set The set to clone.
+ * @param {Function} cloneFunc The function to clone values.
+ * @param {boolean} [isDeep] Specify a deep clone.
  * @returns {Object} Returns the cloned set.
  */
-function cloneSet(set) {
+function cloneSet(set, isDeep, cloneFunc) {
-  return arrayReduce(setToArray(set), addSetEntry, new set.constructor);
+  var array = isDeep ? cloneFunc(setToArray(set), true) : setToArray(set);
+  return arrayReduce(array, addSetEntry, new set.constructor);
 }
 
 export default cloneSet;

_compareAscending.js

@@ -1,3 +1,5 @@
+import isSymbol from './isSymbol';
+
 /**
  * Compares values to sort them in ascending order.
  *
@@ -8,22 +10,28 @@
  */
 function compareAscending(value, other) {
   if (value !== other) {
-    var valIsNull = value === null,
+    var valIsDefined = value !== undefined,
-        valIsUndef = value === undefined,
+        valIsNull = value === null,
-        valIsReflexive = value === value;
+        valIsReflexive = value === value,
+        valIsSymbol = isSymbol(value);
 
-    var othIsNull = other === null,
+    var othIsDefined = other !== undefined,
-        othIsUndef = other === undefined,
+        othIsNull = other === null,
-        othIsReflexive = other === other;
+        othIsReflexive = other === other,
+        othIsSymbol = isSymbol(other);
 
-    if ((value > other && !othIsNull) || !valIsReflexive ||
+    if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||
-        (valIsNull && !othIsUndef && othIsReflexive) ||
+        (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||
-        (valIsUndef && othIsReflexive)) {
+        (valIsNull && othIsDefined && othIsReflexive) ||
+        (!valIsDefined && othIsReflexive) ||
+        !valIsReflexive) {
       return 1;
     }
-    if ((value < other && !valIsNull) || !othIsReflexive ||
+    if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||
-        (othIsNull && !valIsUndef && valIsReflexive) ||
+        (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||
-        (othIsUndef && valIsReflexive)) {
+        (othIsNull && valIsDefined && valIsReflexive) ||
+        (!othIsDefined && valIsReflexive) ||
+        !othIsReflexive) {
       return -1;
     }
   }

_compareMultiple.js

@@ -37,7 +37,7 @@ function compareMultiple(object, other, orders) {
   // for more details.
   //
   // This also ensures a stable sort in V8 and other engines.
-  // See https://code.google.com/p/v8/issues/detail?id=90 for more details.
+  // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.
   return object.index - other.index;
 }
 

_composeArgs.js

@@ -6,7 +6,7 @@ var nativeMax = Math.max;
  * placeholders, and provided arguments into a single array of arguments.
  *
  * @private
- * @param {Array|Object} args The provided arguments.
+ * @param {Array} 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.

_composeArgsRight.js

@@ -6,7 +6,7 @@ var nativeMax = Math.max;
  * is tailored for `_.partialRight`.
  *
  * @private
- * @param {Array|Object} args The provided arguments.
+ * @param {Array} 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.

_copyObject.js

@@ -1,16 +1,31 @@
-import copyObjectWith from './_copyObjectWith';
+import assignValue from './_assignValue';
 
 /**
  * Copies properties of `source` to `object`.
  *
  * @private
  * @param {Object} source The object to copy properties from.
- * @param {Array} props The property names to copy.
+ * @param {Array} props The property identifiers to copy.
  * @param {Object} [object={}] The object to copy properties to.
+ * @param {Function} [customizer] The function to customize copied values.
  * @returns {Object} Returns `object`.
  */
-function copyObject(source, props, object) {
+function copyObject(source, props, object, customizer) {
-  return copyObjectWith(source, props, object);
+  object || (object = {});
+
+  var index = -1,
+      length = props.length;
+
+  while (++index < length) {
+    var key = props[index];
+
+    var newValue = customizer
+      ? customizer(object[key], source[key], key, object, source)
+      : source[key];
+
+    assignValue(object, key, newValue);
+  }
+  return object;
 }
 
 export default copyObject;

_copyObjectWith.js

@@ -1,32 +0,0 @@
-import assignValue from './_assignValue';
-
-/**
- * This function is like `copyObject` except that it accepts a function to
- * customize copied values.
- *
- * @private
- * @param {Object} source The object to copy properties from.
- * @param {Array} props The property names to copy.
- * @param {Object} [object={}] The object to copy properties to.
- * @param {Function} [customizer] The function to customize copied values.
- * @returns {Object} Returns `object`.
- */
-function copyObjectWith(source, props, object, customizer) {
-  object || (object = {});
-
-  var index = -1,
-      length = props.length;
-
-  while (++index < length) {
-    var key = props[index];
-
-    var newValue = customizer
-      ? customizer(object[key], source[key], key, object, source)
-      : source[key];
-
-    assignValue(object, key, newValue);
-  }
-  return object;
-}
-
-export default copyObjectWith;

_createAssigner.js

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

_createBaseFor.js

@@ -1,5 +1,5 @@
 /**
- * Creates a base function for methods like `_.forIn`.
+ * Creates a base function for methods like `_.forIn` and `_.forOwn`.
  *
  * @private
  * @param {boolean} [fromRight] Specify iterating from right to left.

_createBaseWrapper.js

@@ -10,7 +10,8 @@ var BIND_FLAG = 1;
  *
  * @private
  * @param {Function} func The function to wrap.
- * @param {number} bitmask The bitmask of wrapper flags. See `createWrapper` for more details.
+ * @param {number} bitmask The bitmask of wrapper flags. See `createWrapper`
+ *  for more details.
  * @param {*} [thisArg] The `this` binding of `func`.
  * @returns {Function} Returns the new wrapped function.
  */

_createCaseFirst.js

@@ -1,24 +1,14 @@
+import castSlice from './_castSlice';
+import reHasComplexSymbol from './_reHasComplexSymbol';
 import stringToArray from './_stringToArray';
 import toString from './toString';
 
-/** Used to compose unicode character classes. */
-var rsAstralRange = '\\ud800-\\udfff',
-    rsComboMarksRange = '\\u0300-\\u036f\\ufe20-\\ufe23',
-    rsComboSymbolsRange = '\\u20d0-\\u20f0',
-    rsVarRange = '\\ufe0e\\ufe0f';
-
-/** Used to compose unicode capture groups. */
-var rsZWJ = '\\u200d';
-
-/** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */
-var reHasComplexSymbol = RegExp('[' + rsZWJ + rsAstralRange  + rsComboMarksRange + rsComboSymbolsRange + rsVarRange + ']');
-
 /**
  * Creates a function like `_.lowerFirst`.
  *
  * @private
  * @param {string} methodName The name of the `String` case method to use.
- * @returns {Function} Returns the new function.
+ * @returns {Function} Returns the new case function.
  */
 function createCaseFirst(methodName) {
   return function(string) {
@@ -28,8 +18,13 @@ function createCaseFirst(methodName) {
       ? stringToArray(string)
       : undefined;
 
-    var chr = strSymbols ? strSymbols[0] : string.charAt(0),
+    var chr = strSymbols
-        trailing = strSymbols ? strSymbols.slice(1).join('') : string.slice(1);
+      ? strSymbols[0]
+      : string.charAt(0);
+
+    var trailing = strSymbols
+      ? castSlice(strSymbols, 1).join('')
+      : string.slice(1);
 
     return chr[methodName]() + trailing;
   };

_createCompounder.js

@@ -2,6 +2,12 @@ import arrayReduce from './_arrayReduce';
 import deburr from './deburr';
 import words from './words';
 
+/** Used to compose unicode capture groups. */
+var rsApos = "['\u2019]";
+
+/** Used to match apostrophes. */
+var reApos = RegExp(rsApos, 'g');
+
 /**
  * Creates a function like `_.camelCase`.
  *
@@ -11,7 +17,7 @@ import words from './words';
  */
 function createCompounder(callback) {
   return function(string) {
-    return arrayReduce(words(deburr(string)), callback, '');
+    return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');
   };
 }
 

_createCtorWrapper.js

@@ -11,8 +11,8 @@ import isObject from './isObject';
  */
 function createCtorWrapper(Ctor) {
   return function() {
-    // Use a `switch` statement to work with class constructors.
+    // Use a `switch` statement to work with class constructors. See
-    // See http://ecma-international.org/ecma-262/6.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist
+    // http://ecma-international.org/ecma-262/6.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist
     // for more details.
     var args = arguments;
     switch (args.length) {

_createCurryWrapper.js

@@ -2,7 +2,7 @@ import apply from './_apply';
 import createCtorWrapper from './_createCtorWrapper';
 import createHybridWrapper from './_createHybridWrapper';
 import createRecurryWrapper from './_createRecurryWrapper';
-import getPlaceholder from './_getPlaceholder';
+import getHolder from './_getHolder';
 import replaceHolders from './_replaceHolders';
 import root from './_root';
 
@@ -11,7 +11,8 @@ import root from './_root';
  *
  * @private
  * @param {Function} func The function to wrap.
- * @param {number} bitmask The bitmask of wrapper flags. See `createWrapper` for more details.
+ * @param {number} bitmask The bitmask of wrapper flags. See `createWrapper`
+ *  for more details.
  * @param {number} arity The arity of `func`.
  * @returns {Function} Returns the new wrapped function.
  */
@@ -22,7 +23,7 @@ function createCurryWrapper(func, bitmask, arity) {
     var length = arguments.length,
         args = Array(length),
         index = length,
-        placeholder = getPlaceholder(wrapper);
+        placeholder = getHolder(wrapper);
 
     while (index--) {
       args[index] = arguments[index];

_createFlow.js

@@ -58,7 +58,9 @@ function createFlow(fromRight) {
           ) {
         wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);
       } else {
-        wrapper = (func.length == 1 && isLaziable(func)) ? wrapper[funcName]() : wrapper.thru(func);
+        wrapper = (func.length == 1 && isLaziable(func))
+          ? wrapper[funcName]()
+          : wrapper.thru(func);
       }
     }
     return function() {

_createHybridWrapper.js

@@ -3,7 +3,7 @@ import composeArgsRight from './_composeArgsRight';
 import countHolders from './_countHolders';
 import createCtorWrapper from './_createCtorWrapper';
 import createRecurryWrapper from './_createRecurryWrapper';
-import getPlaceholder from './_getPlaceholder';
+import getHolder from './_getHolder';
 import reorder from './_reorder';
 import replaceHolders from './_replaceHolders';
 import root from './_root';
@@ -22,11 +22,14 @@ var BIND_FLAG = 1,
  *
  * @private
  * @param {Function|string} func The function or method name to wrap.
- * @param {number} bitmask The bitmask of wrapper flags. See `createWrapper` for more details.
+ * @param {number} bitmask The bitmask of wrapper flags. See `createWrapper`
+ *  for more details.
  * @param {*} [thisArg] The `this` binding of `func`.
- * @param {Array} [partials] The arguments to prepend to those provided to the new function.
+ * @param {Array} [partials] The arguments to prepend to those provided to
+ *  the new function.
  * @param {Array} [holders] The `partials` placeholder indexes.
- * @param {Array} [partialsRight] The arguments to append to those provided to the new function.
+ * @param {Array} [partialsRight] The arguments to append to those provided
+ *  to the new function.
  * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.
  * @param {Array} [argPos] The argument positions of the new function.
  * @param {number} [ary] The arity cap of `func`.
@@ -43,14 +46,14 @@ function createHybridWrapper(func, bitmask, thisArg, partials, holders, partials
 
   function wrapper() {
     var length = arguments.length,
-        index = length,
+        args = Array(length),
-        args = Array(length);
+        index = length;
 
     while (index--) {
       args[index] = arguments[index];
     }
     if (isCurried) {
-      var placeholder = getPlaceholder(wrapper),
+      var placeholder = getHolder(wrapper),
           holdersCount = countHolders(args, placeholder);
     }
     if (partials) {

_createMathOperation.js

@@ -0,0 +1,37 @@
+import baseToNumber from './_baseToNumber';
+import baseToString from './_baseToString';
+
+/**
+ * Creates a function that performs a mathematical operation on two values.
+ *
+ * @private
+ * @param {Function} operator The function to perform the operation.
+ * @returns {Function} Returns the new mathematical operation function.
+ */
+function createMathOperation(operator) {
+  return function(value, other) {
+    var result;
+    if (value === undefined && other === undefined) {
+      return 0;
+    }
+    if (value !== undefined) {
+      result = value;
+    }
+    if (other !== undefined) {
+      if (result === undefined) {
+        return other;
+      }
+      if (typeof value == 'string' || typeof other == 'string') {
+        value = baseToString(value);
+        other = baseToString(other);
+      } else {
+        value = baseToNumber(value);
+        other = baseToNumber(other);
+      }
+      result = operator(value, other);
+    }
+    return result;
+  };
+}
+
+export default createMathOperation;

_createOver.js

@@ -2,6 +2,9 @@ import apply from './_apply';
 import arrayMap from './_arrayMap';
 import baseFlatten from './_baseFlatten';
 import baseIteratee from './_baseIteratee';
+import baseUnary from './_baseUnary';
+import isArray from './isArray';
+import isFlattenableIteratee from './_isFlattenableIteratee';
 import rest from './rest';
 
 /**
@@ -9,11 +12,14 @@ import rest from './rest';
  *
  * @private
  * @param {Function} arrayFunc The function to iterate over iteratees.
- * @returns {Function} Returns the new invoker function.
+ * @returns {Function} Returns the new over function.
  */
 function createOver(arrayFunc) {
   return rest(function(iteratees) {
-    iteratees = arrayMap(baseFlatten(iteratees, 1), baseIteratee);
+    iteratees = (iteratees.length == 1 && isArray(iteratees[0]))
+      ? arrayMap(iteratees[0], baseUnary(baseIteratee))
+      : arrayMap(baseFlatten(iteratees, 1, isFlattenableIteratee), baseUnary(baseIteratee));
+
     return rest(function(args) {
       var thisArg = this;
       return arrayFunc(iteratees, function(iteratee) {

_createPadding.js

@@ -1,19 +1,9 @@
-import repeat from './repeat';
+import baseRepeat from './_baseRepeat';
+import baseToString from './_baseToString';
+import castSlice from './_castSlice';
+import reHasComplexSymbol from './_reHasComplexSymbol';
 import stringSize from './_stringSize';
 import stringToArray from './_stringToArray';
-import toInteger from './toInteger';
-
-/** Used to compose unicode character classes. */
-var rsAstralRange = '\\ud800-\\udfff',
-    rsComboMarksRange = '\\u0300-\\u036f\\ufe20-\\ufe23',
-    rsComboSymbolsRange = '\\u20d0-\\u20f0',
-    rsVarRange = '\\ufe0e\\ufe0f';
-
-/** Used to compose unicode capture groups. */
-var rsZWJ = '\\u200d';
-
-/** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */
-var reHasComplexSymbol = RegExp('[' + rsZWJ + rsAstralRange  + rsComboMarksRange + rsComboSymbolsRange + rsVarRange + ']');
 
 /* Built-in method references for those with the same name as other `lodash` methods. */
 var nativeCeil = Math.ceil;
@@ -23,25 +13,21 @@ var nativeCeil = Math.ceil;
  * is truncated if the number of characters exceeds `length`.
  *
  * @private
- * @param {string} string The string to create padding for.
+ * @param {number} length The padding length.
- * @param {number} [length=0] The padding length.
  * @param {string} [chars=' '] The string used as padding.
  * @returns {string} Returns the padding for `string`.
  */
-function createPadding(string, length, chars) {
+function createPadding(length, chars) {
-  length = toInteger(length);
+  chars = chars === undefined ? ' ' : baseToString(chars);
 
-  var strLength = stringSize(string);
+  var charsLength = chars.length;
-  if (!length || strLength >= length) {
+  if (charsLength < 2) {
-    return '';
+    return charsLength ? baseRepeat(chars, length) : chars;
   }
-  var padLength = length - strLength;
+  var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));
-  chars = chars === undefined ? ' ' : (chars + '');
-
-  var result = repeat(chars, nativeCeil(padLength / stringSize(chars)));
   return reHasComplexSymbol.test(chars)
-    ? stringToArray(result).slice(0, padLength).join('')
+    ? castSlice(stringToArray(result), 0, length).join('')
-    : result.slice(0, padLength);
+    : result.slice(0, length);
 }
 
 export default createPadding;

_createPartialWrapper.js

@@ -6,15 +6,16 @@ import root from './_root';
 var BIND_FLAG = 1;
 
 /**
- * Creates a function that wraps `func` to invoke it with the optional `this`
+ * Creates a function that wraps `func` to invoke it with the `this` binding
- * binding of `thisArg` and the `partials` prepended to those provided to
+ * of `thisArg` and `partials` prepended to the arguments it receives.
- * the wrapper.
  *
  * @private
  * @param {Function} func The function to wrap.
- * @param {number} bitmask The bitmask of wrapper flags. See `createWrapper` for more details.
+ * @param {number} bitmask The bitmask of wrapper flags. See `createWrapper`
+ *  for more details.
  * @param {*} thisArg The `this` binding of `func`.
- * @param {Array} partials The arguments to prepend to those provided to the new function.
+ * @param {Array} partials The arguments to prepend to those provided to
+ *  the new function.
  * @returns {Function} Returns the new wrapped function.
  */
 function createPartialWrapper(func, bitmask, thisArg, partials) {

_createRecurryWrapper.js

@@ -1,4 +1,3 @@
-import copyArray from './_copyArray';
 import isLaziable from './_isLaziable';
 import setData from './_setData';
 
@@ -15,11 +14,13 @@ var BIND_FLAG = 1,
  *
  * @private
  * @param {Function} func The function to wrap.
- * @param {number} bitmask The bitmask of wrapper flags. See `createWrapper` for more details.
+ * @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 value.
  * @param {*} [thisArg] The `this` binding of `func`.
- * @param {Array} [partials] The arguments to prepend to those provided to the new function.
+ * @param {Array} [partials] The arguments to prepend to those provided to
+ *  the new function.
  * @param {Array} [holders] The `partials` placeholder indexes.
  * @param {Array} [argPos] The argument positions of the new function.
  * @param {number} [ary] The arity cap of `func`.
@@ -28,7 +29,6 @@ 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,
       newHolders = isCurry ? holders : undefined,
       newHoldersRight = isCurry ? undefined : holders,
       newPartials = isCurry ? partials : undefined,
@@ -42,7 +42,7 @@ function createRecurryWrapper(func, bitmask, wrapFunc, placeholder, thisArg, par
   }
   var newData = [
     func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,
-    newHoldersRight, newArgPos, ary, arity
+    newHoldersRight, argPos, ary, arity
   ];
 
   var result = wrapFunc.apply(undefined, newData);