enmi-conf.org: comparison wp/wp-includes/js/underscore.js

Mercurial Mercurial > enmi-conf.org / comparison

summary | shortlog | changelog | graph | tags | bookmarks | branches | files | changeset | file | latest | revisions | annotate | diff | comparison | raw | help

wp/wp-includes/js/underscore.js

changeset 19	3d72ae0968f4
parent 18	be944660c56a
child 21	48c4eec2b7e6

equal deleted inserted replaced

-:be944660c56a
+:3d72ae0968f4
 var current = global._;
 var exports = global._ = factory();
 exports.noConflict = function () { global._ = current; return exports; };
 }()));
 }(this, (function () {
-//     Underscore.js 1.13.1
+//     Underscore.js 1.13.3
 //     https://underscorejs.org
-//     (c) 2009-2021 Jeremy Ashkenas, Julian Gonggrijp, and DocumentCloud and Investigative Reporters & Editors
+//     (c) 2009-2022 Jeremy Ashkenas, Julian Gonggrijp, and DocumentCloud and Investigative Reporters & Editors
 //     Underscore may be freely distributed under the MIT license.
 // Current version.
-var VERSION = '1.13.1';
+var VERSION = '1.13.3';
 // Establish the root object, `window` (`self`) in the browser, `global`
 // on the server, or `this` in some virtual machines. We use `self`
 // instead of `window` for `WebWorker` support.
-var root = typeof self == 'object' && self.self === self && self ||
+var root = (typeof self == 'object' && self.self === self && self) ||
-typeof global == 'object' && global.global === global && global ||
+(typeof global == 'object' && global.global === global && global) ||
 Function('return this')() ||
 {};
 // Save bytes in the minified (but not gzipped) version:
 var ArrayProto = Array.prototype, ObjProto = Object.prototype;
 }
 // Is a given variable an object?
 function isObject(obj) {
 var type = typeof obj;
-return type === 'function' || type === 'object' && !!obj;
+return type === 'function' || (type === 'object' && !!obj);
 }
 // Is a given value equal to null?
 function isNull(obj) {
 return obj === null;
 // arrays of strings.
 function emulatedSet(keys) {
 var hash = {};
 for (var l = keys.length, i = 0; i < l; ++i) hash[keys[i]] = true;
 return {
-contains: function(key) { return hash[key]; },
+contains: function(key) { return hash[key] === true; },
 push: function(key) {
 hash[key] = true;
 return keys.push(key);
 }
 };
 // needed.
 function collectNonEnumProps(obj, keys) {
 keys = emulatedSet(keys);
 var nonEnumIdx = nonEnumerableProps.length;
 var constructor = obj.constructor;
-var proto = isFunction$1(constructor) && constructor.prototype || ObjProto;
+var proto = (isFunction$1(constructor) && constructor.prototype) || ObjProto;
 // Constructor is a special case.
 var prop = 'constructor';
 if (has$1(obj, prop) && !keys.contains(prop)) keys.push(prop);
 // Return the maximum element (or element-based computation).
 function max(obj, iteratee, context) {
 var result = -Infinity, lastComputed = -Infinity,
 value, computed;
-if (iteratee == null || typeof iteratee == 'number' && typeof obj[0] != 'object' && obj != null) {
+if (iteratee == null || (typeof iteratee == 'number' && typeof obj[0] != 'object' && obj != null)) {
 obj = isArrayLike(obj) ? obj : values(obj);
 for (var i = 0, length = obj.length; i < length; i++) {
 value = obj[i];
 if (value != null && value > result) {
 result = value;
 }
 } else {
 iteratee = cb(iteratee, context);
 each(obj, function(v, index, list) {
 computed = iteratee(v, index, list);
-if (computed > lastComputed || computed === -Infinity && result === -Infinity) {
+if (computed > lastComputed || (computed === -Infinity && result === -Infinity)) {
 result = v;
 lastComputed = computed;
 }
 });
 }
 // Return the minimum element (or element-based computation).
 function min(obj, iteratee, context) {
 var result = Infinity, lastComputed = Infinity,
 value, computed;
-if (iteratee == null || typeof iteratee == 'number' && typeof obj[0] != 'object' && obj != null) {
+if (iteratee == null || (typeof iteratee == 'number' && typeof obj[0] != 'object' && obj != null)) {
 obj = isArrayLike(obj) ? obj : values(obj);
 for (var i = 0, length = obj.length; i < length; i++) {
 value = obj[i];
 if (value != null && value < result) {
 result = value;
 }
 } else {
 iteratee = cb(iteratee, context);
 each(obj, function(v, index, list) {
 computed = iteratee(v, index, list);
-if (computed < lastComputed || computed === Infinity && result === Infinity) {
+if (computed < lastComputed || (computed === Infinity && result === Infinity)) {
 result = v;
 lastComputed = computed;
 }
 });
 }
 return result;
+}
+// Safely create a real, live array from anything iterable.
+var reStrSymbol = /[^\ud800-\udfff]|[\ud800-\udbff][\udc00-\udfff]|[\ud800-\udfff]/g;
+function toArray(obj) {
+if (!obj) return [];
+if (isArray(obj)) return slice.call(obj);
+if (isString(obj)) {
+// Keep surrogate pair characters together.
+return obj.match(reStrSymbol);
+}
+if (isArrayLike(obj)) return map(obj, identity);
+return values(obj);
 }
 // Sample **n** random values from a collection using the modern version of the
 // [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher–Yates_shuffle).
 // If **n** is not specified, returns a single random element.
 function sample(obj, n, guard) {
 if (n == null || guard) {
 if (!isArrayLike(obj)) obj = values(obj);
 return obj[random(obj.length - 1)];
 }
-var sample = isArrayLike(obj) ? clone(obj) : values(obj);
+var sample = toArray(obj);
 var length = getLength(sample);
 n = Math.max(Math.min(n, length), 0);
 var last = length - 1;
 for (var index = 0; index < n; index++) {
 var rand = random(index, last);
 // truth test, and one whose elements all do not pass the truth test.
 var partition = group(function(result, value, pass) {
 result[pass ? 0 : 1].push(value);
 }, true);
-// Safely create a real, live array from anything iterable.
-var reStrSymbol = /[^\ud800-\udfff]|[\ud800-\udbff][\udc00-\udfff]|[\ud800-\udfff]/g;
-function toArray(obj) {
-if (!obj) return [];
-if (isArray(obj)) return slice.call(obj);
-if (isString(obj)) {
-// Keep surrogate pair characters together.
-return obj.match(reStrSymbol);
-}
-if (isArrayLike(obj)) return map(obj, identity);
-return values(obj);
-}
 // Return the number of elements in a collection.
 function size(obj) {
 if (obj == null) return 0;
 return isArrayLike(obj) ? obj.length : keys(obj).length;
 }
 }
 // Complement of zip. Unzip accepts an array of arrays and groups
 // each array's elements on shared indices.
 function unzip(array) {
-var length = array && max(array, getLength).length || 0;
+var length = (array && max(array, getLength).length) || 0;
 var result = Array(length);
 for (var index = 0; index < length; index++) {
 result[index] = pluck(array, index);
 }

enmi-conf.org