1!(function () { 2 "use strict"; 3 var e, 4 n, 5 t, 6 _, 7 o, 8 r, 9 i = {}, 10 l = [], 11 u = /acit|ex(?:s|g|n|p|$)|rph|grid|ows|mnc|ntw|ine[ch]|zoo|^ord|itera/i; 12 function s(e, n) { 13 for (var t in n) e[t] = n[t]; 14 return e; 15 } 16 function c(e) { 17 var n = e.parentNode; 18 n && n.removeChild(e); 19 } 20 function a(n, t, _) { 21 var o, 22 r, 23 i, 24 l = {}; 25 for (i in t) "key" == i ? (o = t[i]) : "ref" == i ? (r = t[i]) : (l[i] = t[i]); 26 if ((arguments.length > 2 && (l.children = arguments.length > 3 ? e.call(arguments, 2) : _), "function" == typeof n && null != n.defaultProps)) for (i in n.defaultProps) void 0 === l[i] && (l[i] = n.defaultProps[i]); 27 return d(n, l, o, r, null); 28 } 29 function d(e, _, o, r, i) { 30 var l = { type: e, props: _, key: o, ref: r, __k: null, __: null, __b: 0, __e: null, __d: void 0, __c: null, __h: null, constructor: void 0, __v: null == i ? ++t : i }; 31 return null == i && null != n.vnode && n.vnode(l), l; 32 } 33 function f(e) { 34 return e.children; 35 } 36 function h(e, n) { 37 (this.props = e), (this.context = n); 38 } 39 function p(e, n) { 40 if (null == n) return e.__ ? p(e.__, e.__.__k.indexOf(e) + 1) : null; 41 for (var t; n < e.__k.length; n++) if (null != (t = e.__k[n]) && null != t.__e) return t.__e; 42 return "function" == typeof e.type ? p(e) : null; 43 } 44 function v(e) { 45 var n, t; 46 if (null != (e = e.__) && null != e.__c) { 47 for (e.__e = e.__c.base = null, n = 0; n < e.__k.length; n++) 48 if (null != (t = e.__k[n]) && null != t.__e) { 49 e.__e = e.__c.base = t.__e; 50 break; 51 } 52 return v(e); 53 } 54 } 55 function m(e) { 56 ((!e.__d && (e.__d = !0) && _.push(e) && !y.__r++) || o !== n.debounceRendering) && ((o = n.debounceRendering) || setTimeout)(y); 57 } 58 function y() { 59 for (var e; (y.__r = _.length); ) 60 (e = _.sort(function (e, n) { 61 return e.__v.__b - n.__v.__b; 62 })), 63 (_ = []), 64 e.some(function (e) { 65 var n, t, _, o, r, i; 66 e.__d && 67 ((r = (o = (n = e).__v).__e), 68 (i = n.__P) && ((t = []), ((_ = s({}, o)).__v = o.__v + 1), D(i, o, _, n.__n, void 0 !== i.ownerSVGElement, null != o.__h ? [r] : null, t, null == r ? p(o) : r, o.__h), x(t, o), o.__e != r && v(o))); 69 }); 70 } 71 function b(e, n, t, _, o, r, u, s, c, a) { 72 var h, 73 v, 74 m, 75 y, 76 b, 77 w, 78 E, 79 S = (_ && _.__k) || l, 80 C = S.length; 81 for (t.__k = [], h = 0; h < n.length; h++) 82 if ( 83 null != 84 (y = t.__k[h] = 85 null == (y = n[h]) || "boolean" == typeof y 86 ? null 87 : "string" == typeof y || "number" == typeof y || "bigint" == typeof y 88 ? d(null, y, null, null, y) 89 : Array.isArray(y) 90 ? d(f, { children: y }, null, null, null) 91 : y.__b > 0 92 ? d(y.type, y.props, y.key, null, y.__v) 93 : y) 94 ) { 95 if (((y.__ = t), (y.__b = t.__b + 1), null === (m = S[h]) || (m && y.key == m.key && y.type === m.type))) S[h] = void 0; 96 else 97 for (v = 0; v < C; v++) { 98 if ((m = S[v]) && y.key == m.key && y.type === m.type) { 99 S[v] = void 0; 100 break; 101 } 102 m = null; 103 } 104 D(e, y, (m = m || i), o, r, u, s, c, a), 105 (b = y.__e), 106 (v = y.ref) && m.ref != v && (E || (E = []), m.ref && E.push(m.ref, null, y), E.push(v, y.__c || b, y)), 107 null != b 108 ? (null == w && (w = b), "function" == typeof y.type && y.__k === m.__k ? (y.__d = c = g(y, c, e)) : (c = k(e, y, m, S, b, c)), "function" == typeof t.type && (t.__d = c)) 109 : c && m.__e == c && c.parentNode != e && (c = p(m)); 110 } 111 for (t.__e = w, h = C; h--; ) null != S[h] && ("function" == typeof t.type && null != S[h].__e && S[h].__e == t.__d && (t.__d = p(_, h + 1)), U(S[h], S[h])); 112 if (E) for (h = 0; h < E.length; h++) A(E[h], E[++h], E[++h]); 113 } 114 function g(e, n, t) { 115 for (var _, o = e.__k, r = 0; o && r < o.length; r++) (_ = o[r]) && ((_.__ = e), (n = "function" == typeof _.type ? g(_, n, t) : k(t, _, _, o, _.__e, n))); 116 return n; 117 } 118 function k(e, n, t, _, o, r) { 119 var i, l, u; 120 if (void 0 !== n.__d) (i = n.__d), (n.__d = void 0); 121 else if (null == t || o != r || null == o.parentNode) 122 e: if (null == r || r.parentNode !== e) e.appendChild(o), (i = null); 123 else { 124 for (l = r, u = 0; (l = l.nextSibling) && u < _.length; u += 2) if (l == o) break e; 125 e.insertBefore(o, r), (i = r); 126 } 127 return void 0 !== i ? i : o.nextSibling; 128 } 129 function w(e, n, t) { 130 "-" === n[0] ? e.setProperty(n, t) : (e[n] = null == t ? "" : "number" != typeof t || u.test(n) ? t : t + "px"); 131 } 132 function E(e, n, t, _, o) { 133 var r; 134 e: if ("style" === n) 135 if ("string" == typeof t) e.style.cssText = t; 136 else {
137 if (("string" == typeof _ && (e.style.cssText = _ = ""), _)) for (n in _) (t && n in t) || w(e.style, n, ""); 138 if (t) for (n in t) (_ && t[n] === _[n]) || w(e.style, n, t[n]); 139 } 140 else if ("o" === n[0] && "n" === n[1]) 141 (r = n !== (n = n.replace(/Capture$/, ""))), 142 (n = n.toLowerCase() in e ? n.toLowerCase().slice(2) : n.slice(2)), 143 e.l || (e.l = {}), 144 (e.l[n + r] = t), 145 t ? _ || e.addEventListener(n, r ? C : S, r) : e.removeEventListener(n, r ? C : S, r); 146 else if ("dangerouslySetInnerHTML" !== n) { 147 if (o) n = n.replace(/xlink(H|:h)/, "h").replace(/sName$/, "s"); 148 else if ("href" !== n && "list" !== n && "form" !== n && "tabIndex" !== n && "download" !== n && n in e) 149 try { 150 e[n] = null == t ? "" : t; 151 break e; 152 } catch (e) {} 153 "function" == typeof t || (null != t && (!1 !== t || ("a" === n[0] && "r" === n[1])) ? e.setAttribute(n, t) : e.removeAttribute(n)); 154 } 155 } 156 function S(e) { 157 this.l[e.type + !1](n.event ? n.event(e) : e); 158 } 159 function C(e) { 160 this.l[e.type + !0](n.event ? n.event(e) : e); 161 } 162 function D(e, t, _, o, r, i, l, u, c) { 163 var a, 164 d, 165 p, 166 v, 167 m, 168 y, 169 g, 170 k, 171 w, 172 E, 173 S, 174 C, 175 D, 176 x = t.type; 177 if (void 0 !== t.constructor) return null; 178 null != _.__h && ((c = _.__h), (u = t.__e = _.__e), (t.__h = null), (i = [u])), (a = n.__b) && a(t); 179 try { 180 e: if ("function" == typeof x) { 181 if ( 182 ((k = t.props), 183 (w = (a = x.contextType) && o[a.__c]), 184 (E = a ? (w ? w.props.value : a.__) : o), 185 _.__c 186 ? (g = (d = t.__c = _.__c).__ = d.__E) 187 : ("prototype" in x && x.prototype.render ? (t.__c = d = new x(k, E)) : ((t.__c = d = new h(k, E)), (d.constructor = x), (d.render = L)), 188 w && w.sub(d), 189 (d.props = k), 190 d.state || (d.state = {}), 191 (d.context = E), 192 (d.__n = o), 193 (p = d.__d = !0), 194 (d.__h = [])), 195 null == d.__s && (d.__s = d.state), 196 null != x.getDerivedStateFromProps && (d.__s == d.state && (d.__s = s({}, d.__s)), s(d.__s, x.getDerivedStateFromProps(k, d.__s))), 197 (v = d.props), 198 (m = d.state), 199 p) 200 ) 201 null == x.getDerivedStateFromProps && null != d.componentWillMount && d.componentWillMount(), null != d.componentDidMount && d.__h.push(d.componentDidMount); 202 else { 203 if ( 204 (null == x.getDerivedStateFromProps && k !== v && null != d.componentWillReceiveProps && d.componentWillReceiveProps(k, E), 205 (!d.__e && null != d.shouldComponentUpdate && !1 === d.shouldComponentUpdate(k, d.__s, E)) || t.__v === _.__v) 206 ) { 207 (d.props = k), 208 (d.state = d.__s), 209 t.__v !== _.__v && (d.__d = !1), 210 (d.__v = t), 211 (t.__e = _.__e), 212 (t.__k = _.__k), 213 t.__k.forEach(function (e) { 214 e && (e.__ = t); 215 }), 216 d.__h.length && l.push(d); 217 break e; 218 } 219 null != d.componentWillUpdate && d.componentWillUpdate(k, d.__s, E), 220 null != d.componentDidUpdate && 221 d.__h.push(function () { 222 d.componentDidUpdate(v, m, y); 223 }); 224 } 225 if (((d.context = E), (d.props = k), (d.__v = t), (d.__P = e), (S = n.__r), (C = 0), "prototype" in x && x.prototype.render)) (d.state = d.__s), (d.__d = !1), S && S(t), (a = d.render(d.props, d.state, d.context)); 226 else 227 do { 228 (d.__d = !1), S && S(t), (a = d.render(d.props, d.state, d.context)), (d.state = d.__s); 229 } while (d.__d && ++C < 25); 230 (d.state = d.__s), 231 null != d.getChildContext && (o = s(s({}, o), d.getChildContext())), 232 p || null == d.getSnapshotBeforeUpdate || (y = d.getSnapshotBeforeUpdate(v, m)), 233 (D = null != a && a.type === f && null == a.key ? a.props.children : a), 234 b(e, Array.isArray(D) ? D : [D], t, _, o, r, i, l, u, c), 235 (d.base = t.__e), 236 (t.__h = null),
237 d.__h.length && l.push(d), 238 g && (d.__E = d.__ = null), 239 (d.__e = !1); 240 } else null == i && t.__v === _.__v ? ((t.__k = _.__k), (t.__e = _.__e)) : (t.__e = N(_.__e, t, _, o, r, i, l, c)); 241 (a = n.diffed) && a(t); 242 } catch (e) { 243 (t.__v = null), (c || null != i) && ((t.__e = u), (t.__h = !!c), (i[i.indexOf(u)] = null)), n.__e(e, t, _); 244 } 245 } 246 function x(e, t) { 247 n.__c && n.__c(t, e), 248 e.some(function (t) { 249 try { 250 (e = t.__h), 251 (t.__h = []), 252 e.some(function (e) { 253 e.call(t); 254 }); 255 } catch (e) { 256 n.__e(e, t.__v); 257 } 258 }); 259 } 260 function N(n, t, _, o, r, l, u, s) { 261 var a, 262 d, 263 f, 264 h = _.props, 265 v = t.props, 266 m = t.type, 267 y = 0; 268 if (("svg" === m && (r = !0), null != l)) 269 for (; y < l.length; y++) 270 if ((a = l[y]) && "setAttribute" in a == !!m && (m ? a.localName === m : 3 === a.nodeType)) { 271 (n = a), (l[y] = null); 272 break; 273 } 274 if (null == n) { 275 if (null === m) return document.createTextNode(v); 276 (n = r ? document.createElementNS("http://www.w3.org/2000/svg", m) : document.createElement(m, v.is && v)), (l = null), (s = !1); 277 } 278 if (null === m) h === v || (s && n.data === v) || (n.data = v); 279 else { 280 if (((l = l && e.call(n.childNodes)), (d = (h = _.props || i).dangerouslySetInnerHTML), (f = v.dangerouslySetInnerHTML), !s)) { 281 if (null != l) for (h = {}, y = 0; y < n.attributes.length; y++) h[n.attributes[y].name] = n.attributes[y].value; 282 (f || d) && ((f && ((d && f.__html == d.__html) || f.__html === n.innerHTML)) || (n.innerHTML = (f && f.__html) || "")); 283 } 284 if ( 285 ((function (e, n, t, _, o) { 286 var r; 287 for (r in t) "children" === r || "key" === r || r in n || E(e, r, null, t[r], _); 288 for (r in n) (o && "function" != typeof n[r]) || "children" === r || "key" === r || "value" === r || "checked" === r || t[r] === n[r] || E(e, r, n[r], t[r], _); 289 })(n, v, h, r, s), 290 f) 291 ) 292 t.__k = []; 293 else if (((y = t.props.children), b(n, Array.isArray(y) ? y : [y], t, _, o, r && "foreignObject" !== m, l, u, l ? l[0] : _.__k && p(_, 0), s), null != l)) for (y = l.length; y--; ) null != l[y] && c(l[y]); 294 s || 295 ("value" in v && void 0 !== (y = v.value) && (y !== n.value || ("progress" === m && !y) || ("option" === m && y !== h.value)) && E(n, "value", y, h.value, !1), 296 "checked" in v && void 0 !== (y = v.checked) && y !== n.checked && E(n, "checked", y, h.checked, !1)); 297 } 298 return n; 299 } 300 function A(e, t, _) { 301 try { 302 "function" == typeof e ? e(t) : (e.current = t); 303 } catch (e) { 304 n.__e(e, _); 305 } 306 } 307 function U(e, t, _) { 308 var o, r; 309 if ((n.unmount && n.unmount(e), (o = e.ref) && ((o.current && o.current !== e.__e) || A(o, null, t)), null != (o = e.__c))) { 310 if (o.componentWillUnmount) 311 try { 312 o.componentWillUnmount(); 313 } catch (e) { 314 n.__e(e, t); 315 } 316 o.base = o.__P = null; 317 } 318 if ((o = e.__k)) for (r = 0; r < o.length; r++) o[r] && U(o[r], t, "function" != typeof e.type); 319 _ || null == e.__e || c(e.__e), (e.__e = e.__d = void 0); 320 } 321 function L(e, n, t) { 322 return this.constructor(e, t); 323 } 324 (e = l.slice), 325 (n = { 326 __e: function (e, n, t, _) { 327 for (var o, r, i; (n = n.__); ) 328 if ((o = n.__c) && !o.__) 329 try { 330 if (((r = o.constructor) && null != r.getDerivedStateFromError && (o.setState(r.getDerivedStateFromError(e)), (i = o.__d)), null != o.componentDidCatch && (o.componentDidCatch(e, _ || {}), (i = o.__d)), i)) 331 return (o.__E = o); 332 } catch (n) { 333 e = n; 334 } 335 throw e; 336 }, 337 }), 338 (t = 0), 339 (h.prototype.setState = function (e, n) { 340 var t; 341 (t = null != this.__s && this.__s !== this.state ? this.__s : (this.__s = s({}, this.state))), "function" == typeof e && (e = e(s({}, t), this.props)), e && s(t, e), null != e && this.__v && (n && this.__h.push(n), m(this)); 342 }), 343 (h.prototype.forceUpdate = function (e) { 344 this.__v && ((this.__e = !0), e && this.__h.push(e), m(this)); 345 }), 346 (h.prototype.render = f), 347 (_ = []), 348 (y.__r = 0), 349 (r = 0); 350 var H, 351 P, 352 F, 353 T, 354 R = 0, 355 W = [], 356 q = [], 357 I = n.__b, 358 M = n.__r, 359 j = n.diffed, 360 O = n.__c, 361 V = n.unmount; 362 function z(e, t) { 363 n.__h && n.__h(P, e, R || t), (R = 0); 364 var _ = P.__H || (P.__H = { __: [], __h: [] }); 365 return e >= _.__.length && _.__.push({ __V: q }), _.__[e]; 366 } 367 function B(e, n) { 368 var t = z(H++, 7); 369 return (function (e, n) { 370 return ( 371 !e || 372 e.length !== n.length || 373 n.some(function (n, t) { 374 return n !== e[t]; 375 }) 376 ); 377 })(t.__H, n) 378 ? ((t.__V = e()), (t.i = n), (t.__h = e), t.__V) 379 : t.__; 380 } 381 function $(e, n) { 382 return ( 383 (R = 8), 384 B(function () { 385 return e; 386 }, n) 387 ); 388 } 389 function G(e) { 390 var n = P.context[e.__c], 391 t = z(H++, 9); 392 return (t.c = e), n ? (null == t.__ && ((t.__ = !0), n.sub(P)), n.props.value) : e.__; 393 } 394 function Q() { 395 for (var e; (e = W.shift()); ) 396 if (e.__P && e.__H) 397 try { 398 e.__H.__h.forEach(K), e.__H.__h.forEach(X), (e.__H.__h = []); 399 } catch (t) { 400 (e.__H.__h = []), n.__e(t, e.__v); 401 } 402 } 403 (n.__b = function (e) { 404 (P = null), I && I(e); 405 }), 406 (n.__r = function (e) { 407 M && M(e), (H = 0); 408 var n = (P = e.__c).__H; 409 n && 410 (F === P 411 ? ((n.__h = []), 412 (P.__h = []), 413 n.__.forEach(function (e) { 414 e.__N && (e.__ = e.__N), (e.__V = q), (e.__N = e.i = void 0); 415 })) 416 : (n.__h.forEach(K), n.__h.forEach(X), (n.__h = []))), 417 (F = P); 418 }), 419 (n.diffed = function (e) { 420 j && j(e); 421 var t = e.__c; 422 t && 423 t.__H && 424 (t.__H.__h.length && 425 ((1 !== W.push(t) && T === n.requestAnimationFrame) || 426 ( 427 (T = n.requestAnimationFrame) || 428 function (e) { 429 var n, 430 t = function () { 431 clearTimeout(_), J && cancelAnimationFrame(n), setTimeout(e); 432 }, 433 _ = setTimeout(t, 100); 434 J && (n = requestAnimationFrame(t)); 435 }
436 )(Q)), 437 t.__H.__.forEach(function (e) { 438 e.i && (e.__H = e.i), e.__V !== q && (e.__ = e.__V), (e.i = void 0), (e.__V = q); 439 })), 440 (F = P = null); 441 }), 442 (n.__c = function (e, t) { 443 t.some(function (e) { 444 try { 445 e.__h.forEach(K), 446 (e.__h = e.__h.filter(function (e) { 447 return !e.__ || X(e); 448 })); 449 } catch (_) { 450 t.some(function (e) { 451 e.__h && (e.__h = []); 452 }), 453 (t = []), 454 n.__e(_, e.__v); 455 } 456 }), 457 O && O(e, t); 458 }), 459 (n.unmount = function (e) { 460 V && V(e); 461 var t, 462 _ = e.__c; 463 _ && 464 _.__H && 465 (_.__H.__.forEach(function (e) { 466 try { 467 K(e); 468 } catch (e) { 469 t = e; 470 } 471 }), 472 t && n.__e(t, _.__v)); 473 }); 474 var J = "function" == typeof requestAnimationFrame; 475 function K(e) { 476 var n = P, 477 t = e.__c; 478 "function" == typeof t && ((e.__c = void 0), t()), (P = n); 479 } 480 function X(e) { 481 var n = P; 482 (e.__c = e.__()), (P = n); 483 } 484 let Y, 485 Z, 486 ee = null; 487 const ne = new Set(); 488 let te = !1, 489 _e = new Set(); 490 class oe { 491 constructor(e) { 492 (this._s = new Set()), (this._d = new Set()), (this._p = 0), (this._v = void 0), (this._r = !1), (this._q = !1), (this._c = !1), (this.t = !1), (this._v = e); 493 } 494 toString() { 495 return "" + this.value; 496 } 497 peek() { 498 return Z._c && 0 === this._d.size && ae(this), this._v; 499 } 500 get value() { 501 return (Z._c && 0 === this._d.size && (ae(this), Z === Y)) || (this._s.add(Z), Z._d.add(this), _e.delete(this), te && 0 === this._d.size && ce(this)), this._v; 502 } 503 set value(e) { 504 if (this._r) throw new Error("Computed signals are readonly"); 505 if (this._v !== e) { 506 this._v = e; 507 let n = 0 === ne.size; 508 if ((ne.add(this), 0 === this._p && re(this), n && (le(ne), ne.clear(), ee))) { 509 const e = ee; 510 throw ((ee = null), e); 511 } 512 } 513 } 514 _() { 515 let e = Z, 516 n = _e; 517 return ( 518 (Z = this), 519 (_e = this._d), 520 (this._d = new Set()), 521 (t, _) => { 522 t && this._s.forEach(ie), 523 _e.forEach( 524 _ 525 ? (e) => ue(this, e) 526 : (e) => 527 (function (e, n) { 528 e._d.add(n), n._s.add(e); 529 })(this, e) 530 ), 531 _e.clear(), 532 (_e = n), 533 (Z = e); 534 } 535 ); 536 } 537 _u() {} 538 } 539 function re(e) { 540 0 == e._p++ && e._s.forEach(re); 541 } 542 function ie(e) { 543 e._q || 0 != --e._p || e._s.forEach(ie); 544 } 545 function le(e) { 546 e.forEach((e) => { 547 if (e._p > 0 && ((e._q = !0), 0 == --e._p)) { 548 if (e.t) throw new Error("Cycle detected"); 549 (e._q = !1), (e.t = !0), e._u(), (e.t = !1), le(e._s); 550 } 551 }); 552 } 553 function ue(e, n) { 554 e._d.delete(n), n._s.delete(e), 0 === n._s.size && n._d.forEach((e) => ue(n, e)); 555 } 556 const se = []; 557 function ce(e) { 558 if ((ne.delete(e), (e._p = 0), e._u(), ee)) { 559 const e = ee; 560 throw ((ee = null), e); 561 } 562 e._s.forEach((e) => { 563 e._p > 0 && (e._p > 1 && e._p--, se.push(e)); 564 }); 565 } 566 function ae(e) { 567 te = !0; 568 try { 569 ce(e); 570 } finally { 571 te = !1; 572 } 573 } 574 function de(e) { 575 return new oe(e); 576 } 577 function fe(e) { 578 const n = new oe(void 0); 579 return ( 580 (n._r = !0), 581 (n._u = function () { 582 let t = n._(); 583 try { 584 let _ = e(); 585 t(n._v === _, !0), (n._v = _); 586 } catch (e) { 587 ee || (ee = e), t(!0, !1); 588 } 589 }), 590 n 591 ); 592 } 593 (Y = Z = new oe(void 0)), (Y._c = !0); 594 const he = new WeakSet(), 595 pe = new WeakSet(), 596 ve = new WeakSet(); 597 function me(e, t) { 598 n[e] = t.bind(null, n[e] || (() => {})); 599 } 600 let ye, be; 601 const ge = new WeakMap(); 602 function ke(e) { 603 be && be(!0, !0), (ye = e), (be = e && e._()); 604 } 605 function we(e) { 606 const n = de(void 0); 607 return (n._c = !0), (n._u = e), n; 608 } 609 function Ee(e) { 610 let n = ge.get(e); 611 if (n) n.__.length = 0; 612 else { 613 let t = []; 614 (n = we(() => { 615 let n = e.__e; 616 for (let e = 0; e < t.length; e++) { 617 let { t: _, i: o } = t[e], 618 r = o._v; 619 if (!n) return; 620 _ in n ? (n[_] = r) : r ? n.setAttribute(_, r) : n.removeAttribute(_); 621 } 622 })), 623 (n.__ = t), 624 ge.set(e, n); 625 } 626 return n; 627 } 628 function Se(e, n, t) { 629 "object" != typeof e || null == e || (Array.isArray(e) ? e.forEach(Se) : e instanceof oe && (t[n] = a(Ce, { data: e }))); 630 } 631 function Ce({ data: e }) { 632 const n = (function (e) { 633 return B(() => de(e), []); 634 })(e); 635 n.value = e; 636 const t = B(() => { 637 let e = this.__v; 638 for (; (e = e.__); ) 639 if (e.__c) { 640 ve.add(e.__c); 641 break; 642 } 643 return ( 644 (ye._u = () => { 645 this.base.data = t._v; 646 }), 647 fe(() => { 648 let e = n.value.value; 649 return 0 === e ? 0 : !0 === e ? "" : e || ""; 650 }) 651 ); 652 }, []); 653 return t.value; 654 } 655 (Ce.displayName = "_st"), 656 me("__b", (e, n) => { 657 if ("string" == typeof n.type) { 658 let e, 659 t = n.props; 660 for (let _ in t) { 661 let o = t[_]; 662 if ("children" === _) Se(o, "children", t); 663 else if (o instanceof oe) { 664 e || (e = Ee(n)), e.__.push({ t: _, i: o }); 665 let r = e._u; 666 if (o._u) { 667 let e = o._u; 668 o._u = () => { 669 r(), e(); 670 }; 671 } else o._u = r; 672 t[_] = o.peek(); 673 } 674 } 675 ke(e); 676 } 677 e(n); 678 }), 679 me("__r", (e, n) => { 680 let t, 681 _ = n.__c; 682 _ && 683 (he.delete(_), 684 (t = ge.get(_)), 685 void 0 === t && 686 ((t = we(() => { 687 he.add(_), _.setState({}); 688 })), 689 ge.set(_, t))), 690 ke(t), 691 e(n); 692 }), 693 me("__e", (e, n, t, _) => { 694 ke(), e(n, t, _); 695 }), 696 me("diffed", (e, n) => { 697 ke(), e(n); 698 }), 699 me("unmount", (e, n) => { 700 let t = n.__c || n; 701 const _ = ge.get(t); 702 if (_) { 703 ge.delete(t); 704 const e = _._d; 705 e && (e.forEach((e) => e._s.delete(_)), e.clear()); 706 } 707 e(n); 708 }), 709 me("__h", (e, n, t, _) => { 710 _ < 3 && pe.add(n), e(n, t, _); 711 }), 712 (h.prototype.shouldComponentUpdate = function (e, n) { 713 var t; 714 const _ = ge.get(this); 715 if (!((_ && 0 !== (null == (t = _._d) ? void 0 : t.size)) || ve.has(this))) return !0; 716 if (he.has(this)) return !0; 717 if (pe.has(this)) return !0; 718 for (let e in n) return !0; 719 for (let n in e) if ("__source" !== n && e[n] !== this.props[n]) return !0; 720 for (let n in this.props) if (!(n in e)) return !0; 721 return !1; 722 }); 723 const De = (function (e, n) { 724 var t = { 725 __c: (n = "__cC" + r++), 726 __: e, 727 Consumer: function (e, n) { 728 return e.children(n); 729 }, 730 Provider: function (e) { 731 var t, _; 732 return ( 733 this.getChildContext || 734 ((t = []), 735 ((_ = {})[n] = this), 736 (this.getChildContext = function () { 737 return _; 738 }), 739 (this.shouldComponentUpdate = function (e) { 740 this.props.value !== e.value && t.some(m); 741 }), 742 (this.sub = function (e) { 743 t.push(e); 744 var n = e.componentWillUnmount; 745 e.componentWillUnmount = function () { 746 t.splice(t.indexOf(e), 1), n && n.call(e); 747 }; 748 })), 749 e.children 750 ); 751 }, 752 }; 753 return (t.Provider.__ = t.Consumer.contextType = t); 754 })({ baseDirName: "Files", baseDirNodes: Array(), dirStack: new oe([]), currDirNodes: new oe([]), isAdmin: !1, adminActionsEnabled: !1 }); 755 function xe(e) { 756 const n = (function (e) { 757 const n = e 758 .map((e) => { 759 let n = !0; 760 return ("0" !== e.is_dir && "false" !== e.is_dir && !1 !== e.is_dir) || (n = !1), { id: Number(e.id), parentId: Number(e.parent_id), isDir: n, title: e.title, downloadLink: e.hyperlink, children: Array() }; 761 }) 762 .sort((e, n) => e.id - n.id); 763 return n; 764 })(e), 765 t = new Map(), 766 _ = []; 767 for (const [e, o] of n.entries()) 768 if ((t.set(o.id, e), 0 === o.parentId)) _.push(o); 769 else if (t.has(o.parentId)) { 770 n[t.get(o.parentId)].children.push(o); 771 } 772 return _; 773 } 774 function Ne(e) { 775 const n = [a("a", { href: e.editLink, tabIndex: 0 }, "Edit")]; 776 return ( 777 e.node.isDir || n.push(a("a", { href: e.node.downloadLink, download: e.node.title, tabIndex: 0 }, "Download")), 778 a( 779 "div", 780 { class: "node-actions" }, 781 n.reduce((e, n) => a(f, null, e, a("span", { "aria-hidden": "true", class: "separator" }, "|"), n)) 782 ) 783 ); 784 } 785 function Ae(e) { 786 const { dirStack: n, isAdmin: t, adminActionsEnabled: _ } = G(De), 787 o = `/wp-admin/post.php?post=${e.node.id}&action=edit`, 788 r = ["bi"], 789 i = { class: "node-title", tabIndex: 0 }, 790 l = $(() => { 791 n.value = [...n.value, e.node]; 792 }, [n, e.node]); 793 return ( 794 e.node.isDir ? (r.push("bi-folder"), (i.role = "button")) : (r.push("bi-file-text"), (i.role = "link"), (i.href = t && _ ? o : e.no
794de.downloadLink)), 795 a( 796 "tr", 797 null, 798 a("td", null, a("span", { class: r.join(" "), "aria-label": e.node.isDir ? "Directory" : "File" })), 799 a("td", null, a("div", null, e.node.isDir ? a("span", Object.assign({}, i, { onClick: l }), e.node.title) : a("a", Object.assign({}, i), e.node.title)), t && _ && a(Ne, { node: e.node, editLink: o })) 800 ) 801 ); 802 } 803 function Ue(e) { 804 const { currDirNodes: n } = G(De); 805 return a( 806 "table", 807 { class: "qedc-files-directory-view", "aria-label": "Directory contents" }, 808 a("thead", null, a("tr", null, a("th", { scope: "col", "aria-label": "Type" }), a("th", { scope: "col", "aria-label": "Name" }, a("span", null, "Name")))), 809 a( 810 "tbody", 811 null, 812 n.value.map((e) => a(Ae, { node: e })) 813 ) 814 ); 815 } 816 function Le() { 817 const { baseDirName: e, dirStack: n } = G(De), 818 t = [e, ...n.value.map((e) => e.title)], 819 _ = []; 820 for (const [e, o] of t.entries()) { 821 const r = e === t.length - 1, 822 i = ["fs-breadcrumb"], 823 l = { class: "breadcrumb-btn" }, 824 u = $(() => { 825 n.value = n.value.slice(0, e); 826 }, [e, n]); 827 r ? (i.push("current"), (l["aria-current"] = "location")) : ((l.role = "button"), (l.tabIndex = 0)), _.push(a("li", { class: i.join(" ") }, a("span", r ? Object.assign({}, l) : Object.assign({}, l, { onClick: u }), o))); 828 } 829 return a("nav", { "aria-label": "Breadcrumb" }, a("ol", { class: "qedc-files-breadcrumbs" }, _)); 830 } 831 function He() { 832 return a("div", null, a(Le, null), a(Ue, null)); 833 } 834 function Pe() { 835 return a(f, null, a("h1", { class: "wp-heading-inline" }, "QED-C Files"), a("hr", { class: "wp-header-end" })); 836 } 837 function Fe() { 838 const { isAdmin: e } = G(De); 839 return a(f, null, e && a(Pe, null), a("div", { class: "qedc-files-explorer-inner" }, a(He, null))); 840 } 841 const Te = new URL(window.location.href), 842 Re = new URLSearchParams(Te.search).get("qedc_file_path"); 843 let We = null; 844 if (null !== Re) 845 try { 846 const e = decodeURIComponent(Re); 847 We = new URL(e, window.location.origin); 848 } catch (ne) { 849 if (!(ne instanceof URIError)) throw ne; 850 } 851 if (We) { 852 let e = "", 853 n = ""; 854 const t = new Request(We, { method: "GET", mode: "same-origin" }); 855 fetch(t) 856 .then((e) => { 857 if (!e.ok) throw new Error(`deep-linked file download unsuccessful - status: ${e.status}`); 858 const t = e.headers.get("content-disposition"); 859 if (t) { 860 const e = t.match(/filename="(.*?)"/); 861 e && (n = e[1]); 862 } 863 return e.blob(); 864 }) 865 .then((t) => { 866 if (t.size > 32e6) throw new Error("data URLs above 32MB are not allowed"); 867 e = window.URL.createObjectURL(t); 868 const _ = document.createElement("a"); 869 (_.style.display = "none"), (_.href = e), n && (_.download = n), document.body.appendChild(_), _.click(), _.remove(); 870 }) 871 .catch((e) => { 872 console.log(e); 873 }) 874 .finally(() => { 875 e && window.URL.revokeObjectURL(e); 876 }); 877 } 878 try { 879 const t = inlinedWpData, 880 _ = void 0 !== t ? document.querySelector(t.parentSelector) : null; 881 if (void 0 !== t && null !== _) { 882 !(function (t, _, o) { 883 var r, l, u; 884 n.__ && n.__(t, _), 885 (l = (r = "function" == typeof o) ? null : (o && o.__k) || _.__k), 886 (u = []), 887 D(_, (t = ((!r && o) || _).__k = a(f, null, [t])), l || i, i, void 0 !== _.ownerSVGElement, !r && o ? [o] : l ? null : _.firstChild ? e.call(_.childNodes) : null, u, !r && o ? o : l ? l.__e : _.firstChild, r), 888 x(u, t); 889 })( 890 a( 891 function (e) { 892 const n = (function (e, n) { 893 var t; 894 const _ = de([]); 895 let o = e, 896 r = "Files"; 897 if (1 === e.length) { 898 const _ = e[0];
899 (r = null !== (t = n.rootFolderNiceName) && void 0 !== t ? t : _.title), (o = _.children); 900 } 901 const i = fe(() => { 902 const e = _.value.at(-1); 903 return void 0 !== e ? e.children : o; 904 }); 905 return { baseDirName: r, baseDirNodes: o, dirStack: _, currDirNodes: i, isAdmin: n.wpAdmin, adminActionsEnabled: !1 }; 906 })( 907 B(() => xe(e.data.fsNodesFlat), []), 908 e.data 909 ); 910 return a(De.Provider, { value: n }, a(Fe, null)); 911 }, 912 { data: t } 913 ), 914 _ 915 ); 916 } 917 } catch (ne) { 918 if (!(ne instanceof ReferenceError)) throw ne; 919 } 920})();
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.