UNPKG

vusion-api

Version:
414 lines (412 loc) 230 kB
!(function (e, t) { 'use strict'; typeof module === 'object' && typeof module.exports === 'object' ? module.exports = e.document ? t(e, !0) : function (e) { if (!e.document) throw new Error('jQuery requires a window with a document'); return t(e); } : t(e); })(typeof window !== 'undefined' ? window : this, (C, e) => { 'use strict'; function x(e) { return e != null && e === e.window; } const t = []; const E = C.document; const r = Object.getPrototypeOf; const s = t.slice; const g = t.concat; const u = t.push; const i = t.indexOf; const n = {}; const o = n.toString; const v = n.hasOwnProperty; const a = v.toString; const l = a.call(Object); const y = {}; const m = function (e) { return typeof e === 'function' && typeof e.nodeType !== 'number'; }; const c = { type: !0, src: !0, nonce: !0, noModule: !0 }; function b(e, t, n) { let r; let i; const o = (n = n || E).createElement('script'); if (o.text = e, t) for (r in c) (i = t[r] || t.getAttribute && t.getAttribute(r)) && o.setAttribute(r, i); n.head.appendChild(o).parentNode.removeChild(o); } function w(e) { return e == null ? e + '' : typeof e === 'object' || typeof e === 'function' ? n[o.call(e)] || 'object' : typeof e; } const f = '3.4.1'; var k = function (e, t) { return new k.fn.init(e, t); }; const p = /^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g; function d(e) { const t = !!e && 'length' in e && e.length; const n = w(e); return !m(e) && !x(e) && (n === 'array' || t === 0 || typeof t === 'number' && t > 0 && t - 1 in e); }k.fn = k.prototype = { jquery: f, constructor: k, length: 0, toArray() { return s.call(this); }, get(e) { return e == null ? s.call(this) : e < 0 ? this[e + this.length] : this[e]; }, pushStack(e) { const t = k.merge(this.constructor(), e); return t.prevObject = this, t; }, each(e) { return k.each(this, e); }, map(n) { return this.pushStack(k.map(this, (e, t) => n.call(e, t, e))); }, slice() { return this.pushStack(s.apply(this, arguments)); }, first() { return this.eq(0); }, last() { return this.eq(-1); }, eq(e) { const t = this.length; const n = +e + (e < 0 ? t : 0); return this.pushStack(n >= 0 && n < t ? [this[n]] : []); }, end() { return this.prevObject || this.constructor(); }, push: u, sort: t.sort, splice: t.splice }, k.extend = k.fn.extend = function () { let e; let t; let n; let r; let i; let o; let a = arguments[0] || {}; let s = 1; const u = arguments.length; let l = !1; for (typeof a === 'boolean' && (l = a, a = arguments[s] || {}, s++), typeof a === 'object' || m(a) || (a = {}), s === u && (a = this, s--); s < u; s++) if ((e = arguments[s]) != null) for (t in e) r = e[t], t !== '__proto__' && a !== r && (l && r && (k.isPlainObject(r) || (i = Array.isArray(r))) ? (n = a[t], o = i && !Array.isArray(n) ? [] : i || k.isPlainObject(n) ? n : {}, i = !1, a[t] = k.extend(l, o, r)) : void 0 !== r && (a[t] = r)); return a; }, k.extend({ expando: 'jQuery' + (f + Math.random()).replace(/\D/g, ''), isReady: !0, error(e) { throw new Error(e); }, noop() {}, isPlainObject(e) { let t; let n; return !(!e || o.call(e) !== '[object Object]' || (t = r(e)) && (typeof (n = v.call(t, 'constructor') && t.constructor) !== 'function' || a.call(n) !== l)); }, isEmptyObject(e) { let t; for (t in e) return !1; return !0; }, globalEval(e, t) { b(e, { nonce: t && t.nonce }); }, each(e, t) { let n; let r = 0; if (d(e)) for (n = e.length; r < n && !1 !== t.call(e[r], r, e[r]); r++) ;else for (r in e) if (!1 === t.call(e[r], r, e[r])) break; return e; }, trim(e) { return e == null ? '' : (e + '').replace(p, ''); }, makeArray(e, t) { const n = t || []; return e != null && (d(Object(e)) ? k.merge(n, typeof e === 'string' ? [e] : e) : u.call(n, e)), n; }, inArray(e, t, n) { return t == null ? -1 : i.call(t, e, n); }, merge(e, t) { for (var n = +t.length, r = 0, i = e.length; r < n; r++) e[i++] = t[r]; return e.length = i, e; }, grep(e, t, n) { for (var r = [], i = 0, o = e.length, a = !n; i < o; i++) !t(e[i], i) != a && r.push(e[i]); return r; }, map(e, t, n) { let r; let i; let o = 0; const a = []; if (d(e)) for (r = e.length; o < r; o++) (i = t(e[o], o, n)) != null && a.push(i); else for (o in e) (i = t(e[o], o, n)) != null && a.push(i); return g.apply([], a); }, guid: 1, support: y }), typeof Symbol === 'function' && (k.fn[Symbol.iterator] = t[Symbol.iterator]), k.each('Boolean Number String Function Array Date RegExp Object Error Symbol'.split(' '), (e, t) => { n['[object ' + t + ']'] = t.toLowerCase(); }); const h = (function (n) { function ne(e, t, n) { const r = '0x' + t - 65536; return r != r || n ? t : r < 0 ? String.fromCharCode(65536 + r) : String.fromCharCode(r >> 10 | 55296, 1023 & r | 56320); } function oe() { T(); } let e; let d; let b; let o; let i; let h; let f; let g; let w; let u; let l; let T; let C; let a; let E; let v; let s; let c; let y; const k = 'sizzle' + 1 * new Date(); const m = n.document; let S = 0; let r = 0; const p = ue(); const x = ue(); const N = ue(); const A = ue(); let D = function (e, t) { return e === t && (l = !0), 0; }; const j = {}.hasOwnProperty; let t = []; const q = t.pop; const L = t.push; let H = t.push; const O = t.slice; const P = function (e, t) { for (let n = 0, r = e.length; n < r; n++) if (e[n] === t) return n; return -1; }; const R = 'checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|ismap|loop|multiple|open|readonly|required|scoped'; const M = '[\\x20\\t\\r\\n\\f]'; const I = '(?:\\\\.|[\\w-]|[^\0-\\xa0])+'; const W = '\\[' + M + '*(' + I + ')(?:' + M + '*([*^$|!~]?=)' + M + "*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|(" + I + '))|)' + M + '*\\]'; const $ = ':(' + I + ")(?:\\((('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|((?:\\\\.|[^\\\\()[\\]]|" + W + ')*)|.*)\\)|)'; const F = new RegExp(M + '+', 'g'); const B = new RegExp('^' + M + '+|((?:^|[^\\\\])(?:\\\\.)*)' + M + '+$', 'g'); const _ = new RegExp('^' + M + '*,' + M + '*'); const z = new RegExp('^' + M + '*([>+~]|' + M + ')' + M + '*'); const U = new RegExp(M + '|>'); const X = new RegExp($); const V = new RegExp('^' + I + '$'); const G = { ID: new RegExp('^#(' + I + ')'), CLASS: new RegExp('^\\.(' + I + ')'), TAG: new RegExp('^(' + I + '|[*])'), ATTR: new RegExp('^' + W), PSEUDO: new RegExp('^' + $), CHILD: new RegExp('^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\(' + M + '*(even|odd|(([+-]|)(\\d*)n|)' + M + '*(?:([+-]|)' + M + '*(\\d+)|))' + M + '*\\)|)', 'i'), bool: new RegExp('^(?:' + R + ')$', 'i'), needsContext: new RegExp('^' + M + '*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\(' + M + '*((?:-\\d)?\\d*)' + M + '*\\)|)(?=[^-]|$)', 'i') }; const Y = /HTML$/i; const Q = /^(?:input|select|textarea|button)$/i; const J = /^h\d$/i; const K = /^[^{]+\{\s*\[native \w/; const Z = /^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/; const ee = /[+~]/; const te = new RegExp('\\\\([\\da-f]{1,6}' + M + '?|(' + M + ')|.)', 'ig'); const re = /([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g; const ie = function (e, t) { return t ? e === '\0' ? '�' : e.slice(0, -1) + '\\' + e.charCodeAt(e.length - 1).toString(16) + ' ' : '\\' + e; }; const ae = be((e) => !0 === e.disabled && e.nodeName.toLowerCase() === 'fieldset', { dir: 'parentNode', next: 'legend' }); try { H.apply(t = O.call(m.childNodes), m.childNodes), t[m.childNodes.length].nodeType; } catch (e) { H = { apply: t.length ? function (e, t) { L.apply(e, O.call(t)); } : function (e, t) { for (var n = e.length, r = 0; e[n++] = t[r++];) ;e.length = n - 1; } }; } function se(t, e, n, r) { let i; let o; let a; let s; let u; let l; let c; let f = e && e.ownerDocument; const p = e ? e.nodeType : 9; if (n = n || [], typeof t !== 'string' || !t || p !== 1 && p !== 9 && p !== 11) return n; if (!r && ((e ? e.ownerDocument || e : m) !== C && T(e), e = e || C, E)) { if (p !== 11 && (u = Z.exec(t))) if (i = u[1]) { if (p === 9) { if (!(a = e.getElementById(i))) return n; if (a.id === i) return n.push(a), n; } else if (f && (a = f.getElementById(i)) && y(e, a) && a.id === i) return n.push(a), n; } else { if (u[2]) return H.apply(n, e.getElementsByTagName(t)), n; if ((i = u[3]) && d.getElementsByClassName && e.getElementsByClassName) return H.apply(n, e.getElementsByClassName(i)), n; } if (d.qsa && !A[t + ' '] && (!v || !v.test(t)) && (p !== 1 || e.nodeName.toLowerCase() !== 'object')) { if (c = t, f = e, p === 1 && U.test(t)) { for ((s = e.getAttribute('id')) ? s = s.replace(re, ie) : e.setAttribute('id', s = k), o = (l = h(t)).length; o--;) l[o] = '#' + s + ' ' + xe(l[o]); c = l.join(','), f = ee.test(t) && ye(e.parentNode) || e; } try { return H.apply(n, f.querySelectorAll(c)), n; } catch (e) { A(t, !0); } finally { s === k && e.removeAttribute('id'); } } } return g(t.replace(B, '$1'), e, n, r); } function ue() { const r = []; return function e(t, n) { return r.push(t + ' ') > b.cacheLength && delete e[r.shift()], e[t + ' '] = n; }; } function le(e) { return e[k] = !0, e; } function ce(e) { let t = C.createElement('fieldset'); try { return !!e(t); } catch (e) { return !1; } finally { t.parentNode && t.parentNode.removeChild(t), t = null; } } function fe(e, t) { for (let n = e.split('|'), r = n.length; r--;) b.attrHandle[n[r]] = t; } function pe(e, t) { let n = t && e; const r = n && e.nodeType === 1 && t.nodeType === 1 && e.sourceIndex - t.sourceIndex; if (r) return r; if (n) for (;n = n.nextSibling;) if (n === t) return -1; return e ? 1 : -1; } function de(t) { return function (e) { return e.nodeName.toLowerCase() === 'input' && e.type === t; }; } function he(n) { return function (e) { const t = e.nodeName.toLowerCase(); return (t === 'input' || t === 'button') && e.type === n; }; } function ge(t) { return function (e) { return 'form' in e ? e.parentNode && !1 === e.disabled ? 'label' in e ? 'label' in e.parentNode ? e.parentNode.disabled === t : e.disabled === t : e.isDisabled === t || e.isDisabled !== !t && ae(e) === t : e.disabled === t : 'label' in e && e.disabled === t; }; } function ve(a) { return le((o) => o = +o, le((e, t) => { for (var n, r = a([], e.length, o), i = r.length; i--;) e[n = r[i]] && (e[n] = !(t[n] = e[n])); })); } function ye(e) { return e && void 0 !== e.getElementsByTagName && e; } for (e in d = se.support = {}, i = se.isXML = function (e) { const t = e.namespaceURI; const n = (e.ownerDocument || e).documentElement; return !Y.test(t || n && n.nodeName || 'HTML'); }, T = se.setDocument = function (e) { let t; let n; const r = e ? e.ownerDocument || e : m; return r !== C && r.nodeType === 9 && r.documentElement && (a = (C = r).documentElement, E = !i(C), m !== C && (n = C.defaultView) && n.top !== n && (n.addEventListener ? n.addEventListener('unload', oe, !1) : n.attachEvent && n.attachEvent('onunload', oe)), d.attributes = ce((e) => e.className = 'i', !e.getAttribute('className')), d.getElementsByTagName = ce((e) => e.appendChild(C.createComment('')), !e.getElementsByTagName('*').length), d.getElementsByClassName = K.test(C.getElementsByClassName), d.getById = ce((e) => a.appendChild(e).id = k, !C.getElementsByName || !C.getElementsByName(k).length), d.getById ? (b.filter.ID = function (e) { const t = e.replace(te, ne); return function (e) { return e.getAttribute('id') === t; }; }, b.find.ID = function (e, t) { if (void 0 !== t.getElementById && E) { const n = t.getElementById(e); return n ? [n] : []; } }) : (b.filter.ID = function (e) { const n = e.replace(te, ne); return function (e) { const t = void 0 !== e.getAttributeNode && e.getAttributeNode('id'); return t && t.value === n; }; }, b.find.ID = function (e, t) { if (void 0 !== t.getElementById && E) { let n; let r; let i; let o = t.getElementById(e); if (o) { if ((n = o.getAttributeNode('id')) && n.value === e) return [o]; for (i = t.getElementsByName(e), r = 0; o = i[r++];) if ((n = o.getAttributeNode('id')) && n.value === e) return [o]; } return []; } }), b.find.TAG = d.getElementsByTagName ? function (e, t) { return void 0 !== t.getElementsByTagName ? t.getElementsByTagName(e) : d.qsa ? t.querySelectorAll(e) : void 0; } : function (e, t) { let n; const r = []; let i = 0; const o = t.getElementsByTagName(e); if (e !== '*') return o; for (;n = o[i++];) n.nodeType === 1 && r.push(n); return r; }, b.find.CLASS = d.getElementsByClassName && function (e, t) { if (void 0 !== t.getElementsByClassName && E) return t.getElementsByClassName(e); }, s = [], v = [], (d.qsa = K.test(C.querySelectorAll)) && (ce((e) => { a.appendChild(e).innerHTML = "<a id='" + k + "'></a><select id='" + k + "-\r\\' msallowcapture=''><option selected=''></option></select>", e.querySelectorAll("[msallowcapture^='']").length && v.push('[*^$]=' + M + "*(?:''|\"\")"), e.querySelectorAll('[selected]').length || v.push('\\[' + M + '*(?:value|' + R + ')'), e.querySelectorAll('[id~=' + k + '-]').length || v.push('~='), e.querySelectorAll(':checked').length || v.push(':checked'), e.querySelectorAll('a#' + k + '+*').length || v.push('.#.+[+~]'); }), ce((e) => { e.innerHTML = "<a href='' disabled='disabled'></a><select disabled='disabled'><option/></select>"; const t = C.createElement('input'); t.setAttribute('type', 'hidden'), e.appendChild(t).setAttribute('name', 'D'), e.querySelectorAll('[name=d]').length && v.push('name' + M + '*[*^$|!~]?='), e.querySelectorAll(':enabled').length !== 2 && v.push(':enabled', ':disabled'), a.appendChild(e).disabled = !0, e.querySelectorAll(':disabled').length !== 2 && v.push(':enabled', ':disabled'), e.querySelectorAll('*,:x'), v.push(',.*:'); })), (d.matchesSelector = K.test(c = a.matches || a.webkitMatchesSelector || a.mozMatchesSelector || a.oMatchesSelector || a.msMatchesSelector)) && ce((e) => { d.disconnectedMatch = c.call(e, '*'), c.call(e, "[s!='']:x"), s.push('!=', $); }), v = v.length && new RegExp(v.join('|')), s = s.length && new RegExp(s.join('|')), t = K.test(a.compareDocumentPosition), y = t || K.test(a.contains) ? function (e, t) { const n = e.nodeType === 9 ? e.documentElement : e; const r = t && t.parentNode; return e === r || !(!r || r.nodeType !== 1 || !(n.contains ? n.contains(r) : e.compareDocumentPosition && 16 & e.compareDocumentPosition(r))); } : function (e, t) { if (t) for (;t = t.parentNode;) if (t === e) return !0; return !1; }, D = t ? function (e, t) { if (e === t) return l = !0, 0; let n = !e.compareDocumentPosition - !t.compareDocumentPosition; return n || (1 & (n = (e.ownerDocument || e) === (t.ownerDocument || t) ? e.compareDocumentPosition(t) : 1) || !d.sortDetached && t.compareDocumentPosition(e) === n ? e === C || e.ownerDocument === m && y(m, e) ? -1 : t === C || t.ownerDocument === m && y(m, t) ? 1 : u ? P(u, e) - P(u, t) : 0 : 4 & n ? -1 : 1); } : function (e, t) { if (e === t) return l = !0, 0; let n; let r = 0; const i = e.parentNode; const o = t.parentNode; const a = [e]; const s = [t]; if (!i || !o) return e === C ? -1 : t === C ? 1 : i ? -1 : o ? 1 : u ? P(u, e) - P(u, t) : 0; if (i === o) return pe(e, t); for (n = e; n = n.parentNode;) a.unshift(n); for (n = t; n = n.parentNode;) s.unshift(n); for (;a[r] === s[r];) r++; return r ? pe(a[r], s[r]) : a[r] === m ? -1 : s[r] === m ? 1 : 0; }), C; }, se.matches = function (e, t) { return se(e, null, null, t); }, se.matchesSelector = function (e, t) { if ((e.ownerDocument || e) !== C && T(e), d.matchesSelector && E && !A[t + ' '] && (!s || !s.test(t)) && (!v || !v.test(t))) try { const n = c.call(e, t); if (n || d.disconnectedMatch || e.document && e.document.nodeType !== 11) return n; } catch (e) { A(t, !0); } return se(t, C, null, [e]).length > 0; }, se.contains = function (e, t) { return (e.ownerDocument || e) !== C && T(e), y(e, t); }, se.attr = function (e, t) { (e.ownerDocument || e) !== C && T(e); const n = b.attrHandle[t.toLowerCase()]; let r = n && j.call(b.attrHandle, t.toLowerCase()) ? n(e, t, !E) : void 0; return void 0 !== r ? r : d.attributes || !E ? e.getAttribute(t) : (r = e.getAttributeNode(t)) && r.specified ? r.value : null; }, se.escape = function (e) { return (e + '').replace(re, ie); }, se.error = function (e) { throw new Error('Syntax error, unrecognized expression: ' + e); }, se.uniqueSort = function (e) { let t; const n = []; let r = 0; let i = 0; if (l = !d.detectDuplicates, u = !d.sortStable && e.slice(0), e.sort(D), l) { for (;t = e[i++];) t === e[i] && (r = n.push(i)); for (;r--;) e.splice(n[r], 1); } return u = null, e; }, o = se.getText = function (e) { let t; let n = ''; let r = 0; const i = e.nodeType; if (i) { if (i === 1 || i === 9 || i === 11) { if (typeof e.textContent === 'string') return e.textContent; for (e = e.firstChild; e; e = e.nextSibling) n += o(e); } else if (i === 3 || i === 4) return e.nodeValue; } else for (;t = e[r++];) n += o(t); return n; }, (b = se.selectors = { cacheLength: 50, createPseudo: le, match: G, attrHandle: {}, find: {}, relative: { '>': { dir: 'parentNode', first: !0 }, ' ': { dir: 'parentNode' }, '+': { dir: 'previousSibling', first: !0 }, '~': { dir: 'previousSibling' } }, preFilter: { ATTR(e) { return e[1] = e[1].replace(te, ne), e[3] = (e[3] || e[4] || e[5] || '').replace(te, ne), e[2] === '~=' && (e[3] = ' ' + e[3] + ' '), e.slice(0, 4); }, CHILD(e) { return e[1] = e[1].toLowerCase(), e[1].slice(0, 3) === 'nth' ? (e[3] || se.error(e[0]), e[4] = +(e[4] ? e[5] + (e[6] || 1) : 2 * (e[3] === 'even' || e[3] === 'odd')), e[5] = +(e[7] + e[8] || e[3] === 'odd')) : e[3] && se.error(e[0]), e; }, PSEUDO(e) { let t; const n = !e[6] && e[2]; return G.CHILD.test(e[0]) ? null : (e[3] ? e[2] = e[4] || e[5] || '' : n && X.test(n) && (t = h(n, !0)) && (t = n.indexOf(')', n.length - t) - n.length) && (e[0] = e[0].slice(0, t), e[2] = n.slice(0, t)), e.slice(0, 3)); } }, filter: { TAG(e) { const t = e.replace(te, ne).toLowerCase(); return e === '*' ? function () { return !0; } : function (e) { return e.nodeName && e.nodeName.toLowerCase() === t; }; }, CLASS(e) { let t = p[e + ' ']; return t || (t = new RegExp('(^|' + M + ')' + e + '(' + M + '|$)')) && p(e, (e) => t.test(typeof e.className === 'string' && e.className || void 0 !== e.getAttribute && e.getAttribute('class') || '')); }, ATTR(n, r, i) { return function (e) { let t = se.attr(e, n); return t == null ? r === '!=' : !r || (t += '', r === '=' ? t === i : r === '!=' ? t !== i : r === '^=' ? i && t.indexOf(i) === 0 : r === '*=' ? i && t.indexOf(i) > -1 : r === '$=' ? i && t.slice(-i.length) === i : r === '~=' ? (' ' + t.replace(F, ' ') + ' ').indexOf(i) > -1 : r === '|=' && (t === i || t.slice(0, i.length + 1) === i + '-')); }; }, CHILD(h, e, t, g, v) { const y = h.slice(0, 3) !== 'nth'; const m = h.slice(-4) !== 'last'; const x = e === 'of-type'; return g === 1 && v === 0 ? function (e) { return !!e.parentNode; } : function (e, t, n) { let r; let i; let o; let a; let s; let u; let l = y != m ? 'nextSibling' : 'previousSibling'; const c = e.parentNode; const f = x && e.nodeName.toLowerCase(); const p = !n && !x; let d = !1; if (c) { if (y) { for (;l;) { for (a = e; a = a[l];) if (x ? a.nodeName.toLowerCase() === f : a.nodeType === 1) return !1; u = l = h === 'only' && !u && 'nextSibling'; } return !0; } if (u = [m ? c.firstChild : c.lastChild], m && p) { for (d = (s = (r = (i = (o = (a = c)[k] || (a[k] = {}))[a.uniqueID] || (o[a.uniqueID] = {}))[h] || [])[0] === S && r[1]) && r[2], a = s && c.childNodes[s]; a = ++s && a && a[l] || (d = s = 0) || u.pop();) if (a.nodeType === 1 && ++d && a === e) { i[h] = [S, s, d]; break; } } else if (p && (d = s = (r = (i = (o = (a = e)[k] || (a[k] = {}))[a.uniqueID] || (o[a.uniqueID] = {}))[h] || [])[0] === S && r[1]), !1 === d) for (;(a = ++s && a && a[l] || (d = s = 0) || u.pop()) && ((x ? a.nodeName.toLowerCase() !== f : a.nodeType !== 1) || !++d || (p && ((i = (o = a[k] || (a[k] = {}))[a.uniqueID] || (o[a.uniqueID] = {}))[h] = [S, d]), a !== e));) ;return (d -= v) === g || d % g == 0 && d / g >= 0; } }; }, PSEUDO(e, o) { let t; const a = b.pseudos[e] || b.setFilters[e.toLowerCase()] || se.error('unsupported pseudo: ' + e); return a[k] ? a(o) : a.length > 1 ? (t = [e, e, '', o], b.setFilters.hasOwnProperty(e.toLowerCase()) ? le((e, t) => { for (var n, r = a(e, o), i = r.length; i--;) e[n = P(e, r[i])] = !(t[n] = r[i]); }) : function (e) { return a(e, 0, t); }) : a; } }, pseudos: { not: le((e) => { const r = []; const i = []; const s = f(e.replace(B, '$1')); return s[k] ? le((e, t, n, r) => { for (var i, o = s(e, null, r, []), a = e.length; a--;) (i = o[a]) && (e[a] = !(t[a] = i)); }) : function (e, t, n) { return r[0] = e, s(r, null, n, i), r[0] = null, !i.pop(); }; }), has: le((t) => function (e) { return se(t, e).length > 0; }), contains: le((t) => t = t.replace(te, ne), (e) => (e.textContent || o(e)).indexOf(t) > -1), lang: le((n) => V.test(n || '') || se.error('unsupported lang: ' + n), n = n.replace(te, ne).toLowerCase(), (e) => { let t; do { if (t = E ? e.lang : e.getAttribute('xml:lang') || e.getAttribute('lang')) return (t = t.toLowerCase()) === n || t.indexOf(n + '-') === 0; } while ((e = e.parentNode) && e.nodeType === 1);return !1; }), target(e) { const t = n.location && n.location.hash; return t && t.slice(1) === e.id; }, root(e) { return e === a; }, focus(e) { return e === C.activeElement && (!C.hasFocus || C.hasFocus()) && !!(e.type || e.href || ~e.tabIndex); }, enabled: ge(!1), disabled: ge(!0), checked(e) { const t = e.nodeName.toLowerCase(); return t === 'input' && !!e.checked || t === 'option' && !!e.selected; }, selected(e) { return e.parentNode && e.parentNode.selectedIndex, !0 === e.selected; }, empty(e) { for (e = e.firstChild; e; e = e.nextSibling) if (e.nodeType < 6) return !1; return !0; }, parent(e) { return !b.pseudos.empty(e); }, header(e) { return J.test(e.nodeName); }, input(e) { return Q.test(e.nodeName); }, button(e) { const t = e.nodeName.toLowerCase(); return t === 'input' && e.type === 'button' || t === 'button'; }, text(e) { let t; return e.nodeName.toLowerCase() === 'input' && e.type === 'text' && ((t = e.getAttribute('type')) == null || t.toLowerCase() === 'text'); }, first: ve(() => [0]), last: ve((e, t) => [t - 1]), eq: ve((e, t, n) => [n < 0 ? n + t : n]), even: ve((e, t) => { for (let n = 0; n < t; n += 2) e.push(n); return e; }), odd: ve((e, t) => { for (let n = 1; n < t; n += 2) e.push(n); return e; }), lt: ve((e, t, n) => { for (let r = n < 0 ? n + t : t < n ? t : n; --r >= 0;) e.push(r); return e; }), gt: ve((e, t, n) => { for (let r = n < 0 ? n + t : n; ++r < t;) e.push(r); return e; }) } }).pseudos.nth = b.pseudos.eq, { radio: !0, checkbox: !0, file: !0, password: !0, image: !0 }) b.pseudos[e] = de(e); for (e in { submit: !0, reset: !0 }) b.pseudos[e] = he(e); function me() {} function xe(e) { for (var t = 0, n = e.length, r = ''; t < n; t++) r += e[t].value; return r; } function be(s, e, t) { const u = e.dir; const l = e.next; const c = l || u; const f = t && c === 'parentNode'; const p = r++; return e.first ? function (e, t, n) { for (;e = e[u];) if (e.nodeType === 1 || f) return s(e, t, n); return !1; } : function (e, t, n) { let r; let i; let o; const a = [S, p]; if (n) { for (;e = e[u];) if ((e.nodeType === 1 || f) && s(e, t, n)) return !0; } else for (;e = e[u];) if (e.nodeType === 1 || f) if (i = (o = e[k] || (e[k] = {}))[e.uniqueID] || (o[e.uniqueID] = {}), l && l === e.nodeName.toLowerCase()) e = e[u] || e; else { if ((r = i[c]) && r[0] === S && r[1] === p) return a[2] = r[2]; if ((i[c] = a)[2] = s(e, t, n)) return !0; } return !1; }; } function we(i) { return i.length > 1 ? function (e, t, n) { for (let r = i.length; r--;) if (!i[r](e, t, n)) return !1; return !0; } : i[0]; } function Te(e, t, n, r, i) { for (var o, a = [], s = 0, u = e.length, l = t != null; s < u; s++) (o = e[s]) && (n && !n(o, r, i) || (a.push(o), l && t.push(s))); return a; } function Ce(d, h, g, v, y, e) { return v && !v[k] && (v = Ce(v)), y && !y[k] && (y = Ce(y, e)), le((e, t, n, r) => { let i; let o; let a; const s = []; const u = []; const l = t.length; const c = e || (function (e, t, n) { for (let r = 0, i = t.length; r < i; r++) se(e, t[r], n); return n; })(h || '*', n.nodeType ? [n] : n, []); const f = !d || !e && h ? c : Te(c, s, d, n, r); let p = g ? y || (e ? d : l || v) ? [] : t : f; if (g && g(f, p, n, r), v) for (i = Te(p, u), v(i, [], n, r), o = i.length; o--;) (a = i[o]) && (p[u[o]] = !(f[u[o]] = a)); if (e) { if (y || d) { if (y) { for (i = [], o = p.length; o--;) (a = p[o]) && i.push(f[o] = a); y(null, p = [], i, r); } for (o = p.length; o--;) (a = p[o]) && (i = y ? P(e, a) : s[o]) > -1 && (e[i] = !(t[i] = a)); } } else p = Te(p === t ? p.splice(l, p.length) : p), y ? y(null, t, p, r) : H.apply(t, p); }); } function Ee(e) { for (var i, t, n, r = e.length, o = b.relative[e[0].type], a = o || b.relative[' '], s = o ? 1 : 0, u = be((e) => e === i, a, !0), l = be((e) => P(i, e) > -1, a, !0), c = [function (e, t, n) { const r = !o && (n || t !== w) || ((i = t).nodeType ? u(e, t, n) : l(e, t, n)); return i = null, r; }]; s < r; s++) if (t = b.relative[e[s].type]) c = [be(we(c), t)]; else { if ((t = b.filter[e[s].type].apply(null, e[s].matches))[k]) { for (n = ++s; n < r && !b.relative[e[n].type]; n++) ;return Ce(s > 1 && we(c), s > 1 && xe(e.slice(0, s - 1).concat({ value: e[s - 2].type === ' ' ? '*' : '' })).replace(B, '$1'), t, s < n && Ee(e.slice(s, n)), n < r && Ee(e = e.slice(n)), n < r && xe(e)); }c.push(t); } return we(c); } return me.prototype = b.filters = b.pseudos, b.setFilters = new me(), h = se.tokenize = function (e, t) { let n; let r; let i; let o; let a; let s; let u; const l = x[e + ' ']; if (l) return t ? 0 : l.slice(0); for (a = e, s = [], u = b.preFilter; a;) { for (o in n && !(r = _.exec(a)) || (r && (a = a.slice(r[0].length) || a), s.push(i = [])), n = !1, (r = z.exec(a)) && (n = r.shift(), i.push({ value: n, type: r[0].replace(B, ' ') }), a = a.slice(n.length)), b.filter) !(r = G[o].exec(a)) || u[o] && !(r = u[o](r)) || (n = r.shift(), i.push({ value: n, type: o, matches: r }), a = a.slice(n.length)); if (!n) break; } return t ? a.length : a ? se.error(e) : x(e, s).slice(0); }, f = se.compile = function (e, t) { let n; let v; let y; let m; let x; let r; const i = []; const o = []; let a = N[e + ' ']; if (!a) { for (t || (t = h(e)), n = t.length; n--;) (a = Ee(t[n]))[k] ? i.push(a) : o.push(a); (a = N(e, (v = o, m = (y = i).length > 0, x = v.length > 0, r = function (e, t, n, r, i) { let o; let a; let s; let u = 0; let l = '0'; const c = e && []; let f = []; const p = w; const d = e || x && b.find.TAG('*', i); const h = S += p == null ? 1 : Math.random() || 0.1; const g = d.length; for (i && (w = t === C || t || i); l !== g && (o = d[l]) != null; l++) { if (x && o) { for (a = 0, t || o.ownerDocument === C || (T(o), n = !E); s = v[a++];) if (s(o, t || C, n)) { r.push(o); break; }i && (S = h); }m && ((o = !s && o) && u--, e && c.push(o)); } if (u += l, m && l !== u) { for (a = 0; s = y[a++];) s(c, f, t, n); if (e) { if (u > 0) for (;l--;) c[l] || f[l] || (f[l] = q.call(r)); f = Te(f); }H.apply(r, f), i && !e && f.length > 0 && u + y.length > 1 && se.uniqueSort(r); } return i && (S = h, w = p), c; }, m ? le(r) : r))).selector = e; } return a; }, g = se.select = function (e, t, n, r) { let i; let o; let a; let s; let u; const l = typeof e === 'function' && e; const c = !r && h(e = l.selector || e); if (n = n || [], c.length === 1) { if ((o = c[0] = c[0].slice(0)).length > 2 && (a = o[0]).type === 'ID' && t.nodeType === 9 && E && b.relative[o[1].type]) { if (!(t = (b.find.ID(a.matches[0].replace(te, ne), t) || [])[0])) return n; l && (t = t.parentNode), e = e.slice(o.shift().value.length); } for (i = G.needsContext.test(e) ? 0 : o.length; i-- && (a = o[i], !b.relative[s = a.type]);) if ((u = b.find[s]) && (r = u(a.matches[0].replace(te, ne), ee.test(o[0].type) && ye(t.parentNode) || t))) { if (o.splice(i, 1), !(e = r.length && xe(o))) return H.apply(n, r), n; break; } } return (l || f(e, c))(r, t, !E, n, !t || ee.test(e) && ye(t.parentNode) || t), n; }, d.sortStable = k.split('').sort(D).join('') === k, d.detectDuplicates = !!l, T(), d.sortDetached = ce((e) => 1 & e.compareDocumentPosition(C.createElement('fieldset'))), ce((e) => e.innerHTML = "<a href='#'></a>", e.firstChild.getAttribute('href') === '#') || fe('type|href|height|width', (e, t, n) => { if (!n) return e.getAttribute(t, t.toLowerCase() === 'type' ? 1 : 2); }), d.attributes && ce((e) => e.innerHTML = '<input/>', e.firstChild.setAttribute('value', ''), e.firstChild.getAttribute('value') === '') || fe('value', (e, t, n) => { if (!n && e.nodeName.toLowerCase() === 'input') return e.defaultValue; }), ce((e) => e.getAttribute('disabled') == null) || fe(R, (e, t, n) => { let r; if (!n) return !0 === e[t] ? t.toLowerCase() : (r = e.getAttributeNode(t)) && r.specified ? r.value : null; }), se; })(C); k.find = h, k.expr = h.selectors, k.expr[':'] = k.expr.pseudos, k.uniqueSort = k.unique = h.uniqueSort, k.text = h.getText, k.isXMLDoc = h.isXML, k.contains = h.contains, k.escapeSelector = h.escape; function T(e, t, n) { for (var r = [], i = void 0 !== n; (e = e[t]) && e.nodeType !== 9;) if (e.nodeType === 1) { if (i && k(e).is(n)) break; r.push(e); } return r; } function S(e, t) { for (var n = []; e; e = e.nextSibling) e.nodeType === 1 && e !== t && n.push(e); return n; } const N = k.expr.match.needsContext; function A(e, t) { return e.nodeName && e.nodeName.toLowerCase() === t.toLowerCase(); } const D = /^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i; function j(e, n, r) { return m(n) ? k.grep(e, (e, t) => !!n.call(e, t, e) !== r) : n.nodeType ? k.grep(e, (e) => e === n !== r) : typeof n !== 'string' ? k.grep(e, (e) => i.call(n, e) > -1 !== r) : k.filter(n, e, r); }k.filter = function (e, t, n) { const r = t[0]; return n && (e = ':not(' + e + ')'), t.length === 1 && r.nodeType === 1 ? k.find.matchesSelector(r, e) ? [r] : [] : k.find.matches(e, k.grep(t, (e) => e.nodeType === 1)); }, k.fn.extend({ find(e) { let t; let n; const r = this.length; const i = this; if (typeof e !== 'string') return this.pushStack(k(e).filter(function () { for (t = 0; t < r; t++) if (k.contains(i[t], this)) return !0; })); for (n = this.pushStack([]), t = 0; t < r; t++) k.find(e, i[t], n); return r > 1 ? k.uniqueSort(n) : n; }, filter(e) { return this.pushStack(j(this, e || [], !1)); }, not(e) { return this.pushStack(j(this, e || [], !0)); }, is(e) { return !!j(this, typeof e === 'string' && N.test(e) ? k(e) : e || [], !1).length; } }); let q; const L = /^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/; (k.fn.init = function (e, t, n) { let r; let i; if (!e) return this; if (n = n || q, typeof e !== 'string') return e.nodeType ? (this[0] = e, this.length = 1, this) : m(e) ? void 0 !== n.ready ? n.ready(e) : e(k) : k.makeArray(e, this); if (!(r = e[0] === '<' && e[e.length - 1] === '>' && e.length >= 3 ? [null, e, null] : L.exec(e)) || !r[1] && t) return !t || t.jquery ? (t || n).find(e) : this.constructor(t).find(e); if (r[1]) { if (t = t instanceof k ? t[0] : t, k.merge(this, k.parseHTML(r[1], t && t.nodeType ? t.ownerDocument || t : E, !0)), D.test(r[1]) && k.isPlainObject(t)) for (r in t) m(this[r]) ? this[r](t[r]) : this.attr(r, t[r]); return this; } return (i = E.getElementById(r[2])) && (this[0] = i, this.length = 1), this; }).prototype = k.fn, q = k(E); const H = /^(?:parents|prev(?:Until|All))/; const O = { children: !0, contents: !0, next: !0, prev: !0 }; function P(e, t) { for (;(e = e[t]) && e.nodeType !== 1;) ;return e; }k.fn.extend({ has(e) { const t = k(e, this); const n = t.length; return this.filter(function () { for (let e = 0; e < n; e++) if (k.contains(this, t[e])) return !0; }); }, closest(e, t) { let n; let r = 0; const i = this.length; const o = []; const a = typeof e !== 'string' && k(e); if (!N.test(e)) for (;r < i; r++) for (n = this[r]; n && n !== t; n = n.parentNode) if (n.nodeType < 11 && (a ? a.index(n) > -1 : n.nodeType === 1 && k.find.matchesSelector(n, e))) { o.push(n); break; } return this.pushStack(o.length > 1 ? k.uniqueSort(o) : o); }, index(e) { return e ? typeof e === 'string' ? i.call(k(e), this[0]) : i.call(this, e.jquery ? e[0] : e) : this[0] && this[0].parentNode ? this.first().prevAll().length : -1; }, add(e, t) { return this.pushStack(k.uniqueSort(k.merge(this.get(), k(e, t)))); }, addBack(e) { return this.add(e == null ? this.prevObject : this.prevObject.filter(e)); } }), k.each({ parent(e) { const t = e.parentNode; return t && t.nodeType !== 11 ? t : null; }, parents(e) { return T(e, 'parentNode'); }, parentsUntil(e, t, n) { return T(e, 'parentNode', n); }, next(e) { return P(e, 'nextSibling'); }, prev(e) { return P(e, 'previousSibling'); }, nextAll(e) { return T(e, 'nextSibling'); }, prevAll(e) { return T(e, 'previousSibling'); }, nextUntil(e, t, n) { return T(e, 'nextSibling', n); }, prevUntil(e, t, n) { return T(e, 'previousSibling', n); }, siblings(e) { return S((e.parentNode || {}).firstChild, e); }, children(e) { return S(e.firstChild); }, contents(e) { return void 0 !== e.contentDocument ? e.contentDocument : (A(e, 'template') && (e = e.content || e), k.merge([], e.childNodes)); } }, (r, i) => { k.fn[r] = function (e, t) { let n = k.map(this, i, e); return r.slice(-5) !== 'Until' && (t = e), t && typeof t === 'string' && (n = k.filter(t, n)), this.length > 1 && (O[r] || k.uniqueSort(n), H.test(r) && n.reverse()), this.pushStack(n); }; }); const R = /[^\x20\t\r\n\f]+/g; function M(e) { return e; } function I(e) { throw e; } function W(e, t, n, r) { let i; try { e && m(i = e.promise) ? i.call(e).done(t).fail(n) : e && m(i = e.then) ? i.call(e, t, n) : t.apply(void 0, [e].slice(r)); } catch (e) { n.apply(void 0, [e]); } }k.Callbacks = function (r) { let e; let n; r = typeof r === 'string' ? (e = r, n = {}, k.each(e.match(R) || [], (e, t) => { n[t] = !0; }), n) : k.extend({}, r); function c() { for (a = a || r.once, o = i = !0; u.length; l = -1) for (t = u.shift(); ++l < s.length;) !1 === s[l].apply(t[0], t[1]) && r.stopOnFalse && (l = s.length, t = !1); r.memory || (t = !1), i = !1, a && (s = t ? [] : ''); } let i; let t; let o; let a; var s = []; var u = []; var l = -1; var f = { add() { return s && (t && !i && (l = s.length - 1, u.push(t)), (function n(e) { k.each(e, (e, t) => { m(t) ? r.unique && f.has(t) || s.push(t) : t && t.length && w(t) !== 'string' && n(t); }); })(arguments), t && !i && c()), this; }, remove() { return k.each(arguments, (e, t) => { for (var n; (n = k.inArray(t, s, n)) > -1;) s.splice(n, 1), n <= l && l--; }), this; }, has(e) { return e ? k.inArray(e, s) > -1 : s.length > 0; }, empty() { return s && (s = []), this; }, disable() { return a = u = [], s = t = '', this; }, disabled() { return !s; }, lock() { return a = u = [], t || i || (s = t = ''), this; }, locked() { return !!a; }, fireWith(e, t) { return a || (t = [e, (t = t || []).slice ? t.slice() : t], u.push(t), i || c()), this; }, fire() { return f.fireWith(this, arguments), this; }, fired() { return !!o; } }; return f; }, k.extend({ Deferred(e) { const o = [['notify', 'progress', k.Callbacks('memory'), k.Callbacks('memory'), 2], ['resolve', 'done', k.Callbacks('once memory'), k.Callbacks('once memory'), 0, 'resolved'], ['reject', 'fail', k.Callbacks('once memory'), k.Callbacks('once memory'), 1, 'rejected']]; let i = 'pending'; var a = { state() { return i; }, always() { return s.done(arguments).fail(arguments), this; }, catch(e) { return a.then(null, e); }, pipe() { let i = arguments; return k.Deferred((r) => { k.each(o, (e, t) => { const n = m(i[t[4]]) && i[t[4]]; s[t[1]](function () { const e = n && n.apply(this, arguments); e && m(e.promise) ? e.promise().progress(r.notify).done(r.resolve).fail(r.reject) : r[t[0] + 'With'](this, n ? [e] : arguments); }); }), i = null; }).promise(); }, then(t, n, r) { let u = 0; function l(i, o, a, s) { return function () { let n = this; let r = arguments; const e = function () { let e; let t; if (!(i < u)) { if ((e = a.apply(n, r)) === o.promise()) throw new TypeError('Thenable self-resolution'); t = e && (typeof e === 'object' || typeof e === 'function') && e.then, m(t) ? s ? t.call(e, l(u, o, M, s), l(u, o, I, s)) : (u++, t.call(e, l(u, o, M, s), l(u, o, I, s), l(u, o, M, o.notifyWith))) : (a !== M && (n = void 0, r = [e]), (s || o.resolveWith)(n, r)); } }; var t = s ? e : function () { try { e(); } catch (e) { k.Deferred.exceptionHook && k.Deferred.exceptionHook(e, t.stackTrace), u <= i + 1 && (a !== I && (n = void 0, r = [e]), o.rejectWith(n, r)); } }; i ? t() : (k.Deferred.getStackHook && (t.stackTrace = k.Deferred.getStackHook()), C.setTimeout(t)); }; } return k.Deferred((e) => { o[0][3].add(l(0, e, m(r) ? r : M, e.notifyWith)), o[1][3].add(l(0, e, m(t) ? t : M)), o[2][3].add(l(0, e, m(n) ? n : I)); }).promise(); }, promise(e) { return e != null ? k.extend(e, a) : a; } }; var s = {}; return k.each(o, (e, t) => { const n = t[2]; const r = t[5]; a[t[1]] = n.add, r && n.add(() => { i = r; }, o[3 - e][2].disable, o[3 - e][3].disable, o[0][2].lock, o[0][3].lock), n.add(t[3].fire), s[t[0]] = function () { return s[t[0] + 'With'](this === s ? void 0 : this, arguments), this; }, s[t[0] + 'With'] = n.fireWith; }), a.promise(s), e && e.call(s, s), s; }, when(e) { function a(t) { return function (e) { r[t] = this, i[t] = arguments.length > 1 ? s.call(arguments) : e, --n || o.resolveWith(r, i); }; } var n = arguments.length; let t = n; var r = Array(t); var i = s.call(arguments); var o = k.Deferred(); if (n <= 1 && (W(e, o.done(a(t)).resolve, o.reject, !n), o.state() === 'pending' || m(i[t] && i[t].then))) return o.then(); for (;t--;) W(i[t], a(t), o.reject); return o.promise(); } }); const $ = /^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/; k.Deferred.exceptionHook = function (e, t) { C.console && C.console.warn && e && $.test(e.name) && C.console.warn('jQuery.Deferred exception: ' + e.message, e.stack, t); }, k.readyException = function (e) { C.setTimeout(() => { throw e; }); }; const F = k.Deferred(); function B() { E.removeEventListener('DOMContentLoaded', B), C.removeEventListener('load', B), k.ready(); }k.fn.ready = function (e) { return F.then(e).catch((e) => { k.readyException(e); }), this; }, k.extend({ isReady: !1, readyWait: 1, ready(e) { (!0 === e ? --k.readyWait : k.isReady) || (k.isReady = !0) !== e && --k.readyWait > 0 || F.resolveWith(E, [k]); } }), k.ready.then = F.then, E.readyState === 'complete' || E.readyState !== 'loading' && !E.documentElement.doScroll ? C.setTimeout(k.ready) : (E.addEventListener('DOMContentLoaded', B), C.addEventListener('load', B)); var _ = function (e, t, n, r, i, o, a) { let s = 0; const u = e.length; let l = n == null; if (w(n) === 'object') for (s in i = !0, n) _(e, t, s, n[s], !0, o, a); else if (void 0 !== r && (i = !0, m(r) || (a = !0), l && (t = a ? (t.call(e, r), null) : (l = t, function (e, t, n) { return l.call(k(e), n); })), t)) for (;s < u; s++) t(e[s], n, a ? r : r.call(e[s], s, t(e[s], n))); return i ? e : l ? t.call(e) : u ? t(e[0], n) : o; }; const z = /^-ms-/; const U = /-([a-z])/g; function X(e, t) { return t.toUpperCase(); } function V(e) { return e.replace(z, 'ms-').replace(U, X); } function G(e) { return e.nodeType === 1 || e.nodeType === 9 || !+e.nodeType; } function Y() { this.expando = k.expando + Y.uid++; }Y.uid = 1, Y.prototype = { cache(e) { let t = e[this.expando]; return t || (t = {}, G(e) && (e.nodeType ? e[this.expando] = t : Object.defineProperty(e, this.expando, { value: t, configurable: !0 }))), t; }, set(e, t, n) { let r; const i = this.cache(e); if (typeof t === 'string') i[V(t)] = n; else for (r in t) i[V(r)] = t[r]; return i; }, get(e, t) { return void 0 === t ? this.cache(e) : e[this.expando] && e[this.expando][V(t)]; }, access(e, t, n) { return void 0 === t || t && typeof t === 'string' && void 0 === n ? this.get(e, t) : (this.set(e, t, n), void 0 !== n ? n : t); }, remove(e, t) { let n; const r = e[this.expando]; if (void 0 !== r) { if (void 0 !== t) { n = (t = Array.isArray(t) ? t.map(V) : (t = V(t)) in r ? [t] : t.match(R) || []).length; for (;n--;) delete r[t[n]]; } void 0 !== t && !k.isEmptyObject(r) || (e.nodeType ? e[this.expando] = void 0 : delete e[this.expando]); } }, hasData(e) { const t = e[this.expando]; return void 0 !== t && !k.isEmptyObject(t); } }; const Q = new Y(); const J = new Y(); const K = /^(?:\{[\w\W]*\}|\[[\w\W]*\])$/; const Z = /[A-Z]/g; function ee(e, t, n) { let r; let i; if (void 0 === n && e.nodeType === 1) if (r = 'data-' + t.replace(Z, '-$&').toLowerCase(), typeof (n = e.getAttribute(r)) === 'string') { try { n = (i = n) === 'true' || i !== 'false' && (i === 'null' ? null : i === +i + '' ? +i : K.test(i) ? JSON.parse(i) : i); } catch (e) {}J.set(e, t, n); } else n = void 0; return n; }k.extend({ hasData(e) { return J.hasData(e) || Q.hasData(e); }, data(e, t, n) { return J.access(e, t, n); }, removeData(e, t) { J.remove(e, t); }, _data(e, t, n) { return Q.access(e, t, n); }, _removeData(e, t) { Q.remove(e, t); } }), k.fn.extend({ data(n, e) { let t; let r; let i; const o = this[0]; const a = o && o.attributes; if (void 0 !== n) return typeof n === 'object' ? this.each(function () { J.set(this, n); }) : _(this, function (e) { let t; if (o && void 0 === e) return void 0 !== (t = J.get(o, n)) ? t : void 0 !== (t = ee(o, n)) ? t : void 0; this.each(function () { J.set(this, n, e); }); }, null, e, arguments.length > 1, null, !0); if (this.length && (i = J.get(o), o.nodeType === 1 && !Q.get(o, 'hasDataAttrs'))) { for (t = a.length; t--;) a[t] && (r = a[t].name).indexOf('data-') === 0 && (r = V(r.slice(5)), ee(o, r, i[r])); Q.set(o, 'hasDataAttrs', !0); } return i; }, removeData(e) { return this.each(function () { J.remove(this, e); }); } }), k.extend({ queue(e, t, n) { let r; if (e) return t = (t || 'fx') + 'queue', r = Q.get(e, t), n && (!r || Array.isArray(n) ? r = Q.access(e, t, k.makeArray(n)) : r.push(n)), r || []; }, dequeue(e, t) { t = t || 'fx'; const n = k.queue(e, t); let r = n.length; let i = n.shift(); const o = k._queueHooks(e, t); i === 'inprogress' && (i = n.shift(), r--), i && (t === 'fx' && n.unshift('inprogress'), delete o.stop, i.call(e, () => { k.dequeue(e, t); }, o)), !r && o && o.empty.fire(); }, _queueHooks(e, t) { const n = t + 'queueHooks'; return Q.get(e, n) || Q.access(e, n, { empty: k.Callbacks('once memory').add(() => { Q.remove(e, [t + 'queue', n]); }) }); } }), k.fn.extend({ queue(t, n) { let e = 2; return typeof t !== 'string' && (n = t, t = 'fx', e--), arguments.length < e ? k.queue(this[0], t) : void 0 === n ? this : this.each(function () { const e = k.queue(this, t, n); k._queueHooks(this, t), t === 'fx' && e[0] !== 'inprogress' && k.dequeue(this, t); }); }, dequeue(e) { return this.each(function () { k.dequeue(this, e); }); }, clearQueue(e) { return this.queue(e || 'fx', []); }, promise(e, t) { function s() { --r || i.resolveWith(o, [o]); } let n; var r = 1; var i = k.Deferred(); var o = this; let a = this.length; for (typeof e !== 'string' && (t = e, e = void 0), e = e || 'fx'; a--;) (n = Q.get(o[a], e + 'queueHooks')) && n.empty && (r++, n.empty.add(s)); return s(), i.promise(t); } }); const te = /[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/.source; const ne = new RegExp('^(?:([+-])=|)(' + te + ')([a-z%]*)$', 'i'); const re = ['Top', 'Right', 'Bottom', 'Left']; const ie = E.documentElement; let oe = function (e) { return k.contains(e.ownerDocument, e); }; const ae = { composed: !0 }; ie.getRootNode && (oe = function (e) { return k.contains(e.ownerDocument, e) || e.getRootNode(ae) === e.ownerDocument; }); function se(e, t) { return (e = t || e).style.display === 'none' || e.style.display === '' && oe(e) && k.css(e, 'display') === 'none'; } function ue(e, t, n, r) { let i; let o; const a = {}; for (o in t) a[o] = e.style[o], e.style[o] = t[o]; for (o in i = n.apply(e, r || []), t) e.style[o] = a[o]; return i; } function le(e, t, n, r) { let i; let o; let a = 20; const s = r ? function () { return r.cur(); } : function () { return k.css(e, t, ''); }; let u