Bump to v3.10.1.

README.md

@@ -1,4 +1,4 @@
-# lodash v3.7.0
+# lodash v3.10.1
 
 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.10.1-amd
+$ volo add lodash/3.10.1-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/chunk.js

@@ -1,10 +1,9 @@
 define(['../internal/baseSlice', '../internal/isIterateeCall'], function(baseSlice, isIterateeCall) {
 
-  /** Native method references. */
-  var ceil = Math.ceil;
-
   /* Native method references for those with the same name as other `lodash` methods. */
-  var nativeMax = Math.max;
+  var nativeCeil = Math.ceil,
+      nativeFloor = Math.floor,
+      nativeMax = Math.max;
 
   /**
    * Creates an array of elements split into groups the length of `size`.
@@ -30,12 +29,12 @@ define(['../internal/baseSlice', '../internal/isIterateeCall'], function(baseSli
     if (guard ? isIterateeCall(array, size, guard) : size == null) {
       size = 1;
     } else {
-      size = nativeMax(+size || 1, 1);
+      size = nativeMax(nativeFloor(size) || 1, 1);
     }
     var index = 0,
         length = array ? array.length : 0,
         resIndex = -1,
-        result = Array(ceil(length / size));
+        result = Array(nativeCeil(length / size));
 
     while (index < length) {
       result[++resIndex] = baseSlice(array, index, (index += size));

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', '../internal/isObjectLike', '../function/restParam'], function(baseDifference, baseFlatten, isArrayLike, isObjectLike, 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`](http://ecma-international.org/ecma-262/6.0/#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 (isObjectLike(array) && isArrayLike(array))
       ? baseDifference(array, baseFlatten(values, false, true))
       : [];
   });

array/flatten.js

@@ -2,7 +2,7 @@ define(['../internal/baseFlatten', '../internal/isIterateeCall'], function(baseF
 
   /**
    * Flattens a nested array. If `isDeep` is `true` the array is recursively
-   * flattened, otherwise it is only flattened a single level.
+   * flattened, otherwise it's only flattened a single level.
    *
    * @static
    * @memberOf _

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`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
+   * for equality comparisons. If `fromIndex` is negative, it's used as the offset
+   * from the end of `array`. If `array` is sorted providing `true` for `fromIndex`
+   * performs a faster binary search.
    *
    * @static
    * @memberOf _
@@ -42,10 +39,9 @@ define(['../internal/baseIndexOf', '../internal/binaryIndex'], function(baseInde
     if (typeof fromIndex == 'number') {
       fromIndex = fromIndex < 0 ? nativeMax(length + fromIndex, 0) : fromIndex;
     } else if (fromIndex) {
-      var index = binaryIndex(array, value),
-          other = array[index];
-
-      if (value === value ? (value === other) : (other !== other)) {
+      var index = binaryIndex(array, value);
+      if (index < length &&
+          (value === value ? (value === array[index]) : (array[index] !== array[index]))) {
         return index;
       }
       return -1;

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`](http://ecma-international.org/ecma-262/6.0/#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`](http://ecma-international.org/ecma-262/6.0/#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/sortedIndex.js

@@ -3,7 +3,7 @@ define(['../internal/createSortedIndex'], function(createSortedIndex) {
   /**
    * Uses a binary search to determine the lowest index at which `value` should
    * be inserted into `array` in order to maintain its sort order. If an iteratee
-   * function is provided it is invoked for `value` and each element of `array`
+   * function is provided it's invoked for `value` and each element of `array`
    * to compute their sort ranking. The iteratee is bound to `thisArg` and
    * invoked with one argument; (value).
    *

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`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
+   * for equality comparisons.
    *
    * @static
    * @memberOf _

array/uniq.js

@@ -1,10 +1,14 @@
 define(['../internal/baseCallback', '../internal/baseUniq', '../internal/isIterateeCall', '../internal/sortedUniq'], function(baseCallback, baseUniq, isIterateeCall, sortedUniq) {
 
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
+
   /**
-   * 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`](http://ecma-international.org/ecma-262/6.0/#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
+   * for sorted arrays. If an iteratee function is provided it's invoked for
    * each element in the array to generate the criterion by which uniqueness
    * is computed. The `iteratee` is bound to `thisArg` and invoked with three
    * arguments: (value, index, array).
@@ -20,10 +24,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
@@ -59,7 +59,7 @@ define(['../internal/baseCallback', '../internal/baseUniq', '../internal/isItera
     }
     if (isSorted != null && typeof isSorted != 'boolean') {
       thisArg = iteratee;
-      iteratee = isIterateeCall(array, isSorted, thisArg) ? null : isSorted;
+      iteratee = isIterateeCall(array, isSorted, thisArg) ? undefined : isSorted;
       isSorted = false;
     }
     iteratee = iteratee == null ? iteratee : baseCallback(iteratee, thisArg, 3);

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`](http://ecma-international.org/ecma-262/6.0/#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/arrayPush', '../internal/baseDifference', '../internal/baseUniq', '../internal/isArrayLike'], function(arrayPush, 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,9 +20,9 @@ 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))
+          ? arrayPush(baseDifference(result, array), 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.js

@@ -1,7 +1,8 @@
-define(['./chain/chain', './chain/commit', './chain/lodash', './chain/plant', './chain/reverse', './chain/run', './chain/tap', './chain/thru', './chain/toJSON', './chain/toString', './chain/value', './chain/valueOf', './chain/wrapperChain'], function(chain, commit, lodash, plant, reverse, run, tap, thru, toJSON, toString, value, valueOf, wrapperChain) {
+define(['./chain/chain', './chain/commit', './chain/concat', './chain/lodash', './chain/plant', './chain/reverse', './chain/run', './chain/tap', './chain/thru', './chain/toJSON', './chain/toString', './chain/value', './chain/valueOf', './chain/wrapperChain'], function(chain, commit, concat, lodash, plant, reverse, run, tap, thru, toJSON, toString, value, valueOf, wrapperChain) {
   return {
     'chain': chain,
     'commit': commit,
+    'concat': concat,
     'lodash': lodash,
     'plant': plant,
     'reverse': reverse,

chain/concat.js

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

chain/lodash.js

@@ -9,15 +9,16 @@ define(['../internal/LazyWrapper', '../internal/LodashWrapper', '../internal/bas
   /**
    * Creates a `lodash` object which wraps `value` to enable implicit chaining.
    * Methods that operate on and return arrays, collections, and functions can
-   * be chained together. Methods that return a boolean or single value will
-   * automatically end the chain returning the unwrapped value. Explicit chaining
-   * may be enabled using `_.chain`. The execution of chained methods is lazy,
-   * that is, execution is deferred until `_#value` is implicitly or explicitly
-   * called.
+   * be chained together. Methods that retrieve a single value or may return a
+   * primitive value will automatically end the chain returning the unwrapped
+   * value. Explicit chaining may be enabled using `_.chain`. The execution of
+   * chained methods is lazy, that is, execution is deferred until `_#value`
+   * is implicitly or explicitly called.
    *
    * Lazy evaluation allows several methods to support shortcut fusion. Shortcut
-   * fusion is an optimization that merges iteratees to avoid creating intermediate
-   * arrays and reduce the number of iteratee executions.
+   * fusion is an optimization strategy which merge iteratee calls; this can help
+   * to avoid the creation of intermediate data structures and greatly reduce the
+   * number of iteratee executions.
    *
    * Chaining is supported in custom builds as long as the `_#value` method is
    * directly or indirectly included in the build.
@@ -40,35 +41,37 @@ define(['../internal/LazyWrapper', '../internal/LodashWrapper', '../internal/bas
    * The chainable wrapper methods are:
    * `after`, `ary`, `assign`, `at`, `before`, `bind`, `bindAll`, `bindKey`,
    * `callback`, `chain`, `chunk`, `commit`, `compact`, `concat`, `constant`,
-   * `countBy`, `create`, `curry`, `debounce`, `defaults`, `defer`, `delay`,
-   * `difference`, `drop`, `dropRight`, `dropRightWhile`, `dropWhile`, `fill`,
-   * `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`,
+   * `countBy`, `create`, `curry`, `debounce`, `defaults`, `defaultsDeep`,
+   * `defer`, `delay`, `difference`, `drop`, `dropRight`, `dropRightWhile`,
+   * `dropWhile`, `fill`, `filter`, `flatten`, `flattenDeep`, `flow`, `flowRight`,
+   * `forEach`, `forEachRight`, `forIn`, `forInRight`, `forOwn`, `forOwnRight`,
+   * `functions`, `groupBy`, `indexBy`, `initial`, `intersection`, `invert`,
+   * `invoke`, `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`,
+   * `matchesProperty`, `memoize`, `merge`, `method`, `methodOf`, `mixin`,
+   * `modArgs`, `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`
+   * `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`
+   * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clone`, `cloneDeep`,
+   * `deburr`, `endsWith`, `escape`, `escapeRegExp`, `every`, `find`, `findIndex`,
+   * `findKey`, `findLast`, `findLastIndex`, `findLastKey`, `findWhere`, `first`,
+   * `floor`, `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`, `round`, `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.

chain/wrapperCommit.js

@@ -10,16 +10,16 @@ define(['../internal/LodashWrapper'], function(LodashWrapper) {
    * @example
    *
    * var array = [1, 2];
-   * var wrapper = _(array).push(3);
+   * var wrapped = _(array).push(3);
    *
    * console.log(array);
    * // => [1, 2]
    *
-   * wrapper = wrapper.commit();
+   * wrapped = wrapped.commit();
    * console.log(array);
    * // => [1, 2, 3]
    *
-   * wrapper.last();
+   * wrapped.last();
    * // => 3
    *
    * console.log(array);

chain/wrapperConcat.js

@@ -0,0 +1,31 @@
+define(['../internal/arrayConcat', '../internal/baseFlatten', '../lang/isArray', '../function/restParam', '../internal/toObject'], function(arrayConcat, baseFlatten, isArray, restParam, toObject) {
+
+  /**
+   * Creates a new array joining a wrapped array with any additional arrays
+   * and/or values.
+   *
+   * @name concat
+   * @memberOf _
+   * @category Chain
+   * @param {...*} [values] The values to concatenate.
+   * @returns {Array} Returns the new concatenated array.
+   * @example
+   *
+   * var array = [1];
+   * var wrapped = _(array).concat(2, [3], [[4]]);
+   *
+   * console.log(wrapped.value());
+   * // => [1, 2, 3, [4]]
+   *
+   * console.log(array);
+   * // => [1]
+   */
+  var wrapperConcat = restParam(function(values) {
+    values = baseFlatten(values);
+    return this.thru(function(array) {
+      return arrayConcat(isArray(array) ? array : [toObject(array)], values);
+    });
+  });
+
+  return wrapperConcat;
+});

chain/wrapperPlant.js

@@ -10,17 +10,17 @@ define(['../internal/baseLodash', '../internal/wrapperClone'], function(baseLoda
    * @example
    *
    * var array = [1, 2];
-   * var wrapper = _(array).map(function(value) {
+   * var wrapped = _(array).map(function(value) {
    *   return Math.pow(value, 2);
    * });
    *
    * var other = [3, 4];
-   * var otherWrapper = wrapper.plant(other);
+   * var otherWrapped = wrapped.plant(other);
    *
-   * otherWrapper.value();
+   * otherWrapped.value();
    * // => [9, 16]
    *
-   * wrapper.value();
+   * wrapped.value();
    * // => [1, 4]
    */
   function wrapperPlant(value) {

chain/wrapperReverse.js

@@ -1,5 +1,8 @@
 define(['../internal/LazyWrapper', '../internal/LodashWrapper', './thru'], function(LazyWrapper, LodashWrapper, thru) {
 
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
+
   /**
    * Reverses the wrapped array so the first element becomes the last, the
    * second element becomes the second to last, and so on.
@@ -22,15 +25,20 @@ define(['../internal/LazyWrapper', '../internal/LodashWrapper', './thru'], funct
    */
   function wrapperReverse() {
     var value = this.__wrapped__;
-    if (value instanceof LazyWrapper) {
-      if (this.__actions__.length) {
-        value = new LazyWrapper(this);
-      }
-      return new LodashWrapper(value.reverse(), this.__chain__);
-    }
-    return this.thru(function(value) {
+
+    var interceptor = function(value) {
       return value.reverse();
-    });
+    };
+    if (value instanceof LazyWrapper) {
+      var wrapped = value;
+      if (this.__actions__.length) {
+        wrapped = new LazyWrapper(this);
+      }
+      wrapped = wrapped.reverse();
+      wrapped.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined });
+      return new LodashWrapper(wrapped, this.__chain__);
+    }
+    return this.thru(interceptor);
   }
 
   return wrapperReverse;

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/every.js

@@ -54,7 +54,7 @@ define(['../internal/arrayEvery', '../internal/baseCallback', '../internal/baseE
   function every(collection, predicate, thisArg) {
     var func = isArray(collection) ? arrayEvery : baseEvery;
     if (thisArg && isIterateeCall(collection, predicate, thisArg)) {
-      predicate = null;
+      predicate = undefined;
     }
     if (typeof predicate != 'function' || thisArg !== undefined) {
       predicate = baseCallback(predicate, thisArg, 3);

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 `target` is in `collection` using
+   * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
+   * for equality comparisons. If `fromIndex` is negative, it's used as the offset
+   * from the end of `collection`.
    *
    * @static
    * @memberOf _
@@ -41,17 +38,14 @@ define(['../internal/baseIndexOf', '../internal/getLength', '../lang/isArray', '
       collection = values(collection);
       length = collection.length;
     }
-    if (!length) {
-      return false;
-    }
     if (typeof fromIndex != 'number' || (guard && isIterateeCall(target, fromIndex, guard))) {
       fromIndex = 0;
     } else {
       fromIndex = fromIndex < 0 ? nativeMax(length + fromIndex, 0) : (fromIndex || 0);
     }
     return (typeof collection == 'string' || !isArray(collection) && isString(collection))
-      ? (fromIndex < length && collection.indexOf(target, fromIndex) > -1)
-      : (baseIndexOf(collection, target, fromIndex) > -1);
+      ? (fromIndex <= length && collection.indexOf(target, fromIndex) > -1)
+      : (!!length && baseIndexOf(collection, target, fromIndex) > -1);
   }
 
   return includes;

collection/invoke.js

@@ -1,9 +1,12 @@
-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) {
+
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
 
   /**
-   * 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
+   * are provided to each invoked method. If `methodName` is a function it's
    * invoked for, and `this` bound to, each element in `collection`.
    *
    * @static
@@ -26,11 +29,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] : undefined);
       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,11 +8,12 @@ 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:
-   * `assign`, `defaults`, `includes`, `merge`, `sortByAll`, and `sortByOrder`
+   * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `sortByAll`,
+   * and `sortByOrder`
    *
    * @static
    * @memberOf _

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;

collection/some.js

@@ -55,7 +55,7 @@ define(['../internal/arraySome', '../internal/baseCallback', '../internal/baseSo
   function some(collection, predicate, thisArg) {
     var func = isArray(collection) ? arraySome : baseSome;
     if (thisArg && isIterateeCall(collection, predicate, thisArg)) {
-      predicate = null;
+      predicate = undefined;
     }
     if (typeof predicate != 'function' || thisArg !== undefined) {
       predicate = baseCallback(predicate, thisArg, 3);

collection/sortBy.js

@@ -1,5 +1,8 @@
 define(['../internal/baseCallback', '../internal/baseMap', '../internal/baseSortBy', '../internal/compareAscending', '../internal/isIterateeCall'], function(baseCallback, baseMap, baseSortBy, compareAscending, isIterateeCall) {
 
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
+
   /**
    * Creates an array of elements, sorted in ascending order by the results of
    * running each element in a collection through `iteratee`. This method performs
@@ -53,7 +56,7 @@ define(['../internal/baseCallback', '../internal/baseMap', '../internal/baseSort
       return [];
     }
     if (thisArg && isIterateeCall(collection, iteratee, thisArg)) {
-      iteratee = null;
+      iteratee = undefined;
     }
     var index = -1;
     iteratee = baseCallback(iteratee, thisArg, 3);

collection/sortByOrder.js

@@ -1,10 +1,13 @@
 define(['../internal/baseSortByOrder', '../lang/isArray', '../internal/isIterateeCall'], function(baseSortByOrder, isArray, isIterateeCall) {
 
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
+
   /**
    * This method is like `_.sortByAll` except that it allows specifying the
-   * sort orders of the iteratees to sort by. A truthy value in `orders` will
-   * sort the corresponding property name in ascending order while a falsey
-   * value will sort it in descending order.
+   * sort orders of the iteratees to sort by. If `orders` is unspecified, all
+   * values are sorted in ascending order. Otherwise, a value is sorted in
+   * ascending order if its corresponding order is "asc", and descending if "desc".
    *
    * If a property name is provided for an iteratee the created `_.property`
    * style callback returns the property value of the given element.
@@ -18,7 +21,7 @@ define(['../internal/baseSortByOrder', '../lang/isArray', '../internal/isIterate
    * @category Collection
    * @param {Array|Object|string} collection The collection to iterate over.
    * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.
-   * @param {boolean[]} orders The sort orders of `iteratees`.
+   * @param {boolean[]} [orders] The sort orders of `iteratees`.
    * @param- {Object} [guard] Enables use as a callback for functions like `_.reduce`.
    * @returns {Array} Returns the new sorted array.
    * @example
@@ -31,7 +34,7 @@ define(['../internal/baseSortByOrder', '../lang/isArray', '../internal/isIterate
    * ];
    *
    * // sort by `user` in ascending order and by `age` in descending order
-   * _.map(_.sortByOrder(users, ['user', 'age'], [true, false]), _.values);
+   * _.map(_.sortByOrder(users, ['user', 'age'], ['asc', 'desc']), _.values);
    * // => [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 42]]
    */
   function sortByOrder(collection, iteratees, orders, guard) {
@@ -39,7 +42,7 @@ define(['../internal/baseSortByOrder', '../lang/isArray', '../internal/isIterate
       return [];
     }
     if (guard && isIterateeCall(iteratees, orders, guard)) {
-      orders = null;
+      orders = undefined;
     }
     if (!isArray(iteratees)) {
       iteratees = iteratees == null ? [] : [iteratees];

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.js

@@ -1,4 +1,4 @@
-define(['./function/after', './function/ary', './function/backflow', './function/before', './function/bind', './function/bindAll', './function/bindKey', './function/compose', './function/curry', './function/curryRight', './function/debounce', './function/defer', './function/delay', './function/flow', './function/flowRight', './function/memoize', './function/negate', './function/once', './function/partial', './function/partialRight', './function/rearg', './function/restParam', './function/spread', './function/throttle', './function/wrap'], function(after, ary, backflow, before, bind, bindAll, bindKey, compose, curry, curryRight, debounce, defer, delay, flow, flowRight, memoize, negate, once, partial, partialRight, rearg, restParam, spread, throttle, wrap) {
+define(['./function/after', './function/ary', './function/backflow', './function/before', './function/bind', './function/bindAll', './function/bindKey', './function/compose', './function/curry', './function/curryRight', './function/debounce', './function/defer', './function/delay', './function/flow', './function/flowRight', './function/memoize', './function/modArgs', './function/negate', './function/once', './function/partial', './function/partialRight', './function/rearg', './function/restParam', './function/spread', './function/throttle', './function/wrap'], function(after, ary, backflow, before, bind, bindAll, bindKey, compose, curry, curryRight, debounce, defer, delay, flow, flowRight, memoize, modArgs, negate, once, partial, partialRight, rearg, restParam, spread, throttle, wrap) {
   return {
     'after': after,
     'ary': ary,
@@ -16,6 +16,7 @@ define(['./function/after', './function/ary', './function/backflow', './function
     'flow': flow,
     'flowRight': flowRight,
     'memoize': memoize,
+    'modArgs': modArgs,
     'negate': negate,
     'once': once,
     'partial': partial,

function/after.js

@@ -8,7 +8,7 @@ define(['../internal/root'], function(root) {
 
   /**
    * The opposite of `_.before`; this method creates a function that invokes
-   * `func` once it is called `n` or more times.
+   * `func` once it's called `n` or more times.
    *
    * @static
    * @memberOf _

function/ary.js

@@ -1,5 +1,8 @@
 define(['../internal/createWrapper', '../internal/isIterateeCall'], function(createWrapper, isIterateeCall) {
 
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
+
   /** Used to compose bitmasks for wrapper metadata. */
   var ARY_FLAG = 128;
 
@@ -24,10 +27,10 @@ define(['../internal/createWrapper', '../internal/isIterateeCall'], function(cre
    */
   function ary(func, n, guard) {
     if (guard && isIterateeCall(func, n, guard)) {
-      n = null;
+      n = undefined;
     }
     n = (func && n == null) ? func.length : nativeMax(+n || 0, 0);
-    return createWrapper(func, ARY_FLAG, null, null, null, null, n);
+    return createWrapper(func, ARY_FLAG, undefined, undefined, undefined, undefined, n);
   }
 
   return ary;

function/before.js

@@ -1,11 +1,14 @@
 define([], function() {
 
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
+
   /** Used as the `TypeError` message for "Functions" methods. */
   var FUNC_ERROR_TEXT = 'Expected a function';
 
   /**
    * Creates a function that invokes `func`, with the `this` binding and arguments
-   * of the created function, while it is called less than `n` times. Subsequent
+   * of the created function, while it's called less than `n` times. Subsequent
    * calls to the created function return the result of the last `func` invocation.
    *
    * @static
@@ -35,7 +38,7 @@ define([], function() {
         result = func.apply(this, arguments);
       }
       if (n <= 1) {
-        func = null;
+        func = undefined;
       }
       return result;
     };

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
@@ -33,7 +34,7 @@ define(['../lang/isObject', '../date/now'], function(isObject, now) {
    * @param {boolean} [options.leading=false] Specify invoking on the leading
    *  edge of the timeout.
    * @param {number} [options.maxWait] The maximum time `func` is allowed to be
-   *  delayed before it is invoked.
+   *  delayed before it's invoked.
    * @param {boolean} [options.trailing=true] Specify invoking on the trailing
    *  edge of the timeout.
    * @returns {Function} Returns the new debounced function.
@@ -91,9 +92,9 @@ define(['../lang/isObject', '../date/now'], function(isObject, now) {
       var leading = true;
       trailing = false;
     } else if (isObject(options)) {
-      leading = options.leading;
+      leading = !!options.leading;
       maxWait = 'maxWait' in options && nativeMax(+options.maxWait || 0, wait);
-      trailing = 'trailing' in options ? options.trailing : trailing;
+      trailing = 'trailing' in options ? !!options.trailing : trailing;
     }
 
     function cancel() {
@@ -103,41 +104,35 @@ define(['../lang/isObject', '../date/now'], function(isObject, now) {
       if (maxTimeoutId) {
         clearTimeout(maxTimeoutId);
       }
+      lastCalled = 0;
       maxTimeoutId = timeoutId = trailingCall = undefined;
     }
 
+    function complete(isCalled, id) {
+      if (id) {
+        clearTimeout(id);
+      }
+      maxTimeoutId = timeoutId = trailingCall = undefined;
+      if (isCalled) {
+        lastCalled = now();
+        result = func.apply(thisArg, args);
+        if (!timeoutId && !maxTimeoutId) {
+          args = thisArg = undefined;
+        }
+      }
+    }
+
     function delayed() {
       var remaining = wait - (now() - stamp);
       if (remaining <= 0 || remaining > wait) {
-        if (maxTimeoutId) {
-          clearTimeout(maxTimeoutId);
-        }
-        var isCalled = trailingCall;
-        maxTimeoutId = timeoutId = trailingCall = undefined;
-        if (isCalled) {
-          lastCalled = now();
-          result = func.apply(thisArg, args);
-          if (!timeoutId && !maxTimeoutId) {
-            args = thisArg = null;
-          }
-        }
+        complete(trailingCall, maxTimeoutId);
       } else {
         timeoutId = setTimeout(delayed, remaining);
       }
     }
 
     function maxDelayed() {
-      if (timeoutId) {
-        clearTimeout(timeoutId);
-      }
-      maxTimeoutId = timeoutId = trailingCall = undefined;
-      if (trailing || (maxWait !== wait)) {
-        lastCalled = now();
-        result = func.apply(thisArg, args);
-        if (!timeoutId && !maxTimeoutId) {
-          args = thisArg = null;
-        }
-      }
+      complete(trailing, timeoutId);
     }
 
     function debounced() {
@@ -177,7 +172,7 @@ define(['../lang/isObject', '../date/now'], function(isObject, now) {
         result = func.apply(thisArg, args);
       }
       if (isCalled && !timeoutId && !maxTimeoutId) {
-        args = thisArg = null;
+        args = thisArg = undefined;
       }
       return result;
     }

function/defer.js

@@ -2,7 +2,7 @@ define(['../internal/baseDelay', './restParam'], function(baseDelay, restParam)
 
   /**
    * Defers invoking the `func` until the current call stack has cleared. Any
-   * additional arguments are provided to `func` when it is invoked.
+   * additional arguments are provided to `func` when it's invoked.
    *
    * @static
    * @memberOf _

function/delay.js

@@ -2,7 +2,7 @@ define(['../internal/baseDelay', './restParam'], function(baseDelay, restParam)
 
   /**
    * Invokes `func` after `wait` milliseconds. Any additional arguments are
-   * provided to `func` when it is invoked.
+   * provided to `func` when it's invoked.
    *
    * @static
    * @memberOf _

function/memoize.js

@@ -13,7 +13,7 @@ define(['../internal/MapCache'], function(MapCache) {
    *
    * **Note:** The cache is exposed as the `cache` property on the memoized
    * function. Its creation may be customized by replacing the `_.memoize.Cache`
-   * constructor with one whose instances implement the [`Map`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-properties-of-the-map-prototype-object)
+   * constructor with one whose instances implement the [`Map`](http://ecma-international.org/ecma-262/6.0/#sec-properties-of-the-map-prototype-object)
    * method interface of `get`, `has`, and `set`.
    *
    * @static
@@ -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/modArgs.js

@@ -0,0 +1,56 @@
+define(['../internal/arrayEvery', '../internal/baseFlatten', '../internal/baseIsFunction', './restParam'], function(arrayEvery, baseFlatten, baseIsFunction, restParam) {
+
+  /** Used as the `TypeError` message for "Functions" methods. */
+  var FUNC_ERROR_TEXT = 'Expected a function';
+
+  /* Native method references for those with the same name as other `lodash` methods. */
+  var nativeMin = Math.min;
+
+  /**
+   * Creates a function that runs each argument through a corresponding
+   * transform function.
+   *
+   * @static
+   * @memberOf _
+   * @category Function
+   * @param {Function} func The function to wrap.
+   * @param {...(Function|Function[])} [transforms] The functions to transform
+   * arguments, specified as individual functions or arrays of functions.
+   * @returns {Function} Returns the new function.
+   * @example
+   *
+   * function doubled(n) {
+   *   return n * 2;
+   * }
+   *
+   * function square(n) {
+   *   return n * n;
+   * }
+   *
+   * var modded = _.modArgs(function(x, y) {
+   *   return [x, y];
+   * }, square, doubled);
+   *
+   * modded(1, 2);
+   * // => [1, 4]
+   *
+   * modded(5, 10);
+   * // => [25, 20]
+   */
+  var modArgs = restParam(function(func, transforms) {
+    transforms = baseFlatten(transforms);
+    if (typeof func != 'function' || !arrayEvery(transforms, baseIsFunction)) {
+      throw new TypeError(FUNC_ERROR_TEXT);
+    }
+    var length = transforms.length;
+    return restParam(function(args) {
+      var index = nativeMin(args.length, length);
+      while (index--) {
+        args[index] = transforms[index](args[index]);
+      }
+      return func.apply(this, args);
+    });
+  });
+
+  return modArgs;
+});

function/rearg.js

@@ -1,5 +1,8 @@
 define(['../internal/baseFlatten', '../internal/createWrapper', './restParam'], function(baseFlatten, createWrapper, restParam) {
 
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
+
   /** Used to compose bitmasks for wrapper metadata. */
   var REARG_FLAG = 256;
 
@@ -32,7 +35,7 @@ define(['../internal/baseFlatten', '../internal/createWrapper', './restParam'],
    * // => [3, 6, 9]
    */
   var rearg = restParam(function(func, indexes) {
-    return createWrapper(func, REARG_FLAG, null, null, null, baseFlatten(indexes));
+    return createWrapper(func, REARG_FLAG, undefined, undefined, undefined, baseFlatten(indexes));
   });
 
   return rearg;

function/restParam.js

@@ -13,7 +13,7 @@ define([], function() {
    * Creates a function that invokes `func` with the `this` binding of the
    * created function and arguments from `start` and beyond provided as an array.
    *
-   * **Note:** This method is based on the [rest parameter](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Functions/rest_parameters).
+   * **Note:** This method is based on the [rest parameter](https://developer.mozilla.org/Web/JavaScript/Reference/Functions/rest_parameters).
    *
    * @static
    * @memberOf _

function/spread.js

@@ -7,7 +7,7 @@ define([], function() {
    * Creates a function that invokes `func` with the `this` binding of the created
    * function and an array of arguments much like [`Function#apply`](https://es5.github.io/#x15.3.4.3).
    *
-   * **Note:** This method is based on the [spread operator](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Spread_operator).
+   * **Note:** This method is based on the [spread operator](https://developer.mozilla.org/Web/JavaScript/Reference/Operators/Spread_operator).
    *
    * @static
    * @memberOf _

function/throttle.js

@@ -3,20 +3,13 @@ define(['./debounce', '../lang/isObject'], function(debounce, isObject) {
   /** Used as the `TypeError` message for "Functions" methods. */
   var FUNC_ERROR_TEXT = 'Expected a function';
 
-  /** Used as an internal `_.debounce` options object by `_.throttle`. */
-  var debounceOptions = {
-    'leading': false,
-    'maxWait': 0,
-    'trailing': false
-  };
-
   /**
-   * 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
@@ -62,10 +55,7 @@ define(['./debounce', '../lang/isObject'], function(debounce, isObject) {
       leading = 'leading' in options ? !!options.leading : leading;
       trailing = 'trailing' in options ? !!options.trailing : trailing;
     }
-    debounceOptions.leading = leading;
-    debounceOptions.maxWait = +wait;
-    debounceOptions.trailing = trailing;
-    return debounce(func, wait, debounceOptions);
+    return debounce(func, wait, { 'leading': leading, 'maxWait': +wait, 'trailing': trailing });
   }
 
   return throttle;

function/wrap.js

@@ -1,5 +1,8 @@
 define(['../internal/createWrapper', '../utility/identity'], function(createWrapper, identity) {
 
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
+
   /** Used to compose bitmasks for wrapper metadata. */
   var PARTIAL_FLAG = 32;
 
@@ -26,7 +29,7 @@ define(['../internal/createWrapper', '../utility/identity'], function(createWrap
    */
   function wrap(value, wrapper) {
     wrapper = wrapper == null ? identity : wrapper;
-    return createWrapper(wrapper, PARTIAL_FLAG, null, [value], []);
+    return createWrapper(wrapper, PARTIAL_FLAG, undefined, [value], []);
   }
 
   return wrap;

internal/LazyWrapper.js

@@ -11,13 +11,12 @@ define(['./baseCreate', './baseLodash'], function(baseCreate, baseLodash) {
    */
   function LazyWrapper(value) {
     this.__wrapped__ = value;
-    this.__actions__ = null;
+    this.__actions__ = [];
     this.__dir__ = 1;
-    this.__dropCount__ = 0;
     this.__filtered__ = false;
-    this.__iteratees__ = null;
+    this.__iteratees__ = [];
     this.__takeCount__ = POSITIVE_INFINITY;
-    this.__views__ = null;
+    this.__views__ = [];
   }
 
   LazyWrapper.prototype = baseCreate(baseLodash.prototype);

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/arrayConcat.js

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

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/arrayPush.js

@@ -0,0 +1,23 @@
+define([], function() {
+
+  /**
+   * Appends the elements of `values` to `array`.
+   *
+   * @private
+   * @param {Array} array The array to modify.
+   * @param {Array} values The values to append.
+   * @returns {Array} Returns `array`.
+   */
+  function arrayPush(array, values) {
+    var index = -1,
+        length = values.length,
+        offset = array.length;
+
+    while (++index < length) {
+      array[offset + index] = values[index];
+    }
+    return array;
+  }
+
+  return arrayPush;
+});

internal/arraySum.js

@@ -1,18 +1,20 @@
 define([], function() {
 
   /**
-   * A specialized version of `_.sum` for arrays without support for iteratees.
+   * A specialized version of `_.sum` for arrays without support for callback
+   * shorthands and `this` binding..
    *
    * @private
    * @param {Array} array The array to iterate over.
+   * @param {Function} iteratee The function invoked per iteration.
    * @returns {number} Returns the sum.
    */
-  function arraySum(array) {
+  function arraySum(array, iteratee) {
     var length = array.length,
         result = 0;
 
     while (length--) {
-      result += +array[length] || 0;
+      result += +iteratee(array[length]) || 0;
     }
     return result;
   }

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/baseClone.js

@@ -48,7 +48,7 @@ define(['./arrayCopy', './arrayEach', './baseAssign', './baseForOwn', './initClo
   var objectProto = Object.prototype;
 
   /**
-   * Used to resolve the [`toStringTag`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-object.prototype.tostring)
+   * Used to resolve the [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)
    * of values.
    */
   var objToString = objectProto.toString;
@@ -99,7 +99,7 @@ define(['./arrayCopy', './arrayEach', './baseAssign', './baseForOwn', './initClo
           : (object ? value : {});
       }
     }
-    // Check for circular references and return corresponding clone.
+    // Check for circular references and return its corresponding clone.
     stackA || (stackA = []);
     stackB || (stackB = []);
 

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,7 @@
-define(['../lang/isObject', './root'], function(isObject, root) {
+define(['../lang/isObject'], function(isObject) {
+
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
 
   /**
    * The base implementation of `_.create` without support for assigning
@@ -9,14 +12,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 = undefined;
       }
-      return result || root.Object();
+      return result || {};
     };
   }());
 

internal/baseDifference.js

@@ -1,5 +1,8 @@
 define(['./baseIndexOf', './cacheIndexOf', './createCache'], function(baseIndexOf, cacheIndexOf, createCache) {
 
+  /** Used as the size to enable large array optimizations. */
+  var LARGE_ARRAY_SIZE = 200;
+
   /**
    * The base implementation of `_.difference` which accepts a single array
    * of values to exclude.
@@ -19,7 +22,7 @@ define(['./baseIndexOf', './cacheIndexOf', './createCache'], function(baseIndexO
     var index = -1,
         indexOf = baseIndexOf,
         isCommon = true,
-        cache = (isCommon && values.length >= 200) ? createCache(values) : null,
+        cache = (isCommon && values.length >= LARGE_ARRAY_SIZE) ? createCache(values) : null,
         valuesLength = values.length;
 
     if (cache) {

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(['./arrayPush', '../lang/isArguments', '../lang/isArray', './isArrayLike', './isObjectLike'], function(arrayPush, isArguments, isArray, isArrayLike, isObjectLike) {
 
   /**
    * The base implementation of `_.flatten` with added support for restricting
@@ -6,33 +6,29 @@ 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.
+   * @param {Array} [result=[]] The initial result value.
    * @returns {Array} Returns the new flattened array.
    */
-  function baseFlatten(array, isDeep, isStrict) {
+  function baseFlatten(array, isDeep, isStrict, result) {
+    result || (result = []);
+
     var index = -1,
-        length = array.length,
-        resIndex = -1,
-        result = [];
+        length = array.length;
 
     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);
-        }
-        var valIndex = -1,
-            valLength = value.length;
-
-        result.length += valLength;
-        while (++valIndex < valLength) {
-          result[++resIndex] = value[valIndex];
+          baseFlatten(value, isDeep, isStrict, result);
+        } else {
+          arrayPush(result, value);
         }
       } else if (!isStrict) {
-        result[++resIndex] = value;
+        result[result.length] = value;
       }
     }
     return result;

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

@@ -12,7 +12,7 @@ define(['./equalArrays', './equalByTag', './equalObjects', '../lang/isArray', '.
   var hasOwnProperty = objectProto.hasOwnProperty;
 
   /**
-   * Used to resolve the [`toStringTag`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-object.prototype.tostring)
+   * Used to resolve the [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)
    * of values.
    */
   var objToString = objectProto.toString;
@@ -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.
@@ -16,7 +10,7 @@ define(['./arrayEach', './baseMergeDeep', './getSymbols', '../lang/isArray', './
    * @private
    * @param {Object} object The destination object.
    * @param {Object} source The source object.
-   * @param {Function} [customizer] The function to customize merging properties.
+   * @param {Function} [customizer] The function to customize merged values.
    * @param {Array} [stackA=[]] Tracks traversed source objects.
    * @param {Array} [stackB=[]] Associates values with source counterparts.
    * @returns {Object} Returns `object`.
@@ -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 ? undefined : 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;
@@ -13,7 +13,7 @@ define(['./arrayCopy', './getLength', '../lang/isArguments', '../lang/isArray',
    * @param {Object} source The source object.
    * @param {string} key The key of the value to merge.
    * @param {Function} mergeFunc The function to merge values.
-   * @param {Function} [customizer] The function to customize merging properties.
+   * @param {Function} [customizer] The function to customize merged values.
    * @param {Array} [stackA=[]] Tracks traversed source objects.
    * @param {Array} [stackB=[]] Associates values with source counterparts.
    * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
@@ -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/baseRandom.js

@@ -1,10 +1,8 @@
 define([], function() {
 
-  /** Native method references. */
-  var floor = Math.floor;
-
   /* Native method references for those with the same name as other `lodash` methods. */
-  var nativeRandom = Math.random;
+  var nativeFloor = Math.floor,
+      nativeRandom = Math.random;
 
   /**
    * The base implementation of `_.random` without support for argument juggling
@@ -16,7 +14,7 @@ define([], function() {
    * @returns {number} Returns the random number.
    */
   function baseRandom(min, max) {
-    return min + floor(nativeRandom() * (max - min + 1));
+    return min + nativeFloor(nativeRandom() * (max - min + 1));
   }
 
   return baseRandom;

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
@@ -9,9 +9,6 @@ define([], function() {
    * @returns {string} Returns the string.
    */
   function baseToString(value) {
-    if (typeof value == 'string') {
-      return value;
-    }
     return value == null ? '' : (value + '');
   }
 

internal/baseUniq.js

@@ -1,5 +1,8 @@
 define(['./baseIndexOf', './cacheIndexOf', './createCache'], function(baseIndexOf, cacheIndexOf, createCache) {
 
+  /** Used as the size to enable large array optimizations. */
+  var LARGE_ARRAY_SIZE = 200;
+
   /**
    * The base implementation of `_.uniq` without support for callback shorthands
    * and `this` binding.
@@ -7,14 +10,14 @@ define(['./baseIndexOf', './cacheIndexOf', './createCache'], function(baseIndexO
    * @private
    * @param {Array} array The array to inspect.
    * @param {Function} [iteratee] The function invoked per iteration.
-   * @returns {Array} Returns the new duplicate-value-free array.
+   * @returns {Array} Returns the new duplicate free array.
    */
   function baseUniq(array, iteratee) {
     var index = -1,
         indexOf = baseIndexOf,
         length = array.length,
         isCommon = true,
-        isLarge = isCommon && length >= 200,
+        isLarge = isCommon && length >= LARGE_ARRAY_SIZE,
         seen = isLarge ? createCache() : null,
         result = [];
 

internal/baseWrapperValue.js

@@ -1,10 +1,4 @@
-define(['./LazyWrapper'], function(LazyWrapper) {
-
-  /** Used for native method references. */
-  var arrayProto = Array.prototype;
-
-  /** Native method references. */
-  var push = arrayProto.push;
+define(['./LazyWrapper', './arrayPush'], function(LazyWrapper, arrayPush) {
 
   /**
    * The base implementation of `wrapperValue` which returns the result of
@@ -25,11 +19,8 @@ define(['./LazyWrapper'], function(LazyWrapper) {
         length = actions.length;
 
     while (++index < length) {
-      var args = [result],
-          action = actions[index];
-
-      push.apply(args, action.args);
-      result = action.func.apply(action.thisArg, args);
+      var action = actions[index];
+      result = action.func.apply(action.thisArg, arrayPush([result], action.args));
     }
     return result;
   }

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

@@ -3,15 +3,13 @@ define([], function() {
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;
 
-  /** Native method references. */
-  var floor = Math.floor;
-
   /* Native method references for those with the same name as other `lodash` methods. */
-  var nativeMin = Math.min;
+  var nativeFloor = Math.floor,
+      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 +30,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),
+      var mid = nativeFloor((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,25 +1,8 @@
-define(['../utility/constant', '../lang/isNative', './root'], function(constant, isNative, root) {
+define(['./root'], function(root) {
 
   /** Native method references. */
-  var ArrayBuffer = isNative(ArrayBuffer = root.ArrayBuffer) && ArrayBuffer,
-      bufferSlice = isNative(bufferSlice = ArrayBuffer && new ArrayBuffer(0).slice) && bufferSlice,
-      floor = Math.floor,
-      Uint8Array = isNative(Uint8Array = root.Uint8Array) && Uint8Array;
-
-  /** Used to clone array buffers. */
-  var Float64Array = (function() {
-    // Safari 5 errors when using an array buffer to initialize a typed array
-    // 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,
-          result = new func(new ArrayBuffer(10), 0, 1) && func;
-    } catch(e) {}
-    return result;
-  }());
-
-  /** Used as the size, in bytes, of each `Float64Array` element. */
-  var FLOAT64_BYTES_PER_ELEMENT = Float64Array ? Float64Array.BYTES_PER_ELEMENT : 0;
+  var ArrayBuffer = root.ArrayBuffer,
+      Uint8Array = root.Uint8Array;
 
   /**
    * Creates a clone of the given array buffer.
@@ -29,26 +12,11 @@ define(['../utility/constant', '../lang/isNative', './root'], function(constant,
    * @returns {ArrayBuffer} Returns the cloned array buffer.
    */
   function bufferClone(buffer) {
-    return bufferSlice.call(buffer, 0);
-  }
-  if (!bufferSlice) {
-    // PhantomJS has `ArrayBuffer` and `Uint8Array` but not `Float64Array`.
-    bufferClone = !(ArrayBuffer && Uint8Array) ? constant(null) : function(buffer) {
-      var byteLength = buffer.byteLength,
-          floatLength = Float64Array ? floor(byteLength / FLOAT64_BYTES_PER_ELEMENT) : 0,
-          offset = floatLength * FLOAT64_BYTES_PER_ELEMENT,
-          result = new ArrayBuffer(byteLength);
+    var result = new ArrayBuffer(buffer.byteLength),
+        view = new Uint8Array(result);
 
-      if (floatLength) {
-        var view = new Float64Array(result, 0, floatLength);
-        view.set(new Float64Array(buffer, 0, floatLength));
-      }
-      if (byteLength != offset) {
-        view = new Uint8Array(result, offset);
-        view.set(new Uint8Array(buffer, offset));
-      }
-      return result;
-    };
+    view.set(new Uint8Array(buffer));
+    return result;
   }
 
   return bufferClone;

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/compareAscending.js

@@ -5,8 +5,8 @@ define(['./baseCompareAscending'], function(baseCompareAscending) {
    * sort them in ascending order.
    *
    * @private
-   * @param {Object} object The object to compare to `other`.
-   * @param {Object} other The object to compare to `object`.
+   * @param {Object} object The object to compare.
+   * @param {Object} other The other object to compare.
    * @returns {number} Returns the sort order indicator for `object`.
    */
   function compareAscending(object, other) {

internal/compareMultiple.js

@@ -1,16 +1,16 @@
 define(['./baseCompareAscending'], function(baseCompareAscending) {
 
   /**
-   * Used by `_.sortByOrder` to compare multiple properties of each element
-   * in a collection and stable sort them in the following order:
+   * Used by `_.sortByOrder` to compare multiple properties of a value to another
+   * and stable sort them.
    *
-   * If `orders` is unspecified, sort in ascending order for all properties.
-   * Otherwise, for each property, sort in ascending order if its corresponding value in
-   * orders is true, and descending order if false.
+   * If `orders` is unspecified, all valuess are sorted in ascending order. Otherwise,
+   * a value is sorted in ascending order if its corresponding order is "asc", and
+   * descending if "desc".
    *
    * @private
-   * @param {Object} object The object to compare to `other`.
-   * @param {Object} other The object to compare to `object`.
+   * @param {Object} object The object to compare.
+   * @param {Object} other The other object to compare.
    * @param {boolean[]} orders The order to sort by for each property.
    * @returns {number} Returns the sort order indicator for `object`.
    */
@@ -27,7 +27,8 @@ define(['./baseCompareAscending'], function(baseCompareAscending) {
         if (index >= ordersLength) {
           return result;
         }
-        return result * (orders[index] ? 1 : -1);
+        var order = orders[index];
+        return result * ((order === 'asc' || order === true) ? 1 : -1);
       }
     }
     // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications

internal/composeArgs.js

@@ -19,7 +19,7 @@ define([], function() {
         argsLength = nativeMax(args.length - holdersLength, 0),
         leftIndex = -1,
         leftLength = partials.length,
-        result = Array(argsLength + leftLength);
+        result = Array(leftLength + argsLength);
 
     while (++leftIndex < leftLength) {
       result[leftIndex] = partials[leftIndex];

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/createAggregator.js

@@ -1,12 +1,7 @@
 define(['./baseCallback', './baseEach', '../lang/isArray'], function(baseCallback, baseEach, isArray) {
 
   /**
-   * Creates a function that aggregates a collection, creating an accumulator
-   * object composed from the results of running each element in the collection
-   * through an iteratee.
-   *
-   * **Note:** This function is used to create `_.countBy`, `_.groupBy`, `_.indexBy`,
-   * and `_.partition`.
+   * Creates a `_.countBy`, `_.groupBy`, `_.indexBy`, or `_.partition` function.
    *
    * @private
    * @param {Function} setter The function to set keys and values of the accumulator object.

internal/createAssigner.js

@@ -1,10 +1,10 @@
 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.
-   *
-   * **Note:** This function is used to create `_.assign`, `_.defaults`, and `_.merge`.
+   * Creates a `_.assign`, `_.defaults`, or `_.merge` function.
    *
    * @private
    * @param {Function} assigner The function to assign values.
@@ -14,19 +14,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', './getNative', './root'], function(SetCache, 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.
@@ -13,9 +13,9 @@ define(['./SetCache', '../utility/constant', '../lang/isNative', './root'], func
    * @param {Array} [values] The values to cache.
    * @returns {null|Object} Returns the new cache object if `Set` is supported, else `null`.
    */
-  var createCache = !(nativeCreate && Set) ? constant(null) : function(values) {
-    return new SetCache(values);
-  };
+  function createCache(values) {
+    return (nativeCreate && Set) ? new SetCache(values) : null;
+  }
 
   return createCache;
 });

internal/createCtorWrapper.js

@@ -10,8 +10,22 @@ define(['./baseCreate', '../lang/isObject'], function(baseCreate, isObject) {
    */
   function createCtorWrapper(Ctor) {
     return function() {
+      // Use a `switch` statement to work with class constructors.
+      // See http://ecma-international.org/ecma-262/6.0/#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]);
+        case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);
+        case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);
+      }
       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/createCurry.js

@@ -1,5 +1,8 @@
 define(['./createWrapper', './isIterateeCall'], function(createWrapper, isIterateeCall) {
 
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
+
   /**
    * Creates a `_.curry` or `_.curryRight` function.
    *
@@ -10,9 +13,9 @@ define(['./createWrapper', './isIterateeCall'], function(createWrapper, isIterat
   function createCurry(flag) {
     function curryFunc(func, arity, guard) {
       if (guard && isIterateeCall(func, arity, guard)) {
-        arity = null;
+        arity = undefined;
       }
-      var result = createWrapper(func, flag, null, null, null, null, null, arity);
+      var result = createWrapper(func, flag, undefined, undefined, undefined, undefined, undefined, arity);
       result.placeholder = curryFunc.placeholder;
       return result;
     }

internal/createDefaults.js

@@ -0,0 +1,26 @@
+define(['../function/restParam'], function(restParam) {
+
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
+
+  /**
+   * Creates a `_.defaults` or `_.defaultsDeep` function.
+   *
+   * @private
+   * @param {Function} assigner The function to assign values.
+   * @param {Function} customizer The function to customize assigned values.
+   * @returns {Function} Returns the new defaults function.
+   */
+  function createDefaults(assigner, customizer) {
+    return restParam(function(args) {
+      var object = args[0];
+      if (object == null) {
+        return object;
+      }
+      args.push(customizer);
+      return assigner.apply(undefined, args);
+    });
+  }
+
+  return createDefaults;
+});

internal/createExtremum.js

@@ -1,31 +1,30 @@
-define(['./baseCallback', './charAtCallback', './extremumBy', '../lang/isArray', './isIterateeCall', '../lang/isString', './toIterable'], function(baseCallback, charAtCallback, extremumBy, isArray, isIterateeCall, isString, toIterable) {
+define(['./arrayExtremum', './baseCallback', './baseExtremum', '../lang/isArray', './isIterateeCall', './toIterable'], function(arrayExtremum, baseCallback, baseExtremum, isArray, isIterateeCall, toIterable) {
+
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
 
   /**
    * 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;
+        iteratee = undefined;
       }
-      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 = isArray(collection) ? 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;