@qwik-custom-elements/adapter-stencil 1.0.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +21 -0
- package/README.md +420 -0
- package/dist/bundle-graph.json +1 -0
- package/dist/client/client-setup.d.ts +9 -0
- package/dist/client/client-setup.d.ts.map +1 -0
- package/dist/client/client-setup.test.d.ts +2 -0
- package/dist/client/client-setup.test.d.ts.map +1 -0
- package/dist/client/index.cjs +1 -0
- package/dist/client/index.d.ts +3 -0
- package/dist/client/index.d.ts.map +1 -0
- package/dist/client/index.js +6 -0
- package/dist/client/stencil-csr-props.d.ts +2 -0
- package/dist/client/stencil-csr-props.d.ts.map +1 -0
- package/dist/client/stencil-csr-props.test.d.ts +2 -0
- package/dist/client/stencil-csr-props.test.d.ts.map +1 -0
- package/dist/client/stencil-csr.d.ts +10 -0
- package/dist/client/stencil-csr.d.ts.map +1 -0
- package/dist/client-setup-C_qW_ZSR.cjs +1 -0
- package/dist/client-setup-D-ffVtNL.js +53 -0
- package/dist/client-setup.ts_createStencilClientSetup_runSetup_6wDTmOSdSbc-CPKK-h2J.js +11 -0
- package/dist/client-setup.ts_createStencilClientSetup_runSetup_6wDTmOSdSbc-Dz0z3zer.cjs +1 -0
- package/dist/core.min-Qm7Mxv6F.js +1846 -0
- package/dist/core.min-vJ4M2jcU.cjs +2 -0
- package/dist/index.d.ts +84 -0
- package/dist/index.d.ts.map +1 -0
- package/dist/index.qwik.cjs +8 -0
- package/dist/index.qwik.mjs +364 -0
- package/dist/index.test.d.ts +2 -0
- package/dist/index.test.d.ts.map +1 -0
- package/dist/preloader-Bietv0BS.js +118 -0
- package/dist/preloader-Cqc--uBU.cjs +1 -0
- package/dist/q-manifest.json +381 -0
- package/dist/qwikloader-C01zMTOC.js +102 -0
- package/dist/qwikloader-vFGnpgvG.cjs +2 -0
- package/dist/ssr/element-props-utils.d.ts +10 -0
- package/dist/ssr/element-props-utils.d.ts.map +1 -0
- package/dist/ssr/element-props-utils.test.d.ts +2 -0
- package/dist/ssr/element-props-utils.test.d.ts.map +1 -0
- package/dist/ssr/index.cjs +1 -0
- package/dist/ssr/index.d.ts +5 -0
- package/dist/ssr/index.d.ts.map +1 -0
- package/dist/ssr/index.js +29 -0
- package/dist/ssr/model.d.ts +49 -0
- package/dist/ssr/model.d.ts.map +1 -0
- package/dist/ssr/stencil-ssr.d.ts +14 -0
- package/dist/ssr/stencil-ssr.d.ts.map +1 -0
- package/dist/ssr/styles-core.d.ts +29 -0
- package/dist/ssr/styles-core.d.ts.map +1 -0
- package/dist/ssr/styles-core.test.d.ts +2 -0
- package/dist/ssr/styles-core.test.d.ts.map +1 -0
- package/dist/stencil-csr-B1U9s3VQ.js +24 -0
- package/dist/stencil-csr-D6zt1Am9.cjs +1 -0
- package/dist/stencil-csr.tsx_createStencilCSRComponent_component_pD3ekIZcUT0-ChAZ0hL3.js +37 -0
- package/dist/stencil-csr.tsx_createStencilCSRComponent_component_pD3ekIZcUT0-cGN__hqm.cjs +1 -0
- package/dist/stencil-csr.tsx_createStencilCSRComponent_component_useVisibleTask_1_dqWPXf9eNnk-BYiBxXW-.js +34 -0
- package/dist/stencil-csr.tsx_createStencilCSRComponent_component_useVisibleTask_1_dqWPXf9eNnk-sFN0uMI_.cjs +1 -0
- package/dist/stencil-csr.tsx_createStencilCSRComponent_component_useVisibleTask_y00qkhhKua8-BSsN2V78.cjs +1 -0
- package/dist/stencil-csr.tsx_createStencilCSRComponent_component_useVisibleTask_y00qkhhKua8-CF00O7hf.js +19 -0
- package/dist/stencil-ssr-BHjT94rd.js +118 -0
- package/dist/stencil-ssr-UlYtcG0-.cjs +1 -0
- package/dist/stencil-ssr.tsx_createStencilSSRBridgeComponent_component_IlVdOHKZfN0-46y8eTjO.cjs +1 -0
- package/dist/stencil-ssr.tsx_createStencilSSRBridgeComponent_component_IlVdOHKZfN0-BfqXBofh.js +42 -0
- package/dist/stencil-ssr.tsx_createStencilSSRBridgeComponent_component_useOnDocument_bvALMlewx7Q-DA73DRke.cjs +1 -0
- package/dist/stencil-ssr.tsx_createStencilSSRBridgeComponent_component_useOnDocument_bvALMlewx7Q-DdcskN1z.js +10 -0
- package/dist/stencil-ssr.tsx_createStencilSSRBridgeComponent_component_useTask_1_aXg7AuatGTc-61dSP-JG.cjs +1 -0
- package/dist/stencil-ssr.tsx_createStencilSSRBridgeComponent_component_useTask_1_aXg7AuatGTc-Byrz3fUp.js +34 -0
- package/dist/stencil-ssr.tsx_createStencilSSRBridgeComponent_component_useTask_IH8I3eLdwI0-BtIygb8E.js +12 -0
- package/dist/stencil-ssr.tsx_createStencilSSRBridgeComponent_component_useTask_IH8I3eLdwI0-DNQBT8Vc.cjs +1 -0
- package/package.json +53 -0
|
@@ -0,0 +1,1846 @@
|
|
|
1
|
+
var Or = Object.defineProperty;
|
|
2
|
+
var Pr = (e, t, n) => t in e ? Or(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
|
|
3
|
+
var k = (e, t, n) => Pr(e, typeof t != "symbol" ? t + "" : t, n);
|
|
4
|
+
import { p as on } from "./preloader-Bietv0BS.js";
|
|
5
|
+
const $r = !1, kt = (e) => e && typeof e.nodeType == "number", Mr = (e) => e.nodeType === 9, je = (e) => e.nodeType === 1, _e = (e) => {
|
|
6
|
+
const t = e.nodeType;
|
|
7
|
+
return t === 1 || t === 111;
|
|
8
|
+
}, Wr = (e) => {
|
|
9
|
+
const t = e.nodeType;
|
|
10
|
+
return t === 1 || t === 111 || t === 3;
|
|
11
|
+
}, X = (e) => e.nodeType === 111, Rn = (e) => e.nodeType === 3, Fe = (e) => e.nodeType === 8, ie = (e, ...t) => Tt(!1, e, ...t), Ir = (e, ...t) => {
|
|
12
|
+
throw Tt(!1, e, ...t);
|
|
13
|
+
}, St = (e, ...t) => Tt(!1, e, ...t), Tt = (e, t, ...n) => {
|
|
14
|
+
const r = t instanceof Error ? t : new Error(t);
|
|
15
|
+
return console.error("%cQWIK ERROR", "", r.message, ...n, r.stack), r;
|
|
16
|
+
};
|
|
17
|
+
const ze = (e) => `Code(${e}) https://github.com/QwikDev/qwik/blob/main/packages/qwik/src/core/error/error.ts#L${8 + e}`, $ = (e, ...t) => {
|
|
18
|
+
const n = ze(e, ...t);
|
|
19
|
+
return St(n, ...t);
|
|
20
|
+
}, Dr = () => ({ isServer: $r, importSymbol(e, t, n) {
|
|
21
|
+
if (!t) throw $(31, n);
|
|
22
|
+
if (!e) throw $(30, t, n);
|
|
23
|
+
const r = Lr(e.ownerDocument, e, t).toString(), o = new URL(r);
|
|
24
|
+
return o.hash = "", import(o.href).then((s) => s[n]);
|
|
25
|
+
}, raf: (e) => new Promise((t) => {
|
|
26
|
+
requestAnimationFrame(() => {
|
|
27
|
+
t(e());
|
|
28
|
+
});
|
|
29
|
+
}), nextTick: (e) => new Promise((t) => {
|
|
30
|
+
setTimeout(() => {
|
|
31
|
+
t(e());
|
|
32
|
+
});
|
|
33
|
+
}), chunkForSymbol: (e, t) => [e, t ?? "_"] }), Lr = (e, t, n) => {
|
|
34
|
+
const r = e.baseURI, o = new URL(t.getAttribute("q:base") ?? r, r);
|
|
35
|
+
return new URL(n, o);
|
|
36
|
+
};
|
|
37
|
+
let Hr = /* @__PURE__ */ Dr();
|
|
38
|
+
const qt = () => Hr, Ct = (e) => {
|
|
39
|
+
const t = Object.getPrototypeOf(e);
|
|
40
|
+
return t === Object.prototype || t === null;
|
|
41
|
+
}, Ze = (e) => !!e && typeof e == "object", E = (e) => Array.isArray(e), Ee = (e) => typeof e == "string", H = (e) => typeof e == "function", U = (e) => e && typeof e.then == "function", jt = (e, t, n) => {
|
|
42
|
+
try {
|
|
43
|
+
const r = e();
|
|
44
|
+
return U(r) ? r.then(t, n) : t(r);
|
|
45
|
+
} catch (r) {
|
|
46
|
+
return n(r);
|
|
47
|
+
}
|
|
48
|
+
}, q = (e, t) => U(e) ? e.then(t) : t(e), _t = (e) => e.some(U) ? Promise.all(e) : e, Re = (e) => e.length > 0 ? Promise.all(e) : e, Ur = (e) => e != null, Br = (e) => new Promise((t) => {
|
|
49
|
+
setTimeout(t, e);
|
|
50
|
+
}), Y = [], P = {}, Oe = () => document, ye = "q:renderFn", Z = "q:slot", Et = "q:sref", ae = "q:s", xt = "q:style", Fr = "q:sstyle", On = "q:instance", Pn = (e, t) => e["qFuncs_" + t] || [], At = "q:container", $n = "[q\\:container]", Nt = "qRender", Mn = "qTask", Wn = "q:id", ut = /* @__PURE__ */ Symbol("proxy target"), le = /* @__PURE__ */ Symbol("proxy flags"), M = /* @__PURE__ */ Symbol("proxy manager"), N = /* @__PURE__ */ Symbol("IMMUTABLE"), pe = "$$", be = "__virtual", Rt = "_qc_", D = (e, t, n) => e.setAttribute(t, n), B = (e, t) => e.getAttribute(t), Ot = (e) => e.replace(/([A-Z])/g, "-$1").toLowerCase(), In = (e, t, n = 0) => t.t.get(e) || (n !== 0 && Je(e, n), Ge(e, t, void 0)), Ge = (e, t, n) => {
|
|
51
|
+
Ne(e), t.t.has(e);
|
|
52
|
+
const r = t.l.o(n), o = new Proxy(e, new Dn(t, r));
|
|
53
|
+
return t.t.set(e, o), o;
|
|
54
|
+
}, Pt = () => {
|
|
55
|
+
const e = {};
|
|
56
|
+
return Je(e, 2), e;
|
|
57
|
+
}, Je = (e, t) => {
|
|
58
|
+
Object.defineProperty(e, le, { value: t, enumerable: !1 });
|
|
59
|
+
}, ri = (e, t) => {
|
|
60
|
+
const n = {};
|
|
61
|
+
for (const r in e) t.includes(r) || (n[r] = e[r]);
|
|
62
|
+
return n;
|
|
63
|
+
};
|
|
64
|
+
class Dn {
|
|
65
|
+
constructor(t, n) {
|
|
66
|
+
k(this, "u");
|
|
67
|
+
k(this, "$");
|
|
68
|
+
this.u = t, this.$ = n;
|
|
69
|
+
}
|
|
70
|
+
deleteProperty(t, n) {
|
|
71
|
+
if (2 & t[le]) throw $(17);
|
|
72
|
+
return typeof n == "string" && delete t[n] && (this.$.p(E(t) ? void 0 : n), !0);
|
|
73
|
+
}
|
|
74
|
+
get(t, n) {
|
|
75
|
+
if (typeof n == "symbol") return n === ut ? t : n === M ? this.$ : t[n];
|
|
76
|
+
const r = t[le] ?? 0, o = L(), s = !!(1 & r), i = t[pe + n];
|
|
77
|
+
let l, c;
|
|
78
|
+
if (o && (l = o.v), !(2 & r) || n in t && !zr(t[N]?.[n]) || (l = null), i ? (c = i.value, l = null) : c = t[n], l) {
|
|
79
|
+
const u = E(t);
|
|
80
|
+
this.$.m(l, u ? void 0 : n);
|
|
81
|
+
}
|
|
82
|
+
return s ? Zr(c, this.u) : c;
|
|
83
|
+
}
|
|
84
|
+
set(t, n, r) {
|
|
85
|
+
if (typeof n == "symbol") return t[n] = r, !0;
|
|
86
|
+
const o = t[le] ?? 0;
|
|
87
|
+
if (2 & o) throw $(17);
|
|
88
|
+
const s = 1 & o ? Ne(r) : r;
|
|
89
|
+
if (E(t)) return t[n] = s, this.$.p(), !0;
|
|
90
|
+
const i = t[n];
|
|
91
|
+
return t[n] = s, i !== s && this.$.p(n), !0;
|
|
92
|
+
}
|
|
93
|
+
has(t, n) {
|
|
94
|
+
if (n === ut) return !0;
|
|
95
|
+
const r = L();
|
|
96
|
+
if (typeof n == "string" && r) {
|
|
97
|
+
const s = r.v;
|
|
98
|
+
if (s) {
|
|
99
|
+
const i = E(t);
|
|
100
|
+
this.$.m(s, i ? void 0 : n);
|
|
101
|
+
}
|
|
102
|
+
}
|
|
103
|
+
const o = Object.prototype.hasOwnProperty;
|
|
104
|
+
return !!o.call(t, n) || !(typeof n != "string" || !o.call(t, pe + n));
|
|
105
|
+
}
|
|
106
|
+
ownKeys(t) {
|
|
107
|
+
if (!(2 & (t[le] ?? 0))) {
|
|
108
|
+
let n = null;
|
|
109
|
+
const r = L();
|
|
110
|
+
r && (n = r.v), n && this.$.m(n);
|
|
111
|
+
}
|
|
112
|
+
return E(t) ? Reflect.ownKeys(t) : Reflect.ownKeys(t).map((n) => typeof n == "string" && n.startsWith(pe) ? n.slice(2) : n);
|
|
113
|
+
}
|
|
114
|
+
getOwnPropertyDescriptor(t, n) {
|
|
115
|
+
const r = Reflect.getOwnPropertyDescriptor(t, n);
|
|
116
|
+
return E(t) || typeof n == "symbol" || r && !r.configurable ? r : { enumerable: !0, configurable: !0 };
|
|
117
|
+
}
|
|
118
|
+
}
|
|
119
|
+
const zr = (e) => e === N || I(e), Zr = (e, t) => {
|
|
120
|
+
if (Ze(e)) {
|
|
121
|
+
if (Object.isFrozen(e)) return e;
|
|
122
|
+
const n = Ne(e);
|
|
123
|
+
if (n !== e || _r(n)) return e;
|
|
124
|
+
if (Ct(n) || E(n)) return t.t.get(n) || In(n, t, 1);
|
|
125
|
+
}
|
|
126
|
+
return e;
|
|
127
|
+
}, Gr = /^(on|window:|document:)/, Jr = "preventdefault:", Ln = (e) => e.endsWith("$") && Gr.test(e), Hn = (e, t, n, r) => {
|
|
128
|
+
if (t.endsWith("$"), t = at(t.slice(0, -1)), n) if (E(n)) {
|
|
129
|
+
const o = n.flat(1 / 0).filter((s) => s != null).map((s) => [t, ln(s, r)]);
|
|
130
|
+
e.push(...o);
|
|
131
|
+
} else e.push([t, ln(n, r)]);
|
|
132
|
+
return t;
|
|
133
|
+
}, sn = ["on", "window:on", "document:on"], Kr = ["on", "on-window", "on-document"], at = (e) => {
|
|
134
|
+
let t = "on";
|
|
135
|
+
for (let n = 0; n < sn.length; n++) {
|
|
136
|
+
const r = sn[n];
|
|
137
|
+
if (e.startsWith(r)) {
|
|
138
|
+
t = Kr[n], e = e.slice(r.length);
|
|
139
|
+
break;
|
|
140
|
+
}
|
|
141
|
+
}
|
|
142
|
+
return t + ":" + (e.startsWith("-") ? Ot(e.slice(1)) : e.toLowerCase());
|
|
143
|
+
}, ln = (e, t) => {
|
|
144
|
+
const n = en(e) ? e : Ys(e);
|
|
145
|
+
return n.S(t), n;
|
|
146
|
+
}, Vr = (e, t = 0) => {
|
|
147
|
+
for (let n = 0; n < e.length; n++) t = (t << 5) - t + e.charCodeAt(n), t |= 0;
|
|
148
|
+
return Number(Math.abs(t)).toString(36);
|
|
149
|
+
}, Ke = () => {
|
|
150
|
+
const e = Jt(), t = R(e.q, e.j.k.u), n = t.C || (t.C = []), r = e.P++;
|
|
151
|
+
return { val: n[r], set: (o) => n[r] = o, i: r, iCtx: e, elCtx: t };
|
|
152
|
+
}, Xr = (e) => /* @__PURE__ */ Object.freeze({ id: Ot(e) }), Qr = (e, t) => (e.O === void 0 && (e.O = ((n, r) => {
|
|
153
|
+
let o = n, s = 1;
|
|
154
|
+
for (; o && !o.hasAttribute?.("q:container"); ) {
|
|
155
|
+
for (; o = o.previousSibling; ) if (Fe(o)) {
|
|
156
|
+
const i = o[be];
|
|
157
|
+
if (i) {
|
|
158
|
+
const l = i[Rt];
|
|
159
|
+
if (o === i.open) return l ?? R(i, r);
|
|
160
|
+
if (l?.O) return l.O;
|
|
161
|
+
o = i;
|
|
162
|
+
continue;
|
|
163
|
+
}
|
|
164
|
+
if (o.data === "/qv") s++;
|
|
165
|
+
else if (o.data.startsWith("qv ") && (s--, s === 0)) return R(Ce(o), r);
|
|
166
|
+
}
|
|
167
|
+
o = n.parentElement, n = o;
|
|
168
|
+
}
|
|
169
|
+
return null;
|
|
170
|
+
})(e.T, t)), e.O), Yr = (e, t, n) => {
|
|
171
|
+
const r = e.id;
|
|
172
|
+
if (!t) return;
|
|
173
|
+
let o = t;
|
|
174
|
+
for (; o; ) {
|
|
175
|
+
const s = o.M?.get(r);
|
|
176
|
+
if (s) return s;
|
|
177
|
+
o = Qr(o, n);
|
|
178
|
+
}
|
|
179
|
+
}, eo = /* @__PURE__ */ Xr("qk-error"), $t = (e, t, n) => {
|
|
180
|
+
const r = K(t);
|
|
181
|
+
{
|
|
182
|
+
const o = Yr(eo, r, n.k.u);
|
|
183
|
+
if (o === void 0) throw e;
|
|
184
|
+
o.error = e;
|
|
185
|
+
}
|
|
186
|
+
}, to = /* @__PURE__ */ new Set(["animationIterationCount", "aspectRatio", "borderImageOutset", "borderImageSlice", "borderImageWidth", "boxFlex", "boxFlexGroup", "boxOrdinalGroup", "columnCount", "columns", "flex", "flexGrow", "flexShrink", "gridArea", "gridRow", "gridRowEnd", "gridRowStart", "gridColumn", "gridColumnEnd", "gridColumnStart", "fontWeight", "lineClamp", "lineHeight", "opacity", "order", "orphans", "scale", "tabSize", "widows", "zIndex", "zoom", "MozAnimationIterationCount", "MozBoxFlex", "msFlex", "msFlexPositive", "WebkitAnimationIterationCount", "WebkitBoxFlex", "WebkitBoxOrdinalGroup", "WebkitColumnCount", "WebkitColumns", "WebkitFlex", "WebkitFlexGrow", "WebkitFlexShrink", "WebkitLineClamp"]), ft = (e, t, n) => {
|
|
187
|
+
t.R &= ~Se, t.R |= Zt, t.I = [], t.li.length = 0;
|
|
188
|
+
const r = t.T, o = t.A, s = t.N, i = W(e.k.L, r, void 0, Nt), l = i.F = [], c = Mt(e);
|
|
189
|
+
c.U = t, c.W = void 0, i.v = [0, r], i.j = e, o.S(e.k.u.D);
|
|
190
|
+
const u = o.getFn(i);
|
|
191
|
+
return jt(() => u(s), (a) => q(Re(l), () => t.R & Se && !(n && n > 100) ? ft(e, t, n ? n + 1 : 1) : { node: a, rCtx: c }), (a) => a !== ir || n && n > 100 ? ($t(a, r, e), { node: zn, rCtx: c }) : q(Re(l), () => ft(e, t, n ? n + 1 : 1)));
|
|
192
|
+
}, no = (e, t) => ({ k: { H: e, L: t.J.locale, u: t, B: /* @__PURE__ */ new Set(), G: [], Y: [], K: [], X: [], Z: [], tt: [] }, U: null, W: void 0 }), Mt = (e) => ({ k: e.k, U: e.U, W: e.W }), Wt = (e, t) => t?.nt?.length ? t.nt.join(" ") + " " + ht(e) : ht(e), ht = (e) => {
|
|
193
|
+
if (!e) return "";
|
|
194
|
+
if (Ee(e)) return e.trim();
|
|
195
|
+
const t = [];
|
|
196
|
+
if (E(e)) for (const n of e) {
|
|
197
|
+
const r = ht(n);
|
|
198
|
+
r && t.push(r);
|
|
199
|
+
}
|
|
200
|
+
else for (const [n, r] of Object.entries(e)) r && t.push(n.trim());
|
|
201
|
+
return t.join(" ");
|
|
202
|
+
}, It = (e) => {
|
|
203
|
+
if (e == null) return "";
|
|
204
|
+
if (typeof e == "object") {
|
|
205
|
+
if (E(e)) throw $(0, e, "style");
|
|
206
|
+
{
|
|
207
|
+
const t = [];
|
|
208
|
+
for (const n in e) if (Object.prototype.hasOwnProperty.call(e, n)) {
|
|
209
|
+
const r = e[n];
|
|
210
|
+
r != null && typeof r != "function" && (n.startsWith("--") ? t.push(n + ":" + r) : t.push(Ot(n) + ":" + ro(n, r)));
|
|
211
|
+
}
|
|
212
|
+
return t.join(";");
|
|
213
|
+
}
|
|
214
|
+
}
|
|
215
|
+
return String(e);
|
|
216
|
+
}, ro = (e, t) => typeof t != "number" || t === 0 || to.has(e) ? t : t + "px", Un = (e) => Me(e.k.u.et++), Bn = (e, t) => {
|
|
217
|
+
const n = Un(e);
|
|
218
|
+
t.rt = n;
|
|
219
|
+
}, Dt = (e) => I(e) ? Dt(e.value) : e == null || typeof e == "boolean" ? "" : String(e);
|
|
220
|
+
function oo(e) {
|
|
221
|
+
return e.startsWith("aria-");
|
|
222
|
+
}
|
|
223
|
+
const so = (e, t) => !!t.key && (!Ve(e) || !H(e.type) && e.key != t.key), ee = "dangerouslySetInnerHTML", Fn = (e, t, n, r, o, s) => {
|
|
224
|
+
const i = s == null ? null : String(s);
|
|
225
|
+
return new xe(e, t || P, n, r, o, i);
|
|
226
|
+
}, oi = (e, t, n, r, o, s) => {
|
|
227
|
+
let i = null;
|
|
228
|
+
return t && "children" in t && (i = t.children, delete t.children), Fn(e, t, n, i, r, o);
|
|
229
|
+
}, Lt = (e, t, n, r, o) => {
|
|
230
|
+
const s = r == null ? null : String(r), i = t ?? {};
|
|
231
|
+
if (typeof e == "string" && N in i) {
|
|
232
|
+
const c = i[N];
|
|
233
|
+
delete i[N];
|
|
234
|
+
const u = i.children;
|
|
235
|
+
delete i.children;
|
|
236
|
+
for (const [a, h] of Object.entries(c)) h !== N && (delete i[a], i[a] = h);
|
|
237
|
+
return Fn(e, null, i, u, n, r);
|
|
238
|
+
}
|
|
239
|
+
const l = new xe(e, i, null, i.children, n, s);
|
|
240
|
+
return typeof e == "string" && t && delete t.children, l;
|
|
241
|
+
}, Pe = ":skipRender";
|
|
242
|
+
class xe {
|
|
243
|
+
constructor(t, n, r, o, s, i = null) {
|
|
244
|
+
k(this, "type");
|
|
245
|
+
k(this, "props");
|
|
246
|
+
k(this, "immutableProps");
|
|
247
|
+
k(this, "children");
|
|
248
|
+
k(this, "flags");
|
|
249
|
+
k(this, "key");
|
|
250
|
+
k(this, "dev");
|
|
251
|
+
this.type = t, this.props = n, this.immutableProps = r, this.children = o, this.flags = s, this.key = i;
|
|
252
|
+
}
|
|
253
|
+
}
|
|
254
|
+
const we = (e) => e.children, Ve = (e) => e instanceof xe, dt = (e) => e.children, zn = /* @__PURE__ */ Symbol("skip render"), Ht = (e, t, n) => {
|
|
255
|
+
const r = !(t.R & Zt), o = t.T, s = e.k.u;
|
|
256
|
+
return s.wt.delete(t), s.l.bt(o), q(ft(e, t), (i) => {
|
|
257
|
+
const l = e.k, c = i.rCtx, u = W(e.k.L, o);
|
|
258
|
+
if (l.B.add(o), u.v = [0, o], u.j = c, r && t.ft) for (const h of t.ft) rs(l, h);
|
|
259
|
+
const a = J(i.node, u);
|
|
260
|
+
return q(a, (h) => {
|
|
261
|
+
const g = io(o, h), p = Ut(t);
|
|
262
|
+
return q(De(c, p, g, n), () => {
|
|
263
|
+
t.yt = g;
|
|
264
|
+
});
|
|
265
|
+
});
|
|
266
|
+
});
|
|
267
|
+
}, Ut = (e) => (e.yt || (e.yt = Le(e.T)), e.yt);
|
|
268
|
+
class z {
|
|
269
|
+
constructor(t, n, r, o, s, i) {
|
|
270
|
+
k(this, "gt");
|
|
271
|
+
k(this, "N");
|
|
272
|
+
k(this, "xt");
|
|
273
|
+
k(this, "St");
|
|
274
|
+
k(this, "R");
|
|
275
|
+
k(this, "qt");
|
|
276
|
+
k(this, "kt", null);
|
|
277
|
+
k(this, "jt", "");
|
|
278
|
+
k(this, "Ct", null);
|
|
279
|
+
k(this, "rt");
|
|
280
|
+
k(this, "Pt");
|
|
281
|
+
this.gt = t, this.N = n, this.xt = r, this.St = o, this.R = s, this.qt = i, this.rt = t + (i ? ":" + i : "");
|
|
282
|
+
}
|
|
283
|
+
}
|
|
284
|
+
const Zn = (e, t) => {
|
|
285
|
+
const { key: n, type: r, props: o, children: s, flags: i, immutableProps: l } = e;
|
|
286
|
+
let c = "";
|
|
287
|
+
if (Ee(r)) c = r;
|
|
288
|
+
else {
|
|
289
|
+
if (r !== we) {
|
|
290
|
+
if (H(r)) {
|
|
291
|
+
const a = G(t, r, o, n, i, e.dev);
|
|
292
|
+
return so(a, e) ? Zn(Lt(we, { children: a }, 0, n), t) : J(a, t);
|
|
293
|
+
}
|
|
294
|
+
throw $(25, r);
|
|
295
|
+
}
|
|
296
|
+
c = he;
|
|
297
|
+
}
|
|
298
|
+
let u = Y;
|
|
299
|
+
return s != null ? q(J(s, t), (a) => (a !== void 0 && (u = E(a) ? a : [a]), new z(c, o, l, u, i, n))) : new z(c, o, l, u, i, n);
|
|
300
|
+
}, io = (e, t) => {
|
|
301
|
+
const n = t === void 0 ? Y : E(t) ? t : [t], r = new z(":virtual", {}, null, n, 0, null);
|
|
302
|
+
return r.kt = e, r;
|
|
303
|
+
}, J = (e, t) => {
|
|
304
|
+
if (e != null && typeof e != "boolean") {
|
|
305
|
+
if (Gn(e)) {
|
|
306
|
+
const n = new z("#text", P, null, Y, 0, null);
|
|
307
|
+
return n.jt = String(e), n;
|
|
308
|
+
}
|
|
309
|
+
if (Ve(e)) return Zn(e, t);
|
|
310
|
+
if (I(e)) {
|
|
311
|
+
const n = new z("#signal", P, null, Y, 0, null);
|
|
312
|
+
return n.Ct = e, n;
|
|
313
|
+
}
|
|
314
|
+
if (E(e)) {
|
|
315
|
+
const n = _t(e.flatMap((r) => J(r, t)));
|
|
316
|
+
return q(n, (r) => r.flat(100).filter(Ur));
|
|
317
|
+
}
|
|
318
|
+
return U(e) ? e.then((n) => J(n, t)) : e === zn ? new z(Pe, P, null, Y, 0, null) : void 0;
|
|
319
|
+
}
|
|
320
|
+
}, Gn = (e) => Ee(e) || typeof e == "number", Jn = (e) => {
|
|
321
|
+
B(e, At) === "paused" && lo(e);
|
|
322
|
+
}, lo = (e) => {
|
|
323
|
+
if (!Uo(e)) return;
|
|
324
|
+
const t = e._qwikjson_ ?? ((d) => {
|
|
325
|
+
const w = Oe(), S = fo(d === w.documentElement ? w.body : d, "type");
|
|
326
|
+
if (S) return JSON.parse(ao(S.firstChild.data) || "{}");
|
|
327
|
+
})(e);
|
|
328
|
+
if (e._qwikjson_ = null, !t) return;
|
|
329
|
+
const n = Oe(), r = e.getAttribute(On), o = Pn(n, r), s = Kt(e), i = /* @__PURE__ */ new Map(), l = /* @__PURE__ */ new Map();
|
|
330
|
+
let c = null, u = 0;
|
|
331
|
+
const a = n.createTreeWalker(e, Ho);
|
|
332
|
+
for (; c = a.nextNode(); ) {
|
|
333
|
+
const d = c.data;
|
|
334
|
+
if (u === 0) {
|
|
335
|
+
if (d.startsWith("qv ")) {
|
|
336
|
+
const w = po(d);
|
|
337
|
+
w >= 0 && i.set(w, c);
|
|
338
|
+
} else if (d.startsWith("t=")) {
|
|
339
|
+
const w = d.slice(2), S = F(w), j = ho(c);
|
|
340
|
+
i.set(S, j), l.set(S, j.data);
|
|
341
|
+
}
|
|
342
|
+
}
|
|
343
|
+
d === "cq" ? u++ : d === "/cq" && u--;
|
|
344
|
+
}
|
|
345
|
+
const h = e.getElementsByClassName("qc📦").length !== 0;
|
|
346
|
+
e.querySelectorAll("[q\\:id]").forEach((d) => {
|
|
347
|
+
if (h && d.closest("[q\\:container]") !== e) return;
|
|
348
|
+
const w = B(d, Wn), S = F(w);
|
|
349
|
+
i.set(S, d);
|
|
350
|
+
});
|
|
351
|
+
const g = Ws(s, n), p = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Set(), b = (d) => p.has(d) ? p.get(d) : v(d), v = (d) => {
|
|
352
|
+
if (d.startsWith("#")) {
|
|
353
|
+
const _ = d.slice(1), x = F(_);
|
|
354
|
+
i.has(x);
|
|
355
|
+
const A = i.get(x);
|
|
356
|
+
if (Fe(A)) {
|
|
357
|
+
if (!A.isConnected) return void p.set(d, void 0);
|
|
358
|
+
const re = Ce(A);
|
|
359
|
+
return p.set(d, re), R(re, s), re;
|
|
360
|
+
}
|
|
361
|
+
return je(A) ? (p.set(d, A), R(A, s), A) : (p.set(d, A), A);
|
|
362
|
+
}
|
|
363
|
+
if (d.startsWith("@")) {
|
|
364
|
+
const _ = d.slice(1), x = F(_);
|
|
365
|
+
return o[x];
|
|
366
|
+
}
|
|
367
|
+
if (d.startsWith("*")) {
|
|
368
|
+
const _ = d.slice(1), x = F(_);
|
|
369
|
+
i.has(x);
|
|
370
|
+
const A = l.get(x);
|
|
371
|
+
return p.set(d, A), A;
|
|
372
|
+
}
|
|
373
|
+
const w = F(d);
|
|
374
|
+
let S = t.objs[w];
|
|
375
|
+
Ee(S) && (S = S === Tr ? void 0 : g.prepare(S));
|
|
376
|
+
let j = S;
|
|
377
|
+
for (let _ = d.length - 1; _ >= 0; _--) {
|
|
378
|
+
const x = Is[d[_]];
|
|
379
|
+
if (!x) break;
|
|
380
|
+
j = x(j, s);
|
|
381
|
+
}
|
|
382
|
+
return p.set(d, j), Gn(S) || y.has(w) || (y.add(w), co(S, w, t.subs, b, s, g), uo(S, b, g)), j;
|
|
383
|
+
};
|
|
384
|
+
var f, m;
|
|
385
|
+
s.et = 1e5, s.Mt = { getObject: b, meta: t.ctx, refs: t.refs }, D(e, At, "resumed"), m = !0, (f = e) && f.dispatchEvent(new CustomEvent("qresume", { detail: void 0, bubbles: m, composed: m }));
|
|
386
|
+
}, co = (e, t, n, r, o, s) => {
|
|
387
|
+
const i = n[t];
|
|
388
|
+
if (i) {
|
|
389
|
+
const l = [];
|
|
390
|
+
let c = 0;
|
|
391
|
+
for (const u of i) if (u.startsWith("_")) c = parseInt(u.slice(1), 10);
|
|
392
|
+
else {
|
|
393
|
+
const a = Bs(u, r);
|
|
394
|
+
a && l.push(a);
|
|
395
|
+
}
|
|
396
|
+
if (c > 0 && Je(e, c), !s.subs(e, l)) {
|
|
397
|
+
const u = o.t.get(e);
|
|
398
|
+
u ? Q(u).Ot(l) : Ge(e, o, l);
|
|
399
|
+
}
|
|
400
|
+
}
|
|
401
|
+
}, uo = (e, t, n) => {
|
|
402
|
+
if (!n.fill(e, t) && e && typeof e == "object") {
|
|
403
|
+
if (E(e)) for (let r = 0; r < e.length; r++) e[r] = t(e[r]);
|
|
404
|
+
else if (Ct(e)) for (const r in e) e[r] = t(e[r]);
|
|
405
|
+
}
|
|
406
|
+
}, ao = (e) => e.replace(/\\x3C(\/?script)/gi, "<$1"), fo = (e, t) => {
|
|
407
|
+
let n = e.lastElementChild;
|
|
408
|
+
for (; n; ) {
|
|
409
|
+
if (n.tagName === "SCRIPT" && B(n, t) === "qwik/json") return n;
|
|
410
|
+
n = n.previousElementSibling;
|
|
411
|
+
}
|
|
412
|
+
}, ho = (e) => {
|
|
413
|
+
const t = e.nextSibling;
|
|
414
|
+
if (Rn(t)) return t;
|
|
415
|
+
{
|
|
416
|
+
const n = e.ownerDocument.createTextNode("");
|
|
417
|
+
return e.parentElement.insertBefore(n, e), n;
|
|
418
|
+
}
|
|
419
|
+
}, po = (e) => {
|
|
420
|
+
const t = e.indexOf("q:id=");
|
|
421
|
+
return t > 0 ? F(e.slice(t + 5)) : -1;
|
|
422
|
+
}, mo = () => {
|
|
423
|
+
const e = Oo();
|
|
424
|
+
let t = e.Tt;
|
|
425
|
+
if (!t) {
|
|
426
|
+
const n = e.T, r = or(n);
|
|
427
|
+
t = tt(decodeURIComponent(String(e.Et)), r), Jn(r);
|
|
428
|
+
const o = R(n, Kt(r));
|
|
429
|
+
Sr(t, o);
|
|
430
|
+
}
|
|
431
|
+
return t.ht;
|
|
432
|
+
}, go = (e, t) => {
|
|
433
|
+
if (e[0] === 0) {
|
|
434
|
+
const n = e[1];
|
|
435
|
+
zt(n) ? Bt(n, t) : vo(n, t);
|
|
436
|
+
} else yo(e, t);
|
|
437
|
+
}, vo = (e, t) => {
|
|
438
|
+
Jn(t.D);
|
|
439
|
+
const n = R(e, t);
|
|
440
|
+
n.R & Se || (n.R |= Se, t.ut !== void 0 ? t.wt.add(n) : (t.Rt.add(n), Ft(t)));
|
|
441
|
+
}, yo = (e, t) => {
|
|
442
|
+
const n = t.ut !== void 0;
|
|
443
|
+
t.It.add(e), n || Ft(t);
|
|
444
|
+
}, Bt = (e, t) => {
|
|
445
|
+
e.R & fe || (e.R |= fe, t.ut !== void 0 ? t.zt.add(e) : (t.At.add(e), Ft(t)));
|
|
446
|
+
}, Ft = (e) => (e._t === void 0 && (e._t = qt().nextTick(() => Kn(e))), e._t), bo = () => {
|
|
447
|
+
const [e] = mo();
|
|
448
|
+
Bt(e, Kt(or(e.Nt)));
|
|
449
|
+
}, Kn = async (e) => {
|
|
450
|
+
const t = e.D, n = Oe();
|
|
451
|
+
try {
|
|
452
|
+
const r = no(n, e), o = r.k, s = e.ut = new Set(e.Rt);
|
|
453
|
+
e.Rt.clear(), await ko(e, r), e.wt.forEach((c) => {
|
|
454
|
+
s.add(c);
|
|
455
|
+
}), e.wt.clear();
|
|
456
|
+
const i = Array.from(e.It);
|
|
457
|
+
e.It.clear();
|
|
458
|
+
const l = Array.from(s);
|
|
459
|
+
To(l), !e.Lt && l.length > 0 && (e.Lt = !0, (t === n.documentElement ? n.body : t).querySelectorAll("style[q\\:style]").forEach((c) => {
|
|
460
|
+
e.Ft.add(B(c, xt)), vr(o, n.head, c);
|
|
461
|
+
}));
|
|
462
|
+
for (const c of l) {
|
|
463
|
+
const u = c.T;
|
|
464
|
+
if (!o.B.has(u) && c.A) {
|
|
465
|
+
o.K.push(c);
|
|
466
|
+
try {
|
|
467
|
+
await Ht(r, c, wo(u.parentElement));
|
|
468
|
+
} catch (a) {
|
|
469
|
+
ie(a);
|
|
470
|
+
}
|
|
471
|
+
}
|
|
472
|
+
}
|
|
473
|
+
return i.forEach((c) => {
|
|
474
|
+
((u, a) => {
|
|
475
|
+
try {
|
|
476
|
+
const h = a[0], g = u.k;
|
|
477
|
+
switch (h) {
|
|
478
|
+
case 1:
|
|
479
|
+
case 2: {
|
|
480
|
+
let p, y;
|
|
481
|
+
h === 1 ? (p = a[1], y = a[3]) : (p = a[3], y = a[1]);
|
|
482
|
+
const b = K(p);
|
|
483
|
+
if (b == null) return;
|
|
484
|
+
const v = a[4], f = p.namespaceURI === Ae;
|
|
485
|
+
g.u.l.Ut(a);
|
|
486
|
+
let m = ne(a[2], a.slice(0, -1));
|
|
487
|
+
v === "class" ? m = Wt(m, K(y)) : v === "style" && (m = It(m));
|
|
488
|
+
const d = Ut(b);
|
|
489
|
+
return v in d.N && d.N[v] === m ? void 0 : (d.N[v] = m, Xt(g, p, v, m, f));
|
|
490
|
+
}
|
|
491
|
+
case 3:
|
|
492
|
+
case 4: {
|
|
493
|
+
const p = a[3];
|
|
494
|
+
if (!g.tt.includes(p)) {
|
|
495
|
+
g.u.l.Ut(a);
|
|
496
|
+
const y = void 0;
|
|
497
|
+
let b = ne(a[2], a.slice(0, -1));
|
|
498
|
+
const v = Ar;
|
|
499
|
+
Array.isArray(b) && (b = new xe(we, {}, null, b, 0, null));
|
|
500
|
+
let f = J(b, y);
|
|
501
|
+
if (U(f)) ie("Rendering promises in JSX signals is not supported");
|
|
502
|
+
else {
|
|
503
|
+
f === void 0 && (f = J("", y));
|
|
504
|
+
const m = ur(p), d = (function(w) {
|
|
505
|
+
for (; w; ) {
|
|
506
|
+
if (_e(w)) return w;
|
|
507
|
+
w = w.parentElement;
|
|
508
|
+
}
|
|
509
|
+
throw new Error("Not found");
|
|
510
|
+
})(a[1]);
|
|
511
|
+
if (u.U = R(d, u.k.u), m.gt == f.gt && m.qt == f.qt && m.rt == f.rt) se(u, m, f, 0);
|
|
512
|
+
else {
|
|
513
|
+
const w = [], S = m.kt, j = te(u, f, 0, w);
|
|
514
|
+
w.length && ie("Rendering promises in JSX signals is not supported"), v[3] = j, ue(u.k, p.parentElement, j, S), S && Yt(g, S);
|
|
515
|
+
}
|
|
516
|
+
}
|
|
517
|
+
}
|
|
518
|
+
}
|
|
519
|
+
}
|
|
520
|
+
} catch {
|
|
521
|
+
}
|
|
522
|
+
})(r, c);
|
|
523
|
+
}), o.G.push(...o.Y), o.G.length === 0 ? (Sn(o), void await cn(e, r)) : (await Xo(o), Sn(o), cn(e, r));
|
|
524
|
+
} catch (r) {
|
|
525
|
+
ie(r);
|
|
526
|
+
}
|
|
527
|
+
}, wo = (e) => {
|
|
528
|
+
let t = 0;
|
|
529
|
+
return e && (e.namespaceURI === Ae && (t |= O), e.tagName === "HEAD" && (t |= We)), t;
|
|
530
|
+
}, cn = async (e, t) => {
|
|
531
|
+
const n = t.k.B;
|
|
532
|
+
await So(e, t, (r, o) => (r.R & Qn) !== 0 && (!o || n.has(r.Nt))), e.wt.forEach((r) => {
|
|
533
|
+
e.Rt.add(r);
|
|
534
|
+
}), e.wt.clear(), e.ut = void 0, e._t = void 0, e.Rt.size + e.At.size + e.It.size > 0 && (e._t = Kn(e));
|
|
535
|
+
}, un = (e) => (e.R & Yn) !== 0, an = (e) => (e.R & er) !== 0, ko = async (e, t) => {
|
|
536
|
+
const n = e.D, r = [], o = [];
|
|
537
|
+
e.At.forEach((s) => {
|
|
538
|
+
un(s) && (o.push(q(s.Tt.Wt(n), () => s)), e.At.delete(s)), an(s) && (r.push(q(s.Tt.Wt(n), () => s)), e.At.delete(s));
|
|
539
|
+
});
|
|
540
|
+
do
|
|
541
|
+
if (e.zt.forEach((s) => {
|
|
542
|
+
un(s) ? o.push(q(s.Tt.Wt(n), () => s)) : an(s) ? r.push(q(s.Tt.Wt(n), () => s)) : e.At.add(s);
|
|
543
|
+
}), e.zt.clear(), o.length > 0) {
|
|
544
|
+
const s = await Promise.all(o);
|
|
545
|
+
pt(s), await Promise.all(s.map((i) => mt(i, e, t))), o.length = 0;
|
|
546
|
+
}
|
|
547
|
+
while (e.zt.size > 0);
|
|
548
|
+
if (r.length > 0) {
|
|
549
|
+
const s = await Promise.all(r);
|
|
550
|
+
pt(s);
|
|
551
|
+
for (const i of s) mt(i, e, t);
|
|
552
|
+
}
|
|
553
|
+
}, So = async (e, t, n) => {
|
|
554
|
+
const r = [], o = e.D;
|
|
555
|
+
e.At.forEach((s) => {
|
|
556
|
+
n(s, !1) && (s.Nt.isConnected && r.push(q(s.Tt.Wt(o), () => s)), e.At.delete(s));
|
|
557
|
+
});
|
|
558
|
+
do
|
|
559
|
+
if (e.zt.forEach((s) => {
|
|
560
|
+
s.Nt.isConnected && (n(s, !0) ? r.push(q(s.Tt.Wt(o), () => s)) : e.At.add(s));
|
|
561
|
+
}), e.zt.clear(), r.length > 0) {
|
|
562
|
+
const s = await Promise.all(r);
|
|
563
|
+
pt(s);
|
|
564
|
+
for (const i of s) mt(i, e, t);
|
|
565
|
+
r.length = 0;
|
|
566
|
+
}
|
|
567
|
+
while (e.zt.size > 0);
|
|
568
|
+
}, To = (e) => {
|
|
569
|
+
e.sort((t, n) => 2 & t.T.compareDocumentPosition(Ue(n.T)) ? 1 : -1);
|
|
570
|
+
}, pt = (e) => {
|
|
571
|
+
e.sort((t, n) => t.Nt === n.Nt ? t.Dt < n.Dt ? -1 : 1 : 2 & t.Nt.compareDocumentPosition(Ue(n.Nt)) ? 1 : -1);
|
|
572
|
+
}, qo = (e, t) => {
|
|
573
|
+
Xn(Vn(e, void 0), t);
|
|
574
|
+
}, fn = (e, t) => {
|
|
575
|
+
Xn(Vn(e, "document"), t);
|
|
576
|
+
}, Vn = (e, t) => {
|
|
577
|
+
const n = t !== void 0 ? t + ":" : "";
|
|
578
|
+
return Array.isArray(e) ? e.map((r) => `${n}on-${r}`) : `${n}on-${e}`;
|
|
579
|
+
}, Xn = (e, t) => {
|
|
580
|
+
if (t) {
|
|
581
|
+
const n = Jt(), r = R(n.q, n.j.k.u);
|
|
582
|
+
typeof e == "string" ? r.li.push([at(e), t]) : r.li.push(...e.map((o) => [at(o), t])), r.R |= gt;
|
|
583
|
+
}
|
|
584
|
+
}, Co = (e) => {
|
|
585
|
+
const t = Po(), n = H(e) && !tn(e) ? G(void 0, e) : e;
|
|
586
|
+
return Io(n, t, 0);
|
|
587
|
+
}, jo = (e) => {
|
|
588
|
+
const { val: t, set: n } = Ke();
|
|
589
|
+
return t ?? n(e = H(e) && !tn(e) ? e() : e);
|
|
590
|
+
}, si = (e) => jo(() => Co(e)), Qn = 1, Yn = 2, er = 4, fe = 16, ii = (e) => {
|
|
591
|
+
const { val: t, set: n, iCtx: r, i: o, elCtx: s } = Ke();
|
|
592
|
+
if (t) return;
|
|
593
|
+
const i = r.j.k.u, l = new Xe(fe | Yn, o, s.T, e, void 0);
|
|
594
|
+
n(!0), e.Wt(i.D), s.Ht || (s.Ht = []), s.Ht.push(l), Mo(r, () => tr(l, i, r.j));
|
|
595
|
+
}, li = (e, t) => {
|
|
596
|
+
const { val: n, set: r, i: o, iCtx: s, elCtx: i } = Ke(), l = t?.strategy ?? "intersection-observer";
|
|
597
|
+
if (n) return;
|
|
598
|
+
const c = new Xe(Qn, o, i.T, e, void 0), u = s.j.k.u;
|
|
599
|
+
i.Ht || (i.Ht = []), i.Ht.push(c), r(c), No(c, l), e.Wt(u.D), Bt(c, u);
|
|
600
|
+
}, _o = (e) => (e.R & er) !== 0, mt = async (e, t, n) => _o(e) ? Eo(e, t, n) : ((r) => !!(8 & r.R))(e) ? xo(e, t, n) : tr(e, t, n), Eo = (e, t, n, r) => {
|
|
601
|
+
e.R &= ~fe, ke(e);
|
|
602
|
+
const o = W(n.k.L, e.Nt, void 0, Mn), { l: s } = t;
|
|
603
|
+
o.j = n;
|
|
604
|
+
const i = e.Tt.getFn(o, () => {
|
|
605
|
+
s.bt(e);
|
|
606
|
+
}), l = [], c = e.Jt, u = Ne(c), a = { track: (f, m) => {
|
|
607
|
+
if (H(f)) {
|
|
608
|
+
const w = W();
|
|
609
|
+
return w.j = n, w.v = [0, e], G(w, f);
|
|
610
|
+
}
|
|
611
|
+
const d = Q(f);
|
|
612
|
+
return d ? d.m([0, e], m) : St(ze(26), f), m ? f[m] : I(f) ? f.value : f;
|
|
613
|
+
}, cleanup(f) {
|
|
614
|
+
l.push(f);
|
|
615
|
+
}, cache(f) {
|
|
616
|
+
let m = 0;
|
|
617
|
+
m = f === "immutable" ? 1 / 0 : f, c._cache = m;
|
|
618
|
+
}, previous: u._resolved };
|
|
619
|
+
let h, g, p = !1;
|
|
620
|
+
const y = (f, m) => !p && (p = !0, f ? (p = !0, c.loading = !1, c._state = "resolved", c._resolved = m, c._error = void 0, h(m)) : (p = !0, c.loading = !1, c._state = "rejected", c._error = m, g(m)), !0);
|
|
621
|
+
G(o, () => {
|
|
622
|
+
c._state = "pending", c.loading = !0, c.value = new Promise((f, m) => {
|
|
623
|
+
h = f, g = m;
|
|
624
|
+
});
|
|
625
|
+
}), e.Qt = xr(() => {
|
|
626
|
+
p = !0, l.forEach((f) => f());
|
|
627
|
+
});
|
|
628
|
+
const b = jt(() => q(r, () => i(a)), (f) => {
|
|
629
|
+
y(!0, f);
|
|
630
|
+
}, (f) => {
|
|
631
|
+
y(!1, f);
|
|
632
|
+
}), v = u._timeout;
|
|
633
|
+
return v > 0 ? Promise.race([b, Br(v).then(() => {
|
|
634
|
+
y(!1, new Error("timeout")) && ke(e);
|
|
635
|
+
})]) : b;
|
|
636
|
+
}, tr = (e, t, n) => {
|
|
637
|
+
e.R &= ~fe, ke(e);
|
|
638
|
+
const r = e.Nt, o = W(n.k.L, r, void 0, Mn);
|
|
639
|
+
o.j = n;
|
|
640
|
+
const { l: s } = t, i = e.Tt.getFn(o, () => {
|
|
641
|
+
s.bt(e);
|
|
642
|
+
}), l = [];
|
|
643
|
+
e.Qt = xr(() => {
|
|
644
|
+
l.forEach((u) => u());
|
|
645
|
+
});
|
|
646
|
+
const c = { track: (u, a) => {
|
|
647
|
+
if (H(u)) {
|
|
648
|
+
const g = W();
|
|
649
|
+
return g.v = [0, e], G(g, u);
|
|
650
|
+
}
|
|
651
|
+
const h = Q(u);
|
|
652
|
+
return h ? h.m([0, e], a) : St(ze(26), u), a ? u[a] : I(u) ? u.value : u;
|
|
653
|
+
}, cleanup(u) {
|
|
654
|
+
l.push(u);
|
|
655
|
+
} };
|
|
656
|
+
return jt(() => i(c), (u) => {
|
|
657
|
+
H(u) && l.push(u);
|
|
658
|
+
}, (u) => {
|
|
659
|
+
$t(u, r, n);
|
|
660
|
+
});
|
|
661
|
+
}, xo = (e, t, n) => {
|
|
662
|
+
e.R &= ~fe, ke(e);
|
|
663
|
+
const r = e.Nt, o = W(n.k.L, r, void 0, "qComputed");
|
|
664
|
+
o.v = [0, e], o.j = n;
|
|
665
|
+
const { l: s } = t, i = e.Tt.getFn(o, () => {
|
|
666
|
+
s.bt(e);
|
|
667
|
+
}), l = (u) => {
|
|
668
|
+
Wo(() => {
|
|
669
|
+
const a = e.Jt;
|
|
670
|
+
a[ge] &= ~sr, a.untrackedValue !== u && (a.untrackedValue = u, a[M].p());
|
|
671
|
+
});
|
|
672
|
+
}, c = (u) => {
|
|
673
|
+
$t(u, r, n);
|
|
674
|
+
};
|
|
675
|
+
try {
|
|
676
|
+
return q(e.Tt.Wt(t.D), () => {
|
|
677
|
+
const u = i();
|
|
678
|
+
if (U(u)) {
|
|
679
|
+
const a = new Error("useComputed$: Async functions in computed tasks are deprecated and will stop working in v2. Use useTask$ or useResource$ instead.").stack;
|
|
680
|
+
return a && a.replace(/^Error:\s*/, ""), u.then(l, c);
|
|
681
|
+
}
|
|
682
|
+
l(u);
|
|
683
|
+
});
|
|
684
|
+
} catch (u) {
|
|
685
|
+
c(u);
|
|
686
|
+
}
|
|
687
|
+
}, ke = (e) => {
|
|
688
|
+
const t = e.Qt;
|
|
689
|
+
if (t) {
|
|
690
|
+
e.Qt = void 0;
|
|
691
|
+
try {
|
|
692
|
+
t();
|
|
693
|
+
} catch (n) {
|
|
694
|
+
ie(n);
|
|
695
|
+
}
|
|
696
|
+
}
|
|
697
|
+
}, Ao = (e) => {
|
|
698
|
+
32 & e.R ? (e.R &= -33, (0, e.Tt)()) : ke(e);
|
|
699
|
+
}, No = (e, t) => {
|
|
700
|
+
t === "visible" || t === "intersection-observer" ? qo("qvisible", lt(e)) : t === "load" || t === "document-ready" ? fn("qinit", lt(e)) : t !== "idle" && t !== "document-idle" || fn("qidle", lt(e));
|
|
701
|
+
}, lt = (e) => {
|
|
702
|
+
const t = e.Tt, n = rt(t.Bt, "_hW", bo, null, null, [e], t.Gt);
|
|
703
|
+
return t.dev && (n.dev = t.dev), n;
|
|
704
|
+
}, zt = (e) => Ze(e) && e instanceof Xe;
|
|
705
|
+
class Xe {
|
|
706
|
+
constructor(t, n, r, o, s) {
|
|
707
|
+
k(this, "R");
|
|
708
|
+
k(this, "Dt");
|
|
709
|
+
k(this, "Nt");
|
|
710
|
+
k(this, "Tt");
|
|
711
|
+
k(this, "Jt");
|
|
712
|
+
this.R = t, this.Dt = n, this.Nt = r, this.Tt = o, this.Jt = s;
|
|
713
|
+
}
|
|
714
|
+
}
|
|
715
|
+
const Se = 1, gt = 2, Zt = 4, nr = 8, K = (e) => e[Rt], R = (e, t) => {
|
|
716
|
+
const n = K(e);
|
|
717
|
+
if (n) return n;
|
|
718
|
+
const r = Gt(e), o = B(e, "q:id");
|
|
719
|
+
if (o) {
|
|
720
|
+
const i = t.Mt;
|
|
721
|
+
if (r.rt = o, i) {
|
|
722
|
+
const { getObject: l, meta: c, refs: u } = i;
|
|
723
|
+
if ((function(a) {
|
|
724
|
+
return a && typeof a.nodeType == "number";
|
|
725
|
+
})(s = e) && s.nodeType === 1) {
|
|
726
|
+
const a = u[o];
|
|
727
|
+
a && (r.Yt = a.split(" ").map(l), r.li = ((h, g) => {
|
|
728
|
+
const p = h.T.attributes, y = [];
|
|
729
|
+
for (let b = 0; b < p.length; b++) {
|
|
730
|
+
const { name: v, value: f } = p.item(b);
|
|
731
|
+
if (v.startsWith("on:") || v.startsWith("on-window:") || v.startsWith("on-document:")) {
|
|
732
|
+
const m = f.split(`
|
|
733
|
+
`);
|
|
734
|
+
for (const d of m) {
|
|
735
|
+
const w = tt(d, g);
|
|
736
|
+
w.Kt && Sr(w, h), y.push([v, w]);
|
|
737
|
+
}
|
|
738
|
+
}
|
|
739
|
+
}
|
|
740
|
+
return y;
|
|
741
|
+
})(r, t.D));
|
|
742
|
+
} else {
|
|
743
|
+
const a = e.getAttribute(Fr);
|
|
744
|
+
r.nt = a ? a.split("|") : null;
|
|
745
|
+
const h = c[o];
|
|
746
|
+
if (h) {
|
|
747
|
+
const g = h.s, p = h.h, y = h.c, b = h.w;
|
|
748
|
+
if (g && (r.C = g.split(" ").map(l)), b && (r.Ht = b.split(" ").map(l)), y) {
|
|
749
|
+
r.M = /* @__PURE__ */ new Map();
|
|
750
|
+
for (const v of y.split(" ")) {
|
|
751
|
+
const [f, m] = v.split("=");
|
|
752
|
+
r.M.set(f, l(m));
|
|
753
|
+
}
|
|
754
|
+
}
|
|
755
|
+
if (p) {
|
|
756
|
+
const [v, f] = p.split(" ");
|
|
757
|
+
if (r.R = Zt, v && (r.A = l(v)), f) {
|
|
758
|
+
const m = l(f);
|
|
759
|
+
r.N = m, Je(m, 2), m[N] = Ro(m);
|
|
760
|
+
} else r.N = Ge(Pt(), t);
|
|
761
|
+
}
|
|
762
|
+
}
|
|
763
|
+
}
|
|
764
|
+
}
|
|
765
|
+
}
|
|
766
|
+
var s;
|
|
767
|
+
return r;
|
|
768
|
+
}, Ro = (e) => {
|
|
769
|
+
const t = {}, n = nt(e);
|
|
770
|
+
for (const r in n) r.startsWith(pe) && (t[r.slice(2)] = n[r]);
|
|
771
|
+
return t;
|
|
772
|
+
}, Gt = (e) => {
|
|
773
|
+
const t = { R: 0, rt: "", T: e, Yt: [], li: [], Ht: null, C: null, I: null, nt: null, ft: null, N: null, yt: null, A: null, M: null, vt: null, O: void 0, $t: void 0 };
|
|
774
|
+
return e[Rt] = t, t;
|
|
775
|
+
};
|
|
776
|
+
let me;
|
|
777
|
+
const L = () => {
|
|
778
|
+
if (!me) {
|
|
779
|
+
const e = typeof document < "u" && document && document.__q_context__;
|
|
780
|
+
return e ? E(e) ? document.__q_context__ = rr(e) : e : void 0;
|
|
781
|
+
}
|
|
782
|
+
return me;
|
|
783
|
+
}, Oo = () => {
|
|
784
|
+
const e = L();
|
|
785
|
+
if (!e) throw $(14);
|
|
786
|
+
return e;
|
|
787
|
+
}, Jt = () => {
|
|
788
|
+
const e = L();
|
|
789
|
+
if (!e || e.Vt !== Nt) throw $(20);
|
|
790
|
+
return e;
|
|
791
|
+
}, Po = () => Jt().j.k.u;
|
|
792
|
+
function G(e, t, ...n) {
|
|
793
|
+
return $o.call(this, e, t, n);
|
|
794
|
+
}
|
|
795
|
+
function $o(e, t, n) {
|
|
796
|
+
const r = me;
|
|
797
|
+
let o;
|
|
798
|
+
try {
|
|
799
|
+
me = e, o = t.apply(this, n);
|
|
800
|
+
} finally {
|
|
801
|
+
me = r;
|
|
802
|
+
}
|
|
803
|
+
return o;
|
|
804
|
+
}
|
|
805
|
+
const Mo = (e, t) => {
|
|
806
|
+
const n = e.F;
|
|
807
|
+
if (n.length === 0) {
|
|
808
|
+
const r = t();
|
|
809
|
+
U(r) && n.push(r);
|
|
810
|
+
} else n.push(Promise.all(n).then(t));
|
|
811
|
+
}, rr = ([e, t, n]) => {
|
|
812
|
+
const r = e.closest($n), o = r?.getAttribute("q:locale") || void 0;
|
|
813
|
+
return W(o, void 0, e, t, n);
|
|
814
|
+
}, W = (e, t, n, r, o) => ({ Et: o, P: 0, q: t, T: n, Vt: r, Tt: void 0, F: void 0, v: void 0, j: void 0, L: e || (typeof r == "object" && r && "locale" in r ? r.locale : void 0) }), or = (e) => e.closest($n), Wo = (e, ...t) => typeof e == "function" ? G(void 0, e, ...t) : I(e) ? e.untrackedValue : Ne(e), hn = /* @__PURE__ */ W(void 0, void 0, void 0, Nt), ne = (e, t) => (hn.v = t, G(hn, () => e.value)), ci = (e) => {
|
|
815
|
+
const t = L();
|
|
816
|
+
return t && t.q && t.j && (R(t.q, t.j.k.u).R |= nr), e;
|
|
817
|
+
}, Io = (e, t, n, r) => {
|
|
818
|
+
const o = t.l.o(r);
|
|
819
|
+
return new $e(e, o, n);
|
|
820
|
+
}, ge = /* @__PURE__ */ Symbol("proxy manager"), Do = 1, sr = 2, ir = /* @__PURE__ */ Symbol("unassigned signal");
|
|
821
|
+
class Qe {
|
|
822
|
+
}
|
|
823
|
+
var xn, An, Nn;
|
|
824
|
+
class $e extends (Nn = Qe, An = M, xn = ge, Nn) {
|
|
825
|
+
constructor(n, r, o) {
|
|
826
|
+
super();
|
|
827
|
+
k(this, "untrackedValue");
|
|
828
|
+
k(this, An);
|
|
829
|
+
k(this, xn, 0);
|
|
830
|
+
this.untrackedValue = n, this[M] = r, this[ge] = o;
|
|
831
|
+
}
|
|
832
|
+
valueOf() {
|
|
833
|
+
}
|
|
834
|
+
toString() {
|
|
835
|
+
return `[Signal ${String(this.value)}]`;
|
|
836
|
+
}
|
|
837
|
+
toJSON() {
|
|
838
|
+
return { value: this.value };
|
|
839
|
+
}
|
|
840
|
+
get value() {
|
|
841
|
+
if (this[ge] & sr) throw ir;
|
|
842
|
+
const n = L()?.v;
|
|
843
|
+
return n && this[M].m(n), this.untrackedValue;
|
|
844
|
+
}
|
|
845
|
+
set value(n) {
|
|
846
|
+
const r = this[M];
|
|
847
|
+
r && this.untrackedValue !== n && (this.untrackedValue = n, r.p());
|
|
848
|
+
}
|
|
849
|
+
}
|
|
850
|
+
class dn extends Qe {
|
|
851
|
+
constructor(n, r, o) {
|
|
852
|
+
super();
|
|
853
|
+
k(this, "Xt");
|
|
854
|
+
k(this, "Zt");
|
|
855
|
+
k(this, "tn");
|
|
856
|
+
this.Xt = n, this.Zt = r, this.tn = o;
|
|
857
|
+
}
|
|
858
|
+
get value() {
|
|
859
|
+
return this.Xt.apply(void 0, this.Zt);
|
|
860
|
+
}
|
|
861
|
+
}
|
|
862
|
+
class pn extends Qe {
|
|
863
|
+
constructor(n, r) {
|
|
864
|
+
super();
|
|
865
|
+
k(this, "ref");
|
|
866
|
+
k(this, "prop");
|
|
867
|
+
this.ref = n, this.prop = r;
|
|
868
|
+
}
|
|
869
|
+
get [M]() {
|
|
870
|
+
return Q(this.ref);
|
|
871
|
+
}
|
|
872
|
+
get value() {
|
|
873
|
+
return this.ref[this.prop];
|
|
874
|
+
}
|
|
875
|
+
set value(n) {
|
|
876
|
+
this.ref[this.prop] = n;
|
|
877
|
+
}
|
|
878
|
+
}
|
|
879
|
+
const I = (e) => e instanceof Qe, mn = /* @__PURE__ */ Symbol("ContainerState"), Kt = (e) => {
|
|
880
|
+
let t = e[mn];
|
|
881
|
+
return t || (e[mn] = t = Lo(e, B(e, "q:base") ?? "/")), t;
|
|
882
|
+
}, Lo = (e, t) => {
|
|
883
|
+
const n = {};
|
|
884
|
+
if (e) {
|
|
885
|
+
const o = e.attributes;
|
|
886
|
+
if (o) for (let s = 0; s < o.length; s++) {
|
|
887
|
+
const i = o[s];
|
|
888
|
+
n[i.name] = i.value;
|
|
889
|
+
}
|
|
890
|
+
}
|
|
891
|
+
const r = { D: e, et: 0, Lt: !1, t: /* @__PURE__ */ new WeakMap(), It: /* @__PURE__ */ new Set(), At: /* @__PURE__ */ new Set(), zt: /* @__PURE__ */ new Set(), Rt: /* @__PURE__ */ new Set(), wt: /* @__PURE__ */ new Set(), Ft: /* @__PURE__ */ new Set(), dt: /* @__PURE__ */ new Set(), J: { containerAttributes: n }, nn: t, _t: void 0, ut: void 0, Mt: void 0, l: null, en: /* @__PURE__ */ new Map() };
|
|
892
|
+
return r.l = Fs(r), r;
|
|
893
|
+
}, lr = (e, t) => {
|
|
894
|
+
if (H(e)) return e(t);
|
|
895
|
+
if (I(e)) return e.value = t;
|
|
896
|
+
throw $(32, e);
|
|
897
|
+
}, Ho = 128, Uo = (e) => je(e) && e.hasAttribute(At), Me = (e) => e.toString(36), F = (e) => parseInt(e, 36), Bo = (e) => {
|
|
898
|
+
const t = e.indexOf(":");
|
|
899
|
+
return e && e.slice(t + 1).replace(/-./g, (n) => n[1].toUpperCase());
|
|
900
|
+
}, Ae = "http://www.w3.org/2000/svg", O = 1, We = 2, Ie = [], De = (e, t, n, r) => {
|
|
901
|
+
const o = n.St;
|
|
902
|
+
if (o.length === 1 && o[0].gt === Pe) return void (n.St = t.St);
|
|
903
|
+
const s = t.kt;
|
|
904
|
+
let i = He;
|
|
905
|
+
t.St === Ie && s.nodeName === "HEAD" && (i = Zo, r |= We);
|
|
906
|
+
const l = Fo(t, i);
|
|
907
|
+
return l.length > 0 && o.length > 0 ? zo(e, s, l, o, r) : l.length > 0 && o.length === 0 ? Vt(e.k, l, 0, l.length - 1) : o.length > 0 ? fr(e, s, null, o, 0, o.length - 1, r) : void 0;
|
|
908
|
+
}, Fo = (e, t) => {
|
|
909
|
+
const n = e.St;
|
|
910
|
+
return n === Ie ? e.St = cr(e.kt, t) : n;
|
|
911
|
+
}, zo = (e, t, n, r, o) => {
|
|
912
|
+
let s, i, l, c = 0, u = 0, a = n.length - 1, h = n[0], g = n[a], p = r.length - 1, y = r[0], b = r[p];
|
|
913
|
+
const v = [], f = e.k;
|
|
914
|
+
for (; c <= a && u <= p; ) if (h == null) h = n[++c];
|
|
915
|
+
else if (g == null) g = n[--a];
|
|
916
|
+
else if (y == null) y = r[++u];
|
|
917
|
+
else if (b == null) b = r[--p];
|
|
918
|
+
else if (h.rt === y.rt) v.push(se(e, h, y, o)), h = n[++c], y = r[++u];
|
|
919
|
+
else if (g.rt === b.rt) v.push(se(e, g, b, o)), g = n[--a], b = r[--p];
|
|
920
|
+
else if (h.qt && h.rt === b.rt) v.push(se(e, h, b, o)), ns(f, t, h.kt, g.kt), h = n[++c], b = r[--p];
|
|
921
|
+
else if (g.qt && g.rt === y.rt) v.push(se(e, g, y, o)), ue(f, t, g.kt, h.kt), g = n[--a], y = r[++u];
|
|
922
|
+
else {
|
|
923
|
+
if (s === void 0 && (s = Yo(n, c, a)), i = s[y.qt], i === void 0) {
|
|
924
|
+
const d = te(e, y, o, v);
|
|
925
|
+
ue(f, t, d, h?.kt);
|
|
926
|
+
} else if (l = n[i], l.gt !== y.gt) {
|
|
927
|
+
const d = te(e, y, o, v);
|
|
928
|
+
q(d, (w) => {
|
|
929
|
+
ue(f, t, w, h?.kt);
|
|
930
|
+
});
|
|
931
|
+
} else v.push(se(e, l, y, o)), n[i] = void 0, ue(f, t, l.kt, h.kt);
|
|
932
|
+
y = r[++u];
|
|
933
|
+
}
|
|
934
|
+
u <= p && v.push(fr(e, t, r[p + 1] == null ? null : r[p + 1].kt, r, u, p, o));
|
|
935
|
+
let m = _t(v);
|
|
936
|
+
return c <= a && (m = q(m, () => {
|
|
937
|
+
Vt(f, n, c, a);
|
|
938
|
+
})), m;
|
|
939
|
+
}, ce = (e, t) => {
|
|
940
|
+
const n = X(e) ? e.close : null, r = [];
|
|
941
|
+
let o = e.firstChild;
|
|
942
|
+
for (; (o = wr(o)) && (t(o) && r.push(o), o = o.nextSibling, o !== n); ) ;
|
|
943
|
+
return r;
|
|
944
|
+
}, cr = (e, t) => ce(e, t).map(ur), ur = (e) => je(e) ? K(e)?.yt ?? Le(e) : Le(e), Le = (e) => {
|
|
945
|
+
if (_e(e)) {
|
|
946
|
+
const t = new z(e.localName, {}, null, Ie, 0, yt(e));
|
|
947
|
+
return t.kt = e, t;
|
|
948
|
+
}
|
|
949
|
+
if (Rn(e)) {
|
|
950
|
+
const t = new z(e.nodeName, P, null, Ie, 0, null);
|
|
951
|
+
return t.jt = e.data, t.kt = e, t;
|
|
952
|
+
}
|
|
953
|
+
}, Zo = (e) => {
|
|
954
|
+
const t = e.nodeType;
|
|
955
|
+
return t === 1 ? e.hasAttribute("q:head") : t === 111;
|
|
956
|
+
}, vt = (e) => e.nodeName === "Q:TEMPLATE", He = (e) => {
|
|
957
|
+
const t = e.nodeType;
|
|
958
|
+
if (t === 3 || t === 111) return !0;
|
|
959
|
+
if (t !== 1) return !1;
|
|
960
|
+
const n = e.nodeName;
|
|
961
|
+
return n !== "Q:TEMPLATE" && (n === "HEAD" ? e.hasAttribute("q:head") : n !== "STYLE" || !e.hasAttribute(xt));
|
|
962
|
+
}, ar = (e) => {
|
|
963
|
+
const t = {};
|
|
964
|
+
for (const n of e) {
|
|
965
|
+
const r = Go(n);
|
|
966
|
+
(t[r] ?? (t[r] = new z(he, { [ae]: "" }, null, [], 0, r))).St.push(n);
|
|
967
|
+
}
|
|
968
|
+
return t;
|
|
969
|
+
}, se = (e, t, n, r) => {
|
|
970
|
+
const o = t.kt, s = n.gt, i = e.k, l = i.u, c = e.U;
|
|
971
|
+
if (n.kt = o, s === "#text") {
|
|
972
|
+
i.tt.push(o);
|
|
973
|
+
const g = n.Ct;
|
|
974
|
+
return g && (n.jt = Dt(ne(g, [4, c.T, g, o]))), void V(i, o, "data", n.jt);
|
|
975
|
+
}
|
|
976
|
+
if (s === "#signal") return;
|
|
977
|
+
const u = n.N, a = n.R, h = R(o, l);
|
|
978
|
+
if (s !== he) {
|
|
979
|
+
let g = (r & O) !== 0;
|
|
980
|
+
if (g || s !== "svg" || (r |= O, g = !0), u !== P) {
|
|
981
|
+
1 & a || (h.li.length = 0);
|
|
982
|
+
const p = t.N;
|
|
983
|
+
n.N = p;
|
|
984
|
+
for (const y in u) {
|
|
985
|
+
let b = u[y];
|
|
986
|
+
if (y !== "ref") {
|
|
987
|
+
if (Ln(y)) {
|
|
988
|
+
const v = Hn(h.li, y, b, l.D);
|
|
989
|
+
pr(i, o, v);
|
|
990
|
+
continue;
|
|
991
|
+
}
|
|
992
|
+
I(b) && (b = ne(b, [1, c.T, b, o, y])), y === "class" ? b = Wt(b, c) : y === "style" && (b = It(b)), p[y] !== b && (p[y] = b, Xt(i, o, y, b, g));
|
|
993
|
+
} else b !== void 0 && lr(b, o);
|
|
994
|
+
}
|
|
995
|
+
}
|
|
996
|
+
return 2 & a || (g && s === "foreignObject" && (r &= ~O), u[ee] !== void 0) || s === "textarea" ? void 0 : De(e, t, n, r);
|
|
997
|
+
}
|
|
998
|
+
if (ye in u) {
|
|
999
|
+
const g = u.props;
|
|
1000
|
+
Vo(l, h, g);
|
|
1001
|
+
let p = !!(h.R & Se);
|
|
1002
|
+
return p || h.A || h.T.hasAttribute(Wn) || (Bn(e, h), h.A = g[ye], p = !0), p ? q(Ht(e, h, r), () => gn(e, h, n, r)) : gn(e, h, n, r);
|
|
1003
|
+
}
|
|
1004
|
+
if (ae in u) c.I.push(n);
|
|
1005
|
+
else if (ee in u) V(i, o, "innerHTML", u[ee]);
|
|
1006
|
+
else if (!(2 & a)) return De(e, t, n, r);
|
|
1007
|
+
}, gn = (e, t, n, r) => {
|
|
1008
|
+
if (2 & n.R) return;
|
|
1009
|
+
const o = e.k, s = ar(n.St), i = dr(t);
|
|
1010
|
+
for (const l in i.slots) if (!s[l]) {
|
|
1011
|
+
const c = i.slots[l], u = cr(c, He);
|
|
1012
|
+
if (u.length > 0) {
|
|
1013
|
+
const a = K(c);
|
|
1014
|
+
a && a.yt && (a.yt.St = []), Vt(o, u, 0, u.length - 1);
|
|
1015
|
+
}
|
|
1016
|
+
}
|
|
1017
|
+
for (const l in i.templates) {
|
|
1018
|
+
const c = i.templates[l];
|
|
1019
|
+
c && !s[l] && (i.templates[l] = void 0, Yt(o, c));
|
|
1020
|
+
}
|
|
1021
|
+
return _t(Object.keys(s).map((l) => {
|
|
1022
|
+
const c = s[l], u = hr(o, i, t, l, e.k.u), a = Ut(u), h = Mt(e), g = u.T;
|
|
1023
|
+
h.W = u, u.yt = c, c.kt = g;
|
|
1024
|
+
let p = r & ~O;
|
|
1025
|
+
g.isSvg && (p |= O);
|
|
1026
|
+
const y = o.X.findIndex((b) => b[0] === g);
|
|
1027
|
+
return y >= 0 && o.X.splice(y, 1), De(h, a, c, p);
|
|
1028
|
+
}));
|
|
1029
|
+
}, fr = (e, t, n, r, o, s, i) => {
|
|
1030
|
+
const l = [];
|
|
1031
|
+
for (; o <= s; ++o) {
|
|
1032
|
+
const c = r[o], u = te(e, c, i, l);
|
|
1033
|
+
ue(e.k, t, u, n);
|
|
1034
|
+
}
|
|
1035
|
+
return Re(l);
|
|
1036
|
+
}, Vt = (e, t, n, r) => {
|
|
1037
|
+
for (; n <= r; ++n) {
|
|
1038
|
+
const o = t[n];
|
|
1039
|
+
o && Yt(e, o.kt);
|
|
1040
|
+
}
|
|
1041
|
+
}, hr = (e, t, n, r, o) => {
|
|
1042
|
+
const s = t.slots[r];
|
|
1043
|
+
if (s) return R(s, o);
|
|
1044
|
+
const i = t.templates[r];
|
|
1045
|
+
if (i) return R(i, o);
|
|
1046
|
+
const l = yr(e.H, r), c = Gt(l);
|
|
1047
|
+
return c.O = n, ss(e, n.T, l), t.templates[r] = l, c;
|
|
1048
|
+
}, Go = (e) => e.N[Z] ?? "", te = (e, t, n, r) => {
|
|
1049
|
+
const o = t.gt, s = e.k.H, i = e.U;
|
|
1050
|
+
if (o === "#text") return t.kt = s.createTextNode(t.jt);
|
|
1051
|
+
if (o === "#signal") {
|
|
1052
|
+
const v = t.Ct, f = v.value;
|
|
1053
|
+
if (Ve(f)) {
|
|
1054
|
+
const m = J(f);
|
|
1055
|
+
if (I(m)) throw new Error("NOT IMPLEMENTED: Promise");
|
|
1056
|
+
if (Array.isArray(m)) throw new Error("NOT IMPLEMENTED: Array");
|
|
1057
|
+
{
|
|
1058
|
+
const d = te(e, m, n, r);
|
|
1059
|
+
return ne(v, 4 & n ? [3, d, v, d] : [4, i.T, v, d]), t.kt = d;
|
|
1060
|
+
}
|
|
1061
|
+
}
|
|
1062
|
+
{
|
|
1063
|
+
const m = s.createTextNode(t.jt);
|
|
1064
|
+
return m.data = t.jt = Dt(f), ne(v, 4 & n ? [3, m, v, m] : [4, i.T, v, m]), t.kt = m;
|
|
1065
|
+
}
|
|
1066
|
+
}
|
|
1067
|
+
let l, c = !!(n & O);
|
|
1068
|
+
c || o !== "svg" || (n |= O, c = !0);
|
|
1069
|
+
const u = o === he, a = t.N, h = e.k, g = h.u;
|
|
1070
|
+
u ? l = as(s, c) : o === "head" ? (l = s.head, n |= We) : (l = Qt(s, o, c), n &= ~We), 2 & t.R && (n |= 4), t.kt = l;
|
|
1071
|
+
const p = Gt(l);
|
|
1072
|
+
if (e.W ? (p.O = e.W, p.$t = e.U) : p.O = e.U, u) {
|
|
1073
|
+
if (ye in a) {
|
|
1074
|
+
const v = a[ye], f = Pt(), m = g.l.o(), d = new Proxy(f, new Dn(g, m)), w = a.props;
|
|
1075
|
+
if (g.t.set(f, d), p.N = d, w !== P) {
|
|
1076
|
+
const j = f[N] = w[N] ?? P;
|
|
1077
|
+
for (const _ in w) if (_ !== "children" && _ !== Z) {
|
|
1078
|
+
const x = j[_];
|
|
1079
|
+
I(x) ? f[pe + _] = x : f[_] = w[_];
|
|
1080
|
+
}
|
|
1081
|
+
}
|
|
1082
|
+
Bn(e, p), p.A = v;
|
|
1083
|
+
const S = q(Ht(e, p, n), () => {
|
|
1084
|
+
let j = t.St;
|
|
1085
|
+
if (j.length === 0) return;
|
|
1086
|
+
j.length === 1 && j[0].gt === Pe && (j = j[0].St);
|
|
1087
|
+
const _ = dr(p), x = [], A = ar(j);
|
|
1088
|
+
for (const re in A) {
|
|
1089
|
+
const ot = A[re], st = hr(h, _, p, re, h.u), nn = Mt(e), it = st.T;
|
|
1090
|
+
nn.W = st, st.yt = ot, ot.kt = it;
|
|
1091
|
+
let rn = n & ~O;
|
|
1092
|
+
it.isSvg && (rn |= O);
|
|
1093
|
+
for (const Nr of ot.St) {
|
|
1094
|
+
const Rr = te(nn, Nr, rn, x);
|
|
1095
|
+
vr(h, it, Rr);
|
|
1096
|
+
}
|
|
1097
|
+
}
|
|
1098
|
+
return Re(x);
|
|
1099
|
+
});
|
|
1100
|
+
return U(S) && r.push(S), l;
|
|
1101
|
+
}
|
|
1102
|
+
if (ae in a) cs(l, t.qt), D(l, Et, i.rt), D(l, ae, ""), i.I.push(t), h.X.push([l, i.T]);
|
|
1103
|
+
else if (ee in a) return V(h, l, "innerHTML", a[ee]), l;
|
|
1104
|
+
} else {
|
|
1105
|
+
if (t.xt) {
|
|
1106
|
+
const v = a !== P ? Object.fromEntries(Object.entries(t.xt).map(([f, m]) => [f, m === N ? a[f] : m])) : t.xt;
|
|
1107
|
+
bn(h, p, i, v, c, !0);
|
|
1108
|
+
}
|
|
1109
|
+
if (a !== P) {
|
|
1110
|
+
p.yt = t;
|
|
1111
|
+
const v = t.xt ? Object.fromEntries(Object.entries(a).filter(([f]) => !(f in t.xt))) : a;
|
|
1112
|
+
t.N = bn(h, p, i, v, c, !1);
|
|
1113
|
+
}
|
|
1114
|
+
if (c && o === "foreignObject" && (c = !1, n &= ~O), i) {
|
|
1115
|
+
const v = i.nt;
|
|
1116
|
+
v && v.forEach((f) => {
|
|
1117
|
+
l.classList.add(f);
|
|
1118
|
+
}), i.R & gt && (p.li.push(...i.li), i.R &= ~gt);
|
|
1119
|
+
}
|
|
1120
|
+
for (const v of p.li) pr(h, l, v[0]);
|
|
1121
|
+
if (a[ee] !== void 0) return l;
|
|
1122
|
+
c && o === "foreignObject" && (c = !1, n &= ~O);
|
|
1123
|
+
}
|
|
1124
|
+
let y = t.St;
|
|
1125
|
+
if (y.length === 0) return l;
|
|
1126
|
+
y.length === 1 && y[0].gt === Pe && (y = y[0].St);
|
|
1127
|
+
const b = y.map((v) => te(e, v, n, r));
|
|
1128
|
+
for (const v of b) Te(l, v);
|
|
1129
|
+
return l;
|
|
1130
|
+
}, dr = (e) => {
|
|
1131
|
+
const t = ((s) => s.I || (s.I = Jo(s)))(e), n = {}, r = {}, o = Array.from(e.T.childNodes).filter(vt);
|
|
1132
|
+
for (const s of t) n[s.qt ?? ""] = s.kt;
|
|
1133
|
+
for (const s of o) r[B(s, Z) ?? ""] = s;
|
|
1134
|
+
return { slots: n, templates: r };
|
|
1135
|
+
}, Jo = (e) => fs(e.T.parentElement, Et, e.rt).map(Le), vn = (e, t, n) => (t.namespaceURI === Ae ? qe(e, t, "class", n) : V(e, t, "className", n), !0), yn = (e, t, n, r) => r in t && ((t[r] !== n || r === "value" && !t.hasAttribute(r)) && (r === "value" && t.tagName !== "OPTION" ? ts(e, t, r, n) : V(e, t, r, n)), !0), de = (e, t, n, r) => (qe(e, t, r.toLowerCase(), n), !0), Ko = { style: (e, t, n) => (V(e, t.style, "cssText", n), !0), class: vn, className: vn, value: yn, checked: yn, href: de, list: de, form: de, tabIndex: de, download: de, innerHTML: () => !0, [ee]: (e, t, n) => (V(e, t, "innerHTML", n), !0) }, Xt = (e, t, n, r, o) => {
|
|
1136
|
+
if (oo(n)) return void qe(e, t, n, r != null ? String(r) : r);
|
|
1137
|
+
const s = Ko[n];
|
|
1138
|
+
s && s(e, t, r, n) || (o || !(n in t) ? (n.startsWith(Jr) && mr(n.slice(15)), qe(e, t, n, r)) : V(e, t, n, r));
|
|
1139
|
+
}, bn = (e, t, n, r, o, s) => {
|
|
1140
|
+
const i = {}, l = t.T;
|
|
1141
|
+
for (const c in r) {
|
|
1142
|
+
let u = r[c];
|
|
1143
|
+
if (c !== "ref") if (Ln(c)) Hn(t.li, c, u, e.u.D);
|
|
1144
|
+
else {
|
|
1145
|
+
if (I(u) && (u = ne(u, s ? [1, l, u, n.T, c] : [2, n.T, u, l, c])), c === "class") {
|
|
1146
|
+
if (u = Wt(u, n), !u) continue;
|
|
1147
|
+
} else c === "style" && (u = It(u));
|
|
1148
|
+
i[c] = u, Xt(e, l, c, u, o);
|
|
1149
|
+
}
|
|
1150
|
+
else u !== void 0 && lr(u, l);
|
|
1151
|
+
}
|
|
1152
|
+
return i;
|
|
1153
|
+
}, Vo = (e, t, n) => {
|
|
1154
|
+
let r = t.N;
|
|
1155
|
+
if (r || (t.N = r = Ge(Pt(), e)), n === P) return;
|
|
1156
|
+
const o = Q(r), s = nt(r), i = s[N] = n[N] ?? P;
|
|
1157
|
+
for (const l in n) if (l !== "children" && l !== Z && !i[l]) {
|
|
1158
|
+
const c = n[l];
|
|
1159
|
+
s[l] !== c && (s[l] = c, o.p(l));
|
|
1160
|
+
}
|
|
1161
|
+
}, ve = (e, t, n, r, o = !1) => {
|
|
1162
|
+
if (n.bt(e), _e(e)) {
|
|
1163
|
+
if (!o && r && e.hasAttribute(ae)) return void t.Z.push(e);
|
|
1164
|
+
const s = K(e);
|
|
1165
|
+
s && ((c, u) => {
|
|
1166
|
+
c.Ht?.forEach((a) => {
|
|
1167
|
+
u.bt(a), Ao(a);
|
|
1168
|
+
}), c.A = null, c.C = null, c.Ht = null;
|
|
1169
|
+
})(s, n);
|
|
1170
|
+
const i = X(e) ? e.close : null;
|
|
1171
|
+
let l = e.firstChild;
|
|
1172
|
+
for (; (l = wr(l)) && (ve(l, t, n, !0, o), l = l.nextSibling, l !== i); ) ;
|
|
1173
|
+
}
|
|
1174
|
+
}, wn = () => {
|
|
1175
|
+
document.__q_scroll_restore__ && (document.__q_scroll_restore__(), document.__q_scroll_restore__ = void 0);
|
|
1176
|
+
}, Xo = async (e) => {
|
|
1177
|
+
if (document.__q_view_transition__ && (document.__q_view_transition__ = void 0, document.startViewTransition)) {
|
|
1178
|
+
const t = document.startViewTransition(() => {
|
|
1179
|
+
kn(e), wn();
|
|
1180
|
+
}), n = new CustomEvent("qviewTransition", { detail: t });
|
|
1181
|
+
return document.dispatchEvent(n), void await t.finished;
|
|
1182
|
+
}
|
|
1183
|
+
kn(e), wn();
|
|
1184
|
+
}, Te = (e, t) => {
|
|
1185
|
+
X(t) ? t.appendTo(e) : e.appendChild(t);
|
|
1186
|
+
}, Qo = (e, t, n) => {
|
|
1187
|
+
X(t) ? t.insertBeforeTo(e, n?.nextSibling ?? null) : e.insertBefore(t, n?.nextSibling ?? null);
|
|
1188
|
+
}, Ye = (e, t, n) => {
|
|
1189
|
+
X(t) ? t.insertBeforeTo(e, Ue(n)) : e.insertBefore(t, Ue(n));
|
|
1190
|
+
}, Yo = (e, t, n) => {
|
|
1191
|
+
const r = {};
|
|
1192
|
+
for (let o = t; o <= n; ++o) {
|
|
1193
|
+
const s = e[o].qt;
|
|
1194
|
+
s != null && (r[s] = o);
|
|
1195
|
+
}
|
|
1196
|
+
return r;
|
|
1197
|
+
}, pr = (e, t, n) => {
|
|
1198
|
+
n.startsWith("on:") || qe(e, t, n, ""), mr(n);
|
|
1199
|
+
}, mr = (e) => {
|
|
1200
|
+
{
|
|
1201
|
+
const t = Bo(e);
|
|
1202
|
+
try {
|
|
1203
|
+
(globalThis.qwikevents || (globalThis.qwikevents = [])).push(t);
|
|
1204
|
+
} catch {
|
|
1205
|
+
}
|
|
1206
|
+
}
|
|
1207
|
+
}, qe = (e, t, n, r) => {
|
|
1208
|
+
e.G.push({ rn: es, Zt: [t, n, r] });
|
|
1209
|
+
}, es = (e, t, n) => {
|
|
1210
|
+
if (n == null || n === !1) e.removeAttribute(t);
|
|
1211
|
+
else {
|
|
1212
|
+
const r = n === !0 ? "" : String(n);
|
|
1213
|
+
D(e, t, r);
|
|
1214
|
+
}
|
|
1215
|
+
}, V = (e, t, n, r) => {
|
|
1216
|
+
e.G.push({ rn: gr, Zt: [t, n, r] });
|
|
1217
|
+
}, ts = (e, t, n, r) => {
|
|
1218
|
+
e.Y.push({ rn: gr, Zt: [t, n, r] });
|
|
1219
|
+
}, gr = (e, t, n) => {
|
|
1220
|
+
try {
|
|
1221
|
+
e[t] = n ?? "", n == null && kt(e) && je(e) && e.removeAttribute(t);
|
|
1222
|
+
} catch (r) {
|
|
1223
|
+
ie(ze(6), t, { node: e, value: n }, r);
|
|
1224
|
+
}
|
|
1225
|
+
}, Qt = (e, t, n) => n ? e.createElementNS(Ae, t) : e.createElement(t), ue = (e, t, n, r) => (e.G.push({ rn: Ye, Zt: [t, n, r || null] }), n), ns = (e, t, n, r) => (e.G.push({ rn: Qo, Zt: [t, n, r || null] }), n), vr = (e, t, n) => (e.G.push({ rn: Te, Zt: [t, n] }), n), rs = (e, t) => {
|
|
1226
|
+
e.u.Ft.add(t.styleId), e.Y.push({ rn: os, Zt: [e.u, t] });
|
|
1227
|
+
}, os = (e, t) => {
|
|
1228
|
+
const n = e.D, r = Oe(), o = r.documentElement === n, s = r.head, i = r.createElement("style");
|
|
1229
|
+
D(i, xt, t.styleId), D(i, "hidden", ""), i.textContent = t.content, o && s ? Te(s, i) : Ye(n, i, n.firstChild);
|
|
1230
|
+
}, ss = (e, t, n) => {
|
|
1231
|
+
e.G.push({ rn: is, Zt: [t, n] });
|
|
1232
|
+
}, is = (e, t) => {
|
|
1233
|
+
Ye(e, t, e.firstChild);
|
|
1234
|
+
}, Yt = (e, t) => {
|
|
1235
|
+
_e(t) && ve(t, e, e.u.l, !0), e.G.push({ rn: ls, Zt: [t, e] });
|
|
1236
|
+
}, ls = (e) => {
|
|
1237
|
+
const t = e.parentElement;
|
|
1238
|
+
t && ((n, r) => {
|
|
1239
|
+
X(r) ? r.remove() : n.removeChild(r);
|
|
1240
|
+
})(t, e);
|
|
1241
|
+
}, yr = (e, t) => {
|
|
1242
|
+
const n = Qt(e, "q:template", !1);
|
|
1243
|
+
return D(n, Z, t), D(n, "hidden", ""), D(n, "aria-hidden", "true"), n;
|
|
1244
|
+
}, kn = (e) => {
|
|
1245
|
+
for (const t of e.G) t.rn.apply(void 0, t.Zt);
|
|
1246
|
+
us(e);
|
|
1247
|
+
}, yt = (e) => B(e, "q:key"), cs = (e, t) => {
|
|
1248
|
+
t !== null && D(e, "q:key", t);
|
|
1249
|
+
}, us = (e) => {
|
|
1250
|
+
const t = e.u.l;
|
|
1251
|
+
for (const n of e.Z) {
|
|
1252
|
+
const r = yt(n), o = ce(n, He);
|
|
1253
|
+
if (o.length > 0) {
|
|
1254
|
+
const s = n.getAttribute(Et), i = e.K.find((l) => l.rt === s);
|
|
1255
|
+
if (i) {
|
|
1256
|
+
const l = i.T;
|
|
1257
|
+
if (l.isConnected) if (ce(l, vt).some((c) => B(c, Z) === r)) ve(n, e, t, !1);
|
|
1258
|
+
else {
|
|
1259
|
+
const c = yr(e.H, r);
|
|
1260
|
+
for (const u of o) Te(c, u);
|
|
1261
|
+
Ye(l, c, l.firstChild);
|
|
1262
|
+
}
|
|
1263
|
+
else ve(n, e, t, !1);
|
|
1264
|
+
} else ve(n, e, t, !1);
|
|
1265
|
+
}
|
|
1266
|
+
}
|
|
1267
|
+
for (const [n, r] of e.X) {
|
|
1268
|
+
const o = yt(n), s = ce(r, vt).find((i) => i.getAttribute(Z) === o);
|
|
1269
|
+
s && (ce(s, He).forEach((i) => {
|
|
1270
|
+
Te(n, i);
|
|
1271
|
+
}), s.remove());
|
|
1272
|
+
}
|
|
1273
|
+
}, Sn = () => {
|
|
1274
|
+
}, as = (e, t) => {
|
|
1275
|
+
const n = e.createComment("qv "), r = e.createComment("/qv");
|
|
1276
|
+
return new br(n, r, t);
|
|
1277
|
+
}, fs = (e, t, n) => {
|
|
1278
|
+
const r = ((i, l, c) => i.ownerDocument.createTreeWalker(i, 128, { acceptNode(u) {
|
|
1279
|
+
const a = Ce(u);
|
|
1280
|
+
return a && B(a, l) === c ? 1 : 2;
|
|
1281
|
+
} }))(e, t, n), o = [];
|
|
1282
|
+
let s = null;
|
|
1283
|
+
for (; s = r.nextNode(); ) o.push(Ce(s));
|
|
1284
|
+
return o;
|
|
1285
|
+
}, he = ":virtual";
|
|
1286
|
+
class br {
|
|
1287
|
+
constructor(t, n, r) {
|
|
1288
|
+
k(this, "open");
|
|
1289
|
+
k(this, "close");
|
|
1290
|
+
k(this, "isSvg");
|
|
1291
|
+
k(this, "ownerDocument");
|
|
1292
|
+
k(this, "_qc_", null);
|
|
1293
|
+
k(this, "nodeType", 111);
|
|
1294
|
+
k(this, "localName", he);
|
|
1295
|
+
k(this, "nodeName", he);
|
|
1296
|
+
k(this, "sn");
|
|
1297
|
+
k(this, "cn");
|
|
1298
|
+
this.open = t, this.close = n, this.isSvg = r;
|
|
1299
|
+
const o = this.ownerDocument = t.ownerDocument;
|
|
1300
|
+
this.cn = Qt(o, "template", !1), this.sn = ((s) => {
|
|
1301
|
+
if (!s) return {};
|
|
1302
|
+
const i = s.split(" ");
|
|
1303
|
+
return Object.fromEntries(i.map((l) => {
|
|
1304
|
+
const c = l.indexOf("=");
|
|
1305
|
+
return c >= 0 ? [l.slice(0, c), (u = l.slice(c + 1), u.replace(/\+/g, " "))] : [l, ""];
|
|
1306
|
+
var u;
|
|
1307
|
+
}));
|
|
1308
|
+
})(t.data.slice(3)), t.data.startsWith("qv "), t[be] = this, n[be] = this;
|
|
1309
|
+
}
|
|
1310
|
+
insertBefore(t, n) {
|
|
1311
|
+
const r = this.parentElement;
|
|
1312
|
+
return r ? r.insertBefore(t, n || this.close) : this.cn.insertBefore(t, n), t;
|
|
1313
|
+
}
|
|
1314
|
+
remove() {
|
|
1315
|
+
const t = this.parentElement;
|
|
1316
|
+
if (t) {
|
|
1317
|
+
const n = this.childNodes;
|
|
1318
|
+
t.removeChild(this.open);
|
|
1319
|
+
for (let r = 0; r < n.length; r++) this.cn.appendChild(n[r]);
|
|
1320
|
+
t.removeChild(this.close);
|
|
1321
|
+
}
|
|
1322
|
+
}
|
|
1323
|
+
appendChild(t) {
|
|
1324
|
+
return this.insertBefore(t, null);
|
|
1325
|
+
}
|
|
1326
|
+
insertBeforeTo(t, n) {
|
|
1327
|
+
const r = this.childNodes;
|
|
1328
|
+
t.insertBefore(this.open, n);
|
|
1329
|
+
for (const o of r) t.insertBefore(o, n);
|
|
1330
|
+
t.insertBefore(this.close, n);
|
|
1331
|
+
}
|
|
1332
|
+
appendTo(t) {
|
|
1333
|
+
this.insertBeforeTo(t, null);
|
|
1334
|
+
}
|
|
1335
|
+
get namespaceURI() {
|
|
1336
|
+
return this.parentElement?.namespaceURI ?? "";
|
|
1337
|
+
}
|
|
1338
|
+
removeChild(t) {
|
|
1339
|
+
this.parentElement ? this.parentElement.removeChild(t) : this.cn.removeChild(t);
|
|
1340
|
+
}
|
|
1341
|
+
getAttribute(t) {
|
|
1342
|
+
return this.sn[t] ?? null;
|
|
1343
|
+
}
|
|
1344
|
+
hasAttribute(t) {
|
|
1345
|
+
return t in this.sn;
|
|
1346
|
+
}
|
|
1347
|
+
setAttribute(t, n) {
|
|
1348
|
+
this.sn[t] = n;
|
|
1349
|
+
}
|
|
1350
|
+
removeAttribute(t) {
|
|
1351
|
+
delete this.sn[t];
|
|
1352
|
+
}
|
|
1353
|
+
matches(t) {
|
|
1354
|
+
return !1;
|
|
1355
|
+
}
|
|
1356
|
+
compareDocumentPosition(t) {
|
|
1357
|
+
return this.open.compareDocumentPosition(t);
|
|
1358
|
+
}
|
|
1359
|
+
closest(t) {
|
|
1360
|
+
const n = this.parentElement;
|
|
1361
|
+
return n ? n.closest(t) : null;
|
|
1362
|
+
}
|
|
1363
|
+
querySelectorAll(t) {
|
|
1364
|
+
const n = [];
|
|
1365
|
+
return ce(this, Wr).forEach((r) => {
|
|
1366
|
+
_e(r) && (r.matches(t) && n.push(r), n.concat(Array.from(r.querySelectorAll(t))));
|
|
1367
|
+
}), n;
|
|
1368
|
+
}
|
|
1369
|
+
querySelector(t) {
|
|
1370
|
+
for (const n of this.childNodes) if (je(n)) {
|
|
1371
|
+
if (n.matches(t)) return n;
|
|
1372
|
+
const r = n.querySelector(t);
|
|
1373
|
+
if (r !== null) return r;
|
|
1374
|
+
}
|
|
1375
|
+
return null;
|
|
1376
|
+
}
|
|
1377
|
+
get innerHTML() {
|
|
1378
|
+
return "";
|
|
1379
|
+
}
|
|
1380
|
+
set innerHTML(t) {
|
|
1381
|
+
const n = this.parentElement;
|
|
1382
|
+
n ? (this.childNodes.forEach((r) => this.removeChild(r)), this.cn.innerHTML = t, n.insertBefore(this.cn.content, this.close)) : this.cn.innerHTML = t;
|
|
1383
|
+
}
|
|
1384
|
+
get firstChild() {
|
|
1385
|
+
if (this.parentElement) {
|
|
1386
|
+
const t = this.open.nextSibling;
|
|
1387
|
+
return t === this.close ? null : t;
|
|
1388
|
+
}
|
|
1389
|
+
return this.cn.firstChild;
|
|
1390
|
+
}
|
|
1391
|
+
get nextSibling() {
|
|
1392
|
+
return this.close.nextSibling;
|
|
1393
|
+
}
|
|
1394
|
+
get previousSibling() {
|
|
1395
|
+
return this.open.previousSibling;
|
|
1396
|
+
}
|
|
1397
|
+
get childNodes() {
|
|
1398
|
+
if (!this.parentElement) return Array.from(this.cn.childNodes);
|
|
1399
|
+
const t = [];
|
|
1400
|
+
let n = this.open;
|
|
1401
|
+
for (; (n = n.nextSibling) && n !== this.close; ) t.push(n);
|
|
1402
|
+
return t;
|
|
1403
|
+
}
|
|
1404
|
+
get isConnected() {
|
|
1405
|
+
return this.open.isConnected;
|
|
1406
|
+
}
|
|
1407
|
+
get parentElement() {
|
|
1408
|
+
return this.open.parentElement;
|
|
1409
|
+
}
|
|
1410
|
+
}
|
|
1411
|
+
const wr = (e) => {
|
|
1412
|
+
if (e == null) return null;
|
|
1413
|
+
if (Fe(e)) {
|
|
1414
|
+
const t = Ce(e);
|
|
1415
|
+
if (t) return t;
|
|
1416
|
+
}
|
|
1417
|
+
return e;
|
|
1418
|
+
}, Ce = (e) => {
|
|
1419
|
+
const t = e[be];
|
|
1420
|
+
if (t) return t;
|
|
1421
|
+
if (e.data.startsWith("qv ")) {
|
|
1422
|
+
const n = ((r) => {
|
|
1423
|
+
let o = r, s = 1;
|
|
1424
|
+
for (; o = o.nextSibling; ) if (Fe(o)) {
|
|
1425
|
+
const i = o[be];
|
|
1426
|
+
if (i) o = i;
|
|
1427
|
+
else if (o.data.startsWith("qv ")) s++;
|
|
1428
|
+
else if (o.data === "/qv" && (s--, s === 0)) return o;
|
|
1429
|
+
}
|
|
1430
|
+
})(e);
|
|
1431
|
+
return new br(e, n, e.parentElement?.namespaceURI === Ae);
|
|
1432
|
+
}
|
|
1433
|
+
return null;
|
|
1434
|
+
}, Ue = (e) => e == null ? null : X(e) ? e.open : e, bt = (e, t, n) => {
|
|
1435
|
+
let r = "";
|
|
1436
|
+
for (const o of e) {
|
|
1437
|
+
const s = t(o);
|
|
1438
|
+
s !== null && (r !== "" && (r += n), r += s);
|
|
1439
|
+
}
|
|
1440
|
+
return r;
|
|
1441
|
+
}, hs = (e, t) => {
|
|
1442
|
+
const n = K(e);
|
|
1443
|
+
t.pn.includes(n) || (t.pn.push(n), n.R & nr ? (t.wn++, ds(n, t, !0), t.wn--) : t.hn.push(n));
|
|
1444
|
+
}, ds = (e, t, n) => {
|
|
1445
|
+
if (e.N && !ps(e.N) && (T(e.N, t, n), et(Q(e.N), t, n)), e.A && T(e.A, t, n), e.C) for (const r of e.C) T(r, t, n);
|
|
1446
|
+
if (e.Ht) {
|
|
1447
|
+
const r = t.u.l.bn;
|
|
1448
|
+
for (const o of e.Ht) r.has(o) && T(o, t, n);
|
|
1449
|
+
}
|
|
1450
|
+
if (Tn(e, t), e.vt) for (const r of e.vt) Tn(r, t);
|
|
1451
|
+
}, Tn = (e, t) => {
|
|
1452
|
+
for (; e; ) {
|
|
1453
|
+
if (e.M) for (const n of e.M.values()) T(n, t, !0);
|
|
1454
|
+
e = e.O;
|
|
1455
|
+
}
|
|
1456
|
+
}, et = (e, t, n) => {
|
|
1457
|
+
if (t.an.has(e)) return;
|
|
1458
|
+
t.an.add(e);
|
|
1459
|
+
const r = e.vn;
|
|
1460
|
+
for (const o of r) if (o[0] > 0 && T(o[2], t, n), n === !0) {
|
|
1461
|
+
const s = o[1];
|
|
1462
|
+
kt(s) && X(s) ? o[0] === 0 && hs(s, t) : T(s, t, !0);
|
|
1463
|
+
}
|
|
1464
|
+
}, qn = /* @__PURE__ */ Symbol(), T = (e, t, n) => {
|
|
1465
|
+
if (e != null) {
|
|
1466
|
+
const o = typeof e;
|
|
1467
|
+
switch (o) {
|
|
1468
|
+
case "function":
|
|
1469
|
+
case "object": {
|
|
1470
|
+
if (t.an.has(e)) return;
|
|
1471
|
+
if (t.an.add(e), _r(e)) return t.un.add(void 0), void t.fn.push(e);
|
|
1472
|
+
const s = e, i = nt(e);
|
|
1473
|
+
if (i) {
|
|
1474
|
+
const l = !(2 & Us(e = i));
|
|
1475
|
+
if (n && l && et(Q(s), t, n), Er(s)) return void t.un.add(e);
|
|
1476
|
+
}
|
|
1477
|
+
if (Ms(e, t, n)) return void t.un.add(e);
|
|
1478
|
+
if (U(e)) return void t.ln.push((r = e, r.then((l) => (r[qn] = { resolved: !0, value: l }, l), (l) => (r[qn] = { resolved: !1, value: l }, l))).then((l) => {
|
|
1479
|
+
T(l, t, n);
|
|
1480
|
+
}));
|
|
1481
|
+
if (o === "object") {
|
|
1482
|
+
if (kt(e)) return;
|
|
1483
|
+
if (E(e)) for (let l = 0; l < e.length; l++) T(s[l], t, n);
|
|
1484
|
+
else if (Ct(e)) for (const l in e) T(s[l], t, n);
|
|
1485
|
+
}
|
|
1486
|
+
break;
|
|
1487
|
+
}
|
|
1488
|
+
}
|
|
1489
|
+
}
|
|
1490
|
+
var r;
|
|
1491
|
+
t.un.add(e);
|
|
1492
|
+
}, ps = (e) => Object.keys(e).length === 0, Cn = /* @__PURE__ */ new Set(), ui = (e, t, n = Y) => {
|
|
1493
|
+
let r = null, o = null;
|
|
1494
|
+
if (H(e)) o = e;
|
|
1495
|
+
else {
|
|
1496
|
+
if (!Ee(e)) throw $(12, e);
|
|
1497
|
+
r = e;
|
|
1498
|
+
}
|
|
1499
|
+
return Cn.has(t) || Cn.add(t), rt(r, t, null, o, null, n, null);
|
|
1500
|
+
}, kr = (e, t = {}) => {
|
|
1501
|
+
let n = e.Gt, r = e.Bt;
|
|
1502
|
+
const o = e.yn ?? n, s = qt();
|
|
1503
|
+
if (s) {
|
|
1504
|
+
const u = s.chunkForSymbol(o, r, e.dev?.file);
|
|
1505
|
+
u ? (r = u[1], e.yn || (n = u[0])) : console.error("serializeQRL: Cannot resolve symbol", n, "in", r, e.dev?.file);
|
|
1506
|
+
}
|
|
1507
|
+
if (r == null) throw $(31, e.Gt);
|
|
1508
|
+
if (r.startsWith("./") && (r = r.slice(2)), Gs(e)) if (t.u) {
|
|
1509
|
+
const u = e.resolved, a = t.u, h = u.serialized || u.toString();
|
|
1510
|
+
let g = a.en.get(h);
|
|
1511
|
+
g === void 0 && (g = a.en.size, a.en.set(h, g)), n = String(g);
|
|
1512
|
+
} else Ir("Sync QRL without containerState");
|
|
1513
|
+
let i = `${r}#${n}`;
|
|
1514
|
+
const l = e.Kt, c = e.ht;
|
|
1515
|
+
return c && c.length ? t.gn ? i += `[${bt(c, t.gn, " ")}]` : t.xn && (i += `[${bt(c, t.xn, " ")}]`) : l && l.length > 0 && (i += `[${l.join(" ")}]`), i;
|
|
1516
|
+
}, tt = (e, t) => {
|
|
1517
|
+
const n = e.length, r = jn(e, 0, "#"), o = jn(e, r, "["), s = Math.min(r, o), i = e.substring(0, s), l = r == n ? r : r + 1, c = l == o ? "default" : e.substring(l, o), u = o === n ? Y : e.substring(o + 1, n - 1).split(" "), a = rt(i, c, null, null, u, null, null);
|
|
1518
|
+
return t && a.S(t), a;
|
|
1519
|
+
}, jn = (e, t, n) => {
|
|
1520
|
+
const r = e.length, o = e.indexOf(n, t == r ? 0 : t);
|
|
1521
|
+
return o == -1 ? r : o;
|
|
1522
|
+
}, Sr = (e, t) => e.ht = e.Kt.map((n) => {
|
|
1523
|
+
const r = parseInt(n, 10);
|
|
1524
|
+
return t.Yt[r];
|
|
1525
|
+
}), ms = (e) => ({ __brand: "resource", value: void 0, loading: !0, _resolved: void 0, _error: void 0, _state: "pending", _timeout: e?.timeout ?? -1, _cache: 0 }), gs = (e) => Ze(e) && e.__brand === "resource", wt = (e) => Lt(we, { [ae]: "" }, 0, e.name ?? ""), Tr = "";
|
|
1526
|
+
function C(e) {
|
|
1527
|
+
return { Sn: e.qn.charCodeAt(0), kn: e.qn, jn: e.jn, Cn: e.Cn, Pn: e.Pn, Mn: e.Mn, On: e.On, vn: e.vn };
|
|
1528
|
+
}
|
|
1529
|
+
const vs = /* @__PURE__ */ C({ qn: "", jn: (e) => en(e), On: (e, t, n) => {
|
|
1530
|
+
if (e.ht) for (const r of e.ht) T(r, t, n);
|
|
1531
|
+
t.wn === 0 && t.dn.push(e);
|
|
1532
|
+
}, Cn: (e, t) => kr(e, { gn: t }), Pn: (e, t) => tt(e, t.D), Mn: (e, t) => {
|
|
1533
|
+
e.Kt && e.Kt.length > 0 && (e.ht = e.Kt.map(t), e.Kt = null);
|
|
1534
|
+
} }), ys = /* @__PURE__ */ C({ qn: "", jn: (e) => zt(e), On: (e, t, n) => {
|
|
1535
|
+
T(e.Tt, t, n), e.Jt && (T(e.Jt, t, n), n === !0 && e.Jt instanceof $e && et(e.Jt[M], t, !0));
|
|
1536
|
+
}, Cn: (e, t) => ((n, r) => {
|
|
1537
|
+
let o = `${Me(n.R)} ${Me(n.Dt)} ${r(n.Tt)} ${r(n.Nt)}`;
|
|
1538
|
+
return n.Jt && (o += ` ${r(n.Jt)}`), o;
|
|
1539
|
+
})(e, t), Pn: (e) => ((t) => {
|
|
1540
|
+
const [n, r, o, s, i] = t.split(" ");
|
|
1541
|
+
return new Xe(F(n), F(r), s, o, i);
|
|
1542
|
+
})(e), Mn: (e, t) => {
|
|
1543
|
+
e.Nt = t(e.Nt), e.Tt = t(e.Tt), e.Jt && (e.Jt = t(e.Jt));
|
|
1544
|
+
} }), bs = /* @__PURE__ */ C({ qn: "", jn: (e) => gs(e), On: (e, t, n) => {
|
|
1545
|
+
T(e.value, t, n), T(e._resolved, t, n);
|
|
1546
|
+
}, Cn: (e, t) => ((n, r) => {
|
|
1547
|
+
const o = n._state;
|
|
1548
|
+
return o === "resolved" ? `0 ${r(n._resolved)}` : o === "pending" ? "1" : `2 ${r(n._error)}`;
|
|
1549
|
+
})(e, t), Pn: (e) => ((t) => {
|
|
1550
|
+
const [n, r] = t.split(" "), o = ms(void 0);
|
|
1551
|
+
return o.value = Promise.resolve(), n === "0" ? (o._state = "resolved", o._resolved = r, o.loading = !1) : n === "1" ? (o._state = "pending", o.value = new Promise(() => {
|
|
1552
|
+
}), o.loading = !0) : n === "2" && (o._state = "rejected", o._error = r, o.loading = !1), o;
|
|
1553
|
+
})(e), Mn: (e, t) => {
|
|
1554
|
+
if (e._state === "resolved") e._resolved = t(e._resolved), e.value = Promise.resolve(e._resolved);
|
|
1555
|
+
else if (e._state === "rejected") {
|
|
1556
|
+
const n = Promise.reject(e._error);
|
|
1557
|
+
n.catch(() => null), e._error = t(e._error), e.value = n;
|
|
1558
|
+
}
|
|
1559
|
+
} }), ws = /* @__PURE__ */ C({ qn: "", jn: (e) => e instanceof URL, Cn: (e) => e.href, Pn: (e) => new URL(e) }), ks = /* @__PURE__ */ C({ qn: "", jn: (e) => e instanceof Date, Cn: (e) => e.toISOString(), Pn: (e) => new Date(e) }), Ss = /* @__PURE__ */ C({ qn: "\x07", jn: (e) => e instanceof RegExp, Cn: (e) => `${e.flags} ${e.source}`, Pn: (e) => {
|
|
1560
|
+
const t = e.indexOf(" "), n = e.slice(t + 1), r = e.slice(0, t);
|
|
1561
|
+
return new RegExp(n, r);
|
|
1562
|
+
} }), Ts = /* @__PURE__ */ C({ qn: "", jn: (e) => e instanceof Error, Cn: (e) => e.message, Pn: (e) => {
|
|
1563
|
+
const t = new Error(e);
|
|
1564
|
+
return t.stack = void 0, t;
|
|
1565
|
+
} }), qs = /* @__PURE__ */ C({ qn: "", jn: (e) => !!e && typeof e == "object" && Mr(e), Pn: (e, t, n) => n }), Be = /* @__PURE__ */ Symbol("serializable-data"), Cs = /* @__PURE__ */ C({ qn: "", jn: (e) => tn(e), Cn: (e, t) => {
|
|
1566
|
+
const [n] = e[Be];
|
|
1567
|
+
return kr(n, { gn: t });
|
|
1568
|
+
}, Pn: (e, t) => {
|
|
1569
|
+
const n = tt(e, t.D);
|
|
1570
|
+
return ei(n);
|
|
1571
|
+
}, Mn: (e, t) => {
|
|
1572
|
+
const [n] = e[Be];
|
|
1573
|
+
n.Kt?.length && (n.ht = n.Kt.map(t), n.Kt = null);
|
|
1574
|
+
} }), js = /* @__PURE__ */ C({ qn: "", jn: (e) => e instanceof dn, On: (e, t, n) => {
|
|
1575
|
+
if (e.Zt) for (const r of e.Zt) T(r, t, n);
|
|
1576
|
+
}, Cn: (e, t, n) => {
|
|
1577
|
+
const r = ((s) => {
|
|
1578
|
+
let i = "";
|
|
1579
|
+
for (let l = 0; l < s.Zt.length; l++) i += `p${l},`;
|
|
1580
|
+
return `(${i})=>(null)`;
|
|
1581
|
+
})(e);
|
|
1582
|
+
let o = n.mn.indexOf(r);
|
|
1583
|
+
return o < 0 && (o = n.mn.length, n.mn.push(r)), bt(e.Zt, t, " ") + " @" + Me(o);
|
|
1584
|
+
}, Pn: (e) => {
|
|
1585
|
+
const t = e.split(" "), n = t.slice(0, -1), r = t[t.length - 1];
|
|
1586
|
+
return new dn(r, n, r);
|
|
1587
|
+
}, Mn: (e, t) => {
|
|
1588
|
+
e.Xt = t(e.Xt), e.Zt = e.Zt.map(t);
|
|
1589
|
+
} }), _s = /* @__PURE__ */ C({ qn: "", jn: (e) => e instanceof $e, On: (e, t, n) => (T(e.untrackedValue, t, n), n === !0 && (e[ge] & Do) === 0 && et(e[M], t, !0), e), Cn: (e, t) => t(e.untrackedValue), Pn: (e, t) => new $e(e, t?.l?.o(), 0), vn: (e, t) => {
|
|
1590
|
+
e[M].Ot(t);
|
|
1591
|
+
}, Mn: (e, t) => {
|
|
1592
|
+
e.untrackedValue = t(e.untrackedValue);
|
|
1593
|
+
} }), Es = /* @__PURE__ */ C({ qn: "", jn: (e) => e instanceof pn, On(e, t, n) {
|
|
1594
|
+
if (T(e.ref, t, n), Er(e.ref)) {
|
|
1595
|
+
const r = Q(e.ref);
|
|
1596
|
+
Ds(t.u.l, r, n) && T(e.ref[e.prop], t, n);
|
|
1597
|
+
}
|
|
1598
|
+
return e;
|
|
1599
|
+
}, Cn: (e, t) => `${t(e.ref)} ${e.prop}`, Pn: (e) => {
|
|
1600
|
+
const [t, n] = e.split(" ");
|
|
1601
|
+
return new pn(t, n);
|
|
1602
|
+
}, Mn: (e, t) => {
|
|
1603
|
+
e.ref = t(e.ref);
|
|
1604
|
+
} }), xs = /* @__PURE__ */ C({ qn: "", jn: (e) => typeof e == "number", Cn: (e) => String(e), Pn: (e) => Number(e) }), As = /* @__PURE__ */ C({ qn: "", jn: (e) => e instanceof URLSearchParams, Cn: (e) => e.toString(), Pn: (e) => new URLSearchParams(e) }), Ns = /* @__PURE__ */ C({ qn: "", jn: (e) => typeof FormData < "u" && e instanceof globalThis.FormData, Cn: (e) => {
|
|
1605
|
+
const t = [];
|
|
1606
|
+
return e.forEach((n, r) => {
|
|
1607
|
+
t.push(typeof n == "string" ? [r, n] : [r, n.name]);
|
|
1608
|
+
}), JSON.stringify(t);
|
|
1609
|
+
}, Pn: (e) => {
|
|
1610
|
+
const t = JSON.parse(e), n = new FormData();
|
|
1611
|
+
for (const [r, o] of t) n.append(r, o);
|
|
1612
|
+
return n;
|
|
1613
|
+
} }), Rs = /* @__PURE__ */ C({ qn: "", jn: (e) => Ve(e), On: (e, t, n) => {
|
|
1614
|
+
T(e.children, t, n), T(e.props, t, n), T(e.immutableProps, t, n), T(e.key, t, n);
|
|
1615
|
+
let r = e.type;
|
|
1616
|
+
r === wt ? r = ":slot" : r === dt && (r = ":fragment"), T(r, t, n);
|
|
1617
|
+
}, Cn: (e, t) => {
|
|
1618
|
+
let n = e.type;
|
|
1619
|
+
return n === wt ? n = ":slot" : n === dt && (n = ":fragment"), `${t(n)} ${t(e.props)} ${t(e.immutableProps)} ${t(e.key)} ${t(e.children)} ${e.flags}`;
|
|
1620
|
+
}, Pn: (e) => {
|
|
1621
|
+
const [t, n, r, o, s, i] = e.split(" ");
|
|
1622
|
+
return new xe(t, n, r, s, parseInt(i, 10), o);
|
|
1623
|
+
}, Mn: (e, t) => {
|
|
1624
|
+
e.type = Ls(t(e.type)), e.props = t(e.props), e.immutableProps = t(e.immutableProps), e.key = t(e.key), e.children = t(e.children);
|
|
1625
|
+
} }), Os = /* @__PURE__ */ C({ qn: "", jn: (e) => typeof e == "bigint", Cn: (e) => e.toString(), Pn: (e) => BigInt(e) }), Ps = /* @__PURE__ */ C({ qn: "", jn: (e) => e instanceof Uint8Array, Cn: (e) => {
|
|
1626
|
+
let t = "";
|
|
1627
|
+
for (const n of e) t += String.fromCharCode(n);
|
|
1628
|
+
return btoa(t).replace(/=+$/, "");
|
|
1629
|
+
}, Pn: (e) => {
|
|
1630
|
+
const t = atob(e), n = new Uint8Array(t.length);
|
|
1631
|
+
let r = 0;
|
|
1632
|
+
for (const o of t) n[r++] = o.charCodeAt(0);
|
|
1633
|
+
return n;
|
|
1634
|
+
}, Mn: void 0 }), oe = /* @__PURE__ */ Symbol(), qr = [vs, ys, bs, ws, ks, Ss, Ts, qs, Cs, js, _s, Es, xs, As, Ns, Rs, Os, /* @__PURE__ */ C({ qn: "", jn: (e) => e instanceof Set, On: (e, t, n) => {
|
|
1635
|
+
e.forEach((r) => T(r, t, n));
|
|
1636
|
+
}, Cn: (e, t) => Array.from(e).map(t).join(" "), Pn: (e) => {
|
|
1637
|
+
const t = /* @__PURE__ */ new Set();
|
|
1638
|
+
return t[oe] = e, t;
|
|
1639
|
+
}, Mn: (e, t) => {
|
|
1640
|
+
const n = e[oe];
|
|
1641
|
+
e[oe] = void 0;
|
|
1642
|
+
const r = n.length === 0 ? [] : n.split(" ");
|
|
1643
|
+
for (const o of r) e.add(t(o));
|
|
1644
|
+
} }), /* @__PURE__ */ C({ qn: "", jn: (e) => e instanceof Map, On: (e, t, n) => {
|
|
1645
|
+
e.forEach((r, o) => {
|
|
1646
|
+
T(r, t, n), T(o, t, n);
|
|
1647
|
+
});
|
|
1648
|
+
}, Cn: (e, t) => {
|
|
1649
|
+
const n = [];
|
|
1650
|
+
return e.forEach((r, o) => {
|
|
1651
|
+
n.push(t(o) + " " + t(r));
|
|
1652
|
+
}), n.join(" ");
|
|
1653
|
+
}, Pn: (e) => {
|
|
1654
|
+
const t = /* @__PURE__ */ new Map();
|
|
1655
|
+
return t[oe] = e, t;
|
|
1656
|
+
}, Mn: (e, t) => {
|
|
1657
|
+
const n = e[oe];
|
|
1658
|
+
e[oe] = void 0;
|
|
1659
|
+
const r = n.length === 0 ? [] : n.split(" ");
|
|
1660
|
+
for (let o = 0; o < r.length; o += 2) e.set(t(r[o]), t(r[o + 1]));
|
|
1661
|
+
} }), /* @__PURE__ */ C({ qn: "\x1B", jn: (e) => !!Cr(e) || e === Tr, Cn: (e) => e, Pn: (e) => e }), Ps], _n = /* @__PURE__ */ (() => {
|
|
1662
|
+
const e = [];
|
|
1663
|
+
return qr.forEach((t) => {
|
|
1664
|
+
const n = t.Sn;
|
|
1665
|
+
for (; e.length < n; ) e.push(void 0);
|
|
1666
|
+
e.push(t);
|
|
1667
|
+
}), e;
|
|
1668
|
+
})();
|
|
1669
|
+
function Cr(e) {
|
|
1670
|
+
if (typeof e == "string") {
|
|
1671
|
+
const t = e.charCodeAt(0);
|
|
1672
|
+
if (t < _n.length) return _n[t];
|
|
1673
|
+
}
|
|
1674
|
+
}
|
|
1675
|
+
const $s = /* @__PURE__ */ qr.filter((e) => e.On), Ms = (e, t, n) => {
|
|
1676
|
+
for (const r of $s) if (r.jn(e)) return r.On(e, t, n), !0;
|
|
1677
|
+
return !1;
|
|
1678
|
+
}, Ws = (e, t) => {
|
|
1679
|
+
const n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map();
|
|
1680
|
+
return { prepare(o) {
|
|
1681
|
+
const s = Cr(o);
|
|
1682
|
+
if (s) {
|
|
1683
|
+
const i = s.Pn(o.slice(1), e, t);
|
|
1684
|
+
return s.Mn && n.set(i, s), s.vn && r.set(i, s), i;
|
|
1685
|
+
}
|
|
1686
|
+
return o;
|
|
1687
|
+
}, subs(o, s) {
|
|
1688
|
+
const i = r.get(o);
|
|
1689
|
+
return !!i && (i.vn(o, s, e), !0);
|
|
1690
|
+
}, fill(o, s) {
|
|
1691
|
+
const i = n.get(o);
|
|
1692
|
+
return !!i && (i.Mn(o, s, e), !0);
|
|
1693
|
+
} };
|
|
1694
|
+
}, Is = { "!": (e, t) => t.t.get(e) ?? In(e, t), "~": (e) => Promise.resolve(e), _: (e) => Promise.reject(e) }, Ds = (e, t, n) => {
|
|
1695
|
+
if (typeof n == "boolean") return n;
|
|
1696
|
+
const r = e.bn.get(n);
|
|
1697
|
+
return !!(r && r.length > 0) && (r.length !== 1 || r[0] !== t);
|
|
1698
|
+
}, Ls = (e) => e === ":slot" ? wt : e === ":fragment" ? dt : e, jr = /* @__PURE__ */ new WeakSet(), Hs = /* @__PURE__ */ new WeakSet(), _r = (e) => jr.has(e), Er = (e) => Hs.has(e), xr = (e) => ((typeof e == "object" && e !== null || typeof e == "function") && jr.add(e), e), Ne = (e) => Ze(e) ? nt(e) ?? e : e, nt = (e) => e[ut], Q = (e) => e[M], Us = (e) => e[le], Bs = (e, t) => {
|
|
1699
|
+
const n = e.split(" "), r = parseInt(n[0], 10), o = t(n[1]);
|
|
1700
|
+
if (!o || zt(o) && !o.Nt) return;
|
|
1701
|
+
const s = [r, o];
|
|
1702
|
+
return r === 0 ? s.push(ct(n[2])) : r <= 2 ? s.push(t(n[2]), t(n[3]), n[4], ct(n[5])) : r <= 4 && s.push(t(n[2]), t(n[3]), ct(n[4])), s;
|
|
1703
|
+
}, ct = (e) => {
|
|
1704
|
+
if (e !== void 0) return decodeURI(e);
|
|
1705
|
+
}, Fs = (e) => {
|
|
1706
|
+
const t = /* @__PURE__ */ new Map();
|
|
1707
|
+
return { bn: t, o: (n) => new zs(t, e, n), bt: (n) => {
|
|
1708
|
+
const r = t.get(n);
|
|
1709
|
+
if (r) {
|
|
1710
|
+
for (const o of r) o.Tn(n);
|
|
1711
|
+
t.delete(n), r.length = 0;
|
|
1712
|
+
}
|
|
1713
|
+
}, Ut: (n) => {
|
|
1714
|
+
const r = t.get(n[1]);
|
|
1715
|
+
if (r) for (const o of r) o.En(n);
|
|
1716
|
+
} };
|
|
1717
|
+
};
|
|
1718
|
+
class zs {
|
|
1719
|
+
constructor(t, n, r) {
|
|
1720
|
+
k(this, "bn");
|
|
1721
|
+
k(this, "u");
|
|
1722
|
+
k(this, "vn");
|
|
1723
|
+
this.bn = t, this.u = n, this.vn = [], r && this.Ot(r);
|
|
1724
|
+
}
|
|
1725
|
+
Ot(t) {
|
|
1726
|
+
this.vn.push(...t);
|
|
1727
|
+
for (const n of this.vn) this.Rn(n[1], this);
|
|
1728
|
+
}
|
|
1729
|
+
Rn(t, n) {
|
|
1730
|
+
let r = this.bn.get(t);
|
|
1731
|
+
r || this.bn.set(t, r = []), r.includes(n) || r.push(n);
|
|
1732
|
+
}
|
|
1733
|
+
Tn(t) {
|
|
1734
|
+
const n = this.vn;
|
|
1735
|
+
for (let r = 0; r < n.length; r++) n[r][1] === t && (n.splice(r, 1), r--);
|
|
1736
|
+
}
|
|
1737
|
+
En(t) {
|
|
1738
|
+
const [n, r, o, s] = t, i = this.vn;
|
|
1739
|
+
if (n === 1 || n === 2) {
|
|
1740
|
+
const l = t[4];
|
|
1741
|
+
for (let c = 0; c < i.length; c++) {
|
|
1742
|
+
const u = i[c];
|
|
1743
|
+
u[0] === n && u[1] === r && u[2] === o && u[3] === s && u[4] === l && (i.splice(c, 1), c--);
|
|
1744
|
+
}
|
|
1745
|
+
} else if (n === 3 || n === 4) for (let l = 0; l < i.length; l++) {
|
|
1746
|
+
const c = i[l];
|
|
1747
|
+
c[0] === n && c[1] === r && c[2] === o && c[3] === s && (i.splice(l, 1), l--);
|
|
1748
|
+
}
|
|
1749
|
+
}
|
|
1750
|
+
m(t, n) {
|
|
1751
|
+
const r = this.vn, o = t[1];
|
|
1752
|
+
t[0] === 0 && r.some(([s, i, l]) => s === 0 && i === o && l === n) || (r.push(Ar = [...t, n]), this.Rn(o, this));
|
|
1753
|
+
}
|
|
1754
|
+
p(t) {
|
|
1755
|
+
const n = this.vn;
|
|
1756
|
+
for (const r of n) {
|
|
1757
|
+
const o = r[r.length - 1];
|
|
1758
|
+
t && o && o !== t || go(r, this.u);
|
|
1759
|
+
}
|
|
1760
|
+
}
|
|
1761
|
+
}
|
|
1762
|
+
let Ar;
|
|
1763
|
+
const en = (e) => typeof e == "function" && typeof e.getSymbol == "function", Zs = "<sync>", Gs = (e) => en(e) && e.Gt == Zs, rt = (e, t, n, r, o, s, i) => {
|
|
1764
|
+
let l;
|
|
1765
|
+
const c = async function(...f) {
|
|
1766
|
+
return await p.call(this, L())(...f);
|
|
1767
|
+
}, u = (f) => (l || (l = f), l), a = (f) => typeof f != "function" || !o?.length && !s?.length ? f : function(...m) {
|
|
1768
|
+
let d = L();
|
|
1769
|
+
if (d) {
|
|
1770
|
+
const w = d.Tt;
|
|
1771
|
+
d.Tt = c;
|
|
1772
|
+
const S = d.Vt;
|
|
1773
|
+
d.Vt === void 0 && (d.Vt = this);
|
|
1774
|
+
try {
|
|
1775
|
+
return f.apply(this, m);
|
|
1776
|
+
} finally {
|
|
1777
|
+
d.Tt = w, d.Vt = S;
|
|
1778
|
+
}
|
|
1779
|
+
}
|
|
1780
|
+
return d = W(), d.Tt = c, d.Vt = this, G.call(this, d, f, ...m);
|
|
1781
|
+
}, h = async (f) => {
|
|
1782
|
+
if (n !== null) return n;
|
|
1783
|
+
if (f && u(f), e === "") {
|
|
1784
|
+
const w = l.getAttribute(On), S = Pn(l.ownerDocument, w);
|
|
1785
|
+
return c.resolved = n = S[Number(t)];
|
|
1786
|
+
}
|
|
1787
|
+
e && on(e, 1);
|
|
1788
|
+
const m = Xs(), d = L();
|
|
1789
|
+
if (r !== null) n = r().then((w) => c.resolved = n = a(w[t]));
|
|
1790
|
+
else {
|
|
1791
|
+
const w = qt().importSymbol(l, e, t);
|
|
1792
|
+
n = q(w, (S) => c.resolved = n = a(S));
|
|
1793
|
+
}
|
|
1794
|
+
return typeof n == "object" && U(n) && n.then(() => Ks(t, d?.T, m), (w) => {
|
|
1795
|
+
console.error(`qrl ${t} failed to load`, w), n = null;
|
|
1796
|
+
}), n;
|
|
1797
|
+
}, g = (f) => n !== null ? n : h(f);
|
|
1798
|
+
function p(f, m) {
|
|
1799
|
+
return (...d) => q(g(), (w) => {
|
|
1800
|
+
if (!H(w)) throw $(10);
|
|
1801
|
+
if (m && m() === !1) return;
|
|
1802
|
+
const S = y(f);
|
|
1803
|
+
return G.call(this, S, w, ...d);
|
|
1804
|
+
});
|
|
1805
|
+
}
|
|
1806
|
+
const y = (f) => f == null ? W() : E(f) ? rr(f) : f, b = i ?? t, v = Js(b);
|
|
1807
|
+
return Object.assign(c, { getSymbol: () => b, getHash: () => v, getCaptured: () => s, resolve: h, Wt: g, S: u, Bt: e, Gt: t, yn: i, In: v, getFn: p, Kt: o, ht: s, dev: null, resolved: void 0 }), n && (n = q(n, (f) => c.resolved = n = a(f))), b && on(b, 0.8), c;
|
|
1808
|
+
}, Js = (e) => {
|
|
1809
|
+
const t = e.lastIndexOf("_");
|
|
1810
|
+
return t > -1 ? e.slice(t + 1) : e;
|
|
1811
|
+
}, En = /* @__PURE__ */ new Set(), Ks = (e, t, n) => {
|
|
1812
|
+
En.has(e) || (En.add(e), Vs("qsymbol", { symbol: e, element: t, reqTime: n }));
|
|
1813
|
+
}, Vs = (e, t) => {
|
|
1814
|
+
typeof document == "object" && document.dispatchEvent(new CustomEvent(e, { bubbles: !1, detail: t }));
|
|
1815
|
+
}, Xs = () => typeof performance == "object" ? performance.now() : 0;
|
|
1816
|
+
let Qs = 0;
|
|
1817
|
+
const Ys = (e) => rt(null, "s" + Qs++, e, null, null, null, null), ei = (e) => {
|
|
1818
|
+
function t(n, r, o) {
|
|
1819
|
+
const s = e.In.slice(0, 4) + ":" + (r || "");
|
|
1820
|
+
return Lt(we, { [ye]: e, [Z]: n[Z], [N]: n[N], children: n.children, props: n }, o, s);
|
|
1821
|
+
}
|
|
1822
|
+
return t[Be] = [e], t;
|
|
1823
|
+
}, tn = (e) => typeof e == "function" && e[Be] !== void 0, ai = () => {
|
|
1824
|
+
const { val: e, set: t, elCtx: n, iCtx: r } = Ke();
|
|
1825
|
+
if (e != null) return e;
|
|
1826
|
+
const o = r.j?.k?.u?.nn || "";
|
|
1827
|
+
return t(`${o ? Vr(o) : ""}-${n.A?.getHash() || ""}-${Un(r.j) || ""}`);
|
|
1828
|
+
};
|
|
1829
|
+
export {
|
|
1830
|
+
Lt as A,
|
|
1831
|
+
ii as H,
|
|
1832
|
+
Fn as I,
|
|
1833
|
+
li as K,
|
|
1834
|
+
ui as L,
|
|
1835
|
+
ai as M,
|
|
1836
|
+
fn as R,
|
|
1837
|
+
ci as _,
|
|
1838
|
+
si as a,
|
|
1839
|
+
ri as b,
|
|
1840
|
+
N as c,
|
|
1841
|
+
ei as d,
|
|
1842
|
+
wt as s,
|
|
1843
|
+
mo as v,
|
|
1844
|
+
bo as x,
|
|
1845
|
+
oi as z
|
|
1846
|
+
};
|