@vezham/start 0.3.3 → 26.0.0-alpha.6
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 +173 -0
- package/README.md +2 -0
- package/dist/index.d.ts +2 -0
- package/dist/index.d.ts.map +1 -0
- package/dist/index.js +0 -0
- package/dist/lib/layouts/app/index.d.ts +15 -0
- package/dist/lib/layouts/app/index.d.ts.map +1 -0
- package/dist/lib/layouts/app/index.js +44 -0
- package/dist/lib/layouts/docs/components.d.ts +4 -0
- package/dist/lib/layouts/docs/components.d.ts.map +1 -0
- package/dist/lib/layouts/docs/components.js +29 -0
- package/dist/lib/layouts/docs/index.d.ts +3 -0
- package/dist/lib/layouts/docs/index.d.ts.map +1 -0
- package/dist/lib/layouts/docs/index.js +2 -0
- package/dist/lib/layouts/docs/layout-components.d.ts +9 -0
- package/dist/lib/layouts/docs/layout-components.d.ts.map +1 -0
- package/dist/lib/layouts/docs/layout-components.js +81 -0
- package/dist/lib/layouts/docs/layouts.d.ts +6 -0
- package/dist/lib/layouts/docs/layouts.d.ts.map +1 -0
- package/dist/lib/layouts/docs/layouts.js +11 -0
- package/dist/lib/layouts/docs/page-actions.d.ts +4 -0
- package/dist/lib/layouts/docs/page-actions.d.ts.map +1 -0
- package/dist/lib/layouts/docs/page-actions.js +154 -0
- package/dist/lib/layouts/docs/page-actions.variants.d.ts +44 -0
- package/dist/lib/layouts/docs/page-actions.variants.d.ts.map +1 -0
- package/dist/lib/layouts/docs/page-actions.variants.js +17 -0
- package/dist/lib/layouts/docs/page-content.d.ts +11 -0
- package/dist/lib/layouts/docs/page-content.d.ts.map +1 -0
- package/dist/lib/layouts/docs/page-content.js +13 -0
- package/dist/lib/layouts/docs/pages.d.ts +57 -0
- package/dist/lib/layouts/docs/pages.d.ts.map +1 -0
- package/dist/lib/layouts/docs/pages.js +36 -0
- package/dist/lib/layouts/docs/types.d.ts +21 -0
- package/dist/lib/layouts/docs/types.d.ts.map +1 -0
- package/dist/lib/mdx/index.d.ts +26 -0
- package/dist/lib/mdx/index.d.ts.map +1 -0
- package/dist/lib/mdx/index.js +10 -0
- package/dist/lib/pages/docs/openapi/index.d.ts +2 -0
- package/dist/lib/pages/docs/openapi/index.d.ts.map +1 -0
- package/dist/lib/pages/docs/openapi/index.js +5 -0
- package/dist/lib/pages/docs/route/index.d.ts +35 -0
- package/dist/lib/pages/docs/route/index.d.ts.map +1 -0
- package/dist/lib/pages/docs/route/index.js +59 -0
- package/dist/lib/provider/next/config.d.ts +3 -0
- package/dist/lib/provider/next/config.d.ts.map +1 -0
- package/dist/lib/provider/next/config.js +6 -0
- package/dist/lib/provider/next/index.d.ts +3 -0
- package/dist/lib/provider/next/index.d.ts.map +1 -0
- package/dist/lib/provider/next/index.js +3 -0
- package/dist/lib/provider/next/provider.d.ts +3 -0
- package/dist/lib/provider/next/provider.d.ts.map +1 -0
- package/dist/lib/provider/next/provider.js +24 -0
- package/dist/lib/provider/next/root-document.d.ts +3 -0
- package/dist/lib/provider/next/root-document.d.ts.map +1 -0
- package/dist/lib/provider/next/root-document.js +27 -0
- package/dist/lib/provider/shared/config.d.ts +4 -0
- package/dist/lib/provider/shared/config.d.ts.map +1 -0
- package/dist/lib/provider/shared/config.js +10 -0
- package/dist/lib/provider/shared/devtools.d.ts +10 -0
- package/dist/lib/provider/shared/devtools.d.ts.map +1 -0
- package/dist/lib/provider/shared/devtools.js +24 -0
- package/dist/lib/provider/shared/provider.d.ts +13 -0
- package/dist/lib/provider/shared/provider.d.ts.map +1 -0
- package/dist/lib/provider/shared/provider.js +40 -0
- package/{lib/provider/src → dist/lib/provider/shared}/types.d.ts +16 -19
- package/dist/lib/provider/shared/types.d.ts.map +1 -0
- package/dist/lib/provider/shared/types.js +4 -0
- package/dist/lib/provider/tanstack/config.d.ts +4 -0
- package/dist/lib/provider/tanstack/config.d.ts.map +1 -0
- package/dist/lib/provider/tanstack/config.js +11 -0
- package/dist/lib/provider/tanstack/index.d.ts +4 -0
- package/dist/lib/provider/tanstack/index.d.ts.map +1 -0
- package/dist/lib/provider/tanstack/index.js +4 -0
- package/dist/lib/provider/tanstack/provider.d.ts +3 -0
- package/dist/lib/provider/tanstack/provider.d.ts.map +1 -0
- package/dist/lib/provider/tanstack/provider.js +22 -0
- package/dist/lib/provider/tanstack/root-document.d.ts +8 -0
- package/dist/lib/provider/tanstack/root-document.d.ts.map +1 -0
- package/dist/lib/provider/tanstack/root-document.js +28 -0
- package/dist/lib/provider/tanstack-docs/config.d.ts +14 -0
- package/dist/lib/provider/tanstack-docs/config.d.ts.map +1 -0
- package/dist/lib/provider/tanstack-docs/config.js +39 -0
- package/dist/lib/provider/tanstack-docs/i18n.d.ts +4 -0
- package/dist/lib/provider/tanstack-docs/i18n.d.ts.map +1 -0
- package/dist/lib/provider/tanstack-docs/i18n.js +30 -0
- package/dist/lib/provider/tanstack-docs/index.d.ts +5 -0
- package/dist/lib/provider/tanstack-docs/index.d.ts.map +1 -0
- package/dist/lib/provider/tanstack-docs/index.js +5 -0
- package/dist/lib/provider/tanstack-docs/routes.d.ts +13 -0
- package/dist/lib/provider/tanstack-docs/routes.d.ts.map +1 -0
- package/dist/lib/provider/tanstack-docs/routes.js +23 -0
- package/dist/lib/provider/tanstack-docs/search.d.ts +4 -0
- package/dist/lib/provider/tanstack-docs/search.d.ts.map +1 -0
- package/dist/lib/provider/tanstack-docs/search.js +24 -0
- package/dist/lib/provider/vite/config.d.ts +3 -0
- package/dist/lib/provider/vite/config.d.ts.map +1 -0
- package/dist/lib/provider/vite/config.js +29 -0
- package/dist/lib/provider/vite/index.d.ts +4 -0
- package/dist/lib/provider/vite/index.d.ts.map +1 -0
- package/dist/lib/provider/vite/index.js +4 -0
- package/dist/lib/provider/vite/provider.d.ts +3 -0
- package/dist/lib/provider/vite/provider.d.ts.map +1 -0
- package/dist/lib/provider/vite/provider.js +13 -0
- package/dist/lib/router/tanstack/index.d.ts +3 -0
- package/dist/lib/router/tanstack/index.d.ts.map +1 -0
- package/dist/lib/router/tanstack/index.js +3 -0
- package/dist/lib/router/tanstack/root.d.ts +3 -0
- package/dist/lib/router/tanstack/root.d.ts.map +1 -0
- package/dist/lib/router/tanstack/root.js +22 -0
- package/dist/lib/router/tanstack/router.d.ts +3 -0
- package/dist/lib/router/tanstack/router.d.ts.map +1 -0
- package/dist/lib/router/tanstack/router.js +22 -0
- package/dist/lib/runtime/docs/head.d.ts +46 -0
- package/dist/lib/runtime/docs/head.d.ts.map +1 -0
- package/dist/lib/runtime/docs/head.js +80 -0
- package/dist/lib/runtime/docs/i18n.d.ts +33 -0
- package/dist/lib/runtime/docs/i18n.d.ts.map +1 -0
- package/dist/lib/runtime/docs/i18n.js +41 -0
- package/dist/lib/runtime/docs/icons.d.ts +26 -0
- package/dist/lib/runtime/docs/icons.d.ts.map +1 -0
- package/dist/lib/runtime/docs/icons.js +103 -0
- package/dist/lib/runtime/docs/index.d.ts +9 -0
- package/dist/lib/runtime/docs/index.d.ts.map +1 -0
- package/dist/lib/runtime/docs/index.js +9 -0
- package/dist/lib/runtime/docs/openapi.d.ts +41 -0
- package/dist/lib/runtime/docs/openapi.d.ts.map +1 -0
- package/dist/lib/runtime/docs/openapi.js +40 -0
- package/dist/lib/runtime/docs/pages.d.ts +98 -0
- package/dist/lib/runtime/docs/pages.d.ts.map +1 -0
- package/dist/lib/runtime/docs/pages.js +89 -0
- package/dist/lib/runtime/docs/routes.d.ts +17 -0
- package/dist/lib/runtime/docs/routes.d.ts.map +1 -0
- package/dist/lib/runtime/docs/routes.js +45 -0
- package/dist/lib/runtime/docs/runtime.d.ts +185 -0
- package/dist/lib/runtime/docs/runtime.d.ts.map +1 -0
- package/dist/lib/runtime/docs/runtime.js +55 -0
- package/dist/lib/runtime/docs/static.d.ts +16 -0
- package/dist/lib/runtime/docs/static.d.ts.map +1 -0
- package/dist/lib/runtime/docs/static.js +20 -0
- package/dist/lib/story/index.d.ts +2 -0
- package/dist/lib/story/index.d.ts.map +1 -0
- package/dist/lib/story/index.js +5 -0
- package/dist/styles/docs/index.css +2 -0
- package/package.json +91 -20
- package/C2Q2AJ2U-DTgcxQMB.mjs +0 -33
- package/CTUG6TWM-DqDj0HqV.mjs +0 -42
- package/PPK4CBG4-Bam-TzhH.mjs +0 -8999
- package/index-B5yPbrKI.mjs +0 -2259
- package/index-BVFA6t6h.mjs +0 -2213
- package/index-CbtQygO9.mjs +0 -55716
- package/index.d.ts +0 -1
- package/index.mjs +0 -5
- package/lib/provider/src/index.d.ts +0 -6
- package/style.css +0 -1
package/index-BVFA6t6h.mjs
DELETED
|
@@ -1,2213 +0,0 @@
|
|
|
1
|
-
var dt = (e) => {
|
|
2
|
-
throw TypeError(e);
|
|
3
|
-
};
|
|
4
|
-
var ht = (e, t, n) => t.has(e) || dt("Cannot " + n);
|
|
5
|
-
var d = (e, t, n) => (ht(e, t, "read from private field"), n ? n.call(e) : t.get(e)), p = (e, t, n) => t.has(e) ? dt("Cannot add the same private member more than once") : t instanceof WeakSet ? t.add(e) : t.set(e, n), v = (e, t, n, r) => (ht(e, t, "write to private field"), r ? r.call(e, n) : t.set(e, n), n);
|
|
6
|
-
import * as P from "react";
|
|
7
|
-
import { u as Ct, o as Tt } from "./index-CbtQygO9.mjs";
|
|
8
|
-
import { jsx as xt } from "react/jsx-runtime";
|
|
9
|
-
var h = {
|
|
10
|
-
context: void 0,
|
|
11
|
-
registry: void 0,
|
|
12
|
-
effects: void 0,
|
|
13
|
-
done: !1,
|
|
14
|
-
getContextId() {
|
|
15
|
-
return gt(this.context.count);
|
|
16
|
-
},
|
|
17
|
-
getNextContextId() {
|
|
18
|
-
return gt(this.context.count++);
|
|
19
|
-
}
|
|
20
|
-
};
|
|
21
|
-
function gt(e) {
|
|
22
|
-
const t = String(e), n = t.length - 1;
|
|
23
|
-
return h.context.id + (n ? String.fromCharCode(96 + n) : "") + t;
|
|
24
|
-
}
|
|
25
|
-
function he(e) {
|
|
26
|
-
h.context = e;
|
|
27
|
-
}
|
|
28
|
-
var Nt = !1, cn = (e, t) => e === t, $e = Symbol("solid-proxy"), kt = typeof Proxy == "function", Pt = Symbol("solid-track"), Be = {
|
|
29
|
-
equals: cn
|
|
30
|
-
}, It = _t, $ = 1, je = 2, Rt = {
|
|
31
|
-
owned: null,
|
|
32
|
-
cleanups: null,
|
|
33
|
-
context: null,
|
|
34
|
-
owner: null
|
|
35
|
-
}, We = {}, m = null, Ye = null, fn = null, w = null, N = null, _ = null, Ke = 0;
|
|
36
|
-
function K(e, t) {
|
|
37
|
-
const n = w, r = m, s = e.length === 0, i = t === void 0 ? r : t, o = s ? Rt : {
|
|
38
|
-
owned: null,
|
|
39
|
-
cleanups: null,
|
|
40
|
-
context: i ? i.context : null,
|
|
41
|
-
owner: i
|
|
42
|
-
}, l = s ? e : () => e(() => x(() => ve(o)));
|
|
43
|
-
m = o, w = null;
|
|
44
|
-
try {
|
|
45
|
-
return L(l, !0);
|
|
46
|
-
} finally {
|
|
47
|
-
w = n, m = r;
|
|
48
|
-
}
|
|
49
|
-
}
|
|
50
|
-
function E(e, t) {
|
|
51
|
-
t = t ? Object.assign({}, Be, t) : Be;
|
|
52
|
-
const n = {
|
|
53
|
-
value: e,
|
|
54
|
-
observers: null,
|
|
55
|
-
observerSlots: null,
|
|
56
|
-
comparator: t.equals || void 0
|
|
57
|
-
}, r = (s) => (typeof s == "function" && (s = s(n.value)), Lt(n, s));
|
|
58
|
-
return [Vt.bind(n), r];
|
|
59
|
-
}
|
|
60
|
-
function dn(e, t, n) {
|
|
61
|
-
const r = Qe(e, t, !0, $);
|
|
62
|
-
de(r);
|
|
63
|
-
}
|
|
64
|
-
function Q(e, t, n) {
|
|
65
|
-
const r = Qe(e, t, !1, $);
|
|
66
|
-
de(r);
|
|
67
|
-
}
|
|
68
|
-
function Mt(e, t, n) {
|
|
69
|
-
It = En;
|
|
70
|
-
const r = Qe(e, t, !1, $);
|
|
71
|
-
(!n || !n.render) && (r.user = !0), _ ? _.push(r) : de(r);
|
|
72
|
-
}
|
|
73
|
-
function T(e, t, n) {
|
|
74
|
-
n = n ? Object.assign({}, Be, n) : Be;
|
|
75
|
-
const r = Qe(e, t, !0, 0);
|
|
76
|
-
return r.observers = null, r.observerSlots = null, r.comparator = n.equals || void 0, de(r), Vt.bind(r);
|
|
77
|
-
}
|
|
78
|
-
function hn(e) {
|
|
79
|
-
return e && typeof e == "object" && "then" in e;
|
|
80
|
-
}
|
|
81
|
-
function gn(e, t, n) {
|
|
82
|
-
let r, s, i;
|
|
83
|
-
r = !0, s = e, i = {};
|
|
84
|
-
let o = null, l = We, a = null, u = !1, f = "initialValue" in i, c = typeof r == "function" && T(r);
|
|
85
|
-
const g = /* @__PURE__ */ new Set(), [y, S] = (i.storage || E)(i.initialValue), [C, B] = E(void 0), [F, M] = E(void 0, {
|
|
86
|
-
equals: !1
|
|
87
|
-
}), [I, D] = E(f ? "ready" : "unresolved");
|
|
88
|
-
h.context && (a = h.getNextContextId(), i.ssrLoadFrom === "initial" ? l = i.initialValue : h.load && h.has(a) && (l = h.load(a)));
|
|
89
|
-
function R(k, A, O, G) {
|
|
90
|
-
return o === k && (o = null, G !== void 0 && (f = !0), (k === l || A === l) && i.onHydrated && queueMicrotask(
|
|
91
|
-
() => i.onHydrated(G, {
|
|
92
|
-
value: A
|
|
93
|
-
})
|
|
94
|
-
), l = We, Ge(A, O)), A;
|
|
95
|
-
}
|
|
96
|
-
function Ge(k, A) {
|
|
97
|
-
L(() => {
|
|
98
|
-
A === void 0 && S(() => k), D(A !== void 0 ? "errored" : f ? "ready" : "unresolved"), B(A);
|
|
99
|
-
for (const O of g.keys()) O.decrement();
|
|
100
|
-
g.clear();
|
|
101
|
-
}, !1);
|
|
102
|
-
}
|
|
103
|
-
function He() {
|
|
104
|
-
const k = wn, A = y(), O = C();
|
|
105
|
-
if (O !== void 0 && !o) throw O;
|
|
106
|
-
return w && w.user, A;
|
|
107
|
-
}
|
|
108
|
-
function Xe(k = !0) {
|
|
109
|
-
if (k !== !1 && u) return;
|
|
110
|
-
u = !1;
|
|
111
|
-
const A = c ? c() : r;
|
|
112
|
-
if (A == null || A === !1) {
|
|
113
|
-
R(o, x(y));
|
|
114
|
-
return;
|
|
115
|
-
}
|
|
116
|
-
const O = l !== We ? l : x(
|
|
117
|
-
() => s(A, {
|
|
118
|
-
value: y(),
|
|
119
|
-
refetching: k
|
|
120
|
-
})
|
|
121
|
-
);
|
|
122
|
-
return hn(O) ? (o = O, "value" in O ? (O.status === "success" ? R(o, O.value, void 0, A) : R(o, void 0, et(O.value), A), O) : (u = !0, queueMicrotask(() => u = !1), L(() => {
|
|
123
|
-
D(f ? "refreshing" : "pending"), M();
|
|
124
|
-
}, !1), O.then(
|
|
125
|
-
(G) => R(O, G, void 0, A),
|
|
126
|
-
(G) => R(O, void 0, et(G), A)
|
|
127
|
-
))) : (R(o, O, void 0, A), O);
|
|
128
|
-
}
|
|
129
|
-
return Object.defineProperties(He, {
|
|
130
|
-
state: {
|
|
131
|
-
get: () => I()
|
|
132
|
-
},
|
|
133
|
-
error: {
|
|
134
|
-
get: () => C()
|
|
135
|
-
},
|
|
136
|
-
loading: {
|
|
137
|
-
get() {
|
|
138
|
-
const k = I();
|
|
139
|
-
return k === "pending" || k === "refreshing";
|
|
140
|
-
}
|
|
141
|
-
},
|
|
142
|
-
latest: {
|
|
143
|
-
get() {
|
|
144
|
-
if (!f) return He();
|
|
145
|
-
const k = C();
|
|
146
|
-
if (k && !o) throw k;
|
|
147
|
-
return y();
|
|
148
|
-
}
|
|
149
|
-
}
|
|
150
|
-
}), c ? dn(() => Xe(!1)) : Xe(!1), [
|
|
151
|
-
He,
|
|
152
|
-
{
|
|
153
|
-
refetch: Xe,
|
|
154
|
-
mutate: S
|
|
155
|
-
}
|
|
156
|
-
];
|
|
157
|
-
}
|
|
158
|
-
function Ur(e) {
|
|
159
|
-
return L(e, !1);
|
|
160
|
-
}
|
|
161
|
-
function x(e) {
|
|
162
|
-
if (w === null) return e();
|
|
163
|
-
const t = w;
|
|
164
|
-
w = null;
|
|
165
|
-
try {
|
|
166
|
-
return e();
|
|
167
|
-
} finally {
|
|
168
|
-
w = t;
|
|
169
|
-
}
|
|
170
|
-
}
|
|
171
|
-
function qr(e, t, n) {
|
|
172
|
-
const r = Array.isArray(e);
|
|
173
|
-
let s, i = n && n.defer;
|
|
174
|
-
return (o) => {
|
|
175
|
-
let l;
|
|
176
|
-
if (r) {
|
|
177
|
-
l = Array(e.length);
|
|
178
|
-
for (let u = 0; u < e.length; u++) l[u] = e[u]();
|
|
179
|
-
} else l = e();
|
|
180
|
-
if (i)
|
|
181
|
-
return i = !1, o;
|
|
182
|
-
const a = x(() => t(l, s, o));
|
|
183
|
-
return s = l, a;
|
|
184
|
-
};
|
|
185
|
-
}
|
|
186
|
-
function yn(e) {
|
|
187
|
-
Mt(() => x(e));
|
|
188
|
-
}
|
|
189
|
-
function me(e) {
|
|
190
|
-
return m === null || (m.cleanups === null ? m.cleanups = [e] : m.cleanups.push(e)), e;
|
|
191
|
-
}
|
|
192
|
-
function yt() {
|
|
193
|
-
return m;
|
|
194
|
-
}
|
|
195
|
-
function mn(e, t) {
|
|
196
|
-
const n = m, r = w;
|
|
197
|
-
m = e, w = null;
|
|
198
|
-
try {
|
|
199
|
-
return L(t, !0);
|
|
200
|
-
} catch (s) {
|
|
201
|
-
ft(s);
|
|
202
|
-
} finally {
|
|
203
|
-
m = n, w = r;
|
|
204
|
-
}
|
|
205
|
-
}
|
|
206
|
-
function vn(e) {
|
|
207
|
-
const t = w, n = m;
|
|
208
|
-
return Promise.resolve().then(() => {
|
|
209
|
-
w = t, m = n;
|
|
210
|
-
let r;
|
|
211
|
-
return L(e, !1), w = m = null, r ? r.done : void 0;
|
|
212
|
-
});
|
|
213
|
-
}
|
|
214
|
-
var [pn, Kr] = /* @__PURE__ */ E(!1);
|
|
215
|
-
function Qr() {
|
|
216
|
-
return [pn, vn];
|
|
217
|
-
}
|
|
218
|
-
function zr(e, t) {
|
|
219
|
-
const n = Symbol("context");
|
|
220
|
-
return {
|
|
221
|
-
id: n,
|
|
222
|
-
Provider: An(n),
|
|
223
|
-
defaultValue: e
|
|
224
|
-
};
|
|
225
|
-
}
|
|
226
|
-
function Gr(e) {
|
|
227
|
-
let t;
|
|
228
|
-
return m && m.context && (t = m.context[e.id]) !== void 0 ? t : e.defaultValue;
|
|
229
|
-
}
|
|
230
|
-
function Dt(e) {
|
|
231
|
-
const t = T(e), n = T(() => tt(t()));
|
|
232
|
-
return n.toArray = () => {
|
|
233
|
-
const r = n();
|
|
234
|
-
return Array.isArray(r) ? r : r != null ? [r] : [];
|
|
235
|
-
}, n;
|
|
236
|
-
}
|
|
237
|
-
var wn;
|
|
238
|
-
function Vt() {
|
|
239
|
-
if (this.sources && this.state)
|
|
240
|
-
if (this.state === $) de(this);
|
|
241
|
-
else {
|
|
242
|
-
const e = N;
|
|
243
|
-
N = null, L(() => Ue(this), !1), N = e;
|
|
244
|
-
}
|
|
245
|
-
if (w) {
|
|
246
|
-
const e = this.observers ? this.observers.length : 0;
|
|
247
|
-
w.sources ? (w.sources.push(this), w.sourceSlots.push(e)) : (w.sources = [this], w.sourceSlots = [e]), this.observers ? (this.observers.push(w), this.observerSlots.push(w.sources.length - 1)) : (this.observers = [w], this.observerSlots = [w.sources.length - 1]);
|
|
248
|
-
}
|
|
249
|
-
return this.value;
|
|
250
|
-
}
|
|
251
|
-
function Lt(e, t, n) {
|
|
252
|
-
let r = e.value;
|
|
253
|
-
return (!e.comparator || !e.comparator(r, t)) && (e.value = t, e.observers && e.observers.length && L(() => {
|
|
254
|
-
for (let s = 0; s < e.observers.length; s += 1) {
|
|
255
|
-
const i = e.observers[s], o = Ye && Ye.running;
|
|
256
|
-
o && Ye.disposed.has(i), (o ? !i.tState : !i.state) && (i.pure ? N.push(i) : _.push(i), i.observers && $t(i)), o || (i.state = $);
|
|
257
|
-
}
|
|
258
|
-
if (N.length > 1e6)
|
|
259
|
-
throw N = [], new Error();
|
|
260
|
-
}, !1)), t;
|
|
261
|
-
}
|
|
262
|
-
function de(e) {
|
|
263
|
-
if (!e.fn) return;
|
|
264
|
-
ve(e);
|
|
265
|
-
const t = Ke;
|
|
266
|
-
bn(
|
|
267
|
-
e,
|
|
268
|
-
e.value,
|
|
269
|
-
t
|
|
270
|
-
);
|
|
271
|
-
}
|
|
272
|
-
function bn(e, t, n) {
|
|
273
|
-
let r;
|
|
274
|
-
const s = m, i = w;
|
|
275
|
-
w = m = e;
|
|
276
|
-
try {
|
|
277
|
-
r = e.fn(t);
|
|
278
|
-
} catch (o) {
|
|
279
|
-
return e.pure && (e.state = $, e.owned && e.owned.forEach(ve), e.owned = null), e.updatedAt = n + 1, ft(o);
|
|
280
|
-
} finally {
|
|
281
|
-
w = i, m = s;
|
|
282
|
-
}
|
|
283
|
-
(!e.updatedAt || e.updatedAt <= n) && (e.updatedAt != null && "observers" in e ? Lt(e, r) : e.value = r, e.updatedAt = n);
|
|
284
|
-
}
|
|
285
|
-
function Qe(e, t, n, r = $, s) {
|
|
286
|
-
const i = {
|
|
287
|
-
fn: e,
|
|
288
|
-
state: r,
|
|
289
|
-
updatedAt: null,
|
|
290
|
-
owned: null,
|
|
291
|
-
sources: null,
|
|
292
|
-
sourceSlots: null,
|
|
293
|
-
cleanups: null,
|
|
294
|
-
value: t,
|
|
295
|
-
owner: m,
|
|
296
|
-
context: m ? m.context : null,
|
|
297
|
-
pure: n
|
|
298
|
-
};
|
|
299
|
-
return m === null || m !== Rt && (m.owned ? m.owned.push(i) : m.owned = [i]), i;
|
|
300
|
-
}
|
|
301
|
-
function Fe(e) {
|
|
302
|
-
if (e.state === 0) return;
|
|
303
|
-
if (e.state === je) return Ue(e);
|
|
304
|
-
if (e.suspense && x(e.suspense.inFallback)) return e.suspense.effects.push(e);
|
|
305
|
-
const t = [e];
|
|
306
|
-
for (; (e = e.owner) && (!e.updatedAt || e.updatedAt < Ke); )
|
|
307
|
-
e.state && t.push(e);
|
|
308
|
-
for (let n = t.length - 1; n >= 0; n--)
|
|
309
|
-
if (e = t[n], e.state === $)
|
|
310
|
-
de(e);
|
|
311
|
-
else if (e.state === je) {
|
|
312
|
-
const r = N;
|
|
313
|
-
N = null, L(() => Ue(e, t[0]), !1), N = r;
|
|
314
|
-
}
|
|
315
|
-
}
|
|
316
|
-
function L(e, t) {
|
|
317
|
-
if (N) return e();
|
|
318
|
-
let n = !1;
|
|
319
|
-
t || (N = []), _ ? n = !0 : _ = [], Ke++;
|
|
320
|
-
try {
|
|
321
|
-
const r = e();
|
|
322
|
-
return Sn(n), r;
|
|
323
|
-
} catch (r) {
|
|
324
|
-
n || (_ = null), N = null, ft(r);
|
|
325
|
-
}
|
|
326
|
-
}
|
|
327
|
-
function Sn(e) {
|
|
328
|
-
if (N && (_t(N), N = null), e) return;
|
|
329
|
-
const t = _;
|
|
330
|
-
_ = null, t.length && L(() => It(t), !1);
|
|
331
|
-
}
|
|
332
|
-
function _t(e) {
|
|
333
|
-
for (let t = 0; t < e.length; t++) Fe(e[t]);
|
|
334
|
-
}
|
|
335
|
-
function En(e) {
|
|
336
|
-
let t, n = 0;
|
|
337
|
-
for (t = 0; t < e.length; t++) {
|
|
338
|
-
const r = e[t];
|
|
339
|
-
r.user ? e[n++] = r : Fe(r);
|
|
340
|
-
}
|
|
341
|
-
if (h.context) {
|
|
342
|
-
if (h.count) {
|
|
343
|
-
h.effects || (h.effects = []), h.effects.push(...e.slice(0, n));
|
|
344
|
-
return;
|
|
345
|
-
}
|
|
346
|
-
he();
|
|
347
|
-
}
|
|
348
|
-
for (h.effects && (h.done || !h.count) && (e = [...h.effects, ...e], n += h.effects.length, delete h.effects), t = 0; t < n; t++) Fe(e[t]);
|
|
349
|
-
}
|
|
350
|
-
function Ue(e, t) {
|
|
351
|
-
e.state = 0;
|
|
352
|
-
for (let n = 0; n < e.sources.length; n += 1) {
|
|
353
|
-
const r = e.sources[n];
|
|
354
|
-
if (r.sources) {
|
|
355
|
-
const s = r.state;
|
|
356
|
-
s === $ ? r !== t && (!r.updatedAt || r.updatedAt < Ke) && Fe(r) : s === je && Ue(r, t);
|
|
357
|
-
}
|
|
358
|
-
}
|
|
359
|
-
}
|
|
360
|
-
function $t(e) {
|
|
361
|
-
for (let t = 0; t < e.observers.length; t += 1) {
|
|
362
|
-
const n = e.observers[t];
|
|
363
|
-
n.state || (n.state = je, n.pure ? N.push(n) : _.push(n), n.observers && $t(n));
|
|
364
|
-
}
|
|
365
|
-
}
|
|
366
|
-
function ve(e) {
|
|
367
|
-
let t;
|
|
368
|
-
if (e.sources)
|
|
369
|
-
for (; e.sources.length; ) {
|
|
370
|
-
const n = e.sources.pop(), r = e.sourceSlots.pop(), s = n.observers;
|
|
371
|
-
if (s && s.length) {
|
|
372
|
-
const i = s.pop(), o = n.observerSlots.pop();
|
|
373
|
-
r < s.length && (i.sourceSlots[o] = r, s[r] = i, n.observerSlots[r] = o);
|
|
374
|
-
}
|
|
375
|
-
}
|
|
376
|
-
if (e.tOwned) {
|
|
377
|
-
for (t = e.tOwned.length - 1; t >= 0; t--) ve(e.tOwned[t]);
|
|
378
|
-
delete e.tOwned;
|
|
379
|
-
}
|
|
380
|
-
if (e.owned) {
|
|
381
|
-
for (t = e.owned.length - 1; t >= 0; t--) ve(e.owned[t]);
|
|
382
|
-
e.owned = null;
|
|
383
|
-
}
|
|
384
|
-
if (e.cleanups) {
|
|
385
|
-
for (t = e.cleanups.length - 1; t >= 0; t--) e.cleanups[t]();
|
|
386
|
-
e.cleanups = null;
|
|
387
|
-
}
|
|
388
|
-
e.state = 0;
|
|
389
|
-
}
|
|
390
|
-
function et(e) {
|
|
391
|
-
return e instanceof Error ? e : new Error(typeof e == "string" ? e : "Unknown error", {
|
|
392
|
-
cause: e
|
|
393
|
-
});
|
|
394
|
-
}
|
|
395
|
-
function ft(e, t = m) {
|
|
396
|
-
throw et(e);
|
|
397
|
-
}
|
|
398
|
-
function tt(e) {
|
|
399
|
-
if (typeof e == "function" && !e.length) return tt(e());
|
|
400
|
-
if (Array.isArray(e)) {
|
|
401
|
-
const t = [];
|
|
402
|
-
for (let n = 0; n < e.length; n++) {
|
|
403
|
-
const r = tt(e[n]);
|
|
404
|
-
Array.isArray(r) ? t.push.apply(t, r) : t.push(r);
|
|
405
|
-
}
|
|
406
|
-
return t;
|
|
407
|
-
}
|
|
408
|
-
return e;
|
|
409
|
-
}
|
|
410
|
-
function An(e, t) {
|
|
411
|
-
return function(r) {
|
|
412
|
-
let s;
|
|
413
|
-
return Q(
|
|
414
|
-
() => s = x(() => (m.context = {
|
|
415
|
-
...m.context,
|
|
416
|
-
[e]: r.value
|
|
417
|
-
}, Dt(() => r.children))),
|
|
418
|
-
void 0
|
|
419
|
-
), s;
|
|
420
|
-
};
|
|
421
|
-
}
|
|
422
|
-
var nt = Symbol("fallback");
|
|
423
|
-
function qe(e) {
|
|
424
|
-
for (let t = 0; t < e.length; t++) e[t]();
|
|
425
|
-
}
|
|
426
|
-
function On(e, t, n = {}) {
|
|
427
|
-
let r = [], s = [], i = [], o = 0, l = t.length > 1 ? [] : null;
|
|
428
|
-
return me(() => qe(i)), () => {
|
|
429
|
-
let a = e() || [], u = a.length, f, c;
|
|
430
|
-
return a[Pt], x(() => {
|
|
431
|
-
let y, S, C, B, F, M, I, D, R;
|
|
432
|
-
if (u === 0)
|
|
433
|
-
o !== 0 && (qe(i), i = [], r = [], s = [], o = 0, l && (l = [])), n.fallback && (r = [nt], s[0] = K((Ge) => (i[0] = Ge, n.fallback())), o = 1);
|
|
434
|
-
else if (o === 0) {
|
|
435
|
-
for (s = new Array(u), c = 0; c < u; c++)
|
|
436
|
-
r[c] = a[c], s[c] = K(g);
|
|
437
|
-
o = u;
|
|
438
|
-
} else {
|
|
439
|
-
for (C = new Array(u), B = new Array(u), l && (F = new Array(u)), M = 0, I = Math.min(o, u); M < I && r[M] === a[M]; M++) ;
|
|
440
|
-
for (I = o - 1, D = u - 1; I >= M && D >= M && r[I] === a[D]; I--, D--)
|
|
441
|
-
C[D] = s[I], B[D] = i[I], l && (F[D] = l[I]);
|
|
442
|
-
for (y = /* @__PURE__ */ new Map(), S = new Array(D + 1), c = D; c >= M; c--)
|
|
443
|
-
R = a[c], f = y.get(R), S[c] = f === void 0 ? -1 : f, y.set(R, c);
|
|
444
|
-
for (f = M; f <= I; f++)
|
|
445
|
-
R = r[f], c = y.get(R), c !== void 0 && c !== -1 ? (C[c] = s[f], B[c] = i[f], l && (F[c] = l[f]), c = S[c], y.set(R, c)) : i[f]();
|
|
446
|
-
for (c = M; c < u; c++)
|
|
447
|
-
c in C ? (s[c] = C[c], i[c] = B[c], l && (l[c] = F[c], l[c](c))) : s[c] = K(g);
|
|
448
|
-
s = s.slice(0, o = u), r = a.slice(0);
|
|
449
|
-
}
|
|
450
|
-
return s;
|
|
451
|
-
});
|
|
452
|
-
function g(y) {
|
|
453
|
-
if (i[c] = y, l) {
|
|
454
|
-
const [S, C] = E(c);
|
|
455
|
-
return l[c] = C, t(a[c], S);
|
|
456
|
-
}
|
|
457
|
-
return t(a[c]);
|
|
458
|
-
}
|
|
459
|
-
};
|
|
460
|
-
}
|
|
461
|
-
function Cn(e, t, n = {}) {
|
|
462
|
-
let r = [], s = [], i = [], o = [], l = 0, a;
|
|
463
|
-
return me(() => qe(i)), () => {
|
|
464
|
-
const u = e() || [], f = u.length;
|
|
465
|
-
return u[Pt], x(() => {
|
|
466
|
-
if (f === 0)
|
|
467
|
-
return l !== 0 && (qe(i), i = [], r = [], s = [], l = 0, o = []), n.fallback && (r = [nt], s[0] = K((g) => (i[0] = g, n.fallback())), l = 1), s;
|
|
468
|
-
for (r[0] === nt && (i[0](), i = [], r = [], s = [], l = 0), a = 0; a < f; a++)
|
|
469
|
-
a < r.length && r[a] !== u[a] ? o[a](() => u[a]) : a >= r.length && (s[a] = K(c));
|
|
470
|
-
for (; a < r.length; a++)
|
|
471
|
-
i[a]();
|
|
472
|
-
return l = o.length = i.length = f, r = u.slice(0), s = s.slice(0, l);
|
|
473
|
-
});
|
|
474
|
-
function c(g) {
|
|
475
|
-
i[a] = g;
|
|
476
|
-
const [y, S] = E(u[a]);
|
|
477
|
-
return o[a] = S, t(y, a);
|
|
478
|
-
}
|
|
479
|
-
};
|
|
480
|
-
}
|
|
481
|
-
function Bt(e, t) {
|
|
482
|
-
return x(() => e(t || {}));
|
|
483
|
-
}
|
|
484
|
-
function Re() {
|
|
485
|
-
return !0;
|
|
486
|
-
}
|
|
487
|
-
var rt = {
|
|
488
|
-
get(e, t, n) {
|
|
489
|
-
return t === $e ? n : e.get(t);
|
|
490
|
-
},
|
|
491
|
-
has(e, t) {
|
|
492
|
-
return t === $e ? !0 : e.has(t);
|
|
493
|
-
},
|
|
494
|
-
set: Re,
|
|
495
|
-
deleteProperty: Re,
|
|
496
|
-
getOwnPropertyDescriptor(e, t) {
|
|
497
|
-
return {
|
|
498
|
-
configurable: !0,
|
|
499
|
-
enumerable: !0,
|
|
500
|
-
get() {
|
|
501
|
-
return e.get(t);
|
|
502
|
-
},
|
|
503
|
-
set: Re,
|
|
504
|
-
deleteProperty: Re
|
|
505
|
-
};
|
|
506
|
-
},
|
|
507
|
-
ownKeys(e) {
|
|
508
|
-
return e.keys();
|
|
509
|
-
}
|
|
510
|
-
};
|
|
511
|
-
function Ze(e) {
|
|
512
|
-
return (e = typeof e == "function" ? e() : e) ? e : {};
|
|
513
|
-
}
|
|
514
|
-
function Tn() {
|
|
515
|
-
for (let e = 0, t = this.length; e < t; ++e) {
|
|
516
|
-
const n = this[e]();
|
|
517
|
-
if (n !== void 0) return n;
|
|
518
|
-
}
|
|
519
|
-
}
|
|
520
|
-
function jt(...e) {
|
|
521
|
-
let t = !1;
|
|
522
|
-
for (let o = 0; o < e.length; o++) {
|
|
523
|
-
const l = e[o];
|
|
524
|
-
t = t || !!l && $e in l, e[o] = typeof l == "function" ? (t = !0, T(l)) : l;
|
|
525
|
-
}
|
|
526
|
-
if (kt && t)
|
|
527
|
-
return new Proxy(
|
|
528
|
-
{
|
|
529
|
-
get(o) {
|
|
530
|
-
for (let l = e.length - 1; l >= 0; l--) {
|
|
531
|
-
const a = Ze(e[l])[o];
|
|
532
|
-
if (a !== void 0) return a;
|
|
533
|
-
}
|
|
534
|
-
},
|
|
535
|
-
has(o) {
|
|
536
|
-
for (let l = e.length - 1; l >= 0; l--)
|
|
537
|
-
if (o in Ze(e[l])) return !0;
|
|
538
|
-
return !1;
|
|
539
|
-
},
|
|
540
|
-
keys() {
|
|
541
|
-
const o = [];
|
|
542
|
-
for (let l = 0; l < e.length; l++)
|
|
543
|
-
o.push(...Object.keys(Ze(e[l])));
|
|
544
|
-
return [...new Set(o)];
|
|
545
|
-
}
|
|
546
|
-
},
|
|
547
|
-
rt
|
|
548
|
-
);
|
|
549
|
-
const n = {}, r = /* @__PURE__ */ Object.create(null);
|
|
550
|
-
for (let o = e.length - 1; o >= 0; o--) {
|
|
551
|
-
const l = e[o];
|
|
552
|
-
if (!l) continue;
|
|
553
|
-
const a = Object.getOwnPropertyNames(l);
|
|
554
|
-
for (let u = a.length - 1; u >= 0; u--) {
|
|
555
|
-
const f = a[u];
|
|
556
|
-
if (f === "__proto__" || f === "constructor") continue;
|
|
557
|
-
const c = Object.getOwnPropertyDescriptor(l, f);
|
|
558
|
-
if (!r[f])
|
|
559
|
-
r[f] = c.get ? {
|
|
560
|
-
enumerable: !0,
|
|
561
|
-
configurable: !0,
|
|
562
|
-
get: Tn.bind(n[f] = [c.get.bind(l)])
|
|
563
|
-
} : c.value !== void 0 ? c : void 0;
|
|
564
|
-
else {
|
|
565
|
-
const g = n[f];
|
|
566
|
-
g && (c.get ? g.push(c.get.bind(l)) : c.value !== void 0 && g.push(() => c.value));
|
|
567
|
-
}
|
|
568
|
-
}
|
|
569
|
-
}
|
|
570
|
-
const s = {}, i = Object.keys(r);
|
|
571
|
-
for (let o = i.length - 1; o >= 0; o--) {
|
|
572
|
-
const l = i[o], a = r[l];
|
|
573
|
-
a && a.get ? Object.defineProperty(s, l, a) : s[l] = a ? a.value : void 0;
|
|
574
|
-
}
|
|
575
|
-
return s;
|
|
576
|
-
}
|
|
577
|
-
function xn(e, ...t) {
|
|
578
|
-
if (kt && $e in e) {
|
|
579
|
-
const s = new Set(t.length > 1 ? t.flat() : t[0]), i = t.map((o) => new Proxy(
|
|
580
|
-
{
|
|
581
|
-
get(l) {
|
|
582
|
-
return o.includes(l) ? e[l] : void 0;
|
|
583
|
-
},
|
|
584
|
-
has(l) {
|
|
585
|
-
return o.includes(l) && l in e;
|
|
586
|
-
},
|
|
587
|
-
keys() {
|
|
588
|
-
return o.filter((l) => l in e);
|
|
589
|
-
}
|
|
590
|
-
},
|
|
591
|
-
rt
|
|
592
|
-
));
|
|
593
|
-
return i.push(
|
|
594
|
-
new Proxy(
|
|
595
|
-
{
|
|
596
|
-
get(o) {
|
|
597
|
-
return s.has(o) ? void 0 : e[o];
|
|
598
|
-
},
|
|
599
|
-
has(o) {
|
|
600
|
-
return s.has(o) ? !1 : o in e;
|
|
601
|
-
},
|
|
602
|
-
keys() {
|
|
603
|
-
return Object.keys(e).filter((o) => !s.has(o));
|
|
604
|
-
}
|
|
605
|
-
},
|
|
606
|
-
rt
|
|
607
|
-
)
|
|
608
|
-
), i;
|
|
609
|
-
}
|
|
610
|
-
const n = {}, r = t.map(() => ({}));
|
|
611
|
-
for (const s of Object.getOwnPropertyNames(e)) {
|
|
612
|
-
const i = Object.getOwnPropertyDescriptor(e, s), o = !i.get && !i.set && i.enumerable && i.writable && i.configurable;
|
|
613
|
-
let l = !1, a = 0;
|
|
614
|
-
for (const u of t)
|
|
615
|
-
u.includes(s) && (l = !0, o ? r[a][s] = i.value : Object.defineProperty(r[a], s, i)), ++a;
|
|
616
|
-
l || (o ? n[s] = i.value : Object.defineProperty(n, s, i));
|
|
617
|
-
}
|
|
618
|
-
return [...r, n];
|
|
619
|
-
}
|
|
620
|
-
function Ft(e) {
|
|
621
|
-
let t, n;
|
|
622
|
-
const r = (s) => {
|
|
623
|
-
const i = h.context;
|
|
624
|
-
if (i) {
|
|
625
|
-
const [l, a] = E();
|
|
626
|
-
h.count || (h.count = 0), h.count++, (n || (n = e())).then((u) => {
|
|
627
|
-
!h.done && he(i), h.count--, a(() => u.default), he();
|
|
628
|
-
}), t = l;
|
|
629
|
-
} else if (!t) {
|
|
630
|
-
const [l] = gn(() => (n || (n = e())).then((a) => a.default));
|
|
631
|
-
t = l;
|
|
632
|
-
}
|
|
633
|
-
let o;
|
|
634
|
-
return T(
|
|
635
|
-
() => (o = t()) ? x(() => {
|
|
636
|
-
if (!i || h.done) return o(s);
|
|
637
|
-
const l = h.context;
|
|
638
|
-
he(i);
|
|
639
|
-
const a = o(s);
|
|
640
|
-
return he(l), a;
|
|
641
|
-
}) : ""
|
|
642
|
-
);
|
|
643
|
-
};
|
|
644
|
-
return r.preload = () => n || ((n = e()).then((s) => t = () => s.default), n), r;
|
|
645
|
-
}
|
|
646
|
-
var Nn = 0;
|
|
647
|
-
function Hr() {
|
|
648
|
-
return h.context ? h.getNextContextId() : `cl-${Nn++}`;
|
|
649
|
-
}
|
|
650
|
-
var Ut = (e) => `Stale read from <${e}>.`;
|
|
651
|
-
function Xr(e) {
|
|
652
|
-
const t = "fallback" in e && {
|
|
653
|
-
fallback: () => e.fallback
|
|
654
|
-
};
|
|
655
|
-
return T(On(() => e.each, e.children, t || void 0));
|
|
656
|
-
}
|
|
657
|
-
function Wr(e) {
|
|
658
|
-
const t = "fallback" in e && {
|
|
659
|
-
fallback: () => e.fallback
|
|
660
|
-
};
|
|
661
|
-
return T(Cn(() => e.each, e.children, t || void 0));
|
|
662
|
-
}
|
|
663
|
-
function Yr(e) {
|
|
664
|
-
const t = e.keyed, n = T(() => e.when, void 0, void 0), r = t ? n : T(n, void 0, {
|
|
665
|
-
equals: (s, i) => !s == !i
|
|
666
|
-
});
|
|
667
|
-
return T(
|
|
668
|
-
() => {
|
|
669
|
-
const s = r();
|
|
670
|
-
if (s) {
|
|
671
|
-
const i = e.children;
|
|
672
|
-
return typeof i == "function" && i.length > 0 ? x(
|
|
673
|
-
() => i(
|
|
674
|
-
t ? s : () => {
|
|
675
|
-
if (!x(r)) throw Ut("Show");
|
|
676
|
-
return n();
|
|
677
|
-
}
|
|
678
|
-
)
|
|
679
|
-
) : i;
|
|
680
|
-
}
|
|
681
|
-
return e.fallback;
|
|
682
|
-
},
|
|
683
|
-
void 0,
|
|
684
|
-
void 0
|
|
685
|
-
);
|
|
686
|
-
}
|
|
687
|
-
function Zr(e) {
|
|
688
|
-
const t = Dt(() => e.children), n = T(() => {
|
|
689
|
-
const r = t(), s = Array.isArray(r) ? r : [r];
|
|
690
|
-
let i = () => {
|
|
691
|
-
};
|
|
692
|
-
for (let o = 0; o < s.length; o++) {
|
|
693
|
-
const l = o, a = s[o], u = i, f = T(
|
|
694
|
-
() => u() ? void 0 : a.when,
|
|
695
|
-
void 0,
|
|
696
|
-
void 0
|
|
697
|
-
), c = a.keyed ? f : T(f, void 0, {
|
|
698
|
-
equals: (g, y) => !g == !y
|
|
699
|
-
});
|
|
700
|
-
i = () => u() || (c() ? [l, f, a] : void 0);
|
|
701
|
-
}
|
|
702
|
-
return i;
|
|
703
|
-
});
|
|
704
|
-
return T(
|
|
705
|
-
() => {
|
|
706
|
-
const r = n()();
|
|
707
|
-
if (!r) return e.fallback;
|
|
708
|
-
const [s, i, o] = r, l = o.children;
|
|
709
|
-
return typeof l == "function" && l.length > 0 ? x(
|
|
710
|
-
() => l(
|
|
711
|
-
o.keyed ? i() : () => {
|
|
712
|
-
var u;
|
|
713
|
-
if (((u = x(n)()) == null ? void 0 : u[0]) !== s) throw Ut("Match");
|
|
714
|
-
return i();
|
|
715
|
-
}
|
|
716
|
-
)
|
|
717
|
-
) : l;
|
|
718
|
-
},
|
|
719
|
-
void 0,
|
|
720
|
-
void 0
|
|
721
|
-
);
|
|
722
|
-
}
|
|
723
|
-
function Jr(e) {
|
|
724
|
-
return e;
|
|
725
|
-
}
|
|
726
|
-
var kn = [
|
|
727
|
-
"allowfullscreen",
|
|
728
|
-
"async",
|
|
729
|
-
"autofocus",
|
|
730
|
-
"autoplay",
|
|
731
|
-
"checked",
|
|
732
|
-
"controls",
|
|
733
|
-
"default",
|
|
734
|
-
"disabled",
|
|
735
|
-
"formnovalidate",
|
|
736
|
-
"hidden",
|
|
737
|
-
"indeterminate",
|
|
738
|
-
"inert",
|
|
739
|
-
"ismap",
|
|
740
|
-
"loop",
|
|
741
|
-
"multiple",
|
|
742
|
-
"muted",
|
|
743
|
-
"nomodule",
|
|
744
|
-
"novalidate",
|
|
745
|
-
"open",
|
|
746
|
-
"playsinline",
|
|
747
|
-
"readonly",
|
|
748
|
-
"required",
|
|
749
|
-
"reversed",
|
|
750
|
-
"seamless",
|
|
751
|
-
"selected"
|
|
752
|
-
], Pn = /* @__PURE__ */ new Set([
|
|
753
|
-
"className",
|
|
754
|
-
"value",
|
|
755
|
-
"readOnly",
|
|
756
|
-
"formNoValidate",
|
|
757
|
-
"isMap",
|
|
758
|
-
"noModule",
|
|
759
|
-
"playsInline",
|
|
760
|
-
...kn
|
|
761
|
-
]), In = /* @__PURE__ */ new Set([
|
|
762
|
-
"innerHTML",
|
|
763
|
-
"textContent",
|
|
764
|
-
"innerText",
|
|
765
|
-
"children"
|
|
766
|
-
]), Rn = /* @__PURE__ */ Object.assign(/* @__PURE__ */ Object.create(null), {
|
|
767
|
-
className: "class",
|
|
768
|
-
htmlFor: "for"
|
|
769
|
-
}), Mn = /* @__PURE__ */ Object.assign(/* @__PURE__ */ Object.create(null), {
|
|
770
|
-
class: "className",
|
|
771
|
-
formnovalidate: {
|
|
772
|
-
$: "formNoValidate",
|
|
773
|
-
BUTTON: 1,
|
|
774
|
-
INPUT: 1
|
|
775
|
-
},
|
|
776
|
-
ismap: {
|
|
777
|
-
$: "isMap",
|
|
778
|
-
IMG: 1
|
|
779
|
-
},
|
|
780
|
-
nomodule: {
|
|
781
|
-
$: "noModule",
|
|
782
|
-
SCRIPT: 1
|
|
783
|
-
},
|
|
784
|
-
playsinline: {
|
|
785
|
-
$: "playsInline",
|
|
786
|
-
VIDEO: 1
|
|
787
|
-
},
|
|
788
|
-
readonly: {
|
|
789
|
-
$: "readOnly",
|
|
790
|
-
INPUT: 1,
|
|
791
|
-
TEXTAREA: 1
|
|
792
|
-
}
|
|
793
|
-
});
|
|
794
|
-
function Dn(e, t) {
|
|
795
|
-
const n = Mn[e];
|
|
796
|
-
return typeof n == "object" ? n[t] ? n.$ : void 0 : n;
|
|
797
|
-
}
|
|
798
|
-
var Vn = /* @__PURE__ */ new Set([
|
|
799
|
-
"beforeinput",
|
|
800
|
-
"click",
|
|
801
|
-
"dblclick",
|
|
802
|
-
"contextmenu",
|
|
803
|
-
"focusin",
|
|
804
|
-
"focusout",
|
|
805
|
-
"input",
|
|
806
|
-
"keydown",
|
|
807
|
-
"keyup",
|
|
808
|
-
"mousedown",
|
|
809
|
-
"mousemove",
|
|
810
|
-
"mouseout",
|
|
811
|
-
"mouseover",
|
|
812
|
-
"mouseup",
|
|
813
|
-
"pointerdown",
|
|
814
|
-
"pointermove",
|
|
815
|
-
"pointerout",
|
|
816
|
-
"pointerover",
|
|
817
|
-
"pointerup",
|
|
818
|
-
"touchend",
|
|
819
|
-
"touchmove",
|
|
820
|
-
"touchstart"
|
|
821
|
-
]), Ln = /* @__PURE__ */ new Set([
|
|
822
|
-
"altGlyph",
|
|
823
|
-
"altGlyphDef",
|
|
824
|
-
"altGlyphItem",
|
|
825
|
-
"animate",
|
|
826
|
-
"animateColor",
|
|
827
|
-
"animateMotion",
|
|
828
|
-
"animateTransform",
|
|
829
|
-
"circle",
|
|
830
|
-
"clipPath",
|
|
831
|
-
"color-profile",
|
|
832
|
-
"cursor",
|
|
833
|
-
"defs",
|
|
834
|
-
"desc",
|
|
835
|
-
"ellipse",
|
|
836
|
-
"feBlend",
|
|
837
|
-
"feColorMatrix",
|
|
838
|
-
"feComponentTransfer",
|
|
839
|
-
"feComposite",
|
|
840
|
-
"feConvolveMatrix",
|
|
841
|
-
"feDiffuseLighting",
|
|
842
|
-
"feDisplacementMap",
|
|
843
|
-
"feDistantLight",
|
|
844
|
-
"feDropShadow",
|
|
845
|
-
"feFlood",
|
|
846
|
-
"feFuncA",
|
|
847
|
-
"feFuncB",
|
|
848
|
-
"feFuncG",
|
|
849
|
-
"feFuncR",
|
|
850
|
-
"feGaussianBlur",
|
|
851
|
-
"feImage",
|
|
852
|
-
"feMerge",
|
|
853
|
-
"feMergeNode",
|
|
854
|
-
"feMorphology",
|
|
855
|
-
"feOffset",
|
|
856
|
-
"fePointLight",
|
|
857
|
-
"feSpecularLighting",
|
|
858
|
-
"feSpotLight",
|
|
859
|
-
"feTile",
|
|
860
|
-
"feTurbulence",
|
|
861
|
-
"filter",
|
|
862
|
-
"font",
|
|
863
|
-
"font-face",
|
|
864
|
-
"font-face-format",
|
|
865
|
-
"font-face-name",
|
|
866
|
-
"font-face-src",
|
|
867
|
-
"font-face-uri",
|
|
868
|
-
"foreignObject",
|
|
869
|
-
"g",
|
|
870
|
-
"glyph",
|
|
871
|
-
"glyphRef",
|
|
872
|
-
"hkern",
|
|
873
|
-
"image",
|
|
874
|
-
"line",
|
|
875
|
-
"linearGradient",
|
|
876
|
-
"marker",
|
|
877
|
-
"mask",
|
|
878
|
-
"metadata",
|
|
879
|
-
"missing-glyph",
|
|
880
|
-
"mpath",
|
|
881
|
-
"path",
|
|
882
|
-
"pattern",
|
|
883
|
-
"polygon",
|
|
884
|
-
"polyline",
|
|
885
|
-
"radialGradient",
|
|
886
|
-
"rect",
|
|
887
|
-
"set",
|
|
888
|
-
"stop",
|
|
889
|
-
"svg",
|
|
890
|
-
"switch",
|
|
891
|
-
"symbol",
|
|
892
|
-
"text",
|
|
893
|
-
"textPath",
|
|
894
|
-
"tref",
|
|
895
|
-
"tspan",
|
|
896
|
-
"use",
|
|
897
|
-
"view",
|
|
898
|
-
"vkern"
|
|
899
|
-
]), _n = {
|
|
900
|
-
xlink: "http://www.w3.org/1999/xlink",
|
|
901
|
-
xml: "http://www.w3.org/XML/1998/namespace"
|
|
902
|
-
};
|
|
903
|
-
function $n(e, t, n) {
|
|
904
|
-
let r = n.length, s = t.length, i = r, o = 0, l = 0, a = t[s - 1].nextSibling, u = null;
|
|
905
|
-
for (; o < s || l < i; ) {
|
|
906
|
-
if (t[o] === n[l]) {
|
|
907
|
-
o++, l++;
|
|
908
|
-
continue;
|
|
909
|
-
}
|
|
910
|
-
for (; t[s - 1] === n[i - 1]; )
|
|
911
|
-
s--, i--;
|
|
912
|
-
if (s === o) {
|
|
913
|
-
const f = i < r ? l ? n[l - 1].nextSibling : n[i - l] : a;
|
|
914
|
-
for (; l < i; ) e.insertBefore(n[l++], f);
|
|
915
|
-
} else if (i === l)
|
|
916
|
-
for (; o < s; )
|
|
917
|
-
(!u || !u.has(t[o])) && t[o].remove(), o++;
|
|
918
|
-
else if (t[o] === n[i - 1] && n[l] === t[s - 1]) {
|
|
919
|
-
const f = t[--s].nextSibling;
|
|
920
|
-
e.insertBefore(n[l++], t[o++].nextSibling), e.insertBefore(n[--i], f), t[s] = n[i];
|
|
921
|
-
} else {
|
|
922
|
-
if (!u) {
|
|
923
|
-
u = /* @__PURE__ */ new Map();
|
|
924
|
-
let c = l;
|
|
925
|
-
for (; c < i; ) u.set(n[c], c++);
|
|
926
|
-
}
|
|
927
|
-
const f = u.get(t[o]);
|
|
928
|
-
if (f != null)
|
|
929
|
-
if (l < f && f < i) {
|
|
930
|
-
let c = o, g = 1, y;
|
|
931
|
-
for (; ++c < s && c < i && !((y = u.get(t[c])) == null || y !== f + g); )
|
|
932
|
-
g++;
|
|
933
|
-
if (g > f - l) {
|
|
934
|
-
const S = t[o];
|
|
935
|
-
for (; l < f; ) e.insertBefore(n[l++], S);
|
|
936
|
-
} else e.replaceChild(n[l++], t[o++]);
|
|
937
|
-
} else o++;
|
|
938
|
-
else t[o++].remove();
|
|
939
|
-
}
|
|
940
|
-
}
|
|
941
|
-
}
|
|
942
|
-
var ge = "_$DX_DELEGATE";
|
|
943
|
-
function qt(e, t, n, r = {}) {
|
|
944
|
-
let s;
|
|
945
|
-
return K((i) => {
|
|
946
|
-
s = i, t === document ? e() : it(t, e(), t.firstChild ? null : void 0, n);
|
|
947
|
-
}, r.owner), () => {
|
|
948
|
-
s(), t.textContent = "";
|
|
949
|
-
};
|
|
950
|
-
}
|
|
951
|
-
function es(e, t, n, r) {
|
|
952
|
-
let s;
|
|
953
|
-
const i = () => {
|
|
954
|
-
const l = document.createElement("template");
|
|
955
|
-
return l.innerHTML = e, l.content.firstChild;
|
|
956
|
-
}, o = () => (s || (s = i())).cloneNode(!0);
|
|
957
|
-
return o.cloneNode = o, o;
|
|
958
|
-
}
|
|
959
|
-
function Bn(e, t = window.document) {
|
|
960
|
-
const n = t[ge] || (t[ge] = /* @__PURE__ */ new Set());
|
|
961
|
-
for (let r = 0, s = e.length; r < s; r++) {
|
|
962
|
-
const i = e[r];
|
|
963
|
-
n.has(i) || (n.add(i), t.addEventListener(i, Kt));
|
|
964
|
-
}
|
|
965
|
-
}
|
|
966
|
-
function ts(e = window.document) {
|
|
967
|
-
if (e[ge]) {
|
|
968
|
-
for (let t of e[ge].keys()) e.removeEventListener(t, Kt);
|
|
969
|
-
delete e[ge];
|
|
970
|
-
}
|
|
971
|
-
}
|
|
972
|
-
function st(e, t, n) {
|
|
973
|
-
z(e) || (n == null ? e.removeAttribute(t) : e.setAttribute(t, n));
|
|
974
|
-
}
|
|
975
|
-
function jn(e, t, n, r) {
|
|
976
|
-
z(e) || (r == null ? e.removeAttributeNS(t, n) : e.setAttributeNS(t, n, r));
|
|
977
|
-
}
|
|
978
|
-
function Fn(e, t, n) {
|
|
979
|
-
z(e) || (n ? e.setAttribute(t, "") : e.removeAttribute(t));
|
|
980
|
-
}
|
|
981
|
-
function Un(e, t) {
|
|
982
|
-
z(e) || (t == null ? e.removeAttribute("class") : e.className = t);
|
|
983
|
-
}
|
|
984
|
-
function qn(e, t, n, r) {
|
|
985
|
-
if (r)
|
|
986
|
-
Array.isArray(n) ? (e[`$$${t}`] = n[0], e[`$$${t}Data`] = n[1]) : e[`$$${t}`] = n;
|
|
987
|
-
else if (Array.isArray(n)) {
|
|
988
|
-
const s = n[0];
|
|
989
|
-
e.addEventListener(t, n[0] = (i) => s.call(e, n[1], i));
|
|
990
|
-
} else e.addEventListener(t, n, typeof n != "function" && n);
|
|
991
|
-
}
|
|
992
|
-
function Kn(e, t, n = {}) {
|
|
993
|
-
const r = Object.keys(t || {}), s = Object.keys(n);
|
|
994
|
-
let i, o;
|
|
995
|
-
for (i = 0, o = s.length; i < o; i++) {
|
|
996
|
-
const l = s[i];
|
|
997
|
-
!l || l === "undefined" || t[l] || (mt(e, l, !1), delete n[l]);
|
|
998
|
-
}
|
|
999
|
-
for (i = 0, o = r.length; i < o; i++) {
|
|
1000
|
-
const l = r[i], a = !!t[l];
|
|
1001
|
-
!l || l === "undefined" || n[l] === a || !a || (mt(e, l, !0), n[l] = a);
|
|
1002
|
-
}
|
|
1003
|
-
return n;
|
|
1004
|
-
}
|
|
1005
|
-
function Qn(e, t, n) {
|
|
1006
|
-
if (!t) return n ? st(e, "style") : t;
|
|
1007
|
-
const r = e.style;
|
|
1008
|
-
if (typeof t == "string") return r.cssText = t;
|
|
1009
|
-
typeof n == "string" && (r.cssText = n = void 0), n || (n = {}), t || (t = {});
|
|
1010
|
-
let s, i;
|
|
1011
|
-
for (i in n)
|
|
1012
|
-
t[i] == null && r.removeProperty(i), delete n[i];
|
|
1013
|
-
for (i in t)
|
|
1014
|
-
s = t[i], s !== n[i] && (r.setProperty(i, s), n[i] = s);
|
|
1015
|
-
return n;
|
|
1016
|
-
}
|
|
1017
|
-
function zn(e, t = {}, n, r) {
|
|
1018
|
-
const s = {};
|
|
1019
|
-
return r || Q(
|
|
1020
|
-
() => s.children = pe(e, t.children, s.children)
|
|
1021
|
-
), Q(() => typeof t.ref == "function" && Gn(t.ref, e)), Q(() => Hn(e, t, n, !0, s, !0)), s;
|
|
1022
|
-
}
|
|
1023
|
-
function Gn(e, t, n) {
|
|
1024
|
-
return x(() => e(t, n));
|
|
1025
|
-
}
|
|
1026
|
-
function it(e, t, n, r) {
|
|
1027
|
-
if (n !== void 0 && !r && (r = []), typeof t != "function") return pe(e, t, r, n);
|
|
1028
|
-
Q((s) => pe(e, t(), s, n), r);
|
|
1029
|
-
}
|
|
1030
|
-
function Hn(e, t, n, r, s = {}, i = !1) {
|
|
1031
|
-
t || (t = {});
|
|
1032
|
-
for (const o in s)
|
|
1033
|
-
if (!(o in t)) {
|
|
1034
|
-
if (o === "children") continue;
|
|
1035
|
-
s[o] = vt(e, o, null, s[o], n, i, t);
|
|
1036
|
-
}
|
|
1037
|
-
for (const o in t) {
|
|
1038
|
-
if (o === "children")
|
|
1039
|
-
continue;
|
|
1040
|
-
const l = t[o];
|
|
1041
|
-
s[o] = vt(e, o, l, s[o], n, i, t);
|
|
1042
|
-
}
|
|
1043
|
-
}
|
|
1044
|
-
function Xn(e) {
|
|
1045
|
-
let t, n;
|
|
1046
|
-
return !z() || !(t = h.registry.get(n = Yn())) ? e() : (h.completed && h.completed.add(t), h.registry.delete(n), t);
|
|
1047
|
-
}
|
|
1048
|
-
function z(e) {
|
|
1049
|
-
return !!h.context && !h.done && (!e || e.isConnected);
|
|
1050
|
-
}
|
|
1051
|
-
function Wn(e) {
|
|
1052
|
-
return e.toLowerCase().replace(/-([a-z])/g, (t, n) => n.toUpperCase());
|
|
1053
|
-
}
|
|
1054
|
-
function mt(e, t, n) {
|
|
1055
|
-
const r = t.trim().split(/\s+/);
|
|
1056
|
-
for (let s = 0, i = r.length; s < i; s++)
|
|
1057
|
-
e.classList.toggle(r[s], n);
|
|
1058
|
-
}
|
|
1059
|
-
function vt(e, t, n, r, s, i, o) {
|
|
1060
|
-
let l, a, u, f, c;
|
|
1061
|
-
if (t === "style") return Qn(e, n, r);
|
|
1062
|
-
if (t === "classList") return Kn(e, n, r);
|
|
1063
|
-
if (n === r) return r;
|
|
1064
|
-
if (t === "ref")
|
|
1065
|
-
i || n(e);
|
|
1066
|
-
else if (t.slice(0, 3) === "on:") {
|
|
1067
|
-
const g = t.slice(3);
|
|
1068
|
-
r && e.removeEventListener(g, r, typeof r != "function" && r), n && e.addEventListener(g, n, typeof n != "function" && n);
|
|
1069
|
-
} else if (t.slice(0, 10) === "oncapture:") {
|
|
1070
|
-
const g = t.slice(10);
|
|
1071
|
-
r && e.removeEventListener(g, r, !0), n && e.addEventListener(g, n, !0);
|
|
1072
|
-
} else if (t.slice(0, 2) === "on") {
|
|
1073
|
-
const g = t.slice(2).toLowerCase(), y = Vn.has(g);
|
|
1074
|
-
if (!y && r) {
|
|
1075
|
-
const S = Array.isArray(r) ? r[0] : r;
|
|
1076
|
-
e.removeEventListener(g, S);
|
|
1077
|
-
}
|
|
1078
|
-
(y || n) && (qn(e, g, n, y), y && Bn([g]));
|
|
1079
|
-
} else if (t.slice(0, 5) === "attr:")
|
|
1080
|
-
st(e, t.slice(5), n);
|
|
1081
|
-
else if (t.slice(0, 5) === "bool:")
|
|
1082
|
-
Fn(e, t.slice(5), n);
|
|
1083
|
-
else if ((c = t.slice(0, 5) === "prop:") || (u = In.has(t)) || !s && ((f = Dn(t, e.tagName)) || (a = Pn.has(t))) || (l = e.nodeName.includes("-") || "is" in o)) {
|
|
1084
|
-
if (c)
|
|
1085
|
-
t = t.slice(5), a = !0;
|
|
1086
|
-
else if (z(e)) return n;
|
|
1087
|
-
t === "class" || t === "className" ? Un(e, n) : l && !a && !u ? e[Wn(t)] = n : e[f || t] = n;
|
|
1088
|
-
} else {
|
|
1089
|
-
const g = s && t.indexOf(":") > -1 && _n[t.split(":")[0]];
|
|
1090
|
-
g ? jn(e, g, t, n) : st(e, Rn[t] || t, n);
|
|
1091
|
-
}
|
|
1092
|
-
return n;
|
|
1093
|
-
}
|
|
1094
|
-
function Kt(e) {
|
|
1095
|
-
if (h.registry && h.events && h.events.find(([a, u]) => u === e))
|
|
1096
|
-
return;
|
|
1097
|
-
let t = e.target;
|
|
1098
|
-
const n = `$$${e.type}`, r = e.target, s = e.currentTarget, i = (a) => Object.defineProperty(e, "target", {
|
|
1099
|
-
configurable: !0,
|
|
1100
|
-
value: a
|
|
1101
|
-
}), o = () => {
|
|
1102
|
-
const a = t[n];
|
|
1103
|
-
if (a && !t.disabled) {
|
|
1104
|
-
const u = t[`${n}Data`];
|
|
1105
|
-
if (u !== void 0 ? a.call(t, u, e) : a.call(t, e), e.cancelBubble) return;
|
|
1106
|
-
}
|
|
1107
|
-
return t.host && typeof t.host != "string" && !t.host._$host && t.contains(e.target) && i(t.host), !0;
|
|
1108
|
-
}, l = () => {
|
|
1109
|
-
for (; o() && (t = t._$host || t.parentNode || t.host); ) ;
|
|
1110
|
-
};
|
|
1111
|
-
if (Object.defineProperty(e, "currentTarget", {
|
|
1112
|
-
configurable: !0,
|
|
1113
|
-
get() {
|
|
1114
|
-
return t || document;
|
|
1115
|
-
}
|
|
1116
|
-
}), h.registry && !h.done && (h.done = _$HY.done = !0), e.composedPath) {
|
|
1117
|
-
const a = e.composedPath();
|
|
1118
|
-
i(a[0]);
|
|
1119
|
-
for (let u = 0; u < a.length - 2 && (t = a[u], !!o()); u++) {
|
|
1120
|
-
if (t._$host) {
|
|
1121
|
-
t = t._$host, l();
|
|
1122
|
-
break;
|
|
1123
|
-
}
|
|
1124
|
-
if (t.parentNode === s)
|
|
1125
|
-
break;
|
|
1126
|
-
}
|
|
1127
|
-
} else l();
|
|
1128
|
-
i(r);
|
|
1129
|
-
}
|
|
1130
|
-
function pe(e, t, n, r, s) {
|
|
1131
|
-
const i = z(e);
|
|
1132
|
-
if (i) {
|
|
1133
|
-
!n && (n = [...e.childNodes]);
|
|
1134
|
-
let a = [];
|
|
1135
|
-
for (let u = 0; u < n.length; u++) {
|
|
1136
|
-
const f = n[u];
|
|
1137
|
-
f.nodeType === 8 && f.data.slice(0, 2) === "!$" ? f.remove() : a.push(f);
|
|
1138
|
-
}
|
|
1139
|
-
n = a;
|
|
1140
|
-
}
|
|
1141
|
-
for (; typeof n == "function"; ) n = n();
|
|
1142
|
-
if (t === n) return n;
|
|
1143
|
-
const o = typeof t, l = r !== void 0;
|
|
1144
|
-
if (e = l && n[0] && n[0].parentNode || e, o === "string" || o === "number") {
|
|
1145
|
-
if (i || o === "number" && (t = t.toString(), t === n))
|
|
1146
|
-
return n;
|
|
1147
|
-
if (l) {
|
|
1148
|
-
let a = n[0];
|
|
1149
|
-
a && a.nodeType === 3 ? a.data !== t && (a.data = t) : a = document.createTextNode(t), n = H(e, n, r, a);
|
|
1150
|
-
} else
|
|
1151
|
-
n !== "" && typeof n == "string" ? n = e.firstChild.data = t : n = e.textContent = t;
|
|
1152
|
-
} else if (t == null || o === "boolean") {
|
|
1153
|
-
if (i) return n;
|
|
1154
|
-
n = H(e, n, r);
|
|
1155
|
-
} else {
|
|
1156
|
-
if (o === "function")
|
|
1157
|
-
return Q(() => {
|
|
1158
|
-
let a = t();
|
|
1159
|
-
for (; typeof a == "function"; ) a = a();
|
|
1160
|
-
n = pe(e, a, n, r);
|
|
1161
|
-
}), () => n;
|
|
1162
|
-
if (Array.isArray(t)) {
|
|
1163
|
-
const a = [], u = n && Array.isArray(n);
|
|
1164
|
-
if (ot(a, t, n, s))
|
|
1165
|
-
return Q(() => n = pe(e, a, n, r, !0)), () => n;
|
|
1166
|
-
if (i) {
|
|
1167
|
-
if (!a.length) return n;
|
|
1168
|
-
if (r === void 0) return n = [...e.childNodes];
|
|
1169
|
-
let f = a[0];
|
|
1170
|
-
if (f.parentNode !== e) return n;
|
|
1171
|
-
const c = [f];
|
|
1172
|
-
for (; (f = f.nextSibling) !== r; ) c.push(f);
|
|
1173
|
-
return n = c;
|
|
1174
|
-
}
|
|
1175
|
-
if (a.length === 0) {
|
|
1176
|
-
if (n = H(e, n, r), l) return n;
|
|
1177
|
-
} else u ? n.length === 0 ? pt(e, a, r) : $n(e, n, a) : (n && H(e), pt(e, a));
|
|
1178
|
-
n = a;
|
|
1179
|
-
} else if (t.nodeType) {
|
|
1180
|
-
if (i && t.parentNode) return n = l ? [t] : t;
|
|
1181
|
-
if (Array.isArray(n)) {
|
|
1182
|
-
if (l) return n = H(e, n, r, t);
|
|
1183
|
-
H(e, n, null, t);
|
|
1184
|
-
} else n == null || n === "" || !e.firstChild ? e.appendChild(t) : e.replaceChild(t, e.firstChild);
|
|
1185
|
-
n = t;
|
|
1186
|
-
}
|
|
1187
|
-
}
|
|
1188
|
-
return n;
|
|
1189
|
-
}
|
|
1190
|
-
function ot(e, t, n, r) {
|
|
1191
|
-
let s = !1;
|
|
1192
|
-
for (let i = 0, o = t.length; i < o; i++) {
|
|
1193
|
-
let l = t[i], a = n && n[e.length], u;
|
|
1194
|
-
if (!(l == null || l === !0 || l === !1)) if ((u = typeof l) == "object" && l.nodeType)
|
|
1195
|
-
e.push(l);
|
|
1196
|
-
else if (Array.isArray(l))
|
|
1197
|
-
s = ot(e, l, a) || s;
|
|
1198
|
-
else if (u === "function")
|
|
1199
|
-
if (r) {
|
|
1200
|
-
for (; typeof l == "function"; ) l = l();
|
|
1201
|
-
s = ot(
|
|
1202
|
-
e,
|
|
1203
|
-
Array.isArray(l) ? l : [l],
|
|
1204
|
-
Array.isArray(a) ? a : [a]
|
|
1205
|
-
) || s;
|
|
1206
|
-
} else
|
|
1207
|
-
e.push(l), s = !0;
|
|
1208
|
-
else {
|
|
1209
|
-
const f = String(l);
|
|
1210
|
-
a && a.nodeType === 3 && a.data === f ? e.push(a) : e.push(document.createTextNode(f));
|
|
1211
|
-
}
|
|
1212
|
-
}
|
|
1213
|
-
return s;
|
|
1214
|
-
}
|
|
1215
|
-
function pt(e, t, n = null) {
|
|
1216
|
-
for (let r = 0, s = t.length; r < s; r++) e.insertBefore(t[r], n);
|
|
1217
|
-
}
|
|
1218
|
-
function H(e, t, n, r) {
|
|
1219
|
-
if (n === void 0) return e.textContent = "";
|
|
1220
|
-
const s = r || document.createTextNode("");
|
|
1221
|
-
if (t.length) {
|
|
1222
|
-
let i = !1;
|
|
1223
|
-
for (let o = t.length - 1; o >= 0; o--) {
|
|
1224
|
-
const l = t[o];
|
|
1225
|
-
if (s !== l) {
|
|
1226
|
-
const a = l.parentNode === e;
|
|
1227
|
-
!i && !o ? a ? e.replaceChild(s, l) : e.insertBefore(s, n) : a && l.remove();
|
|
1228
|
-
} else i = !0;
|
|
1229
|
-
}
|
|
1230
|
-
} else e.insertBefore(s, n);
|
|
1231
|
-
return [s];
|
|
1232
|
-
}
|
|
1233
|
-
function Yn() {
|
|
1234
|
-
return h.getNextContextId();
|
|
1235
|
-
}
|
|
1236
|
-
var Zn = "http://www.w3.org/2000/svg";
|
|
1237
|
-
function Qt(e, t = !1) {
|
|
1238
|
-
return t ? document.createElementNS(Zn, e) : document.createElement(e);
|
|
1239
|
-
}
|
|
1240
|
-
function ns(e) {
|
|
1241
|
-
const { useShadow: t } = e, n = document.createTextNode(""), r = () => e.mount || document.body, s = yt();
|
|
1242
|
-
let i, o = !!h.context;
|
|
1243
|
-
return Mt(
|
|
1244
|
-
() => {
|
|
1245
|
-
o && (yt().user = o = !1), i || (i = mn(s, () => T(() => e.children)));
|
|
1246
|
-
const l = r();
|
|
1247
|
-
if (l instanceof HTMLHeadElement) {
|
|
1248
|
-
const [a, u] = E(!1), f = () => u(!0);
|
|
1249
|
-
K((c) => it(l, () => a() ? c() : i(), null)), me(f);
|
|
1250
|
-
} else {
|
|
1251
|
-
const a = Qt(e.isSVG ? "g" : "div", e.isSVG), u = t && a.attachShadow ? a.attachShadow({
|
|
1252
|
-
mode: "open"
|
|
1253
|
-
}) : a;
|
|
1254
|
-
Object.defineProperty(a, "_$host", {
|
|
1255
|
-
get() {
|
|
1256
|
-
return n.parentNode;
|
|
1257
|
-
},
|
|
1258
|
-
configurable: !0
|
|
1259
|
-
}), it(u, i), l.appendChild(a), e.ref && e.ref(a), me(() => l.removeChild(a));
|
|
1260
|
-
}
|
|
1261
|
-
},
|
|
1262
|
-
void 0,
|
|
1263
|
-
{
|
|
1264
|
-
render: !o
|
|
1265
|
-
}
|
|
1266
|
-
), n;
|
|
1267
|
-
}
|
|
1268
|
-
function Jn(e, t) {
|
|
1269
|
-
const n = T(e);
|
|
1270
|
-
return T(() => {
|
|
1271
|
-
const r = n();
|
|
1272
|
-
switch (typeof r) {
|
|
1273
|
-
case "function":
|
|
1274
|
-
return x(() => r(t));
|
|
1275
|
-
case "string":
|
|
1276
|
-
const s = Ln.has(r), i = h.context ? Xn() : Qt(r, s);
|
|
1277
|
-
return zn(i, t, s), i;
|
|
1278
|
-
}
|
|
1279
|
-
});
|
|
1280
|
-
}
|
|
1281
|
-
function rs(e) {
|
|
1282
|
-
const [, t] = xn(e, ["component"]);
|
|
1283
|
-
return Jn(() => e.component, t);
|
|
1284
|
-
}
|
|
1285
|
-
var er = class {
|
|
1286
|
-
constructor() {
|
|
1287
|
-
this.keyToValue = /* @__PURE__ */ new Map(), this.valueToKey = /* @__PURE__ */ new Map();
|
|
1288
|
-
}
|
|
1289
|
-
set(e, t) {
|
|
1290
|
-
this.keyToValue.set(e, t), this.valueToKey.set(t, e);
|
|
1291
|
-
}
|
|
1292
|
-
getByKey(e) {
|
|
1293
|
-
return this.keyToValue.get(e);
|
|
1294
|
-
}
|
|
1295
|
-
getByValue(e) {
|
|
1296
|
-
return this.valueToKey.get(e);
|
|
1297
|
-
}
|
|
1298
|
-
clear() {
|
|
1299
|
-
this.keyToValue.clear(), this.valueToKey.clear();
|
|
1300
|
-
}
|
|
1301
|
-
}, zt = class {
|
|
1302
|
-
constructor(e) {
|
|
1303
|
-
this.generateIdentifier = e, this.kv = new er();
|
|
1304
|
-
}
|
|
1305
|
-
register(e, t) {
|
|
1306
|
-
this.kv.getByValue(e) || (t || (t = this.generateIdentifier(e)), this.kv.set(t, e));
|
|
1307
|
-
}
|
|
1308
|
-
clear() {
|
|
1309
|
-
this.kv.clear();
|
|
1310
|
-
}
|
|
1311
|
-
getIdentifier(e) {
|
|
1312
|
-
return this.kv.getByValue(e);
|
|
1313
|
-
}
|
|
1314
|
-
getValue(e) {
|
|
1315
|
-
return this.kv.getByKey(e);
|
|
1316
|
-
}
|
|
1317
|
-
}, tr = class extends zt {
|
|
1318
|
-
constructor() {
|
|
1319
|
-
super((e) => e.name), this.classToAllowedProps = /* @__PURE__ */ new Map();
|
|
1320
|
-
}
|
|
1321
|
-
register(e, t) {
|
|
1322
|
-
typeof t == "object" ? (t.allowProps && this.classToAllowedProps.set(e, t.allowProps), super.register(e, t.identifier)) : super.register(e, t);
|
|
1323
|
-
}
|
|
1324
|
-
getAllowedProps(e) {
|
|
1325
|
-
return this.classToAllowedProps.get(e);
|
|
1326
|
-
}
|
|
1327
|
-
};
|
|
1328
|
-
function nr(e) {
|
|
1329
|
-
if ("values" in Object)
|
|
1330
|
-
return Object.values(e);
|
|
1331
|
-
const t = [];
|
|
1332
|
-
for (const n in e)
|
|
1333
|
-
e.hasOwnProperty(n) && t.push(e[n]);
|
|
1334
|
-
return t;
|
|
1335
|
-
}
|
|
1336
|
-
function rr(e, t) {
|
|
1337
|
-
const n = nr(e);
|
|
1338
|
-
if ("find" in n)
|
|
1339
|
-
return n.find(t);
|
|
1340
|
-
const r = n;
|
|
1341
|
-
for (let s = 0; s < r.length; s++) {
|
|
1342
|
-
const i = r[s];
|
|
1343
|
-
if (t(i))
|
|
1344
|
-
return i;
|
|
1345
|
-
}
|
|
1346
|
-
}
|
|
1347
|
-
function fe(e, t) {
|
|
1348
|
-
Object.entries(e).forEach(([n, r]) => t(r, n));
|
|
1349
|
-
}
|
|
1350
|
-
function _e(e, t) {
|
|
1351
|
-
return e.indexOf(t) !== -1;
|
|
1352
|
-
}
|
|
1353
|
-
function wt(e, t) {
|
|
1354
|
-
for (let n = 0; n < e.length; n++) {
|
|
1355
|
-
const r = e[n];
|
|
1356
|
-
if (t(r))
|
|
1357
|
-
return r;
|
|
1358
|
-
}
|
|
1359
|
-
}
|
|
1360
|
-
var sr = class {
|
|
1361
|
-
constructor() {
|
|
1362
|
-
this.transfomers = {};
|
|
1363
|
-
}
|
|
1364
|
-
register(e) {
|
|
1365
|
-
this.transfomers[e.name] = e;
|
|
1366
|
-
}
|
|
1367
|
-
findApplicable(e) {
|
|
1368
|
-
return rr(this.transfomers, (t) => t.isApplicable(e));
|
|
1369
|
-
}
|
|
1370
|
-
findByName(e) {
|
|
1371
|
-
return this.transfomers[e];
|
|
1372
|
-
}
|
|
1373
|
-
}, ir = (e) => Object.prototype.toString.call(e).slice(8, -1), Gt = (e) => typeof e > "u", or = (e) => e === null, we = (e) => typeof e != "object" || e === null || e === Object.prototype ? !1 : Object.getPrototypeOf(e) === null ? !0 : Object.getPrototypeOf(e) === Object.prototype, lt = (e) => we(e) && Object.keys(e).length === 0, j = (e) => Array.isArray(e), lr = (e) => typeof e == "string", ar = (e) => typeof e == "number" && !isNaN(e), ur = (e) => typeof e == "boolean", cr = (e) => e instanceof RegExp, be = (e) => e instanceof Map, Se = (e) => e instanceof Set, Ht = (e) => ir(e) === "Symbol", fr = (e) => e instanceof Date && !isNaN(e.valueOf()), dr = (e) => e instanceof Error, bt = (e) => typeof e == "number" && isNaN(e), hr = (e) => ur(e) || or(e) || Gt(e) || ar(e) || lr(e) || Ht(e), gr = (e) => typeof e == "bigint", yr = (e) => e === 1 / 0 || e === -1 / 0, mr = (e) => ArrayBuffer.isView(e) && !(e instanceof DataView), vr = (e) => e instanceof URL, Xt = (e) => e.replace(/\./g, "\\."), Je = (e) => e.map(String).map(Xt).join("."), ye = (e) => {
|
|
1374
|
-
const t = [];
|
|
1375
|
-
let n = "";
|
|
1376
|
-
for (let s = 0; s < e.length; s++) {
|
|
1377
|
-
let i = e.charAt(s);
|
|
1378
|
-
if (i === "\\" && e.charAt(s + 1) === ".") {
|
|
1379
|
-
n += ".", s++;
|
|
1380
|
-
continue;
|
|
1381
|
-
}
|
|
1382
|
-
if (i === ".") {
|
|
1383
|
-
t.push(n), n = "";
|
|
1384
|
-
continue;
|
|
1385
|
-
}
|
|
1386
|
-
n += i;
|
|
1387
|
-
}
|
|
1388
|
-
const r = n;
|
|
1389
|
-
return t.push(r), t;
|
|
1390
|
-
};
|
|
1391
|
-
function V(e, t, n, r) {
|
|
1392
|
-
return {
|
|
1393
|
-
isApplicable: e,
|
|
1394
|
-
annotation: t,
|
|
1395
|
-
transform: n,
|
|
1396
|
-
untransform: r
|
|
1397
|
-
};
|
|
1398
|
-
}
|
|
1399
|
-
var Wt = [
|
|
1400
|
-
V(Gt, "undefined", () => null, () => {
|
|
1401
|
-
}),
|
|
1402
|
-
V(gr, "bigint", (e) => e.toString(), (e) => typeof BigInt < "u" ? BigInt(e) : e),
|
|
1403
|
-
V(fr, "Date", (e) => e.toISOString(), (e) => new Date(e)),
|
|
1404
|
-
V(dr, "Error", (e, t) => {
|
|
1405
|
-
const n = {
|
|
1406
|
-
name: e.name,
|
|
1407
|
-
message: e.message
|
|
1408
|
-
};
|
|
1409
|
-
return t.allowedErrorProps.forEach((r) => {
|
|
1410
|
-
n[r] = e[r];
|
|
1411
|
-
}), n;
|
|
1412
|
-
}, (e, t) => {
|
|
1413
|
-
const n = new Error(e.message);
|
|
1414
|
-
return n.name = e.name, n.stack = e.stack, t.allowedErrorProps.forEach((r) => {
|
|
1415
|
-
n[r] = e[r];
|
|
1416
|
-
}), n;
|
|
1417
|
-
}),
|
|
1418
|
-
V(cr, "regexp", (e) => "" + e, (e) => {
|
|
1419
|
-
const t = e.slice(1, e.lastIndexOf("/")), n = e.slice(e.lastIndexOf("/") + 1);
|
|
1420
|
-
return new RegExp(t, n);
|
|
1421
|
-
}),
|
|
1422
|
-
V(
|
|
1423
|
-
Se,
|
|
1424
|
-
"set",
|
|
1425
|
-
// (sets only exist in es6+)
|
|
1426
|
-
// eslint-disable-next-line es5/no-es6-methods
|
|
1427
|
-
(e) => [...e.values()],
|
|
1428
|
-
(e) => new Set(e)
|
|
1429
|
-
),
|
|
1430
|
-
V(be, "map", (e) => [...e.entries()], (e) => new Map(e)),
|
|
1431
|
-
V((e) => bt(e) || yr(e), "number", (e) => bt(e) ? "NaN" : e > 0 ? "Infinity" : "-Infinity", Number),
|
|
1432
|
-
V((e) => e === 0 && 1 / e === -1 / 0, "number", () => "-0", Number),
|
|
1433
|
-
V(vr, "URL", (e) => e.toString(), (e) => new URL(e))
|
|
1434
|
-
];
|
|
1435
|
-
function ze(e, t, n, r) {
|
|
1436
|
-
return {
|
|
1437
|
-
isApplicable: e,
|
|
1438
|
-
annotation: t,
|
|
1439
|
-
transform: n,
|
|
1440
|
-
untransform: r
|
|
1441
|
-
};
|
|
1442
|
-
}
|
|
1443
|
-
var Yt = ze((e, t) => Ht(e) ? !!t.symbolRegistry.getIdentifier(e) : !1, (e, t) => ["symbol", t.symbolRegistry.getIdentifier(e)], (e) => e.description, (e, t, n) => {
|
|
1444
|
-
const r = n.symbolRegistry.getValue(t[1]);
|
|
1445
|
-
if (!r)
|
|
1446
|
-
throw new Error("Trying to deserialize unknown symbol");
|
|
1447
|
-
return r;
|
|
1448
|
-
}), pr = [
|
|
1449
|
-
Int8Array,
|
|
1450
|
-
Uint8Array,
|
|
1451
|
-
Int16Array,
|
|
1452
|
-
Uint16Array,
|
|
1453
|
-
Int32Array,
|
|
1454
|
-
Uint32Array,
|
|
1455
|
-
Float32Array,
|
|
1456
|
-
Float64Array,
|
|
1457
|
-
Uint8ClampedArray
|
|
1458
|
-
].reduce((e, t) => (e[t.name] = t, e), {}), Zt = ze(mr, (e) => ["typed-array", e.constructor.name], (e) => [...e], (e, t) => {
|
|
1459
|
-
const n = pr[t[1]];
|
|
1460
|
-
if (!n)
|
|
1461
|
-
throw new Error("Trying to deserialize unknown typed array");
|
|
1462
|
-
return new n(e);
|
|
1463
|
-
});
|
|
1464
|
-
function Jt(e, t) {
|
|
1465
|
-
return e != null && e.constructor ? !!t.classRegistry.getIdentifier(e.constructor) : !1;
|
|
1466
|
-
}
|
|
1467
|
-
var en = ze(Jt, (e, t) => ["class", t.classRegistry.getIdentifier(e.constructor)], (e, t) => {
|
|
1468
|
-
const n = t.classRegistry.getAllowedProps(e.constructor);
|
|
1469
|
-
if (!n)
|
|
1470
|
-
return { ...e };
|
|
1471
|
-
const r = {};
|
|
1472
|
-
return n.forEach((s) => {
|
|
1473
|
-
r[s] = e[s];
|
|
1474
|
-
}), r;
|
|
1475
|
-
}, (e, t, n) => {
|
|
1476
|
-
const r = n.classRegistry.getValue(t[1]);
|
|
1477
|
-
if (!r)
|
|
1478
|
-
throw new Error("Trying to deserialize unknown class - check https://github.com/blitz-js/superjson/issues/116#issuecomment-773996564");
|
|
1479
|
-
return Object.assign(Object.create(r.prototype), e);
|
|
1480
|
-
}), tn = ze((e, t) => !!t.customTransformerRegistry.findApplicable(e), (e, t) => ["custom", t.customTransformerRegistry.findApplicable(e).name], (e, t) => t.customTransformerRegistry.findApplicable(e).serialize(e), (e, t, n) => {
|
|
1481
|
-
const r = n.customTransformerRegistry.findByName(t[1]);
|
|
1482
|
-
if (!r)
|
|
1483
|
-
throw new Error("Trying to deserialize unknown custom value");
|
|
1484
|
-
return r.deserialize(e);
|
|
1485
|
-
}), wr = [en, Yt, tn, Zt], St = (e, t) => {
|
|
1486
|
-
const n = wt(wr, (s) => s.isApplicable(e, t));
|
|
1487
|
-
if (n)
|
|
1488
|
-
return {
|
|
1489
|
-
value: n.transform(e, t),
|
|
1490
|
-
type: n.annotation(e, t)
|
|
1491
|
-
};
|
|
1492
|
-
const r = wt(Wt, (s) => s.isApplicable(e, t));
|
|
1493
|
-
if (r)
|
|
1494
|
-
return {
|
|
1495
|
-
value: r.transform(e, t),
|
|
1496
|
-
type: r.annotation
|
|
1497
|
-
};
|
|
1498
|
-
}, nn = {};
|
|
1499
|
-
Wt.forEach((e) => {
|
|
1500
|
-
nn[e.annotation] = e;
|
|
1501
|
-
});
|
|
1502
|
-
var br = (e, t, n) => {
|
|
1503
|
-
if (j(t))
|
|
1504
|
-
switch (t[0]) {
|
|
1505
|
-
case "symbol":
|
|
1506
|
-
return Yt.untransform(e, t, n);
|
|
1507
|
-
case "class":
|
|
1508
|
-
return en.untransform(e, t, n);
|
|
1509
|
-
case "custom":
|
|
1510
|
-
return tn.untransform(e, t, n);
|
|
1511
|
-
case "typed-array":
|
|
1512
|
-
return Zt.untransform(e, t, n);
|
|
1513
|
-
default:
|
|
1514
|
-
throw new Error("Unknown transformation: " + t);
|
|
1515
|
-
}
|
|
1516
|
-
else {
|
|
1517
|
-
const r = nn[t];
|
|
1518
|
-
if (!r)
|
|
1519
|
-
throw new Error("Unknown transformation: " + t);
|
|
1520
|
-
return r.untransform(e, n);
|
|
1521
|
-
}
|
|
1522
|
-
}, X = (e, t) => {
|
|
1523
|
-
const n = e.keys();
|
|
1524
|
-
for (; t > 0; )
|
|
1525
|
-
n.next(), t--;
|
|
1526
|
-
return n.next().value;
|
|
1527
|
-
};
|
|
1528
|
-
function rn(e) {
|
|
1529
|
-
if (_e(e, "__proto__"))
|
|
1530
|
-
throw new Error("__proto__ is not allowed as a property");
|
|
1531
|
-
if (_e(e, "prototype"))
|
|
1532
|
-
throw new Error("prototype is not allowed as a property");
|
|
1533
|
-
if (_e(e, "constructor"))
|
|
1534
|
-
throw new Error("constructor is not allowed as a property");
|
|
1535
|
-
}
|
|
1536
|
-
var Sr = (e, t) => {
|
|
1537
|
-
rn(t);
|
|
1538
|
-
for (let n = 0; n < t.length; n++) {
|
|
1539
|
-
const r = t[n];
|
|
1540
|
-
if (Se(e))
|
|
1541
|
-
e = X(e, +r);
|
|
1542
|
-
else if (be(e)) {
|
|
1543
|
-
const s = +r, i = +t[++n] == 0 ? "key" : "value", o = X(e, s);
|
|
1544
|
-
switch (i) {
|
|
1545
|
-
case "key":
|
|
1546
|
-
e = o;
|
|
1547
|
-
break;
|
|
1548
|
-
case "value":
|
|
1549
|
-
e = e.get(o);
|
|
1550
|
-
break;
|
|
1551
|
-
}
|
|
1552
|
-
} else
|
|
1553
|
-
e = e[r];
|
|
1554
|
-
}
|
|
1555
|
-
return e;
|
|
1556
|
-
}, at = (e, t, n) => {
|
|
1557
|
-
if (rn(t), t.length === 0)
|
|
1558
|
-
return n(e);
|
|
1559
|
-
let r = e;
|
|
1560
|
-
for (let i = 0; i < t.length - 1; i++) {
|
|
1561
|
-
const o = t[i];
|
|
1562
|
-
if (j(r)) {
|
|
1563
|
-
const l = +o;
|
|
1564
|
-
r = r[l];
|
|
1565
|
-
} else if (we(r))
|
|
1566
|
-
r = r[o];
|
|
1567
|
-
else if (Se(r)) {
|
|
1568
|
-
const l = +o;
|
|
1569
|
-
r = X(r, l);
|
|
1570
|
-
} else if (be(r)) {
|
|
1571
|
-
if (i === t.length - 2)
|
|
1572
|
-
break;
|
|
1573
|
-
const a = +o, u = +t[++i] == 0 ? "key" : "value", f = X(r, a);
|
|
1574
|
-
switch (u) {
|
|
1575
|
-
case "key":
|
|
1576
|
-
r = f;
|
|
1577
|
-
break;
|
|
1578
|
-
case "value":
|
|
1579
|
-
r = r.get(f);
|
|
1580
|
-
break;
|
|
1581
|
-
}
|
|
1582
|
-
}
|
|
1583
|
-
}
|
|
1584
|
-
const s = t[t.length - 1];
|
|
1585
|
-
if (j(r) ? r[+s] = n(r[+s]) : we(r) && (r[s] = n(r[s])), Se(r)) {
|
|
1586
|
-
const i = X(r, +s), o = n(i);
|
|
1587
|
-
i !== o && (r.delete(i), r.add(o));
|
|
1588
|
-
}
|
|
1589
|
-
if (be(r)) {
|
|
1590
|
-
const i = +t[t.length - 2], o = X(r, i);
|
|
1591
|
-
switch (+s == 0 ? "key" : "value") {
|
|
1592
|
-
case "key": {
|
|
1593
|
-
const a = n(o);
|
|
1594
|
-
r.set(a, r.get(o)), a !== o && r.delete(o);
|
|
1595
|
-
break;
|
|
1596
|
-
}
|
|
1597
|
-
case "value": {
|
|
1598
|
-
r.set(o, n(r.get(o)));
|
|
1599
|
-
break;
|
|
1600
|
-
}
|
|
1601
|
-
}
|
|
1602
|
-
}
|
|
1603
|
-
return e;
|
|
1604
|
-
};
|
|
1605
|
-
function ut(e, t, n = []) {
|
|
1606
|
-
if (!e)
|
|
1607
|
-
return;
|
|
1608
|
-
if (!j(e)) {
|
|
1609
|
-
fe(e, (i, o) => ut(i, t, [...n, ...ye(o)]));
|
|
1610
|
-
return;
|
|
1611
|
-
}
|
|
1612
|
-
const [r, s] = e;
|
|
1613
|
-
s && fe(s, (i, o) => {
|
|
1614
|
-
ut(i, t, [...n, ...ye(o)]);
|
|
1615
|
-
}), t(r, n);
|
|
1616
|
-
}
|
|
1617
|
-
function Er(e, t, n) {
|
|
1618
|
-
return ut(t, (r, s) => {
|
|
1619
|
-
e = at(e, s, (i) => br(i, r, n));
|
|
1620
|
-
}), e;
|
|
1621
|
-
}
|
|
1622
|
-
function Ar(e, t) {
|
|
1623
|
-
function n(r, s) {
|
|
1624
|
-
const i = Sr(e, ye(s));
|
|
1625
|
-
r.map(ye).forEach((o) => {
|
|
1626
|
-
e = at(e, o, () => i);
|
|
1627
|
-
});
|
|
1628
|
-
}
|
|
1629
|
-
if (j(t)) {
|
|
1630
|
-
const [r, s] = t;
|
|
1631
|
-
r.forEach((i) => {
|
|
1632
|
-
e = at(e, ye(i), () => e);
|
|
1633
|
-
}), s && fe(s, n);
|
|
1634
|
-
} else
|
|
1635
|
-
fe(t, n);
|
|
1636
|
-
return e;
|
|
1637
|
-
}
|
|
1638
|
-
var Or = (e, t) => we(e) || j(e) || be(e) || Se(e) || Jt(e, t);
|
|
1639
|
-
function Cr(e, t, n) {
|
|
1640
|
-
const r = n.get(e);
|
|
1641
|
-
r ? r.push(t) : n.set(e, [t]);
|
|
1642
|
-
}
|
|
1643
|
-
function Tr(e, t) {
|
|
1644
|
-
const n = {};
|
|
1645
|
-
let r;
|
|
1646
|
-
return e.forEach((s) => {
|
|
1647
|
-
if (s.length <= 1)
|
|
1648
|
-
return;
|
|
1649
|
-
t || (s = s.map((l) => l.map(String)).sort((l, a) => l.length - a.length));
|
|
1650
|
-
const [i, ...o] = s;
|
|
1651
|
-
i.length === 0 ? r = o.map(Je) : n[Je(i)] = o.map(Je);
|
|
1652
|
-
}), r ? lt(n) ? [r] : [r, n] : lt(n) ? void 0 : n;
|
|
1653
|
-
}
|
|
1654
|
-
var sn = (e, t, n, r, s = [], i = [], o = /* @__PURE__ */ new Map()) => {
|
|
1655
|
-
const l = hr(e);
|
|
1656
|
-
if (!l) {
|
|
1657
|
-
Cr(e, s, t);
|
|
1658
|
-
const y = o.get(e);
|
|
1659
|
-
if (y)
|
|
1660
|
-
return r ? {
|
|
1661
|
-
transformedValue: null
|
|
1662
|
-
} : y;
|
|
1663
|
-
}
|
|
1664
|
-
if (!Or(e, n)) {
|
|
1665
|
-
const y = St(e, n), S = y ? {
|
|
1666
|
-
transformedValue: y.value,
|
|
1667
|
-
annotations: [y.type]
|
|
1668
|
-
} : {
|
|
1669
|
-
transformedValue: e
|
|
1670
|
-
};
|
|
1671
|
-
return l || o.set(e, S), S;
|
|
1672
|
-
}
|
|
1673
|
-
if (_e(i, e))
|
|
1674
|
-
return {
|
|
1675
|
-
transformedValue: null
|
|
1676
|
-
};
|
|
1677
|
-
const a = St(e, n), u = (a == null ? void 0 : a.value) ?? e, f = j(u) ? [] : {}, c = {};
|
|
1678
|
-
fe(u, (y, S) => {
|
|
1679
|
-
if (S === "__proto__" || S === "constructor" || S === "prototype")
|
|
1680
|
-
throw new Error(`Detected property ${S}. This is a prototype pollution risk, please remove it from your object.`);
|
|
1681
|
-
const C = sn(y, t, n, r, [...s, S], [...i, e], o);
|
|
1682
|
-
f[S] = C.transformedValue, j(C.annotations) ? c[S] = C.annotations : we(C.annotations) && fe(C.annotations, (B, F) => {
|
|
1683
|
-
c[Xt(S) + "." + F] = B;
|
|
1684
|
-
});
|
|
1685
|
-
});
|
|
1686
|
-
const g = lt(c) ? {
|
|
1687
|
-
transformedValue: f,
|
|
1688
|
-
annotations: a ? [a.type] : void 0
|
|
1689
|
-
} : {
|
|
1690
|
-
transformedValue: f,
|
|
1691
|
-
annotations: a ? [a.type, c] : c
|
|
1692
|
-
};
|
|
1693
|
-
return l || o.set(e, g), g;
|
|
1694
|
-
};
|
|
1695
|
-
function on(e) {
|
|
1696
|
-
return Object.prototype.toString.call(e).slice(8, -1);
|
|
1697
|
-
}
|
|
1698
|
-
function Et(e) {
|
|
1699
|
-
return on(e) === "Array";
|
|
1700
|
-
}
|
|
1701
|
-
function xr(e) {
|
|
1702
|
-
if (on(e) !== "Object")
|
|
1703
|
-
return !1;
|
|
1704
|
-
const t = Object.getPrototypeOf(e);
|
|
1705
|
-
return !!t && t.constructor === Object && t === Object.prototype;
|
|
1706
|
-
}
|
|
1707
|
-
function Nr(e, t, n, r, s) {
|
|
1708
|
-
const i = {}.propertyIsEnumerable.call(r, t) ? "enumerable" : "nonenumerable";
|
|
1709
|
-
i === "enumerable" && (e[t] = n), s && i === "nonenumerable" && Object.defineProperty(e, t, {
|
|
1710
|
-
value: n,
|
|
1711
|
-
enumerable: !1,
|
|
1712
|
-
writable: !0,
|
|
1713
|
-
configurable: !0
|
|
1714
|
-
});
|
|
1715
|
-
}
|
|
1716
|
-
function ct(e, t = {}) {
|
|
1717
|
-
if (Et(e))
|
|
1718
|
-
return e.map((s) => ct(s, t));
|
|
1719
|
-
if (!xr(e))
|
|
1720
|
-
return e;
|
|
1721
|
-
const n = Object.getOwnPropertyNames(e), r = Object.getOwnPropertySymbols(e);
|
|
1722
|
-
return [...n, ...r].reduce((s, i) => {
|
|
1723
|
-
if (Et(t.props) && !t.props.includes(i))
|
|
1724
|
-
return s;
|
|
1725
|
-
const o = e[i], l = ct(o, t);
|
|
1726
|
-
return Nr(s, i, l, e, t.nonenumerable), s;
|
|
1727
|
-
}, {});
|
|
1728
|
-
}
|
|
1729
|
-
var b = class {
|
|
1730
|
-
/**
|
|
1731
|
-
* @param dedupeReferentialEqualities If true, SuperJSON will make sure only one instance of referentially equal objects are serialized and the rest are replaced with `null`.
|
|
1732
|
-
*/
|
|
1733
|
-
constructor({ dedupe: e = !1 } = {}) {
|
|
1734
|
-
this.classRegistry = new tr(), this.symbolRegistry = new zt((t) => t.description ?? ""), this.customTransformerRegistry = new sr(), this.allowedErrorProps = [], this.dedupe = e;
|
|
1735
|
-
}
|
|
1736
|
-
serialize(e) {
|
|
1737
|
-
const t = /* @__PURE__ */ new Map(), n = sn(e, t, this, this.dedupe), r = {
|
|
1738
|
-
json: n.transformedValue
|
|
1739
|
-
};
|
|
1740
|
-
n.annotations && (r.meta = {
|
|
1741
|
-
...r.meta,
|
|
1742
|
-
values: n.annotations
|
|
1743
|
-
});
|
|
1744
|
-
const s = Tr(t, this.dedupe);
|
|
1745
|
-
return s && (r.meta = {
|
|
1746
|
-
...r.meta,
|
|
1747
|
-
referentialEqualities: s
|
|
1748
|
-
}), r;
|
|
1749
|
-
}
|
|
1750
|
-
deserialize(e) {
|
|
1751
|
-
const { json: t, meta: n } = e;
|
|
1752
|
-
let r = ct(t);
|
|
1753
|
-
return n != null && n.values && (r = Er(r, n.values, this)), n != null && n.referentialEqualities && (r = Ar(r, n.referentialEqualities)), r;
|
|
1754
|
-
}
|
|
1755
|
-
stringify(e) {
|
|
1756
|
-
return JSON.stringify(this.serialize(e));
|
|
1757
|
-
}
|
|
1758
|
-
parse(e) {
|
|
1759
|
-
return this.deserialize(JSON.parse(e));
|
|
1760
|
-
}
|
|
1761
|
-
registerClass(e, t) {
|
|
1762
|
-
this.classRegistry.register(e, t);
|
|
1763
|
-
}
|
|
1764
|
-
registerSymbol(e, t) {
|
|
1765
|
-
this.symbolRegistry.register(e, t);
|
|
1766
|
-
}
|
|
1767
|
-
registerCustom(e, t) {
|
|
1768
|
-
this.customTransformerRegistry.register({
|
|
1769
|
-
name: t,
|
|
1770
|
-
...e
|
|
1771
|
-
});
|
|
1772
|
-
}
|
|
1773
|
-
allowErrorProps(...e) {
|
|
1774
|
-
this.allowedErrorProps.push(...e);
|
|
1775
|
-
}
|
|
1776
|
-
};
|
|
1777
|
-
b.defaultInstance = new b();
|
|
1778
|
-
b.serialize = b.defaultInstance.serialize.bind(b.defaultInstance);
|
|
1779
|
-
b.deserialize = b.defaultInstance.deserialize.bind(b.defaultInstance);
|
|
1780
|
-
b.stringify = b.defaultInstance.stringify.bind(b.defaultInstance);
|
|
1781
|
-
b.parse = b.defaultInstance.parse.bind(b.defaultInstance);
|
|
1782
|
-
b.registerClass = b.defaultInstance.registerClass.bind(b.defaultInstance);
|
|
1783
|
-
b.registerSymbol = b.defaultInstance.registerSymbol.bind(b.defaultInstance);
|
|
1784
|
-
b.registerCustom = b.defaultInstance.registerCustom.bind(b.defaultInstance);
|
|
1785
|
-
b.allowErrorProps = b.defaultInstance.allowErrorProps.bind(b.defaultInstance);
|
|
1786
|
-
var kr = b.serialize, ss = b.stringify;
|
|
1787
|
-
function is(e) {
|
|
1788
|
-
return e.state.fetchStatus === "fetching" ? "fetching" : e.getObserversCount() ? e.state.fetchStatus === "paused" ? "paused" : e.isStale() ? "stale" : "fresh" : "inactive";
|
|
1789
|
-
}
|
|
1790
|
-
function os(e, t) {
|
|
1791
|
-
return `${e}${t.charAt(0).toUpperCase() + t.slice(1)}`;
|
|
1792
|
-
}
|
|
1793
|
-
function ls({
|
|
1794
|
-
queryState: e,
|
|
1795
|
-
observerCount: t,
|
|
1796
|
-
isStale: n
|
|
1797
|
-
}) {
|
|
1798
|
-
return e.fetchStatus === "fetching" ? "blue" : t ? e.fetchStatus === "paused" ? "purple" : n ? "yellow" : "green" : "gray";
|
|
1799
|
-
}
|
|
1800
|
-
function as({
|
|
1801
|
-
status: e,
|
|
1802
|
-
isPaused: t
|
|
1803
|
-
}) {
|
|
1804
|
-
return t ? "purple" : e === "error" ? "red" : e === "pending" ? "yellow" : e === "success" ? "green" : "gray";
|
|
1805
|
-
}
|
|
1806
|
-
function us(e) {
|
|
1807
|
-
return e === "fresh" ? "green" : e === "stale" ? "yellow" : e === "paused" ? "purple" : e === "inactive" ? "gray" : "blue";
|
|
1808
|
-
}
|
|
1809
|
-
var cs = (e, t = !1) => {
|
|
1810
|
-
const {
|
|
1811
|
-
json: n
|
|
1812
|
-
} = kr(e);
|
|
1813
|
-
return JSON.stringify(n, null, t ? 2 : void 0);
|
|
1814
|
-
}, Me = (e) => e.state.fetchStatus !== "idle" ? 0 : e.getObserversCount() ? e.isStale() ? 2 : 1 : 3, Pr = (e, t) => e.queryHash.localeCompare(t.queryHash), ln = (e, t) => e.state.dataUpdatedAt < t.state.dataUpdatedAt ? 1 : -1, Ir = (e, t) => Me(e) === Me(t) ? ln(e, t) : Me(e) > Me(t) ? 1 : -1, fs = {
|
|
1815
|
-
status: Ir,
|
|
1816
|
-
"query hash": Pr,
|
|
1817
|
-
"last updated": ln
|
|
1818
|
-
}, De = (e) => e.state.isPaused ? 0 : e.state.status === "error" ? 2 : e.state.status === "pending" ? 1 : 3, an = (e, t) => e.state.submittedAt < t.state.submittedAt ? 1 : -1, Rr = (e, t) => De(e) === De(t) ? an(e, t) : De(e) > De(t) ? 1 : -1, ds = {
|
|
1819
|
-
status: Rr,
|
|
1820
|
-
"last updated": an
|
|
1821
|
-
}, hs = (e) => e * parseFloat(getComputedStyle(document.documentElement).fontSize), gs = () => {
|
|
1822
|
-
const [e, t] = E("dark");
|
|
1823
|
-
return yn(() => {
|
|
1824
|
-
const n = window.matchMedia("(prefers-color-scheme: dark)");
|
|
1825
|
-
t(n.matches ? "dark" : "light");
|
|
1826
|
-
const r = (s) => {
|
|
1827
|
-
t(s.matches ? "dark" : "light");
|
|
1828
|
-
};
|
|
1829
|
-
n.addEventListener("change", r), me(() => n.removeEventListener("change", r));
|
|
1830
|
-
}), e;
|
|
1831
|
-
}, Ve = (e, t, n) => {
|
|
1832
|
-
if (t.length === 0)
|
|
1833
|
-
return n;
|
|
1834
|
-
if (e instanceof Map) {
|
|
1835
|
-
const r = new Map(e);
|
|
1836
|
-
if (t.length === 1)
|
|
1837
|
-
return r.set(t[0], n), r;
|
|
1838
|
-
const [s, ...i] = t;
|
|
1839
|
-
return r.set(s, Ve(r.get(s), i, n)), r;
|
|
1840
|
-
}
|
|
1841
|
-
if (e instanceof Set) {
|
|
1842
|
-
const r = Ve(Array.from(e), t, n);
|
|
1843
|
-
return new Set(r);
|
|
1844
|
-
}
|
|
1845
|
-
if (Array.isArray(e)) {
|
|
1846
|
-
const r = [...e];
|
|
1847
|
-
if (t.length === 1)
|
|
1848
|
-
return r[t[0]] = n, r;
|
|
1849
|
-
const [s, ...i] = t;
|
|
1850
|
-
return r[s] = Ve(r[s], i, n), r;
|
|
1851
|
-
}
|
|
1852
|
-
if (e instanceof Object) {
|
|
1853
|
-
const r = {
|
|
1854
|
-
...e
|
|
1855
|
-
};
|
|
1856
|
-
if (t.length === 1)
|
|
1857
|
-
return r[t[0]] = n, r;
|
|
1858
|
-
const [s, ...i] = t;
|
|
1859
|
-
return r[s] = Ve(r[s], i, n), r;
|
|
1860
|
-
}
|
|
1861
|
-
return e;
|
|
1862
|
-
}, Le = (e, t) => {
|
|
1863
|
-
if (e instanceof Map) {
|
|
1864
|
-
const n = new Map(e);
|
|
1865
|
-
if (t.length === 1)
|
|
1866
|
-
return n.delete(t[0]), n;
|
|
1867
|
-
const [r, ...s] = t;
|
|
1868
|
-
return n.set(r, Le(n.get(r), s)), n;
|
|
1869
|
-
}
|
|
1870
|
-
if (e instanceof Set) {
|
|
1871
|
-
const n = Le(Array.from(e), t);
|
|
1872
|
-
return new Set(n);
|
|
1873
|
-
}
|
|
1874
|
-
if (Array.isArray(e)) {
|
|
1875
|
-
const n = [...e];
|
|
1876
|
-
if (t.length === 1)
|
|
1877
|
-
return n.filter((i, o) => o.toString() !== t[0]);
|
|
1878
|
-
const [r, ...s] = t;
|
|
1879
|
-
return n[r] = Le(n[r], s), n;
|
|
1880
|
-
}
|
|
1881
|
-
if (e instanceof Object) {
|
|
1882
|
-
const n = {
|
|
1883
|
-
...e
|
|
1884
|
-
};
|
|
1885
|
-
if (t.length === 1)
|
|
1886
|
-
return delete n[t[0]], n;
|
|
1887
|
-
const [r, ...s] = t;
|
|
1888
|
-
return n[r] = Le(n[r], s), n;
|
|
1889
|
-
}
|
|
1890
|
-
return e;
|
|
1891
|
-
}, un = (e, t) => {
|
|
1892
|
-
if (!e || document.querySelector("#_goober") || (t == null ? void 0 : t.querySelector("#_goober"))) return;
|
|
1893
|
-
const r = document.createElement("style"), s = document.createTextNode("");
|
|
1894
|
-
r.appendChild(s), r.id = "_goober", r.setAttribute("nonce", e), t ? t.appendChild(r) : document.head.appendChild(r);
|
|
1895
|
-
}, W, Ee, Ae, Oe, U, Ce, Y, Z, J, ee, te, ne, Te, At, Mr = (At = class {
|
|
1896
|
-
constructor(e) {
|
|
1897
|
-
p(this, W);
|
|
1898
|
-
p(this, Ee);
|
|
1899
|
-
p(this, Ae);
|
|
1900
|
-
p(this, Oe);
|
|
1901
|
-
p(this, U, !1);
|
|
1902
|
-
p(this, Ce);
|
|
1903
|
-
p(this, Y);
|
|
1904
|
-
p(this, Z);
|
|
1905
|
-
p(this, J);
|
|
1906
|
-
p(this, ee);
|
|
1907
|
-
p(this, te);
|
|
1908
|
-
p(this, ne);
|
|
1909
|
-
p(this, Te);
|
|
1910
|
-
const {
|
|
1911
|
-
client: t,
|
|
1912
|
-
queryFlavor: n,
|
|
1913
|
-
version: r,
|
|
1914
|
-
onlineManager: s,
|
|
1915
|
-
buttonPosition: i,
|
|
1916
|
-
position: o,
|
|
1917
|
-
initialIsOpen: l,
|
|
1918
|
-
errorTypes: a,
|
|
1919
|
-
styleNonce: u,
|
|
1920
|
-
shadowDOMTarget: f
|
|
1921
|
-
} = e;
|
|
1922
|
-
v(this, W, E(t)), v(this, Ae, n), v(this, Oe, r), v(this, Ee, s), v(this, Ce, u), v(this, Y, f), v(this, Z, E(i)), v(this, J, E(o)), v(this, ee, E(l)), v(this, te, E(a));
|
|
1923
|
-
}
|
|
1924
|
-
setButtonPosition(e) {
|
|
1925
|
-
d(this, Z)[1](e);
|
|
1926
|
-
}
|
|
1927
|
-
setPosition(e) {
|
|
1928
|
-
d(this, J)[1](e);
|
|
1929
|
-
}
|
|
1930
|
-
setInitialIsOpen(e) {
|
|
1931
|
-
d(this, ee)[1](e);
|
|
1932
|
-
}
|
|
1933
|
-
setErrorTypes(e) {
|
|
1934
|
-
d(this, te)[1](e);
|
|
1935
|
-
}
|
|
1936
|
-
setClient(e) {
|
|
1937
|
-
d(this, W)[1](e);
|
|
1938
|
-
}
|
|
1939
|
-
mount(e) {
|
|
1940
|
-
if (d(this, U))
|
|
1941
|
-
throw new Error("Devtools is already mounted");
|
|
1942
|
-
const t = qt(() => {
|
|
1943
|
-
const n = this, [r] = d(this, Z), [s] = d(this, J), [i] = d(this, ee), [o] = d(this, te), [l] = d(this, W);
|
|
1944
|
-
let a;
|
|
1945
|
-
return d(this, ne) ? a = d(this, ne) : (a = Ft(() => import("./C2Q2AJ2U-DTgcxQMB.mjs")), v(this, ne, a)), un(d(this, Ce), d(this, Y)), Bt(a, jt({
|
|
1946
|
-
get queryFlavor() {
|
|
1947
|
-
return d(n, Ae);
|
|
1948
|
-
},
|
|
1949
|
-
get version() {
|
|
1950
|
-
return d(n, Oe);
|
|
1951
|
-
},
|
|
1952
|
-
get onlineManager() {
|
|
1953
|
-
return d(n, Ee);
|
|
1954
|
-
},
|
|
1955
|
-
get shadowDOMTarget() {
|
|
1956
|
-
return d(n, Y);
|
|
1957
|
-
}
|
|
1958
|
-
}, {
|
|
1959
|
-
get client() {
|
|
1960
|
-
return l();
|
|
1961
|
-
},
|
|
1962
|
-
get buttonPosition() {
|
|
1963
|
-
return r();
|
|
1964
|
-
},
|
|
1965
|
-
get position() {
|
|
1966
|
-
return s();
|
|
1967
|
-
},
|
|
1968
|
-
get initialIsOpen() {
|
|
1969
|
-
return i();
|
|
1970
|
-
},
|
|
1971
|
-
get errorTypes() {
|
|
1972
|
-
return o();
|
|
1973
|
-
}
|
|
1974
|
-
}));
|
|
1975
|
-
}, e);
|
|
1976
|
-
v(this, U, !0), v(this, Te, t);
|
|
1977
|
-
}
|
|
1978
|
-
unmount() {
|
|
1979
|
-
var e;
|
|
1980
|
-
if (!d(this, U))
|
|
1981
|
-
throw new Error("Devtools is not mounted");
|
|
1982
|
-
(e = d(this, Te)) == null || e.call(this), v(this, U, !1);
|
|
1983
|
-
}
|
|
1984
|
-
}, W = new WeakMap(), Ee = new WeakMap(), Ae = new WeakMap(), Oe = new WeakMap(), U = new WeakMap(), Ce = new WeakMap(), Y = new WeakMap(), Z = new WeakMap(), J = new WeakMap(), ee = new WeakMap(), te = new WeakMap(), ne = new WeakMap(), Te = new WeakMap(), At), re, xe, Ne, ke, q, Pe, se, ie, oe, le, ae, ue, ce, Ie, Ot, Dr = (Ot = class {
|
|
1985
|
-
constructor(e) {
|
|
1986
|
-
p(this, re);
|
|
1987
|
-
p(this, xe);
|
|
1988
|
-
p(this, Ne);
|
|
1989
|
-
p(this, ke);
|
|
1990
|
-
p(this, q, !1);
|
|
1991
|
-
p(this, Pe);
|
|
1992
|
-
p(this, se);
|
|
1993
|
-
p(this, ie);
|
|
1994
|
-
p(this, oe);
|
|
1995
|
-
p(this, le);
|
|
1996
|
-
p(this, ae);
|
|
1997
|
-
p(this, ue);
|
|
1998
|
-
p(this, ce);
|
|
1999
|
-
p(this, Ie);
|
|
2000
|
-
const {
|
|
2001
|
-
client: t,
|
|
2002
|
-
queryFlavor: n,
|
|
2003
|
-
version: r,
|
|
2004
|
-
onlineManager: s,
|
|
2005
|
-
buttonPosition: i,
|
|
2006
|
-
position: o,
|
|
2007
|
-
initialIsOpen: l,
|
|
2008
|
-
errorTypes: a,
|
|
2009
|
-
styleNonce: u,
|
|
2010
|
-
shadowDOMTarget: f,
|
|
2011
|
-
onClose: c
|
|
2012
|
-
} = e;
|
|
2013
|
-
v(this, re, E(t)), v(this, Ne, n), v(this, ke, r), v(this, xe, s), v(this, Pe, u), v(this, se, f), v(this, ie, E(i)), v(this, oe, E(o)), v(this, le, E(l)), v(this, ae, E(a)), v(this, ue, E(c));
|
|
2014
|
-
}
|
|
2015
|
-
setButtonPosition(e) {
|
|
2016
|
-
d(this, ie)[1](e);
|
|
2017
|
-
}
|
|
2018
|
-
setPosition(e) {
|
|
2019
|
-
d(this, oe)[1](e);
|
|
2020
|
-
}
|
|
2021
|
-
setInitialIsOpen(e) {
|
|
2022
|
-
d(this, le)[1](e);
|
|
2023
|
-
}
|
|
2024
|
-
setErrorTypes(e) {
|
|
2025
|
-
d(this, ae)[1](e);
|
|
2026
|
-
}
|
|
2027
|
-
setClient(e) {
|
|
2028
|
-
d(this, re)[1](e);
|
|
2029
|
-
}
|
|
2030
|
-
setOnClose(e) {
|
|
2031
|
-
d(this, ue)[1](() => e);
|
|
2032
|
-
}
|
|
2033
|
-
mount(e) {
|
|
2034
|
-
if (d(this, q))
|
|
2035
|
-
throw new Error("Devtools is already mounted");
|
|
2036
|
-
const t = qt(() => {
|
|
2037
|
-
const n = this, [r] = d(this, ie), [s] = d(this, oe), [i] = d(this, le), [o] = d(this, ae), [l] = d(this, re), [a] = d(this, ue);
|
|
2038
|
-
let u;
|
|
2039
|
-
return d(this, ce) ? u = d(this, ce) : (u = Ft(() => import("./CTUG6TWM-DqDj0HqV.mjs")), v(this, ce, u)), un(d(this, Pe), d(this, se)), Bt(u, jt({
|
|
2040
|
-
get queryFlavor() {
|
|
2041
|
-
return d(n, Ne);
|
|
2042
|
-
},
|
|
2043
|
-
get version() {
|
|
2044
|
-
return d(n, ke);
|
|
2045
|
-
},
|
|
2046
|
-
get onlineManager() {
|
|
2047
|
-
return d(n, xe);
|
|
2048
|
-
},
|
|
2049
|
-
get shadowDOMTarget() {
|
|
2050
|
-
return d(n, se);
|
|
2051
|
-
}
|
|
2052
|
-
}, {
|
|
2053
|
-
get client() {
|
|
2054
|
-
return l();
|
|
2055
|
-
},
|
|
2056
|
-
get buttonPosition() {
|
|
2057
|
-
return r();
|
|
2058
|
-
},
|
|
2059
|
-
get position() {
|
|
2060
|
-
return s();
|
|
2061
|
-
},
|
|
2062
|
-
get initialIsOpen() {
|
|
2063
|
-
return i();
|
|
2064
|
-
},
|
|
2065
|
-
get errorTypes() {
|
|
2066
|
-
return o();
|
|
2067
|
-
},
|
|
2068
|
-
get onClose() {
|
|
2069
|
-
return a();
|
|
2070
|
-
}
|
|
2071
|
-
}));
|
|
2072
|
-
}, e);
|
|
2073
|
-
v(this, q, !0), v(this, Ie, t);
|
|
2074
|
-
}
|
|
2075
|
-
unmount() {
|
|
2076
|
-
var e;
|
|
2077
|
-
if (!d(this, q))
|
|
2078
|
-
throw new Error("Devtools is not mounted");
|
|
2079
|
-
(e = d(this, Ie)) == null || e.call(this), v(this, q, !1);
|
|
2080
|
-
}
|
|
2081
|
-
}, re = new WeakMap(), xe = new WeakMap(), Ne = new WeakMap(), ke = new WeakMap(), q = new WeakMap(), Pe = new WeakMap(), se = new WeakMap(), ie = new WeakMap(), oe = new WeakMap(), le = new WeakMap(), ae = new WeakMap(), ue = new WeakMap(), ce = new WeakMap(), Ie = new WeakMap(), Ot);
|
|
2082
|
-
function Vr(e) {
|
|
2083
|
-
const t = Ct(e.client), n = P.useRef(null), {
|
|
2084
|
-
buttonPosition: r,
|
|
2085
|
-
position: s,
|
|
2086
|
-
initialIsOpen: i,
|
|
2087
|
-
errorTypes: o,
|
|
2088
|
-
styleNonce: l,
|
|
2089
|
-
shadowDOMTarget: a
|
|
2090
|
-
} = e, [u] = P.useState(
|
|
2091
|
-
new Mr({
|
|
2092
|
-
client: t,
|
|
2093
|
-
queryFlavor: "React Query",
|
|
2094
|
-
version: "5",
|
|
2095
|
-
onlineManager: Tt,
|
|
2096
|
-
buttonPosition: r,
|
|
2097
|
-
position: s,
|
|
2098
|
-
initialIsOpen: i,
|
|
2099
|
-
errorTypes: o,
|
|
2100
|
-
styleNonce: l,
|
|
2101
|
-
shadowDOMTarget: a
|
|
2102
|
-
})
|
|
2103
|
-
);
|
|
2104
|
-
return P.useEffect(() => {
|
|
2105
|
-
u.setClient(t);
|
|
2106
|
-
}, [t, u]), P.useEffect(() => {
|
|
2107
|
-
r && u.setButtonPosition(r);
|
|
2108
|
-
}, [r, u]), P.useEffect(() => {
|
|
2109
|
-
s && u.setPosition(s);
|
|
2110
|
-
}, [s, u]), P.useEffect(() => {
|
|
2111
|
-
u.setInitialIsOpen(i || !1);
|
|
2112
|
-
}, [i, u]), P.useEffect(() => {
|
|
2113
|
-
u.setErrorTypes(o || []);
|
|
2114
|
-
}, [o, u]), P.useEffect(() => (n.current && u.mount(n.current), () => {
|
|
2115
|
-
u.unmount();
|
|
2116
|
-
}), [u]), /* @__PURE__ */ xt("div", { dir: "ltr", className: "tsqd-parent-container", ref: n });
|
|
2117
|
-
}
|
|
2118
|
-
function Lr(e) {
|
|
2119
|
-
const t = Ct(e.client), n = P.useRef(null), { errorTypes: r, styleNonce: s, shadowDOMTarget: i } = e, [o] = P.useState(
|
|
2120
|
-
new Dr({
|
|
2121
|
-
client: t,
|
|
2122
|
-
queryFlavor: "React Query",
|
|
2123
|
-
version: "5",
|
|
2124
|
-
onlineManager: Tt,
|
|
2125
|
-
buttonPosition: "bottom-left",
|
|
2126
|
-
position: "bottom",
|
|
2127
|
-
initialIsOpen: !0,
|
|
2128
|
-
errorTypes: r,
|
|
2129
|
-
styleNonce: s,
|
|
2130
|
-
shadowDOMTarget: i,
|
|
2131
|
-
onClose: e.onClose
|
|
2132
|
-
})
|
|
2133
|
-
);
|
|
2134
|
-
return P.useEffect(() => {
|
|
2135
|
-
o.setClient(t);
|
|
2136
|
-
}, [t, o]), P.useEffect(() => {
|
|
2137
|
-
o.setOnClose(e.onClose ?? (() => {
|
|
2138
|
-
}));
|
|
2139
|
-
}, [e.onClose, o]), P.useEffect(() => {
|
|
2140
|
-
o.setErrorTypes(r || []);
|
|
2141
|
-
}, [r, o]), P.useEffect(() => (n.current && o.mount(n.current), () => {
|
|
2142
|
-
o.unmount();
|
|
2143
|
-
}), [o]), /* @__PURE__ */ xt(
|
|
2144
|
-
"div",
|
|
2145
|
-
{
|
|
2146
|
-
style: { height: "500px", ...e.style },
|
|
2147
|
-
className: "tsqd-parent-container",
|
|
2148
|
-
ref: n
|
|
2149
|
-
}
|
|
2150
|
-
);
|
|
2151
|
-
}
|
|
2152
|
-
var _r = process.env.NODE_ENV !== "development" ? function() {
|
|
2153
|
-
return null;
|
|
2154
|
-
} : Vr, $r = process.env.NODE_ENV !== "development" ? function() {
|
|
2155
|
-
return null;
|
|
2156
|
-
} : Lr;
|
|
2157
|
-
const ys = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
2158
|
-
__proto__: null,
|
|
2159
|
-
ReactQueryDevtools: _r,
|
|
2160
|
-
ReactQueryDevtoolsPanel: $r
|
|
2161
|
-
}, Symbol.toStringTag, { value: "Module" }));
|
|
2162
|
-
export {
|
|
2163
|
-
Pt as $,
|
|
2164
|
-
us as A,
|
|
2165
|
-
cs as B,
|
|
2166
|
-
hs as C,
|
|
2167
|
-
x as D,
|
|
2168
|
-
Qr as E,
|
|
2169
|
-
Xr as F,
|
|
2170
|
-
zn as G,
|
|
2171
|
-
jt as H,
|
|
2172
|
-
K as I,
|
|
2173
|
-
kr as J,
|
|
2174
|
-
Wr as K,
|
|
2175
|
-
Ve as L,
|
|
2176
|
-
qn as M,
|
|
2177
|
-
ss as N,
|
|
2178
|
-
Jr as O,
|
|
2179
|
-
ns as P,
|
|
2180
|
-
Zr as Q,
|
|
2181
|
-
Le as R,
|
|
2182
|
-
Yr as S,
|
|
2183
|
-
xn as T,
|
|
2184
|
-
rs as U,
|
|
2185
|
-
dn as V,
|
|
2186
|
-
ys as W,
|
|
2187
|
-
Bt as a,
|
|
2188
|
-
zr as b,
|
|
2189
|
-
T as c,
|
|
2190
|
-
E as d,
|
|
2191
|
-
Mt as e,
|
|
2192
|
-
Q as f,
|
|
2193
|
-
gs as g,
|
|
2194
|
-
Un as h,
|
|
2195
|
-
it as i,
|
|
2196
|
-
qr as j,
|
|
2197
|
-
st as k,
|
|
2198
|
-
ts as l,
|
|
2199
|
-
ds as m,
|
|
2200
|
-
Bn as n,
|
|
2201
|
-
yn as o,
|
|
2202
|
-
me as p,
|
|
2203
|
-
os as q,
|
|
2204
|
-
Gn as r,
|
|
2205
|
-
fs as s,
|
|
2206
|
-
es as t,
|
|
2207
|
-
Gr as u,
|
|
2208
|
-
Hr as v,
|
|
2209
|
-
Ur as w,
|
|
2210
|
-
is as x,
|
|
2211
|
-
as as y,
|
|
2212
|
-
ls as z
|
|
2213
|
-
};
|