Bump to v3.10.1.

internal/baseUniq.js

@@ -12,7 +12,7 @@ var LARGE_ARRAY_SIZE = 200;
  * @private
  * @param {Array} array The array to inspect.
  * @param {Function} [iteratee] The function invoked per iteration.
- * @returns {Array} Returns the new duplicate-value-free array.
+ * @returns {Array} Returns the new duplicate free array.
  */
 function baseUniq(array, iteratee) {
   var index = -1,

internal/getFuncName.js

@@ -8,7 +8,7 @@ import realNames from './realNames';
  * @returns {string} Returns the function name.
  */
 function getFuncName(func) {
-  var result = func.name,
+  var result = (func.name + ''),
       array = realNames[result],
       length = array ? array.length : 0;
 

internal/isLaziable.js

@@ -11,11 +11,12 @@ import lodash from '../chain/lodash';
  * @returns {boolean} Returns `true` if `func` has a lazy counterpart, else `false`.
  */
 function isLaziable(func) {
-  var funcName = getFuncName(func);
-  if (!(funcName in LazyWrapper.prototype)) {
+  var funcName = getFuncName(func),
+      other = lodash[funcName];
+
+  if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {
     return false;
   }
-  var other = lodash[funcName];
   if (func === other) {
     return true;
   }

internal/lazyValue.js

@@ -37,7 +37,7 @@ function lazyValue() {
       takeCount = nativeMin(length, this.__takeCount__);
 
   if (!isArr || arrLength < LARGE_ARRAY_SIZE || (arrLength == length && takeCount == length)) {
-    return baseWrapperValue((isRight && isArr) ? array.reverse() : array, this.__actions__);
+    return baseWrapperValue(array, this.__actions__);
   }
   var result = [];
 

internal/sortedUniq.js

@@ -5,7 +5,7 @@
  * @private
  * @param {Array} array The array to inspect.
  * @param {Function} [iteratee] The function invoked per iteration.
- * @returns {Array} Returns the new duplicate-value-free array.
+ * @returns {Array} Returns the new duplicate free array.
  */
 function sortedUniq(array, iteratee) {
   var seen,