Bump to v3.4.0.

internal/baseDifference.js

@@ -42,7 +42,7 @@ function baseDifference(array, values) {
       }
       result.push(value);
     }
-    else if (indexOf(values, value) < 0) {
+    else if (indexOf(values, value, 0) < 0) {
       result.push(value);
     }
   }

internal/baseFlatten.js

@@ -9,13 +9,13 @@ import isObjectLike from './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.
+ * @param {number} fromIndex The index to start from.
  * @returns {Array} Returns the new flattened array.
  */
 function baseFlatten(array, isDeep, isStrict, fromIndex) {
-  var index = (fromIndex || 0) - 1,
+  var index = fromIndex - 1,
       length = array.length,
       resIndex = -1,
       result = [];
@@ -26,7 +26,7 @@ function baseFlatten(array, isDeep, isStrict, fromIndex) {
     if (isObjectLike(value) && isLength(value.length) && (isArray(value) || isArguments(value))) {
       if (isDeep) {
         // Recursively flatten arrays (susceptible to call stack limits).
-        value = baseFlatten(value, isDeep, isStrict);
+        value = baseFlatten(value, isDeep, isStrict, 0);
       }
       var valIndex = -1,
           valLength = value.length;

internal/baseIndexOf.js

@@ -6,14 +6,14 @@ import indexOfNaN from './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/baseSortBy.js

@@ -1,6 +1,6 @@
 /**
- * The base implementation of `_.sortBy` and `_.sortByAll` which uses `comparer`
- * to define the sort order of `array` and replaces criteria objects with their
+ * The base implementation of `_.sortBy` which uses `comparer` to define
+ * the sort order of `array` and replaces criteria objects with their
  * corresponding values.
  *
  * @private

internal/baseSortByOrder.js

@@ -0,0 +1,35 @@
+import baseEach from './baseEach';
+import baseSortBy from './baseSortBy';
+import compareMultiple from './compareMultiple';
+import isLength from './isLength';
+
+/**
+ * The base implementation of `_.sortByOrder` without param guards.
+ *
+ * @private
+ * @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`.
+ * @returns {Array} Returns the new sorted array.
+ */
+function baseSortByOrder(collection, props, orders) {
+  var index = -1,
+      length = collection.length,
+      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, function(object, other) {
+    return compareMultiple(object, other, orders);
+  });
+}
+
+export default baseSortByOrder;

internal/baseUniq.js

@@ -44,7 +44,7 @@ function baseUniq(array, iteratee) {
       }
       result.push(value);
     }
-    else if (indexOf(seen, computed) < 0) {
+    else if (indexOf(seen, computed, 0) < 0) {
       if (iteratee || isLarge) {
         seen.push(computed);
       }

internal/compareMultiple.js

@@ -1,24 +1,34 @@
 import baseCompareAscending from './baseCompareAscending';
 
 /**
- * Used by `_.sortByAll` to compare multiple properties of each element
- * in a collection and stable sort them in ascending order.
+ * Used by `_.sortByOrder` to compare multiple properties of each element
+ * in a collection and stable sort them in the following order:
+ *
+ * If orders is unspecified, sort in ascending order for all properties.
+ * Otherwise, for each property, sort in ascending order if its corresponding value in
+ * orders is true, and descending order if false.
  *
  * @private
  * @param {Object} object The object to compare to `other`.
  * @param {Object} other The object to compare to `object`.
+ * @param {boolean[]} orders The order to sort by for each property.
  * @returns {number} Returns the sort order indicator for `object`.
  */
-function compareMultipleAscending(object, other) {
+function compareMultiple(object, other, orders) {
   var index = -1,
       objCriteria = object.criteria,
       othCriteria = other.criteria,
-      length = objCriteria.length;
+      length = objCriteria.length,
+      ordersLength = orders.length;
 
   while (++index < length) {
     var result = baseCompareAscending(objCriteria[index], othCriteria[index]);
     if (result) {
-      return result;
+      if (index >= ordersLength) {
+        return result;
+      } else {
+        return orders[index] ? result : result * -1;
+      }
     }
   }
   // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications
@@ -31,4 +41,4 @@ function compareMultipleAscending(object, other) {
   return object.index - other.index;
 }
 
-export default compareMultipleAscending;
+export default compareMultiple;

internal/createAssigner.js

@@ -11,24 +11,31 @@ import isIterateeCall from './isIterateeCall';
  */
 function createAssigner(assigner) {
   return function() {
-    var length = arguments.length,
-        object = arguments[0];
+    var args = arguments,
+        length = args.length,
+        object = args[0];
 
     if (length < 2 || object == null) {
       return object;
     }
-    if (length > 3 && isIterateeCall(arguments[1], arguments[2], arguments[3])) {
-      length = 2;
+    var customizer = args[length - 2],
+        thisArg = args[length - 1],
+        guard = args[3];
+
+    if (length > 3 && typeof customizer == 'function') {
+      customizer = bindCallback(customizer, thisArg, 5);
+      length -= 2;
+    } else {
+      customizer = (length > 2 && typeof thisArg == 'function') ? thisArg : null;
+      length -= (customizer ? 1 : 0);
     }
-    // Juggle arguments.
-    if (length > 3 && typeof arguments[length - 2] == 'function') {
-      var customizer = bindCallback(arguments[--length - 1], arguments[length--], 5);
-    } else if (length > 2 && typeof arguments[length - 1] == 'function') {
-      customizer = arguments[--length];
+    if (guard && isIterateeCall(args[1], args[2], guard)) {
+      customizer = length == 3 ? null : customizer;
+      length = 2;
     }
     var index = 0;
     while (++index < length) {
-      var source = arguments[index];
+      var source = args[index];
       if (source) {
         assigner(object, source, customizer);
       }

internal/createComposer.js

@@ -0,0 +1,39 @@
+/** Used as the `TypeError` message for "Functions" methods. */
+var FUNC_ERROR_TEXT = 'Expected a function';
+
+/**
+ * Creates a function to compose other functions into a single function.
+ *
+ * @private
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {Function} Returns the new composer function.
+ */
+function createComposer(fromRight) {
+  return function() {
+    var length = arguments.length,
+        index = length,
+        fromIndex = fromRight ? length - 1 : 0;
+
+    if (!length) {
+      return function() { return arguments[0]; };
+    }
+    var funcs = Array(length);
+    while (index--) {
+      funcs[index] = arguments[index];
+      if (typeof funcs[index] != 'function') {
+        throw new TypeError(FUNC_ERROR_TEXT);
+      }
+    }
+    return function() {
+      var index = fromIndex,
+          result = funcs[index].apply(this, arguments);
+
+      while ((fromRight ? index-- : ++index < length)) {
+        result = funcs[index].call(this, result);
+      }
+      return result;
+    };
+  };
+}
+
+export default createComposer;

internal/indexOfNaN.js

@@ -4,13 +4,13 @@
  *
  * @private
  * @param {Array} array The array to search.
- * @param {number} [fromIndex] The index to search from.
+ * @param {number} fromIndex The index to search from.
  * @param {boolean} [fromRight] Specify iterating from right to left.
  * @returns {number} Returns the index of the matched `NaN`, else `-1`.
  */
 function indexOfNaN(array, fromIndex, fromRight) {
   var length = array.length,
-      index = fromRight ? (fromIndex || length) : ((fromIndex || 0) - 1);
+      index = fromIndex + (fromRight ? 0 : -1);
 
   while ((fromRight ? index-- : ++index < length)) {
     var other = array[index];

internal/lazyValue.js

@@ -3,8 +3,9 @@ import getView from './getView';
 import isArray from '../lang/isArray';
 
 /** Used to indicate the type of lazy iteratees. */
-var LAZY_FILTER_FLAG = 0,
-    LAZY_MAP_FLAG = 1;
+var LAZY_DROP_WHILE_FLAG = 0,
+    LAZY_MAP_FLAG = 2,
+    LAZY_TAKE_WHILE_FLAG = 3;
 
 /* Native method references for those with the same name as other `lodash` methods. */
 var nativeMin = Math.min;
@@ -46,16 +47,22 @@ function lazyValue() {
     while (++iterIndex < iterLength) {
       var data = iteratees[iterIndex],
           iteratee = data.iteratee,
-          computed = iteratee(value, index, array),
           type = data.type;
 
+      if (type != LAZY_DROP_WHILE_FLAG) {
+        var computed = iteratee(value);
+      } else {
+        data.done = data.done && (isRight ? index < data.index : index > data.index);
+        data.index = index;
+        computed = data.done || (data.done = !iteratee(value));
+      }
       if (type == LAZY_MAP_FLAG) {
         value = computed;
       } else if (!computed) {
-        if (type == LAZY_FILTER_FLAG) {
-          continue outer;
-        } else {
+        if (type == LAZY_TAKE_WHILE_FLAG) {
           break outer;
+        } else {
+          continue outer;
         }
       }
     }

internal/root.js

@@ -4,24 +4,24 @@ var objectTypes = {
   'object': true
 };
 
-/**
- * Used as a reference to the global object.
- *
- * The `this` value is used if it is the global object to avoid Greasemonkey's
- * restricted `window` object, otherwise the `window` object is used.
- */
-var root = (objectTypes[typeof window] && window !== (this && this.window)) ? window : this;
-
 /** Detect free variable `exports`. */
 var freeExports = objectTypes[typeof exports] && exports && !exports.nodeType && exports;
 
 /** Detect free variable `module`. */
 var freeModule = objectTypes[typeof module] && module && !module.nodeType && module;
 
-/** Detect free variable `global` from Node.js or Browserified code and use it as `root`. */
+/** Detect free variable `global` from Node.js. */
 var freeGlobal = freeExports && freeModule && typeof global == 'object' && global;
-if (freeGlobal && (freeGlobal.global === freeGlobal || freeGlobal.window === freeGlobal || freeGlobal.self === freeGlobal)) {
-  root = freeGlobal;
-}
+
+/** Detect free variable `window`. */
+var freeWindow = objectTypes[typeof window] && window;
+
+/**
+ * Used as a reference to the global object.
+ *
+ * The `this` value is used if it is the global object to avoid Greasemonkey's
+ * restricted `window` object, otherwise the `window` object is used.
+ */
+var root = freeGlobal || ((freeWindow !== (this && this.window)) && freeWindow) || this;
 
 export default root;