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