1 line
613 KiB
JavaScript
1 line
613 KiB
JavaScript
|
!function (t, e) { "object" == typeof module && "object" == typeof module.exports ? module.exports = t.document ? e(t, !0) : function (t) { if (!t.document) throw new Error("jQuery requires a window with a document"); return e(t) } : e(t) }("undefined" != typeof window ? window : this, function (x, t) { function e(t, e) { return e.toUpperCase() } var n = [], C = x.document, l = n.slice, g = n.concat, a = n.push, i = n.indexOf, r = {}, o = r.toString, d = r.hasOwnProperty, m = {}, s = "2.2.4", k = function (t, e) { return new k.fn.init(t, e) }, u = /^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g, c = /^-ms-/, h = /-([\da-z])/gi; function f(t) { var e = !!t && "length" in t && t.length, n = k.type(t); return "function" !== n && !k.isWindow(t) && ("array" === n || 0 === e || "number" == typeof e && 0 < e && e - 1 in t) } k.fn = k.prototype = { jquery: s, constructor: k, selector: "", length: 0, toArray: function () { return l.call(this) }, get: function (t) { return null != t ? t < 0 ? this[t + this.length] : this[t] : l.call(this) }, pushStack: function (t) { t = k.merge(this.constructor(), t); return t.prevObject = this, t.context = this.context, t }, each: function (t) { return k.each(this, t) }, map: function (n) { return this.pushStack(k.map(this, function (t, e) { return n.call(t, e, t) })) }, slice: function () { return this.pushStack(l.apply(this, arguments)) }, first: function () { return this.eq(0) }, last: function () { return this.eq(-1) }, eq: function (t) { var e = this.length, t = +t + (t < 0 ? e : 0); return this.pushStack(0 <= t && t < e ? [this[t]] : []) }, end: function () { return this.prevObject || this.constructor() }, push: a, sort: n.sort, splice: n.splice }, k.extend = k.fn.extend = function () { var t, e, n, r, i, o = arguments[0] || {}, s = 1, a = arguments.length, u = !1; for ("boolean" == typeof o && (u = o, o = arguments[s] || {}, s++), "object" == typeof o || k.isFunction(o) || (o = {}), s === a && (o = this, s--); s < a; s++)if (null != (t = arguments[s])) for (e in t) i = o[e], n = t[e], o !== n && (u && n && (k.isPlainObject(n) || (r = k.isArray(n))) ? (i = r ? (r = !1, i && k.isArray(i) ? i : []) : i && k.isPlainObject(i) ? i : {}, o[e] = k.extend(u, i, n)) : void 0 !== n && (o[e] = n)); return o }, k.extend({ expando: "jQuery" + (s + Math.random()).replace(/\D/g, ""), isReady: !0, error: function (t) { throw new Error(t) }, noop: function () { }, isFunction: function (t) { return "function" === k.type(t) }, isArray: Array.isArray, isWindow: function (t) { return null != t && t === t.window }, isNumeric: function (t) { var e = t && t.toString(); return !k.isArray(t) && 0 <= e - parseFloat(e) + 1 }, isPlainObject: function (t) { if ("object" !== k.type(t) || t.nodeType || k.isWindow(t)) return !1; if (t.constructor && !d.call(t, "constructor") && !d.call(t.constructor.prototype || {}, "isPrototypeOf")) return !1; for (var e in t); return void 0 === e || d.call(t, e) }, isEmptyObject: function (t) { for (var e in t) return !1; return !0 }, type: function (t) { return null == t ? t + "" : "object" == typeof t || "function" == typeof t ? r[o.call(t)] || "object" : typeof t }, globalEval: function (t) { var e, n = eval; (t = k.trim(t)) && (1 === t.indexOf("use strict") ? ((e = C.createElement("script")).text = t, C.head.appendChild(e).parentNode.removeChild(e)) : n(t)) }, camelCase: function (t) { return t.replace(c, "ms-").replace(h, e) }, nodeName: function (t, e) { return t.nodeName && t.nodeName.toLowerCase() === e.toLowerCase() }, each: function (t, e) { var n, r = 0; if (f(t)) for (n = t.length; r < n && !1 !== e.call(t[r], r, t[r]); r++); else for (r in t) if (!1 === e.call(t[r], r, t[r])) break; return t }, trim: function (t) { return null == t ? "" : (t + "").replace(u, "") }, makeArray: function (t, e) { e = e || []; return null != t && (f(Object(t)) ? k.merge(e, "string" == typeof t ? [t] : t) : a.call(e, t)), e }, inArray: function (t, e, n) { return null == e ? -1 : i.call(e, t, n) }, merge: function (t, e) { for (var n = +e.length, r = 0, i = t.length; r < n; r++)t[i++] = e[r]; return t.len
|