Bump to v4.16.5.

LICENSE

@@ -1,4 +1,4 @@
-Copyright jQuery Foundation and other contributors <https://jquery.org/>
+Copyright JS Foundation and other contributors <https://js.foundation/>
 
 Based on Underscore.js, copyright Jeremy Ashkenas,
 DocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>

README.md

@@ -1,4 +1,4 @@
-# lodash-amd v4.16.4
+# lodash-amd v4.16.5
 
 The [Lodash](https://lodash.com/) library exported as [AMD](https://github.com/amdjs/amdjs-api/wiki/AMD) modules.
 
@@ -27,4 +27,4 @@ require({
 });
 ```
 
-See the [package source](https://github.com/lodash/lodash/tree/4.16.4-amd) for more details.
+See the [package source](https://github.com/lodash/lodash/tree/4.16.5-amd) for more details.

_Hash.js

@@ -9,7 +9,7 @@ define(['./_hashClear', './_hashDelete', './_hashGet', './_hashHas', './_hashSet
    */
   function Hash(entries) {
     var index = -1,
-        length = entries ? entries.length : 0;
+        length = entries == null ? 0 : entries.length;
 
     this.clear();
     while (++index < length) {

_ListCache.js

@@ -9,7 +9,7 @@ define(['./_listCacheClear', './_listCacheDelete', './_listCacheGet', './_listCa
    */
   function ListCache(entries) {
     var index = -1,
-        length = entries ? entries.length : 0;
+        length = entries == null ? 0 : entries.length;
 
     this.clear();
     while (++index < length) {

_MapCache.js

@@ -9,7 +9,7 @@ define(['./_mapCacheClear', './_mapCacheDelete', './_mapCacheGet', './_mapCacheH
    */
   function MapCache(entries) {
     var index = -1,
-        length = entries ? entries.length : 0;
+        length = entries == null ? 0 : entries.length;
 
     this.clear();
     while (++index < length) {

_SetCache.js

@@ -10,7 +10,7 @@ define(['./_MapCache', './_setCacheAdd', './_setCacheHas'], function(MapCache, s
    */
   function SetCache(values) {
     var index = -1,
-        length = values ? values.length : 0;
+        length = values == null ? 0 : values.length;
 
     this.__data__ = new MapCache;
     while (++index < length) {

_arrayAggregator.js

@@ -12,7 +12,7 @@ define([], function() {
    */
   function arrayAggregator(array, setter, iteratee, accumulator) {
     var index = -1,
-        length = array ? array.length : 0;
+        length = array == null ? 0 : array.length;
 
     while (++index < length) {
       var value = array[index];

_arrayEach.js

@@ -11,7 +11,7 @@ define([], function() {
    */
   function arrayEach(array, iteratee) {
     var index = -1,
-        length = array ? array.length : 0;
+        length = array == null ? 0 : array.length;
 
     while (++index < length) {
       if (iteratee(array[index], index, array) === false) {

_arrayEachRight.js

@@ -10,7 +10,7 @@ define([], function() {
    * @returns {Array} Returns `array`.
    */
   function arrayEachRight(array, iteratee) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
 
     while (length--) {
       if (iteratee(array[length], length, array) === false) {

_arrayEvery.js

@@ -12,7 +12,7 @@ define([], function() {
    */
   function arrayEvery(array, predicate) {
     var index = -1,
-        length = array ? array.length : 0;
+        length = array == null ? 0 : array.length;
 
     while (++index < length) {
       if (!predicate(array[index], index, array)) {

_arrayFilter.js

@@ -11,7 +11,7 @@ define([], function() {
    */
   function arrayFilter(array, predicate) {
     var index = -1,
-        length = array ? array.length : 0,
+        length = array == null ? 0 : array.length,
         resIndex = 0,
         result = [];
 

_arrayIncludes.js

@@ -10,7 +10,7 @@ define(['./_baseIndexOf'], function(baseIndexOf) {
    * @returns {boolean} Returns `true` if `target` is found, else `false`.
    */
   function arrayIncludes(array, value) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     return !!length && baseIndexOf(array, value, 0) > -1;
   }
 

_arrayIncludesWith.js

@@ -11,7 +11,7 @@ define([], function() {
    */
   function arrayIncludesWith(array, value, comparator) {
     var index = -1,
-        length = array ? array.length : 0;
+        length = array == null ? 0 : array.length;
 
     while (++index < length) {
       if (comparator(value, array[index])) {

_arrayMap.js

@@ -11,7 +11,7 @@ define([], function() {
    */
   function arrayMap(array, iteratee) {
     var index = -1,
-        length = array ? array.length : 0,
+        length = array == null ? 0 : array.length,
         result = Array(length);
 
     while (++index < length) {

_arrayReduce.js

@@ -14,7 +14,7 @@ define([], function() {
    */
   function arrayReduce(array, iteratee, accumulator, initAccum) {
     var index = -1,
-        length = array ? array.length : 0;
+        length = array == null ? 0 : array.length;
 
     if (initAccum && length) {
       accumulator = array[++index];

_arrayReduceRight.js

@@ -13,7 +13,7 @@ define([], function() {
    * @returns {*} Returns the accumulated value.
    */
   function arrayReduceRight(array, iteratee, accumulator, initAccum) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     if (initAccum && length) {
       accumulator = array[--length];
     }

_arraySome.js

@@ -12,7 +12,7 @@ define([], function() {
    */
   function arraySome(array, predicate) {
     var index = -1,
-        length = array ? array.length : 0;
+        length = array == null ? 0 : array.length;
 
     while (++index < length) {
       if (predicate(array[index], index, array)) {

_baseAt.js

@@ -13,12 +13,12 @@ define(['./get'], function(get) {
    */
   function baseAt(object, paths) {
     var index = -1,
-        isNil = object == null,
         length = paths.length,
-        result = Array(length);
+        result = Array(length),
+        skip = object == null;
 
     while (++index < length) {
-      result[index] = isNil ? undefined : get(object, paths[index]);
+      result[index] = skip ? undefined : get(object, paths[index]);
     }
     return result;
   }

_baseDifference.js

@@ -40,7 +40,7 @@ define(['./_SetCache', './_arrayIncludes', './_arrayIncludesWith', './_arrayMap'
     outer:
     while (++index < length) {
       var value = array[index],
-          computed = iteratee ? iteratee(value) : value;
+          computed = iteratee == null ? value : iteratee(value);
 
       value = (comparator || value !== 0) ? value : 0;
       if (isCommon && computed === computed) {

_baseGetTag.js

@@ -1,24 +1,30 @@
-define([], function() {
+define(['./_Symbol', './_getRawTag', './_objectToString'], function(Symbol, getRawTag, objectToString) {
 
-  /** Used for built-in method references. */
-  var objectProto = Object.prototype;
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
+
+  /** `Object#toString` result references. */
+  var nullTag = '[object Null]',
+      undefinedTag = '[object Undefined]';
+
+  /** Built-in value references. */
+  var symToStringTag = Symbol ? Symbol.toStringTag : undefined;
 
   /**
-   * Used to resolve the
-   * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
-   * of values.
-   */
-  var objectToString = objectProto.toString;
-
-  /**
-   * The base implementation of `getTag`.
+   * The base implementation of `getTag` without fallbacks for buggy environments.
    *
    * @private
    * @param {*} value The value to query.
    * @returns {string} Returns the `toStringTag`.
    */
   function baseGetTag(value) {
-    return objectToString.call(value);
+    if (value == null) {
+      return value === undefined ? undefinedTag : nullTag;
+    }
+    value = Object(value);
+    return (symToStringTag && symToStringTag in value)
+      ? getRawTag(value)
+      : objectToString(value);
   }
 
   return baseGetTag;

_baseIsArguments.js

@@ -1,18 +1,8 @@
-define(['./isObjectLike'], function(isObjectLike) {
+define(['./_baseGetTag', './isObjectLike'], function(baseGetTag, isObjectLike) {
 
   /** `Object#toString` result references. */
   var argsTag = '[object Arguments]';
 
-  /** Used for built-in method references. */
-  var objectProto = Object.prototype;
-
-  /**
-   * Used to resolve the
-   * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
-   * of values.
-   */
-  var objectToString = objectProto.toString;
-
   /**
    * The base implementation of `_.isArguments`.
    *
@@ -21,7 +11,7 @@ define(['./isObjectLike'], function(isObjectLike) {
    * @returns {boolean} Returns `true` if `value` is an `arguments` object,
    */
   function baseIsArguments(value) {
-    return isObjectLike(value) && objectToString.call(value) == argsTag;
+    return isObjectLike(value) && baseGetTag(value) == argsTag;
   }
 
   return baseIsArguments;

_baseIsArrayBuffer.js

@@ -1,17 +1,7 @@
-define(['./isObjectLike'], function(isObjectLike) {
+define(['./_baseGetTag', './isObjectLike'], function(baseGetTag, isObjectLike) {
 
   var arrayBufferTag = '[object ArrayBuffer]';
 
-  /** Used for built-in method references. */
-  var objectProto = Object.prototype;
-
-  /**
-   * Used to resolve the
-   * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
-   * of values.
-   */
-  var objectToString = objectProto.toString;
-
   /**
    * The base implementation of `_.isArrayBuffer` without Node.js optimizations.
    *
@@ -20,7 +10,7 @@ define(['./isObjectLike'], function(isObjectLike) {
    * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.
    */
   function baseIsArrayBuffer(value) {
-    return isObjectLike(value) && objectToString.call(value) == arrayBufferTag;
+    return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;
   }
 
   return baseIsArrayBuffer;

_baseIsDate.js

@@ -1,18 +1,8 @@
-define(['./isObjectLike'], function(isObjectLike) {
+define(['./_baseGetTag', './isObjectLike'], function(baseGetTag, isObjectLike) {
 
   /** `Object#toString` result references. */
   var dateTag = '[object Date]';
 
-  /** Used for built-in method references. */
-  var objectProto = Object.prototype;
-
-  /**
-   * Used to resolve the
-   * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
-   * of values.
-   */
-  var objectToString = objectProto.toString;
-
   /**
    * The base implementation of `_.isDate` without Node.js optimizations.
    *
@@ -21,7 +11,7 @@ define(['./isObjectLike'], function(isObjectLike) {
    * @returns {boolean} Returns `true` if `value` is a date object, else `false`.
    */
   function baseIsDate(value) {
-    return isObjectLike(value) && objectToString.call(value) == dateTag;
+    return isObjectLike(value) && baseGetTag(value) == dateTag;
   }
 
   return baseIsDate;

_baseIsRegExp.js

@@ -1,18 +1,8 @@
-define(['./isObject'], function(isObject) {
+define(['./_baseGetTag', './isObjectLike'], function(baseGetTag, isObjectLike) {
 
   /** `Object#toString` result references. */
   var regexpTag = '[object RegExp]';
 
-  /** Used for built-in method references. */
-  var objectProto = Object.prototype;
-
-  /**
-   * Used to resolve the
-   * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
-   * of values.
-   */
-  var objectToString = objectProto.toString;
-
   /**
    * The base implementation of `_.isRegExp` without Node.js optimizations.
    *
@@ -21,7 +11,7 @@ define(['./isObject'], function(isObject) {
    * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.
    */
   function baseIsRegExp(value) {
-    return isObject(value) && objectToString.call(value) == regexpTag;
+    return isObjectLike(value) && baseGetTag(value) == regexpTag;
   }
 
   return baseIsRegExp;

_baseIsTypedArray.js

@@ -1,4 +1,4 @@
-define(['./isLength', './isObjectLike'], function(isLength, isObjectLike) {
+define(['./_baseGetTag', './isLength', './isObjectLike'], function(baseGetTag, isLength, isObjectLike) {
 
   /** `Object#toString` result references. */
   var argsTag = '[object Arguments]',
@@ -43,16 +43,6 @@ define(['./isLength', './isObjectLike'], function(isLength, isObjectLike) {
   typedArrayTags[setTag] = typedArrayTags[stringTag] =
   typedArrayTags[weakMapTag] = false;
 
-  /** Used for built-in method references. */
-  var objectProto = Object.prototype;
-
-  /**
-   * Used to resolve the
-   * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
-   * of values.
-   */
-  var objectToString = objectProto.toString;
-
   /**
    * The base implementation of `_.isTypedArray` without Node.js optimizations.
    *
@@ -62,7 +52,7 @@ define(['./isLength', './isObjectLike'], function(isLength, isObjectLike) {
    */
   function baseIsTypedArray(value) {
     return isObjectLike(value) &&
-      isLength(value.length) && !!typedArrayTags[objectToString.call(value)];
+      isLength(value.length) && !!typedArrayTags[baseGetTag(value)];
   }
 
   return baseIsTypedArray;

_baseMean.js

@@ -13,7 +13,7 @@ define(['./_baseSum'], function(baseSum) {
    * @returns {number} Returns the mean.
    */
   function baseMean(array, iteratee) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     return length ? (baseSum(array, iteratee) / length) : NAN;
   }
 

_baseSortedIndex.js

@@ -18,7 +18,7 @@ define(['./_baseSortedIndexBy', './identity', './isSymbol'], function(baseSorted
    */
   function baseSortedIndex(array, value, retHighest) {
     var low = 0,
-        high = array ? array.length : low;
+        high = array == null ? low : array.length;
 
     if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {
       while (low < high) {

_baseSortedIndexBy.js

@@ -28,7 +28,7 @@ define(['./isSymbol'], function(isSymbol) {
     value = iteratee(value);
 
     var low = 0,
-        high = array ? array.length : 0,
+        high = array == null ? 0 : array.length,
         valIsNaN = value !== value,
         valIsNull = value === null,
         valIsSymbol = isSymbol(value),

_baseXor.js

@@ -1,4 +1,4 @@
-define(['./_arrayPush', './_baseDifference', './_baseUniq'], function(arrayPush, baseDifference, baseUniq) {
+define(['./_baseDifference', './_baseFlatten', './_baseUniq'], function(baseDifference, baseFlatten, baseUniq) {
 
   /**
    * The base implementation of methods like `_.xor`, without support for
@@ -11,18 +11,25 @@ define(['./_arrayPush', './_baseDifference', './_baseUniq'], function(arrayPush,
    * @returns {Array} Returns the new array of values.
    */
   function baseXor(arrays, iteratee, comparator) {
+    var length = arrays.length;
+    if (length < 2) {
+      return length ? baseUniq(arrays[0]) : [];
+    }
     var index = -1,
-        length = arrays.length;
+        result = Array(length);
 
     while (++index < length) {
-      var result = result
-        ? arrayPush(
-            baseDifference(result, arrays[index], iteratee, comparator),
-            baseDifference(arrays[index], result, iteratee, comparator)
-          )
-        : arrays[index];
+      var array = arrays[index],
+          othIndex = -1;
+
+      while (++othIndex < length) {
+        var othArray = arrays[othIndex];
+        if (othArray !== array) {
+          result[index] = baseDifference(result[index] || array, othArray, iteratee, comparator);
+        }
+      }
     }
-    return (result && result.length) ? baseUniq(result, iteratee, comparator) : [];
+    return baseUniq(baseFlatten(result, 1), iteratee, comparator);
   }
 
   return baseXor;

_getRawTag.js

@@ -0,0 +1,50 @@
+define(['./_Symbol'], function(Symbol) {
+
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
+
+  /** Used for built-in method references. */
+  var objectProto = Object.prototype;
+
+  /** Used to check objects for own properties. */
+  var hasOwnProperty = objectProto.hasOwnProperty;
+
+  /**
+   * Used to resolve the
+   * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
+   * of values.
+   */
+  var nativeObjectToString = objectProto.toString;
+
+  /** Built-in value references. */
+  var symToStringTag = Symbol ? Symbol.toStringTag : undefined;
+
+  /**
+   * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.
+   *
+   * @private
+   * @param {*} value The value to query.
+   * @returns {string} Returns the raw `toStringTag`.
+   */
+  function getRawTag(value) {
+    var isOwn = hasOwnProperty.call(value, symToStringTag),
+        tag = value[symToStringTag];
+
+    try {
+      value[symToStringTag] = undefined;
+      var unmasked = true;
+    } catch (e) {}
+
+    var result = nativeObjectToString.call(value);
+    if (unmasked) {
+      if (isOwn) {
+        value[symToStringTag] = tag;
+      } else {
+        delete value[symToStringTag];
+      }
+    }
+    return result;
+  }
+
+  return getRawTag;
+});

_getTag.js

@@ -12,16 +12,6 @@ define(['./_DataView', './_Map', './_Promise', './_Set', './_WeakMap', './_baseG
 
   var dataViewTag = '[object DataView]';
 
-  /** Used for built-in method references. */
-  var objectProto = Object.prototype;
-
-  /**
-   * Used to resolve the
-   * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
-   * of values.
-   */
-  var objectToString = objectProto.toString;
-
   /** Used to detect maps, sets, and weakmaps. */
   var dataViewCtorString = toSource(DataView),
       mapCtorString = toSource(Map),
@@ -45,9 +35,9 @@ define(['./_DataView', './_Map', './_Promise', './_Set', './_WeakMap', './_baseG
       (Set && getTag(new Set) != setTag) ||
       (WeakMap && getTag(new WeakMap) != weakMapTag)) {
     getTag = function(value) {
-      var result = objectToString.call(value),
+      var result = baseGetTag(value),
           Ctor = result == objectTag ? value.constructor : undefined,
-          ctorString = Ctor ? toSource(Ctor) : undefined;
+          ctorString = Ctor ? toSource(Ctor) : '';
 
       if (ctorString) {
         switch (ctorString) {

_hasPath.js

@@ -26,7 +26,7 @@ define(['./_castPath', './isArguments', './isArray', './_isIndex', './_isKey', '
     if (result || ++index != length) {
       return result;
     }
-    length = object ? object.length : 0;
+    length = object == null ? 0 : object.length;
     return !!length && isLength(length) && isIndex(key, length) &&
       (isArray(object) || isArguments(object));
   }

_objectToString.js

@@ -0,0 +1,25 @@
+define([], function() {
+
+  /** Used for built-in method references. */
+  var objectProto = Object.prototype;
+
+  /**
+   * Used to resolve the
+   * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
+   * of values.
+   */
+  var nativeObjectToString = objectProto.toString;
+
+  /**
+   * Converts `value` to a string using `Object.prototype.toString`.
+   *
+   * @private
+   * @param {*} value The value to convert.
+   * @returns {string} Returns the converted string.
+   */
+  function objectToString(value) {
+    return nativeObjectToString.call(value);
+  }
+
+  return objectToString;
+});

_shortOut.js

@@ -4,7 +4,7 @@ define([], function() {
   var undefined;
 
   /** Used to detect hot functions by number of calls within a span of milliseconds. */
-  var HOT_COUNT = 500,
+  var HOT_COUNT = 800,
       HOT_SPAN = 16;
 
   /* Built-in method references for those with the same name as other `lodash` methods. */

_toSource.js

@@ -10,7 +10,7 @@ define([], function() {
    * Converts `func` to its source code.
    *
    * @private
-   * @param {Function} func The function to process.
+   * @param {Function} func The function to convert.
    * @returns {string} Returns the source code.
    */
   function toSource(func) {

_unicodeWords.js

@@ -31,22 +31,26 @@ define([], function() {
       rsZWJ = '\\u200d';
 
   /** Used to compose unicode regexes. */
-  var rsLowerMisc = '(?:' + rsLower + '|' + rsMisc + ')',
-      rsUpperMisc = '(?:' + rsUpper + '|' + rsMisc + ')',
-      rsOptLowerContr = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',
-      rsOptUpperContr = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',
+  var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',
+      rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',
+      rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',
+      rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',
       reOptMod = rsModifier + '?',
       rsOptVar = '[' + rsVarRange + ']?',
       rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',
+      rsOrdLower = '\\d*(?:(?:1st|2nd|3rd|(?![123])\\dth)\\b)',
+      rsOrdUpper = '\\d*(?:(?:1ST|2ND|3RD|(?![123])\\dTH)\\b)',
       rsSeq = rsOptVar + reOptMod + rsOptJoin,
       rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq;
 
   /** Used to match complex or compound words. */
   var reUnicodeWord = RegExp([
-    rsUpper + '?' + rsLower + '+' + rsOptLowerContr + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',
-    rsUpperMisc + '+' + rsOptUpperContr + '(?=' + [rsBreak, rsUpper + rsLowerMisc, '$'].join('|') + ')',
-    rsUpper + '?' + rsLowerMisc + '+' + rsOptLowerContr,
-    rsUpper + '+' + rsOptUpperContr,
+    rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',
+    rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',
+    rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,
+    rsUpper + '+' + rsOptContrUpper,
+    rsOrdUpper,
+    rsOrdLower,
     rsDigits,
     rsEmoji
   ].join('|'), 'g');

chunk.js

@@ -34,7 +34,7 @@ define(['./_baseSlice', './_isIterateeCall', './toInteger'], function(baseSlice,
     } else {
       size = nativeMax(toInteger(size), 0);
     }
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     if (!length || size < 1) {
       return [];
     }

cloneDeepWith.js

@@ -1,5 +1,8 @@
 define(['./_baseClone'], function(baseClone) {
 
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
+
   /**
    * This method is like `_.cloneWith` except that it recursively clones `value`.
    *
@@ -29,6 +32,7 @@ define(['./_baseClone'], function(baseClone) {
    * // => 20
    */
   function cloneDeepWith(value, customizer) {
+    customizer = typeof customizer == 'function' ? customizer : undefined;
     return baseClone(value, true, true, customizer);
   }
 

cloneWith.js

@@ -1,5 +1,8 @@
 define(['./_baseClone'], function(baseClone) {
 
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
+
   /**
    * This method is like `_.clone` except that it accepts `customizer` which
    * is invoked to produce the cloned value. If `customizer` returns `undefined`,
@@ -32,6 +35,7 @@ define(['./_baseClone'], function(baseClone) {
    * // => 0
    */
   function cloneWith(value, customizer) {
+    customizer = typeof customizer == 'function' ? customizer : undefined;
     return baseClone(value, false, true, customizer);
   }
 

compact.js

@@ -17,7 +17,7 @@ define([], function() {
    */
   function compact(array) {
     var index = -1,
-        length = array ? array.length : 0,
+        length = array == null ? 0 : array.length,
         resIndex = 0,
         result = [];
 

cond.js

@@ -33,7 +33,7 @@ define(['./_apply', './_arrayMap', './_baseIteratee', './_baseRest'], function(a
    * // => 'no match'
    */
   function cond(pairs) {
-    var length = pairs ? pairs.length : 0,
+    var length = pairs == null ? 0 : pairs.length,
         toIteratee = baseIteratee;
 
     pairs = !length ? [] : arrayMap(pairs, function(pair) {

countBy.js

@@ -17,8 +17,7 @@ define(['./_baseAssignValue', './_createAggregator'], function(baseAssignValue,
    * @since 0.5.0
    * @category Collection
    * @param {Array|Object} collection The collection to iterate over.
-   * @param {Function} [iteratee=_.identity]
-   *  The iteratee to transform keys.
+   * @param {Function} [iteratee=_.identity] The iteratee to transform keys.
    * @returns {Object} Returns the composed aggregate object.
    * @example
    *

create.js

@@ -36,7 +36,7 @@ define(['./_baseAssign', './_baseCreate'], function(baseAssign, baseCreate) {
    */
   function create(prototype, properties) {
     var result = baseCreate(prototype);
-    return properties ? baseAssign(result, properties) : result;
+    return properties == null ? result : baseAssign(result, properties);
   }
 
   return create;

drop.js

@@ -29,7 +29,7 @@ define(['./_baseSlice', './toInteger'], function(baseSlice, toInteger) {
    * // => [1, 2, 3]
    */
   function drop(array, n, guard) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     if (!length) {
       return [];
     }

dropRight.js

@@ -29,7 +29,7 @@ define(['./_baseSlice', './toInteger'], function(baseSlice, toInteger) {
    * // => [1, 2, 3]
    */
   function dropRight(array, n, guard) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     if (!length) {
       return [];
     }

dropWhile.js

@@ -10,8 +10,7 @@ define(['./_baseIteratee', './_baseWhile'], function(baseIteratee, baseWhile) {
    * @since 3.0.0
    * @category Array
    * @param {Array} array The array to query.
-   * @param {Function} [predicate=_.identity]
-   *  The function invoked per iteration.
+   * @param {Function} [predicate=_.identity] The function invoked per iteration.
    * @returns {Array} Returns the slice of `array`.
    * @example
    *

every.js

@@ -18,8 +18,7 @@ define(['./_arrayEvery', './_baseEvery', './_baseIteratee', './isArray', './_isI
    * @since 0.1.0
    * @category Collection
    * @param {Array|Object} collection The collection to iterate over.
-   * @param {Function} [predicate=_.identity]
-   *  The function invoked per iteration.
+   * @param {Function} [predicate=_.identity] The function invoked per iteration.
    * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
    * @returns {boolean} Returns `true` if all elements pass the predicate check,
    *  else `false`.

fill.js

@@ -30,7 +30,7 @@ define(['./_baseFill', './_isIterateeCall'], function(baseFill, isIterateeCall)
    * // => [4, '*', '*', 10]
    */
   function fill(array, value, start, end) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     if (!length) {
       return [];
     }

filter.js

@@ -12,8 +12,7 @@ define(['./_arrayFilter', './_baseFilter', './_baseIteratee', './isArray'], func
    * @since 0.1.0
    * @category Collection
    * @param {Array|Object} collection The collection to iterate over.
-   * @param {Function} [predicate=_.identity]
-   *  The function invoked per iteration.
+   * @param {Function} [predicate=_.identity] The function invoked per iteration.
    * @returns {Array} Returns the new filtered array.
    * @see _.reject
    * @example

find.js

@@ -10,8 +10,7 @@ define(['./_createFind', './findIndex'], function(createFind, findIndex) {
    * @since 0.1.0
    * @category Collection
    * @param {Array|Object} collection The collection to inspect.
-   * @param {Function} [predicate=_.identity]
-   *  The function invoked per iteration.
+   * @param {Function} [predicate=_.identity] The function invoked per iteration.
    * @param {number} [fromIndex=0] The index to search from.
    * @returns {*} Returns the matched element, else `undefined`.
    * @example

findIndex.js

@@ -12,8 +12,7 @@ define(['./_baseFindIndex', './_baseIteratee', './toInteger'], function(baseFind
    * @since 1.1.0
    * @category Array
    * @param {Array} array The array to inspect.
-   * @param {Function} [predicate=_.identity]
-   *  The function invoked per iteration.
+   * @param {Function} [predicate=_.identity] The function invoked per iteration.
    * @param {number} [fromIndex=0] The index to search from.
    * @returns {number} Returns the index of the found element, else `-1`.
    * @example
@@ -40,7 +39,7 @@ define(['./_baseFindIndex', './_baseIteratee', './toInteger'], function(baseFind
    * // => 2
    */
   function findIndex(array, predicate, fromIndex) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     if (!length) {
       return -1;
     }

findLast.js

@@ -9,8 +9,7 @@ define(['./_createFind', './findLastIndex'], function(createFind, findLastIndex)
    * @since 2.0.0
    * @category Collection
    * @param {Array|Object} collection The collection to inspect.
-   * @param {Function} [predicate=_.identity]
-   *  The function invoked per iteration.
+   * @param {Function} [predicate=_.identity] The function invoked per iteration.
    * @param {number} [fromIndex=collection.length-1] The index to search from.
    * @returns {*} Returns the matched element, else `undefined`.
    * @example

findLastIndex.js

@@ -16,8 +16,7 @@ define(['./_baseFindIndex', './_baseIteratee', './toInteger'], function(baseFind
    * @since 2.0.0
    * @category Array
    * @param {Array} array The array to inspect.
-   * @param {Function} [predicate=_.identity]
-   *  The function invoked per iteration.
+   * @param {Function} [predicate=_.identity] The function invoked per iteration.
    * @param {number} [fromIndex=array.length-1] The index to search from.
    * @returns {number} Returns the index of the found element, else `-1`.
    * @example
@@ -44,7 +43,7 @@ define(['./_baseFindIndex', './_baseIteratee', './toInteger'], function(baseFind
    * // => 0
    */
   function findLastIndex(array, predicate, fromIndex) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     if (!length) {
       return -1;
     }

flatMap.js

@@ -10,8 +10,7 @@ define(['./_baseFlatten', './map'], function(baseFlatten, map) {
    * @since 4.0.0
    * @category Collection
    * @param {Array|Object} collection The collection to iterate over.
-   * @param {Function} [iteratee=_.identity]
-   *  The function invoked per iteration.
+   * @param {Function} [iteratee=_.identity] The function invoked per iteration.
    * @returns {Array} Returns the new flattened array.
    * @example
    *

flatMapDeep.js

@@ -12,8 +12,7 @@ define(['./_baseFlatten', './map'], function(baseFlatten, map) {
    * @since 4.7.0
    * @category Collection
    * @param {Array|Object} collection The collection to iterate over.
-   * @param {Function} [iteratee=_.identity]
-   *  The function invoked per iteration.
+   * @param {Function} [iteratee=_.identity] The function invoked per iteration.
    * @returns {Array} Returns the new flattened array.
    * @example
    *

flatMapDepth.js

@@ -12,8 +12,7 @@ define(['./_baseFlatten', './map', './toInteger'], function(baseFlatten, map, to
    * @since 4.7.0
    * @category Collection
    * @param {Array|Object} collection The collection to iterate over.
-   * @param {Function} [iteratee=_.identity]
-   *  The function invoked per iteration.
+   * @param {Function} [iteratee=_.identity] The function invoked per iteration.
    * @param {number} [depth=1] The maximum recursion depth.
    * @returns {Array} Returns the new flattened array.
    * @example

flatten.js

@@ -15,7 +15,7 @@ define(['./_baseFlatten'], function(baseFlatten) {
    * // => [1, 2, [3, [4]], 5]
    */
   function flatten(array) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     return length ? baseFlatten(array, 1) : [];
   }
 

flattenDeep.js

@@ -18,7 +18,7 @@ define(['./_baseFlatten'], function(baseFlatten) {
    * // => [1, 2, 3, 4, 5]
    */
   function flattenDeep(array) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     return length ? baseFlatten(array, INFINITY) : [];
   }
 

flattenDepth.js

@@ -24,7 +24,7 @@ define(['./_baseFlatten', './toInteger'], function(baseFlatten, toInteger) {
    * // => [1, 2, 3, [4], 5]
    */
   function flattenDepth(array, depth) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     if (!length) {
       return [];
     }

forEach.js

@@ -1,4 +1,4 @@
-define(['./_arrayEach', './_baseEach', './_baseIteratee', './isArray'], function(arrayEach, baseEach, baseIteratee, isArray) {
+define(['./_arrayEach', './_baseEach', './_castFunction', './isArray'], function(arrayEach, baseEach, castFunction, isArray) {
 
   /**
    * Iterates over elements of `collection` and invokes `iteratee` for each element.
@@ -32,7 +32,7 @@ define(['./_arrayEach', './_baseEach', './_baseIteratee', './isArray'], function
    */
   function forEach(collection, iteratee) {
     var func = isArray(collection) ? arrayEach : baseEach;
-    return func(collection, baseIteratee(iteratee, 3));
+    return func(collection, castFunction(iteratee));
   }
 
   return forEach;

forEachRight.js

@@ -1,4 +1,4 @@
-define(['./_arrayEachRight', './_baseEachRight', './_baseIteratee', './isArray'], function(arrayEachRight, baseEachRight, baseIteratee, isArray) {
+define(['./_arrayEachRight', './_baseEachRight', './_castFunction', './isArray'], function(arrayEachRight, baseEachRight, castFunction, isArray) {
 
   /**
    * This method is like `_.forEach` except that it iterates over elements of
@@ -22,7 +22,7 @@ define(['./_arrayEachRight', './_baseEachRight', './_baseIteratee', './isArray']
    */
   function forEachRight(collection, iteratee) {
     var func = isArray(collection) ? arrayEachRight : baseEachRight;
-    return func(collection, baseIteratee(iteratee, 3));
+    return func(collection, castFunction(iteratee));
   }
 
   return forEachRight;

forIn.js

@@ -1,4 +1,4 @@
-define(['./_baseFor', './_baseIteratee', './keysIn'], function(baseFor, baseIteratee, keysIn) {
+define(['./_baseFor', './_castFunction', './keysIn'], function(baseFor, castFunction, keysIn) {
 
   /**
    * Iterates over own and inherited enumerable string keyed properties of an
@@ -31,7 +31,7 @@ define(['./_baseFor', './_baseIteratee', './keysIn'], function(baseFor, baseIter
   function forIn(object, iteratee) {
     return object == null
       ? object
-      : baseFor(object, baseIteratee(iteratee, 3), keysIn);
+      : baseFor(object, castFunction(iteratee), keysIn);
   }
 
   return forIn;

forInRight.js

@@ -1,4 +1,4 @@
-define(['./_baseForRight', './_baseIteratee', './keysIn'], function(baseForRight, baseIteratee, keysIn) {
+define(['./_baseForRight', './_castFunction', './keysIn'], function(baseForRight, castFunction, keysIn) {
 
   /**
    * This method is like `_.forIn` except that it iterates over properties of
@@ -29,7 +29,7 @@ define(['./_baseForRight', './_baseIteratee', './keysIn'], function(baseForRight
   function forInRight(object, iteratee) {
     return object == null
       ? object
-      : baseForRight(object, baseIteratee(iteratee, 3), keysIn);
+      : baseForRight(object, castFunction(iteratee), keysIn);
   }
 
   return forInRight;

forOwn.js

@@ -1,4 +1,4 @@
-define(['./_baseForOwn', './_baseIteratee'], function(baseForOwn, baseIteratee) {
+define(['./_baseForOwn', './_castFunction'], function(baseForOwn, castFunction) {
 
   /**
    * Iterates over own enumerable string keyed properties of an object and
@@ -29,7 +29,7 @@ define(['./_baseForOwn', './_baseIteratee'], function(baseForOwn, baseIteratee)
    * // => Logs 'a' then 'b' (iteration order is not guaranteed).
    */
   function forOwn(object, iteratee) {
-    return object && baseForOwn(object, baseIteratee(iteratee, 3));
+    return object && baseForOwn(object, castFunction(iteratee));
   }
 
   return forOwn;

forOwnRight.js

@@ -1,4 +1,4 @@
-define(['./_baseForOwnRight', './_baseIteratee'], function(baseForOwnRight, baseIteratee) {
+define(['./_baseForOwnRight', './_castFunction'], function(baseForOwnRight, castFunction) {
 
   /**
    * This method is like `_.forOwn` except that it iterates over properties of
@@ -27,7 +27,7 @@ define(['./_baseForOwnRight', './_baseIteratee'], function(baseForOwnRight, base
    * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'.
    */
   function forOwnRight(object, iteratee) {
-    return object && baseForOwnRight(object, baseIteratee(iteratee, 3));
+    return object && baseForOwnRight(object, castFunction(iteratee));
   }
 
   return forOwnRight;

fromPairs.js

@@ -17,7 +17,7 @@ define([], function() {
    */
   function fromPairs(pairs) {
     var index = -1,
-        length = pairs ? pairs.length : 0,
+        length = pairs == null ? 0 : pairs.length,
         result = {};
 
     while (++index < length) {

groupBy.js

@@ -18,8 +18,7 @@ define(['./_baseAssignValue', './_createAggregator'], function(baseAssignValue,
    * @since 0.1.0
    * @category Collection
    * @param {Array|Object} collection The collection to iterate over.
-   * @param {Function} [iteratee=_.identity]
-   *  The iteratee to transform keys.
+   * @param {Function} [iteratee=_.identity] The iteratee to transform keys.
    * @returns {Object} Returns the composed aggregate object.
    * @example
    *

indexOf.js

@@ -27,7 +27,7 @@ define(['./_baseIndexOf', './toInteger'], function(baseIndexOf, toInteger) {
    * // => 3
    */
   function indexOf(array, value, fromIndex) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     if (!length) {
       return -1;
     }

initial.js

@@ -15,7 +15,7 @@ define(['./_baseSlice'], function(baseSlice) {
    * // => [1, 2]
    */
   function initial(array) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     return length ? baseSlice(array, 0, -1) : [];
   }
 

intersectionWith.js

@@ -28,9 +28,8 @@ define(['./_arrayMap', './_baseIntersection', './_baseRest', './_castArrayLikeOb
     var comparator = last(arrays),
         mapped = arrayMap(arrays, castArrayLikeObject);
 
-    if (comparator === last(mapped)) {
-      comparator = undefined;
-    } else {
+    comparator = typeof comparator == 'function' ? comparator : undefined;
+    if (comparator) {
       mapped.pop();
     }
     return (mapped.length && mapped[0] === arrays[0])

isBoolean.js

@@ -1,18 +1,8 @@
-define(['./isObjectLike'], function(isObjectLike) {
+define(['./_baseGetTag', './isObjectLike'], function(baseGetTag, isObjectLike) {
 
   /** `Object#toString` result references. */
   var boolTag = '[object Boolean]';
 
-  /** Used for built-in method references. */
-  var objectProto = Object.prototype;
-
-  /**
-   * Used to resolve the
-   * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
-   * of values.
-   */
-  var objectToString = objectProto.toString;
-
   /**
    * Checks if `value` is classified as a boolean primitive or object.
    *
@@ -32,7 +22,7 @@ define(['./isObjectLike'], function(isObjectLike) {
    */
   function isBoolean(value) {
     return value === true || value === false ||
-      (isObjectLike(value) && objectToString.call(value) == boolTag);
+      (isObjectLike(value) && baseGetTag(value) == boolTag);
   }
 
   return isBoolean;

isElement.js

@@ -18,7 +18,7 @@ define(['./isObjectLike', './isPlainObject'], function(isObjectLike, isPlainObje
    * // => false
    */
   function isElement(value) {
-    return value != null && value.nodeType === 1 && isObjectLike(value) && !isPlainObject(value);
+    return isObjectLike(value) && value.nodeType === 1 && !isPlainObject(value);
   }
 
   return isElement;

isEmpty.js

@@ -44,6 +44,9 @@ define(['./_baseKeys', './_getTag', './isArguments', './isArray', './isArrayLike
    * // => false
    */
   function isEmpty(value) {
+    if (value == null) {
+      return true;
+    }
     if (isArrayLike(value) &&
         (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||
           isBuffer(value) || isTypedArray(value) || isArguments(value))) {

isError.js

@@ -1,17 +1,8 @@
-define(['./isObjectLike'], function(isObjectLike) {
+define(['./_baseGetTag', './isObjectLike', './isPlainObject'], function(baseGetTag, isObjectLike, isPlainObject) {
 
   /** `Object#toString` result references. */
-  var errorTag = '[object Error]';
-
-  /** Used for built-in method references. */
-  var objectProto = Object.prototype;
-
-  /**
-   * Used to resolve the
-   * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
-   * of values.
-   */
-  var objectToString = objectProto.toString;
+  var domExcTag = '[object DOMException]',
+      errorTag = '[object Error]';
 
   /**
    * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`,
@@ -35,8 +26,9 @@ define(['./isObjectLike'], function(isObjectLike) {
     if (!isObjectLike(value)) {
       return false;
     }
-    return (objectToString.call(value) == errorTag) ||
-      (typeof value.message == 'string' && typeof value.name == 'string');
+    var tag = baseGetTag(value);
+    return tag == errorTag || tag == domExcTag ||
+      (typeof value.message == 'string' && typeof value.name == 'string' && !isPlainObject(value));
   }
 
   return isError;

isFunction.js

@@ -1,20 +1,11 @@
-define(['./isObject'], function(isObject) {
+define(['./_baseGetTag', './isObject'], function(baseGetTag, isObject) {
 
   /** `Object#toString` result references. */
-  var funcTag = '[object Function]',
+  var asyncTag = '[object AsyncFunction]',
+      funcTag = '[object Function]',
       genTag = '[object GeneratorFunction]',
       proxyTag = '[object Proxy]';
 
-  /** Used for built-in method references. */
-  var objectProto = Object.prototype;
-
-  /**
-   * Used to resolve the
-   * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
-   * of values.
-   */
-  var objectToString = objectProto.toString;
-
   /**
    * Checks if `value` is classified as a `Function` object.
    *
@@ -33,10 +24,13 @@ define(['./isObject'], function(isObject) {
    * // => false
    */
   function isFunction(value) {
+    if (!isObject(value)) {
+      return false;
+    }
     // The use of `Object#toString` avoids issues with the `typeof` operator
-    // in Safari 9 which returns 'object' for typed array and other constructors.
-    var tag = isObject(value) ? objectToString.call(value) : '';
-    return tag == funcTag || tag == genTag || tag == proxyTag;
+    // in Safari 9 which returns 'object' for typed arrays and other constructors.
+    var tag = baseGetTag(value);
+    return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;
   }
 
   return isFunction;

isNumber.js

@@ -1,18 +1,8 @@
-define(['./isObjectLike'], function(isObjectLike) {
+define(['./_baseGetTag', './isObjectLike'], function(baseGetTag, isObjectLike) {
 
   /** `Object#toString` result references. */
   var numberTag = '[object Number]';
 
-  /** Used for built-in method references. */
-  var objectProto = Object.prototype;
-
-  /**
-   * Used to resolve the
-   * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
-   * of values.
-   */
-  var objectToString = objectProto.toString;
-
   /**
    * Checks if `value` is classified as a `Number` primitive or object.
    *
@@ -41,7 +31,7 @@ define(['./isObjectLike'], function(isObjectLike) {
    */
   function isNumber(value) {
     return typeof value == 'number' ||
-      (isObjectLike(value) && objectToString.call(value) == numberTag);
+      (isObjectLike(value) && baseGetTag(value) == numberTag);
   }
 
   return isNumber;

isPlainObject.js

@@ -1,4 +1,4 @@
-define(['./_getPrototype', './isObjectLike'], function(getPrototype, isObjectLike) {
+define(['./_baseGetTag', './_getPrototype', './isObjectLike'], function(baseGetTag, getPrototype, isObjectLike) {
 
   /** `Object#toString` result references. */
   var objectTag = '[object Object]';
@@ -16,13 +16,6 @@ define(['./_getPrototype', './isObjectLike'], function(getPrototype, isObjectLik
   /** Used to infer the `Object` constructor. */
   var objectCtorString = funcToString.call(Object);
 
-  /**
-   * Used to resolve the
-   * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
-   * of values.
-   */
-  var objectToString = objectProto.toString;
-
   /**
    * Checks if `value` is a plain object, that is, an object created by the
    * `Object` constructor or one with a `[[Prototype]]` of `null`.
@@ -52,7 +45,7 @@ define(['./_getPrototype', './isObjectLike'], function(getPrototype, isObjectLik
    * // => true
    */
   function isPlainObject(value) {
-    if (!isObjectLike(value) || objectToString.call(value) != objectTag) {
+    if (!isObjectLike(value) || baseGetTag(value) != objectTag) {
       return false;
     }
     var proto = getPrototype(value);
@@ -60,8 +53,8 @@ define(['./_getPrototype', './isObjectLike'], function(getPrototype, isObjectLik
       return true;
     }
     var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;
-    return (typeof Ctor == 'function' &&
-      Ctor instanceof Ctor && funcToString.call(Ctor) == objectCtorString);
+    return typeof Ctor == 'function' && Ctor instanceof Ctor &&
+      funcToString.call(Ctor) == objectCtorString;
   }
 
   return isPlainObject;

isString.js

@@ -1,18 +1,8 @@
-define(['./isArray', './isObjectLike'], function(isArray, isObjectLike) {
+define(['./_baseGetTag', './isArray', './isObjectLike'], function(baseGetTag, isArray, isObjectLike) {
 
   /** `Object#toString` result references. */
   var stringTag = '[object String]';
 
-  /** Used for built-in method references. */
-  var objectProto = Object.prototype;
-
-  /**
-   * Used to resolve the
-   * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
-   * of values.
-   */
-  var objectToString = objectProto.toString;
-
   /**
    * Checks if `value` is classified as a `String` primitive or object.
    *
@@ -32,7 +22,7 @@ define(['./isArray', './isObjectLike'], function(isArray, isObjectLike) {
    */
   function isString(value) {
     return typeof value == 'string' ||
-      (!isArray(value) && isObjectLike(value) && objectToString.call(value) == stringTag);
+      (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);
   }
 
   return isString;

isSymbol.js

@@ -1,18 +1,8 @@
-define(['./isObjectLike'], function(isObjectLike) {
+define(['./_baseGetTag', './isObjectLike'], function(baseGetTag, isObjectLike) {
 
   /** `Object#toString` result references. */
   var symbolTag = '[object Symbol]';
 
-  /** Used for built-in method references. */
-  var objectProto = Object.prototype;
-
-  /**
-   * Used to resolve the
-   * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
-   * of values.
-   */
-  var objectToString = objectProto.toString;
-
   /**
    * Checks if `value` is classified as a `Symbol` primitive or object.
    *
@@ -32,7 +22,7 @@ define(['./isObjectLike'], function(isObjectLike) {
    */
   function isSymbol(value) {
     return typeof value == 'symbol' ||
-      (isObjectLike(value) && objectToString.call(value) == symbolTag);
+      (isObjectLike(value) && baseGetTag(value) == symbolTag);
   }
 
   return isSymbol;

isWeakSet.js

@@ -1,18 +1,8 @@
-define(['./isObjectLike'], function(isObjectLike) {
+define(['./_baseGetTag', './isObjectLike'], function(baseGetTag, isObjectLike) {
 
   /** `Object#toString` result references. */
   var weakSetTag = '[object WeakSet]';
 
-  /** Used for built-in method references. */
-  var objectProto = Object.prototype;
-
-  /**
-   * Used to resolve the
-   * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
-   * of values.
-   */
-  var objectToString = objectProto.toString;
-
   /**
    * Checks if `value` is classified as a `WeakSet` object.
    *
@@ -31,7 +21,7 @@ define(['./isObjectLike'], function(isObjectLike) {
    * // => false
    */
   function isWeakSet(value) {
-    return isObjectLike(value) && objectToString.call(value) == weakSetTag;
+    return isObjectLike(value) && baseGetTag(value) == weakSetTag;
   }
 
   return isWeakSet;

join.js

@@ -22,7 +22,7 @@ define([], function() {
    * // => 'a~b~c'
    */
   function join(array, separator) {
-    return array ? nativeJoin.call(array, separator) : '';
+    return array == null ? '' : nativeJoin.call(array, separator);
   }
 
   return join;

keyBy.js

@@ -11,8 +11,7 @@ define(['./_baseAssignValue', './_createAggregator'], function(baseAssignValue,
    * @since 4.0.0
    * @category Collection
    * @param {Array|Object} collection The collection to iterate over.
-   * @param {Function} [iteratee=_.identity]
-   *  The iteratee to transform keys.
+   * @param {Function} [iteratee=_.identity] The iteratee to transform keys.
    * @returns {Object} Returns the composed aggregate object.
    * @example
    *

last.js

@@ -18,7 +18,7 @@ define([], function() {
    * // => 3
    */
   function last(array) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     return length ? array[length - 1] : undefined;
   }
 

lastIndexOf.js

@@ -29,7 +29,7 @@ define(['./_baseFindIndex', './_baseIsNaN', './_strictLastIndexOf', './toInteger
    * // => 1
    */
   function lastIndexOf(array, value, fromIndex) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     if (!length) {
       return -1;
     }

memoize.js

@@ -14,7 +14,7 @@ define(['./_MapCache'], function(MapCache) {
    * function. Its creation may be customized by replacing the `_.memoize.Cache`
    * constructor with one whose instances implement the
    * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)
-   * method interface of `delete`, `get`, `has`, and `set`.
+   * method interface of `clear`, `delete`, `get`, `has`, and `set`.
    *
    * @static
    * @memberOf _
@@ -48,7 +48,7 @@ define(['./_MapCache'], function(MapCache) {
    * _.memoize.Cache = WeakMap;
    */
   function memoize(func, resolver) {
-    if (typeof func != 'function' || (resolver && typeof resolver != 'function')) {
+    if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {
       throw new TypeError(FUNC_ERROR_TEXT);
     }
     var memoized = function() {

package.json

@@ -1,6 +1,6 @@
 {
   "name": "lodash-amd",
-  "version": "4.16.4",
+  "version": "4.16.5",
   "description": "Lodash exported as AMD modules.",
   "keywords": "amd, modules, stdlib, util",
   "homepage": "https://lodash.com/custom-builds",

pullAllBy.js

@@ -13,8 +13,7 @@ define(['./_baseIteratee', './_basePullAll'], function(baseIteratee, basePullAll
    * @category Array
    * @param {Array} array The array to modify.
    * @param {Array} values The values to remove.
-   * @param {Function} [iteratee=_.identity]
-   *  The iteratee invoked per element.
+   * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
    * @returns {Array} Returns `array`.
    * @example
    *

pullAt.js

@@ -25,7 +25,7 @@ define(['./_arrayMap', './_baseAt', './_basePullAt', './_compareAscending', './_
    * // => ['b', 'd']
    */
   var pullAt = flatRest(function(array, indexes) {
-    var length = array ? array.length : 0,
+    var length = array == null ? 0 : array.length,
         result = baseAt(array, indexes);
 
     basePullAt(array, arrayMap(indexes, function(index) {

remove.js

@@ -13,8 +13,7 @@ define(['./_baseIteratee', './_basePullAt'], function(baseIteratee, basePullAt)
    * @since 2.0.0
    * @category Array
    * @param {Array} array The array to modify.
-   * @param {Function} [predicate=_.identity]
-   *  The function invoked per iteration.
+   * @param {Function} [predicate=_.identity] The function invoked per iteration.
    * @returns {Array} Returns the new array of removed elements.
    * @example
    *

reverse.js

@@ -30,7 +30,7 @@ define([], function() {
    * // => [3, 2, 1]
    */
   function reverse(array) {
-    return array ? nativeReverse.call(array) : array;
+    return array == null ? array : nativeReverse.call(array);
   }
 
   return reverse;

slice.js

@@ -20,7 +20,7 @@ define(['./_baseSlice', './_isIterateeCall', './toInteger'], function(baseSlice,
    * @returns {Array} Returns the slice of `array`.
    */
   function slice(array, start, end) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     if (!length) {
       return [];
     }

sortedIndexBy.js

@@ -11,8 +11,7 @@ define(['./_baseIteratee', './_baseSortedIndexBy'], function(baseIteratee, baseS
    * @category Array
    * @param {Array} array The sorted array to inspect.
    * @param {*} value The value to evaluate.
-   * @param {Function} [iteratee=_.identity]
-   *  The iteratee invoked per element.
+   * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
    * @returns {number} Returns the index at which `value` should be inserted
    *  into `array`.
    * @example

sortedIndexOf.js

@@ -17,7 +17,7 @@ define(['./_baseSortedIndex', './eq'], function(baseSortedIndex, eq) {
    * // => 1
    */
   function sortedIndexOf(array, value) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     if (length) {
       var index = baseSortedIndex(array, value);
       if (index < length && eq(array[index], value)) {

sortedLastIndexBy.js

@@ -11,8 +11,7 @@ define(['./_baseIteratee', './_baseSortedIndexBy'], function(baseIteratee, baseS
    * @category Array
    * @param {Array} array The sorted array to inspect.
    * @param {*} value The value to evaluate.
-   * @param {Function} [iteratee=_.identity]
-   *  The iteratee invoked per element.
+   * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
    * @returns {number} Returns the index at which `value` should be inserted
    *  into `array`.
    * @example

sortedLastIndexOf.js

@@ -17,7 +17,7 @@ define(['./_baseSortedIndex', './eq'], function(baseSortedIndex, eq) {
    * // => 3
    */
   function sortedLastIndexOf(array, value) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     if (length) {
       var index = baseSortedIndex(array, value, true) - 1;
       if (eq(array[index], value)) {

tail.js

@@ -15,7 +15,7 @@ define(['./_baseSlice'], function(baseSlice) {
    * // => [2, 3]
    */
   function tail(array) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     return length ? baseSlice(array, 1, length) : [];
   }
 

takeRight.js

@@ -29,7 +29,7 @@ define(['./_baseSlice', './toInteger'], function(baseSlice, toInteger) {
    * // => []
    */
   function takeRight(array, n, guard) {
-    var length = array ? array.length : 0;
+    var length = array == null ? 0 : array.length;
     if (!length) {
       return [];
     }

takeRightWhile.js

@@ -10,8 +10,7 @@ define(['./_baseIteratee', './_baseWhile'], function(baseIteratee, baseWhile) {
    * @since 3.0.0
    * @category Array
    * @param {Array} array The array to query.
-   * @param {Function} [predicate=_.identity]
-   *  The function invoked per iteration.
+   * @param {Function} [predicate=_.identity] The function invoked per iteration.
    * @returns {Array} Returns the slice of `array`.
    * @example
    *

takeWhile.js

@@ -10,8 +10,7 @@ define(['./_baseIteratee', './_baseWhile'], function(baseIteratee, baseWhile) {
    * @since 3.0.0
    * @category Array
    * @param {Array} array The array to query.
-   * @param {Function} [predicate=_.identity]
-   *  The function invoked per iteration.
+   * @param {Function} [predicate=_.identity] The function invoked per iteration.
    * @returns {Array} Returns the slice of `array`.
    * @example
    *