soop-avatar 1.0.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +58 -0
- package/dist/client/.vite/manifest.json +12 -0
- package/dist/client/favicon.ico +0 -0
- package/dist/client/index.html +1 -0
- package/dist/client/soop-avatar.css +2 -0
- package/dist/client/soop-avatar.es.js +1982 -0
- package/dist/client/soop-avatar.iife.js +1 -0
- package/package.json +40 -0
|
@@ -0,0 +1,1982 @@
|
|
|
1
|
+
//#region node_modules/@solidjs/signals/dist/prod/core/error.js
|
|
2
|
+
var e = class extends Error {
|
|
3
|
+
source;
|
|
4
|
+
constructor(e) {
|
|
5
|
+
let t = Error, n = t.stackTraceLimit;
|
|
6
|
+
n !== void 0 && (t.stackTraceLimit = 0), super(), n !== void 0 && (t.stackTraceLimit = n), this.source = e;
|
|
7
|
+
}
|
|
8
|
+
}, t = class extends Error {
|
|
9
|
+
source;
|
|
10
|
+
constructor(e, t) {
|
|
11
|
+
super(t instanceof Error ? t.message : String(t), { cause: t }), this.source = e;
|
|
12
|
+
}
|
|
13
|
+
};
|
|
14
|
+
function n(e) {
|
|
15
|
+
return e instanceof t ? e.cause : e;
|
|
16
|
+
}
|
|
17
|
+
var r = 1024, i = 2048, a = 4096, o = 1024, s = 4096, c = {}, l = {};
|
|
18
|
+
function u(e) {
|
|
19
|
+
return e === l ? void 0 : e;
|
|
20
|
+
}
|
|
21
|
+
var d = {}, f = Symbol("refresh"), p = /* @__PURE__ */ new Set();
|
|
22
|
+
function m(e) {
|
|
23
|
+
for (; e.tn;) e = e.tn;
|
|
24
|
+
return e;
|
|
25
|
+
}
|
|
26
|
+
function h(e, t) {
|
|
27
|
+
if (e = m(e), t = m(t), e === t) return e;
|
|
28
|
+
t.tn = e;
|
|
29
|
+
for (let n of t.Ae) e.Ae.add(n);
|
|
30
|
+
return t.Ae.clear(), e.en[0].push(...t.en[0]), e.en[1].push(...t.en[1]), t.en[0].length = 0, t.en[1].length = 0, e;
|
|
31
|
+
}
|
|
32
|
+
function g(e) {
|
|
33
|
+
let t = e.o?.Be;
|
|
34
|
+
if (!t) return;
|
|
35
|
+
let n = m(t);
|
|
36
|
+
if (p.has(n)) return n;
|
|
37
|
+
e.o !== null && (e.o.Be = void 0);
|
|
38
|
+
}
|
|
39
|
+
function _(e) {
|
|
40
|
+
if (v(e) && e.o?.Et) {
|
|
41
|
+
let t = z(e).Et = ke(e.o?.Et);
|
|
42
|
+
if (t.an !== !0) return t;
|
|
43
|
+
e.o !== null && (e.o.Et = null);
|
|
44
|
+
}
|
|
45
|
+
return g(e)?._e ?? e._e;
|
|
46
|
+
}
|
|
47
|
+
function v(e) {
|
|
48
|
+
let t = e.o;
|
|
49
|
+
return t !== null && t.De !== void 0 && t.De !== c;
|
|
50
|
+
}
|
|
51
|
+
function ee(e, t) {
|
|
52
|
+
let n = m(t), r = e.o?.Be;
|
|
53
|
+
if (r) {
|
|
54
|
+
if (r.tn) {
|
|
55
|
+
z(e).Be = t, e.T |= o;
|
|
56
|
+
return;
|
|
57
|
+
}
|
|
58
|
+
let i = m(r);
|
|
59
|
+
if (p.has(i)) {
|
|
60
|
+
i !== n && !v(e) && (n.rn && m(n.rn) === i ? (z(e).Be = t, e.T |= o) : i.rn && m(i.rn) === n || h(n, i));
|
|
61
|
+
return;
|
|
62
|
+
}
|
|
63
|
+
}
|
|
64
|
+
z(e).Be = t, e.T |= o;
|
|
65
|
+
}
|
|
66
|
+
//#endregion
|
|
67
|
+
//#region node_modules/@solidjs/signals/dist/prod/core/scheduler.js
|
|
68
|
+
var y = /* @__PURE__ */ new Set(), b = {
|
|
69
|
+
eE: Array(2e3).fill(void 0),
|
|
70
|
+
tE: !1,
|
|
71
|
+
xe: 0,
|
|
72
|
+
EE: 0
|
|
73
|
+
}, x = {
|
|
74
|
+
eE: Array(2e3).fill(void 0),
|
|
75
|
+
tE: !1,
|
|
76
|
+
xe: 0,
|
|
77
|
+
EE: 0
|
|
78
|
+
};
|
|
79
|
+
function te(e) {
|
|
80
|
+
e.ie & 16 ? e.ie &= -12 : (j(e, x), e.ie &= -4);
|
|
81
|
+
}
|
|
82
|
+
var S = 0, C = null, w = !1, ne = !1, re = !1, ie = 0, ae = /* @__PURE__ */ new Set();
|
|
83
|
+
function oe(e) {
|
|
84
|
+
let t = e.k;
|
|
85
|
+
return y.size === 0 && p.size === 0 && e.Qt.length === 0 && t.Ke.length === 0 && t.m.length === 0 && t.cn.size === 0 && ae.size === 0;
|
|
86
|
+
}
|
|
87
|
+
function se() {
|
|
88
|
+
if (ae.size !== 0) for (let e of ae) {
|
|
89
|
+
if (e.u !== null) {
|
|
90
|
+
ae.delete(e);
|
|
91
|
+
continue;
|
|
92
|
+
}
|
|
93
|
+
e.Pe === c && (e.o?.De === void 0 || e.o?.De === c) && (e.o?.t || (ae.delete(e), e.o?.ft?.()));
|
|
94
|
+
}
|
|
95
|
+
}
|
|
96
|
+
function ce() {
|
|
97
|
+
return {
|
|
98
|
+
Te: S,
|
|
99
|
+
yt: [],
|
|
100
|
+
Ne: /* @__PURE__ */ new Map(),
|
|
101
|
+
Ke: [],
|
|
102
|
+
m: [],
|
|
103
|
+
cn: /* @__PURE__ */ new Set(),
|
|
104
|
+
oe: [],
|
|
105
|
+
bt: {
|
|
106
|
+
Lt: [[], []],
|
|
107
|
+
Qt: []
|
|
108
|
+
},
|
|
109
|
+
an: !1,
|
|
110
|
+
ln: /* @__PURE__ */ new Set()
|
|
111
|
+
};
|
|
112
|
+
}
|
|
113
|
+
function le(e, t) {
|
|
114
|
+
t.an = e, e.oe.push(...t.oe);
|
|
115
|
+
for (let n of p) n._e === t && (n._e = e);
|
|
116
|
+
t.Ke.length && (e.Ke.push(...t.Ke), t.Ke.length = 0), t.m.length && (e.m.push(...t.m), t.m.length = 0);
|
|
117
|
+
for (let n of t.cn) e.cn.add(n);
|
|
118
|
+
for (let [n, r] of t.Ne) {
|
|
119
|
+
let t = e.Ne.get(n);
|
|
120
|
+
t || e.Ne.set(n, t = /* @__PURE__ */ new Set());
|
|
121
|
+
for (let e of r) t.add(e);
|
|
122
|
+
}
|
|
123
|
+
for (let n of t.ln) e.ln.add(n);
|
|
124
|
+
}
|
|
125
|
+
function T() {
|
|
126
|
+
if (ne) {
|
|
127
|
+
de();
|
|
128
|
+
return;
|
|
129
|
+
}
|
|
130
|
+
w || (w = !0, !ie && !O.sn && queueMicrotask(Te));
|
|
131
|
+
}
|
|
132
|
+
function ue(e) {
|
|
133
|
+
if (ne) return;
|
|
134
|
+
ne = !0;
|
|
135
|
+
let t = "[REACTIVITY_HALTED]";
|
|
136
|
+
e === void 0 ? console.error(t) : console.error(t, e);
|
|
137
|
+
}
|
|
138
|
+
function de() {
|
|
139
|
+
re || (re = !0, console.error("[REACTIVITY_HALTED]"));
|
|
140
|
+
}
|
|
141
|
+
var fe = 0, pe = class {
|
|
142
|
+
ve = null;
|
|
143
|
+
Lt = [[], []];
|
|
144
|
+
Qt = [];
|
|
145
|
+
Mt = 0;
|
|
146
|
+
created = S;
|
|
147
|
+
addChild(e) {
|
|
148
|
+
this.Qt.push(e), e.ve = this;
|
|
149
|
+
}
|
|
150
|
+
removeChild(e) {
|
|
151
|
+
let t = this.Qt.indexOf(e);
|
|
152
|
+
t >= 0 && (this.Qt.splice(t, 1), e.ve = null);
|
|
153
|
+
}
|
|
154
|
+
notify(e, t, n, r) {
|
|
155
|
+
return this.ve ? this.ve.notify(e, t, n, r) : !1;
|
|
156
|
+
}
|
|
157
|
+
run(e) {
|
|
158
|
+
if (this.Lt[e - 1].length) {
|
|
159
|
+
let t = this.Lt[e - 1];
|
|
160
|
+
this.Lt[e - 1] = [], Ee(t, e);
|
|
161
|
+
}
|
|
162
|
+
let t = this.Qt, n = ++fe;
|
|
163
|
+
for (let r = 0; r < t.length;) {
|
|
164
|
+
let i = t[r];
|
|
165
|
+
if (i.Mt !== n && (i.Mt = n, i.run?.(e), t[r] !== i)) {
|
|
166
|
+
r = 0;
|
|
167
|
+
continue;
|
|
168
|
+
}
|
|
169
|
+
r++;
|
|
170
|
+
}
|
|
171
|
+
}
|
|
172
|
+
enqueue(e, t) {
|
|
173
|
+
e && (L ? m(L).en[e - 1].push(t) : this.Lt[e - 1].push(t)), T();
|
|
174
|
+
}
|
|
175
|
+
stashQueues(e) {
|
|
176
|
+
e.Lt[0].push(...this.Lt[0]), e.Lt[1].push(...this.Lt[1]), this.Lt = [[], []];
|
|
177
|
+
for (let t = 0; t < this.Qt.length; t++) {
|
|
178
|
+
let n = this.Qt[t], r = e.Qt[t];
|
|
179
|
+
r || (r = {
|
|
180
|
+
Lt: [[], []],
|
|
181
|
+
Qt: []
|
|
182
|
+
}, e.Qt[t] = r), n.stashQueues(r);
|
|
183
|
+
}
|
|
184
|
+
}
|
|
185
|
+
restoreQueues(e) {
|
|
186
|
+
this.Lt[0].push(...e.Lt[0]), this.Lt[1].push(...e.Lt[1]);
|
|
187
|
+
for (let t = 0; t < e.Qt.length; t++) {
|
|
188
|
+
let n = e.Qt[t], r = this.Qt[t];
|
|
189
|
+
r && r.restoreQueues(n);
|
|
190
|
+
}
|
|
191
|
+
}
|
|
192
|
+
}, E = class e extends pe {
|
|
193
|
+
sn = !1;
|
|
194
|
+
k = ce();
|
|
195
|
+
static Ce;
|
|
196
|
+
static Fe;
|
|
197
|
+
static tt;
|
|
198
|
+
static Vt = null;
|
|
199
|
+
static G = null;
|
|
200
|
+
static M = null;
|
|
201
|
+
static h = null;
|
|
202
|
+
static j = null;
|
|
203
|
+
static Rt = null;
|
|
204
|
+
static Gt = null;
|
|
205
|
+
static Oe = null;
|
|
206
|
+
static de = null;
|
|
207
|
+
static ye = null;
|
|
208
|
+
static un = null;
|
|
209
|
+
static Pt = null;
|
|
210
|
+
static Dt = null;
|
|
211
|
+
static Ht = null;
|
|
212
|
+
static Je = null;
|
|
213
|
+
static p = null;
|
|
214
|
+
static Bt = null;
|
|
215
|
+
static wt = null;
|
|
216
|
+
static vt = null;
|
|
217
|
+
static fn = null;
|
|
218
|
+
static En = null;
|
|
219
|
+
static Tn = null;
|
|
220
|
+
static dn = null;
|
|
221
|
+
static Ft = null;
|
|
222
|
+
static ht = null;
|
|
223
|
+
static gt = null;
|
|
224
|
+
static je = null;
|
|
225
|
+
static $e = null;
|
|
226
|
+
static ze = null;
|
|
227
|
+
static In = null;
|
|
228
|
+
flush() {
|
|
229
|
+
if (!this.sn) {
|
|
230
|
+
if (C === null && b.EE < b.xe && this.Lt[0].length === 0 && this.Lt[1].length === 0 && this.Qt.length === 0 && oe(this)) {
|
|
231
|
+
this.sn = !0;
|
|
232
|
+
try {
|
|
233
|
+
be();
|
|
234
|
+
} finally {
|
|
235
|
+
this.sn = !1;
|
|
236
|
+
}
|
|
237
|
+
S++, w = b.EE >= b.xe || this.Lt[0].length !== 0 || this.Lt[1].length !== 0 || this.k.yt.length !== 0;
|
|
238
|
+
return;
|
|
239
|
+
}
|
|
240
|
+
this.sn = !0;
|
|
241
|
+
try {
|
|
242
|
+
if (Ie(b, e.Ce), C) {
|
|
243
|
+
if (!Oe(C)) {
|
|
244
|
+
let t = C;
|
|
245
|
+
Ie(x, this.k === t ? te : e.Ce), this.k === t && (we = this.k = ce()), p.size && (e.dn(1), e.dn(2)), this.stashQueues(t.bt), S++, w = b.EE >= b.xe || this.k.yt.length > 0, Ce(t.yt), C = null, xe(null, !0);
|
|
246
|
+
return;
|
|
247
|
+
}
|
|
248
|
+
let t = C, n = this.k;
|
|
249
|
+
if (n !== t && n.yt.push(...t.yt), this.restoreQueues(t.bt), y.delete(t), C = null, Ce(n.yt), xe(t), n === t) {
|
|
250
|
+
let e = ce();
|
|
251
|
+
e.yt = n.yt, e.Ke = n.Ke, e.m = n.m, e.cn = n.cn, we = this.k = e;
|
|
252
|
+
}
|
|
253
|
+
} else oe(this) ? (be(), b.EE >= b.xe && (Ie(b, e.Ce), be())) : (y.size && Ie(x, e.Ce), xe());
|
|
254
|
+
S++, w = b.EE >= b.xe, p.size && e.dn(1), this.run(1), p.size && e.dn(2), this.run(2);
|
|
255
|
+
} finally {
|
|
256
|
+
this.sn = !1;
|
|
257
|
+
}
|
|
258
|
+
}
|
|
259
|
+
}
|
|
260
|
+
notify(t, n, r, i) {
|
|
261
|
+
if (n & 1) {
|
|
262
|
+
if (r & 1) {
|
|
263
|
+
let n = i === void 0 ? t.o?._ : i;
|
|
264
|
+
if (n?.i) return !0;
|
|
265
|
+
if (C && n) {
|
|
266
|
+
let r = n.source, i = C.Ne.get(r);
|
|
267
|
+
i || C.Ne.set(r, i = /* @__PURE__ */ new Set());
|
|
268
|
+
let a = i.size;
|
|
269
|
+
i.add(t), i.size !== a && (T(), e.wt?.(C));
|
|
270
|
+
}
|
|
271
|
+
}
|
|
272
|
+
return !0;
|
|
273
|
+
}
|
|
274
|
+
return !1;
|
|
275
|
+
}
|
|
276
|
+
initTransition(e) {
|
|
277
|
+
if (e &&= ke(e), e && e === C || !e && C && C.Te === S) return;
|
|
278
|
+
if (!C) C = e ?? ce();
|
|
279
|
+
else if (e) {
|
|
280
|
+
let t = C;
|
|
281
|
+
le(e, t), y.delete(t), C = e;
|
|
282
|
+
}
|
|
283
|
+
y.add(C), C.Te = S;
|
|
284
|
+
let t = this.k;
|
|
285
|
+
if (t !== C) {
|
|
286
|
+
for (let e = 0; e < t.yt.length; e++) {
|
|
287
|
+
let n = t.yt[e];
|
|
288
|
+
n._e = C, C.yt.push(n);
|
|
289
|
+
}
|
|
290
|
+
for (let e = 0; e < t.Ke.length; e++) {
|
|
291
|
+
let n = t.Ke[e];
|
|
292
|
+
n._e = C, C.Ke.push(n);
|
|
293
|
+
}
|
|
294
|
+
t.m.length && C.m.push(...t.m);
|
|
295
|
+
for (let e of t.cn) C.cn.add(e);
|
|
296
|
+
if (t.ln.size) {
|
|
297
|
+
for (let e of t.ln) C.ln.add(e);
|
|
298
|
+
t.ln.clear();
|
|
299
|
+
}
|
|
300
|
+
we = this.k = C;
|
|
301
|
+
}
|
|
302
|
+
for (let e of p) e._e ||= C;
|
|
303
|
+
}
|
|
304
|
+
};
|
|
305
|
+
function D(e) {
|
|
306
|
+
we.yt.push(e);
|
|
307
|
+
}
|
|
308
|
+
var me = !1, he = 0;
|
|
309
|
+
function ge() {
|
|
310
|
+
he++;
|
|
311
|
+
}
|
|
312
|
+
function _e(e, t = !1) {
|
|
313
|
+
e._t = he;
|
|
314
|
+
let n = e.T, r = (n & 1024 ? e.o?.Be : void 0) || L, o = !!(n & 512) && e.o?.Qe !== void 0, s = me;
|
|
315
|
+
for (let n = e.u; n !== null; n = n.fe) {
|
|
316
|
+
let e = n.ae;
|
|
317
|
+
if (s && (e.ie &= ~i), e.ie & 4 && n.ll === e.Ze && n !== e.Ye && (e.ie |= a), o && e.T & 8) {
|
|
318
|
+
e.ie |= 256;
|
|
319
|
+
continue;
|
|
320
|
+
}
|
|
321
|
+
t && r ? (e.ie |= 128, ee(e, r)) : t && (e.ie |= 128, e.o && (e.o.Be = void 0)), A(e);
|
|
322
|
+
}
|
|
323
|
+
}
|
|
324
|
+
function ve(e) {
|
|
325
|
+
let t = e;
|
|
326
|
+
if (!t.Se) {
|
|
327
|
+
e.Pe !== c && (e.be = e.Pe, e.Pe = c), e.T & 256 && E.un(e);
|
|
328
|
+
return;
|
|
329
|
+
}
|
|
330
|
+
e.Pe !== c && (e.be = e.Pe, e.Pe = c, e.Re && e.Re !== 3 && (e.Xe = !0)), t.Ie = !1, t.ie &= ~r, t.S & 1 || (t.S &= -5), t.o != null && (t.o.qe !== null || t.o.We !== null) && E.Fe(t, !1, !0), e.T & 256 && E.un(e);
|
|
331
|
+
}
|
|
332
|
+
var ye = null;
|
|
333
|
+
function be() {
|
|
334
|
+
let e = we.yt;
|
|
335
|
+
for (let t = 0; t < e.length; t++) ve(e[t]);
|
|
336
|
+
e.length = 0, ye?.();
|
|
337
|
+
}
|
|
338
|
+
function xe(e = null, t = !1) {
|
|
339
|
+
let n = !t;
|
|
340
|
+
n && be(), !t && O.Qt.length && Se(O);
|
|
341
|
+
let r = b.EE >= b.xe;
|
|
342
|
+
if (r && Ie(b, E.Ce), n) {
|
|
343
|
+
r && be();
|
|
344
|
+
let t = e ?? O.k;
|
|
345
|
+
if (t.Ke.length && E.fn(t.Ke), t.ln.size) {
|
|
346
|
+
for (let e of t.ln) e.ie & 64 || A(e);
|
|
347
|
+
t.ln.clear(), T();
|
|
348
|
+
}
|
|
349
|
+
t.m.length && (E.M(t.m), O.Qt.length && Se(O)), t.cn.size && E.Vt(t.cn, e), se(), p.size && E.Tn(e);
|
|
350
|
+
}
|
|
351
|
+
}
|
|
352
|
+
function Se(e) {
|
|
353
|
+
for (let t of e.Qt) t.se?.(), Se(t);
|
|
354
|
+
}
|
|
355
|
+
function Ce(e) {
|
|
356
|
+
for (let t = 0; t < e.length; t++) e[t]._e = C;
|
|
357
|
+
}
|
|
358
|
+
var O = new E(), we = O.k;
|
|
359
|
+
function Te(e) {
|
|
360
|
+
if (e) {
|
|
361
|
+
ie++;
|
|
362
|
+
try {
|
|
363
|
+
return e();
|
|
364
|
+
} finally {
|
|
365
|
+
try {
|
|
366
|
+
Te();
|
|
367
|
+
} finally {
|
|
368
|
+
ie--;
|
|
369
|
+
}
|
|
370
|
+
}
|
|
371
|
+
}
|
|
372
|
+
if (!O.sn && !ne) for (; w || C;) O.flush();
|
|
373
|
+
}
|
|
374
|
+
function Ee(e, t) {
|
|
375
|
+
for (let n = 0; n < e.length; n++) e[n](t);
|
|
376
|
+
}
|
|
377
|
+
function De(t, n) {
|
|
378
|
+
if (t.ie & 96) return !1;
|
|
379
|
+
if (t.o?.le?.has(n)) return !0;
|
|
380
|
+
for (let e = t.nt; e; e = e.it) {
|
|
381
|
+
let t = e.ut;
|
|
382
|
+
for (; t;) {
|
|
383
|
+
if (t === n || t.lt === n) return !0;
|
|
384
|
+
t = t.o?.It;
|
|
385
|
+
}
|
|
386
|
+
}
|
|
387
|
+
return !!(t.S & 1 && t.o?._ instanceof e && t.o?._.source === n);
|
|
388
|
+
}
|
|
389
|
+
function Oe(e) {
|
|
390
|
+
if (e.an) return !0;
|
|
391
|
+
if (e.oe.length) return !1;
|
|
392
|
+
let t = !0;
|
|
393
|
+
for (let [n, r] of e.Ne) {
|
|
394
|
+
let i = !1;
|
|
395
|
+
for (let e of r) {
|
|
396
|
+
if (De(e, n)) {
|
|
397
|
+
i = !0;
|
|
398
|
+
break;
|
|
399
|
+
}
|
|
400
|
+
r.delete(e);
|
|
401
|
+
}
|
|
402
|
+
if (!i) e.Ne.delete(n);
|
|
403
|
+
else if (n.S & 1 && n.o?._?.source === n) {
|
|
404
|
+
t = !1;
|
|
405
|
+
break;
|
|
406
|
+
}
|
|
407
|
+
}
|
|
408
|
+
return t && E.En?.(e) && (t = !1), t && (e.an = !0), t;
|
|
409
|
+
}
|
|
410
|
+
function ke(e) {
|
|
411
|
+
for (; e.an && typeof e.an == "object";) e = e.an;
|
|
412
|
+
return e;
|
|
413
|
+
}
|
|
414
|
+
function Ae(e, t) {
|
|
415
|
+
let n = C;
|
|
416
|
+
try {
|
|
417
|
+
return C = ke(e), t();
|
|
418
|
+
} finally {
|
|
419
|
+
C = n;
|
|
420
|
+
}
|
|
421
|
+
}
|
|
422
|
+
//#endregion
|
|
423
|
+
//#region node_modules/@solidjs/signals/dist/prod/core/heap.js
|
|
424
|
+
function k(e) {
|
|
425
|
+
return e.ie & 32 ? x : b;
|
|
426
|
+
}
|
|
427
|
+
function A(e) {
|
|
428
|
+
if (e.Re === 3) {
|
|
429
|
+
let t = e;
|
|
430
|
+
t.Xe || (t.Xe = !0, t.C.enqueue(2, t.Ut));
|
|
431
|
+
return;
|
|
432
|
+
}
|
|
433
|
+
let t = k(e);
|
|
434
|
+
t.xe > e.Le && (t.xe = e.Le), Me(e, t);
|
|
435
|
+
}
|
|
436
|
+
function je(e, t) {
|
|
437
|
+
let n = (e.ve?.Ct ? e.ve.Ot?.Le : e.ve?.Le) ?? -1;
|
|
438
|
+
n >= e.Le && (e.Le = n + 1);
|
|
439
|
+
let r = e.Le, i = t.eE[r];
|
|
440
|
+
if (i === void 0) t.eE[r] = e;
|
|
441
|
+
else {
|
|
442
|
+
let t = i.st;
|
|
443
|
+
t.ot = e, e.st = t, i.st = e;
|
|
444
|
+
}
|
|
445
|
+
r > t.EE && (t.EE = r);
|
|
446
|
+
}
|
|
447
|
+
function Me(e, t) {
|
|
448
|
+
let n = e.ie;
|
|
449
|
+
n & 1036 || (n & 1 ? e.ie = n & -4 | 10 : (e.ie = n | 8, t.tE && !(n & 2) && (t.tE = !1)), n & 16 || je(e, t));
|
|
450
|
+
}
|
|
451
|
+
function Ne(e, t) {
|
|
452
|
+
let n = e.ie;
|
|
453
|
+
n & 1052 || (e.ie = n | 16, je(e, t));
|
|
454
|
+
}
|
|
455
|
+
function j(e, t) {
|
|
456
|
+
let n = e.ie;
|
|
457
|
+
if (!(n & 24)) return;
|
|
458
|
+
e.ie = n & -25;
|
|
459
|
+
let r = e.Le;
|
|
460
|
+
if (e.st === e) t.eE[r] = void 0;
|
|
461
|
+
else {
|
|
462
|
+
let n = e.ot, i = t.eE[r], a = n ?? i;
|
|
463
|
+
e === i ? t.eE[r] = n : e.st.ot = n, a.st = e.st;
|
|
464
|
+
}
|
|
465
|
+
e.st = e, e.ot = void 0;
|
|
466
|
+
}
|
|
467
|
+
function Pe(e) {
|
|
468
|
+
if (!e.tE) {
|
|
469
|
+
e.tE = !0;
|
|
470
|
+
for (let t = 0; t <= e.EE; t++) for (let n = e.eE[t]; n !== void 0; n = n.ot) n.ie & 8 && Fe(n);
|
|
471
|
+
}
|
|
472
|
+
}
|
|
473
|
+
function Fe(e, t = 2) {
|
|
474
|
+
let n = e.ie;
|
|
475
|
+
if (!((n & 3) >= t)) {
|
|
476
|
+
e.ie = n & -4 | t;
|
|
477
|
+
for (let t = e.u; t !== null; t = t.fe) Fe(t.ae, 1);
|
|
478
|
+
if (e.T & 4096) for (let t = e.o.l; t !== null; t = t.ce) for (let e = t.u; e !== null; e = e.fe) Fe(e.ae, 1);
|
|
479
|
+
}
|
|
480
|
+
}
|
|
481
|
+
function Ie(e, t) {
|
|
482
|
+
for (e.tE = !1, e.xe = 0; e.xe <= e.EE; e.xe++) {
|
|
483
|
+
let n = e.eE[e.xe];
|
|
484
|
+
for (; n !== void 0;) n.ie & 8 ? t(n) : Le(n, e), n = e.eE[e.xe];
|
|
485
|
+
}
|
|
486
|
+
e.EE = 0;
|
|
487
|
+
}
|
|
488
|
+
function Le(e, t) {
|
|
489
|
+
j(e, t);
|
|
490
|
+
let n = e.Le;
|
|
491
|
+
for (let t = e.nt; t; t = t.it) {
|
|
492
|
+
let e = t.ut, r = e.lt || e;
|
|
493
|
+
r.Se && r.Le >= n && (n = r.Le + 1);
|
|
494
|
+
}
|
|
495
|
+
if (e.Le !== n) {
|
|
496
|
+
e.Le = n;
|
|
497
|
+
for (let t = e.u; t !== null; t = t.fe) Ne(t.ae, k(t.ae));
|
|
498
|
+
}
|
|
499
|
+
}
|
|
500
|
+
//#endregion
|
|
501
|
+
//#region node_modules/@solidjs/signals/dist/prod/core/owner.js
|
|
502
|
+
function Re(e) {
|
|
503
|
+
let t = e.ke;
|
|
504
|
+
for (; t;) {
|
|
505
|
+
let e = t.ie;
|
|
506
|
+
t.ie = e | 32, e & 24 && (j(t, e & 32 ? x : b), e & 8 ? Me(t, x) : Ne(t, x)), Re(t), t = t.Ve;
|
|
507
|
+
}
|
|
508
|
+
}
|
|
509
|
+
function ze(e, t = !1, n) {
|
|
510
|
+
let r = e.ie;
|
|
511
|
+
if (r & 64) return;
|
|
512
|
+
if (t) {
|
|
513
|
+
e.ie = r | 64;
|
|
514
|
+
let t = e;
|
|
515
|
+
(t.o?.Ge || t.o?.ge) && E.un(t);
|
|
516
|
+
}
|
|
517
|
+
t && e.Se && e.o !== null && (e.o.Ee = null);
|
|
518
|
+
let i = n ? e.o?.qe ?? null : e.ke;
|
|
519
|
+
for (; i;) {
|
|
520
|
+
let e = i.Ve, t = i;
|
|
521
|
+
t.T &= -33, j(t, k(t)), Xe(t), ze(i, !0), i = e;
|
|
522
|
+
}
|
|
523
|
+
if (n ? e.o !== null && (e.o.qe = null) : (e.ke = null, e.Me = 0), t && !n && !(r & 32) && e.ve !== null && !(e.ve.ie & 64)) {
|
|
524
|
+
let t = e.ct, n = e.Ve;
|
|
525
|
+
t === null ? e.ve.ke = n : t.Ve = n, n !== null && (n.ct = t), e.ct = null;
|
|
526
|
+
}
|
|
527
|
+
if (Be(e, n), t && e.At) {
|
|
528
|
+
let t = e.At;
|
|
529
|
+
e.At = void 0, t();
|
|
530
|
+
}
|
|
531
|
+
}
|
|
532
|
+
function Be(e, t) {
|
|
533
|
+
let n = t ? e.o?.We : e.he;
|
|
534
|
+
if (n) {
|
|
535
|
+
if (Array.isArray(n)) for (let e = 0; e < n.length; e++) {
|
|
536
|
+
let t = n[e];
|
|
537
|
+
t.call(t);
|
|
538
|
+
}
|
|
539
|
+
else n.call(n);
|
|
540
|
+
t ? e.o !== null && (e.o.We = null) : e.he = null;
|
|
541
|
+
}
|
|
542
|
+
}
|
|
543
|
+
function Ve(e, t) {
|
|
544
|
+
let n = e;
|
|
545
|
+
for (; n.T & 4 && n.ve;) n = n.ve;
|
|
546
|
+
if (n.id != null) return We(n.id, t ? n.Me++ : n.Me);
|
|
547
|
+
throw Error("");
|
|
548
|
+
}
|
|
549
|
+
function He(e) {
|
|
550
|
+
return Ve(e, !0);
|
|
551
|
+
}
|
|
552
|
+
function Ue(e, t, n) {
|
|
553
|
+
return e?.id ?? (t ? n?.id : n?.id == null ? void 0 : He(n));
|
|
554
|
+
}
|
|
555
|
+
function We(e, t) {
|
|
556
|
+
let n = t.toString(36), r = n.length - 1;
|
|
557
|
+
return e + (r ? String.fromCharCode(64 + r) : "") + n;
|
|
558
|
+
}
|
|
559
|
+
function Ge(e) {
|
|
560
|
+
return I && (I.he ? Array.isArray(I.he) ? I.he.push(e) : I.he = [I.he, e] : I.he = e), e;
|
|
561
|
+
}
|
|
562
|
+
function Ke(e = !0) {
|
|
563
|
+
ze(this, e);
|
|
564
|
+
}
|
|
565
|
+
function M(e) {
|
|
566
|
+
let t = I, n = e?.transparent ?? !1, r = {
|
|
567
|
+
id: Ue(e, n, t),
|
|
568
|
+
T: n ? 4 : 0,
|
|
569
|
+
Ct: !0,
|
|
570
|
+
Ot: t?.Ct ? t.Ot : t,
|
|
571
|
+
ke: null,
|
|
572
|
+
Ve: null,
|
|
573
|
+
ct: null,
|
|
574
|
+
he: null,
|
|
575
|
+
C: t?.C ?? O,
|
|
576
|
+
we: t?.we || d,
|
|
577
|
+
Me: 0,
|
|
578
|
+
o: null,
|
|
579
|
+
ve: t,
|
|
580
|
+
dispose: Ke
|
|
581
|
+
};
|
|
582
|
+
if (t) {
|
|
583
|
+
let e = t.ke;
|
|
584
|
+
e === null ? t.ke = r : (r.Ve = e, e.ct = r, t.ke = r);
|
|
585
|
+
}
|
|
586
|
+
return r;
|
|
587
|
+
}
|
|
588
|
+
function qe(e, t) {
|
|
589
|
+
let n = M(t);
|
|
590
|
+
return W(n, () => e(() => n.dispose()));
|
|
591
|
+
}
|
|
592
|
+
//#endregion
|
|
593
|
+
//#region node_modules/@solidjs/signals/dist/prod/core/graph.js
|
|
594
|
+
function Je(e) {
|
|
595
|
+
let t = e.ut, n = e.it, r = e.fe, i = e.el;
|
|
596
|
+
if (r === null ? t.rt = i : r.el = i, i !== null) i.fe = r;
|
|
597
|
+
else if (t.u = r, r === null) {
|
|
598
|
+
t.o?.ft?.();
|
|
599
|
+
let e = t;
|
|
600
|
+
e.Se && e.T & 32 && !(e.ie & 32) && !(e.S & 1) && Ze(e);
|
|
601
|
+
}
|
|
602
|
+
return n;
|
|
603
|
+
}
|
|
604
|
+
function Ye(e) {
|
|
605
|
+
let t = e.Ye, n = t === null ? e.nt : t.it;
|
|
606
|
+
if (n !== null) {
|
|
607
|
+
do
|
|
608
|
+
n = Je(n);
|
|
609
|
+
while (n !== null);
|
|
610
|
+
t === null ? e.nt = null : t.it = null;
|
|
611
|
+
}
|
|
612
|
+
}
|
|
613
|
+
function Xe(e) {
|
|
614
|
+
let t = e.nt;
|
|
615
|
+
if (t) {
|
|
616
|
+
do
|
|
617
|
+
t = Je(t);
|
|
618
|
+
while (t !== null);
|
|
619
|
+
e.nt = null, e.Ye = null;
|
|
620
|
+
}
|
|
621
|
+
}
|
|
622
|
+
function Ze(e) {
|
|
623
|
+
j(e, k(e)), Xe(e), ze(e, !0);
|
|
624
|
+
}
|
|
625
|
+
function Qe(e, t, n = !1) {
|
|
626
|
+
let r = t.Ye;
|
|
627
|
+
if (r !== null && r.ut === e) {
|
|
628
|
+
r.me &&= n;
|
|
629
|
+
return;
|
|
630
|
+
}
|
|
631
|
+
let i = null, a = t.ie & 4;
|
|
632
|
+
if (a && (i = r === null ? t.nt : r.it, i !== null && i.ut === e)) {
|
|
633
|
+
i.ll = t.Ze, t.Ye = i, i.me = n;
|
|
634
|
+
return;
|
|
635
|
+
}
|
|
636
|
+
let o = e.rt;
|
|
637
|
+
if (o !== null && o.ae === t && (!a || o.ll === t.Ze)) {
|
|
638
|
+
a ? o.me &&= n : o.me = n;
|
|
639
|
+
return;
|
|
640
|
+
}
|
|
641
|
+
let s = t.Ye = e.rt = {
|
|
642
|
+
ut: e,
|
|
643
|
+
ae: t,
|
|
644
|
+
it: i,
|
|
645
|
+
el: o,
|
|
646
|
+
fe: null,
|
|
647
|
+
ll: t.Ze,
|
|
648
|
+
me: n
|
|
649
|
+
};
|
|
650
|
+
r === null ? t.nt = s : r.it = s, o === null ? e.u = s : o.fe = s, ge();
|
|
651
|
+
}
|
|
652
|
+
//#endregion
|
|
653
|
+
//#region node_modules/@solidjs/signals/dist/prod/core/async.js
|
|
654
|
+
function $e(e, t) {
|
|
655
|
+
return !e.o?.le?.has(t) && ((z(e).le ??= /* @__PURE__ */ new Set()).add(t), !0);
|
|
656
|
+
}
|
|
657
|
+
function et(e, t) {
|
|
658
|
+
return e.o?.le?.delete(t) ? (e.o?.le.size === 0 && e.o !== null && (e.o.le = void 0), !0) : !1;
|
|
659
|
+
}
|
|
660
|
+
function tt(e) {
|
|
661
|
+
e.o?.le?.clear(), e.o !== null && (e.o.le = void 0);
|
|
662
|
+
}
|
|
663
|
+
function nt(e, t) {
|
|
664
|
+
z(e).ue = !0, t.source && $e(e, t.source), e.S & 2 || rt(e, t.source, t);
|
|
665
|
+
}
|
|
666
|
+
function rt(t, n, r) {
|
|
667
|
+
if (!n) {
|
|
668
|
+
t.o !== null && (t.o._ = null);
|
|
669
|
+
return;
|
|
670
|
+
}
|
|
671
|
+
if (r instanceof e && r.source === n) {
|
|
672
|
+
z(t)._ = r;
|
|
673
|
+
return;
|
|
674
|
+
}
|
|
675
|
+
let i = t.o?._;
|
|
676
|
+
(!(i instanceof e) || i.source !== n) && (z(t)._ = new e(n));
|
|
677
|
+
}
|
|
678
|
+
function N(e, t) {
|
|
679
|
+
for (let n = e.u; n !== null; n = n.fe) t(n.ae, n);
|
|
680
|
+
for (let n = e.o?.l ?? null; n !== null; n = n.ce) for (let e = n.u; e !== null; e = e.fe) t(e.ae, e);
|
|
681
|
+
}
|
|
682
|
+
function it(e) {
|
|
683
|
+
e.Se && e.T & 32 && !e.u && !(e.ie & 32) && !(e.S & 1) && Ze(e);
|
|
684
|
+
}
|
|
685
|
+
function at(e) {
|
|
686
|
+
let t, n = /* @__PURE__ */ new Set(), r = (e) => {
|
|
687
|
+
n.has(e) || (n.add(e), !e.u && e.T & 32 && (t ??= []).push(e), N(e, r));
|
|
688
|
+
};
|
|
689
|
+
if (N(e, r), t) for (let e of t) it(e);
|
|
690
|
+
}
|
|
691
|
+
function ot(e, t) {
|
|
692
|
+
let n = !1, r = /* @__PURE__ */ new Set(), i = (e) => {
|
|
693
|
+
r.has(e) || (r.add(e), e.o?._ === t && (A(e), n = !0), N(e, i));
|
|
694
|
+
};
|
|
695
|
+
N(e, i), n && T();
|
|
696
|
+
}
|
|
697
|
+
function st(e) {
|
|
698
|
+
let t = !1, n, r = /* @__PURE__ */ new Set(), i = E.de, a = (o) => {
|
|
699
|
+
if (r.has(o) || !et(o, e)) return;
|
|
700
|
+
r.add(o), o.Te = S;
|
|
701
|
+
let s = o.o?.le?.values().next().value, c = o.S & 2;
|
|
702
|
+
s ? (c || rt(o, s), i !== null && i(o)) : (o.S &= -2, c || rt(o), i !== null && i(o), o.o?.ue && (A(o), t = !0), o.o !== null && (o.o.ue = !1), !o.u && o.T & 32 && (n ??= []).push(o)), N(o, a);
|
|
703
|
+
};
|
|
704
|
+
if (N(e, a), n) for (let e of n) it(e);
|
|
705
|
+
t && T();
|
|
706
|
+
}
|
|
707
|
+
function ct(e) {
|
|
708
|
+
return typeof e == "object" && !!e && typeof e.then == "function";
|
|
709
|
+
}
|
|
710
|
+
function lt(t, n, r) {
|
|
711
|
+
let i = !1, a = !1;
|
|
712
|
+
if (typeof n == "object" && n && V(() => {
|
|
713
|
+
i = n[Symbol.asyncIterator], a = !i && ct(n);
|
|
714
|
+
}), !a && !i) return t.o !== null && (t.o.Ee = null), t.Ie = !1, n;
|
|
715
|
+
z(t).Ee = n;
|
|
716
|
+
let o, s = () => {
|
|
717
|
+
let e = _(t);
|
|
718
|
+
if (e && t.S & 4 && !ke(e).Ne.has(t)) {
|
|
719
|
+
t._e = null;
|
|
720
|
+
return;
|
|
721
|
+
}
|
|
722
|
+
O.initTransition(e);
|
|
723
|
+
}, l = (r) => {
|
|
724
|
+
if (t.o?.Ee !== n) return;
|
|
725
|
+
let i = r instanceof e;
|
|
726
|
+
if (i && t.Ie) {
|
|
727
|
+
t.o !== null && (t.o.Ee = null), nt(t, r), t.Te = S;
|
|
728
|
+
return;
|
|
729
|
+
}
|
|
730
|
+
s(), P(t, i ? 1 : 2, r), t.Te = S, i || at(t);
|
|
731
|
+
}, u = (e, i) => {
|
|
732
|
+
if (t.o?.Ee !== n || t.ie & 130) return;
|
|
733
|
+
s();
|
|
734
|
+
let a = !!(t.S & 4);
|
|
735
|
+
Ye(t), ut(t);
|
|
736
|
+
let o = g(t);
|
|
737
|
+
if (o && o.Ae.delete(t), r) r(e), a && ut(t, !0);
|
|
738
|
+
else if (t.o?.De !== void 0) t.Pe === c && D(t), t.Pe = e, E.Oe !== null && E.Oe(t, e), v(t) || _e(t), t.Te = S;
|
|
739
|
+
else if (o) {
|
|
740
|
+
let n = t.Re, r = t.be, i = t.Ue;
|
|
741
|
+
try {
|
|
742
|
+
(!n && a || !i || !i(e, r)) && (t.be = e, t.Te = S, E.Oe !== null && E.Oe(t, e), _e(t, !0));
|
|
743
|
+
} catch (e) {
|
|
744
|
+
P(t, 2, e);
|
|
745
|
+
}
|
|
746
|
+
} else try {
|
|
747
|
+
U(t, () => e);
|
|
748
|
+
} catch (e) {
|
|
749
|
+
P(t, 2, e);
|
|
750
|
+
}
|
|
751
|
+
t.Pe === c && (t.Ie = !1), st(t), T(), Te(), i?.();
|
|
752
|
+
}, d = () => t.T & 32 && !t.u && !(t.S & 1) ? (Ze(t), !0) : !1, f = (e, r) => {
|
|
753
|
+
let i = e[Symbol.asyncIterator](), a = !1, s = !1, c = !r, f = () => {
|
|
754
|
+
if (!s) {
|
|
755
|
+
s = !0;
|
|
756
|
+
try {
|
|
757
|
+
let e = i.return?.();
|
|
758
|
+
ct(e) && e.then(void 0, () => {});
|
|
759
|
+
} catch {}
|
|
760
|
+
}
|
|
761
|
+
};
|
|
762
|
+
r ? r(f) : Ge(f);
|
|
763
|
+
let p = () => {
|
|
764
|
+
d() || m();
|
|
765
|
+
}, m = () => {
|
|
766
|
+
let e, r, f = !1, h = !1, g = !0, _ = i.next();
|
|
767
|
+
if ((ct(_) ? _ : { then: (e) => void e(_) }).then((r) => {
|
|
768
|
+
if (g && c) e = r, f = !0, r.done && (s = !0);
|
|
769
|
+
else if (t.o?.Ee !== n) return;
|
|
770
|
+
else r.done ? (s = !0, a ? (T(), Te()) : u(void 0), d()) : (a = !0, u(r.value, p));
|
|
771
|
+
}, (e) => {
|
|
772
|
+
g && c ? (r = e, h = !0) : t.o?.Ee === n && (s = !0, l(e), d());
|
|
773
|
+
}), g = !1, h) {
|
|
774
|
+
if (s = !0, l(r), c) throw r;
|
|
775
|
+
return !0;
|
|
776
|
+
}
|
|
777
|
+
return f && !e.done ? (o = e.value, a = !0, m()) : f && e.done;
|
|
778
|
+
}, h = m();
|
|
779
|
+
return c = !1, a || h;
|
|
780
|
+
}, p = null, m = (e, t) => {
|
|
781
|
+
let n = !1;
|
|
782
|
+
if (typeof e == "object" && e && V(() => {
|
|
783
|
+
n = e[Symbol.asyncIterator];
|
|
784
|
+
}), !n) return !1;
|
|
785
|
+
let r = f(e, t);
|
|
786
|
+
return t || (p = r), !0;
|
|
787
|
+
};
|
|
788
|
+
if (a) {
|
|
789
|
+
let r = !1, i = !1, a, s = !0, c = (e) => {
|
|
790
|
+
t.he ? Array.isArray(t.he) ? t.he.push(e) : t.he = [t.he, e] : t.he = e;
|
|
791
|
+
};
|
|
792
|
+
if (n.then((e) => {
|
|
793
|
+
s ? (o = e, r = !0) : t.o?.Ee === n && !(t.ie & 64) && m(e, c) || (u(e), d());
|
|
794
|
+
}, (e) => {
|
|
795
|
+
s ? (a = e, i = !0) : (l(e), d());
|
|
796
|
+
}), s = !1, i) throw l(a), a;
|
|
797
|
+
if (r) m(o) || (t.Ie = !1);
|
|
798
|
+
else {
|
|
799
|
+
if (t.Ie) return t.be;
|
|
800
|
+
throw O.initTransition(_(t)), new e(I);
|
|
801
|
+
}
|
|
802
|
+
}
|
|
803
|
+
if (i && m(n), p !== null) {
|
|
804
|
+
if (!p) {
|
|
805
|
+
if (t.Ie) return t.be;
|
|
806
|
+
throw O.initTransition(_(t)), new e(I);
|
|
807
|
+
}
|
|
808
|
+
t.Ie = !1;
|
|
809
|
+
}
|
|
810
|
+
return o;
|
|
811
|
+
}
|
|
812
|
+
function ut(e, t = !1) {
|
|
813
|
+
e.o?.le && tt(e), e.o?.ue && e.o !== null && (e.o.ue = !1), e.o !== null && (e.o.pe = !1), e.S = t ? 0 : e.S & 4, e.o?._ && rt(e), (e.o?.Ge || e.o?.ge) && E.de(e), e.o?.l && e.T & 2048 && E.ye !== null && E.ye(e), e.o?.A && e.o.A.call(e);
|
|
814
|
+
}
|
|
815
|
+
function P(n, r, i, a, o) {
|
|
816
|
+
r === 2 && !(i instanceof t) && !(i instanceof e) && (i = new t(n, i));
|
|
817
|
+
let s = r === 1 && i instanceof e ? i.source : void 0, c = s === n, l = r === 1 && n.o?.De !== void 0 && !c, u = l && v(n);
|
|
818
|
+
a || (r === 1 && s ? ($e(n, s), n.S = 1 | n.S & 4, rt(n, s, i)) : (tt(n), n.S = r | (r === 2 ? 0 : n.S & 4), z(n)._ = i), E.de !== null && E.de(n), n.o?.l && n.T & 2048 && E.ye !== null && E.ye(n)), o && !a && ee(n, o);
|
|
819
|
+
let d = a || u, f = a || l ? void 0 : o;
|
|
820
|
+
if (n.o?.A) {
|
|
821
|
+
if (a && r === 1) return;
|
|
822
|
+
d ? n.o.A.call(n, r, i) : n.o.A.call(n);
|
|
823
|
+
return;
|
|
824
|
+
}
|
|
825
|
+
N(n, (t, n) => {
|
|
826
|
+
if (t.Te = S, r === 1 && s && !t.o?.le?.has(s) || r !== 1 && (t.o?._ !== i || t.o?.le)) {
|
|
827
|
+
if (n.me && r !== 1 && !(i instanceof e)) {
|
|
828
|
+
A(t), T();
|
|
829
|
+
return;
|
|
830
|
+
}
|
|
831
|
+
!d && !t._e && D(t), P(t, r, i, d, f);
|
|
832
|
+
}
|
|
833
|
+
});
|
|
834
|
+
}
|
|
835
|
+
E.Ce = R, E.Fe = ze;
|
|
836
|
+
var F = !1, dt = !1, ft = !1, pt = !1, I = null, L = null;
|
|
837
|
+
function R(t, n = !1) {
|
|
838
|
+
ge();
|
|
839
|
+
let r = t.Re;
|
|
840
|
+
if (!n) {
|
|
841
|
+
if (t._e && (!r || C) && C !== t._e && O.initTransition(t._e), j(t, k(t)), t.o !== null && (t.o.Ee = null), t._e || r === 3) ze(t);
|
|
842
|
+
else if (t.ke !== null || t.he !== null) {
|
|
843
|
+
Re(t);
|
|
844
|
+
let e = z(t);
|
|
845
|
+
e.We = t.he, e.qe = t.ke, t.he = null, t.ke = null, t.Me = 0;
|
|
846
|
+
}
|
|
847
|
+
}
|
|
848
|
+
let o = !!(t.ie & 128), s = !!(t.T & 128) && t.o?.De !== c && t.o?.De !== void 0, d = !!(t.S & 4), f = t.S & 2 ? t.o?._ : void 0, p = (t.ie & i) !== 0, m = t.Ie, h = I;
|
|
849
|
+
I = t, t.Ye = null, t.Ze++, t.ie = 4, t.Te = S;
|
|
850
|
+
let g = t.Pe === c ? t.be : t.Pe, _ = t.Le, v = !1, ee = F, y = L;
|
|
851
|
+
F = !0;
|
|
852
|
+
let b = pt;
|
|
853
|
+
if (pt = !1, o) {
|
|
854
|
+
let e = E.je(t, !0);
|
|
855
|
+
e ? L = e : e === !1 && (o = !1);
|
|
856
|
+
} else if (C && !n && C.Ke.length) {
|
|
857
|
+
let e = E.je(t, !1);
|
|
858
|
+
e && (o = !0, L = e);
|
|
859
|
+
}
|
|
860
|
+
let x = r && r !== 2, te = dt;
|
|
861
|
+
x && (dt = !0);
|
|
862
|
+
try {
|
|
863
|
+
if (t.T & 64) g = t.Se(g), t.o !== null && (t.o.Ee = null), t.Ie = !1;
|
|
864
|
+
else {
|
|
865
|
+
let e = t.o?.Ee, n = t.Se(g), r = typeof n == "object" && !!n, i = t.o?.Ee !== e;
|
|
866
|
+
g = i || !r ? n : lt(t, n), !i && !r && (t.o !== null && (t.o.Ee = null), t.Ie = !1);
|
|
867
|
+
}
|
|
868
|
+
(t.S !== 0 || t.o !== null) && ut(t, n), t.T & 1024 && t.o?.Be && E.ze(t);
|
|
869
|
+
} catch (n) {
|
|
870
|
+
let r = n instanceof e;
|
|
871
|
+
if (r && t.Ie) nt(t, n);
|
|
872
|
+
else {
|
|
873
|
+
r && L && E.$e(t);
|
|
874
|
+
let e = !1;
|
|
875
|
+
r && (z(t).ue = !0, E.Je !== null && (e = E.Je(t, p))), P(t, r ? 1 : 2, n, void 0, r ? t.o?.Be : void 0), e && E.p(t);
|
|
876
|
+
}
|
|
877
|
+
} finally {
|
|
878
|
+
F = ee, pt = b, x && (dt = te), v = (t.ie & a) !== 0, t.ie = 0 | (n ? t.ie & 256 : 0), I = h;
|
|
879
|
+
}
|
|
880
|
+
if (!t.o?._) {
|
|
881
|
+
Ye(t);
|
|
882
|
+
let e = s ? u(t.o?.De) : t.Pe === c ? t.be : t.Pe, i = !1;
|
|
883
|
+
try {
|
|
884
|
+
i = !r && d || !t.Ue || !t.Ue(e, g);
|
|
885
|
+
} catch (e) {
|
|
886
|
+
P(t, 2, e);
|
|
887
|
+
}
|
|
888
|
+
if (r && i && (t.Xe = !t.o?._, n || t.C.enqueue(r, t.et ??= E.tt.bind(null, t))), !t.o?._) {
|
|
889
|
+
if (i) {
|
|
890
|
+
let e = s ? t.o?.De : void 0;
|
|
891
|
+
n || r && (C !== t._e || C === null) || o ? (t.be = g, s && o && (z(t).De = g === void 0 ? l : g, t.Pe = c)) : (t.Pe = g, m && (t.Ie = !0), (C || t._e) && E.Oe !== null && E.Oe(t, g)), t.u !== null && (!s || o || t.o?.De !== e) && _e(t, o || s);
|
|
892
|
+
} else if (s) t.Pe === c && D(t), t.Pe = g, m && (t.Ie = !0);
|
|
893
|
+
else if (t.Le != _) for (let e = t.u; e !== null; e = e.fe) Ne(e.ae, k(e.ae));
|
|
894
|
+
}
|
|
895
|
+
f !== void 0 && !i && !t.o?._ && ot(t, f);
|
|
896
|
+
}
|
|
897
|
+
L = y, (t.Pe !== c || t.o !== null && (t.o.qe !== null || t.o.We !== null) || t.S & 5) && (!n || t.S & 1) && (!t._e || s) && D(t), t._e && r && C !== t._e && Ae(t._e, () => R(t)), v && (A(t), T());
|
|
898
|
+
}
|
|
899
|
+
function mt(e) {
|
|
900
|
+
if (!(e.ie & 4)) {
|
|
901
|
+
if (e.ie & 1) for (let t = e.nt; t; t = t.it) {
|
|
902
|
+
let n = t.ut, r = n.lt || n;
|
|
903
|
+
if (r.Se && mt(r), e.ie & 2) break;
|
|
904
|
+
}
|
|
905
|
+
(e.ie & 130 || e.o?._ && e.Te < S && !e.o?.Ee) && R(e), e.ie &= 280;
|
|
906
|
+
}
|
|
907
|
+
}
|
|
908
|
+
function ht(e, t) {
|
|
909
|
+
let n = t?.transparent ?? !1, r = typeof t == "object" && !!t && "loadingValue" in t, i = {
|
|
910
|
+
id: Ue(t, n, I),
|
|
911
|
+
T: (n ? 4 : 0) | !!t?.ownedWrite | (!I || t?.lazy ? 32 : 0) | (t?.sync ? 64 : 0) | (t?.H ? 2 : 0) | 0,
|
|
912
|
+
Ue: t?.equals == null ? yt : t.equals,
|
|
913
|
+
he: null,
|
|
914
|
+
C: I?.C ?? O,
|
|
915
|
+
we: I?.we ?? d,
|
|
916
|
+
Me: 0,
|
|
917
|
+
Se: e,
|
|
918
|
+
be: r ? t.loadingValue : void 0,
|
|
919
|
+
Le: 0,
|
|
920
|
+
ot: void 0,
|
|
921
|
+
st: null,
|
|
922
|
+
nt: null,
|
|
923
|
+
Ye: null,
|
|
924
|
+
Ze: 0,
|
|
925
|
+
u: null,
|
|
926
|
+
rt: null,
|
|
927
|
+
ve: I,
|
|
928
|
+
Ve: null,
|
|
929
|
+
ct: null,
|
|
930
|
+
ke: null,
|
|
931
|
+
ie: t?.lazy ? 512 : 0,
|
|
932
|
+
S: r ? 0 : 4,
|
|
933
|
+
Te: S,
|
|
934
|
+
Pe: c,
|
|
935
|
+
_e: null,
|
|
936
|
+
_t: -1,
|
|
937
|
+
Ie: r,
|
|
938
|
+
o: null
|
|
939
|
+
};
|
|
940
|
+
return t?.unobserved && (z(i).ft = t.unobserved), vt(i, t), i;
|
|
941
|
+
}
|
|
942
|
+
function z(e) {
|
|
943
|
+
return e.o ??= {
|
|
944
|
+
De: void 0,
|
|
945
|
+
Et: void 0,
|
|
946
|
+
Be: void 0,
|
|
947
|
+
Ge: void 0,
|
|
948
|
+
ge: void 0,
|
|
949
|
+
It: void 0,
|
|
950
|
+
t: 0,
|
|
951
|
+
Ee: null,
|
|
952
|
+
_: void 0,
|
|
953
|
+
ue: void 0,
|
|
954
|
+
le: void 0,
|
|
955
|
+
A: void 0,
|
|
956
|
+
pe: !1,
|
|
957
|
+
l: null,
|
|
958
|
+
ft: void 0,
|
|
959
|
+
Qe: void 0,
|
|
960
|
+
We: null,
|
|
961
|
+
qe: null,
|
|
962
|
+
Nt: void 0
|
|
963
|
+
};
|
|
964
|
+
}
|
|
965
|
+
function gt(e, t, n, r, i, a) {
|
|
966
|
+
let o = a?.transparent ?? !1, s = {
|
|
967
|
+
id: Ue(a, o, I),
|
|
968
|
+
T: (o ? 4 : 0) | !!a?.ownedWrite | (a?.sync ? 64 : 0) | 0,
|
|
969
|
+
Ue: !1,
|
|
970
|
+
he: null,
|
|
971
|
+
C: I?.C ?? O,
|
|
972
|
+
we: I?.we ?? d,
|
|
973
|
+
Me: 0,
|
|
974
|
+
Se: e,
|
|
975
|
+
be: void 0,
|
|
976
|
+
Le: 0,
|
|
977
|
+
ot: void 0,
|
|
978
|
+
st: null,
|
|
979
|
+
nt: null,
|
|
980
|
+
Ye: null,
|
|
981
|
+
Ze: 0,
|
|
982
|
+
u: null,
|
|
983
|
+
rt: null,
|
|
984
|
+
ve: I,
|
|
985
|
+
Ve: null,
|
|
986
|
+
ct: null,
|
|
987
|
+
ke: null,
|
|
988
|
+
ie: 512,
|
|
989
|
+
S: 4,
|
|
990
|
+
Te: S,
|
|
991
|
+
Pe: c,
|
|
992
|
+
_e: null,
|
|
993
|
+
_t: -1,
|
|
994
|
+
Ie: !1,
|
|
995
|
+
Xe: !1,
|
|
996
|
+
Tt: void 0,
|
|
997
|
+
dt: t,
|
|
998
|
+
St: n,
|
|
999
|
+
At: void 0,
|
|
1000
|
+
Re: r,
|
|
1001
|
+
o: null
|
|
1002
|
+
};
|
|
1003
|
+
return i !== void 0 && (z(s).A = i), a?.unobserved && (z(s).ft = a.unobserved), vt(s, _t), s;
|
|
1004
|
+
}
|
|
1005
|
+
var _t = { lazy: !0 };
|
|
1006
|
+
function vt(e, t) {
|
|
1007
|
+
e.st = e;
|
|
1008
|
+
let n = I?.Ct ? I.Ot : I;
|
|
1009
|
+
if (I) {
|
|
1010
|
+
let t = I.ke;
|
|
1011
|
+
t === null ? I.ke = e : (e.Ve = t, t.ct = e, I.ke = e);
|
|
1012
|
+
}
|
|
1013
|
+
n && (e.Le = n.Le + 1), E.Rt !== null && E.Rt(e), !t?.lazy && R(e, !0);
|
|
1014
|
+
}
|
|
1015
|
+
function B(e, t, n = null) {
|
|
1016
|
+
let r = {
|
|
1017
|
+
Ue: t?.equals == null ? yt : t.equals,
|
|
1018
|
+
T: +!!t?.ownedWrite | (t?.H ? 2 : 0),
|
|
1019
|
+
be: e,
|
|
1020
|
+
u: null,
|
|
1021
|
+
rt: null,
|
|
1022
|
+
Te: S,
|
|
1023
|
+
lt: n,
|
|
1024
|
+
ce: n?.o?.l || null,
|
|
1025
|
+
Pe: c,
|
|
1026
|
+
_e: null,
|
|
1027
|
+
_t: -1,
|
|
1028
|
+
o: null
|
|
1029
|
+
};
|
|
1030
|
+
return t?.unobserved && (z(r).ft = t.unobserved), n && (z(n).l = r, n.T |= s), r;
|
|
1031
|
+
}
|
|
1032
|
+
function yt(e, t) {
|
|
1033
|
+
return e === t;
|
|
1034
|
+
}
|
|
1035
|
+
function V(e, t) {
|
|
1036
|
+
if (E.Gt === null && !F) return e();
|
|
1037
|
+
let n = F;
|
|
1038
|
+
F = !1;
|
|
1039
|
+
try {
|
|
1040
|
+
return E.Gt === null ? e() : E.Gt(e);
|
|
1041
|
+
} finally {
|
|
1042
|
+
F = n;
|
|
1043
|
+
}
|
|
1044
|
+
}
|
|
1045
|
+
function bt(e, t) {
|
|
1046
|
+
e.ie & 512 ? (e.ie &= -513, R(e, !0)) : e.ie & 64 ? e.T & 32 && R(e, !0) : t && mt(e);
|
|
1047
|
+
}
|
|
1048
|
+
function H(e) {
|
|
1049
|
+
if (pt) return E.Pt(e);
|
|
1050
|
+
let t = I;
|
|
1051
|
+
t?.Ct && (t = t.Ot);
|
|
1052
|
+
let n = e, r = e.lt || e;
|
|
1053
|
+
if (typeof n.Se == "function" && bt(e, !1), !n.Se && r === e && e.o?.De === void 0 && e.o?.Qe === void 0 && C === null && L === null) return t && F && Qe(e, t), !t || e.Pe === c || t.T & 16 ? e.be : e.Pe;
|
|
1054
|
+
if (t && F && (Qe(e, t, ft), r.Se)) {
|
|
1055
|
+
let n = k(e);
|
|
1056
|
+
r.Le >= n.xe && (Fe(t), Pe(n), mt(r));
|
|
1057
|
+
let i = r.Le;
|
|
1058
|
+
i >= t.Le && e.ve !== t && (t.Le = i + 1);
|
|
1059
|
+
}
|
|
1060
|
+
if (r.S & 1) {
|
|
1061
|
+
if (t && !(dt && r._e && C !== r._e)) {
|
|
1062
|
+
if (L === null || E.ht(r)) throw !F && e !== t && Qe(e, t), r.o?._;
|
|
1063
|
+
} else if (t && r.S & 4) throw !F && e !== t && Qe(e, t), r.o?._;
|
|
1064
|
+
else if (!t && r.S & 4) throw r.o?._;
|
|
1065
|
+
}
|
|
1066
|
+
if (r.Se && r.S & 2) {
|
|
1067
|
+
if (F && r.Te < S) return R(r), H(e);
|
|
1068
|
+
throw r.o?._;
|
|
1069
|
+
}
|
|
1070
|
+
if (e.o?.De !== void 0 && e.o?.De !== c) return u(e.o?.De);
|
|
1071
|
+
if (L !== null && C !== null && t !== null && E.Ft(e, r, t)) return e.be;
|
|
1072
|
+
let i = !t || L !== null && E.gt(e, r, t) || e.Pe === c || t.T & 16 || dt && e._e && C !== e._e ? e.be : e.Pe;
|
|
1073
|
+
return !t && r === e && typeof n.Se == "function" && e.T & 32 && !(r.S & 1) && !e.u && Ze(e), i;
|
|
1074
|
+
}
|
|
1075
|
+
function U(e, t) {
|
|
1076
|
+
if (e._e && C !== e._e && O.initTransition(e._e), e.T & 128) return E.vt(e, t);
|
|
1077
|
+
let n = e.Pe === c ? e.be : e.Pe;
|
|
1078
|
+
if (typeof t == "function" && (t = t(n)), !(e.S & 4 || !e.Ue || !e.Ue(n, t))) return t;
|
|
1079
|
+
let r = e.Pe !== c;
|
|
1080
|
+
return r || D(e), e.Pe = t, e.T & 256 && E.Oe !== null && E.Oe(e, t), e.Se !== void 0 && (e.Te = S), r && e._t === he && L === null ? t : (_e(e), T(), t);
|
|
1081
|
+
}
|
|
1082
|
+
function xt(e) {
|
|
1083
|
+
j(e, k(e)), !(e.ie & 1024) && e.Pe === c && (D(e), T()), e.ie = e.ie & -4 | r, e.kt = S;
|
|
1084
|
+
}
|
|
1085
|
+
function St(e, t) {
|
|
1086
|
+
let n = U(e, t);
|
|
1087
|
+
return xt(e), n;
|
|
1088
|
+
}
|
|
1089
|
+
function W(e, t) {
|
|
1090
|
+
let n = I, r = F;
|
|
1091
|
+
I = e, F = !1;
|
|
1092
|
+
try {
|
|
1093
|
+
return t();
|
|
1094
|
+
} finally {
|
|
1095
|
+
I = n, F = r;
|
|
1096
|
+
}
|
|
1097
|
+
}
|
|
1098
|
+
//#endregion
|
|
1099
|
+
//#region node_modules/@solidjs/signals/dist/prod/core/effect.js
|
|
1100
|
+
function Ct(e, t, n, r) {
|
|
1101
|
+
let i = gt(e, t, n, r?.user ? 2 : 1, wt, r);
|
|
1102
|
+
R(i, !0), !r?.defer && (i.Re === 2 || r?.schedule ? i.C.enqueue(i.Re, Tt.bind(null, i)) : Tt(i));
|
|
1103
|
+
}
|
|
1104
|
+
function wt(e, t) {
|
|
1105
|
+
let r = e === void 0 ? this.S : e, i = t === void 0 ? this.o?._ : t;
|
|
1106
|
+
if (r & 2) {
|
|
1107
|
+
if (this.C.notify(this, 1, 0), this.Re === 2) {
|
|
1108
|
+
this.S & 2 && (this.Xe = !0, this.C.enqueue(this.Re, this.et ??= Tt.bind(null, this)));
|
|
1109
|
+
return;
|
|
1110
|
+
}
|
|
1111
|
+
if (!this.C.notify(this, 2, 2)) throw ue(n(i)), i;
|
|
1112
|
+
} else this.Re === 1 && this.C.notify(this, 3, r, i);
|
|
1113
|
+
}
|
|
1114
|
+
function Tt(e) {
|
|
1115
|
+
if (!e.Xe || e.ie & 64) return;
|
|
1116
|
+
if (e.S & 2 && e.Re === 2) {
|
|
1117
|
+
let t = n(e.o?._);
|
|
1118
|
+
e.Tt = e.be, e.Xe = !1;
|
|
1119
|
+
try {
|
|
1120
|
+
e.St ? e.St(t, () => {
|
|
1121
|
+
let t = e.At;
|
|
1122
|
+
e.At = void 0, t?.();
|
|
1123
|
+
}) : console.error(t);
|
|
1124
|
+
} catch (t) {
|
|
1125
|
+
if (!e.C.notify(e, 2, 2)) throw ue(t), t;
|
|
1126
|
+
}
|
|
1127
|
+
return;
|
|
1128
|
+
}
|
|
1129
|
+
let r = e.At;
|
|
1130
|
+
e.At = void 0;
|
|
1131
|
+
try {
|
|
1132
|
+
r?.(), e.At = e.dt(e.be, e.Tt);
|
|
1133
|
+
} catch (n) {
|
|
1134
|
+
if (z(e)._ = new t(e, n), e.S |= 2, !e.C.notify(e, 2, 2)) throw ue(n), n;
|
|
1135
|
+
} finally {
|
|
1136
|
+
e.Tt = e.be, e.Xe = !1;
|
|
1137
|
+
}
|
|
1138
|
+
}
|
|
1139
|
+
E.tt = Tt;
|
|
1140
|
+
//#endregion
|
|
1141
|
+
//#region node_modules/@solidjs/signals/dist/prod/signals.js
|
|
1142
|
+
function G(e) {
|
|
1143
|
+
let t = H.bind(null, e);
|
|
1144
|
+
return t[f] = e, t;
|
|
1145
|
+
}
|
|
1146
|
+
function Et(e, t) {
|
|
1147
|
+
if (typeof e == "function") {
|
|
1148
|
+
let n = ht(e, t);
|
|
1149
|
+
return n.T &= -33, [G(n), St.bind(null, n)];
|
|
1150
|
+
}
|
|
1151
|
+
let n = B(e, t);
|
|
1152
|
+
return [G(n), U.bind(null, n)];
|
|
1153
|
+
}
|
|
1154
|
+
function Dt(e, t) {
|
|
1155
|
+
return G(ht(e, t));
|
|
1156
|
+
}
|
|
1157
|
+
function Ot(e, t, n) {
|
|
1158
|
+
Ct(e, t, void 0, n);
|
|
1159
|
+
}
|
|
1160
|
+
//#endregion
|
|
1161
|
+
//#region node_modules/@solidjs/signals/dist/prod/store/store.js
|
|
1162
|
+
var kt = Symbol(0);
|
|
1163
|
+
//#endregion
|
|
1164
|
+
//#region node_modules/@solidjs/signals/dist/prod/map.js
|
|
1165
|
+
function At(e, t, n) {
|
|
1166
|
+
let r = typeof n?.keyed == "function" ? n.keyed : void 0, i = t.length > 1, a = t, o = {
|
|
1167
|
+
jt: M(),
|
|
1168
|
+
Wt: 0,
|
|
1169
|
+
xt: e,
|
|
1170
|
+
Kt: [],
|
|
1171
|
+
$t: a,
|
|
1172
|
+
qt: [],
|
|
1173
|
+
zt: [],
|
|
1174
|
+
Jt: r,
|
|
1175
|
+
Xt: r || n?.keyed === !1 ? [] : void 0,
|
|
1176
|
+
Yt: i && n?.keyed !== !1 ? [] : void 0,
|
|
1177
|
+
Zt: n?.keyed === !1,
|
|
1178
|
+
ts: n?.fallback
|
|
1179
|
+
}, s = ht(Mt.bind(o));
|
|
1180
|
+
return o.jt.Ot = s, s.T &= -33, G(s);
|
|
1181
|
+
}
|
|
1182
|
+
var jt = { ownedWrite: !0 };
|
|
1183
|
+
function Mt() {
|
|
1184
|
+
let e = this.xt() || [], t = e.length;
|
|
1185
|
+
return e[kt], W(this.jt, () => {
|
|
1186
|
+
let n, r, i, a, o = this.Xt ? this.Zt ? () => (i[r] = B(e[r], jt), this.$t(G(i[r]), r)) : () => (i[r] = B(e[r], jt), a && (a[r] = B(r, jt)), this.$t(G(i[r]), a ? G(a[r]) : void 0)) : this.Yt ? () => {
|
|
1187
|
+
let t = e[r];
|
|
1188
|
+
return a[r] = B(r, jt), this.$t(t, G(a[r]));
|
|
1189
|
+
} : () => {
|
|
1190
|
+
let t = e[r];
|
|
1191
|
+
return this.$t(t);
|
|
1192
|
+
};
|
|
1193
|
+
if (t === 0) this.Wt !== 0 && (this.jt.dispose(!1), this.zt = [], this.Kt = [], this.qt = [], this.Wt = 0, this.Xt &&= [], this.Yt &&= []), this.ts && !this.qt[0] && (this.zt[0]?.dispose(), this.qt[0] = W(this.zt[0] = M(), this.ts));
|
|
1194
|
+
else if (this.Wt === 0) {
|
|
1195
|
+
let s = Array(t), c = Array(t);
|
|
1196
|
+
i = this.Xt && Array(t), a = this.Yt && Array(t);
|
|
1197
|
+
try {
|
|
1198
|
+
for (r = 0; r < t; r++) s[r] = W(c[r] = M(), o);
|
|
1199
|
+
} catch (e) {
|
|
1200
|
+
for (n = 0; n <= r; n++) c[n]?.dispose();
|
|
1201
|
+
throw e;
|
|
1202
|
+
}
|
|
1203
|
+
this.zt[0] && this.zt[0].dispose(), this.qt = s, this.zt = c, i && (this.Xt = i), a && (this.Yt = a), this.Kt = e.slice(0), this.Wt = t;
|
|
1204
|
+
} else {
|
|
1205
|
+
let s, c, l, u, d, f, p, m, h;
|
|
1206
|
+
for (s = 0, c = Math.min(this.Wt, t); s < c && (this.Kt[s] === e[s] || this.Xt && Nt(this.Jt, this.Kt[s], e[s])); s++) this.Xt && U(this.Xt[s], e[s]);
|
|
1207
|
+
for (c = this.Wt - 1, l = t - 1; c >= s && l >= s && (this.Kt[c] === e[l] || this.Xt && Nt(this.Jt, this.Kt[c], e[l])); c--, l--);
|
|
1208
|
+
if (s === t && this.Wt === t) {
|
|
1209
|
+
this.Kt = e.slice(0);
|
|
1210
|
+
return;
|
|
1211
|
+
}
|
|
1212
|
+
let g = t - this.Wt, _ = Array(t), v = Array(t);
|
|
1213
|
+
for (i = this.Xt ? Array(t) : void 0, a = this.Yt ? Array(t) : void 0, f = /* @__PURE__ */ new Map(), p = Array(l + 1), r = l; r >= s; r--) u = e[r], d = this.Jt ? this.Jt(u) : u, n = f.get(d), p[r] = n === void 0 ? -1 : n, f.set(d, r);
|
|
1214
|
+
for (n = s; n <= c; n++) u = this.Kt[n], d = this.Jt ? this.Jt(u) : u, r = f.get(d), r !== void 0 && r !== -1 ? (_[r] = this.qt[n], v[r] = this.zt[n], i && (i[r] = this.Xt[n]), a && (a[r] = this.Yt[n]), r = p[r], f.set(d, r)) : (m ??= []).push(this.zt[n]);
|
|
1215
|
+
try {
|
|
1216
|
+
for (r = s; r <= l; r++) v[r] === void 0 && ((h ??= []).push(v[r] = M()), _[r] = W(v[r], o));
|
|
1217
|
+
} catch (e) {
|
|
1218
|
+
if (h) for (n = 0; n < h.length; n++) h[n].dispose();
|
|
1219
|
+
throw e;
|
|
1220
|
+
}
|
|
1221
|
+
for (n = 0; n < s; n++) _[n] = this.qt[n], v[n] = this.zt[n], i && (i[n] = this.Xt[n]), a && (a[n] = this.Yt[n]);
|
|
1222
|
+
for (r = s; r <= l; r++) i && U(i[r], e[r]), a && U(a[r], r);
|
|
1223
|
+
for (r = l + 1; r < t; r++) _[r] = this.qt[r - g], v[r] = this.zt[r - g], i && (i[r] = this.Xt[r - g], U(i[r], e[r])), a && (a[r] = this.Yt[r - g], g !== 0 && U(a[r], r));
|
|
1224
|
+
if (this.qt = _, this.zt = v, i && (this.Xt = i), a && (this.Yt = a), this.Wt = t, this.Kt = e.slice(0), m) for (n = 0; n < m.length; n++) m[n].dispose();
|
|
1225
|
+
}
|
|
1226
|
+
}), this.qt;
|
|
1227
|
+
}
|
|
1228
|
+
function Nt(e, t, n) {
|
|
1229
|
+
return !e || e(t) === e(n);
|
|
1230
|
+
}
|
|
1231
|
+
//#endregion
|
|
1232
|
+
//#region node_modules/@solidjs/signals/dist/prod/boundaries.js
|
|
1233
|
+
function Pt(e, t) {
|
|
1234
|
+
let r = ht(e, { lazy: !0 });
|
|
1235
|
+
return z(r).A = (e, t) => {
|
|
1236
|
+
let i = e === void 0 ? r.S : e, a = t === void 0 ? r.o?._ : t;
|
|
1237
|
+
r.S &= ~r.R;
|
|
1238
|
+
let o = r.C.notify(r, 3, i, a), s = i & ~r.R & 3;
|
|
1239
|
+
if (s && (r.S &= ~s, r.o?._ === a && !(r.S & 3) && r.o !== null && (r.o._ = void 0)), !o && i & 2) throw ue(n(a)), a;
|
|
1240
|
+
}, r.R = t, r.T &= -33, R(r, !0), r;
|
|
1241
|
+
}
|
|
1242
|
+
function Ft(e, t, n, r) {
|
|
1243
|
+
let i = e.C;
|
|
1244
|
+
return i.addChild(e.C = n), Ge(() => i.removeChild(e.C)), W(e, () => {
|
|
1245
|
+
let e = ht(t);
|
|
1246
|
+
return Pt(() => Vt(H(e)), r);
|
|
1247
|
+
});
|
|
1248
|
+
}
|
|
1249
|
+
var It = Symbol(), Lt = class extends pe {
|
|
1250
|
+
ee;
|
|
1251
|
+
v = /* @__PURE__ */ new Set();
|
|
1252
|
+
te;
|
|
1253
|
+
N = !0;
|
|
1254
|
+
I = B(!1, {
|
|
1255
|
+
ownedWrite: !0,
|
|
1256
|
+
H: !0
|
|
1257
|
+
});
|
|
1258
|
+
_;
|
|
1259
|
+
D = B(!1, {
|
|
1260
|
+
ownedWrite: !0,
|
|
1261
|
+
H: !0
|
|
1262
|
+
});
|
|
1263
|
+
W;
|
|
1264
|
+
L = !1;
|
|
1265
|
+
re;
|
|
1266
|
+
ne = It;
|
|
1267
|
+
constructor(e) {
|
|
1268
|
+
super(), this.ee = e;
|
|
1269
|
+
}
|
|
1270
|
+
run(e) {
|
|
1271
|
+
if (!(!e || H(this.I))) return super.run(e);
|
|
1272
|
+
}
|
|
1273
|
+
notify(e, t, r, i) {
|
|
1274
|
+
if (!(t & this.ee)) return super.notify(e, t, r, i);
|
|
1275
|
+
if (this.L && this.re) {
|
|
1276
|
+
let e = V(() => {
|
|
1277
|
+
try {
|
|
1278
|
+
return this.re();
|
|
1279
|
+
} catch {
|
|
1280
|
+
return It;
|
|
1281
|
+
}
|
|
1282
|
+
});
|
|
1283
|
+
e !== this.ne && (this.ne = e, this.L = !1, this.v.clear());
|
|
1284
|
+
}
|
|
1285
|
+
if (this.ee & 1 && this.L) return super.notify(e, t, r, i);
|
|
1286
|
+
if (r & this.ee) {
|
|
1287
|
+
this.N = !0;
|
|
1288
|
+
let t = i?.source || e.o?._?.source;
|
|
1289
|
+
if (t) {
|
|
1290
|
+
let e = this.v.size === 0;
|
|
1291
|
+
this.v.add(t), e && U(this.I, !0), this.ee & 2 && U(this._, n(t.o?._));
|
|
1292
|
+
}
|
|
1293
|
+
}
|
|
1294
|
+
return t &= ~this.ee, !t || super.notify(e, t, r, i);
|
|
1295
|
+
}
|
|
1296
|
+
se() {
|
|
1297
|
+
for (let e of this.v) (e.ie & 64 || !e.o?.t && !(e.S & this.ee) && !(this.ee & 2 && e.S & 1)) && this.v.delete(e);
|
|
1298
|
+
if (!this.v.size && (this.N = this.ee & 1 && this.N && !this.L && this.te ? !!(this.te.S & this.ee) : !1, !this.N && (U(this.I, !1), this.re))) try {
|
|
1299
|
+
this.ne = V(() => this.re());
|
|
1300
|
+
} catch {}
|
|
1301
|
+
}
|
|
1302
|
+
};
|
|
1303
|
+
function Rt(t, n, r, i) {
|
|
1304
|
+
let a = M(), o = new Lt(t);
|
|
1305
|
+
t === 2 && (o._ = B(void 0, {
|
|
1306
|
+
ownedWrite: !0,
|
|
1307
|
+
H: !0
|
|
1308
|
+
})), i && (o.re = i);
|
|
1309
|
+
let s = o.te = Ft(a, n, o, t);
|
|
1310
|
+
return V(() => {
|
|
1311
|
+
let n = !1;
|
|
1312
|
+
try {
|
|
1313
|
+
H(s);
|
|
1314
|
+
} catch (t) {
|
|
1315
|
+
if (t instanceof e) n = !0;
|
|
1316
|
+
else throw t;
|
|
1317
|
+
}
|
|
1318
|
+
o.N = n || !!(s.S & t) || s.o?._ instanceof e;
|
|
1319
|
+
}), G(ht(() => {
|
|
1320
|
+
if (!H(o.I)) {
|
|
1321
|
+
let e = H(s);
|
|
1322
|
+
if (!V(() => H(o.I))) return o.L = !0, e;
|
|
1323
|
+
}
|
|
1324
|
+
return r(o);
|
|
1325
|
+
}, { H: !0 }));
|
|
1326
|
+
}
|
|
1327
|
+
function zt(e, t, n) {
|
|
1328
|
+
return Rt(1, e, () => t(), n?.on);
|
|
1329
|
+
}
|
|
1330
|
+
function Bt(e, t) {
|
|
1331
|
+
return Rt(2, e, (e) => t(G(e._), () => {
|
|
1332
|
+
for (let t of e.v) R(t);
|
|
1333
|
+
T();
|
|
1334
|
+
}));
|
|
1335
|
+
}
|
|
1336
|
+
function Vt(e, t) {
|
|
1337
|
+
if (typeof e == "function" && !e.length) {
|
|
1338
|
+
if (t?.doNotUnwrap) return e;
|
|
1339
|
+
do
|
|
1340
|
+
e = e();
|
|
1341
|
+
while (typeof e == "function" && !e.length);
|
|
1342
|
+
}
|
|
1343
|
+
if (!(t?.skipNonRendered && (e == null || e === !0 || e === !1 || e === ""))) {
|
|
1344
|
+
if (Array.isArray(e)) {
|
|
1345
|
+
let n = [];
|
|
1346
|
+
return Ht(e, n, t) ? () => {
|
|
1347
|
+
let e = [];
|
|
1348
|
+
return Ht(n, e, {
|
|
1349
|
+
...t,
|
|
1350
|
+
doNotUnwrap: !1
|
|
1351
|
+
}), e;
|
|
1352
|
+
} : n;
|
|
1353
|
+
}
|
|
1354
|
+
return e;
|
|
1355
|
+
}
|
|
1356
|
+
}
|
|
1357
|
+
function Ht(t, n = [], r) {
|
|
1358
|
+
let i = null, a = !1;
|
|
1359
|
+
for (let o = 0; o < t.length; o++) try {
|
|
1360
|
+
let e = t[o];
|
|
1361
|
+
if (typeof e == "function" && !e.length) {
|
|
1362
|
+
if (r?.doNotUnwrap) {
|
|
1363
|
+
n.push(e), a = !0;
|
|
1364
|
+
continue;
|
|
1365
|
+
}
|
|
1366
|
+
do
|
|
1367
|
+
e = e();
|
|
1368
|
+
while (typeof e == "function" && !e.length);
|
|
1369
|
+
}
|
|
1370
|
+
Array.isArray(e) ? a = Ht(e, n, r) : r?.skipNonRendered && (e == null || e === !0 || e === !1 || e === "") || n.push(e);
|
|
1371
|
+
} catch (t) {
|
|
1372
|
+
if (!(t instanceof e)) throw t;
|
|
1373
|
+
i = t;
|
|
1374
|
+
}
|
|
1375
|
+
if (i) throw i;
|
|
1376
|
+
return a;
|
|
1377
|
+
}
|
|
1378
|
+
//#endregion
|
|
1379
|
+
//#region node_modules/solid-js/dist/solid.js
|
|
1380
|
+
var Ut = !1, Wt = {
|
|
1381
|
+
hydrating: !1,
|
|
1382
|
+
registry: void 0,
|
|
1383
|
+
done: !1
|
|
1384
|
+
}, Gt = (...e) => Dt(...e), Kt = (...e) => Et(...e), qt = (...e) => Bt(...e), Jt = (...e) => Ot(...e), Yt = (e, t, n) => zt(e, t, n);
|
|
1385
|
+
function K(e, t) {
|
|
1386
|
+
return V(() => e(t || {}));
|
|
1387
|
+
}
|
|
1388
|
+
var Xt = 0;
|
|
1389
|
+
function Zt() {
|
|
1390
|
+
return Wt.hydrating ? Wt.getNextContextId() : `cl-${Xt++}`;
|
|
1391
|
+
}
|
|
1392
|
+
var Qt = (e) => `Stale read from <${e}>.`;
|
|
1393
|
+
function $t(e) {
|
|
1394
|
+
let t = "fallback" in e ? {
|
|
1395
|
+
keyed: e.keyed,
|
|
1396
|
+
fallback: () => e.fallback
|
|
1397
|
+
} : { keyed: e.keyed };
|
|
1398
|
+
return At(() => e.each, e.children, t);
|
|
1399
|
+
}
|
|
1400
|
+
function en(e) {
|
|
1401
|
+
let t = e.keyed, n = Dt(() => e.when, void 0), r = t ? n : Dt(n, {
|
|
1402
|
+
equals: (e, t) => !e == !t,
|
|
1403
|
+
sync: !0
|
|
1404
|
+
});
|
|
1405
|
+
return Dt(() => {
|
|
1406
|
+
let i = r();
|
|
1407
|
+
if (i) {
|
|
1408
|
+
let a = e.children;
|
|
1409
|
+
return typeof a == "function" && a.length > 0 ? V(t ? () => a(i) : () => a(() => {
|
|
1410
|
+
if (!V(r)) throw Qt("Show");
|
|
1411
|
+
return n();
|
|
1412
|
+
}), Ut) : a;
|
|
1413
|
+
}
|
|
1414
|
+
return e.fallback;
|
|
1415
|
+
}, { sync: !0 });
|
|
1416
|
+
}
|
|
1417
|
+
function tn(e) {
|
|
1418
|
+
return qt(() => e.children, (t, n) => {
|
|
1419
|
+
let r = e.fallback;
|
|
1420
|
+
return typeof r == "function" && r.length ? r(t, n) : r;
|
|
1421
|
+
});
|
|
1422
|
+
}
|
|
1423
|
+
function nn(e) {
|
|
1424
|
+
return Yt(() => e.children, () => e.fallback, "on" in e ? { on: () => e.on } : void 0);
|
|
1425
|
+
}
|
|
1426
|
+
//#endregion
|
|
1427
|
+
//#region node_modules/@solidjs/web/dist/web.js
|
|
1428
|
+
var q = /*#__PURE__*/ Symbol("slot"), rn = /*#__PURE__*/ Symbol("host"), an = {
|
|
1429
|
+
transparent: !0,
|
|
1430
|
+
sync: !0
|
|
1431
|
+
};
|
|
1432
|
+
function J(e, t, n) {
|
|
1433
|
+
Jt(e, t, n ? {
|
|
1434
|
+
sync: !0,
|
|
1435
|
+
...n,
|
|
1436
|
+
transparent: !n.scope
|
|
1437
|
+
} : an);
|
|
1438
|
+
}
|
|
1439
|
+
function on(e, t, n, r) {
|
|
1440
|
+
let i = n.length, a = t.length, o = i, s = 0, c = 0, l = t[a - 1], u = l[q], d = l.parentNode === e && (!u || u === r) ? l.nextSibling : r || null, f = null, p, m, h = (t) => {
|
|
1441
|
+
if (!t) return !1;
|
|
1442
|
+
let n = t[q];
|
|
1443
|
+
return t.parentNode === e && (!n || n === r);
|
|
1444
|
+
};
|
|
1445
|
+
for (; s < a || c < o;) {
|
|
1446
|
+
if (t[s] === n[c] && h(t[s])) {
|
|
1447
|
+
s++, c++;
|
|
1448
|
+
continue;
|
|
1449
|
+
}
|
|
1450
|
+
for (; t[a - 1] === n[o - 1] && h(t[a - 1]);) a--, o--;
|
|
1451
|
+
if (a === s) {
|
|
1452
|
+
let t;
|
|
1453
|
+
if (o < i) {
|
|
1454
|
+
if (c) {
|
|
1455
|
+
let i = n[c - 1], a = i[q];
|
|
1456
|
+
t = i.parentNode === e && (!a || a === r) ? i.nextSibling : d;
|
|
1457
|
+
} else t = n[o - c];
|
|
1458
|
+
} else t = d;
|
|
1459
|
+
for (; c < o;) {
|
|
1460
|
+
let i = n[c++];
|
|
1461
|
+
e.insertBefore(i, t), r && (i[q] = r);
|
|
1462
|
+
}
|
|
1463
|
+
} else if (o === c) for (; s < a;) {
|
|
1464
|
+
let n = t[s++];
|
|
1465
|
+
if (!f || !f.has(n)) {
|
|
1466
|
+
let t = n[q];
|
|
1467
|
+
n.parentNode === e && (!t || t === r) && n.remove();
|
|
1468
|
+
}
|
|
1469
|
+
}
|
|
1470
|
+
else if ((p = t[s]) === n[o - 1] && n[c] === t[a - 1] && p.parentNode === e && (!(m = p[q]) || m === r)) {
|
|
1471
|
+
if (r) do {
|
|
1472
|
+
let n = t[--a];
|
|
1473
|
+
if (e.insertBefore(n, p), n[q] = r, c++, s >= a - 1 || c >= o) break;
|
|
1474
|
+
} while (t[s] === n[o - 1] && n[c] === t[a - 1]);
|
|
1475
|
+
else do
|
|
1476
|
+
if (e.insertBefore(t[--a], p), c++, s >= a - 1 || c >= o) break;
|
|
1477
|
+
while (t[s] === n[o - 1] && n[c] === t[a - 1]);
|
|
1478
|
+
} else {
|
|
1479
|
+
if (!f) {
|
|
1480
|
+
f = /* @__PURE__ */ new Map();
|
|
1481
|
+
let e = c;
|
|
1482
|
+
for (; e < o;) f.set(n[e], e++);
|
|
1483
|
+
}
|
|
1484
|
+
let i = f.get(t[s]);
|
|
1485
|
+
if (i != null) {
|
|
1486
|
+
if (c < i && i < o) {
|
|
1487
|
+
let l = s, u = 1, p;
|
|
1488
|
+
for (; ++l < a && l < o && (p = f.get(t[l])) != null && p === i + u;) u++;
|
|
1489
|
+
if (u > i - c) {
|
|
1490
|
+
let a = t[s], o = a[q], l = a.parentNode === e && (!o || o === r) ? a : d;
|
|
1491
|
+
for (; c < i;) {
|
|
1492
|
+
let t = n[c++];
|
|
1493
|
+
e.insertBefore(t, l), r && (t[q] = r);
|
|
1494
|
+
}
|
|
1495
|
+
} else {
|
|
1496
|
+
let i = t[s++], a = n[c++], o = i[q];
|
|
1497
|
+
i.parentNode === e && (!o || o === r) ? e.replaceChild(a, i) : e.insertBefore(a, d), r && (a[q] = r);
|
|
1498
|
+
}
|
|
1499
|
+
} else s++;
|
|
1500
|
+
} else {
|
|
1501
|
+
let n = t[s++], i = n[q];
|
|
1502
|
+
n.parentNode === e && (!i || i === r) && n.remove();
|
|
1503
|
+
}
|
|
1504
|
+
}
|
|
1505
|
+
}
|
|
1506
|
+
}
|
|
1507
|
+
var sn = "_$SOLID_EVENT_OWNER", cn = {}, ln = /* @__PURE__ */ new Set(), Y = /* @__PURE__ */ new Map();
|
|
1508
|
+
function un(e, t, n, r = {}) {
|
|
1509
|
+
let i;
|
|
1510
|
+
pn(t);
|
|
1511
|
+
try {
|
|
1512
|
+
qe((a) => {
|
|
1513
|
+
if (i = a, t === document) {
|
|
1514
|
+
let t = e();
|
|
1515
|
+
J(() => Vt(t), () => {});
|
|
1516
|
+
} else {
|
|
1517
|
+
let i = e();
|
|
1518
|
+
$(t, () => i, t.firstChild ? null : void 0, n, {
|
|
1519
|
+
...r.insertOptions,
|
|
1520
|
+
schedule: !0
|
|
1521
|
+
});
|
|
1522
|
+
}
|
|
1523
|
+
}, { id: r.renderId }), Te();
|
|
1524
|
+
} catch (e) {
|
|
1525
|
+
throw i && i(), mn(t), e;
|
|
1526
|
+
}
|
|
1527
|
+
return () => {
|
|
1528
|
+
i(), mn(t), t.textContent = "";
|
|
1529
|
+
};
|
|
1530
|
+
}
|
|
1531
|
+
function dn(e, t, n) {
|
|
1532
|
+
let r = document.createElement("template");
|
|
1533
|
+
return r.innerHTML = e, n === 2 ? r.content.firstChild.firstChild : r.content.firstChild;
|
|
1534
|
+
}
|
|
1535
|
+
function X(e, t) {
|
|
1536
|
+
let n;
|
|
1537
|
+
return t === 1 ? (r) => document.importNode(n ||= dn(e, r, t), !0) : (r) => (n ||= dn(e, r, t)).cloneNode(!0);
|
|
1538
|
+
}
|
|
1539
|
+
function fn(e) {
|
|
1540
|
+
for (let t = 0, n = e.length; t < n; t++) {
|
|
1541
|
+
let n = e[t];
|
|
1542
|
+
ln.has(n) || (ln.add(n), Y.forEach((e, t) => _n(n, t, e)));
|
|
1543
|
+
}
|
|
1544
|
+
}
|
|
1545
|
+
function pn(e) {
|
|
1546
|
+
let t = hn(e, e);
|
|
1547
|
+
t && (t.roots = (t.roots || 0) + 1);
|
|
1548
|
+
}
|
|
1549
|
+
function mn(e) {
|
|
1550
|
+
let t = Y.get(e);
|
|
1551
|
+
t && (t.roots > 1 ? t.roots-- : delete t.roots), gn(e, e);
|
|
1552
|
+
}
|
|
1553
|
+
function hn(e, t = e) {
|
|
1554
|
+
if (!e || !t) return;
|
|
1555
|
+
let n = Y.get(e);
|
|
1556
|
+
return n || Y.set(e, n = {
|
|
1557
|
+
owners: /* @__PURE__ */ new Map(),
|
|
1558
|
+
handlers: /* @__PURE__ */ new Map()
|
|
1559
|
+
}), n.owners.set(t, (n.owners.get(t) || 0) + 1), ln.forEach((t) => _n(t, e, n)), n;
|
|
1560
|
+
}
|
|
1561
|
+
function gn(e, t = e) {
|
|
1562
|
+
let n = Y.get(e);
|
|
1563
|
+
if (!n) return;
|
|
1564
|
+
let r = n.owners.get(t);
|
|
1565
|
+
r > 1 ? n.owners.set(t, r - 1) : n.owners.delete(t), !n.owners.size && (n.handlers.forEach((t, n) => e.removeEventListener(n, t)), Y.delete(e));
|
|
1566
|
+
}
|
|
1567
|
+
function _n(e, t, n) {
|
|
1568
|
+
if (n.handlers.has(e)) return;
|
|
1569
|
+
let r = (e) => wn(e, t, n);
|
|
1570
|
+
n.handlers.set(e, r), t.addEventListener(e, r);
|
|
1571
|
+
}
|
|
1572
|
+
function vn(e, t) {
|
|
1573
|
+
let n = e, r = 0;
|
|
1574
|
+
for (; n;) {
|
|
1575
|
+
if (t.owners.has(n)) return {
|
|
1576
|
+
owner: n,
|
|
1577
|
+
distance: r
|
|
1578
|
+
};
|
|
1579
|
+
r++, n = n._$host || n.parentNode || n.host;
|
|
1580
|
+
}
|
|
1581
|
+
}
|
|
1582
|
+
var yn = null;
|
|
1583
|
+
function bn(e) {
|
|
1584
|
+
if (yn !== null) for (let t = 0; t < yn.length; t++) yn[t](e);
|
|
1585
|
+
return e;
|
|
1586
|
+
}
|
|
1587
|
+
function Z(e, t, n) {
|
|
1588
|
+
Cn(e) || (n == null || n === !1 ? e.removeAttribute(t) : e.setAttribute(t, n === !0 ? "" : n), yn !== null && (t === "href" || t === "action") && bn(e));
|
|
1589
|
+
}
|
|
1590
|
+
function xn(e, t, n) {
|
|
1591
|
+
n == null ? e.style.removeProperty(t) : e.style.setProperty(t, n);
|
|
1592
|
+
}
|
|
1593
|
+
var Sn = { scope: !0 }, Q = null;
|
|
1594
|
+
function $(e, t, n, r, i) {
|
|
1595
|
+
let a = n !== void 0, o = i && i.host;
|
|
1596
|
+
if (a && !r && (r = []), Q !== null && (r = Q.claimInitial(e, a, r)), typeof t != "function" && (t = En(t, r, a, !0), typeof t != "function")) {
|
|
1597
|
+
Tn(e, t, r, n), o && Dn(t, o);
|
|
1598
|
+
return;
|
|
1599
|
+
}
|
|
1600
|
+
if (a && r.length === 0) {
|
|
1601
|
+
let t = document.createTextNode("");
|
|
1602
|
+
e.insertBefore(t, n), r = [t];
|
|
1603
|
+
}
|
|
1604
|
+
let s = r;
|
|
1605
|
+
J((r) => {
|
|
1606
|
+
Q !== null && (s = Q.reclaimRegion(s, e, n));
|
|
1607
|
+
let c = En(t(), s, a, !0);
|
|
1608
|
+
return typeof c == "function" ? (J(() => (Q !== null && (s = Q.reclaimRegion(s, e, n)), En(c, s, a)), (t) => {
|
|
1609
|
+
s = Tn(e, t, s, n), o && Dn(s, o);
|
|
1610
|
+
}, r !== void 0 && !(i && i.schedule) ? {
|
|
1611
|
+
...i,
|
|
1612
|
+
schedule: !0
|
|
1613
|
+
} : i), cn) : c;
|
|
1614
|
+
}, (t) => {
|
|
1615
|
+
t !== cn && (s = Tn(e, t, s, n), o && Dn(s, o));
|
|
1616
|
+
}, t.$s ? i ? {
|
|
1617
|
+
...i,
|
|
1618
|
+
scope: !0
|
|
1619
|
+
} : Sn : i);
|
|
1620
|
+
}
|
|
1621
|
+
function Cn(e) {
|
|
1622
|
+
if (!Wt.hydrating) return !1;
|
|
1623
|
+
if (!e || e.isConnected) return !0;
|
|
1624
|
+
let t = Wt.claimRoots;
|
|
1625
|
+
if (t) {
|
|
1626
|
+
for (let n = 0; n < t.length; n++) if (t[n].contains(e)) return !0;
|
|
1627
|
+
}
|
|
1628
|
+
return !1;
|
|
1629
|
+
}
|
|
1630
|
+
function wn(e, t, n) {
|
|
1631
|
+
if (Q !== null && Q.dedupEvent(e)) return;
|
|
1632
|
+
let r = e[sn], i;
|
|
1633
|
+
if (r) {
|
|
1634
|
+
if (r === !0 || r === t || !t.contains(r)) return;
|
|
1635
|
+
i = r;
|
|
1636
|
+
}
|
|
1637
|
+
let a = n && (n.owners.size === 1 && n.owners.has(t) ? t : vn(e.target, n)?.owner);
|
|
1638
|
+
if (n && !a || a && a === i) return;
|
|
1639
|
+
e[sn] = a || !0;
|
|
1640
|
+
let o = i || e.target, s = `$$${e.type}`, c = e.target, l = a || t || e.currentTarget, u = (t) => Object.defineProperty(e, "target", {
|
|
1641
|
+
configurable: !0,
|
|
1642
|
+
value: t
|
|
1643
|
+
}), d = () => {
|
|
1644
|
+
let t = o[s];
|
|
1645
|
+
if (t === void 0 && o.hasAttribute && o.hasAttribute("_bnd")) {
|
|
1646
|
+
let n = globalThis[Symbol.for("solid.bnd")];
|
|
1647
|
+
n && (t = n.resolve(o, e.type));
|
|
1648
|
+
}
|
|
1649
|
+
if (t && !o.disabled) {
|
|
1650
|
+
let n = o[`${s}Data`];
|
|
1651
|
+
if (n === void 0 ? t.call(o, e) : t.call(o, n, e), e.cancelBubble) return;
|
|
1652
|
+
}
|
|
1653
|
+
return o.host && typeof o.host != "string" && !o.host._$host && o.contains(e.target) && u(o.host), !0;
|
|
1654
|
+
}, f = () => {
|
|
1655
|
+
for (; o && d() && o !== l && o.parentNode !== l;) o = o._$host || o.parentNode || o.host;
|
|
1656
|
+
};
|
|
1657
|
+
if (Object.defineProperty(e, "currentTarget", {
|
|
1658
|
+
configurable: !0,
|
|
1659
|
+
get() {
|
|
1660
|
+
return o || l || document;
|
|
1661
|
+
}
|
|
1662
|
+
}), i) i === e.target && (o = i._$host || i.parentNode || i.host), o && o !== l && f();
|
|
1663
|
+
else if (e.composedPath) {
|
|
1664
|
+
let t = e.composedPath();
|
|
1665
|
+
if (t.length) {
|
|
1666
|
+
u(t[0]);
|
|
1667
|
+
for (let e = 0; e < t.length && (o = t[e], d()); e++) {
|
|
1668
|
+
if (o._$host) {
|
|
1669
|
+
o = o._$host, f();
|
|
1670
|
+
break;
|
|
1671
|
+
}
|
|
1672
|
+
if (o === l || o.parentNode === l) break;
|
|
1673
|
+
}
|
|
1674
|
+
} else f();
|
|
1675
|
+
} else f();
|
|
1676
|
+
u(c);
|
|
1677
|
+
}
|
|
1678
|
+
function Tn(e, t, n, r) {
|
|
1679
|
+
if (Q !== null && Cn(e)) {
|
|
1680
|
+
if (t && t !== n) {
|
|
1681
|
+
let e = Array.isArray(t);
|
|
1682
|
+
for (let r of e ? t : [t]) if (r && r.nodeType) {
|
|
1683
|
+
if (!Cn(r)) return n;
|
|
1684
|
+
} else if (e && (typeof r == "string" || typeof r == "number")) return n;
|
|
1685
|
+
}
|
|
1686
|
+
return t;
|
|
1687
|
+
}
|
|
1688
|
+
if (t === n) return t;
|
|
1689
|
+
let i = typeof t, a = r !== void 0;
|
|
1690
|
+
if (i === "string" || i === "number") {
|
|
1691
|
+
let r = typeof n;
|
|
1692
|
+
r === "string" || r === "number" ? e.firstChild.data = t : kn(e, n) ? e.textContent = t : (An(e, n), e.insertBefore(document.createTextNode(t), e.firstChild));
|
|
1693
|
+
} else if (t === void 0) jn(e, n, r);
|
|
1694
|
+
else if (t.nodeType) Array.isArray(n) ? jn(e, n, a ? r : null, t) : n && n.nodeType ? n.parentNode === e ? e.replaceChild(t, n) : e.appendChild(t) : n && e.firstChild ? e.replaceChild(t, e.firstChild) : e.appendChild(t), r && (t[q] = r);
|
|
1695
|
+
else if (Array.isArray(t)) {
|
|
1696
|
+
let i = n && Array.isArray(n);
|
|
1697
|
+
for (let e = 0, r = t.length; e < r; e++) {
|
|
1698
|
+
let r = t[e], a = typeof r;
|
|
1699
|
+
if (a === "string" || a === "number") {
|
|
1700
|
+
let a = i ? n[e] : void 0;
|
|
1701
|
+
a && a.nodeType === 3 ? (a.data !== "" + r && (a.data = r), t[e] = a) : t[e] = document.createTextNode(r);
|
|
1702
|
+
}
|
|
1703
|
+
}
|
|
1704
|
+
t.length === 0 ? jn(e, n, r) : i ? n.length === 0 ? On(e, t, r) : on(e, n, t, r) : (n && jn(e, n), On(e, t));
|
|
1705
|
+
}
|
|
1706
|
+
return t;
|
|
1707
|
+
}
|
|
1708
|
+
function En(e, t, n, r) {
|
|
1709
|
+
if (e = Vt(e, {
|
|
1710
|
+
skipNonRendered: !0,
|
|
1711
|
+
doNotUnwrap: r
|
|
1712
|
+
}), r && typeof e == "function") return e;
|
|
1713
|
+
if (n && !Array.isArray(e) && (e = [e ?? ""]), Wt.hydrating && Array.isArray(e)) for (let n = 0, r = e.length; n < r; n++) {
|
|
1714
|
+
let r = e[n], i = t && t[n], a = typeof r;
|
|
1715
|
+
(a === "string" || a === "number") && i && i.nodeType === 3 && (e[n] = i);
|
|
1716
|
+
}
|
|
1717
|
+
return e;
|
|
1718
|
+
}
|
|
1719
|
+
function Dn(e, t) {
|
|
1720
|
+
if (Array.isArray(e)) for (let n = 0, r = e.length; n < r; n++) Dn(e[n], t);
|
|
1721
|
+
else e && e.nodeType && e[rn] !== t && (e[rn] = t, Object.defineProperty(e, "_$host", {
|
|
1722
|
+
get: t,
|
|
1723
|
+
configurable: !0
|
|
1724
|
+
}));
|
|
1725
|
+
}
|
|
1726
|
+
function On(e, t, n = null) {
|
|
1727
|
+
for (let r = 0, i = t.length; r < i; r++) {
|
|
1728
|
+
let i = t[r];
|
|
1729
|
+
e.insertBefore(i, n), n && (i[q] = n);
|
|
1730
|
+
}
|
|
1731
|
+
}
|
|
1732
|
+
function kn(e, t) {
|
|
1733
|
+
if (t == null) return !0;
|
|
1734
|
+
if (Array.isArray(t)) return t.length ? e.firstChild === t[0] && e.lastChild === t[t.length - 1] : e.firstChild === null;
|
|
1735
|
+
if (t === "") return e.firstChild === null;
|
|
1736
|
+
if (t.nodeType) return e.firstChild === t && e.lastChild === t;
|
|
1737
|
+
let n = e.firstChild;
|
|
1738
|
+
return n !== null && n.nodeType === 3 && e.lastChild === n;
|
|
1739
|
+
}
|
|
1740
|
+
function An(e, t) {
|
|
1741
|
+
if (Array.isArray(t)) for (let n = 0; n < t.length; n++) {
|
|
1742
|
+
let r = t[n];
|
|
1743
|
+
r.parentNode === e && r.remove();
|
|
1744
|
+
}
|
|
1745
|
+
else if (t.nodeType) t.parentNode === e && t.remove();
|
|
1746
|
+
else {
|
|
1747
|
+
let t = e.firstChild;
|
|
1748
|
+
t && t.nodeType === 3 && t.remove();
|
|
1749
|
+
}
|
|
1750
|
+
}
|
|
1751
|
+
function jn(e, t, n, r) {
|
|
1752
|
+
if (n === void 0) return kn(e, t) ? e.textContent = "" : An(e, t);
|
|
1753
|
+
if (t.length) {
|
|
1754
|
+
let i = !1;
|
|
1755
|
+
for (let a = t.length - 1; a >= 0; a--) {
|
|
1756
|
+
let o = t[a];
|
|
1757
|
+
if (r !== o) {
|
|
1758
|
+
let t = o[q], s = o.parentNode === e && (!t || t === n);
|
|
1759
|
+
r && !i && !a ? s ? e.replaceChild(r, o) : e.insertBefore(r, n) : s && o.remove();
|
|
1760
|
+
} else i = !0;
|
|
1761
|
+
}
|
|
1762
|
+
} else r && e.insertBefore(r, n);
|
|
1763
|
+
r && n && (r[q] = n);
|
|
1764
|
+
}
|
|
1765
|
+
//#endregion
|
|
1766
|
+
//#region virtual:solid-ssr-error-boundary.tsx
|
|
1767
|
+
var Mn = /* @__PURE__ */ X("<span style=font-size:1.5em;text-align:center;position:fixed;left:0;bottom:55%;width:100%>");
|
|
1768
|
+
function Nn(e) {
|
|
1769
|
+
console.error(e.error());
|
|
1770
|
+
var t = Mn();
|
|
1771
|
+
return $(t, "Error | Uncaught Client Exception"), t;
|
|
1772
|
+
}
|
|
1773
|
+
function Pn(e) {
|
|
1774
|
+
return K(tn, {
|
|
1775
|
+
fallback: (e) => K(Nn, { error: e }),
|
|
1776
|
+
get children() {
|
|
1777
|
+
return e.children;
|
|
1778
|
+
}
|
|
1779
|
+
});
|
|
1780
|
+
}
|
|
1781
|
+
//#endregion
|
|
1782
|
+
//#region src/lib/soop/api.ts
|
|
1783
|
+
var Fn = class {
|
|
1784
|
+
#e;
|
|
1785
|
+
constructor(e, t) {
|
|
1786
|
+
this.#e = new URL(e, t);
|
|
1787
|
+
}
|
|
1788
|
+
async fetchBody() {
|
|
1789
|
+
try {
|
|
1790
|
+
let e = await fetch(this.#e);
|
|
1791
|
+
return e.ok ? await e.json() : void 0;
|
|
1792
|
+
} catch {
|
|
1793
|
+
return;
|
|
1794
|
+
}
|
|
1795
|
+
}
|
|
1796
|
+
}, In = class e {
|
|
1797
|
+
static #e = {
|
|
1798
|
+
channel: "https://api-channel.sooplive.com",
|
|
1799
|
+
profile: "https://stimg.sooplive.com",
|
|
1800
|
+
preview: "https://liveimg.sooplive.com"
|
|
1801
|
+
};
|
|
1802
|
+
static station(t) {
|
|
1803
|
+
let n = `/v1.1/channel/${t}/station`, r = e.#e.channel;
|
|
1804
|
+
return new Fn(n, r);
|
|
1805
|
+
}
|
|
1806
|
+
static broadcast(t) {
|
|
1807
|
+
let n = `/v1.1/channel/${t}/home/section/broad`, r = e.#e.channel;
|
|
1808
|
+
return new Fn(n, r);
|
|
1809
|
+
}
|
|
1810
|
+
static profile(t) {
|
|
1811
|
+
let [n, r] = [t, t.substring(0, 2)], i = `/LOGO/${r}/${n}/${n}.webp`, a = e.#e.profile;
|
|
1812
|
+
return new URL(i, a);
|
|
1813
|
+
}
|
|
1814
|
+
static preview(t) {
|
|
1815
|
+
let n = `/${t}`, r = e.#e.preview;
|
|
1816
|
+
return new URL(n, r);
|
|
1817
|
+
}
|
|
1818
|
+
}, Ln = class e {
|
|
1819
|
+
id;
|
|
1820
|
+
profile;
|
|
1821
|
+
nickname;
|
|
1822
|
+
constructor(e) {
|
|
1823
|
+
this.id = e.id, this.nickname = e.nickname, this.profile = In.profile(this.id);
|
|
1824
|
+
}
|
|
1825
|
+
async fetchBroadcast() {
|
|
1826
|
+
return Rn.create(this.id);
|
|
1827
|
+
}
|
|
1828
|
+
static async create(t) {
|
|
1829
|
+
let n = await In.station(t).fetchBody();
|
|
1830
|
+
if (!n) return;
|
|
1831
|
+
let { userNick: r, broadStart: i, profileImage: a } = n.station;
|
|
1832
|
+
return new e({
|
|
1833
|
+
id: t,
|
|
1834
|
+
nickname: r
|
|
1835
|
+
});
|
|
1836
|
+
}
|
|
1837
|
+
}, Rn = class e {
|
|
1838
|
+
id;
|
|
1839
|
+
preview;
|
|
1840
|
+
title;
|
|
1841
|
+
viewers;
|
|
1842
|
+
category;
|
|
1843
|
+
static async create(t) {
|
|
1844
|
+
let n = await In.broadcast(t).fetchBody();
|
|
1845
|
+
if (!n || typeof n.broadNo != "number" || !Number.isFinite(n.broadNo)) return;
|
|
1846
|
+
let { broadNo: r, broadTitle: i, currentSumViewer: a, categoryName: o } = n;
|
|
1847
|
+
return new e({
|
|
1848
|
+
id: r.toString(),
|
|
1849
|
+
title: i,
|
|
1850
|
+
viewers: a,
|
|
1851
|
+
category: o
|
|
1852
|
+
});
|
|
1853
|
+
}
|
|
1854
|
+
constructor(e) {
|
|
1855
|
+
this.id = e.id, this.title = e.title, this.viewers = e.viewers, this.category = e.category, this.preview = In.preview(this.id);
|
|
1856
|
+
}
|
|
1857
|
+
}, zn = /* @__PURE__ */ X("<div class=avatar-preview-anchor><img class=avatar>"), Bn = /* @__PURE__ */ X("<button class=avatar-more type=button>+"), Vn = /* @__PURE__ */ X("<div class=avatar-overflow role=list>"), Hn = /* @__PURE__ */ X("<section class=avatar-list aria-label=\"Avatar list\"><div class=avatar-stack><!><!></div><!><!>"), Un = /* @__PURE__ */ X("<div class=avatar-stack-item>"), Wn = /* @__PURE__ */ X("<div class=avatar-overflow-item role=listitem>"), Gn = /* @__PURE__ */ X("<img class=avatar-preview alt=\"Broadcast preview\">"), Kn = 40, qn = 12;
|
|
1858
|
+
function Jn(e) {
|
|
1859
|
+
let t = Gt(async () => {
|
|
1860
|
+
let t = await Ln.create(e.userId);
|
|
1861
|
+
return {
|
|
1862
|
+
user: t,
|
|
1863
|
+
broad: await t?.fetchBroadcast()
|
|
1864
|
+
};
|
|
1865
|
+
});
|
|
1866
|
+
return K(tn, {
|
|
1867
|
+
fallback: [],
|
|
1868
|
+
get children() {
|
|
1869
|
+
return K(nn, {
|
|
1870
|
+
fallback: [],
|
|
1871
|
+
get children() {
|
|
1872
|
+
var n = zn(), r = n.firstChild;
|
|
1873
|
+
return n.addEventListener("blur", () => e.onPreviewChange?.(void 0)), n.addEventListener("focus", () => e.onPreviewChange?.(t().broad?.preview.href)), n.addEventListener("mouseleave", () => e.onPreviewChange?.(void 0)), n.addEventListener("mouseenter", () => e.onPreviewChange?.(t().broad?.preview.href)), J(() => ({
|
|
1874
|
+
e: !!t().broad?.preview.href,
|
|
1875
|
+
t: !t().broad?.preview.href,
|
|
1876
|
+
a: t().user.profile.href,
|
|
1877
|
+
o: `${e.userId} profile`
|
|
1878
|
+
}), ({ e, t, a: i, o: a }, o) => {
|
|
1879
|
+
e !== o?.e && n.classList.toggle("avatar-live", e), t !== o?.t && n.classList.toggle("avatar-offline", t), i !== o?.a && Z(r, "src", i), a !== o?.o && Z(r, "alt", a);
|
|
1880
|
+
}), n;
|
|
1881
|
+
}
|
|
1882
|
+
});
|
|
1883
|
+
}
|
|
1884
|
+
});
|
|
1885
|
+
}
|
|
1886
|
+
function Yn(e) {
|
|
1887
|
+
let [t, n] = Kt(!1), [r, i] = Kt(), a = `avatar-overflow-${Zt()}`, o = () => typeof e.userIds == "function" ? e.userIds() : e.userIds, s = () => {
|
|
1888
|
+
let t = typeof e.visibleCount == "function" ? e.visibleCount() : e.visibleCount;
|
|
1889
|
+
return Math.max(0, t ?? 4);
|
|
1890
|
+
}, c = () => o().slice(0, s()), l = () => o().slice(s()), u = () => {
|
|
1891
|
+
let e = c().length;
|
|
1892
|
+
return e * Kn - Math.max(0, e - 1) * qn + (l().length > 0 ? 48 : 0);
|
|
1893
|
+
};
|
|
1894
|
+
var d = Hn(), f = d.firstChild, p = f.firstChild, m = p.nextSibling, h = f.nextSibling, g = h.nextSibling;
|
|
1895
|
+
return $(f, K($t, {
|
|
1896
|
+
get each() {
|
|
1897
|
+
return c();
|
|
1898
|
+
},
|
|
1899
|
+
children: (e) => (() => {
|
|
1900
|
+
var t = Un();
|
|
1901
|
+
return $(t, K(Jn, {
|
|
1902
|
+
userId: e,
|
|
1903
|
+
onPreviewChange: i
|
|
1904
|
+
})), t;
|
|
1905
|
+
})()
|
|
1906
|
+
}), p), $(f, K(en, {
|
|
1907
|
+
get when() {
|
|
1908
|
+
return l().length > 0;
|
|
1909
|
+
},
|
|
1910
|
+
get children() {
|
|
1911
|
+
var e = Bn();
|
|
1912
|
+
return e.firstChild, e.$$click = () => n((e) => !e), Z(e, "aria-controls", a), $(e, () => l().length, null), J(() => t() ? "true" : "false", (t) => {
|
|
1913
|
+
Z(e, "aria-expanded", t);
|
|
1914
|
+
}), e;
|
|
1915
|
+
}
|
|
1916
|
+
}), m), $(d, K(en, {
|
|
1917
|
+
get when() {
|
|
1918
|
+
return t();
|
|
1919
|
+
},
|
|
1920
|
+
get children() {
|
|
1921
|
+
var e = Vn();
|
|
1922
|
+
return Z(e, "id", a), $(e, K($t, {
|
|
1923
|
+
get each() {
|
|
1924
|
+
return l();
|
|
1925
|
+
},
|
|
1926
|
+
children: (e) => (() => {
|
|
1927
|
+
var t = Wn();
|
|
1928
|
+
return $(t, K(Jn, {
|
|
1929
|
+
userId: e,
|
|
1930
|
+
onPreviewChange: i
|
|
1931
|
+
})), t;
|
|
1932
|
+
})()
|
|
1933
|
+
})), e;
|
|
1934
|
+
}
|
|
1935
|
+
}), h), $(d, K(en, {
|
|
1936
|
+
get when() {
|
|
1937
|
+
return r();
|
|
1938
|
+
},
|
|
1939
|
+
children: (e) => (() => {
|
|
1940
|
+
var t = Gn();
|
|
1941
|
+
return J(() => e(), (e) => {
|
|
1942
|
+
Z(t, "src", e);
|
|
1943
|
+
}), t;
|
|
1944
|
+
})()
|
|
1945
|
+
}), g), J(() => `${u()}px`, (e) => {
|
|
1946
|
+
xn(d, "width", e);
|
|
1947
|
+
}), d;
|
|
1948
|
+
}
|
|
1949
|
+
fn(["click"]);
|
|
1950
|
+
//#endregion
|
|
1951
|
+
//#region src/App.tsx
|
|
1952
|
+
var Xn = /* @__PURE__ */ X("<header class=header>"), Zn = [
|
|
1953
|
+
"mawang0216",
|
|
1954
|
+
"lilpa0309",
|
|
1955
|
+
"b13246",
|
|
1956
|
+
"tjrdbs999",
|
|
1957
|
+
"mawang0216",
|
|
1958
|
+
"lilpa0309",
|
|
1959
|
+
"b13246",
|
|
1960
|
+
"tjrdbs999",
|
|
1961
|
+
"mawang0216",
|
|
1962
|
+
"lilpa0309",
|
|
1963
|
+
"b13246",
|
|
1964
|
+
"tjrdbs999",
|
|
1965
|
+
"mawang0216",
|
|
1966
|
+
"lilpa0309",
|
|
1967
|
+
"b13246",
|
|
1968
|
+
"tjrdbs999"
|
|
1969
|
+
];
|
|
1970
|
+
function Qn() {
|
|
1971
|
+
var e = Xn();
|
|
1972
|
+
return $(e, K(Yn, {
|
|
1973
|
+
userIds: Zn,
|
|
1974
|
+
visibleCount: 4
|
|
1975
|
+
})), e;
|
|
1976
|
+
}
|
|
1977
|
+
//#endregion
|
|
1978
|
+
//#region virtual:solid-ssr-entry-client.tsx
|
|
1979
|
+
un(() => K(Pn, { get children() {
|
|
1980
|
+
return K(Qn, {});
|
|
1981
|
+
} }), document.body);
|
|
1982
|
+
//#endregion
|