Bump to v3.4.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.4.0
 
 The [modern build](https://github.com/lodash/lodash/wiki/Build-Differences) of [lodash](https://lodash.com/) exported as [Node.js](http://nodejs.org/)/[io.js](https://iojs.org/) modules.
 
@@ -24,11 +24,11 @@ In Node.js/io.js:
 var _ = require('lodash');
 // or a method category
 var array = require('lodash/array');
-// or a method (works great with browserify/webpack to create smaller builds)
+// or a method (great for smaller builds with browserify/webpack)
 var chunk = require('lodash/array/chunk');
 ```
 
-See the [package source](https://github.com/lodash/lodash/tree/3.3.0-npm) for more details.
+See the [package source](https://github.com/lodash/lodash/tree/3.4.0-npm) for more details.
 
 **Note:**<br>
 Don’t assign values to the [special variable](http://nodejs.org/api/repl.html#repl_repl_features) `_` when in the REPL.<br>
@@ -39,8 +39,8 @@ Install [n_](https://www.npmjs.com/package/n_) for a REPL that includes lodash b
 lodash is also available in a variety of other builds & module formats.
 
  * npm packages for [modern](https://www.npmjs.com/package/lodash), [compatibility](https://www.npmjs.com/package/lodash-compat), & [per method](https://www.npmjs.com/browse/keyword/lodash-modularized) builds
- * AMD modules for [modern](https://github.com/lodash/lodash/tree/3.3.0-amd) & [compatibility](https://github.com/lodash/lodash-compat/tree/3.3.0-amd) builds
- * ES modules for the [modern](https://github.com/lodash/lodash/tree/3.3.0-es) build
+ * AMD modules for [modern](https://github.com/lodash/lodash/tree/3.4.0-amd) & [compatibility](https://github.com/lodash/lodash-compat/tree/3.4.0-amd) builds
+ * ES modules for the [modern](https://github.com/lodash/lodash/tree/3.4.0-es) build
 
 ## Further Reading
 
@@ -57,6 +57,7 @@ lodash is also available in a variety of other builds & module formats.
  * Follows [semantic versioning](http://semver.org/) for releases
  * [Lazily evaluated](http://filimanjaro.com/blog/2014/introducing-lazy-evaluation/) chaining
  * [_(…)](https://lodash.com/docs#_) supports intuitive chaining
+ * [_.add](https://lodash.com/docs#add) for mathematical composition
  * [_.ary](https://lodash.com/docs#ary) & [_.rearg](https://lodash.com/docs#rearg) to change function argument limits & order
  * [_.at](https://lodash.com/docs#at) for cherry-picking collection values
  * [_.attempt](https://lodash.com/docs#attempt) to execute functions which may error without a try-catch
@@ -74,7 +75,6 @@ lodash is also available in a variety of other builds & module formats.
  * [_.forEach](https://lodash.com/docs#forEach) supports exiting early
  * [_.forIn](https://lodash.com/docs#forIn) for iterating all enumerable properties
  * [_.forOwn](https://lodash.com/docs#forOwn) for iterating own properties
- * [_.includes](https://lodash.com/docs#includes) accepts a `fromIndex`
  * [_.inRange](https://lodash.com/docs#inRange) for checking whether a number is within a given range
  * [_.isNative](https://lodash.com/docs#isNative) to check for native functions
  * [_.isPlainObject](https://lodash.com/docs#isPlainObject) & [_.toPlainObject](https://lodash.com/docs#toPlainObject) to check for & convert to `Object` objects
@@ -87,8 +87,9 @@ lodash is also available in a variety of other builds & module formats.
  * [_.random](https://lodash.com/docs#random) supports returning floating-point numbers
  * [_.runInContext](https://lodash.com/docs#runInContext) for collisionless mixins & easier mocking
  * [_.slice](https://lodash.com/docs#slice) for creating subsets of array-like values
- * [_.sortByAll](https://lodash.com/docs#sortBy) for sorting by multiple properties
+ * [_.sortByAll](https://lodash.com/docs#sortByAll) & [_.sortByOrder](https://lodash.com/docs#sortByOrder) for sorting by multiple properties & orders
  * [_.spread](https://lodash.com/docs#spread) for creating a function to spread an array of arguments to another
+ * [_.sum](https://lodash.com/docs#sum) to get the sum of values
  * [_.support](https://lodash.com/docs#support) for flagging environment features
  * [_.template](https://lodash.com/docs#template) supports [*“imports”*](https://lodash.com/docs#templateSettings-imports) options & [ES template delimiters](http://people.mozilla.org/~jorendorff/es6-draft.html#sec-template-literal-lexical-components)
  * [_.transform](https://lodash.com/docs#transform) as a powerful alternative to [_.reduce](https://lodash.com/docs#reduce) for transforming objects
@@ -111,6 +112,5 @@ lodash is also available in a variety of other builds & module formats.
 
 ## Support
 
-Tested in Chrome 39-40, Firefox 34-35, IE 6-11, Opera 26-27, Safari 5-8, io.js 1.2.0, Node.js 0.8.28, 0.10.36, & 0.12.0, PhantomJS 1.9.8, RingoJS 0.11, & Rhino 1.7RC5.
-
+Tested in Chrome 40-41, Firefox 35-36, IE 6-11, Opera 26-27, Safari 5-8, io.js 1.4.3, Node.js 0.8.28, 0.10.36, & 0.12.0, PhantomJS 1.9.8, RingoJS 0.11, & Rhino 1.7RC5.
 Automated [browser](https://saucelabs.com/u/lodash) & [CI](https://travis-ci.org/lodash/lodash/) test runs are available. Special thanks to [Sauce Labs](https://saucelabs.com/) for providing automated browser testing.

array/difference.js

@@ -24,16 +24,17 @@ var baseDifference = require('../internal/baseDifference'),
  * // => [1, 3]
  */
 function difference() {
-  var index = -1,
-      length = arguments.length;
+  var args = arguments,
+      index = -1,
+      length = args.length;
 
   while (++index < length) {
-    var value = arguments[index];
+    var value = args[index];
     if (isArray(value) || isArguments(value)) {
       break;
     }
   }
-  return baseDifference(value, baseFlatten(arguments, false, true, ++index));
+  return baseDifference(value, baseFlatten(args, false, true, ++index));
 }
 
 module.exports = difference;

array/dropRightWhile.js

@@ -39,7 +39,7 @@ var baseCallback = require('../internal/baseCallback'),
  * ];
  *
  * // 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

array/findLastIndex.js

@@ -37,12 +37,12 @@ var baseCallback = require('../internal/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');

array/flatten.js

@@ -26,7 +26,7 @@ function flatten(array, isDeep, guard) {
   if (guard && isIterateeCall(array, isDeep, guard)) {
     isDeep = false;
   }
-  return length ? baseFlatten(array, isDeep) : [];
+  return length ? baseFlatten(array, isDeep, false, 0) : [];
 }
 
 module.exports = flatten;

array/flattenDeep.js

@@ -15,7 +15,7 @@ var baseFlatten = require('../internal/baseFlatten');
  */
 function flattenDeep(array) {
   var length = array ? array.length : 0;
-  return length ? baseFlatten(array, true) : [];
+  return length ? baseFlatten(array, true, false, 0) : [];
 }
 
 module.exports = flattenDeep;

array/indexOf.js

@@ -26,7 +26,7 @@ var nativeMax = Math.max;
  * @example
  *
  * _.indexOf([1, 2, 1, 2], 2);
- * // => 2
+ * // => 1
  *
  * // using `fromIndex`
  * _.indexOf([1, 2, 1, 2], 2, 2);
@@ -42,14 +42,14 @@ function indexOf(array, value, fromIndex) {
     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;
   }
-  return baseIndexOf(array, value, fromIndex);
+  return baseIndexOf(array, value, fromIndex || 0);
 }
 
 module.exports = indexOf;

array/intersection.js

@@ -34,7 +34,7 @@ function intersection() {
     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;
@@ -47,11 +47,11 @@ function intersection() {
   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/pull.js

@@ -31,17 +31,19 @@ var splice = arrayProto.splice;
  * // => [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/union.js

@@ -21,7 +21,7 @@ var baseFlatten = require('../internal/baseFlatten'),
  * // => [1, 2, 4]
  */
 function union() {
-  return baseUniq(baseFlatten(arguments, false, true));
+  return baseUniq(baseFlatten(arguments, false, true, 0));
 }
 
 module.exports = union;

chain/lodash.js

@@ -49,26 +49,26 @@ var hasOwnProperty = objectProto.hasOwnProperty;
  * `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.

collection.js

@@ -24,8 +24,8 @@ module.exports = {
   'inject': require('./collection/inject'),
   'invoke': require('./collection/invoke'),
   'map': require('./collection/map'),
-  'max': require('./collection/max'),
-  'min': require('./collection/min'),
+  'max': require('./math/max'),
+  'min': require('./math/min'),
   'partition': require('./collection/partition'),
   'pluck': require('./collection/pluck'),
   'reduce': require('./collection/reduce'),
@@ -38,5 +38,7 @@ module.exports = {
   'some': require('./collection/some'),
   'sortBy': require('./collection/sortBy'),
   'sortByAll': require('./collection/sortByAll'),
+  'sortByOrder': require('./collection/sortByOrder'),
+  'sum': require('./math/sum'),
   'where': require('./collection/where')
 };

collection/max.js

@@ -1,53 +1 @@
-var arrayMax = require('../internal/arrayMax'),
-    createExtremum = require('../internal/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);
-
-module.exports = max;
+module.exports = require('../math/max');

collection/min.js

@@ -1,53 +1 @@
-var arrayMin = require('../internal/arrayMin'),
-    createExtremum = require('../internal/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);
-
-module.exports = min;
+module.exports = require('../math/min');

collection/partition.js

@@ -35,7 +35,7 @@ var createAggregator = require('../internal/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/size.js

@@ -2,8 +2,8 @@ var isLength = require('../internal/isLength'),
     keys = require('../object/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

@@ -41,7 +41,7 @@ var arraySome = require('../internal/arraySome'),
  * ];
  *
  * // using the `_.matches` callback shorthand
- * _.some(users, { user': 'barney', 'active': false });
+ * _.some(users, { 'user': 'barney', 'active': false });
  * // => false
  *
  * // using the `_.matchesProperty` callback shorthand

collection/sortBy.js

@@ -55,8 +55,11 @@ var baseCallback = require('../internal/baseCallback'),
  * // => ['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,9 +1,6 @@
-var baseEach = require('../internal/baseEach'),
-    baseFlatten = require('../internal/baseFlatten'),
-    baseSortBy = require('../internal/baseSortBy'),
-    compareMultipleAscending = require('../internal/compareMultipleAscending'),
-    isIterateeCall = require('../internal/isIterateeCall'),
-    isLength = require('../internal/isLength');
+var baseFlatten = require('../internal/baseFlatten'),
+    baseSortByOrder = require('../internal/baseSortByOrder'),
+    isIterateeCall = require('../internal/isIterateeCall');
 
 /**
  * This method is like `_.sortBy` except that it sorts by property names
@@ -29,25 +26,16 @@ var baseEach = require('../internal/baseEach'),
  * // => [['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])) {
+  if (collection == null) {
+    return [];
+  }
+  var args = arguments,
+      guard = args[3];
+
+  if (guard && isIterateeCall(args[1], args[2], guard)) {
     args = [collection, args[1]];
   }
-  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);
+  return baseSortByOrder(collection, baseFlatten(args, false, false, 1), []);
 }
 
 module.exports = sortByAll;

collection/sortByOrder.js

@@ -0,0 +1,47 @@
+var baseSortByOrder = require('../internal/baseSortByOrder'),
+    isArray = require('../lang/isArray'),
+    isIterateeCall = require('../internal/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`.
+ * @returns {Array} Returns the new sorted array.
+ * @example
+ *
+ * var users = [
+ *   { 'user': 'barney', 'age': 36 },
+ *   { 'user': 'fred',   'age': 40 },
+ *   { 'user': 'barney', 'age': 26 },
+ *   { '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);
+}
+
+module.exports = sortByOrder;

collection/sum.js

@@ -0,0 +1 @@
+module.exports = require('../math/sum');

function/debounce.js

@@ -26,7 +26,7 @@ var nativeMax = Math.max;
  * @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.
@@ -84,7 +84,7 @@ function debounce(func, wait, options) {
   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/flow.js

@@ -1,8 +1,4 @@
-var arrayEvery = require('../internal/arrayEvery'),
-    baseIsFunction = require('../internal/baseIsFunction');
-
-/** Used as the `TypeError` message for "Functions" methods. */
-var FUNC_ERROR_TEXT = 'Expected a function';
+var createComposer = require('../internal/createComposer');
 
 /**
  * Creates a function that returns the result of invoking the provided
@@ -16,37 +12,14 @@ var FUNC_ERROR_TEXT = 'Expected a function';
  * @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 = createComposer();
 
 module.exports = flow;

function/flowRight.js

@@ -1,8 +1,4 @@
-var arrayEvery = require('../internal/arrayEvery'),
-    baseIsFunction = require('../internal/baseIsFunction');
-
-/** Used as the `TypeError` message for "Functions" methods. */
-var FUNC_ERROR_TEXT = 'Expected a function';
+var createComposer = require('../internal/createComposer');
 
 /**
  * This method is like `_.flow` except that it creates a function that
@@ -16,37 +12,14 @@ var FUNC_ERROR_TEXT = 'Expected a function';
  * @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 = createComposer(true);
 
 module.exports = flowRight;

function/memoize.js

@@ -61,13 +61,14 @@ function memoize(func, resolver) {
     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/throttle.js

@@ -30,7 +30,7 @@ var debounceOptions = {
  * @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/baseDifference.js

@@ -21,7 +21,7 @@ function baseDifference(array, values) {
   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) {
@@ -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 @@ var isArguments = require('../lang/isArguments'),
  *
  * @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 @@ var indexOfNaN = require('./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 @@
+var baseEach = require('./baseEach'),
+    baseSortBy = require('./baseSortBy'),
+    compareMultiple = require('./compareMultiple'),
+    isLength = require('./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);
+  });
+}
+
+module.exports = baseSortByOrder;

internal/baseUniq.js

@@ -17,7 +17,7 @@ function baseUniq(array, iteratee) {
       length = array.length,
       isCommon = true,
       isLarge = isCommon && length >= 200,
-      seen = isLarge && createCache(),
+      seen = isLarge ? createCache() : null,
       result = [];
 
   if (seen) {
@@ -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 @@
 var baseCompareAscending = require('./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;
 }
 
-module.exports = compareMultipleAscending;
+module.exports = compareMultiple;

internal/createAssigner.js

@@ -11,24 +11,31 @@ var bindCallback = require('./bindCallback'),
  */
 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;
+    };
+  };
+}
+
+module.exports = 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/isIterateeCall.js

@@ -22,8 +22,11 @@ function isIterateeCall(value, index, object) {
   } else {
     prereq = type == 'string' && index in object;
   }
-  var other = object[index];
-  return prereq && (value === value ? value === other : other !== other);
+  if (prereq) {
+    var other = object[index];
+    return value === value ? value === other : other !== other;
+  }
+  return false;
 }
 
 module.exports = isIterateeCall;

internal/lazyValue.js

@@ -3,8 +3,9 @@ var baseWrapperValue = require('./baseWrapperValue'),
     isArray = require('../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;
         }
       }
     }

lang/isEmpty.js

@@ -7,7 +7,7 @@ var isArguments = require('./isArguments'),
     keys = require('../object/keys');
 
 /**
- * Checks if a value is empty. A value is considered empty unless it is an
+ * Checks if `value` is empty. A value is considered empty unless it is an
  * `arguments` object, array, string, or jQuery-like collection with a length
  * greater than `0` or an object with own enumerable properties.
  *

math.js

@@ -0,0 +1,6 @@
+module.exports = {
+  'add': require('./math/add'),
+  'max': require('./math/max'),
+  'min': require('./math/min'),
+  'sum': require('./math/sum')
+};

math/add.js

@@ -0,0 +1,19 @@
+/**
+ * Adds two numbers.
+ *
+ * @static
+ * @memberOf _
+ * @category Math
+ * @param {number} augend The first number to add.
+ * @param {number} addend The second number to add.
+ * @returns {number} Returns the sum.
+ * @example
+ *
+ * _.add(6, 4);
+ * // => 10
+ */
+function add(augend, addend) {
+  return augend + addend;
+}
+
+module.exports = add;

math/max.js

@@ -0,0 +1,53 @@
+var arrayMax = require('../internal/arrayMax'),
+    createExtremum = require('../internal/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 Math
+ * @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);
+
+module.exports = max;

math/min.js

@@ -0,0 +1,53 @@
+var arrayMin = require('../internal/arrayMin'),
+    createExtremum = require('../internal/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 Math
+ * @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);
+
+module.exports = min;

math/sum.js

@@ -0,0 +1,33 @@
+var isArray = require('../lang/isArray'),
+    toIterable = require('../internal/toIterable');
+
+/**
+ * Gets the sum of the values in `collection`.
+ *
+ * @static
+ * @memberOf _
+ * @category Math
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @returns {number} Returns the sum.
+ * @example
+ *
+ * _.sum([4, 6, 2]);
+ * // => 12
+ *
+ * _.sum({ 'a': 4, 'b': 6, 'c': 2 });
+ * // => 12
+ */
+function sum(collection) {
+  if (!isArray(collection)) {
+    collection = toIterable(collection);
+  }
+  var length = collection.length,
+      result = 0;
+
+  while (length--) {
+    result += +collection[length] || 0;
+  }
+  return result;
+}
+
+module.exports = sum;

number/inRange.js

@@ -1,6 +1,6 @@
 /**
  * Checks if `n` is between `start` and up to but not including, `end`. If
- * `end` is not specified it defaults to `start` with `start` becoming `0`.
+ * `end` is not specified it is set to `start` with `start` then set to `0`.
  *
  * @static
  * @memberOf _

object/defaults.js

@@ -5,7 +5,7 @@ var arrayCopy = require('../internal/arrayCopy'),
 /**
  * Assigns own enumerable properties of source object(s) to the destination
  * object for all destination properties that resolve to `undefined`. Once a
- * property is set, additional defaults of the same property are ignored.
+ * property is set, additional values of the same property are ignored.
  *
  * @static
  * @memberOf _

package.json

@@ -1,6 +1,6 @@
 {
   "name": "lodash",
-  "version": "3.3.0",
+  "version": "3.4.0",
   "description": "The modern build of lodash modular utilities.",
   "homepage": "https://lodash.com/",
   "icon": "https://lodash.com/icon.svg",

string/escape.js

@@ -6,7 +6,7 @@ var reUnescapedHtml = /[&<>"'`]/g,
     reHasUnescapedHtml = RegExp(reUnescapedHtml.source);
 
 /**
- * Converts the characters "&", "<", ">", '"', "'", and '`', in `string` to
+ * Converts the characters "&", "<", ">", '"', "'", and "\`", in `string` to
  * their corresponding HTML entities.
  *
  * **Note:** No other characters are escaped. To escape additional characters

string/template.js

@@ -111,10 +111,10 @@ var reUnescapedString = /['\n\r\u2028\u2029\\]/g;
  * var compiled = _.template('hi <%= data.user %>!', { 'variable': 'data' });
  * compiled.source;
  * // => function(data) {
- *   var __t, __p = '';
- *   __p += 'hi ' + ((__t = ( data.user )) == null ? '' : __t) + '!';
- *   return __p;
- * }
+ * //   var __t, __p = '';
+ * //   __p += 'hi ' + ((__t = ( data.user )) == null ? '' : __t) + '!';
+ * //   return __p;
+ * // }
  *
  * // using the `source` property to inline compiled templates for meaningful
  * // line numbers in error messages and a stack trace

string/words.js

@@ -6,7 +6,7 @@ var reWords = (function() {
   var upper = '[A-Z\\xc0-\\xd6\\xd8-\\xde]',
       lower = '[a-z\\xdf-\\xf6\\xf8-\\xff]+';
 
-  return RegExp(upper + '{2,}(?=' + upper + lower + ')|' + upper + '?' + lower + '|' + upper + '+|[0-9]+', 'g');
+  return RegExp(upper + '+(?=' + upper + lower + ')|' + upper + '?' + lower + '|' + upper + '+|[0-9]+', 'g');
 }());
 
 /**

utility/attempt.js

@@ -21,14 +21,14 @@ var isError = require('../lang/isError');
  * }
  */
 function attempt() {
-  var length = arguments.length,
-      func = arguments[0];
+  var func = arguments[0],
+      length = arguments.length,
+      args = Array(length ? length - 1 : 0);
 
+  while (--length > 0) {
+    args[length - 1] = arguments[length];
+  }
   try {
-    var args = Array(length ? length - 1 : 0);
-    while (--length > 0) {
-      args[length - 1] = arguments[length];
-    }
     return func.apply(undefined, args);
   } catch(e) {
     return isError(e) ? e : new Error(e);

utility/range.js

@@ -8,9 +8,9 @@ var nativeMax = Math.max;
 
 /**
  * Creates an array of numbers (positive and/or negative) progressing from
- * `start` up to, but not including, `end`. If `end` is not specified it
- * defaults to `start` with `start` becoming `0`. If `start` is less than
- * `end` a zero-length range is created unless a negative `step` is specified.
+ * `start` up to, but not including, `end`. If `end` is not specified it is
+ * set to `start` with `start` then set to `0`. If `start` is less than `end`
+ * a zero-length range is created unless a negative `step` is specified.
  *
  * @static
  * @memberOf _