Rebuild dist.

This commit is contained in:
John-David Dalton
2014-04-27 11:44:11 -07:00
parent 754bafc069
commit ce7cb16cfe
6 changed files with 75 additions and 57 deletions

28
dist/lodash.compat.js vendored
View File

@@ -1644,6 +1644,10 @@
}
var isArr = valClass == arrayClass;
if (!isArr) {
// exit for functions and DOM nodes
if (valClass != objectClass || (!support.nodeClass && (isNode(value) || isNode(other)))) {
return false;
}
// unwrap any `lodash` wrapped values
var valWrapped = hasOwnProperty.call(value, '__wrapped__'),
othWrapped = hasOwnProperty.call(other, '__wrapped__');
@@ -1651,10 +1655,6 @@
if (valWrapped || othWrapped) {
return baseIsEqual(valWrapped ? value.__wrapped__ : value, othWrapped ? other.__wrapped__ : other, callback, isWhere, stackA, stackB);
}
// exit for functions and DOM nodes
if (valClass != objectClass || (!support.nodeClass && (isNode(value) || isNode(other)))) {
return false;
}
if (!support.argsObject) {
valIsArg = isArguments(value);
othIsArg = isArguments(other);
@@ -3254,11 +3254,11 @@
/**
* Creates a duplicate-value-free version of an array using strict equality
* for comparisons, i.e. `===`. If the array is sorted, providing
* `true` for `isSorted` will use a faster algorithm. If a callback is provided
* each element of `array` is passed through the callback before uniqueness
* is computed. The callback is bound to `thisArg` and invoked with three
* arguments; (value, index, array).
* for comparisons, i.e. `===`. If the array is sorted, providing `true` for
* `isSorted` will use a faster algorithm. If a callback is provided it will
* be executed for each value in the array to generate the criterion by which
* uniqueness is computed. The callback is bound to `thisArg` and invoked with
* three arguments; (value, index, array).
*
* If a property name is provided for `callback` the created "_.pluck" style
* callback will return the property value of the given element.
@@ -4182,6 +4182,9 @@
* _.max([4, 2, 8, 6]);
* // => 8
*
* _.max([]);
* // => -Infinity
*
* var characters = [
* { 'name': 'barney', 'age': 36 },
* { 'name': 'fred', 'age': 40 }
@@ -4220,7 +4223,7 @@
baseEach(collection, function(value, index, collection) {
var current = callback(value, index, collection);
if (current > computed) {
if (current > computed || (current === -Infinity && current === result)) {
computed = current;
result = value;
}
@@ -4257,6 +4260,9 @@
* _.min([4, 2, 8, 6]);
* // => 2
*
* _.min([]);
* // => Infinity
*
* var characters = [
* { 'name': 'barney', 'age': 36 },
* { 'name': 'fred', 'age': 40 }
@@ -4295,7 +4301,7 @@
baseEach(collection, function(value, index, collection) {
var current = callback(value, index, collection);
if (current < computed) {
if (current < computed || (current === Infinity && current === result)) {
computed = current;
result = value;
}