Bump to v3.6.0.

LICENSE.txt

@@ -1,5 +1,5 @@
 Copyright 2012-2015 The Dojo Foundation <http://dojofoundation.org/>
-Based on Underscore.js 1.7.0, copyright 2009-2015 Jeremy Ashkenas,
+Based on Underscore.js, copyright 2009-2015 Jeremy Ashkenas,
 DocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>
 
 Permission is hereby granted, free of charge, to any person obtaining

README.md

@@ -1,4 +1,4 @@
-# lodash v3.3.0
+# lodash v3.6.0
 
 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.
 

array/difference.js

@@ -1,13 +1,12 @@
-define(['../internal/baseDifference', '../internal/baseFlatten', '../lang/isArguments', '../lang/isArray'], function(baseDifference, baseFlatten, isArguments, isArray) {
+define(['../internal/baseDifference', '../internal/baseFlatten', '../lang/isArguments', '../lang/isArray', '../function/restParam'], function(baseDifference, baseFlatten, isArguments, isArray, restParam) {
 
   /**
    * Creates an array excluding all values of the provided arrays using
    * `SameValueZero` for equality comparisons.
    *
-   * **Note:** `SameValueZero` comparisons are like strict equality comparisons,
-   * e.g. `===`, except that `NaN` matches `NaN`. See the
-   * [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
-   * for more details.
+   * **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 _
@@ -20,18 +19,11 @@ define(['../internal/baseDifference', '../internal/baseFlatten', '../lang/isArgu
    * _.difference([1, 2, 3], [4, 2]);
    * // => [1, 3]
    */
-  function difference() {
-    var index = -1,
-        length = arguments.length;
-
-    while (++index < length) {
-      var value = arguments[index];
-      if (isArray(value) || isArguments(value)) {
-        break;
-      }
-    }
-    return baseDifference(value, baseFlatten(arguments, false, true, ++index));
-  }
+  var difference = restParam(function(array, values) {
+    return (isArray(array) || isArguments(array))
+      ? baseDifference(array, baseFlatten(values, false, true))
+      : [];
+  });
 
   return difference;
 });

array/dropRightWhile.js

@@ -1,9 +1,9 @@
-define(['../internal/baseCallback', '../internal/baseSlice'], function(baseCallback, baseSlice) {
+define(['../internal/baseCallback', '../internal/baseWhile'], function(baseCallback, baseWhile) {
 
   /**
    * Creates a slice of `array` excluding elements dropped from the end.
    * Elements are dropped until `predicate` returns falsey. The predicate is
-   * bound to `thisArg` and invoked with three arguments; (value, index, array).
+   * bound to `thisArg` and invoked with three arguments: (value, index, array).
    *
    * If a property name is provided for `predicate` the created `_.property`
    * style callback returns the property value of the given element.
@@ -38,7 +38,7 @@ define(['../internal/baseCallback', '../internal/baseSlice'], function(baseCallb
    * ];
    *
    * // using the `_.matches` callback shorthand
-   * _.pluck(_.dropRightWhile(users, { 'user': pebbles, 'active': false }), 'user');
+   * _.pluck(_.dropRightWhile(users, { 'user': 'pebbles', 'active': false }), 'user');
    * // => ['barney', 'fred']
    *
    * // using the `_.matchesProperty` callback shorthand
@@ -50,13 +50,9 @@ define(['../internal/baseCallback', '../internal/baseSlice'], function(baseCallb
    * // => ['barney', 'fred', 'pebbles']
    */
   function dropRightWhile(array, predicate, thisArg) {
-    var length = array ? array.length : 0;
-    if (!length) {
-      return [];
-    }
-    predicate = baseCallback(predicate, thisArg, 3);
-    while (length-- && predicate(array[length], length, array)) {}
-    return baseSlice(array, 0, length + 1);
+    return (array && array.length)
+      ? baseWhile(array, baseCallback(predicate, thisArg, 3), true, true)
+      : [];
   }
 
   return dropRightWhile;

array/dropWhile.js

@@ -1,9 +1,9 @@
-define(['../internal/baseCallback', '../internal/baseSlice'], function(baseCallback, baseSlice) {
+define(['../internal/baseCallback', '../internal/baseWhile'], function(baseCallback, baseWhile) {
 
   /**
    * Creates a slice of `array` excluding elements dropped from the beginning.
    * Elements are dropped until `predicate` returns falsey. The predicate is
-   * bound to `thisArg` and invoked with three arguments; (value, index, array).
+   * bound to `thisArg` and invoked with three arguments: (value, index, array).
    *
    * If a property name is provided for `predicate` the created `_.property`
    * style callback returns the property value of the given element.
@@ -50,14 +50,9 @@ define(['../internal/baseCallback', '../internal/baseSlice'], function(baseCallb
    * // => ['barney', 'fred', 'pebbles']
    */
   function dropWhile(array, predicate, thisArg) {
-    var length = array ? array.length : 0;
-    if (!length) {
-      return [];
-    }
-    var index = -1;
-    predicate = baseCallback(predicate, thisArg, 3);
-    while (++index < length && predicate(array[index], index, array)) {}
-    return baseSlice(array, index);
+    return (array && array.length)
+      ? baseWhile(array, baseCallback(predicate, thisArg, 3), true)
+      : [];
   }
 
   return dropWhile;

array/fill.js

@@ -14,6 +14,19 @@ define(['../internal/baseFill', '../internal/isIterateeCall'], function(baseFill
    * @param {number} [start=0] The start position.
    * @param {number} [end=array.length] The end position.
    * @returns {Array} Returns `array`.
+   * @example
+   *
+   * var array = [1, 2, 3];
+   *
+   * _.fill(array, 'a');
+   * console.log(array);
+   * // => ['a', 'a', 'a']
+   *
+   * _.fill(Array(3), 2);
+   * // => [2, 2, 2]
+   *
+   * _.fill([4, 6, 8], '*', 1, 2);
+   * // => [4, '*', 8]
    */
   function fill(array, value, start, end) {
     var length = array ? array.length : 0;

array/findIndex.js

@@ -1,8 +1,8 @@
-define(['../internal/baseCallback'], function(baseCallback) {
+define(['../internal/createFindIndex'], function(createFindIndex) {
 
   /**
    * This method is like `_.find` except that it returns the index of the first
-   * element `predicate` returns truthy for, instead of the element itself.
+   * element `predicate` returns truthy for instead of the element itself.
    *
    * If a property name is provided for `predicate` the created `_.property`
    * style callback returns the property value of the given element.
@@ -48,18 +48,7 @@ define(['../internal/baseCallback'], function(baseCallback) {
    * _.findIndex(users, 'active');
    * // => 2
    */
-  function findIndex(array, predicate, thisArg) {
-    var index = -1,
-        length = array ? array.length : 0;
-
-    predicate = baseCallback(predicate, thisArg, 3);
-    while (++index < length) {
-      if (predicate(array[index], index, array)) {
-        return index;
-      }
-    }
-    return -1;
-  }
+  var findIndex = createFindIndex();
 
   return findIndex;
 });

array/findLastIndex.js

@@ -1,4 +1,4 @@
-define(['../internal/baseCallback'], function(baseCallback) {
+define(['../internal/createFindIndex'], function(createFindIndex) {
 
   /**
    * This method is like `_.findIndex` except that it iterates over elements
@@ -37,27 +37,18 @@ define(['../internal/baseCallback'], function(baseCallback) {
    * // => 2
    *
    * // using the `_.matches` callback shorthand
-   * _.findLastIndex(users, { user': 'barney', 'active': true });
+   * _.findLastIndex(users, { 'user': 'barney', 'active': true });
    * // => 0
    *
    * // using the `_.matchesProperty` callback shorthand
    * _.findLastIndex(users, 'active', false);
-   * // => 1
+   * // => 2
    *
    * // using the `_.property` callback shorthand
    * _.findLastIndex(users, 'active');
    * // => 0
    */
-  function findLastIndex(array, predicate, thisArg) {
-    var length = array ? array.length : 0;
-    predicate = baseCallback(predicate, thisArg, 3);
-    while (length--) {
-      if (predicate(array[length], length, array)) {
-        return length;
-      }
-    }
-    return -1;
-  }
+  var findLastIndex = createFindIndex(true);
 
   return findLastIndex;
 });

array/flatten.js

@@ -14,11 +14,11 @@ define(['../internal/baseFlatten', '../internal/isIterateeCall'], function(baseF
    * @example
    *
    * _.flatten([1, [2, 3, [4]]]);
-   * // => [1, 2, 3, [4]];
+   * // => [1, 2, 3, [4]]
    *
    * // using `isDeep`
    * _.flatten([1, [2, 3, [4]]], true);
-   * // => [1, 2, 3, 4];
+   * // => [1, 2, 3, 4]
    */
   function flatten(array, isDeep, guard) {
     var length = array ? array.length : 0;

array/flattenDeep.js

@@ -11,7 +11,7 @@ define(['../internal/baseFlatten'], function(baseFlatten) {
    * @example
    *
    * _.flattenDeep([1, [2, 3, [4]]]);
-   * // => [1, 2, 3, 4];
+   * // => [1, 2, 3, 4]
    */
   function flattenDeep(array) {
     var length = array ? array.length : 0;

array/indexOf.js

@@ -9,10 +9,9 @@ define(['../internal/baseIndexOf', '../internal/binaryIndex'], function(baseInde
    * 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` comparisons are like strict equality comparisons,
-   * e.g. `===`, except that `NaN` matches `NaN`. See the
-   * [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
-   * for more details.
+   * **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 _
@@ -25,7 +24,7 @@ define(['../internal/baseIndexOf', '../internal/binaryIndex'], function(baseInde
    * @example
    *
    * _.indexOf([1, 2, 1, 2], 2);
-   * // => 2
+   * // => 1
    *
    * // using `fromIndex`
    * _.indexOf([1, 2, 1, 2], 2, 2);
@@ -41,14 +40,17 @@ define(['../internal/baseIndexOf', '../internal/binaryIndex'], function(baseInde
       return -1;
     }
     if (typeof fromIndex == 'number') {
-      fromIndex = fromIndex < 0 ? nativeMax(length + fromIndex, 0) : (fromIndex || 0);
+      fromIndex = fromIndex < 0 ? nativeMax(length + fromIndex, 0) : fromIndex;
     } else if (fromIndex) {
       var index = binaryIndex(array, value),
           other = array[index];
 
-      return (value === value ? value === other : other !== other) ? index : -1;
+      if (value === value ? (value === other) : (other !== other)) {
+        return index;
+      }
+      return -1;
     }
-    return baseIndexOf(array, value, fromIndex);
+    return baseIndexOf(array, value, fromIndex || 0);
   }
 
   return indexOf;

array/intersection.js

@@ -4,10 +4,9 @@ define(['../internal/baseIndexOf', '../internal/cacheIndexOf', '../internal/crea
    * Creates an array of unique values in all provided arrays using `SameValueZero`
    * for equality comparisons.
    *
-   * **Note:** `SameValueZero` comparisons are like strict equality comparisons,
-   * e.g. `===`, except that `NaN` matches `NaN`. See the
-   * [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
-   * for more details.
+   * **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 _
@@ -30,7 +29,7 @@ define(['../internal/baseIndexOf', '../internal/cacheIndexOf', '../internal/crea
       var value = arguments[argsIndex];
       if (isArray(value) || isArguments(value)) {
         args.push(value);
-        caches.push(isCommon && value.length >= 120 && createCache(argsIndex && value));
+        caches.push((isCommon && value.length >= 120) ? createCache(argsIndex && value) : null);
       }
     }
     argsLength = args.length;
@@ -43,11 +42,11 @@ define(['../internal/baseIndexOf', '../internal/cacheIndexOf', '../internal/crea
     outer:
     while (++index < length) {
       value = array[index];
-      if ((seen ? cacheIndexOf(seen, value) : indexOf(result, value)) < 0) {
+      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) {
+          if ((cache ? cacheIndexOf(cache, value) : indexOf(args[argsIndex], value, 0)) < 0) {
             continue outer;
           }
         }

array/lastIndexOf.js

@@ -40,7 +40,10 @@ define(['../internal/binaryIndex', '../internal/indexOfNaN'], function(binaryInd
     } else if (fromIndex) {
       index = binaryIndex(array, value, true) - 1;
       var other = array[index];
-      return (value === value ? value === other : other !== other) ? index : -1;
+      if (value === value ? (value === other) : (other !== other)) {
+        return index;
+      }
+      return -1;
     }
     if (value !== value) {
       return indexOfNaN(array, index, true);

array/pull.js

@@ -11,10 +11,10 @@ define(['../internal/baseIndexOf'], function(baseIndexOf) {
    * comparisons.
    *
    * **Notes:**
-   *  - Unlike `_.without`, this method mutates `array`.
-   *  - `SameValueZero` comparisons are like strict equality comparisons, e.g. `===`,
-   *    except that `NaN` matches `NaN`. See the [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
-   *    for more details.
+   *  - 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`
    *
    * @static
    * @memberOf _
@@ -31,17 +31,19 @@ define(['../internal/baseIndexOf'], function(baseIndexOf) {
    * // => [1, 1]
    */
   function pull() {
-    var array = arguments[0];
+    var args = arguments,
+        array = args[0];
+
     if (!(array && array.length)) {
       return array;
     }
     var index = 0,
         indexOf = baseIndexOf,
-        length = arguments.length;
+        length = args.length;
 
     while (++index < length) {
       var fromIndex = 0,
-          value = arguments[index];
+          value = args[index];
 
       while ((fromIndex = indexOf(array, value, fromIndex)) > -1) {
         splice.call(array, fromIndex, 1);

array/pullAt.js

@@ -1,4 +1,10 @@
-define(['../internal/baseFlatten', '../internal/basePullAt'], function(baseFlatten, basePullAt) {
+define(['../internal/baseAt', '../internal/baseCompareAscending', '../internal/baseFlatten', '../internal/isIndex', '../function/restParam'], function(baseAt, baseCompareAscending, baseFlatten, isIndex, restParam) {
+
+  /** Used for native method references. */
+  var arrayProto = Array.prototype;
+
+  /** Native method references. */
+  var splice = arrayProto.splice;
 
   /**
    * Removes elements from `array` corresponding to the given indexes and returns
@@ -25,9 +31,23 @@ define(['../internal/baseFlatten', '../internal/basePullAt'], function(baseFlatt
    * console.log(evens);
    * // => [10, 20]
    */
-  function pullAt(array) {
-    return basePullAt(array || [], baseFlatten(arguments, false, false, 1));
-  }
+  var pullAt = restParam(function(array, indexes) {
+    array || (array = []);
+    indexes = baseFlatten(indexes);
+
+    var length = indexes.length,
+        result = baseAt(array, indexes);
+
+    indexes.sort(baseCompareAscending);
+    while (length--) {
+      var index = parseFloat(indexes[length]);
+      if (index != previous && isIndex(index)) {
+        var previous = index;
+        splice.call(array, index, 1);
+      }
+    }
+    return result;
+  });
 
   return pullAt;
 });

array/remove.js

@@ -9,7 +9,7 @@ define(['../internal/baseCallback'], function(baseCallback) {
   /**
    * Removes all elements from `array` that `predicate` returns truthy for
    * and returns an array of the removed elements. The predicate is bound to
-   * `thisArg` and invoked with three arguments; (value, index, array).
+   * `thisArg` and invoked with three arguments: (value, index, array).
    *
    * If a property name is provided for `predicate` the created `_.property`
    * style callback returns the property value of the given element.

array/sortedIndex.js

@@ -1,4 +1,4 @@
-define(['../internal/baseCallback', '../internal/binaryIndex', '../internal/binaryIndexBy'], function(baseCallback, binaryIndex, binaryIndexBy) {
+define(['../internal/createSortedIndex'], function(createSortedIndex) {
 
   /**
    * Uses a binary search to determine the lowest index at which `value` should
@@ -7,14 +7,14 @@ define(['../internal/baseCallback', '../internal/binaryIndex', '../internal/bina
    * to compute their sort ranking. The iteratee is bound to `thisArg` and
    * invoked with one argument; (value).
    *
-   * If a property name is provided for `predicate` the created `_.property`
+   * If a property name is provided for `iteratee` 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
+   * If an object is provided for `iteratee` the created `_.matches` style
    * callback returns `true` for elements that have the properties of the given
    * object, else `false`.
    *
@@ -48,11 +48,7 @@ define(['../internal/baseCallback', '../internal/binaryIndex', '../internal/bina
    * _.sortedIndex([{ 'x': 30 }, { 'x': 50 }], { 'x': 40 }, 'x');
    * // => 1
    */
-  function sortedIndex(array, value, iteratee, thisArg) {
-    return iteratee == null
-      ? binaryIndex(array, value)
-      : binaryIndexBy(array, value, baseCallback(iteratee, thisArg, 1));
-  }
+  var sortedIndex = createSortedIndex();
 
   return sortedIndex;
 });

array/sortedLastIndex.js

@@ -1,4 +1,4 @@
-define(['../internal/baseCallback', '../internal/binaryIndex', '../internal/binaryIndexBy'], function(baseCallback, binaryIndex, binaryIndexBy) {
+define(['../internal/createSortedIndex'], function(createSortedIndex) {
 
   /**
    * This method is like `_.sortedIndex` except that it returns the highest
@@ -20,11 +20,7 @@ define(['../internal/baseCallback', '../internal/binaryIndex', '../internal/bina
    * _.sortedLastIndex([4, 4, 5, 5], 5);
    * // => 4
    */
-  function sortedLastIndex(array, value, iteratee, thisArg) {
-    return iteratee == null
-      ? binaryIndex(array, value, true)
-      : binaryIndexBy(array, value, baseCallback(iteratee, thisArg, 1), true);
-  }
+  var sortedLastIndex = createSortedIndex(true);
 
   return sortedLastIndex;
 });

array/takeRightWhile.js

@@ -1,9 +1,9 @@
-define(['../internal/baseCallback', '../internal/baseSlice'], function(baseCallback, baseSlice) {
+define(['../internal/baseCallback', '../internal/baseWhile'], function(baseCallback, baseWhile) {
 
   /**
    * Creates a slice of `array` with elements taken from the end. Elements are
    * taken until `predicate` returns falsey. The predicate is bound to `thisArg`
-   * and invoked with three arguments; (value, index, array).
+   * and invoked with three arguments: (value, index, array).
    *
    * If a property name is provided for `predicate` the created `_.property`
    * style callback returns the property value of the given element.
@@ -50,13 +50,9 @@ define(['../internal/baseCallback', '../internal/baseSlice'], function(baseCallb
    * // => []
    */
   function takeRightWhile(array, predicate, thisArg) {
-    var length = array ? array.length : 0;
-    if (!length) {
-      return [];
-    }
-    predicate = baseCallback(predicate, thisArg, 3);
-    while (length-- && predicate(array[length], length, array)) {}
-    return baseSlice(array, length + 1);
+    return (array && array.length)
+      ? baseWhile(array, baseCallback(predicate, thisArg, 3), false, true)
+      : [];
   }
 
   return takeRightWhile;

array/takeWhile.js

@@ -1,9 +1,9 @@
-define(['../internal/baseCallback', '../internal/baseSlice'], function(baseCallback, baseSlice) {
+define(['../internal/baseCallback', '../internal/baseWhile'], function(baseCallback, baseWhile) {
 
   /**
    * Creates a slice of `array` with elements taken from the beginning. Elements
    * are taken until `predicate` returns falsey. The predicate is bound to
-   * `thisArg` and invoked with three arguments; (value, index, array).
+   * `thisArg` and invoked with three arguments: (value, index, array).
    *
    * If a property name is provided for `predicate` the created `_.property`
    * style callback returns the property value of the given element.
@@ -50,14 +50,9 @@ define(['../internal/baseCallback', '../internal/baseSlice'], function(baseCallb
    * // => []
    */
   function takeWhile(array, predicate, thisArg) {
-    var length = array ? array.length : 0;
-    if (!length) {
-      return [];
-    }
-    var index = -1;
-    predicate = baseCallback(predicate, thisArg, 3);
-    while (++index < length && predicate(array[index], index, array)) {}
-    return baseSlice(array, 0, index);
+    return (array && array.length)
+      ? baseWhile(array, baseCallback(predicate, thisArg, 3))
+      : [];
   }
 
   return takeWhile;

array/union.js

@@ -1,13 +1,12 @@
-define(['../internal/baseFlatten', '../internal/baseUniq'], function(baseFlatten, baseUniq) {
+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` comparisons are like strict equality comparisons,
-   * e.g. `===`, except that `NaN` matches `NaN`. See the
-   * [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
-   * for more details.
+   * **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 _
@@ -19,9 +18,9 @@ define(['../internal/baseFlatten', '../internal/baseUniq'], function(baseFlatten
    * _.union([1, 2], [4, 2], [2, 1]);
    * // => [1, 2, 4]
    */
-  function union() {
-    return baseUniq(baseFlatten(arguments, false, true));
-  }
+  var union = restParam(function(arrays) {
+    return baseUniq(baseFlatten(arrays, false, true));
+  });
 
   return union;
 });

array/uniq.js

@@ -6,23 +6,22 @@ define(['../internal/baseCallback', '../internal/baseUniq', '../internal/isItera
    * search algorithm for sorted arrays. If an iteratee function is provided it
    * is invoked for each value 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).
+   * with three arguments: (value, index, array).
    *
-   * If a property name is provided for `predicate` the created `_.property`
+   * If a property name is provided for `iteratee` 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
+   * If an object is provided for `iteratee` the created `_.matches` style
    * callback returns `true` for elements that have the properties of the given
    * object, else `false`.
    *
-   * **Note:** `SameValueZero` comparisons are like strict equality comparisons,
-   * e.g. `===`, except that `NaN` matches `NaN`. See the
-   * [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
-   * for more details.
+   * **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 _

array/without.js

@@ -1,13 +1,12 @@
-define(['../internal/baseDifference', '../internal/baseSlice'], function(baseDifference, baseSlice) {
+define(['../internal/baseDifference', '../lang/isArguments', '../lang/isArray', '../function/restParam'], function(baseDifference, isArguments, isArray, restParam) {
 
   /**
    * Creates an array excluding all provided values using `SameValueZero` for
    * equality comparisons.
    *
-   * **Note:** `SameValueZero` comparisons are like strict equality comparisons,
-   * e.g. `===`, except that `NaN` matches `NaN`. See the
-   * [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
-   * for more details.
+   * **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 _
@@ -20,9 +19,11 @@ define(['../internal/baseDifference', '../internal/baseSlice'], function(baseDif
    * _.without([1, 2, 1, 3], 1, 2);
    * // => [3]
    */
-  function without(array) {
-    return baseDifference(array, baseSlice(arguments, 1));
-  }
+  var without = restParam(function(array, values) {
+    return (isArray(array) || isArguments(array))
+      ? baseDifference(array, values)
+      : [];
+  });
 
   return without;
 });

array/xor.js

@@ -1,9 +1,8 @@
 define(['../internal/baseDifference', '../internal/baseUniq', '../lang/isArguments', '../lang/isArray'], function(baseDifference, baseUniq, isArguments, isArray) {
 
   /**
-   * Creates an array that is the symmetric difference of the provided arrays.
-   * See [Wikipedia](https://en.wikipedia.org/wiki/Symmetric_difference) for
-   * more details.
+   * Creates an array that is the [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)
+   * of the provided arrays.
    *
    * @static
    * @memberOf _

array/zip.js

@@ -1,4 +1,4 @@
-define(['./unzip'], function(unzip) {
+define(['../function/restParam', './unzip'], function(restParam, unzip) {
 
   /**
    * Creates an array of grouped elements, the first of which contains the first
@@ -15,15 +15,7 @@ define(['./unzip'], function(unzip) {
    * _.zip(['fred', 'barney'], [30, 40], [true, false]);
    * // => [['fred', 30, true], ['barney', 40, false]]
    */
-  function zip() {
-    var length = arguments.length,
-        array = Array(length);
-
-    while (length--) {
-      array[length] = arguments[length];
-    }
-    return unzip(array);
-  }
+  var zip = restParam(unzip);
 
   return zip;
 });

array/zipObject.js

@@ -1,9 +1,10 @@
 define(['../lang/isArray'], function(isArray) {
 
   /**
-   * Creates an object composed from arrays of property names and values. Provide
-   * either a single two dimensional array, e.g. `[[key1, value1], [key2, value2]]`
-   * or two arrays, one of property names and one of corresponding values.
+   * The inverse of `_.pairs`; this method returns an object composed from arrays
+   * of property names and values. Provide either a single two dimensional array,
+   * e.g. `[[key1, value1], [key2, value2]]` or two arrays, one of property names
+   * and one of corresponding values.
    *
    * @static
    * @memberOf _
@@ -14,6 +15,9 @@ define(['../lang/isArray'], function(isArray) {
    * @returns {Object} Returns the new object.
    * @example
    *
+   * _.zipObject([['fred', 30], ['barney', 40]]);
+   * // => { 'fred': 30, 'barney': 40 }
+   *
    * _.zipObject(['fred', 'barney'], [30, 40]);
    * // => { 'fred': 30, 'barney': 40 }
    */

chain/lodash.js

@@ -22,9 +22,14 @@ define(['../internal/LazyWrapper', '../internal/LodashWrapper', '../internal/bas
    * Chaining is supported in custom builds as long as the `_#value` method is
    * directly or indirectly included in the build.
    *
-   * In addition to lodash methods, wrappers also have the following `Array` methods:
-   * `concat`, `join`, `pop`, `push`, `reverse`, `shift`, `slice`, `sort`, `splice`,
-   * and `unshift`
+   * In addition to lodash methods, wrappers have `Array` and `String` methods.
+   *
+   * The wrapper `Array` methods are:
+   * `concat`, `join`, `pop`, `push`, `reverse`, `shift`, `slice`, `sort`,
+   * `splice`, and `unshift`
+   *
+   * The wrapper `String` methods are:
+   * `replace` and `split`
    *
    * The wrapper methods that support shortcut fusion are:
    * `compact`, `drop`, `dropRight`, `dropRightWhile`, `dropWhile`, `filter`,
@@ -44,26 +49,26 @@ define(['../internal/LazyWrapper', '../internal/LodashWrapper', '../internal/bas
    * `mixin`, `negate`, `noop`, `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`, `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`
+   * `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`
    *
    * The wrapper methods that are **not** chainable by default are:
-   * `attempt`, `camelCase`, `capitalize`, `clone`, `cloneDeep`, `deburr`,
+   * `add`, `attempt`, `camelCase`, `capitalize`, `clone`, `cloneDeep`, `deburr`,
    * `endsWith`, `escape`, `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`,
    * `findLast`, `findLastIndex`, `findLastKey`, `findWhere`, `first`, `has`,
-   * `identity`, `includes`, `indexOf`, `isArguments`, `isArray`, `isBoolean`,
-   * `isDate`, `isElement`, `isEmpty`, `isEqual`, `isError`, `isFinite`,
-   * `isFunction`, `isMatch`, `isNative`, `isNaN`, `isNull`, `isNumber`,
+   * `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`, `now`, `pad`, `padLeft`, `padRight`, `parseInt`, `pop`,
    * `random`, `reduce`, `reduceRight`, `repeat`, `result`, `runInContext`,
    * `shift`, `size`, `snakeCase`, `some`, `sortedIndex`, `sortedLastIndex`,
-   * `startCase`, `startsWith`, `template`, `trim`, `trimLeft`, `trimRight`,
-   * `trunc`, `unescape`, `uniqueId`, `value`, and `words`
+   * `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/thru.js

@@ -12,13 +12,14 @@ define([], function() {
    * @returns {*} Returns the result of `interceptor`.
    * @example
    *
-   * _([1, 2, 3])
-   *  .last()
+   * _('  abc  ')
+   *  .chain()
+   *  .trim()
    *  .thru(function(value) {
    *    return [value];
    *  })
    *  .value();
-   * // => [3]
+   * // => ['abc']
    */
   function thru(value, interceptor, thisArg) {
     return interceptor.call(thisArg, value);

collection.js

@@ -1,4 +1,4 @@
-define(['./collection/all', './collection/any', './collection/at', './collection/collect', './collection/contains', './collection/countBy', './collection/detect', './collection/each', './collection/eachRight', './collection/every', './collection/filter', './collection/find', './collection/findLast', './collection/findWhere', './collection/foldl', './collection/foldr', './collection/forEach', './collection/forEachRight', './collection/groupBy', './collection/include', './collection/includes', './collection/indexBy', './collection/inject', './collection/invoke', './collection/map', './collection/max', './collection/min', './collection/partition', './collection/pluck', './collection/reduce', './collection/reduceRight', './collection/reject', './collection/sample', './collection/select', './collection/shuffle', './collection/size', './collection/some', './collection/sortBy', './collection/sortByAll', './collection/where'], function(all, any, at, collect, contains, countBy, detect, each, eachRight, every, filter, find, findLast, findWhere, foldl, foldr, forEach, forEachRight, groupBy, include, includes, indexBy, inject, invoke, map, max, min, partition, pluck, reduce, reduceRight, reject, sample, select, shuffle, size, some, sortBy, sortByAll, where) {
+define(['./collection/all', './collection/any', './collection/at', './collection/collect', './collection/contains', './collection/countBy', './collection/detect', './collection/each', './collection/eachRight', './collection/every', './collection/filter', './collection/find', './collection/findLast', './collection/findWhere', './collection/foldl', './collection/foldr', './collection/forEach', './collection/forEachRight', './collection/groupBy', './collection/include', './collection/includes', './collection/indexBy', './collection/inject', './collection/invoke', './collection/map', './math/max', './math/min', './collection/partition', './collection/pluck', './collection/reduce', './collection/reduceRight', './collection/reject', './collection/sample', './collection/select', './collection/shuffle', './collection/size', './collection/some', './collection/sortBy', './collection/sortByAll', './collection/sortByOrder', './math/sum', './collection/where'], function(all, any, at, collect, contains, countBy, detect, each, eachRight, every, filter, find, findLast, findWhere, foldl, foldr, forEach, forEachRight, groupBy, include, includes, indexBy, inject, invoke, map, max, min, partition, pluck, reduce, reduceRight, reject, sample, select, shuffle, size, some, sortBy, sortByAll, sortByOrder, sum, where) {
   return {
     'all': all,
     'any': any,
@@ -39,6 +39,8 @@ define(['./collection/all', './collection/any', './collection/at', './collection
     'some': some,
     'sortBy': sortBy,
     'sortByAll': sortByAll,
+    'sortByOrder': sortByOrder,
+    'sum': sum,
     'where': where
   };
 });

collection/at.js

@@ -1,4 +1,4 @@
-define(['../internal/baseAt', '../internal/baseFlatten', '../internal/isLength', '../internal/toIterable'], function(baseAt, baseFlatten, isLength, toIterable) {
+define(['../internal/baseAt', '../internal/baseFlatten', '../internal/isLength', '../function/restParam', '../internal/toIterable'], function(baseAt, baseFlatten, isLength, restParam, toIterable) {
 
   /**
    * Creates an array of elements corresponding to the given keys, or indexes,
@@ -17,16 +17,16 @@ define(['../internal/baseAt', '../internal/baseFlatten', '../internal/isLength',
    * _.at(['a', 'b', 'c'], [0, 2]);
    * // => ['a', 'c']
    *
-   * _.at(['fred', 'barney', 'pebbles'], 0, 2);
-   * // => ['fred', 'pebbles']
+   * _.at(['barney', 'fred', 'pebbles'], 0, 2);
+   * // => ['barney', 'pebbles']
    */
-  function at(collection) {
+  var at = restParam(function(collection, props) {
     var length = collection ? collection.length : 0;
     if (isLength(length)) {
       collection = toIterable(collection);
     }
-    return baseAt(collection, baseFlatten(arguments, false, false, 1));
-  }
+    return baseAt(collection, baseFlatten(props));
+  });
 
   return at;
 });

collection/countBy.js

@@ -10,17 +10,17 @@ define(['../internal/createAggregator'], function(createAggregator) {
    * Creates an object composed of keys generated from the results of running
    * each element of `collection` through `iteratee`. The corresponding value
    * of each key is the number of times the key was returned by `iteratee`.
-   * The `iteratee` is bound to `thisArg` and invoked with three arguments;
+   * The `iteratee` is bound to `thisArg` and invoked with three arguments:
    * (value, index|key, collection).
    *
-   * If a property name is provided for `predicate` the created `_.property`
+   * If a property name is provided for `iteratee` 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
+   * If an object is provided for `iteratee` the created `_.matches` style
    * callback returns `true` for elements that have the properties of the given
    * object, else `false`.
    *

collection/every.js

@@ -1,8 +1,8 @@
-define(['../internal/arrayEvery', '../internal/baseCallback', '../internal/baseEvery', '../lang/isArray'], function(arrayEvery, baseCallback, baseEvery, isArray) {
+define(['../internal/arrayEvery', '../internal/baseCallback', '../internal/baseEvery', '../lang/isArray', '../internal/isIterateeCall'], function(arrayEvery, baseCallback, baseEvery, isArray, isIterateeCall) {
 
   /**
    * Checks if `predicate` returns truthy for **all** elements of `collection`.
-   * The predicate is bound to `thisArg` and invoked with three arguments;
+   * The predicate is bound to `thisArg` and invoked with three arguments:
    * (value, index|key, collection).
    *
    * If a property name is provided for `predicate` the created `_.property`
@@ -50,6 +50,9 @@ 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;
+    }
     if (typeof predicate != 'function' || typeof thisArg != 'undefined') {
       predicate = baseCallback(predicate, thisArg, 3);
     }

collection/filter.js

@@ -3,7 +3,7 @@ define(['../internal/arrayFilter', '../internal/baseCallback', '../internal/base
   /**
    * Iterates over elements of `collection`, returning an array of all elements
    * `predicate` returns truthy for. The predicate is bound to `thisArg` and
-   * invoked with three arguments; (value, index|key, collection).
+   * invoked with three arguments: (value, index|key, collection).
    *
    * If a property name is provided for `predicate` the created `_.property`
    * style callback returns the property value of the given element.

collection/find.js

@@ -1,12 +1,9 @@
-define(['../internal/baseCallback', '../internal/baseEach', '../internal/baseFind', '../array/findIndex', '../lang/isArray'], function(baseCallback, baseEach, baseFind, findIndex, isArray) {
-
-  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
-  var undefined;
+define(['../internal/baseEach', '../internal/createFind'], function(baseEach, createFind) {
 
   /**
    * Iterates over elements of `collection`, returning the first element
    * `predicate` returns truthy for. The predicate is bound to `thisArg` and
-   * invoked with three arguments; (value, index|key, collection).
+   * invoked with three arguments: (value, index|key, collection).
    *
    * If a property name is provided for `predicate` the created `_.property`
    * style callback returns the property value of the given element.
@@ -53,14 +50,7 @@ define(['../internal/baseCallback', '../internal/baseEach', '../internal/baseFin
    * _.result(_.find(users, 'active'), 'user');
    * // => 'barney'
    */
-  function find(collection, predicate, thisArg) {
-    if (isArray(collection)) {
-      var index = findIndex(collection, predicate, thisArg);
-      return index > -1 ? collection[index] : undefined;
-    }
-    predicate = baseCallback(predicate, thisArg, 3);
-    return baseFind(collection, predicate, baseEach);
-  }
+  var find = createFind(baseEach);
 
   return find;
 });

collection/findLast.js

@@ -1,4 +1,4 @@
-define(['../internal/baseCallback', '../internal/baseEachRight', '../internal/baseFind'], function(baseCallback, baseEachRight, baseFind) {
+define(['../internal/baseEachRight', '../internal/createFind'], function(baseEachRight, createFind) {
 
   /**
    * This method is like `_.find` except that it iterates over elements of
@@ -19,10 +19,7 @@ define(['../internal/baseCallback', '../internal/baseEachRight', '../internal/ba
    * });
    * // => 3
    */
-  function findLast(collection, predicate, thisArg) {
-    predicate = baseCallback(predicate, thisArg, 3);
-    return baseFind(collection, predicate, baseEachRight);
-  }
+  var findLast = createFind(baseEachRight, true);
 
   return findLast;
 });

collection/forEach.js

@@ -1,8 +1,8 @@
-define(['../internal/arrayEach', '../internal/baseEach', '../internal/bindCallback', '../lang/isArray'], function(arrayEach, baseEach, bindCallback, isArray) {
+define(['../internal/arrayEach', '../internal/baseEach', '../internal/createForEach'], function(arrayEach, baseEach, createForEach) {
 
   /**
    * Iterates over elements of `collection` invoking `iteratee` for each element.
-   * The `iteratee` is bound to `thisArg` and invoked with three arguments;
+   * The `iteratee` is bound to `thisArg` and invoked with three arguments:
    * (value, index|key, collection). Iterator functions may exit iteration early
    * by explicitly returning `false`.
    *
@@ -30,11 +30,7 @@ define(['../internal/arrayEach', '../internal/baseEach', '../internal/bindCallba
    * });
    * // => logs each value-key pair and returns the object (iteration order is not guaranteed)
    */
-  function forEach(collection, iteratee, thisArg) {
-    return (typeof iteratee == 'function' && typeof thisArg == 'undefined' && isArray(collection))
-      ? arrayEach(collection, iteratee)
-      : baseEach(collection, bindCallback(iteratee, thisArg, 3));
-  }
+  var forEach = createForEach(arrayEach, baseEach);
 
   return forEach;
 });

collection/forEachRight.js

@@ -1,4 +1,4 @@
-define(['../internal/arrayEachRight', '../internal/baseEachRight', '../internal/bindCallback', '../lang/isArray'], function(arrayEachRight, baseEachRight, bindCallback, isArray) {
+define(['../internal/arrayEachRight', '../internal/baseEachRight', '../internal/createForEach'], function(arrayEachRight, baseEachRight, createForEach) {
 
   /**
    * This method is like `_.forEach` except that it iterates over elements of
@@ -16,14 +16,10 @@ define(['../internal/arrayEachRight', '../internal/baseEachRight', '../internal/
    *
    * _([1, 2]).forEachRight(function(n) {
    *   console.log(n);
-   * }).join(',');
+   * }).value();
    * // => logs each value from right to left and returns the array
    */
-  function forEachRight(collection, iteratee, thisArg) {
-    return (typeof iteratee == 'function' && typeof thisArg == 'undefined' && isArray(collection))
-      ? arrayEachRight(collection, iteratee)
-      : baseEachRight(collection, bindCallback(iteratee, thisArg, 3));
-  }
+  var forEachRight = createForEach(arrayEachRight, baseEachRight);
 
   return forEachRight;
 });

collection/groupBy.js

@@ -10,17 +10,17 @@ define(['../internal/createAggregator'], function(createAggregator) {
    * Creates an object composed of keys generated from the results of running
    * each element of `collection` through `iteratee`. The corresponding value
    * of each key is an array of the elements responsible for generating the key.
-   * The `iteratee` is bound to `thisArg` and invoked with three arguments;
+   * The `iteratee` is bound to `thisArg` and invoked with three arguments:
    * (value, index|key, collection).
    *
-   * If a property name is provided for `predicate` the created `_.property`
+   * If a property name is provided for `iteratee` 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
+   * If an object is provided for `iteratee` the created `_.matches` style
    * callback returns `true` for elements that have the properties of the given
    * object, else `false`.
    *

collection/includes.js

@@ -1,4 +1,4 @@
-define(['../internal/baseIndexOf', '../lang/isArray', '../internal/isLength', '../lang/isString', '../object/values'], function(baseIndexOf, isArray, isLength, isString, values) {
+define(['../internal/baseIndexOf', '../lang/isArray', '../internal/isIterateeCall', '../internal/isLength', '../lang/isString', '../object/values'], function(baseIndexOf, isArray, isIterateeCall, isLength, isString, values) {
 
   /* Native method references for those with the same name as other `lodash` methods. */
   var nativeMax = Math.max;
@@ -8,10 +8,9 @@ define(['../internal/baseIndexOf', '../lang/isArray', '../internal/isLength', '.
    * comparisons. If `fromIndex` is negative, it is used as the offset from
    * the end of `collection`.
    *
-   * **Note:** `SameValueZero` comparisons are like strict equality comparisons,
-   * e.g. `===`, except that `NaN` matches `NaN`. See the
-   * [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero)
-   * for more details.
+   * **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 _
@@ -20,6 +19,7 @@ define(['../internal/baseIndexOf', '../lang/isArray', '../internal/isLength', '.
    * @param {Array|Object|string} collection The collection to search.
    * @param {*} target The value to search for.
    * @param {number} [fromIndex=0] The index to search from.
+   * @param- {Object} [guard] Enables use as a callback for functions like `_.reduce`.
    * @returns {boolean} Returns `true` if a matching element is found, else `false`.
    * @example
    *
@@ -35,7 +35,7 @@ define(['../internal/baseIndexOf', '../lang/isArray', '../internal/isLength', '.
    * _.includes('pebbles', 'eb');
    * // => true
    */
-  function includes(collection, target, fromIndex) {
+  function includes(collection, target, fromIndex, guard) {
     var length = collection ? collection.length : 0;
     if (!isLength(length)) {
       collection = values(collection);
@@ -44,10 +44,10 @@ define(['../internal/baseIndexOf', '../lang/isArray', '../internal/isLength', '.
     if (!length) {
       return false;
     }
-    if (typeof fromIndex == 'number') {
-      fromIndex = fromIndex < 0 ? nativeMax(length + fromIndex, 0) : (fromIndex || 0);
-    } else {
+    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)

collection/indexBy.js

@@ -4,17 +4,17 @@ define(['../internal/createAggregator'], function(createAggregator) {
    * Creates an object composed of keys generated from the results of running
    * each element of `collection` through `iteratee`. The corresponding value
    * of each key is the last element responsible for generating the key. The
-   * iteratee function is bound to `thisArg` and invoked with three arguments;
+   * iteratee function is bound to `thisArg` and invoked with three arguments:
    * (value, index|key, collection).
    *
-   * If a property name is provided for `predicate` the created `_.property`
+   * If a property name is provided for `iteratee` 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
+   * If an object is provided for `iteratee` the created `_.matches` style
    * callback returns `true` for elements that have the properties of the given
    * object, else `false`.
    *

collection/invoke.js

@@ -1,4 +1,7 @@
-define(['../internal/baseInvoke', '../internal/baseSlice'], function(baseInvoke, baseSlice) {
+define(['../internal/baseEach', '../internal/isLength', '../function/restParam'], function(baseEach, isLength, restParam) {
+
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
 
   /**
    * Invokes the method named by `methodName` on each element in `collection`,
@@ -22,9 +25,18 @@ define(['../internal/baseInvoke', '../internal/baseSlice'], function(baseInvoke,
    * _.invoke([123, 456], String.prototype.split, '');
    * // => [['1', '2', '3'], ['4', '5', '6']]
    */
-  function invoke(collection, methodName) {
-    return baseInvoke(collection, methodName, baseSlice(arguments, 2));
-  }
+  var invoke = restParam(function(collection, methodName, args) {
+    var index = -1,
+        isFunc = typeof methodName == 'function',
+        length = collection ? collection.length : 0,
+        result = isLength(length) ? Array(length) : [];
+
+    baseEach(collection, function(value) {
+      var func = isFunc ? methodName : (value != null && value[methodName]);
+      result[++index] = func ? func.apply(value, args) : undefined;
+    });
+    return result;
+  });
 
   return invoke;
 });

collection/map.js

@@ -3,16 +3,16 @@ define(['../internal/arrayMap', '../internal/baseCallback', '../internal/baseMap
   /**
    * Creates an array of values by running each element in `collection` through
    * `iteratee`. The `iteratee` is bound to `thisArg` and invoked with three
-   * arguments; (value, index|key, collection).
+   * arguments: (value, index|key, collection).
    *
-   * If a property name is provided for `predicate` the created `_.property`
+   * If a property name is provided for `iteratee` 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
+   * If an object is provided for `iteratee` the created `_.matches` style
    * callback returns `true` for elements that have the properties of the given
    * object, else `false`.
    *
@@ -21,9 +21,9 @@ define(['../internal/arrayMap', '../internal/baseCallback', '../internal/baseMap
    *
    * The guarded methods are:
    * `ary`, `callback`, `chunk`, `clone`, `create`, `curry`, `curryRight`, `drop`,
-   * `dropRight`, `fill`, `flatten`, `invert`, `max`, `min`, `parseInt`, `slice`,
-   * `sortBy`, `take`, `takeRight`, `template`, `trim`, `trimLeft`, `trimRight`,
-   * `trunc`, `random`, `range`, `sample`, `uniq`, and `words`
+   * `dropRight`, `every`, `fill`, `flatten`, `invert`, `max`, `min`, `parseInt`,
+   * `slice`, `sortBy`, `take`, `takeRight`, `template`, `trim`, `trimLeft`,
+   * `trimRight`, `trunc`, `random`, `range`, `sample`, `some`, `uniq`, and `words`
    *
    * @static
    * @memberOf _

collection/max.js

@@ -1,53 +1,3 @@
-define(['../internal/arrayMax', '../internal/createExtremum'], function(arrayMax, createExtremum) {
-
-  /**
-   * Gets the maximum value of `collection`. If `collection` is empty or falsey
-   * `-Infinity` is returned. If an iteratee function is provided it is invoked
-   * for each value in `collection` to generate the criterion by which the value
-   * is ranked. The `iteratee` is bound to `thisArg` and invoked with three
-   * arguments; (value, index, collection).
-   *
-   * 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
-   * @param {Array|Object|string} collection The collection to iterate over.
-   * @param {Function|Object|string} [iteratee] The function invoked per iteration.
-   * @param {*} [thisArg] The `this` binding of `iteratee`.
-   * @returns {*} Returns the maximum value.
-   * @example
-   *
-   * _.max([4, 2, 8, 6]);
-   * // => 8
-   *
-   * _.max([]);
-   * // => -Infinity
-   *
-   * var users = [
-   *   { 'user': 'barney', 'age': 36 },
-   *   { 'user': 'fred',   'age': 40 }
-   * ];
-   *
-   * _.max(users, function(chr) {
-   *   return chr.age;
-   * });
-   * // => { 'user': 'fred', 'age': 40 };
-   *
-   * // using the `_.property` callback shorthand
-   * _.max(users, 'age');
-   * // => { 'user': 'fred', 'age': 40 };
-   */
-  var max = createExtremum(arrayMax);
-
+define(["../math/max"], function(max) {
   return max;
 });

collection/min.js

@@ -1,53 +1,3 @@
-define(['../internal/arrayMin', '../internal/createExtremum'], function(arrayMin, createExtremum) {
-
-  /**
-   * Gets the minimum value of `collection`. If `collection` is empty or falsey
-   * `Infinity` is returned. If an iteratee function is provided it is invoked
-   * for each value in `collection` to generate the criterion by which the value
-   * is ranked. The `iteratee` is bound to `thisArg` and invoked with three
-   * arguments; (value, index, collection).
-   *
-   * 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
-   * @param {Array|Object|string} collection The collection to iterate over.
-   * @param {Function|Object|string} [iteratee] The function invoked per iteration.
-   * @param {*} [thisArg] The `this` binding of `iteratee`.
-   * @returns {*} Returns the minimum value.
-   * @example
-   *
-   * _.min([4, 2, 8, 6]);
-   * // => 2
-   *
-   * _.min([]);
-   * // => Infinity
-   *
-   * var users = [
-   *   { 'user': 'barney', 'age': 36 },
-   *   { 'user': 'fred',   'age': 40 }
-   * ];
-   *
-   * _.min(users, function(chr) {
-   *   return chr.age;
-   * });
-   * // => { 'user': 'barney', 'age': 36 };
-   *
-   * // using the `_.property` callback shorthand
-   * _.min(users, 'age');
-   * // => { 'user': 'barney', 'age': 36 };
-   */
-  var min = createExtremum(arrayMin, true);
-
+define(["../math/min"], function(min) {
   return min;
 });

collection/partition.js

@@ -4,7 +4,7 @@ define(['../internal/createAggregator'], function(createAggregator) {
    * Creates an array of elements split into two groups, the first of which
    * contains elements `predicate` returns truthy for, while the second of which
    * contains elements `predicate` returns falsey for. The predicate is bound
-   * to `thisArg` and invoked with three arguments; (value, index|key, collection).
+   * to `thisArg` and invoked with three arguments: (value, index|key, collection).
    *
    * If a property name is provided for `predicate` the created `_.property`
    * style callback returns the property value of the given element.
@@ -35,7 +35,7 @@ define(['../internal/createAggregator'], function(createAggregator) {
    * _.partition([1.2, 2.3, 3.4], function(n) {
    *   return this.floor(n) % 2;
    * }, Math);
-   * // => [[1, 3], [2]]
+   * // => [[1.2, 3.4], [2.3]]
    *
    * var users = [
    *   { 'user': 'barney',  'age': 36, 'active': false },

collection/reduce.js

@@ -1,18 +1,18 @@
-define(['../internal/arrayReduce', '../internal/baseCallback', '../internal/baseEach', '../internal/baseReduce', '../lang/isArray'], function(arrayReduce, baseCallback, baseEach, baseReduce, isArray) {
+define(['../internal/arrayReduce', '../internal/baseEach', '../internal/createReduce'], function(arrayReduce, baseEach, createReduce) {
 
   /**
    * Reduces `collection` to a value which is the accumulated result of running
    * each element in `collection` through `iteratee`, where each successive
    * invocation is supplied the return value of the previous. If `accumulator`
    * is not provided the first element of `collection` is used as the initial
-   * value. The `iteratee` is bound to `thisArg`and invoked with four arguments;
+   * 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
    * `_.reduce`, `_.reduceRight`, and `_.transform`.
    *
    * The guarded methods are:
-   * `assign`, `defaults`, `merge`, and `sortAllBy`
+   * `assign`, `defaults`, `includes`, `merge`, `sortByAll`, and `sortByOrder`
    *
    * @static
    * @memberOf _
@@ -36,10 +36,7 @@ define(['../internal/arrayReduce', '../internal/baseCallback', '../internal/base
    * }, {});
    * // => { 'a': 3, 'b': 6 } (iteration order is not guaranteed)
    */
-  function reduce(collection, iteratee, accumulator, thisArg) {
-    var func = isArray(collection) ? arrayReduce : baseReduce;
-    return func(collection, baseCallback(iteratee, thisArg, 4), accumulator, arguments.length < 3, baseEach);
-  }
+  var reduce = createReduce(arrayReduce, baseEach);
 
   return reduce;
 });

collection/reduceRight.js

@@ -1,4 +1,4 @@
-define(['../internal/arrayReduceRight', '../internal/baseCallback', '../internal/baseEachRight', '../internal/baseReduce', '../lang/isArray'], function(arrayReduceRight, baseCallback, baseEachRight, baseReduce, isArray) {
+define(['../internal/arrayReduceRight', '../internal/baseEachRight', '../internal/createReduce'], function(arrayReduceRight, baseEachRight, createReduce) {
 
   /**
    * This method is like `_.reduce` except that it iterates over elements of
@@ -22,10 +22,7 @@ define(['../internal/arrayReduceRight', '../internal/baseCallback', '../internal
    * }, []);
    * // => [4, 5, 2, 3, 0, 1]
    */
-  function reduceRight(collection, iteratee, accumulator, thisArg) {
-    var func = isArray(collection) ? arrayReduceRight : baseReduce;
-    return func(collection, baseCallback(iteratee, thisArg, 4), accumulator, arguments.length < 3, baseEachRight);
-  }
+  var reduceRight =  createReduce(arrayReduceRight, baseEachRight);
 
   return reduceRight;
 });

collection/shuffle.js

@@ -1,9 +1,8 @@
 define(['../internal/baseRandom', '../internal/toIterable'], function(baseRandom, toIterable) {
 
   /**
-   * Creates an array of shuffled values, using a version of the Fisher-Yates
-   * shuffle. See [Wikipedia](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle)
-   * for more details.
+   * Creates an array of shuffled values, using a version of the
+   * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).
    *
    * @static
    * @memberOf _

collection/size.js

@@ -1,8 +1,8 @@
 define(['../internal/isLength', '../object/keys'], function(isLength, keys) {
 
   /**
-   * Gets the size of `collection` by returning `collection.length` for
-   * array-like values or the number of own enumerable properties for objects.
+   * Gets the size of `collection` by returning its length for array-like
+   * values or the number of own enumerable properties for objects.
    *
    * @static
    * @memberOf _

collection/some.js

@@ -1,10 +1,10 @@
-define(['../internal/arraySome', '../internal/baseCallback', '../internal/baseSome', '../lang/isArray'], function(arraySome, baseCallback, baseSome, isArray) {
+define(['../internal/arraySome', '../internal/baseCallback', '../internal/baseSome', '../lang/isArray', '../internal/isIterateeCall'], function(arraySome, baseCallback, baseSome, isArray, isIterateeCall) {
 
   /**
    * Checks if `predicate` returns truthy for **any** element of `collection`.
    * The function returns as soon as it finds a passing value and does not iterate
    * over the entire collection. The predicate is bound to `thisArg` and invoked
-   * with three arguments; (value, index|key, collection).
+   * with three arguments: (value, index|key, collection).
    *
    * If a property name is provided for `predicate` the created `_.property`
    * style callback returns the property value of the given element.
@@ -38,7 +38,7 @@ define(['../internal/arraySome', '../internal/baseCallback', '../internal/baseSo
    * ];
    *
    * // using the `_.matches` callback shorthand
-   * _.some(users, { user': 'barney', 'active': false });
+   * _.some(users, { 'user': 'barney', 'active': false });
    * // => false
    *
    * // using the `_.matchesProperty` callback shorthand
@@ -51,6 +51,9 @@ 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;
+    }
     if (typeof predicate != 'function' || typeof thisArg != 'undefined') {
       predicate = baseCallback(predicate, thisArg, 3);
     }

collection/sortBy.js

@@ -4,17 +4,17 @@ define(['../internal/baseCallback', '../internal/baseEach', '../internal/baseSor
    * Creates an array of elements, sorted in ascending order by the results of
    * running each element in a collection through `iteratee`. This method performs
    * a stable sort, that is, it preserves the original sort order of equal elements.
-   * The `iteratee` is bound to `thisArg` and invoked with three arguments;
+   * The `iteratee` is bound to `thisArg` and invoked with three arguments:
    * (value, index|key, collection).
    *
-   * If a property name is provided for `predicate` the created `_.property`
+   * If a property name is provided for `iteratee` 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
+   * If an object is provided for `iteratee` the created `_.matches` style
    * callback returns `true` for elements that have the properties of the given
    * object, else `false`.
    *
@@ -50,8 +50,11 @@ define(['../internal/baseCallback', '../internal/baseEach', '../internal/baseSor
    * // => ['barney', 'fred', 'pebbles']
    */
   function sortBy(collection, iteratee, thisArg) {
+    if (collection == null) {
+      return [];
+    }
     var index = -1,
-        length = collection ? collection.length : 0,
+        length = collection.length,
         result = isLength(length) ? Array(length) : [];
 
     if (thisArg && isIterateeCall(collection, iteratee, thisArg)) {

collection/sortByAll.js

@@ -1,7 +1,4 @@
-define(['../internal/baseEach', '../internal/baseFlatten', '../internal/baseSortBy', '../internal/compareMultipleAscending', '../internal/isIterateeCall', '../internal/isLength'], function(baseEach, baseFlatten, baseSortBy, compareMultipleAscending, isIterateeCall, isLength) {
-
-  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
-  var undefined;
+define(['../internal/baseFlatten', '../internal/baseSortByOrder', '../internal/isIterateeCall'], function(baseFlatten, baseSortByOrder, isIterateeCall) {
 
   /**
    * This method is like `_.sortBy` except that it sorts by property names
@@ -26,26 +23,24 @@ define(['../internal/baseEach', '../internal/baseFlatten', '../internal/baseSort
    * _.map(_.sortByAll(users, ['user', 'age']), _.values);
    * // => [['barney', 26], ['barney', 36], ['fred', 30], ['fred', 40]]
    */
-  function sortByAll(collection) {
-    var args = arguments;
-    if (args.length > 3 && isIterateeCall(args[1], args[2], args[3])) {
-      args = [collection, args[1]];
+  function sortByAll() {
+    var args = arguments,
+        collection = args[0],
+        guard = args[3],
+        index = 0,
+        length = args.length - 1;
+
+    if (collection == null) {
+      return [];
     }
-    var index = -1,
-        length = collection ? collection.length : 0,
-        props = baseFlatten(args, false, false, 1),
-        result = isLength(length) ? Array(length) : [];
-
-    baseEach(collection, function(value) {
-      var length = props.length,
-          criteria = Array(length);
-
-      while (length--) {
-        criteria[length] = value == null ? undefined : value[props[length]];
-      }
-      result[++index] = { 'criteria': criteria, 'index': index, 'value': value };
-    });
-    return baseSortBy(result, compareMultipleAscending);
+    var props = Array(length);
+    while (index < length) {
+      props[index] = args[++index];
+    }
+    if (guard && isIterateeCall(args[1], args[2], guard)) {
+      props = args[1];
+    }
+    return baseSortByOrder(collection, baseFlatten(props), []);
   }
 
   return sortByAll;

collection/sortByOrder.js

@@ -0,0 +1,47 @@
+define(['../internal/baseSortByOrder', '../lang/isArray', '../internal/isIterateeCall'], function(baseSortByOrder, isArray, isIterateeCall) {
+
+  /**
+   * This method is like `_.sortByAll` except that it allows specifying the
+   * sort orders of the property names 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.
+   *
+   * @static
+   * @memberOf _
+   * @category Collection
+   * @param {Array|Object|string} collection The collection to iterate over.
+   * @param {string[]} props The property names to sort by.
+   * @param {boolean[]} orders The sort orders of `props`.
+   * @param- {Object} [guard] Enables use as a callback for functions like `_.reduce`.
+   * @returns {Array} Returns the new sorted array.
+   * @example
+   *
+   * var users = [
+   *   { 'user': 'barney', 'age': 26 },
+   *   { 'user': 'fred',   'age': 40 },
+   *   { 'user': 'barney', 'age': 36 },
+   *   { 'user': 'fred',   'age': 30 }
+   * ];
+   *
+   * // sort by `user` in ascending order and by `age` in descending order
+   * _.map(_.sortByOrder(users, ['user', 'age'], [true, false]), _.values);
+   * // => [['barney', 36], ['barney', 26], ['fred', 40], ['fred', 30]]
+   */
+  function sortByOrder(collection, props, orders, guard) {
+    if (collection == null) {
+      return [];
+    }
+    if (guard && isIterateeCall(props, orders, guard)) {
+      orders = null;
+    }
+    if (!isArray(props)) {
+      props = props == null ? [] : [props];
+    }
+    if (!isArray(orders)) {
+      orders = orders == null ? [] : [orders];
+    }
+    return baseSortByOrder(collection, props, orders);
+  }
+
+  return sortByOrder;
+});

collection/sum.js

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

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/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, 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/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) {
   return {
     'after': after,
     'ary': ary,
@@ -21,6 +21,7 @@ define(['./function/after', './function/ary', './function/backflow', './function
     'partial': partial,
     'partialRight': partialRight,
     'rearg': rearg,
+    'restParam': restParam,
     'spread': spread,
     'throttle': throttle,
     'wrap': wrap

function/ary.js

@@ -1,7 +1,7 @@
 define(['../internal/createWrapper', '../internal/isIterateeCall'], function(createWrapper, isIterateeCall) {
 
   /** Used to compose bitmasks for wrapper metadata. */
-  var ARY_FLAG = 256;
+  var ARY_FLAG = 128;
 
   /* Native method references for those with the same name as other `lodash` methods. */
   var nativeMax = Math.max;

function/bind.js

@@ -1,4 +1,4 @@
-define(['../internal/baseSlice', '../internal/createWrapper', '../internal/replaceHolders'], function(baseSlice, createWrapper, replaceHolders) {
+define(['../internal/createWrapper', '../internal/replaceHolders', './restParam'], function(createWrapper, replaceHolders, restParam) {
 
   /** Used to compose bitmasks for wrapper metadata. */
   var BIND_FLAG = 1,
@@ -20,7 +20,7 @@ define(['../internal/baseSlice', '../internal/createWrapper', '../internal/repla
    * @category Function
    * @param {Function} func The function to bind.
    * @param {*} thisArg The `this` binding of `func`.
-   * @param {...*} [args] The arguments to be partially applied.
+   * @param {...*} [partials] The arguments to be partially applied.
    * @returns {Function} Returns the new bound function.
    * @example
    *
@@ -39,16 +39,14 @@ define(['../internal/baseSlice', '../internal/createWrapper', '../internal/repla
    * bound('hi');
    * // => 'hi fred!'
    */
-  function bind(func, thisArg) {
+  var bind = restParam(function(func, thisArg, partials) {
     var bitmask = BIND_FLAG;
-    if (arguments.length > 2) {
-      var partials = baseSlice(arguments, 2),
-          holders = replaceHolders(partials, bind.placeholder);
-
+    if (partials.length) {
+      var holders = replaceHolders(partials, bind.placeholder);
       bitmask |= PARTIAL_FLAG;
     }
     return createWrapper(func, bitmask, thisArg, partials, holders);
-  }
+  });
 
   // Assign default placeholders.
   bind.placeholder = {};

function/bindAll.js

@@ -1,4 +1,7 @@
-define(['../internal/baseBindAll', '../internal/baseFlatten', '../object/functions'], function(baseBindAll, baseFlatten, functions) {
+define(['../internal/baseFlatten', '../internal/createWrapper', '../object/functions', './restParam'], function(baseFlatten, createWrapper, functions, restParam) {
+
+  /** Used to compose bitmasks for wrapper metadata. */
+  var BIND_FLAG = 1;
 
   /**
    * Binds methods of an object to the object itself, overwriting the existing
@@ -28,13 +31,18 @@ define(['../internal/baseBindAll', '../internal/baseFlatten', '../object/functio
    * jQuery('#docs').on('click', view.onClick);
    * // => logs 'clicked docs' when the element is clicked
    */
-  function bindAll(object) {
-    return baseBindAll(object,
-      arguments.length > 1
-        ? baseFlatten(arguments, false, false, 1)
-        : functions(object)
-    );
-  }
+  var bindAll = restParam(function(object, methodNames) {
+    methodNames = methodNames.length ? baseFlatten(methodNames) : functions(object);
+
+    var index = -1,
+        length = methodNames.length;
+
+    while (++index < length) {
+      var key = methodNames[index];
+      object[key] = createWrapper(object[key], BIND_FLAG, object);
+    }
+    return object;
+  });
 
   return bindAll;
 });

function/bindKey.js

@@ -1,4 +1,4 @@
-define(['../internal/baseSlice', '../internal/createWrapper', '../internal/replaceHolders'], function(baseSlice, createWrapper, replaceHolders) {
+define(['../internal/createWrapper', '../internal/replaceHolders', './restParam'], function(createWrapper, replaceHolders, restParam) {
 
   /** Used to compose bitmasks for wrapper metadata. */
   var BIND_FLAG = 1,
@@ -22,7 +22,7 @@ define(['../internal/baseSlice', '../internal/createWrapper', '../internal/repla
    * @category Function
    * @param {Object} object The object the method belongs to.
    * @param {string} key The key of the method.
-   * @param {...*} [args] The arguments to be partially applied.
+   * @param {...*} [partials] The arguments to be partially applied.
    * @returns {Function} Returns the new bound function.
    * @example
    *
@@ -49,16 +49,14 @@ define(['../internal/baseSlice', '../internal/createWrapper', '../internal/repla
    * bound('hi');
    * // => 'hiya fred!'
    */
-  function bindKey(object, key) {
+  var bindKey = restParam(function(object, key, partials) {
     var bitmask = BIND_FLAG | BIND_KEY_FLAG;
-    if (arguments.length > 2) {
-      var partials = baseSlice(arguments, 2),
-          holders = replaceHolders(partials, bindKey.placeholder);
-
+    if (partials.length) {
+      var holders = replaceHolders(partials, bindKey.placeholder);
       bitmask |= PARTIAL_FLAG;
     }
     return createWrapper(key, bitmask, object, partials, holders);
-  }
+  });
 
   // Assign default placeholders.
   bindKey.placeholder = {};

function/curry.js

@@ -1,4 +1,4 @@
-define(['../internal/createWrapper', '../internal/isIterateeCall'], function(createWrapper, isIterateeCall) {
+define(['../internal/createCurry'], function(createCurry) {
 
   /** Used to compose bitmasks for wrapper metadata. */
   var CURRY_FLAG = 8;
@@ -43,14 +43,7 @@ define(['../internal/createWrapper', '../internal/isIterateeCall'], function(cre
    * curried(1)(_, 3)(2);
    * // => [1, 2, 3]
    */
-  function curry(func, arity, guard) {
-    if (guard && isIterateeCall(func, arity, guard)) {
-      arity = null;
-    }
-    var result = createWrapper(func, CURRY_FLAG, null, null, null, null, null, arity);
-    result.placeholder = curry.placeholder;
-    return result;
-  }
+  var curry = createCurry(CURRY_FLAG);
 
   // Assign default placeholders.
   curry.placeholder = {};

function/curryRight.js

@@ -1,4 +1,4 @@
-define(['../internal/createWrapper', '../internal/isIterateeCall'], function(createWrapper, isIterateeCall) {
+define(['../internal/createCurry'], function(createCurry) {
 
   /** Used to compose bitmasks for wrapper metadata. */
   var CURRY_RIGHT_FLAG = 16;
@@ -40,14 +40,7 @@ define(['../internal/createWrapper', '../internal/isIterateeCall'], function(cre
    * curried(3)(1, _)(2);
    * // => [1, 2, 3]
    */
-  function curryRight(func, arity, guard) {
-    if (guard && isIterateeCall(func, arity, guard)) {
-      arity = null;
-    }
-    var result = createWrapper(func, CURRY_RIGHT_FLAG, null, null, null, null, null, arity);
-    result.placeholder = curryRight.placeholder;
-    return result;
-  }
+  var curryRight = createCurry(CURRY_RIGHT_FLAG);
 
   // Assign default placeholders.
   curryRight.placeholder = {};

function/debounce.js

@@ -28,7 +28,7 @@ define(['../lang/isObject', '../date/now'], function(isObject, now) {
    * @memberOf _
    * @category Function
    * @param {Function} func The function to debounce.
-   * @param {number} wait The number of milliseconds to delay.
+   * @param {number} [wait=0] The number of milliseconds to delay.
    * @param {Object} [options] The options object.
    * @param {boolean} [options.leading=false] Specify invoking on the leading
    *  edge of the timeout.
@@ -86,7 +86,7 @@ define(['../lang/isObject', '../date/now'], function(isObject, now) {
     if (typeof func != 'function') {
       throw new TypeError(FUNC_ERROR_TEXT);
     }
-    wait = wait < 0 ? 0 : wait;
+    wait = wait < 0 ? 0 : (+wait || 0);
     if (options === true) {
       var leading = true;
       trailing = false;

function/defer.js

@@ -1,4 +1,4 @@
-define(['../internal/baseDelay'], function(baseDelay) {
+define(['../internal/baseDelay', './restParam'], function(baseDelay, restParam) {
 
   /**
    * Defers invoking the `func` until the current call stack has cleared. Any
@@ -17,9 +17,9 @@ define(['../internal/baseDelay'], function(baseDelay) {
    * }, 'deferred');
    * // logs 'deferred' after one or more milliseconds
    */
-  function defer(func) {
-    return baseDelay(func, 1, arguments, 1);
-  }
+  var defer = restParam(function(func, args) {
+    return baseDelay(func, 1, args);
+  });
 
   return defer;
 });

function/delay.js

@@ -1,4 +1,4 @@
-define(['../internal/baseDelay'], function(baseDelay) {
+define(['../internal/baseDelay', './restParam'], function(baseDelay, restParam) {
 
   /**
    * Invokes `func` after `wait` milliseconds. Any additional arguments are
@@ -18,9 +18,9 @@ define(['../internal/baseDelay'], function(baseDelay) {
    * }, 1000, 'later');
    * // => logs 'later' after one second
    */
-  function delay(func, wait) {
-    return baseDelay(func, wait, arguments, 2);
-  }
+  var delay = restParam(function(func, wait, args) {
+    return baseDelay(func, wait, args);
+  });
 
   return delay;
 });

function/flow.js

@@ -1,7 +1,4 @@
-define(['../internal/arrayEvery', '../internal/baseIsFunction'], function(arrayEvery, baseIsFunction) {
-
-  /** Used as the `TypeError` message for "Functions" methods. */
-  var FUNC_ERROR_TEXT = 'Expected a function';
+define(['../internal/createFlow'], function(createFlow) {
 
   /**
    * Creates a function that returns the result of invoking the provided
@@ -15,38 +12,15 @@ define(['../internal/arrayEvery', '../internal/baseIsFunction'], function(arrayE
    * @returns {Function} Returns the new function.
    * @example
    *
-   * function add(x, y) {
-   *   return x + y;
-   * }
-   *
    * function square(n) {
    *   return n * n;
    * }
    *
-   * var addSquare = _.flow(add, square);
+   * var addSquare = _.flow(_.add, square);
    * addSquare(1, 2);
    * // => 9
    */
-  function flow() {
-    var funcs = arguments,
-        length = funcs.length;
-
-    if (!length) {
-      return function() { return arguments[0]; };
-    }
-    if (!arrayEvery(funcs, baseIsFunction)) {
-      throw new TypeError(FUNC_ERROR_TEXT);
-    }
-    return function() {
-      var index = 0,
-          result = funcs[index].apply(this, arguments);
-
-      while (++index < length) {
-        result = funcs[index].call(this, result);
-      }
-      return result;
-    };
-  }
+  var flow = createFlow();
 
   return flow;
 });

function/flowRight.js

@@ -1,7 +1,4 @@
-define(['../internal/arrayEvery', '../internal/baseIsFunction'], function(arrayEvery, baseIsFunction) {
-
-  /** Used as the `TypeError` message for "Functions" methods. */
-  var FUNC_ERROR_TEXT = 'Expected a function';
+define(['../internal/createFlow'], function(createFlow) {
 
   /**
    * This method is like `_.flow` except that it creates a function that
@@ -15,38 +12,15 @@ define(['../internal/arrayEvery', '../internal/baseIsFunction'], function(arrayE
    * @returns {Function} Returns the new function.
    * @example
    *
-   * function add(x, y) {
-   *   return x + y;
-   * }
-   *
    * function square(n) {
    *   return n * n;
    * }
    *
-   * var addSquare = _.flowRight(square, add);
+   * var addSquare = _.flowRight(square, _.add);
    * addSquare(1, 2);
    * // => 9
    */
-  function flowRight() {
-    var funcs = arguments,
-        fromIndex = funcs.length - 1;
-
-    if (fromIndex < 0) {
-      return function() { return arguments[0]; };
-    }
-    if (!arrayEvery(funcs, baseIsFunction)) {
-      throw new TypeError(FUNC_ERROR_TEXT);
-    }
-    return function() {
-      var index = fromIndex,
-          result = funcs[index].apply(this, arguments);
-
-      while (index--) {
-        result = funcs[index].call(this, result);
-      }
-      return result;
-    };
-  }
+  var flowRight = createFlow(true);
 
   return flowRight;
 });

function/memoize.js

@@ -13,10 +13,8 @@ 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 ES `Map` method interface
-   * of `get`, `has`, and `set`. See the
-   * [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-properties-of-the-map-prototype-object)
-   * for more details.
+   * constructor with one whose instances implement the [`Map`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-properties-of-the-map-prototype-object)
+   * method interface of `get`, `has`, and `set`.
    *
    * @static
    * @memberOf _
@@ -61,13 +59,14 @@ define(['../internal/MapCache'], function(MapCache) {
       throw new TypeError(FUNC_ERROR_TEXT);
     }
     var memoized = function() {
-      var cache = memoized.cache,
-          key = resolver ? resolver.apply(this, arguments) : arguments[0];
+      var args = arguments,
+          cache = memoized.cache,
+          key = resolver ? resolver.apply(this, args) : args[0];
 
       if (cache.has(key)) {
         return cache.get(key);
       }
-      var result = func.apply(this, arguments);
+      var result = func.apply(this, args);
       cache.set(key, result);
       return result;
     };

function/once.js

@@ -3,7 +3,7 @@ define(['./before'], function(before) {
   /**
    * Creates a function that is restricted to invoking `func` once. Repeat calls
    * to the function return the value of the first call. The `func` is invoked
-   * with the `this` binding of the created function.
+   * with the `this` binding and arguments of the created function.
    *
    * @static
    * @memberOf _

function/partial.js

@@ -1,4 +1,4 @@
-define(['../internal/baseSlice', '../internal/createWrapper', '../internal/replaceHolders'], function(baseSlice, createWrapper, replaceHolders) {
+define(['../internal/createPartial'], function(createPartial) {
 
   /** Used to compose bitmasks for wrapper metadata. */
   var PARTIAL_FLAG = 32;
@@ -18,7 +18,7 @@ define(['../internal/baseSlice', '../internal/createWrapper', '../internal/repla
    * @memberOf _
    * @category Function
    * @param {Function} func The function to partially apply arguments to.
-   * @param {...*} [args] The arguments to be partially applied.
+   * @param {...*} [partials] The arguments to be partially applied.
    * @returns {Function} Returns the new partially applied function.
    * @example
    *
@@ -35,12 +35,7 @@ define(['../internal/baseSlice', '../internal/createWrapper', '../internal/repla
    * greetFred('hi');
    * // => 'hi fred'
    */
-  function partial(func) {
-    var partials = baseSlice(arguments, 1),
-        holders = replaceHolders(partials, partial.placeholder);
-
-    return createWrapper(func, PARTIAL_FLAG, null, partials, holders);
-  }
+  var partial = createPartial(PARTIAL_FLAG);
 
   // Assign default placeholders.
   partial.placeholder = {};

function/partialRight.js

@@ -1,4 +1,4 @@
-define(['../internal/baseSlice', '../internal/createWrapper', '../internal/replaceHolders'], function(baseSlice, createWrapper, replaceHolders) {
+define(['../internal/createPartial'], function(createPartial) {
 
   /** Used to compose bitmasks for wrapper metadata. */
   var PARTIAL_RIGHT_FLAG = 64;
@@ -17,7 +17,7 @@ define(['../internal/baseSlice', '../internal/createWrapper', '../internal/repla
    * @memberOf _
    * @category Function
    * @param {Function} func The function to partially apply arguments to.
-   * @param {...*} [args] The arguments to be partially applied.
+   * @param {...*} [partials] The arguments to be partially applied.
    * @returns {Function} Returns the new partially applied function.
    * @example
    *
@@ -34,12 +34,7 @@ define(['../internal/baseSlice', '../internal/createWrapper', '../internal/repla
    * sayHelloTo('fred');
    * // => 'hello fred'
    */
-  function partialRight(func) {
-    var partials = baseSlice(arguments, 1),
-        holders = replaceHolders(partials, partialRight.placeholder);
-
-    return createWrapper(func, PARTIAL_RIGHT_FLAG, null, partials, holders);
-  }
+  var partialRight = createPartial(PARTIAL_RIGHT_FLAG);
 
   // Assign default placeholders.
   partialRight.placeholder = {};

function/rearg.js

@@ -1,7 +1,7 @@
-define(['../internal/baseFlatten', '../internal/createWrapper'], function(baseFlatten, createWrapper) {
+define(['../internal/baseFlatten', '../internal/createWrapper', './restParam'], function(baseFlatten, createWrapper, restParam) {
 
   /** Used to compose bitmasks for wrapper metadata. */
-  var REARG_FLAG = 128;
+  var REARG_FLAG = 256;
 
   /**
    * Creates a function that invokes `func` with arguments arranged according
@@ -31,10 +31,9 @@ define(['../internal/baseFlatten', '../internal/createWrapper'], function(baseFl
    * }, [1, 2, 3]);
    * // => [3, 6, 9]
    */
-  function rearg(func) {
-    var indexes = baseFlatten(arguments, false, false, 1);
-    return createWrapper(func, REARG_FLAG, null, null, null, indexes);
-  }
+  var rearg = restParam(function(func, indexes) {
+    return createWrapper(func, REARG_FLAG, null, null, null, baseFlatten(indexes));
+  });
 
   return rearg;
 });

function/restParam.js

@@ -0,0 +1,61 @@
+define([], function() {
+
+  /** 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 nativeMax = Math.max;
+
+  /**
+   * 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).
+   *
+   * @static
+   * @memberOf _
+   * @category Function
+   * @param {Function} func The function to apply a rest parameter to.
+   * @param {number} [start=func.length-1] The start position of the rest parameter.
+   * @returns {Function} Returns the new function.
+   * @example
+   *
+   * var say = _.restParam(function(what, names) {
+   *   return what + ' ' + _.initial(names).join(', ') +
+   *     (_.size(names) > 1 ? ', & ' : '') + _.last(names);
+   * });
+   *
+   * say('hello', 'fred', 'barney', 'pebbles');
+   * // => 'hello fred, barney, & pebbles'
+   */
+  function restParam(func, start) {
+    if (typeof func != 'function') {
+      throw new TypeError(FUNC_ERROR_TEXT);
+    }
+    start = nativeMax(typeof start == 'undefined' ? (func.length - 1) : (+start || 0), 0);
+    return function() {
+      var args = arguments,
+          index = -1,
+          length = nativeMax(args.length - start, 0),
+          rest = Array(length);
+
+      while (++index < length) {
+        rest[index] = args[start + index];
+      }
+      switch (start) {
+        case 0: return func.call(this, rest);
+        case 1: return func.call(this, args[0], rest);
+        case 2: return func.call(this, args[0], args[1], rest);
+      }
+      var otherArgs = Array(start + 1);
+      index = -1;
+      while (++index < start) {
+        otherArgs[index] = args[index];
+      }
+      otherArgs[start] = rest;
+      return func.apply(this, otherArgs);
+    };
+  }
+
+  return restParam;
+});

function/spread.js

@@ -4,23 +4,24 @@ define([], function() {
   var FUNC_ERROR_TEXT = 'Expected a function';
 
   /**
-   * Creates a function that invokes `func` with the `this` binding of the
-   * created function and the array of arguments provided to the created
-   * function much like [Function#apply](http://es5.github.io/#x15.3.4.3).
+   * 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).
    *
    * @static
    * @memberOf _
    * @category Function
    * @param {Function} func The function to spread arguments over.
-   * @returns {*} Returns the new function.
+   * @returns {Function} Returns the new function.
    * @example
    *
-   * var spread = _.spread(function(who, what) {
+   * var say = _.spread(function(who, what) {
    *   return who + ' says ' + what;
    * });
    *
-   * spread(['Fred', 'hello']);
-   * // => 'Fred says hello'
+   * say(['fred', 'hello']);
+   * // => 'fred says hello'
    *
    * // with a Promise
    * var numbers = Promise.all([

function/throttle.js

@@ -29,7 +29,7 @@ define(['./debounce', '../lang/isObject'], function(debounce, isObject) {
    * @memberOf _
    * @category Function
    * @param {Function} func The function to throttle.
-   * @param {number} wait The number of milliseconds to throttle invocations to.
+   * @param {number} [wait=0] The number of milliseconds to throttle invocations to.
    * @param {Object} [options] The options object.
    * @param {boolean} [options.leading=true] Specify invoking on the leading
    *  edge of the timeout.

internal/arrayEach.js

@@ -2,7 +2,7 @@ define([], function() {
 
   /**
    * A specialized version of `_.forEach` for arrays without support for callback
-   * shorthands or `this` binding.
+   * shorthands and `this` binding.
    *
    * @private
    * @param {Array} array The array to iterate over.

internal/arrayEachRight.js

@@ -2,7 +2,7 @@ define([], function() {
 
   /**
    * A specialized version of `_.forEachRight` for arrays without support for
-   * callback shorthands or `this` binding.
+   * callback shorthands and `this` binding.
    *
    * @private
    * @param {Array} array The array to iterate over.

internal/arrayEvery.js

@@ -2,7 +2,7 @@ define([], function() {
 
   /**
    * A specialized version of `_.every` for arrays without support for callback
-   * shorthands or `this` binding.
+   * shorthands and `this` binding.
    *
    * @private
    * @param {Array} array The array to iterate over.

internal/arrayFilter.js

@@ -2,7 +2,7 @@ define([], function() {
 
   /**
    * A specialized version of `_.filter` for arrays without support for callback
-   * shorthands or `this` binding.
+   * shorthands and `this` binding.
    *
    * @private
    * @param {Array} array The array to iterate over.

internal/arrayMap.js

@@ -2,7 +2,7 @@ define([], function() {
 
   /**
    * A specialized version of `_.map` for arrays without support for callback
-   * shorthands or `this` binding.
+   * shorthands and `this` binding.
    *
    * @private
    * @param {Array} array The array to iterate over.

internal/arrayReduce.js

@@ -2,7 +2,7 @@ define([], function() {
 
   /**
    * A specialized version of `_.reduce` for arrays without support for callback
-   * shorthands or `this` binding.
+   * shorthands and `this` binding.
    *
    * @private
    * @param {Array} array The array to iterate over.

internal/arrayReduceRight.js

@@ -2,7 +2,7 @@ define([], function() {
 
   /**
    * A specialized version of `_.reduceRight` for arrays without support for
-   * callback shorthands or `this` binding.
+   * callback shorthands and `this` binding.
    *
    * @private
    * @param {Array} array The array to iterate over.

internal/arraySome.js

@@ -2,7 +2,7 @@ define([], function() {
 
   /**
    * A specialized version of `_.some` for arrays without support for callback
-   * shorthands or `this` binding.
+   * shorthands and `this` binding.
    *
    * @private
    * @param {Array} array The array to iterate over.

internal/arraySum.js

@@ -0,0 +1,21 @@
+define([], function() {
+
+  /**
+   * A specialized version of `_.sum` for arrays without support for iteratees.
+   *
+   * @private
+   * @param {Array} array The array to iterate over.
+   * @returns {number} Returns the sum.
+   */
+  function arraySum(array) {
+    var length = array.length,
+        result = 0;
+
+    while (length--) {
+      result += +array[length] || 0;
+    }
+    return result;
+  }
+
+  return arraySum;
+});

internal/baseAssign.js

@@ -23,7 +23,7 @@ define(['./baseCopy', '../object/keys'], function(baseCopy, keys) {
           value = object[key],
           result = customizer(value, source[key], key, object, source);
 
-      if ((result === result ? result !== value : value === value) ||
+      if ((result === result ? (result !== value) : (value === value)) ||
           (typeof value == 'undefined' && !(key in object))) {
         object[key] = result;
       }

internal/baseBindAll.js

@@ -1,27 +0,0 @@
-define(['./createWrapper'], function(createWrapper) {
-
-  /** Used to compose bitmasks for wrapper metadata. */
-  var BIND_FLAG = 1;
-
-  /**
-   * The base implementation of `_.bindAll` without support for individual
-   * method name arguments.
-   *
-   * @private
-   * @param {Object} object The object to bind and assign the bound methods to.
-   * @param {string[]} methodNames The object method names to bind.
-   * @returns {Object} Returns `object`.
-   */
-  function baseBindAll(object, methodNames) {
-    var index = -1,
-        length = methodNames.length;
-
-    while (++index < length) {
-      var key = methodNames[index];
-      object[key] = createWrapper(object[key], BIND_FLAG, object);
-    }
-    return object;
-  }
-
-  return baseBindAll;
-});

internal/baseCallback.js

@@ -1,4 +1,4 @@
-define(['./baseMatches', './baseMatchesProperty', './baseProperty', './bindCallback', '../utility/identity', './isBindable'], function(baseMatches, baseMatchesProperty, baseProperty, bindCallback, identity, isBindable) {
+define(['./baseMatches', './baseMatchesProperty', './baseProperty', './bindCallback', '../utility/identity'], function(baseMatches, baseMatchesProperty, baseProperty, bindCallback, identity) {
 
   /**
    * The base implementation of `_.callback` which supports specifying the
@@ -13,9 +13,9 @@ define(['./baseMatches', './baseMatchesProperty', './baseProperty', './bindCallb
   function baseCallback(func, thisArg, argCount) {
     var type = typeof func;
     if (type == 'function') {
-      return (typeof thisArg != 'undefined' && isBindable(func))
-        ? bindCallback(func, thisArg, argCount)
-        : func;
+      return typeof thisArg == 'undefined'
+        ? func
+        : bindCallback(func, thisArg, argCount);
     }
     if (func == null) {
       return identity;

internal/baseClone.js

@@ -45,9 +45,8 @@ define(['./arrayCopy', './arrayEach', './baseCopy', './baseForOwn', './initClone
   var objectProto = Object.prototype;
 
   /**
-   * Used to resolve the `toStringTag` of values.
-   * See the [ES spec](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-object.prototype.tostring)
-   * for more details.
+   * Used to resolve the [`toStringTag`](https://people.mozilla.org/~jorendorff/es6-draft.html#sec-object.prototype.tostring)
+   * of values.
    */
   var objToString = objectProto.toString;
 

internal/baseDelay.js

@@ -1,4 +1,4 @@
-define(['./baseSlice'], function(baseSlice) {
+define([], function() {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;
@@ -13,14 +13,14 @@ define(['./baseSlice'], function(baseSlice) {
    * @private
    * @param {Function} func The function to delay.
    * @param {number} wait The number of milliseconds to delay invocation.
-   * @param {Object} args The `arguments` object to slice and provide to `func`.
+   * @param {Object} args The arguments provide to `func`.
    * @returns {number} Returns the timer id.
    */
-  function baseDelay(func, wait, args, fromIndex) {
+  function baseDelay(func, wait, args) {
     if (typeof func != 'function') {
       throw new TypeError(FUNC_ERROR_TEXT);
     }
-    return setTimeout(function() { func.apply(undefined, baseSlice(args, fromIndex)); }, wait);
+    return setTimeout(function() { func.apply(undefined, args); }, wait);
   }
 
   return baseDelay;

internal/baseDifference.js

@@ -19,7 +19,7 @@ define(['./baseIndexOf', './cacheIndexOf', './createCache'], function(baseIndexO
     var index = -1,
         indexOf = baseIndexOf,
         isCommon = true,
-        cache = isCommon && values.length >= 200 && createCache(values),
+        cache = (isCommon && values.length >= 200) ? createCache(values) : null,
         valuesLength = values.length;
 
     if (cache) {
@@ -40,7 +40,7 @@ define(['./baseIndexOf', './cacheIndexOf', './createCache'], function(baseIndexO
         }
         result.push(value);
       }
-      else if (indexOf(values, value) < 0) {
+      else if (indexOf(values, value, 0) < 0) {
         result.push(value);
       }
     }

internal/baseEach.js

@@ -1,4 +1,4 @@
-define(['./baseForOwn', './isLength', './toObject'], function(baseForOwn, isLength, toObject) {
+define(['./baseForOwn', './createBaseEach'], function(baseForOwn, createBaseEach) {
 
   /**
    * The base implementation of `_.forEach` without support for callback
@@ -9,21 +9,7 @@ define(['./baseForOwn', './isLength', './toObject'], function(baseForOwn, isLeng
    * @param {Function} iteratee The function invoked per iteration.
    * @returns {Array|Object|string} Returns `collection`.
    */
-  function baseEach(collection, iteratee) {
-    var length = collection ? collection.length : 0;
-    if (!isLength(length)) {
-      return baseForOwn(collection, iteratee);
-    }
-    var index = -1,
-        iterable = toObject(collection);
-
-    while (++index < length) {
-      if (iteratee(iterable[index], index, iterable) === false) {
-        break;
-      }
-    }
-    return collection;
-  }
+  var baseEach = createBaseEach(baseForOwn);
 
   return baseEach;
 });

internal/baseEachRight.js

@@ -1,4 +1,4 @@
-define(['./baseForOwnRight', './isLength', './toObject'], function(baseForOwnRight, isLength, toObject) {
+define(['./baseForOwnRight', './createBaseEach'], function(baseForOwnRight, createBaseEach) {
 
   /**
    * The base implementation of `_.forEachRight` without support for callback
@@ -9,19 +9,7 @@ define(['./baseForOwnRight', './isLength', './toObject'], function(baseForOwnRig
    * @param {Function} iteratee The function invoked per iteration.
    * @returns {Array|Object|string} Returns `collection`.
    */
-  function baseEachRight(collection, iteratee) {
-    var length = collection ? collection.length : 0;
-    if (!isLength(length)) {
-      return baseForOwnRight(collection, iteratee);
-    }
-    var iterable = toObject(collection);
-    while (length--) {
-      if (iteratee(iterable[length], length, iterable) === false) {
-        break;
-      }
-    }
-    return collection;
-  }
+  var baseEachRight = createBaseEach(baseForOwnRight, true);
 
   return baseEachRight;
 });

internal/baseEvery.js

@@ -2,7 +2,7 @@ define(['./baseEach'], function(baseEach) {
 
   /**
    * The base implementation of `_.every` without support for callback
-   * shorthands or `this` binding.
+   * shorthands and `this` binding.
    *
    * @private
    * @param {Array|Object|string} collection The collection to iterate over.

internal/baseFill.js

@@ -21,7 +21,7 @@ define([], function() {
     if (end < 0) {
       end += length;
     }
-    length = start > end ? 0 : end >>> 0;
+    length = start > end ? 0 : (end >>> 0);
     start >>>= 0;
 
     while (start < length) {

internal/baseFilter.js

@@ -2,7 +2,7 @@ define(['./baseEach'], function(baseEach) {
 
   /**
    * The base implementation of `_.filter` without support for callback
-   * shorthands or `this` binding.
+   * shorthands and `this` binding.
    *
    * @private
    * @param {Array|Object|string} collection The collection to iterate over.

internal/baseFindIndex.js

@@ -0,0 +1,26 @@
+define([], function() {
+
+  /**
+   * The base implementation of `_.findIndex` and `_.findLastIndex` without
+   * support for callback shorthands and `this` binding.
+   *
+   * @private
+   * @param {Array} array The array to search.
+   * @param {Function} predicate The function invoked per iteration.
+   * @param {boolean} [fromRight] Specify iterating from right to left.
+   * @returns {number} Returns the index of the matched value, else `-1`.
+   */
+  function baseFindIndex(array, predicate, fromRight) {
+    var length = array.length,
+        index = fromRight ? length : -1;
+
+    while ((fromRight ? index-- : ++index < length)) {
+      if (predicate(array[index], index, array)) {
+        return index;
+      }
+    }
+    return -1;
+  }
+
+  return baseFindIndex;
+});

internal/baseFlatten.js

@@ -6,13 +6,12 @@ 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 {number} [fromIndex=0] The index to start from.
+   * @param {boolean} isDeep Specify a deep flatten.
+   * @param {boolean} isStrict Restrict flattening to arrays and `arguments` objects.
    * @returns {Array} Returns the new flattened array.
    */
-  function baseFlatten(array, isDeep, isStrict, fromIndex) {
-    var index = (fromIndex || 0) - 1,
+  function baseFlatten(array, isDeep, isStrict) {
+    var index = -1,
         length = array.length,
         resIndex = -1,
         result = [];

internal/baseFor.js

@@ -1,4 +1,4 @@
-define(['./toObject'], function(toObject) {
+define(['./createBaseFor'], function(createBaseFor) {
 
   /**
    * The base implementation of `baseForIn` and `baseForOwn` which iterates
@@ -12,20 +12,7 @@ define(['./toObject'], function(toObject) {
    * @param {Function} keysFunc The function to get the keys of `object`.
    * @returns {Object} Returns `object`.
    */
-  function baseFor(object, iteratee, keysFunc) {
-    var index = -1,
-        iterable = toObject(object),
-        props = keysFunc(object),
-        length = props.length;
-
-    while (++index < length) {
-      var key = props[index];
-      if (iteratee(iterable[key], key, iterable) === false) {
-        break;
-      }
-    }
-    return object;
-  }
+  var baseFor = createBaseFor();
 
   return baseFor;
 });

internal/baseForRight.js

@@ -1,4 +1,4 @@
-define(['./toObject'], function(toObject) {
+define(['./createBaseFor'], function(createBaseFor) {
 
   /**
    * This function is like `baseFor` except that it iterates over properties
@@ -10,19 +10,7 @@ define(['./toObject'], function(toObject) {
    * @param {Function} keysFunc The function to get the keys of `object`.
    * @returns {Object} Returns `object`.
    */
-  function baseForRight(object, iteratee, keysFunc) {
-    var iterable = toObject(object),
-        props = keysFunc(object),
-        length = props.length;
-
-    while (length--) {
-      var key = props[length];
-      if (iteratee(iterable[key], key, iterable) === false) {
-        break;
-      }
-    }
-    return object;
-  }
+  var baseForRight = createBaseFor(true);
 
   return baseForRight;
 });

internal/baseIndexOf.js

@@ -6,14 +6,14 @@ define(['./indexOfNaN'], function(indexOfNaN) {
    * @private
    * @param {Array} array The array to search.
    * @param {*} value The value to search for.
-   * @param {number} [fromIndex=0] The index to search from.
+   * @param {number} fromIndex The index to search from.
    * @returns {number} Returns the index of the matched value, else `-1`.
    */
   function baseIndexOf(array, value, fromIndex) {
     if (value !== value) {
       return indexOfNaN(array, fromIndex);
     }
-    var index = (fromIndex || 0) - 1,
+    var index = fromIndex - 1,
         length = array.length;
 
     while (++index < length) {

internal/baseInvoke.js

@@ -1,31 +0,0 @@
-define(['./baseEach', './isLength'], function(baseEach, isLength) {
-
-  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
-  var undefined;
-
-  /**
-   * The base implementation of `_.invoke` which requires additional arguments
-   * to be provided as an array of arguments rather than individually.
-   *
-   * @private
-   * @param {Array|Object|string} collection The collection to iterate over.
-   * @param {Function|string} methodName The name of the method to invoke or
-   *  the function invoked per iteration.
-   * @param {Array} [args] The arguments to invoke the method with.
-   * @returns {Array} Returns the array of results.
-   */
-  function baseInvoke(collection, methodName, args) {
-    var index = -1,
-        isFunc = typeof methodName == 'function',
-        length = collection ? collection.length : 0,
-        result = isLength(length) ? Array(length) : [];
-
-    baseEach(collection, function(value) {
-      var func = isFunc ? methodName : (value != null && value[methodName]);
-      result[++index] = func ? func.apply(value, args) : undefined;
-    });
-    return result;
-  }
-
-  return baseInvoke;
-});