Bump to v3.9.2.

README.md

@@ -1,4 +1,4 @@
-# lodash v3.7.0
+# lodash v3.9.2
 
 The [modern build](https://github.com/lodash/lodash/wiki/Build-Differences) of [lodash](https://lodash.com/) exported as [AMD](https://github.com/amdjs/amdjs-api/wiki/AMD) modules.
 
@@ -13,8 +13,8 @@ $ lodash modern exports=amd -d -o ./main.js
 Using bower or volo:
 
 ```bash
-$ bower i lodash#3.7.0-amd
-$ volo add lodash/3.7.0-amd
+$ bower i lodash#3.9.2-amd
+$ volo add lodash/3.9.2-amd
 ```
 
 Defining a build as `'lodash'`.

array.js

@@ -1,4 +1,4 @@
-define(['./array/chunk', './array/compact', './array/difference', './array/drop', './array/dropRight', './array/dropRightWhile', './array/dropWhile', './array/fill', './array/findIndex', './array/findLastIndex', './array/first', './array/flatten', './array/flattenDeep', './array/head', './array/indexOf', './array/initial', './array/intersection', './array/last', './array/lastIndexOf', './array/object', './array/pull', './array/pullAt', './array/remove', './array/rest', './array/slice', './array/sortedIndex', './array/sortedLastIndex', './array/tail', './array/take', './array/takeRight', './array/takeRightWhile', './array/takeWhile', './array/union', './array/uniq', './array/unique', './array/unzip', './array/without', './array/xor', './array/zip', './array/zipObject'], function(chunk, compact, difference, drop, dropRight, dropRightWhile, dropWhile, fill, findIndex, findLastIndex, first, flatten, flattenDeep, head, indexOf, initial, intersection, last, lastIndexOf, object, pull, pullAt, remove, rest, slice, sortedIndex, sortedLastIndex, tail, take, takeRight, takeRightWhile, takeWhile, union, uniq, unique, unzip, without, xor, zip, zipObject) {
+define(['./array/chunk', './array/compact', './array/difference', './array/drop', './array/dropRight', './array/dropRightWhile', './array/dropWhile', './array/fill', './array/findIndex', './array/findLastIndex', './array/first', './array/flatten', './array/flattenDeep', './array/head', './array/indexOf', './array/initial', './array/intersection', './array/last', './array/lastIndexOf', './array/object', './array/pull', './array/pullAt', './array/remove', './array/rest', './array/slice', './array/sortedIndex', './array/sortedLastIndex', './array/tail', './array/take', './array/takeRight', './array/takeRightWhile', './array/takeWhile', './array/union', './array/uniq', './array/unique', './array/unzip', './array/unzipWith', './array/without', './array/xor', './array/zip', './array/zipObject', './array/zipWith'], function(chunk, compact, difference, drop, dropRight, dropRightWhile, dropWhile, fill, findIndex, findLastIndex, first, flatten, flattenDeep, head, indexOf, initial, intersection, last, lastIndexOf, object, pull, pullAt, remove, rest, slice, sortedIndex, sortedLastIndex, tail, take, takeRight, takeRightWhile, takeWhile, union, uniq, unique, unzip, unzipWith, without, xor, zip, zipObject, zipWith) {
   return {
     'chunk': chunk,
     'compact': compact,
@@ -36,9 +36,11 @@ define(['./array/chunk', './array/compact', './array/difference', './array/drop'
     'uniq': uniq,
     'unique': unique,
     'unzip': unzip,
+    'unzipWith': unzipWith,
     'without': without,
     'xor': xor,
     'zip': zip,
-    'zipObject': zipObject
+    'zipObject': zipObject,
+    'zipWith': zipWith
   };
 });

array/difference.js

@@ -1,12 +1,9 @@
-define(['../internal/baseDifference', '../internal/baseFlatten', '../lang/isArguments', '../lang/isArray', '../function/restParam'], function(baseDifference, baseFlatten, isArguments, isArray, restParam) {
+define(['../internal/baseDifference', '../internal/baseFlatten', '../internal/isArrayLike', '../function/restParam'], function(baseDifference, baseFlatten, isArrayLike, restParam) {
 
   /**
-   * Creates an array excluding all values of the provided arrays using
-   * `SameValueZero` for equality comparisons.
-   *
-   * **Note:** [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
-   * comparisons are like strict equality comparisons, e.g. `===`, except that
-   * `NaN` matches `NaN`.
+   * Creates an array of unique `array` values not included in the other
+   * provided arrays using [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
+   * for equality comparisons.
    *
    * @static
    * @memberOf _
@@ -20,7 +17,7 @@ define(['../internal/baseDifference', '../internal/baseFlatten', '../lang/isArgu
    * // => [1, 3]
    */
   var difference = restParam(function(array, values) {
-    return (isArray(array) || isArguments(array))
+    return isArrayLike(array)
       ? baseDifference(array, baseFlatten(values, false, true))
       : [];
   });

array/indexOf.js

@@ -5,13 +5,10 @@ define(['../internal/baseIndexOf', '../internal/binaryIndex'], function(baseInde
 
   /**
    * Gets the index at which the first occurrence of `value` is found in `array`
-   * using `SameValueZero` for equality comparisons. If `fromIndex` is negative,
-   * it is used as the offset from the end of `array`. If `array` is sorted
-   * providing `true` for `fromIndex` performs a faster binary search.
-   *
-   * **Note:** [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
-   * comparisons are like strict equality comparisons, e.g. `===`, except that
-   * `NaN` matches `NaN`.
+   * using [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
+   * for equality comparisons. If `fromIndex` is negative, it is used as the offset
+   * from the end of `array`. If `array` is sorted providing `true` for `fromIndex`
+   * performs a faster binary search.
    *
    * @static
    * @memberOf _

array/intersection.js

@@ -1,13 +1,10 @@
-define(['../internal/baseIndexOf', '../internal/cacheIndexOf', '../internal/createCache', '../lang/isArguments', '../lang/isArray'], function(baseIndexOf, cacheIndexOf, createCache, isArguments, isArray) {
+define(['../internal/baseIndexOf', '../internal/cacheIndexOf', '../internal/createCache', '../internal/isArrayLike', '../function/restParam'], function(baseIndexOf, cacheIndexOf, createCache, isArrayLike, restParam) {
 
   /**
-   * Creates an array of unique values in all provided arrays using `SameValueZero`
+   * Creates an array of unique values that are included in all of the provided
+   * arrays using [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
    * for equality comparisons.
    *
-   * **Note:** [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
-   * comparisons are like strict equality comparisons, e.g. `===`, except that
-   * `NaN` matches `NaN`.
-   *
    * @static
    * @memberOf _
    * @category Array
@@ -17,27 +14,19 @@ define(['../internal/baseIndexOf', '../internal/cacheIndexOf', '../internal/crea
    * _.intersection([1, 2], [4, 2], [2, 1]);
    * // => [2]
    */
-  function intersection() {
-    var args = [],
-        argsIndex = -1,
-        argsLength = arguments.length,
-        caches = [],
+  var intersection = restParam(function(arrays) {
+    var othLength = arrays.length,
+        othIndex = othLength,
+        caches = Array(length),
         indexOf = baseIndexOf,
         isCommon = true,
         result = [];
 
-    while (++argsIndex < argsLength) {
-      var value = arguments[argsIndex];
-      if (isArray(value) || isArguments(value)) {
-        args.push(value);
-        caches.push((isCommon && value.length >= 120) ? createCache(argsIndex && value) : null);
-      }
+    while (othIndex--) {
+      var value = arrays[othIndex] = isArrayLike(value = arrays[othIndex]) ? value : [];
+      caches[othIndex] = (isCommon && value.length >= 120) ? createCache(othIndex && value) : null;
     }
-    argsLength = args.length;
-    if (argsLength < 2) {
-      return result;
-    }
-    var array = args[0],
+    var array = arrays[0],
         index = -1,
         length = array ? array.length : 0,
         seen = caches[0];
@@ -46,10 +35,10 @@ define(['../internal/baseIndexOf', '../internal/cacheIndexOf', '../internal/crea
     while (++index < length) {
       value = array[index];
       if ((seen ? cacheIndexOf(seen, value) : indexOf(result, value, 0)) < 0) {
-        argsIndex = argsLength;
-        while (--argsIndex) {
-          var cache = caches[argsIndex];
-          if ((cache ? cacheIndexOf(cache, value) : indexOf(args[argsIndex], value, 0)) < 0) {
+        var othIndex = othLength;
+        while (--othIndex) {
+          var cache = caches[othIndex];
+          if ((cache ? cacheIndexOf(cache, value) : indexOf(arrays[othIndex], value, 0)) < 0) {
             continue outer;
           }
         }
@@ -60,7 +49,7 @@ define(['../internal/baseIndexOf', '../internal/cacheIndexOf', '../internal/crea
       }
     }
     return result;
-  }
+  });
 
   return intersection;
 });

array/pull.js

@@ -7,14 +7,11 @@ define(['../internal/baseIndexOf'], function(baseIndexOf) {
   var splice = arrayProto.splice;
 
   /**
-   * Removes all provided values from `array` using `SameValueZero` for equality
-   * comparisons.
+   * Removes all provided values from `array` using
+   * [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
+   * for equality comparisons.
    *
-   * **Notes:**
-   *  - Unlike `_.without`, this method mutates `array`
-   *  - [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
-   *    comparisons are like strict equality comparisons, e.g. `===`, except
-   *    that `NaN` matches `NaN`
+   * **Note:** Unlike `_.without`, this method mutates `array`.
    *
    * @static
    * @memberOf _

array/pullAt.js

@@ -26,7 +26,6 @@ define(['../internal/baseAt', '../internal/baseCompareAscending', '../internal/b
    * // => [10, 20]
    */
   var pullAt = restParam(function(array, indexes) {
-    array || (array = []);
     indexes = baseFlatten(indexes);
 
     var result = baseAt(array, indexes);

array/union.js

@@ -1,12 +1,9 @@
 define(['../internal/baseFlatten', '../internal/baseUniq', '../function/restParam'], function(baseFlatten, baseUniq, restParam) {
 
   /**
-   * Creates an array of unique values, in order, of the provided arrays using
-   * `SameValueZero` for equality comparisons.
-   *
-   * **Note:** [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
-   * comparisons are like strict equality comparisons, e.g. `===`, except that
-   * `NaN` matches `NaN`.
+   * Creates an array of unique values, in order, from all of the provided arrays
+   * using [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
+   * for equality comparisons.
    *
    * @static
    * @memberOf _

array/uniq.js

@@ -1,8 +1,9 @@
 define(['../internal/baseCallback', '../internal/baseUniq', '../internal/isIterateeCall', '../internal/sortedUniq'], function(baseCallback, baseUniq, isIterateeCall, sortedUniq) {
 
   /**
-   * Creates a duplicate-free version of an array, using `SameValueZero` for
-   * equality comparisons, in which only the first occurence of each element
+   * Creates a duplicate-free version of an array, using
+   * [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
+   * for equality comparisons, in which only the first occurence of each element
    * is kept. Providing `true` for `isSorted` performs a faster search algorithm
    * for sorted arrays. If an iteratee function is provided it is invoked for
    * each element in the array to generate the criterion by which uniqueness
@@ -20,10 +21,6 @@ define(['../internal/baseCallback', '../internal/baseUniq', '../internal/isItera
    * callback returns `true` for elements that have the properties of the given
    * object, else `false`.
    *
-   * **Note:** [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
-   * comparisons are like strict equality comparisons, e.g. `===`, except that
-   * `NaN` matches `NaN`.
-   *
    * @static
    * @memberOf _
    * @alias unique

array/unzip.js

@@ -1,8 +1,11 @@
-define(['../internal/arrayMap', '../internal/arrayMax', '../internal/baseProperty', '../internal/getLength'], function(arrayMap, arrayMax, baseProperty, getLength) {
+define(['../internal/arrayFilter', '../internal/arrayMap', '../internal/baseProperty', '../internal/isArrayLike'], function(arrayFilter, arrayMap, baseProperty, isArrayLike) {
+
+  /* Native method references for those with the same name as other `lodash` methods. */
+  var nativeMax = Math.max;
 
   /**
    * This method is like `_.zip` except that it accepts an array of grouped
-   * elements and creates an array regrouping the elements to their pre-`_.zip`
+   * elements and creates an array regrouping the elements to their pre-zip
    * configuration.
    *
    * @static
@@ -19,10 +22,19 @@ define(['../internal/arrayMap', '../internal/arrayMax', '../internal/basePropert
    * // => [['fred', 'barney'], [30, 40], [true, false]]
    */
   function unzip(array) {
+    if (!(array && array.length)) {
+      return [];
+    }
     var index = -1,
-        length = (array && array.length && arrayMax(arrayMap(array, getLength))) >>> 0,
-        result = Array(length);
+        length = 0;
 
+    array = arrayFilter(array, function(group) {
+      if (isArrayLike(group)) {
+        length = nativeMax(group.length, length);
+        return true;
+      }
+    });
+    var result = Array(length);
     while (++index < length) {
       result[index] = arrayMap(array, baseProperty(index));
     }

array/unzipWith.js

@@ -0,0 +1,42 @@
+define(['../internal/arrayMap', '../internal/arrayReduce', '../internal/bindCallback', './unzip'], function(arrayMap, arrayReduce, bindCallback, unzip) {
+
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
+
+  /**
+   * This method is like `_.unzip` except that it accepts an iteratee to specify
+   * how regrouped values should be combined. The `iteratee` is bound to `thisArg`
+   * and invoked with four arguments: (accumulator, value, index, group).
+   *
+   * @static
+   * @memberOf _
+   * @category Array
+   * @param {Array} array The array of grouped elements to process.
+   * @param {Function} [iteratee] The function to combine regrouped values.
+   * @param {*} [thisArg] The `this` binding of `iteratee`.
+   * @returns {Array} Returns the new array of regrouped elements.
+   * @example
+   *
+   * var zipped = _.zip([1, 2], [10, 20], [100, 200]);
+   * // => [[1, 10, 100], [2, 20, 200]]
+   *
+   * _.unzipWith(zipped, _.add);
+   * // => [3, 30, 300]
+   */
+  function unzipWith(array, iteratee, thisArg) {
+    var length = array ? array.length : 0;
+    if (!length) {
+      return [];
+    }
+    var result = unzip(array);
+    if (iteratee == null) {
+      return result;
+    }
+    iteratee = bindCallback(iteratee, thisArg, 4);
+    return arrayMap(result, function(group) {
+      return arrayReduce(group, iteratee, undefined, true);
+    });
+  }
+
+  return unzipWith;
+});

array/without.js

@@ -1,12 +1,9 @@
-define(['../internal/baseDifference', '../lang/isArguments', '../lang/isArray', '../function/restParam'], function(baseDifference, isArguments, isArray, restParam) {
+define(['../internal/baseDifference', '../internal/isArrayLike', '../function/restParam'], function(baseDifference, isArrayLike, restParam) {
 
   /**
-   * Creates an array excluding all provided values using `SameValueZero` for
-   * equality comparisons.
-   *
-   * **Note:** [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
-   * comparisons are like strict equality comparisons, e.g. `===`, except that
-   * `NaN` matches `NaN`.
+   * Creates an array excluding all provided values using
+   * [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
+   * for equality comparisons.
    *
    * @static
    * @memberOf _
@@ -20,7 +17,7 @@ define(['../internal/baseDifference', '../lang/isArguments', '../lang/isArray',
    * // => [3]
    */
   var without = restParam(function(array, values) {
-    return (isArray(array) || isArguments(array))
+    return isArrayLike(array)
       ? baseDifference(array, values)
       : [];
   });

array/xor.js

@@ -1,7 +1,7 @@
-define(['../internal/baseDifference', '../internal/baseUniq', '../lang/isArguments', '../lang/isArray'], function(baseDifference, baseUniq, isArguments, isArray) {
+define(['../internal/baseDifference', '../internal/baseUniq', '../internal/isArrayLike'], function(baseDifference, baseUniq, isArrayLike) {
 
   /**
-   * Creates an array that is the [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)
+   * Creates an array of unique values that is the [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)
    * of the provided arrays.
    *
    * @static
@@ -20,7 +20,7 @@ define(['../internal/baseDifference', '../internal/baseUniq', '../lang/isArgumen
 
     while (++index < length) {
       var array = arguments[index];
-      if (isArray(array) || isArguments(array)) {
+      if (isArrayLike(array)) {
         var result = result
           ? baseDifference(result, array).concat(baseDifference(array, result))
           : array;

array/zipWith.js

@@ -0,0 +1,39 @@
+define(['../function/restParam', './unzipWith'], function(restParam, unzipWith) {
+
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
+
+  /**
+   * This method is like `_.zip` except that it accepts an iteratee to specify
+   * how grouped values should be combined. The `iteratee` is bound to `thisArg`
+   * and invoked with four arguments: (accumulator, value, index, group).
+   *
+   * @static
+   * @memberOf _
+   * @category Array
+   * @param {...Array} [arrays] The arrays to process.
+   * @param {Function} [iteratee] The function to combine grouped values.
+   * @param {*} [thisArg] The `this` binding of `iteratee`.
+   * @returns {Array} Returns the new array of grouped elements.
+   * @example
+   *
+   * _.zipWith([1, 2], [10, 20], [100, 200], _.add);
+   * // => [111, 222]
+   */
+  var zipWith = restParam(function(arrays) {
+    var length = arrays.length,
+        iteratee = length > 2 ? arrays[length - 2] : undefined,
+        thisArg = length > 1 ? arrays[length - 1] : undefined;
+
+    if (length > 2 && typeof iteratee == 'function') {
+      length -= 2;
+    } else {
+      iteratee = (length > 1 && typeof thisArg == 'function') ? (--length, thisArg) : undefined;
+      thisArg = undefined;
+    }
+    arrays.length = length;
+    return unzipWith(arrays, iteratee, thisArg);
+  });
+
+  return zipWith;
+});

chain/lodash.js

@@ -45,30 +45,31 @@ define(['../internal/LazyWrapper', '../internal/LodashWrapper', '../internal/bas
    * `filter`, `flatten`, `flattenDeep`, `flow`, `flowRight`, `forEach`,
    * `forEachRight`, `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `functions`,
    * `groupBy`, `indexBy`, `initial`, `intersection`, `invert`, `invoke`, `keys`,
-   * `keysIn`, `map`, `mapValues`, `matches`, `matchesProperty`, `memoize`,
-   * `merge`, `mixin`, `negate`, `omit`, `once`, `pairs`, `partial`, `partialRight`,
-   * `partition`, `pick`, `plant`, `pluck`, `property`, `propertyOf`, `pull`,
-   * `pullAt`, `push`, `range`, `rearg`, `reject`, `remove`, `rest`, `reverse`,
-   * `shuffle`, `slice`, `sort`, `sortBy`, `sortByAll`, `sortByOrder`, `splice`,
-   * `spread`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, `tap`,
-   * `throttle`, `thru`, `times`, `toArray`, `toPlainObject`, `transform`,
-   * `union`, `uniq`, `unshift`, `unzip`, `values`, `valuesIn`, `where`,
-   * `without`, `wrap`, `xor`, `zip`, and `zipObject`
+   * `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,
+   * `memoize`, `merge`, `method`, `methodOf`, `mixin`, `negate`, `omit`, `once`,
+   * `pairs`, `partial`, `partialRight`, `partition`, `pick`, `plant`, `pluck`,
+   * `property`, `propertyOf`, `pull`, `pullAt`, `push`, `range`, `rearg`,
+   * `reject`, `remove`, `rest`, `restParam`, `reverse`, `set`, `shuffle`,
+   * `slice`, `sort`, `sortBy`, `sortByAll`, `sortByOrder`, `splice`, `spread`,
+   * `take`, `takeRight`, `takeRightWhile`, `takeWhile`, `tap`, `throttle`,
+   * `thru`, `times`, `toArray`, `toPlainObject`, `transform`, `union`, `uniq`,
+   * `unshift`, `unzip`, `unzipWith`, `values`, `valuesIn`, `where`, `without`,
+   * `wrap`, `xor`, `zip`, `zipObject`, `zipWith`
    *
    * The wrapper methods that are **not** chainable by default are:
    * `add`, `attempt`, `camelCase`, `capitalize`, `clone`, `cloneDeep`, `deburr`,
    * `endsWith`, `escape`, `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`,
-   * `findLast`, `findLastIndex`, `findLastKey`, `findWhere`, `first`, `has`,
-   * `identity`, `includes`, `indexOf`, `inRange`, `isArguments`, `isArray`,
-   * `isBoolean`, `isDate`, `isElement`, `isEmpty`, `isEqual`, `isError`, `isFinite`
-   * `isFunction`, `isMatch`, `isNative`, `isNaN`, `isNull`, `isNumber`, `isObject`,
-   * `isPlainObject`, `isRegExp`, `isString`, `isUndefined`, `isTypedArray`,
-   * `join`, `kebabCase`, `last`, `lastIndexOf`, `max`, `min`, `noConflict`,
-   * `noop`, `now`, `pad`, `padLeft`, `padRight`, `parseInt`, `pop`, `random`,
-   * `reduce`, `reduceRight`, `repeat`, `result`, `runInContext`, `shift`, `size`,
-   * `snakeCase`, `some`, `sortedIndex`, `sortedLastIndex`, `startCase`, `startsWith`,
-   * `sum`, `template`, `trim`, `trimLeft`, `trimRight`, `trunc`, `unescape`,
-   * `uniqueId`, `value`, and `words`
+   * `findLast`, `findLastIndex`, `findLastKey`, `findWhere`, `first`, `get`,
+   * `gt`, `gte`, `has`, `identity`, `includes`, `indexOf`, `inRange`, `isArguments`,
+   * `isArray`, `isBoolean`, `isDate`, `isElement`, `isEmpty`, `isEqual`, `isError`,
+   * `isFinite` `isFunction`, `isMatch`, `isNative`, `isNaN`, `isNull`, `isNumber`,
+   * `isObject`, `isPlainObject`, `isRegExp`, `isString`, `isUndefined`,
+   * `isTypedArray`, `join`, `kebabCase`, `last`, `lastIndexOf`, `lt`, `lte`,
+   * `max`, `min`, `noConflict`, `noop`, `now`, `pad`, `padLeft`, `padRight`,
+   * `parseInt`, `pop`, `random`, `reduce`, `reduceRight`, `repeat`, `result`,
+   * `runInContext`, `shift`, `size`, `snakeCase`, `some`, `sortedIndex`,
+   * `sortedLastIndex`, `startCase`, `startsWith`, `sum`, `template`, `trim`,
+   * `trimLeft`, `trimRight`, `trunc`, `unescape`, `uniqueId`, `value`, and `words`
    *
    * The wrapper method `sample` will return a wrapped value when `n` is provided,
    * otherwise an unwrapped value is returned.

collection/at.js

@@ -1,4 +1,4 @@
-define(['../internal/baseAt', '../internal/baseFlatten', '../internal/getLength', '../internal/isLength', '../function/restParam', '../internal/toIterable'], function(baseAt, baseFlatten, getLength, isLength, restParam, toIterable) {
+define(['../internal/baseAt', '../internal/baseFlatten', '../function/restParam'], function(baseAt, baseFlatten, restParam) {
 
   /**
    * Creates an array of elements corresponding to the given keys, or indexes,
@@ -21,10 +21,6 @@ define(['../internal/baseAt', '../internal/baseFlatten', '../internal/getLength'
    * // => ['barney', 'pebbles']
    */
   var at = restParam(function(collection, props) {
-    var length = collection ? getLength(collection) : 0;
-    if (isLength(length)) {
-      collection = toIterable(collection);
-    }
     return baseAt(collection, baseFlatten(props));
   });
 

collection/includes.js

@@ -4,13 +4,10 @@ define(['../internal/baseIndexOf', '../internal/getLength', '../lang/isArray', '
   var nativeMax = Math.max;
 
   /**
-   * Checks if `value` is in `collection` using `SameValueZero` for equality
-   * comparisons. If `fromIndex` is negative, it is used as the offset from
-   * the end of `collection`.
-   *
-   * **Note:** [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
-   * comparisons are like strict equality comparisons, e.g. `===`, except that
-   * `NaN` matches `NaN`.
+   * Checks if `value` is in `collection` using
+   * [`SameValueZero`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
+   * for equality comparisons. If `fromIndex` is negative, it is used as the offset
+   * from the end of `collection`.
    *
    * @static
    * @memberOf _

collection/invoke.js

@@ -1,7 +1,7 @@
-define(['../internal/baseEach', '../internal/getLength', '../internal/invokePath', '../internal/isKey', '../internal/isLength', '../function/restParam'], function(baseEach, getLength, invokePath, isKey, isLength, restParam) {
+define(['../internal/baseEach', '../internal/invokePath', '../internal/isArrayLike', '../internal/isKey', '../function/restParam'], function(baseEach, invokePath, isArrayLike, isKey, restParam) {
 
   /**
-   * Invokes the method at `path` on each element in `collection`, returning
+   * Invokes the method at `path` of each element in `collection`, returning
    * an array of the results of each invoked method. Any additional arguments
    * are provided to each invoked method. If `methodName` is a function it is
    * invoked for, and `this` bound to, each element in `collection`.
@@ -26,11 +26,10 @@ define(['../internal/baseEach', '../internal/getLength', '../internal/invokePath
     var index = -1,
         isFunc = typeof path == 'function',
         isProp = isKey(path),
-        length = getLength(collection),
-        result = isLength(length) ? Array(length) : [];
+        result = isArrayLike(collection) ? Array(collection.length) : [];
 
     baseEach(collection, function(value) {
-      var func = isFunc ? path : (isProp && value != null && value[path]);
+      var func = isFunc ? path : ((isProp && value != null) ? value[path] : null);
       result[++index] = func ? func.apply(value, args) : invokePath(value, path, args);
     });
     return result;

collection/map.js

@@ -16,14 +16,15 @@ define(['../internal/arrayMap', '../internal/baseCallback', '../internal/baseMap
    * callback returns `true` for elements that have the properties of the given
    * object, else `false`.
    *
-   * Many lodash methods are guarded to work as interatees for methods like
+   * Many lodash methods are guarded to work as iteratees for methods like
    * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.
    *
    * The guarded methods are:
-   * `ary`, `callback`, `chunk`, `clone`, `create`, `curry`, `curryRight`, `drop`,
-   * `dropRight`, `every`, `fill`, `flatten`, `invert`, `max`, `min`, `parseInt`,
-   * `slice`, `sortBy`, `take`, `takeRight`, `template`, `trim`, `trimLeft`,
-   * `trimRight`, `trunc`, `random`, `range`, `sample`, `some`, `uniq`, and `words`
+   * `ary`, `callback`, `chunk`, `clone`, `create`, `curry`, `curryRight`,
+   * `drop`, `dropRight`, `every`, `fill`, `flatten`, `invert`, `max`, `min`,
+   * `parseInt`, `slice`, `sortBy`, `take`, `takeRight`, `template`, `trim`,
+   * `trimLeft`, `trimRight`, `trunc`, `random`, `range`, `sample`, `some`,
+   * `sum`, `uniq`, and `words`
    *
    * @static
    * @memberOf _

collection/reduce.js

@@ -8,7 +8,7 @@ define(['../internal/arrayReduce', '../internal/baseEach', '../internal/createRe
    * value. The `iteratee` is bound to `thisArg` and invoked with four arguments:
    * (accumulator, value, index|key, collection).
    *
-   * Many lodash methods are guarded to work as interatees for methods like
+   * Many lodash methods are guarded to work as iteratees for methods like
    * `_.reduce`, `_.reduceRight`, and `_.transform`.
    *
    * The guarded methods are:

collection/reduceRight.js

@@ -22,7 +22,7 @@ define(['../internal/arrayReduceRight', '../internal/baseEachRight', '../interna
    * }, []);
    * // => [4, 5, 2, 3, 0, 1]
    */
-  var reduceRight =  createReduce(arrayReduceRight, baseEachRight);
+  var reduceRight = createReduce(arrayReduceRight, baseEachRight);
 
   return reduceRight;
 });

collection/reject.js

@@ -4,17 +4,6 @@ define(['../internal/arrayFilter', '../internal/baseCallback', '../internal/base
    * The opposite of `_.filter`; this method returns the elements of `collection`
    * that `predicate` does **not** return truthy for.
    *
-   * If a property name is provided for `predicate` the created `_.property`
-   * style callback returns the property value of the given element.
-   *
-   * If a value is also provided for `thisArg` the created `_.matchesProperty`
-   * style callback returns `true` for elements that have a matching property
-   * value, else `false`.
-   *
-   * If an object is provided for `predicate` the created `_.matches` style
-   * callback returns `true` for elements that have the properties of the given
-   * object, else `false`.
-   *
    * @static
    * @memberOf _
    * @category Collection

collection/sample.js

@@ -1,4 +1,4 @@
-define(['../internal/baseRandom', '../internal/isIterateeCall', './shuffle', '../internal/toIterable'], function(baseRandom, isIterateeCall, shuffle, toIterable) {
+define(['../internal/baseRandom', '../internal/isIterateeCall', '../lang/toArray', '../internal/toIterable'], function(baseRandom, isIterateeCall, toArray, toIterable) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;
@@ -30,8 +30,20 @@ define(['../internal/baseRandom', '../internal/isIterateeCall', './shuffle', '..
       var length = collection.length;
       return length > 0 ? collection[baseRandom(0, length - 1)] : undefined;
     }
-    var result = shuffle(collection);
-    result.length = nativeMin(n < 0 ? 0 : (+n || 0), result.length);
+    var index = -1,
+        result = toArray(collection),
+        length = result.length,
+        lastIndex = length - 1;
+
+    n = nativeMin(n < 0 ? 0 : (+n || 0), length);
+    while (++index < n) {
+      var rand = baseRandom(index, lastIndex),
+          value = result[rand];
+
+      result[rand] = result[index];
+      result[index] = value;
+    }
+    result.length = n;
     return result;
   }
 

collection/shuffle.js

@@ -1,4 +1,7 @@
-define(['../internal/baseRandom', '../internal/toIterable'], function(baseRandom, toIterable) {
+define(['./sample'], function(sample) {
+
+  /** Used as references for `-Infinity` and `Infinity`. */
+  var POSITIVE_INFINITY = Number.POSITIVE_INFINITY;
 
   /**
    * Creates an array of shuffled values, using a version of the
@@ -15,20 +18,7 @@ define(['../internal/baseRandom', '../internal/toIterable'], function(baseRandom
    * // => [4, 1, 3, 2]
    */
   function shuffle(collection) {
-    collection = toIterable(collection);
-
-    var index = -1,
-        length = collection.length,
-        result = Array(length);
-
-    while (++index < length) {
-      var rand = baseRandom(0, index);
-      if (index != rand) {
-        result[index] = result[rand];
-      }
-      result[rand] = collection[index];
-    }
-    return result;
+    return sample(collection, POSITIVE_INFINITY);
   }
 
   return shuffle;

date/now.js

@@ -1,7 +1,7 @@
-define(['../lang/isNative'], function(isNative) {
+define(['../internal/getNative'], function(getNative) {
 
   /* Native method references for those with the same name as other `lodash` methods. */
-  var nativeNow = isNative(nativeNow = Date.now) && nativeNow;
+  var nativeNow = getNative(Date, 'now');
 
   /**
    * Gets the number of milliseconds that have elapsed since the Unix epoch

function/debounce.js

@@ -10,12 +10,13 @@ define(['../lang/isObject', '../date/now'], function(isObject, now) {
   var nativeMax = Math.max;
 
   /**
-   * Creates a function that delays invoking `func` until after `wait` milliseconds
-   * have elapsed since the last time it was invoked. The created function comes
-   * with a `cancel` method to cancel delayed invocations. Provide an options
-   * object to indicate that `func` should be invoked on the leading and/or
-   * trailing edge of the `wait` timeout. Subsequent calls to the debounced
-   * function return the result of the last `func` invocation.
+   * Creates a debounced function that delays invoking `func` until after `wait`
+   * milliseconds have elapsed since the last time the debounced function was
+   * invoked. The debounced function comes with a `cancel` method to cancel
+   * delayed invocations. Provide an options object to indicate that `func`
+   * should be invoked on the leading and/or trailing edge of the `wait` timeout.
+   * Subsequent calls to the debounced function return the result of the last
+   * `func` invocation.
    *
    * **Note:** If `leading` and `trailing` options are `true`, `func` is invoked
    * on the trailing edge of the timeout only if the the debounced function is

function/memoize.js

@@ -60,14 +60,14 @@ define(['../internal/MapCache'], function(MapCache) {
     }
     var memoized = function() {
       var args = arguments,
-          cache = memoized.cache,
-          key = resolver ? resolver.apply(this, args) : args[0];
+          key = resolver ? resolver.apply(this, args) : args[0],
+          cache = memoized.cache;
 
       if (cache.has(key)) {
         return cache.get(key);
       }
       var result = func.apply(this, args);
-      cache.set(key, result);
+      memoized.cache = cache.set(key, result);
       return result;
     };
     memoized.cache = new memoize.Cache;

function/throttle.js

@@ -11,12 +11,12 @@ define(['./debounce', '../lang/isObject'], function(debounce, isObject) {
   };
 
   /**
-   * Creates a function that only invokes `func` at most once per every `wait`
-   * milliseconds. The created function comes with a `cancel` method to cancel
-   * delayed invocations. Provide an options object to indicate that `func`
-   * should be invoked on the leading and/or trailing edge of the `wait` timeout.
-   * Subsequent calls to the throttled function return the result of the last
-   * `func` call.
+   * Creates a throttled function that only invokes `func` at most once per
+   * every `wait` milliseconds. The throttled function comes with a `cancel`
+   * method to cancel delayed invocations. Provide an options object to indicate
+   * that `func` should be invoked on the leading and/or trailing edge of the
+   * `wait` timeout. Subsequent calls to the throttled function return the
+   * result of the last `func` call.
    *
    * **Note:** If `leading` and `trailing` options are `true`, `func` is invoked
    * on the trailing edge of the timeout only if the the throttled function is

internal/SetCache.js

@@ -1,10 +1,10 @@
-define(['./cachePush', '../lang/isNative', './root'], function(cachePush, isNative, root) {
+define(['./cachePush', './getNative', './root'], function(cachePush, getNative, root) {
 
   /** Native method references. */
-  var Set = isNative(Set = root.Set) && Set;
+  var Set = getNative(root, 'Set');
 
   /* Native method references for those with the same name as other `lodash` methods. */
-  var nativeCreate = isNative(nativeCreate = Object.create) && nativeCreate;
+  var nativeCreate = getNative(Object, 'create');
 
   /**
    *

internal/arrayExtremum.js

@@ -0,0 +1,33 @@
+define([], function() {
+
+  /**
+   * A specialized version of `baseExtremum` for arrays which invokes `iteratee`
+   * with one argument: (value).
+   *
+   * @private
+   * @param {Array} array The array to iterate over.
+   * @param {Function} iteratee The function invoked per iteration.
+   * @param {Function} comparator The function used to compare values.
+   * @param {*} exValue The initial extremum value.
+   * @returns {*} Returns the extremum value.
+   */
+  function arrayExtremum(array, iteratee, comparator, exValue) {
+    var index = -1,
+        length = array.length,
+        computed = exValue,
+        result = computed;
+
+    while (++index < length) {
+      var value = array[index],
+          current = +iteratee(value);
+
+      if (comparator(current, computed)) {
+        computed = current;
+        result = value;
+      }
+    }
+    return result;
+  }
+
+  return arrayExtremum;
+});

internal/arrayMax.js

@@ -1,28 +0,0 @@
-define([], function() {
-
-  /** Used as references for `-Infinity` and `Infinity`. */
-  var NEGATIVE_INFINITY = Number.NEGATIVE_INFINITY;
-
-  /**
-   * A specialized version of `_.max` for arrays without support for iteratees.
-   *
-   * @private
-   * @param {Array} array The array to iterate over.
-   * @returns {*} Returns the maximum value.
-   */
-  function arrayMax(array) {
-    var index = -1,
-        length = array.length,
-        result = NEGATIVE_INFINITY;
-
-    while (++index < length) {
-      var value = array[index];
-      if (value > result) {
-        result = value;
-      }
-    }
-    return result;
-  }
-
-  return arrayMax;
-});

internal/arrayMin.js

@@ -1,28 +0,0 @@
-define([], function() {
-
-  /** Used as references for `-Infinity` and `Infinity`. */
-  var POSITIVE_INFINITY = Number.POSITIVE_INFINITY;
-
-  /**
-   * A specialized version of `_.min` for arrays without support for iteratees.
-   *
-   * @private
-   * @param {Array} array The array to iterate over.
-   * @returns {*} Returns the minimum value.
-   */
-  function arrayMin(array) {
-    var index = -1,
-        length = array.length,
-        result = POSITIVE_INFINITY;
-
-    while (++index < length) {
-      var value = array[index];
-      if (value < result) {
-        result = value;
-      }
-    }
-    return result;
-  }
-
-  return arrayMin;
-});

internal/assignWith.js

@@ -1,14 +1,8 @@
-define(['./getSymbols', '../object/keys'], function(getSymbols, keys) {
+define(['../object/keys'], function(keys) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;
 
-  /** Used for native method references. */
-  var arrayProto = Array.prototype;
-
-  /** Native method references. */
-  var push = arrayProto.push;
-
   /**
    * A specialized version of `_.assign` for customizing assigned values without
    * support for argument juggling, multiple sources, and `this` binding `customizer`
@@ -21,10 +15,8 @@ define(['./getSymbols', '../object/keys'], function(getSymbols, keys) {
    * @returns {Object} Returns `object`.
    */
   function assignWith(object, source, customizer) {
-    var props = keys(source);
-    push.apply(props, getSymbols(source));
-
     var index = -1,
+        props = keys(source),
         length = props.length;
 
     while (++index < length) {

internal/baseAssign.js

@@ -1,23 +1,4 @@
-define(['./baseCopy', './getSymbols', '../lang/isNative', '../object/keys'], function(baseCopy, getSymbols, isNative, keys) {
-
-  /** Native method references. */
-  var preventExtensions = isNative(Object.preventExtensions = Object.preventExtensions) && preventExtensions;
-
-  /** Used as `baseAssign`. */
-  var nativeAssign = (function() {
-    // Avoid `Object.assign` in Firefox 34-37 which have an early implementation
-    // with a now defunct try/catch behavior. See https://bugzilla.mozilla.org/show_bug.cgi?id=1103344
-    // for more details.
-    //
-    // Use `Object.preventExtensions` on a plain object instead of simply using
-    // `Object('x')` because Chrome and IE fail to throw an error when attempting
-    // to assign values to readonly indexes of strings in strict mode.
-    var object = { '1': 0 },
-        func = preventExtensions && isNative(func = Object.assign) && func;
-
-    try { func(preventExtensions(object), 'xo'); } catch(e) {}
-    return !object[1] && func;
-  }());
+define(['./baseCopy', '../object/keys'], function(baseCopy, keys) {
 
   /**
    * The base implementation of `_.assign` without support for argument juggling,
@@ -28,11 +9,11 @@ define(['./baseCopy', './getSymbols', '../lang/isNative', '../object/keys'], fun
    * @param {Object} source The source object.
    * @returns {Object} Returns `object`.
    */
-  var baseAssign = nativeAssign || function(object, source) {
+  function baseAssign(object, source) {
     return source == null
       ? object
-      : baseCopy(source, getSymbols(source), baseCopy(source, keys(source), object));
-  };
+      : baseCopy(source, keys(source), object);
+  }
 
   return baseAssign;
 });

internal/baseAt.js

@@ -1,4 +1,4 @@
-define(['./isIndex', './isLength'], function(isIndex, isLength) {
+define(['./isArrayLike', './isIndex'], function(isArrayLike, isIndex) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;
@@ -14,8 +14,9 @@ define(['./isIndex', './isLength'], function(isIndex, isLength) {
    */
   function baseAt(collection, props) {
     var index = -1,
-        length = collection.length,
-        isArr = isLength(length),
+        isNil = collection == null,
+        isArr = !isNil && isArrayLike(collection),
+        length = isArr ? collection.length : 0,
         propsLength = props.length,
         result = Array(propsLength);
 
@@ -24,7 +25,7 @@ define(['./isIndex', './isLength'], function(isIndex, isLength) {
       if (isArr) {
         result[index] = isIndex(key, length) ? collection[key] : undefined;
       } else {
-        result[index] = collection[key];
+        result[index] = isNil ? undefined : collection[key];
       }
     }
     return result;

internal/baseCompareAscending.js

@@ -8,19 +8,28 @@ define([], function() {
    * sorts them in ascending order without guaranteeing a stable sort.
    *
    * @private
-   * @param {*} value The value to compare to `other`.
-   * @param {*} other The value to compare to `value`.
+   * @param {*} value The value to compare.
+   * @param {*} other The other value to compare.
    * @returns {number} Returns the sort order indicator for `value`.
    */
   function baseCompareAscending(value, other) {
     if (value !== other) {
-      var valIsReflexive = value === value,
+      var valIsNull = value === null,
+          valIsUndef = value === undefined,
+          valIsReflexive = value === value;
+
+      var othIsNull = other === null,
+          othIsUndef = other === undefined,
           othIsReflexive = other === other;
 
-      if (value > other || !valIsReflexive || (value === undefined && othIsReflexive)) {
+      if ((value > other && !othIsNull) || !valIsReflexive ||
+          (valIsNull && !othIsUndef && othIsReflexive) ||
+          (valIsUndef && othIsReflexive)) {
         return 1;
       }
-      if (value < other || !othIsReflexive || (other === undefined && valIsReflexive)) {
+      if ((value < other && !valIsNull) || !othIsReflexive ||
+          (othIsNull && !valIsUndef && valIsReflexive) ||
+          (othIsUndef && valIsReflexive)) {
         return -1;
       }
     }

internal/baseCreate.js

@@ -1,4 +1,4 @@
-define(['../lang/isObject', './root'], function(isObject, root) {
+define(['../lang/isObject'], function(isObject) {
 
   /**
    * The base implementation of `_.create` without support for assigning
@@ -9,14 +9,14 @@ define(['../lang/isObject', './root'], function(isObject, root) {
    * @returns {Object} Returns the new object.
    */
   var baseCreate = (function() {
-    function Object() {}
+    function object() {}
     return function(prototype) {
       if (isObject(prototype)) {
-        Object.prototype = prototype;
-        var result = new Object;
-        Object.prototype = null;
+        object.prototype = prototype;
+        var result = new object;
+        object.prototype = null;
       }
-      return result || root.Object();
+      return result || {};
     };
   }());
 

internal/baseExtremum.js

@@ -1,30 +1,24 @@
 define(['./baseEach'], function(baseEach) {
 
-  /** Used as references for `-Infinity` and `Infinity`. */
-  var NEGATIVE_INFINITY = Number.NEGATIVE_INFINITY,
-      POSITIVE_INFINITY = Number.POSITIVE_INFINITY;
-
   /**
    * Gets the extremum value of `collection` invoking `iteratee` for each value
    * in `collection` to generate the criterion by which the value is ranked.
-   * The `iteratee` is invoked with three arguments: (value, index, collection).
+   * The `iteratee` is invoked with three arguments: (value, index|key, collection).
    *
    * @private
    * @param {Array|Object|string} collection The collection to iterate over.
    * @param {Function} iteratee The function invoked per iteration.
-   * @param {boolean} [isMin] Specify returning the minimum, instead of the
-   *  maximum, extremum value.
+   * @param {Function} comparator The function used to compare values.
+   * @param {*} exValue The initial extremum value.
    * @returns {*} Returns the extremum value.
    */
-  function extremumBy(collection, iteratee, isMin) {
-    var exValue = isMin ? POSITIVE_INFINITY : NEGATIVE_INFINITY,
-        computed = exValue,
+  function baseExtremum(collection, iteratee, comparator, exValue) {
+    var computed = exValue,
         result = computed;
 
     baseEach(collection, function(value, index, collection) {
-      var current = iteratee(value, index, collection);
-      if ((isMin ? (current < computed) : (current > computed)) ||
-          (current === exValue && current === result)) {
+      var current = +iteratee(value, index, collection);
+      if (comparator(current, computed) || (current === exValue && current === result)) {
         computed = current;
         result = value;
       }
@@ -32,5 +26,5 @@ define(['./baseEach'], function(baseEach) {
     return result;
   }
 
-  return extremumBy;
+  return baseExtremum;
 });

internal/baseFlatten.js

@@ -1,4 +1,4 @@
-define(['../lang/isArguments', '../lang/isArray', './isLength', './isObjectLike'], function(isArguments, isArray, isLength, isObjectLike) {
+define(['../lang/isArguments', '../lang/isArray', './isArrayLike', './isObjectLike'], function(isArguments, isArray, isArrayLike, isObjectLike) {
 
   /**
    * The base implementation of `_.flatten` with added support for restricting
@@ -6,8 +6,8 @@ define(['../lang/isArguments', '../lang/isArray', './isLength', './isObjectLike'
    *
    * @private
    * @param {Array} array The array to flatten.
-   * @param {boolean} isDeep Specify a deep flatten.
-   * @param {boolean} isStrict Restrict flattening to arrays and `arguments` objects.
+   * @param {boolean} [isDeep] Specify a deep flatten.
+   * @param {boolean} [isStrict] Restrict flattening to arrays-like objects.
    * @returns {Array} Returns the new flattened array.
    */
   function baseFlatten(array, isDeep, isStrict) {
@@ -18,8 +18,8 @@ define(['../lang/isArguments', '../lang/isArray', './isLength', './isObjectLike'
 
     while (++index < length) {
       var value = array[index];
-
-      if (isObjectLike(value) && isLength(value.length) && (isArray(value) || isArguments(value))) {
+      if (isObjectLike(value) && isArrayLike(value) &&
+          (isStrict || isArray(value) || isArguments(value))) {
         if (isDeep) {
           // Recursively flatten arrays (susceptible to call stack limits).
           value = baseFlatten(value, isDeep, isStrict);
@@ -27,7 +27,6 @@ define(['../lang/isArguments', '../lang/isArray', './isLength', './isObjectLike'
         var valIndex = -1,
             valLength = value.length;
 
-        result.length += valLength;
         while (++valIndex < valLength) {
           result[++resIndex] = value[valIndex];
         }

internal/baseGet.js

@@ -20,13 +20,13 @@ define(['./toObject'], function(toObject) {
     if (pathKey !== undefined && pathKey in toObject(object)) {
       path = [pathKey];
     }
-    var index = -1,
+    var index = 0,
         length = path.length;
 
-    while (object != null && ++index < length) {
-      var result = object = object[path[index]];
+    while (object != null && index < length) {
+      object = object[path[index++]];
     }
-    return result;
+    return (index && index == length) ? object : undefined;
   }
 
   return baseGet;

internal/baseIsEqual.js

@@ -1,4 +1,4 @@
-define(['./baseIsEqualDeep'], function(baseIsEqualDeep) {
+define(['./baseIsEqualDeep', '../lang/isObject', './isObjectLike'], function(baseIsEqualDeep, isObject, isObjectLike) {
 
   /**
    * The base implementation of `_.isEqual` without support for `this` binding
@@ -14,18 +14,10 @@ define(['./baseIsEqualDeep'], function(baseIsEqualDeep) {
    * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
    */
   function baseIsEqual(value, other, customizer, isLoose, stackA, stackB) {
-    // Exit early for identical values.
     if (value === other) {
-      // Treat `+0` vs. `-0` as not equal.
-      return value !== 0 || (1 / value == 1 / other);
+      return true;
     }
-    var valType = typeof value,
-        othType = typeof other;
-
-    // Exit early for unlike primitive values.
-    if ((valType != 'function' && valType != 'object' && othType != 'function' && othType != 'object') ||
-        value == null || other == null) {
-      // Return `false` unless both values are `NaN`.
+    if (value == null || other == null || (!isObject(value) && !isObjectLike(other))) {
       return value !== value && other !== other;
     }
     return baseIsEqualDeep(value, other, baseIsEqual, customizer, isLoose, stackA, stackB);

internal/baseIsEqualDeep.js

@@ -62,11 +62,11 @@ define(['./equalArrays', './equalByTag', './equalObjects', '../lang/isArray', '.
       return equalByTag(object, other, objTag);
     }
     if (!isLoose) {
-      var valWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),
-          othWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');
+      var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),
+          othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');
 
-      if (valWrapped || othWrapped) {
-        return equalFunc(valWrapped ? object.value() : object, othWrapped ? other.value() : other, customizer, isLoose, stackA, stackB);
+      if (objIsWrapped || othIsWrapped) {
+        return equalFunc(objIsWrapped ? object.value() : object, othIsWrapped ? other.value() : other, customizer, isLoose, stackA, stackB);
       }
     }
     if (!isSameTag) {

internal/baseIsMatch.js

@@ -1,4 +1,4 @@
-define(['./baseIsEqual'], function(baseIsEqual) {
+define(['./baseIsEqual', './toObject'], function(baseIsEqual, toObject) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;
@@ -9,41 +9,43 @@ define(['./baseIsEqual'], function(baseIsEqual) {
    *
    * @private
    * @param {Object} object The object to inspect.
-   * @param {Array} props The source property names to match.
-   * @param {Array} values The source values to match.
-   * @param {Array} strictCompareFlags Strict comparison flags for source values.
+   * @param {Array} matchData The propery names, values, and compare flags to match.
    * @param {Function} [customizer] The function to customize comparing objects.
    * @returns {boolean} Returns `true` if `object` is a match, else `false`.
    */
-  function baseIsMatch(object, props, values, strictCompareFlags, customizer) {
-    var index = -1,
-        length = props.length,
+  function baseIsMatch(object, matchData, customizer) {
+    var index = matchData.length,
+        length = index,
         noCustomizer = !customizer;
 
-    while (++index < length) {
-      if ((noCustomizer && strictCompareFlags[index])
-            ? values[index] !== object[props[index]]
-            : !(props[index] in object)
+    if (object == null) {
+      return !length;
+    }
+    object = toObject(object);
+    while (index--) {
+      var data = matchData[index];
+      if ((noCustomizer && data[2])
+            ? data[1] !== object[data[0]]
+            : !(data[0] in object)
           ) {
         return false;
       }
     }
-    index = -1;
     while (++index < length) {
-      var key = props[index],
+      data = matchData[index];
+      var key = data[0],
           objValue = object[key],
-          srcValue = values[index];
+          srcValue = data[1];
 
-      if (noCustomizer && strictCompareFlags[index]) {
-        var result = objValue !== undefined || (key in object);
-      } else {
-        result = customizer ? customizer(objValue, srcValue, key) : undefined;
-        if (result === undefined) {
-          result = baseIsEqual(srcValue, objValue, customizer, true);
+      if (noCustomizer && data[2]) {
+        if (objValue === undefined && !(key in object)) {
+          return false;
+        }
+      } else {
+        var result = customizer ? customizer(objValue, srcValue, key) : undefined;
+        if (!(result === undefined ? baseIsEqual(srcValue, objValue, customizer, true) : result)) {
+          return false;
         }
-      }
-      if (!result) {
-        return false;
       }
     }
     return true;

internal/baseMap.js

@@ -1,4 +1,4 @@
-define(['./baseEach', './getLength', './isLength'], function(baseEach, getLength, isLength) {
+define(['./baseEach', './isArrayLike'], function(baseEach, isArrayLike) {
 
   /**
    * The base implementation of `_.map` without support for callback shorthands
@@ -11,8 +11,7 @@ define(['./baseEach', './getLength', './isLength'], function(baseEach, getLength
    */
   function baseMap(collection, iteratee) {
     var index = -1,
-        length = getLength(collection),
-        result = isLength(length) ? Array(length) : [];
+        result = isArrayLike(collection) ? Array(collection.length) : [];
 
     baseEach(collection, function(value, key, collection) {
       result[++index] = iteratee(value, key, collection);

internal/baseMatches.js

@@ -1,4 +1,4 @@
-define(['./baseIsMatch', '../utility/constant', './isStrictComparable', '../object/keys', './toObject'], function(baseIsMatch, constant, isStrictComparable, keys, toObject) {
+define(['./baseIsMatch', './getMatchData', './toObject'], function(baseIsMatch, getMatchData, toObject) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;
@@ -11,35 +11,20 @@ define(['./baseIsMatch', '../utility/constant', './isStrictComparable', '../obje
    * @returns {Function} Returns the new function.
    */
   function baseMatches(source) {
-    var props = keys(source),
-        length = props.length;
+    var matchData = getMatchData(source);
+    if (matchData.length == 1 && matchData[0][2]) {
+      var key = matchData[0][0],
+          value = matchData[0][1];
 
-    if (!length) {
-      return constant(true);
-    }
-    if (length == 1) {
-      var key = props[0],
-          value = source[key];
-
-      if (isStrictComparable(value)) {
-        return function(object) {
-          if (object == null) {
-            return false;
-          }
-          return object[key] === value && (value !== undefined || (key in toObject(object)));
-        };
-      }
-    }
-    var values = Array(length),
-        strictCompareFlags = Array(length);
-
-    while (length--) {
-      value = source[props[length]];
-      values[length] = value;
-      strictCompareFlags[length] = isStrictComparable(value);
+      return function(object) {
+        if (object == null) {
+          return false;
+        }
+        return object[key] === value && (value !== undefined || (key in toObject(object)));
+      };
     }
     return function(object) {
-      return object != null && baseIsMatch(toObject(object), props, values, strictCompareFlags);
+      return baseIsMatch(object, matchData);
     };
   }
 

internal/baseMatchesProperty.js

@@ -4,17 +4,16 @@ define(['./baseGet', './baseIsEqual', './baseSlice', '../lang/isArray', './isKey
   var undefined;
 
   /**
-   * The base implementation of `_.matchesProperty` which does not which does
-   * not clone `value`.
+   * The base implementation of `_.matchesProperty` which does not clone `srcValue`.
    *
    * @private
    * @param {string} path The path of the property to get.
-   * @param {*} value The value to compare.
+   * @param {*} srcValue The value to compare.
    * @returns {Function} Returns the new function.
    */
-  function baseMatchesProperty(path, value) {
+  function baseMatchesProperty(path, srcValue) {
     var isArr = isArray(path),
-        isCommon = isKey(path) && isStrictComparable(value),
+        isCommon = isKey(path) && isStrictComparable(srcValue),
         pathKey = (path + '');
 
     path = toPath(path);
@@ -32,9 +31,9 @@ define(['./baseGet', './baseIsEqual', './baseSlice', '../lang/isArray', './isKey
         key = last(path);
         object = toObject(object);
       }
-      return object[key] === value
-        ? (value !== undefined || (key in object))
-        : baseIsEqual(value, object[key], null, true);
+      return object[key] === srcValue
+        ? (srcValue !== undefined || (key in object))
+        : baseIsEqual(srcValue, object[key], undefined, true);
     };
   }
 

internal/baseMerge.js

@@ -1,14 +1,8 @@
-define(['./arrayEach', './baseMergeDeep', './getSymbols', '../lang/isArray', './isLength', '../lang/isObject', './isObjectLike', '../lang/isTypedArray', '../object/keys'], function(arrayEach, baseMergeDeep, getSymbols, isArray, isLength, isObject, isObjectLike, isTypedArray, keys) {
+define(['./arrayEach', './baseMergeDeep', '../lang/isArray', './isArrayLike', '../lang/isObject', './isObjectLike', '../lang/isTypedArray', '../object/keys'], function(arrayEach, baseMergeDeep, isArray, isArrayLike, isObject, isObjectLike, isTypedArray, keys) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;
 
-  /** Used for native method references. */
-  var arrayProto = Array.prototype;
-
-  /** Native method references. */
-  var push = arrayProto.push;
-
   /**
    * The base implementation of `_.merge` without support for argument juggling,
    * multiple sources, and `this` binding `customizer` functions.
@@ -25,11 +19,9 @@ define(['./arrayEach', './baseMergeDeep', './getSymbols', '../lang/isArray', './
     if (!isObject(object)) {
       return object;
     }
-    var isSrcArr = isLength(source.length) && (isArray(source) || isTypedArray(source));
-    if (!isSrcArr) {
-      var props = keys(source);
-      push.apply(props, getSymbols(source));
-    }
+    var isSrcArr = isArrayLike(source) && (isArray(source) || isTypedArray(source)),
+        props = isSrcArr ? null : keys(source);
+
     arrayEach(props || source, function(srcValue, key) {
       if (props) {
         key = srcValue;
@@ -48,7 +40,7 @@ define(['./arrayEach', './baseMergeDeep', './getSymbols', '../lang/isArray', './
         if (isCommon) {
           result = srcValue;
         }
-        if ((isSrcArr || result !== undefined) &&
+        if ((result !== undefined || (isSrcArr && !(key in object))) &&
             (isCommon || (result === result ? (result !== value) : (value === value)))) {
           object[key] = result;
         }

internal/baseMergeDeep.js

@@ -1,4 +1,4 @@
-define(['./arrayCopy', './getLength', '../lang/isArguments', '../lang/isArray', './isLength', '../lang/isPlainObject', '../lang/isTypedArray', '../lang/toPlainObject'], function(arrayCopy, getLength, isArguments, isArray, isLength, isPlainObject, isTypedArray, toPlainObject) {
+define(['./arrayCopy', '../lang/isArguments', '../lang/isArray', './isArrayLike', '../lang/isPlainObject', '../lang/isTypedArray', '../lang/toPlainObject'], function(arrayCopy, isArguments, isArray, isArrayLike, isPlainObject, isTypedArray, toPlainObject) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;
@@ -34,10 +34,10 @@ define(['./arrayCopy', './getLength', '../lang/isArguments', '../lang/isArray',
 
     if (isCommon) {
       result = srcValue;
-      if (isLength(srcValue.length) && (isArray(srcValue) || isTypedArray(srcValue))) {
+      if (isArrayLike(srcValue) && (isArray(srcValue) || isTypedArray(srcValue))) {
         result = isArray(value)
           ? value
-          : (getLength(value) ? arrayCopy(value) : []);
+          : (isArrayLike(value) ? arrayCopy(value) : []);
       }
       else if (isPlainObject(srcValue) || isArguments(srcValue)) {
         result = isArguments(value)

internal/basePullAt.js

@@ -16,9 +16,9 @@ define(['./isIndex'], function(isIndex) {
    * @returns {Array} Returns `array`.
    */
   function basePullAt(array, indexes) {
-    var length = indexes.length;
+    var length = array ? indexes.length : 0;
     while (length--) {
-      var index = parseFloat(indexes[length]);
+      var index = indexes[length];
       if (index != previous && isIndex(index)) {
         var previous = index;
         splice.call(array, index, 1);

internal/baseToString.js

@@ -1,7 +1,7 @@
 define([], function() {
 
   /**
-   * Converts `value` to a string if it is not one. An empty string is returned
+   * Converts `value` to a string if it's not one. An empty string is returned
    * for `null` or `undefined` values.
    *
    * @private

internal/binaryIndex.js

@@ -1,7 +1,7 @@
 define(['./binaryIndexBy', '../utility/identity'], function(binaryIndexBy, identity) {
 
   /** Used as references for the maximum length and index of an array. */
-  var MAX_ARRAY_LENGTH = Math.pow(2, 32) - 1,
+  var MAX_ARRAY_LENGTH = 4294967295,
       HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;
 
   /**
@@ -24,7 +24,7 @@ define(['./binaryIndexBy', '../utility/identity'], function(binaryIndexBy, ident
         var mid = (low + high) >>> 1,
             computed = array[mid];
 
-        if (retHighest ? (computed <= value) : (computed < value)) {
+        if ((retHighest ? (computed <= value) : (computed < value)) && computed !== null) {
           low = mid + 1;
         } else {
           high = mid;

internal/binaryIndexBy.js

@@ -10,8 +10,8 @@ define([], function() {
   var nativeMin = Math.min;
 
   /** Used as references for the maximum length and index of an array. */
-  var MAX_ARRAY_LENGTH = Math.pow(2, 32) - 1,
-      MAX_ARRAY_INDEX =  MAX_ARRAY_LENGTH - 1;
+  var MAX_ARRAY_LENGTH = 4294967295,
+      MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1;
 
   /**
    * This function is like `binaryIndex` except that it invokes `iteratee` for
@@ -32,17 +32,23 @@ define([], function() {
     var low = 0,
         high = array ? array.length : 0,
         valIsNaN = value !== value,
+        valIsNull = value === null,
         valIsUndef = value === undefined;
 
     while (low < high) {
       var mid = floor((low + high) / 2),
           computed = iteratee(array[mid]),
+          isDef = computed !== undefined,
           isReflexive = computed === computed;
 
       if (valIsNaN) {
         var setLow = isReflexive || retHighest;
+      } else if (valIsNull) {
+        setLow = isReflexive && isDef && (retHighest || computed != null);
       } else if (valIsUndef) {
-        setLow = isReflexive && (retHighest || computed !== undefined);
+        setLow = isReflexive && (retHighest || isDef);
+      } else if (computed == null) {
+        setLow = false;
       } else {
         setLow = retHighest ? (computed <= value) : (computed < value);
       }

internal/bufferClone.js

@@ -1,10 +1,10 @@
-define(['../utility/constant', '../lang/isNative', './root'], function(constant, isNative, root) {
+define(['../utility/constant', './getNative', './root'], function(constant, getNative, root) {
 
   /** Native method references. */
-  var ArrayBuffer = isNative(ArrayBuffer = root.ArrayBuffer) && ArrayBuffer,
-      bufferSlice = isNative(bufferSlice = ArrayBuffer && new ArrayBuffer(0).slice) && bufferSlice,
+  var ArrayBuffer = getNative(root, 'ArrayBuffer'),
+      bufferSlice = getNative(ArrayBuffer && new ArrayBuffer(0), 'slice'),
       floor = Math.floor,
-      Uint8Array = isNative(Uint8Array = root.Uint8Array) && Uint8Array;
+      Uint8Array = getNative(root, 'Uint8Array');
 
   /** Used to clone array buffers. */
   var Float64Array = (function() {
@@ -12,10 +12,10 @@ define(['../utility/constant', '../lang/isNative', './root'], function(constant,
     // where the array buffer's `byteLength` is not a multiple of the typed
     // array's `BYTES_PER_ELEMENT`.
     try {
-      var func = isNative(func = root.Float64Array) && func,
+      var func = getNative(root, 'Float64Array'),
           result = new func(new ArrayBuffer(10), 0, 1) && func;
     } catch(e) {}
-    return result;
+    return result || null;
   }());
 
   /** Used as the size, in bytes, of each `Float64Array` element. */

internal/charAtCallback.js

@@ -1,15 +0,0 @@
-define([], function() {
-
-  /**
-   * Used by `_.max` and `_.min` as the default callback for string values.
-   *
-   * @private
-   * @param {string} string The string to inspect.
-   * @returns {number} Returns the code unit of the first character of the string.
-   */
-  function charAtCallback(string) {
-    return string.charCodeAt(0);
-  }
-
-  return charAtCallback;
-});

internal/composeArgsRight.js

@@ -25,12 +25,12 @@ define([], function() {
     while (++argsIndex < argsLength) {
       result[argsIndex] = args[argsIndex];
     }
-    var pad = argsIndex;
+    var offset = argsIndex;
     while (++rightIndex < rightLength) {
-      result[pad + rightIndex] = partials[rightIndex];
+      result[offset + rightIndex] = partials[rightIndex];
     }
     while (++holdersIndex < holdersLength) {
-      result[pad + holders[holdersIndex]] = args[argsIndex++];
+      result[offset + holders[holdersIndex]] = args[argsIndex++];
     }
     return result;
   }

internal/createAssigner.js

@@ -1,5 +1,8 @@
 define(['./bindCallback', './isIterateeCall', '../function/restParam'], function(bindCallback, isIterateeCall, restParam) {
 
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
+
   /**
    * Creates a function that assigns properties of source object(s) to a given
    * destination object.
@@ -14,19 +17,19 @@ define(['./bindCallback', './isIterateeCall', '../function/restParam'], function
     return restParam(function(object, sources) {
       var index = -1,
           length = object == null ? 0 : sources.length,
-          customizer = length > 2 && sources[length - 2],
-          guard = length > 2 && sources[2],
-          thisArg = length > 1 && sources[length - 1];
+          customizer = length > 2 ? sources[length - 2] : undefined,
+          guard = length > 2 ? sources[2] : undefined,
+          thisArg = length > 1 ? sources[length - 1] : undefined;
 
       if (typeof customizer == 'function') {
         customizer = bindCallback(customizer, thisArg, 5);
         length -= 2;
       } else {
-        customizer = typeof thisArg == 'function' ? thisArg : null;
+        customizer = typeof thisArg == 'function' ? thisArg : undefined;
         length -= (customizer ? 1 : 0);
       }
       if (guard && isIterateeCall(sources[0], sources[1], guard)) {
-        customizer = length < 3 ? null : customizer;
+        customizer = length < 3 ? undefined : customizer;
         length = 1;
       }
       while (++index < length) {

internal/createCache.js

@@ -1,10 +1,10 @@
-define(['./SetCache', '../utility/constant', '../lang/isNative', './root'], function(SetCache, constant, isNative, root) {
+define(['./SetCache', '../utility/constant', './getNative', './root'], function(SetCache, constant, getNative, root) {
 
   /** Native method references. */
-  var Set = isNative(Set = root.Set) && Set;
+  var Set = getNative(root, 'Set');
 
   /* Native method references for those with the same name as other `lodash` methods. */
-  var nativeCreate = isNative(nativeCreate = Object.create) && nativeCreate;
+  var nativeCreate = getNative(Object, 'create');
 
   /**
    * Creates a `Set` cache object to optimize linear searches of large arrays.

internal/createCtorWrapper.js

@@ -10,8 +10,20 @@ define(['./baseCreate', '../lang/isObject'], function(baseCreate, isObject) {
    */
   function createCtorWrapper(Ctor) {
     return function() {
+      // Use a `switch` statement to work with class constructors.
+      // See https://people.mozilla.org/~jorendorff/es6-draft.html#sec-ecmascript-function-objects-call-thisargument-argumentslist
+      // for more details.
+      var args = arguments;
+      switch (args.length) {
+        case 0: return new Ctor;
+        case 1: return new Ctor(args[0]);
+        case 2: return new Ctor(args[0], args[1]);
+        case 3: return new Ctor(args[0], args[1], args[2]);
+        case 4: return new Ctor(args[0], args[1], args[2], args[3]);
+        case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);
+      }
       var thisBinding = baseCreate(Ctor.prototype),
-          result = Ctor.apply(thisBinding, arguments);
+          result = Ctor.apply(thisBinding, args);
 
       // Mimic the constructor's `return` behavior.
       // See https://es5.github.io/#x13.2.2 for more details.

internal/createExtremum.js

@@ -1,31 +1,27 @@
-define(['./baseCallback', './charAtCallback', './extremumBy', '../lang/isArray', './isIterateeCall', '../lang/isString', './toIterable'], function(baseCallback, charAtCallback, extremumBy, isArray, isIterateeCall, isString, toIterable) {
+define(['./arrayExtremum', './baseCallback', './baseExtremum', './isIterateeCall', './toIterable'], function(arrayExtremum, baseCallback, baseExtremum, isIterateeCall, toIterable) {
 
   /**
    * Creates a `_.max` or `_.min` function.
    *
    * @private
-   * @param {Function} arrayFunc The function to get the extremum value from an array.
-   * @param {boolean} [isMin] Specify returning the minimum, instead of the maximum,
-   *  extremum value.
+   * @param {Function} comparator The function used to compare values.
+   * @param {*} exValue The initial extremum value.
    * @returns {Function} Returns the new extremum function.
    */
-  function createExtremum(arrayFunc, isMin) {
+  function createExtremum(comparator, exValue) {
     return function(collection, iteratee, thisArg) {
       if (thisArg && isIterateeCall(collection, iteratee, thisArg)) {
         iteratee = null;
       }
-      var noIteratee = iteratee == null;
-
-      iteratee = noIteratee ? iteratee : baseCallback(iteratee, thisArg, 3);
-      if (noIteratee) {
-        var isArr = isArray(collection);
-        if (!isArr && isString(collection)) {
-          iteratee = charAtCallback;
-        } else {
-          return arrayFunc(isArr ? collection : toIterable(collection));
+      iteratee = baseCallback(iteratee, thisArg, 3);
+      if (iteratee.length == 1) {
+        collection = toIterable(collection);
+        var result = arrayExtremum(collection, iteratee, comparator, exValue);
+        if (!(collection.length && result === exValue)) {
+          return result;
         }
       }
-      return extremumBy(collection, iteratee, isMin);
+      return baseExtremum(collection, iteratee, comparator, exValue);
     };
   }
 

internal/createFind.js

@@ -19,7 +19,7 @@ define(['./baseCallback', './baseFind', './baseFindIndex', '../lang/isArray'], f
         return index > -1 ? collection[index] : undefined;
       }
       return baseFind(collection, predicate, eachFunc);
-    }
+    };
   }
 
   return createFind;

internal/createFlow.js

@@ -1,5 +1,11 @@
 define(['./LodashWrapper', './getData', './getFuncName', '../lang/isArray', './isLaziable'], function(LodashWrapper, getData, getFuncName, isArray, isLaziable) {
 
+  /** Used to compose bitmasks for wrapper metadata. */
+  var CURRY_FLAG = 8,
+      PARTIAL_FLAG = 32,
+      ARY_FLAG = 128,
+      REARG_FLAG = 256;
+
   /** Used as the `TypeError` message for "Functions" methods. */
   var FUNC_ERROR_TEXT = 'Expected a function';
 
@@ -12,11 +18,8 @@ define(['./LodashWrapper', './getData', './getFuncName', '../lang/isArray', './i
    */
   function createFlow(fromRight) {
     return function() {
-      var length = arguments.length;
-      if (!length) {
-        return function() { return arguments[0]; };
-      }
       var wrapper,
+          length = arguments.length,
           index = fromRight ? length : -1,
           leftIndex = 0,
           funcs = Array(length);
@@ -26,16 +29,18 @@ define(['./LodashWrapper', './getData', './getFuncName', '../lang/isArray', './i
         if (typeof func != 'function') {
           throw new TypeError(FUNC_ERROR_TEXT);
         }
-        var funcName = wrapper ? '' : getFuncName(func);
-        wrapper = funcName == 'wrapper' ? new LodashWrapper([]) : wrapper;
+        if (!wrapper && LodashWrapper.prototype.thru && getFuncName(func) == 'wrapper') {
+          wrapper = new LodashWrapper([]);
+        }
       }
       index = wrapper ? -1 : length;
       while (++index < length) {
         func = funcs[index];
-        funcName = getFuncName(func);
 
-        var data = funcName == 'wrapper' ? getData(func) : null;
-        if (data && isLaziable(data[0])) {
+        var funcName = getFuncName(func),
+            data = funcName == 'wrapper' ? getData(func) : null;
+
+        if (data && isLaziable(data[0]) && data[1] == (ARY_FLAG | CURRY_FLAG | PARTIAL_FLAG | REARG_FLAG) && !data[4].length && data[9] == 1) {
           wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);
         } else {
           wrapper = (func.length == 1 && isLaziable(func)) ? wrapper[funcName]() : wrapper.thru(func);
@@ -47,7 +52,7 @@ define(['./LodashWrapper', './getData', './getFuncName', '../lang/isArray', './i
           return wrapper.plant(args[0]).value();
         }
         var index = 0,
-            result = funcs[index].apply(this, args);
+            result = length ? funcs[index].apply(this, args) : args[0];
 
         while (++index < length) {
           result = funcs[index].call(this, result);

internal/createHybridWrapper.js

@@ -39,10 +39,8 @@ define(['./arrayCopy', './composeArgs', './composeArgsRight', './createCtorWrapp
         isBindKey = bitmask & BIND_KEY_FLAG,
         isCurry = bitmask & CURRY_FLAG,
         isCurryBound = bitmask & CURRY_BOUND_FLAG,
-        isCurryRight = bitmask & CURRY_RIGHT_FLAG;
-
-    var Ctor = !isBindKey && createCtorWrapper(func),
-        key = func;
+        isCurryRight = bitmask & CURRY_RIGHT_FLAG,
+        Ctor = isBindKey ? null : createCtorWrapper(func);
 
     function wrapper() {
       // Avoid `arguments` object use disqualifying optimizations by
@@ -89,17 +87,18 @@ define(['./arrayCopy', './composeArgs', './composeArgsRight', './createCtorWrapp
           return result;
         }
       }
-      var thisBinding = isBind ? thisArg : this;
-      if (isBindKey) {
-        func = thisBinding[key];
-      }
+      var thisBinding = isBind ? thisArg : this,
+          fn = isBindKey ? thisBinding[func] : func;
+
       if (argPos) {
         args = reorder(args, argPos);
       }
       if (isAry && ary < args.length) {
         args.length = ary;
       }
-      var fn = (this && this !== root && this instanceof wrapper) ? (Ctor || createCtorWrapper(func)) : func;
+      if (this && this !== root && this instanceof wrapper) {
+        fn = Ctor || createCtorWrapper(func);
+      }
       return fn.apply(thisBinding, args);
     }
     return wrapper;

internal/createObjectMapper.js

@@ -0,0 +1,26 @@
+define(['./baseCallback', './baseForOwn'], function(baseCallback, baseForOwn) {
+
+  /**
+   * Creates a function for `_.mapKeys` or `_.mapValues`.
+   *
+   * @private
+   * @param {boolean} [isMapKeys] Specify mapping keys instead of values.
+   * @returns {Function} Returns the new map function.
+   */
+  function createObjectMapper(isMapKeys) {
+    return function(object, iteratee, thisArg) {
+      var result = {};
+      iteratee = baseCallback(iteratee, thisArg, 3);
+
+      baseForOwn(object, function(value, key, object) {
+        var mapped = iteratee(value, key, object);
+        key = isMapKeys ? mapped : key;
+        value = isMapKeys ? value : mapped;
+        result[key] = value;
+      });
+      return result;
+    };
+  }
+
+  return createObjectMapper;
+});

internal/createPadDir.js

@@ -10,7 +10,7 @@ define(['./baseToString', './createPadding'], function(baseToString, createPaddi
   function createPadDir(fromRight) {
     return function(string, length, chars) {
       string = baseToString(string);
-      return string && ((fromRight ? string : '') + createPadding(string, length, chars) + (fromRight ? '' : string));
+      return (fromRight ? string : '') + createPadding(string, length, chars) + (fromRight ? '' : string);
     };
   }
 

internal/equalArrays.js

@@ -1,4 +1,4 @@
-define([], function() {
+define(['./arraySome'], function(arraySome) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;
@@ -20,40 +20,35 @@ define([], function() {
   function equalArrays(array, other, equalFunc, customizer, isLoose, stackA, stackB) {
     var index = -1,
         arrLength = array.length,
-        othLength = other.length,
-        result = true;
+        othLength = other.length;
 
     if (arrLength != othLength && !(isLoose && othLength > arrLength)) {
       return false;
     }
-    // Deep compare the contents, ignoring non-numeric properties.
-    while (result && ++index < arrLength) {
+    // Ignore non-index properties.
+    while (++index < arrLength) {
       var arrValue = array[index],
-          othValue = other[index];
+          othValue = other[index],
+          result = customizer ? customizer(isLoose ? othValue : arrValue, isLoose ? arrValue : othValue, index) : undefined;
 
-      result = undefined;
-      if (customizer) {
-        result = isLoose
-          ? customizer(othValue, arrValue, index)
-          : customizer(arrValue, othValue, index);
-      }
-      if (result === undefined) {
-        // Recursively compare arrays (susceptible to call stack limits).
-        if (isLoose) {
-          var othIndex = othLength;
-          while (othIndex--) {
-            othValue = other[othIndex];
-            result = (arrValue && arrValue === othValue) || equalFunc(arrValue, othValue, customizer, isLoose, stackA, stackB);
-            if (result) {
-              break;
-            }
-          }
-        } else {
-          result = (arrValue && arrValue === othValue) || equalFunc(arrValue, othValue, customizer, isLoose, stackA, stackB);
+      if (result !== undefined) {
+        if (result) {
+          continue;
         }
+        return false;
+      }
+      // Recursively compare arrays (susceptible to call stack limits).
+      if (isLoose) {
+        if (!arraySome(other, function(othValue) {
+              return arrValue === othValue || equalFunc(arrValue, othValue, customizer, isLoose, stackA, stackB);
+            })) {
+          return false;
+        }
+      } else if (!(arrValue === othValue || equalFunc(arrValue, othValue, customizer, isLoose, stackA, stackB))) {
+        return false;
       }
     }
-    return !!result;
+    return true;
   }
 
   return equalArrays;

internal/equalByTag.js

@@ -36,8 +36,7 @@ define([], function() {
         // Treat `NaN` vs. `NaN` as equal.
         return (object != +object)
           ? other != +other
-          // But, treat `-0` vs. `+0` as not equal.
-          : (object == 0 ? ((1 / object) == (1 / other)) : object == +other);
+          : object == +other;
 
       case regexpTag:
       case stringTag:

internal/equalObjects.js

@@ -32,29 +32,22 @@ define(['../object/keys'], function(keys) {
     if (objLength != othLength && !isLoose) {
       return false;
     }
-    var skipCtor = isLoose,
-        index = -1;
-
-    while (++index < objLength) {
-      var key = objProps[index],
-          result = isLoose ? key in other : hasOwnProperty.call(other, key);
-
-      if (result) {
-        var objValue = object[key],
-            othValue = other[key];
-
-        result = undefined;
-        if (customizer) {
-          result = isLoose
-            ? customizer(othValue, objValue, key)
-            : customizer(objValue, othValue, key);
-        }
-        if (result === undefined) {
-          // Recursively compare objects (susceptible to call stack limits).
-          result = (objValue && objValue === othValue) || equalFunc(objValue, othValue, customizer, isLoose, stackA, stackB);
-        }
+    var index = objLength;
+    while (index--) {
+      var key = objProps[index];
+      if (!(isLoose ? key in other : hasOwnProperty.call(other, key))) {
+        return false;
       }
-      if (!result) {
+    }
+    var skipCtor = isLoose;
+    while (++index < objLength) {
+      key = objProps[index];
+      var objValue = object[key],
+          othValue = other[key],
+          result = customizer ? customizer(isLoose ? othValue : objValue, isLoose? objValue : othValue, key) : undefined;
+
+      // Recursively compare objects (susceptible to call stack limits).
+      if (!(result === undefined ? equalFunc(objValue, othValue, customizer, isLoose, stackA, stackB) : result)) {
         return false;
       }
       skipCtor || (skipCtor = key == 'constructor');

internal/getFuncName.js

@@ -1,4 +1,4 @@
-define(['./baseProperty', '../utility/constant', './realNames', '../support'], function(baseProperty, constant, realNames, support) {
+define(['./realNames'], function(realNames) {
 
   /**
    * Gets the name of `func`.
@@ -7,29 +7,20 @@ define(['./baseProperty', '../utility/constant', './realNames', '../support'], f
    * @param {Function} func The function to query.
    * @returns {string} Returns the function name.
    */
-  var getFuncName = (function() {
-    if (!support.funcNames) {
-      return constant('');
-    }
-    if (constant.name == 'constant') {
-      return baseProperty('name');
-    }
-    return function(func) {
-      var result = func.name,
-          array = realNames[result],
-          length = array ? array.length : 0;
+  function getFuncName(func) {
+    var result = func.name,
+        array = realNames[result],
+        length = array ? array.length : 0;
 
-      while (length--) {
-        var data = array[length],
-            otherFunc = data.func;
-
-        if (otherFunc == null || otherFunc == func) {
-          return data.name;
-        }
+    while (length--) {
+      var data = array[length],
+          otherFunc = data.func;
+      if (otherFunc == null || otherFunc == func) {
+        return data.name;
       }
-      return result;
-    };
-  }());
+    }
+    return result;
+  }
 
   return getFuncName;
 });

internal/getLength.js

@@ -4,7 +4,7 @@ define(['./baseProperty'], function(baseProperty) {
    * Gets the "length" property value of `object`.
    *
    * **Note:** This function is used to avoid a [JIT bug](https://bugs.webkit.org/show_bug.cgi?id=142792)
-   * in Safari on iOS 8.1 ARM64.
+   * that affects Safari on at least iOS 8.1-8.3 ARM64.
    *
    * @private
    * @param {Object} object The object to query.

internal/getMatchData.js

@@ -0,0 +1,21 @@
+define(['./isStrictComparable', '../object/pairs'], function(isStrictComparable, pairs) {
+
+  /**
+   * Gets the propery names, values, and compare flags of `object`.
+   *
+   * @private
+   * @param {Object} object The object to query.
+   * @returns {Array} Returns the match data of `object`.
+   */
+  function getMatchData(object) {
+    var result = pairs(object),
+        length = result.length;
+
+    while (length--) {
+      result[length][2] = isStrictComparable(result[length][1]);
+    }
+    return result;
+  }
+
+  return getMatchData;
+});

internal/getNative.js

@@ -0,0 +1,20 @@
+define(['../lang/isNative'], function(isNative) {
+
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
+
+  /**
+   * Gets the native function at `key` of `object`.
+   *
+   * @private
+   * @param {Object} object The object to query.
+   * @param {string} key The key of the method to get.
+   * @returns {*} Returns the function if it's native, else `undefined`.
+   */
+  function getNative(object, key) {
+    var value = object == null ? undefined : object[key];
+    return isNative(value) ? value : undefined;
+  }
+
+  return getNative;
+});

internal/getSymbols.js

@@ -1,18 +0,0 @@
-define(['../utility/constant', '../lang/isNative', './toObject'], function(constant, isNative, toObject) {
-
-  /** Native method references. */
-  var getOwnPropertySymbols = isNative(getOwnPropertySymbols = Object.getOwnPropertySymbols) && getOwnPropertySymbols;
-
-  /**
-   * Creates an array of the own symbols of `object`.
-   *
-   * @private
-   * @param {Object} object The object to query.
-   * @returns {Array} Returns the array of symbols.
-   */
-  var getSymbols = !getOwnPropertySymbols ? constant([]) : function(object) {
-    return getOwnPropertySymbols(toObject(object));
-  };
-
-  return getSymbols;
-});

internal/isArrayLike.js

@@ -0,0 +1,15 @@
+define(['./getLength', './isLength'], function(getLength, isLength) {
+
+  /**
+   * Checks if `value` is array-like.
+   *
+   * @private
+   * @param {*} value The value to check.
+   * @returns {boolean} Returns `true` if `value` is array-like, else `false`.
+   */
+  function isArrayLike(value) {
+    return value != null && isLength(getLength(value));
+  }
+
+  return isArrayLike;
+});

internal/isIndex.js

@@ -4,7 +4,7 @@ define([], function() {
    * Used as the [maximum length](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-number.max_safe_integer)
    * of an array-like value.
    */
-  var MAX_SAFE_INTEGER = Math.pow(2, 53) - 1;
+  var MAX_SAFE_INTEGER = 9007199254740991;
 
   /**
    * Checks if `value` is a valid array-like index.
@@ -15,7 +15,7 @@ define([], function() {
    * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.
    */
   function isIndex(value, length) {
-    value = +value;
+    value = typeof value == 'number' ? value : parseFloat(value);
     length = length == null ? MAX_SAFE_INTEGER : length;
     return value > -1 && value % 1 == 0 && value < length;
   }

internal/isIterateeCall.js

@@ -1,4 +1,4 @@
-define(['./getLength', './isIndex', './isLength', '../lang/isObject'], function(getLength, isIndex, isLength, isObject) {
+define(['./isArrayLike', './isIndex', '../lang/isObject'], function(isArrayLike, isIndex, isObject) {
 
   /**
    * Checks if the provided arguments are from an iteratee call.
@@ -14,13 +14,9 @@ define(['./getLength', './isIndex', './isLength', '../lang/isObject'], function(
       return false;
     }
     var type = typeof index;
-    if (type == 'number') {
-      var length = getLength(object),
-          prereq = isLength(length) && isIndex(index, length);
-    } else {
-      prereq = type == 'string' && index in object;
-    }
-    if (prereq) {
+    if (type == 'number'
+        ? (isArrayLike(object) && isIndex(index, object.length))
+        : (type == 'string' && index in object)) {
       var other = object[index];
       return value === value ? (value === other) : (other !== other);
     }

internal/isKey.js

@@ -1,7 +1,7 @@
 define(['../lang/isArray', './toObject'], function(isArray, toObject) {
 
   /** Used to match property names within property paths. */
-  var reIsDeepProp = /\.|\[(?:[^[\]]+|(["'])(?:(?!\1)[^\n\\]|\\.)*?)\1\]/,
+  var reIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\n\\]|\\.)*?\1)\]/,
       reIsPlainProp = /^\w*$/;
 
   /**

internal/isLaziable.js

@@ -1,4 +1,4 @@
-define(['./LazyWrapper', './getFuncName', '../chain/lodash'], function(LazyWrapper, getFuncName, lodash) {
+define(['./LazyWrapper', './getData', './getFuncName', '../chain/lodash'], function(LazyWrapper, getData, getFuncName, lodash) {
 
   /**
    * Checks if `func` has a lazy counterpart.
@@ -9,7 +9,15 @@ define(['./LazyWrapper', './getFuncName', '../chain/lodash'], function(LazyWrapp
    */
   function isLaziable(func) {
     var funcName = getFuncName(func);
-    return !!funcName && func === lodash[funcName] && funcName in LazyWrapper.prototype;
+    if (!(funcName in LazyWrapper.prototype)) {
+      return false;
+    }
+    var other = lodash[funcName];
+    if (func === other) {
+      return true;
+    }
+    var data = getData(other);
+    return !!data && func === data[0];
   }
 
   return isLaziable;

internal/isLength.js

@@ -4,7 +4,7 @@ define([], function() {
    * Used as the [maximum length](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-number.max_safe_integer)
    * of an array-like value.
    */
-  var MAX_SAFE_INTEGER = Math.pow(2, 53) - 1;
+  var MAX_SAFE_INTEGER = 9007199254740991;
 
   /**
    * Checks if `value` is a valid array-like length.

internal/isStrictComparable.js

@@ -9,7 +9,7 @@ define(['../lang/isObject'], function(isObject) {
    *  equality comparisons, else `false`.
    */
   function isStrictComparable(value) {
-    return value === value && (value === 0 ? ((1 / value) > 0) : !isObject(value));
+    return value === value && !isObject(value);
   }
 
   return isStrictComparable;

internal/metaMap.js

@@ -1,7 +1,7 @@
-define(['../lang/isNative', './root'], function(isNative, root) {
+define(['./getNative', './root'], function(getNative, root) {
 
   /** Native method references. */
-  var WeakMap = isNative(WeakMap = root.WeakMap) && WeakMap;
+  var WeakMap = getNative(root, 'WeakMap');
 
   /** Used to store function metadata. */
   var metaMap = WeakMap && new WeakMap;

internal/pickByArray.js

@@ -1,7 +1,7 @@
 define(['./toObject'], function(toObject) {
 
   /**
-   * A specialized version of `_.pick` that picks `object` properties specified
+   * A specialized version of `_.pick` which picks `object` properties specified
    * by `props`.
    *
    * @private

internal/pickByCallback.js

@@ -1,7 +1,7 @@
 define(['./baseForIn'], function(baseForIn) {
 
   /**
-   * A specialized version of `_.pick` that picks `object` properties `predicate`
+   * A specialized version of `_.pick` which picks `object` properties `predicate`
    * returns truthy for.
    *
    * @private

internal/root.js

@@ -24,7 +24,7 @@ define([], function() {
   /**
    * Used as a reference to the global object.
    *
-   * The `this` value is used if it is the global object to avoid Greasemonkey's
+   * The `this` value is used if it's the global object to avoid Greasemonkey's
    * restricted `window` object, otherwise the `window` object is used.
    */
   var root = freeGlobal || ((freeWindow !== (this && this.window)) && freeWindow) || freeSelf || this;

internal/shimKeys.js

@@ -1,4 +1,4 @@
-define(['../lang/isArguments', '../lang/isArray', './isIndex', './isLength', '../object/keysIn', '../support'], function(isArguments, isArray, isIndex, isLength, keysIn, support) {
+define(['../lang/isArguments', '../lang/isArray', './isIndex', './isLength', '../object/keysIn'], function(isArguments, isArray, isIndex, isLength, keysIn) {
 
   /** Used for native method references. */
   var objectProto = Object.prototype;
@@ -19,8 +19,8 @@ define(['../lang/isArguments', '../lang/isArray', './isIndex', './isLength', '..
         propsLength = props.length,
         length = propsLength && object.length;
 
-    var allowIndexes = length && isLength(length) &&
-      (isArray(object) || (support.nonEnumArgs && isArguments(object)));
+    var allowIndexes = !!length && isLength(length) &&
+      (isArray(object) || isArguments(object));
 
     var index = -1,
         result = [];

internal/toIterable.js

@@ -1,7 +1,7 @@
-define(['./getLength', './isLength', '../lang/isObject', '../object/values'], function(getLength, isLength, isObject, values) {
+define(['./isArrayLike', '../lang/isObject', '../object/values'], function(isArrayLike, isObject, values) {
 
   /**
-   * Converts `value` to an array-like object if it is not one.
+   * Converts `value` to an array-like object if it's not one.
    *
    * @private
    * @param {*} value The value to process.
@@ -11,7 +11,7 @@ define(['./getLength', './isLength', '../lang/isObject', '../object/values'], fu
     if (value == null) {
       return [];
     }
-    if (!isLength(getLength(value))) {
+    if (!isArrayLike(value)) {
       return values(value);
     }
     return isObject(value) ? value : Object(value);

internal/toObject.js

@@ -1,7 +1,7 @@
 define(['../lang/isObject'], function(isObject) {
 
   /**
-   * Converts `value` to an object if it is not one.
+   * Converts `value` to an object if it's not one.
    *
    * @private
    * @param {*} value The value to process.

internal/toPath.js

@@ -7,7 +7,7 @@ define(['./baseToString', '../lang/isArray'], function(baseToString, isArray) {
   var reEscapeChar = /\\(\\)?/g;
 
   /**
-   * Converts `value` to property path array if it is not one.
+   * Converts `value` to property path array if it's not one.
    *
    * @private
    * @param {*} value The value to process.

lang.js

@@ -1,7 +1,10 @@
-define(['./lang/clone', './lang/cloneDeep', './lang/isArguments', './lang/isArray', './lang/isBoolean', './lang/isDate', './lang/isElement', './lang/isEmpty', './lang/isEqual', './lang/isError', './lang/isFinite', './lang/isFunction', './lang/isMatch', './lang/isNaN', './lang/isNative', './lang/isNull', './lang/isNumber', './lang/isObject', './lang/isPlainObject', './lang/isRegExp', './lang/isString', './lang/isTypedArray', './lang/isUndefined', './lang/toArray', './lang/toPlainObject'], function(clone, cloneDeep, isArguments, isArray, isBoolean, isDate, isElement, isEmpty, isEqual, isError, isFinite, isFunction, isMatch, isNaN, isNative, isNull, isNumber, isObject, isPlainObject, isRegExp, isString, isTypedArray, isUndefined, toArray, toPlainObject) {
+define(['./lang/clone', './lang/cloneDeep', './lang/eq', './lang/gt', './lang/gte', './lang/isArguments', './lang/isArray', './lang/isBoolean', './lang/isDate', './lang/isElement', './lang/isEmpty', './lang/isEqual', './lang/isError', './lang/isFinite', './lang/isFunction', './lang/isMatch', './lang/isNaN', './lang/isNative', './lang/isNull', './lang/isNumber', './lang/isObject', './lang/isPlainObject', './lang/isRegExp', './lang/isString', './lang/isTypedArray', './lang/isUndefined', './lang/lt', './lang/lte', './lang/toArray', './lang/toPlainObject'], function(clone, cloneDeep, eq, gt, gte, isArguments, isArray, isBoolean, isDate, isElement, isEmpty, isEqual, isError, isFinite, isFunction, isMatch, isNaN, isNative, isNull, isNumber, isObject, isPlainObject, isRegExp, isString, isTypedArray, isUndefined, lt, lte, toArray, toPlainObject) {
   return {
     'clone': clone,
     'cloneDeep': cloneDeep,
+    'eq': eq,
+    'gt': gt,
+    'gte': gte,
     'isArguments': isArguments,
     'isArray': isArray,
     'isBoolean': isBoolean,
@@ -23,6 +26,8 @@ define(['./lang/clone', './lang/cloneDeep', './lang/isArguments', './lang/isArra
     'isString': isString,
     'isTypedArray': isTypedArray,
     'isUndefined': isUndefined,
+    'lt': lt,
+    'lte': lte,
     'toArray': toArray,
     'toPlainObject': toPlainObject
   };

lang/clone.js

@@ -60,8 +60,9 @@ define(['../internal/baseClone', '../internal/bindCallback', '../internal/isIter
       customizer = isDeep;
       isDeep = false;
     }
-    customizer = typeof customizer == 'function' && bindCallback(customizer, thisArg, 1);
-    return baseClone(value, isDeep, customizer);
+    return typeof customizer == 'function'
+      ? baseClone(value, isDeep, bindCallback(customizer, thisArg, 1))
+      : baseClone(value, isDeep);
   }
 
   return clone;

lang/cloneDeep.js

@@ -46,8 +46,9 @@ define(['../internal/baseClone', '../internal/bindCallback'], function(baseClone
    * // => 20
    */
   function cloneDeep(value, customizer, thisArg) {
-    customizer = typeof customizer == 'function' && bindCallback(customizer, thisArg, 1);
-    return baseClone(value, true, customizer);
+    return typeof customizer == 'function'
+      ? baseClone(value, true, bindCallback(customizer, thisArg, 1))
+      : baseClone(value, true);
   }
 
   return cloneDeep;

lang/eq.js

@@ -0,0 +1,3 @@
+define(["./isEqual"], function(isEqual) {
+  return isEqual;
+});

lang/gt.js

@@ -0,0 +1,28 @@
+define([], function() {
+
+  /**
+   * Checks if `value` is greater than `other`.
+   *
+   * @static
+   * @memberOf _
+   * @category Lang
+   * @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`.
+   * @example
+   *
+   * _.gt(3, 1);
+   * // => true
+   *
+   * _.gt(3, 3);
+   * // => false
+   *
+   * _.gt(1, 3);
+   * // => false
+   */
+  function gt(value, other) {
+    return value > other;
+  }
+
+  return gt;
+});

lang/gte.js

@@ -0,0 +1,28 @@
+define([], function() {
+
+  /**
+   * Checks if `value` is greater than or equal to `other`.
+   *
+   * @static
+   * @memberOf _
+   * @category Lang
+   * @param {*} value The value to compare.
+   * @param {*} other The other value to compare.
+   * @returns {boolean} Returns `true` if `value` is greater than or equal to `other`, else `false`.
+   * @example
+   *
+   * _.gte(3, 1);
+   * // => true
+   *
+   * _.gte(3, 3);
+   * // => true
+   *
+   * _.gte(1, 3);
+   * // => false
+   */
+  function gte(value, other) {
+    return value >= other;
+  }
+
+  return gte;
+});

lang/isArguments.js

@@ -1,7 +1,4 @@
-define(['../internal/isLength', '../internal/isObjectLike'], function(isLength, isObjectLike) {
-
-  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
-  var undefined;
+define(['../internal/isArrayLike', '../internal/isObjectLike'], function(isArrayLike, isObjectLike) {
 
   /** `Object#toString` result references. */
   var argsTag = '[object Arguments]';
@@ -32,8 +29,7 @@ define(['../internal/isLength', '../internal/isObjectLike'], function(isLength,
    * // => false
    */
   function isArguments(value) {
-    var length = isObjectLike(value) ? value.length : undefined;
-    return isLength(length) && objToString.call(value) == argsTag;
+    return isObjectLike(value) && isArrayLike(value) && objToString.call(value) == argsTag;
   }
 
   return isArguments;

lang/isArray.js

@@ -1,4 +1,4 @@
-define(['../internal/isLength', './isNative', '../internal/isObjectLike'], function(isLength, isNative, isObjectLike) {
+define(['../internal/getNative', '../internal/isLength', '../internal/isObjectLike'], function(getNative, isLength, isObjectLike) {
 
   /** `Object#toString` result references. */
   var arrayTag = '[object Array]';
@@ -13,7 +13,7 @@ define(['../internal/isLength', './isNative', '../internal/isObjectLike'], funct
   var objToString = objectProto.toString;
 
   /* Native method references for those with the same name as other `lodash` methods. */
-  var nativeIsArray = isNative(nativeIsArray = Array.isArray) && nativeIsArray;
+  var nativeIsArray = getNative(Array, 'isArray');
 
   /**
    * Checks if `value` is classified as an `Array` object.

lang/isEmpty.js

@@ -1,4 +1,4 @@
-define(['../internal/getLength', './isArguments', './isArray', './isFunction', '../internal/isLength', '../internal/isObjectLike', './isString', '../object/keys'], function(getLength, isArguments, isArray, isFunction, isLength, isObjectLike, isString, keys) {
+define(['./isArguments', './isArray', '../internal/isArrayLike', './isFunction', '../internal/isObjectLike', './isString', '../object/keys'], function(isArguments, isArray, isArrayLike, isFunction, isObjectLike, isString, keys) {
 
   /**
    * Checks if `value` is empty. A value is considered empty unless it is an
@@ -31,10 +31,9 @@ define(['../internal/getLength', './isArguments', './isArray', './isFunction', '
     if (value == null) {
       return true;
     }
-    var length = getLength(value);
-    if (isLength(length) && (isArray(value) || isString(value) || isArguments(value) ||
+    if (isArrayLike(value) && (isArray(value) || isString(value) || isArguments(value) ||
         (isObjectLike(value) && isFunction(value.splice)))) {
-      return !length;
+      return !value.length;
     }
     return !keys(value).length;
   }

lang/isEqual.js

@@ -1,4 +1,4 @@
-define(['../internal/baseIsEqual', '../internal/bindCallback', '../internal/isStrictComparable'], function(baseIsEqual, bindCallback, isStrictComparable) {
+define(['../internal/baseIsEqual', '../internal/bindCallback'], function(baseIsEqual, bindCallback) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;
@@ -18,6 +18,7 @@ define(['../internal/baseIsEqual', '../internal/bindCallback', '../internal/isSt
    *
    * @static
    * @memberOf _
+   * @alias eq
    * @category Lang
    * @param {*} value The value to compare.
    * @param {*} other The other value to compare.
@@ -47,12 +48,9 @@ define(['../internal/baseIsEqual', '../internal/bindCallback', '../internal/isSt
    * // => true
    */
   function isEqual(value, other, customizer, thisArg) {
-    customizer = typeof customizer == 'function' && bindCallback(customizer, thisArg, 3);
-    if (!customizer && isStrictComparable(value) && isStrictComparable(other)) {
-      return value === other;
-    }
+    customizer = typeof customizer == 'function' ? bindCallback(customizer, thisArg, 3) : undefined;
     var result = customizer ? customizer(value, other) : undefined;
-    return result === undefined ? baseIsEqual(value, other, customizer) : !!result;
+    return  result === undefined ? baseIsEqual(value, other, customizer) : !!result;
   }
 
   return isEqual;

lang/isFinite.js

@@ -1,8 +1,8 @@
-define(['./isNative', '../internal/root'], function(isNative, root) {
+define(['../internal/getNative', '../internal/root'], function(getNative, root) {
 
   /* Native method references for those with the same name as other `lodash` methods. */
   var nativeIsFinite = root.isFinite,
-      nativeNumIsFinite = isNative(nativeNumIsFinite = Number.isFinite) && nativeNumIsFinite;
+      nativeNumIsFinite = getNative(Number, 'isFinite');
 
   /**
    * Checks if `value` is a finite primitive number.

lang/isFunction.js

@@ -1,4 +1,4 @@
-define(['../internal/baseIsFunction', './isNative', '../internal/root'], function(baseIsFunction, isNative, root) {
+define(['../internal/baseIsFunction', '../internal/getNative', '../internal/root'], function(baseIsFunction, getNative, root) {
 
   /** `Object#toString` result references. */
   var funcTag = '[object Function]';
@@ -13,7 +13,7 @@ define(['../internal/baseIsFunction', './isNative', '../internal/root'], functio
   var objToString = objectProto.toString;
 
   /** Native method references. */
-  var Uint8Array = isNative(Uint8Array = root.Uint8Array) && Uint8Array;
+  var Uint8Array = getNative(root, 'Uint8Array');
 
   /**
    * Checks if `value` is classified as a `Function` object.

lang/isMatch.js

@@ -1,4 +1,4 @@
-define(['../internal/baseIsMatch', '../internal/bindCallback', '../internal/isStrictComparable', '../object/keys', '../internal/toObject'], function(baseIsMatch, bindCallback, isStrictComparable, keys, toObject) {
+define(['../internal/baseIsMatch', '../internal/bindCallback', '../internal/getMatchData'], function(baseIsMatch, bindCallback, getMatchData) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;
@@ -43,33 +43,8 @@ define(['../internal/baseIsMatch', '../internal/bindCallback', '../internal/isSt
    * // => true
    */
   function isMatch(object, source, customizer, thisArg) {
-    var props = keys(source),
-        length = props.length;
-
-    if (!length) {
-      return true;
-    }
-    if (object == null) {
-      return false;
-    }
-    customizer = typeof customizer == 'function' && bindCallback(customizer, thisArg, 3);
-    object = toObject(object);
-    if (!customizer && length == 1) {
-      var key = props[0],
-          value = source[key];
-
-      if (isStrictComparable(value)) {
-        return value === object[key] && (value !== undefined || (key in object));
-      }
-    }
-    var values = Array(length),
-        strictCompareFlags = Array(length);
-
-    while (length--) {
-      value = values[length] = source[props[length]];
-      strictCompareFlags[length] = isStrictComparable(value);
-    }
-    return baseIsMatch(object, props, values, strictCompareFlags, customizer);
+    customizer = typeof customizer == 'function' ? bindCallback(customizer, thisArg, 3) : undefined;
+    return baseIsMatch(object, getMatchData(source), customizer);
   }
 
   return isMatch;