5 lines
22 KiB
JavaScript
5 lines
22 KiB
JavaScript
|
// Underscore.js 1.9.1
|
|||
|
|
// http://underscorejs.org
|
|||
|
|
// (c) 2009-2018 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
|
|||
|
|
// Underscore may be freely distributed under the MIT license.
|
|||
|
|
!function () { var n = "object" == typeof self && self.self === self && self || "object" == typeof global && global.global === global && global || this || {}, r = n._, e = Array.prototype, o = Object.prototype, s = "undefined" != typeof Symbol ? Symbol.prototype : null, u = e.push, c = e.slice, p = o.toString, i = o.hasOwnProperty, t = Array.isArray, a = Object.keys, l = Object.create, f = function () { }, h = function (n) { return n instanceof h ? n : this instanceof h ? void (this._wrapped = n) : new h(n) }; "undefined" == typeof exports || exports.nodeType ? n._ = h : ("undefined" != typeof module && !module.nodeType && module.exports && (exports = module.exports = h), exports._ = h), h.VERSION = "1.9.1"; var v, y = function (u, i, n) { if (void 0 === i) return u; switch (null == n ? 3 : n) { case 1: return function (n) { return u.call(i, n) }; case 3: return function (n, r, t) { return u.call(i, n, r, t) }; case 4: return function (n, r, t, e) { return u.call(i, n, r, t, e) } }return function () { return u.apply(i, arguments) } }, d = function (n, r, t) { return h.iteratee !== v ? h.iteratee(n, r) : null == n ? h.identity : h.isFunction(n) ? y(n, r, t) : h.isObject(n) && !h.isArray(n) ? h.matcher(n) : h.property(n) }; h.iteratee = v = function (n, r) { return d(n, r, 1 / 0) }; var g = function (u, i) { return i = null == i ? u.length - 1 : +i, function () { for (var n = Math.max(arguments.length - i, 0), r = Array(n), t = 0; t < n; t++)r[t] = arguments[t + i]; switch (i) { case 0: return u.call(this, r); case 1: return u.call(this, arguments[0], r); case 2: return u.call(this, arguments[0], arguments[1], r) }var e = Array(i + 1); for (t = 0; t < i; t++)e[t] = arguments[t]; return e[i] = r, u.apply(this, e) } }, m = function (n) { if (!h.isObject(n)) return {}; if (l) return l(n); f.prototype = n; var r = new f; return f.prototype = null, r }, b = function (r) { return function (n) { return null == n ? void 0 : n[r] } }, j = function (n, r) { return null != n && i.call(n, r) }, x = function (n, r) { for (var t = r.length, e = 0; e < t; e++) { if (null == n) return; n = n[r[e]] } return t ? n : void 0 }, _ = Math.pow(2, 53) - 1, A = b("length"), w = function (n) { var r = A(n); return "number" == typeof r && 0 <= r && r <= _ }; h.each = h.forEach = function (n, r, t) { var e, u; if (r = y(r, t), w(n)) for (e = 0, u = n.length; e < u; e++)r(n[e], e, n); else { var i = h.keys(n); for (e = 0, u = i.length; e < u; e++)r(n[i[e]], i[e], n) } return n }, h.map = h.collect = function (n, r, t) { r = d(r, t); for (var e = !w(n) && h.keys(n), u = (e || n).length, i = Array(u), o = 0; o < u; o++) { var a = e ? e[o] : o; i[o] = r(n[a], a, n) } return i }; var O = function (c) { return function (n, r, t, e) { var u = 3 <= arguments.length; return function (n, r, t, e) { var u = !w(n) && h.keys(n), i = (u || n).length, o = 0 < c ? 0 : i - 1; for (e || (t = n[u ? u[o] : o], o += c); 0 <= o && o < i; o += c) { var a = u ? u[o] : o; t = r(t, n[a], a, n) } return t }(n, y(r, e, 4), t, u) } }; h.reduce = h.foldl = h.inject = O(1), h.reduceRight = h.foldr = O(-1), h.find = h.detect = function (n, r, t) { var e = (w(n) ? h.findIndex : h.findKey)(n, r, t); if (void 0 !== e && -1 !== e) return n[e] }, h.filter = h.select = function (n, e, r) { var u = []; return e = d(e, r), h.each(n, function (n, r, t) { e(n, r, t) && u.push(n) }), u }, h.reject = function (n, r, t) { return h.filter(n, h.negate(d(r)), t) }, h.every = h.all = function (n, r, t) { r = d(r, t); for (var e = !w(n) && h.keys(n), u = (e || n).length, i = 0; i < u; i++) { var o = e ? e[i] : i; if (!r(n[o], o, n)) return !1 } return !0 }, h.some = h.any = function (n, r, t) { r = d(r, t); for (var e = !w(n) && h.keys(n), u = (e || n).length, i = 0; i < u; i++) { var o = e ? e[i] : i; if (r(n[o], o, n)) return !0 } return !1 }, h.contains = h.includes = h.include = function (n, r, t, e) { return w(n) || (n = h.values(n)), ("number" != typeof t || e) && (t = 0), 0 <= h.indexOf(n, r, t) }, h.invoke = g(function (n, t, e) { var u, i; return h.isFunction(t) ? i = t : h.isArray(t) && (
|