@tanstack/solid-query-devtools 6.0.0-alpha.2 → 6.0.0-beta.4

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/build/index.cjs CHANGED
@@ -13,1160 +13,14 @@ var __export = (target, all) => {
13
13
  for (var name in all)
14
14
  __defProp(target, name, { get: all[name], enumerable: true });
15
15
  };
16
-
17
- // ../../node_modules/.pnpm/@solidjs+signals@0.13.6/node_modules/@solidjs/signals/dist/prod.js
18
- function actualInsertIntoHeap(e, t) {
19
- const n = (e.i?.t ? e.i.u?.o : e.i?.o) ?? -1;
20
- if (n >= e.o) e.o = n + 1;
21
- const i = e.o;
22
- const r = t.l[i];
23
- if (r === void 0) t.l[i] = e;
24
- else {
25
- const t2 = r.T;
26
- t2.S = e;
27
- e.T = t2;
28
- r.T = e;
29
- }
30
- if (i > t.R) t.R = i;
31
- }
32
- function insertIntoHeap(e, t) {
33
- let n = e.O;
34
- if (n & (REACTIVE_IN_HEAP | REACTIVE_RECOMPUTING_DEPS)) return;
35
- if (n & REACTIVE_CHECK) {
36
- e.O = n & -4 | REACTIVE_DIRTY | REACTIVE_IN_HEAP;
37
- } else e.O = n | REACTIVE_IN_HEAP;
38
- if (!(n & REACTIVE_IN_HEAP_HEIGHT)) actualInsertIntoHeap(e, t);
39
- }
40
- function insertIntoHeapHeight(e, t) {
41
- let n = e.O;
42
- if (n & (REACTIVE_IN_HEAP | REACTIVE_RECOMPUTING_DEPS | REACTIVE_IN_HEAP_HEIGHT)) return;
43
- e.O = n | REACTIVE_IN_HEAP_HEIGHT;
44
- actualInsertIntoHeap(e, t);
45
- }
46
- function deleteFromHeap(e, t) {
47
- const n = e.O;
48
- if (!(n & (REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT))) return;
49
- e.O = n & -25;
50
- const i = e.o;
51
- if (e.T === e) t.l[i] = void 0;
52
- else {
53
- const n2 = e.S;
54
- const r = t.l[i];
55
- const s = n2 ?? r;
56
- if (e === r) t.l[i] = n2;
57
- else e.T.S = n2;
58
- s.T = e.T;
59
- }
60
- e.T = e;
61
- e.S = void 0;
62
- }
63
- function runHeap(e, t) {
64
- e._ = false;
65
- for (e.P = 0; e.P <= e.R; e.P++) {
66
- let n = e.l[e.P];
67
- while (n !== void 0) {
68
- if (n.O & REACTIVE_IN_HEAP) t(n);
69
- else adjustHeight(n, e);
70
- n = e.l[e.P];
71
- }
72
- }
73
- e.R = 0;
74
- }
75
- function adjustHeight(e, t) {
76
- deleteFromHeap(e, t);
77
- let n = e.o;
78
- for (let t2 = e.C; t2; t2 = t2.D) {
79
- const e2 = t2.m;
80
- const i = e2.V || e2;
81
- if (i.L && i.o >= n) n = i.o + 1;
82
- }
83
- if (e.o !== n) {
84
- e.o = n;
85
- for (let n2 = e.I; n2 !== null; n2 = n2.p) {
86
- insertIntoHeapHeight(n2.h, t);
87
- }
88
- }
89
- }
90
- function runLaneEffects(e) {
91
- for (const t of activeLanes) {
92
- if (t.U || t.k.size > 0) continue;
93
- const n = t.G[e - 1];
94
- if (n.length) {
95
- t.G[e - 1] = [];
96
- runQueue(n, e);
97
- }
98
- }
99
- }
100
- function queueStashedOptimisticEffects(e) {
101
- for (let t = e.I; t !== null; t = t.p) {
102
- const e2 = t.h;
103
- if (!e2.W) continue;
104
- if (e2.W === EFFECT_TRACKED) {
105
- if (!e2.H) {
106
- e2.H = true;
107
- e2.F.enqueue(EFFECT_USER, e2.M);
108
- }
109
- continue;
110
- }
111
- const n = e2.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
112
- if (n.P > e2.o) n.P = e2.o;
113
- insertIntoHeap(e2, n);
114
- }
115
- }
116
- function mergeTransitionState(e, t) {
117
- t.$ = e;
118
- e.j.push(...t.j);
119
- for (const n of activeLanes) {
120
- if (n.K === t) n.K = e;
121
- }
122
- e.Y.push(...t.Y);
123
- for (const n of t.Z) e.Z.add(n);
124
- for (const n of t.B) {
125
- if (!e.B.includes(n)) e.B.push(n);
126
- }
127
- }
128
- function resolveOptimisticNodes(e) {
129
- for (let t = 0; t < e.length; t++) {
130
- const n = e[t];
131
- n.q = void 0;
132
- if (n.X !== NOT_PENDING) {
133
- n.J = n.X;
134
- n.X = NOT_PENDING;
135
- }
136
- const i = n.ee;
137
- n.ee = NOT_PENDING;
138
- if (i !== NOT_PENDING && n.J !== i) insertSubs(n, true);
139
- n.K = null;
140
- }
141
- e.length = 0;
142
- }
143
- function cleanupCompletedLanes(e) {
144
- for (const t of activeLanes) {
145
- const n = e ? t.K === e : !t.K;
146
- if (!n) continue;
147
- if (!t.U) {
148
- if (t.G[0].length) runQueue(t.G[0], EFFECT_RENDER);
149
- if (t.G[1].length) runQueue(t.G[1], EFFECT_USER);
150
- }
151
- if (t.te.q === t) t.te.q = void 0;
152
- t.k.clear();
153
- t.G[0].length = 0;
154
- t.G[1].length = 0;
155
- activeLanes.delete(t);
156
- signalLanes.delete(t.te);
157
- }
158
- }
159
- function schedule() {
160
- if (scheduled) return;
161
- scheduled = true;
162
- if (!globalQueue.ne && !projectionWriteActive) queueMicrotask(flush);
163
- }
164
- function insertSubs(e, t = false) {
165
- const n = e.q || currentOptimisticLane;
166
- const i = e.Te !== void 0;
167
- for (let r = e.I; r !== null; r = r.p) {
168
- if (i && r.h.de) {
169
- r.h.O |= REACTIVE_SNAPSHOT_STALE;
170
- continue;
171
- }
172
- if (t && n) {
173
- r.h.O |= REACTIVE_OPTIMISTIC_DIRTY;
174
- assignOrMergeLane(r.h, n);
175
- } else if (t) {
176
- r.h.O |= REACTIVE_OPTIMISTIC_DIRTY;
177
- r.h.q = void 0;
178
- }
179
- const e2 = r.h;
180
- if (e2.W === EFFECT_TRACKED) {
181
- if (!e2.H) {
182
- e2.H = true;
183
- e2.F.enqueue(EFFECT_USER, e2.M);
184
- }
185
- continue;
186
- }
187
- const s = r.h.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
188
- if (s.P > r.h.o) s.P = r.h.o;
189
- insertIntoHeap(r.h, s);
190
- }
191
- }
192
- function commitPendingNodes() {
193
- const e = globalQueue.se;
194
- for (let t = 0; t < e.length; t++) {
195
- const n = e[t];
196
- if (n.X !== NOT_PENDING) {
197
- n.J = n.X;
198
- n.X = NOT_PENDING;
199
- if (n.W && n.W !== EFFECT_TRACKED) n.H = true;
200
- }
201
- if (!(n.Se & STATUS_PENDING)) n.Se &= ~STATUS_UNINITIALIZED;
202
- if (n.L) GlobalQueue.ue(n, false, true);
203
- }
204
- e.length = 0;
205
- }
206
- function finalizePureQueue(e = null, t = false) {
207
- const n = !t;
208
- if (n) commitPendingNodes();
209
- if (!t) checkBoundaryChildren(globalQueue);
210
- if (dirtyQueue.R >= dirtyQueue.P) runHeap(dirtyQueue, GlobalQueue.oe);
211
- if (n) {
212
- commitPendingNodes();
213
- resolveOptimisticNodes(e ? e.Y : globalQueue.Y);
214
- const t2 = e ? e.Z : globalQueue.Z;
215
- if (GlobalQueue.ce && t2.size) {
216
- for (const e2 of t2) {
217
- GlobalQueue.ce(e2);
218
- }
219
- t2.clear();
220
- schedule();
221
- }
222
- cleanupCompletedLanes(e);
223
- }
224
- }
225
- function checkBoundaryChildren(e) {
226
- for (const t of e.re) {
227
- t.checkSources?.();
228
- checkBoundaryChildren(t);
229
- }
230
- }
231
- function reassignPendingTransition(e) {
232
- for (let t = 0; t < e.length; t++) {
233
- e[t].K = activeTransition;
234
- }
235
- }
236
- function flush() {
237
- if (globalQueue.ne) {
238
- return;
239
- }
240
- while (scheduled || activeTransition) {
241
- globalQueue.flush();
242
- }
243
- }
244
- function runQueue(e, t) {
245
- for (let n = 0; n < e.length; n++) e[n](t);
246
- }
247
- function transitionComplete(e) {
248
- if (e.$) return true;
249
- if (e.j.length) return false;
250
- let t = true;
251
- for (let n = 0; n < e.B.length; n++) {
252
- const i = e.B[n];
253
- if (i.Se & STATUS_PENDING && i.le?.source === i) {
254
- t = false;
255
- break;
256
- }
257
- }
258
- if (t) {
259
- for (let n = 0; n < e.Y.length; n++) {
260
- const i = e.Y[n];
261
- if (hasActiveOverride(i) && "Se" in i && i.Se & STATUS_PENDING && i.le instanceof NotReadyError && i.le.source !== i) {
262
- t = false;
263
- break;
264
- }
265
- }
266
- }
267
- t && (e.$ = true);
268
- return t;
269
- }
270
- function currentTransition(e) {
271
- while (e.$ && typeof e.$ === "object") e = e.$;
272
- return e;
273
- }
274
- function runInTransition(e, t) {
275
- const n = activeTransition;
276
- try {
277
- activeTransition = currentTransition(e);
278
- return t();
279
- } finally {
280
- activeTransition = n;
281
- }
282
- }
283
- function getOrCreateLane(e) {
284
- let t = signalLanes.get(e);
285
- if (t) {
286
- return findLane(t);
287
- }
288
- const n = e.Re;
289
- const i = n?.q ? findLane(n.q) : null;
290
- t = { te: e, k: /* @__PURE__ */ new Set(), G: [[], []], U: null, K: activeTransition, Oe: i };
291
- signalLanes.set(e, t);
292
- activeLanes.add(t);
293
- e._e = false;
294
- return t;
295
- }
296
- function findLane(e) {
297
- while (e.U) e = e.U;
298
- return e;
299
- }
300
- function mergeLanes(e, t) {
301
- e = findLane(e);
302
- t = findLane(t);
303
- if (e === t) return e;
304
- t.U = e;
305
- for (const n of t.k) e.k.add(n);
306
- e.G[0].push(...t.G[0]);
307
- e.G[1].push(...t.G[1]);
308
- return e;
309
- }
310
- function resolveLane(e) {
311
- const t = e.q;
312
- if (!t) return void 0;
313
- const n = findLane(t);
314
- if (activeLanes.has(n)) return n;
315
- e.q = void 0;
316
- return void 0;
317
- }
318
- function resolveTransition(e) {
319
- return resolveLane(e)?.K ?? e.K;
320
- }
321
- function hasActiveOverride(e) {
322
- return !!(e.ee !== void 0 && e.ee !== NOT_PENDING);
323
- }
324
- function assignOrMergeLane(e, t) {
325
- const n = findLane(t);
326
- const i = e.q;
327
- if (i) {
328
- if (i.U) {
329
- e.q = t;
330
- return;
331
- }
332
- const r = findLane(i);
333
- if (activeLanes.has(r)) {
334
- if (r !== n && !hasActiveOverride(e)) {
335
- if (n.Oe && findLane(n.Oe) === r) {
336
- e.q = t;
337
- } else if (r.Oe && findLane(r.Oe) === n) ;
338
- else mergeLanes(n, r);
339
- }
340
- return;
341
- }
342
- }
343
- e.q = t;
344
- }
345
- function addPendingSource(e, t) {
346
- if (e.Ie === t || e.pe?.has(t)) return false;
347
- if (!e.Ie) {
348
- e.Ie = t;
349
- return true;
350
- }
351
- if (!e.pe) {
352
- e.pe = /* @__PURE__ */ new Set([e.Ie, t]);
353
- } else {
354
- e.pe.add(t);
355
- }
356
- e.Ie = void 0;
357
- return true;
358
- }
359
- function removePendingSource(e, t) {
360
- if (e.Ie) {
361
- if (e.Ie !== t) return false;
362
- e.Ie = void 0;
363
- return true;
364
- }
365
- if (!e.pe?.delete(t)) return false;
366
- if (e.pe.size === 1) {
367
- e.Ie = e.pe.values().next().value;
368
- e.pe = void 0;
369
- } else if (e.pe.size === 0) {
370
- e.pe = void 0;
371
- }
372
- return true;
373
- }
374
- function clearPendingSources(e) {
375
- e.Ie = void 0;
376
- e.pe?.clear();
377
- e.pe = void 0;
378
- }
379
- function setPendingError(e, t, n) {
380
- if (!t) {
381
- e.le = null;
382
- return;
383
- }
384
- if (n instanceof NotReadyError && n.source === t) {
385
- e.le = n;
386
- return;
387
- }
388
- const i = e.le;
389
- if (!(i instanceof NotReadyError) || i.source !== t) {
390
- e.le = new NotReadyError(t);
391
- }
392
- }
393
- function forEachDependent(e, t) {
394
- for (let n = e.I; n !== null; n = n.p) t(n.h);
395
- for (let n = e.A; n !== null; n = n.N) {
396
- for (let e2 = n.I; e2 !== null; e2 = e2.p) t(e2.h);
397
- }
398
- }
399
- function settlePendingSource(e) {
400
- let t = false;
401
- const n = /* @__PURE__ */ new Set();
402
- const settle = (i) => {
403
- if (n.has(i) || !removePendingSource(i, e)) return;
404
- n.add(i);
405
- i.Ee = clock;
406
- const r = i.Ie ?? i.pe?.values().next().value;
407
- if (r) {
408
- setPendingError(i, r);
409
- updatePendingSignal(i);
410
- } else {
411
- i.Se &= ~STATUS_PENDING;
412
- setPendingError(i);
413
- updatePendingSignal(i);
414
- if (i.he) {
415
- if (i.W === EFFECT_TRACKED) {
416
- const e2 = i;
417
- if (!e2.H) {
418
- e2.H = true;
419
- e2.F.enqueue(EFFECT_USER, e2.M);
420
- }
421
- } else {
422
- const e2 = i.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
423
- if (e2.P > i.o) e2.P = i.o;
424
- insertIntoHeap(i, e2);
425
- }
426
- t = true;
427
- }
428
- i.he = false;
429
- }
430
- forEachDependent(i, settle);
431
- };
432
- forEachDependent(e, settle);
433
- if (t) schedule();
434
- }
435
- function handleAsync(e, t, n) {
436
- const i = typeof t === "object" && t !== null;
437
- const r = i && untrack(() => t[Symbol.asyncIterator]);
438
- const s = !r && i && untrack(() => typeof t.then === "function");
439
- if (!s && !r) {
440
- e.Ae = null;
441
- return t;
442
- }
443
- e.Ae = t;
444
- let o;
445
- const handleError = (n2) => {
446
- if (e.Ae !== t) return;
447
- globalQueue.initTransition(resolveTransition(e));
448
- notifyStatus(e, n2 instanceof NotReadyError ? STATUS_PENDING : STATUS_ERROR, n2);
449
- e.Ee = clock;
450
- };
451
- const asyncWrite = (i2, r2) => {
452
- if (e.Ae !== t) return;
453
- if (e.O & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY)) return;
454
- globalQueue.initTransition(resolveTransition(e));
455
- clearStatus(e);
456
- const s2 = resolveLane(e);
457
- if (s2) s2.k.delete(e);
458
- if (e.ee !== void 0) {
459
- if (e.ee !== void 0 && e.ee !== NOT_PENDING) e.X = i2;
460
- else {
461
- e.J = i2;
462
- insertSubs(e);
463
- }
464
- e.Ee = clock;
465
- } else if (s2) {
466
- const t2 = e.J;
467
- const n2 = e.Ne;
468
- if (!n2 || !n2(i2, t2)) {
469
- e.J = i2;
470
- e.Ee = clock;
471
- if (e.Pe) {
472
- setSignal(e.Pe, i2);
473
- }
474
- insertSubs(e, true);
475
- }
476
- } else {
477
- setSignal(e, () => i2);
478
- }
479
- settlePendingSource(e);
480
- schedule();
481
- flush();
482
- r2?.();
483
- };
484
- if (s) {
485
- let n2 = false, i2 = true;
486
- t.then(
487
- (e2) => {
488
- if (i2) {
489
- o = e2;
490
- n2 = true;
491
- } else asyncWrite(e2);
492
- },
493
- (e2) => {
494
- if (!i2) handleError(e2);
495
- }
496
- );
497
- i2 = false;
498
- if (!n2) {
499
- globalQueue.initTransition(resolveTransition(e));
500
- throw new NotReadyError(context);
501
- }
502
- }
503
- if (r) {
504
- const n2 = t[Symbol.asyncIterator]();
505
- let i2 = false;
506
- const iterate = () => {
507
- let e2, t2 = false, r3 = true;
508
- n2.next().then(
509
- (n3) => {
510
- if (r3) {
511
- e2 = n3;
512
- t2 = true;
513
- } else if (!n3.done) asyncWrite(n3.value, iterate);
514
- else {
515
- schedule();
516
- flush();
517
- }
518
- },
519
- (e3) => {
520
- if (!r3) handleError(e3);
521
- }
522
- );
523
- r3 = false;
524
- if (t2 && !e2.done) {
525
- o = e2.value;
526
- i2 = true;
527
- return iterate();
528
- }
529
- return t2 && e2.done;
530
- };
531
- const r2 = iterate();
532
- if (!i2 && !r2) {
533
- globalQueue.initTransition(resolveTransition(e));
534
- throw new NotReadyError(context);
535
- }
536
- }
537
- return o;
538
- }
539
- function clearStatus(e, t = false) {
540
- clearPendingSources(e);
541
- e.he = false;
542
- e.Se = t ? 0 : e.Se & STATUS_UNINITIALIZED;
543
- setPendingError(e);
544
- updatePendingSignal(e);
545
- e.ge?.();
546
- }
547
- function notifyStatus(e, t, n, i, r) {
548
- if (t === STATUS_ERROR && !(n instanceof StatusError) && !(n instanceof NotReadyError))
549
- n = new StatusError(e, n);
550
- const s = t === STATUS_PENDING && n instanceof NotReadyError ? n.source : void 0;
551
- const o = s === e;
552
- const u = t === STATUS_PENDING && e.ee !== void 0 && !o;
553
- const c = u && hasActiveOverride(e);
554
- if (!i) {
555
- if (t === STATUS_PENDING && s) {
556
- addPendingSource(e, s);
557
- e.Se = STATUS_PENDING | e.Se & STATUS_UNINITIALIZED;
558
- setPendingError(e, s, n);
559
- } else {
560
- clearPendingSources(e);
561
- e.Se = t | (t !== STATUS_ERROR ? e.Se & STATUS_UNINITIALIZED : 0);
562
- e.le = n;
563
- }
564
- updatePendingSignal(e);
565
- }
566
- if (r && !i) {
567
- assignOrMergeLane(e, r);
568
- }
569
- const a = i || c;
570
- const f = i || u ? void 0 : r;
571
- if (e.ge) {
572
- if (i && t === STATUS_PENDING) {
573
- return;
574
- }
575
- if (a) {
576
- e.ge(t, n);
577
- } else {
578
- e.ge();
579
- }
580
- return;
581
- }
582
- forEachDependent(e, (e2) => {
583
- e2.Ee = clock;
584
- if (t === STATUS_PENDING && s && e2.Ie !== s && !e2.pe?.has(s) || t !== STATUS_PENDING && (e2.le !== n || e2.Ie || e2.pe)) {
585
- if (!a && !e2.K) globalQueue.se.push(e2);
586
- notifyStatus(e2, t, n, a, f);
587
- }
588
- });
589
- }
590
- function markDisposal(e) {
591
- let t = e.Ce;
592
- while (t) {
593
- t.O |= REACTIVE_ZOMBIE;
594
- if (t.O & REACTIVE_IN_HEAP) {
595
- deleteFromHeap(t, dirtyQueue);
596
- insertIntoHeap(t, zombieQueue);
597
- }
598
- markDisposal(t);
599
- t = t.De;
600
- }
601
- }
602
- function disposeChildren(e, t = false, n) {
603
- if (e.O & REACTIVE_DISPOSED) return;
604
- if (t) e.O = REACTIVE_DISPOSED;
605
- let i = n ? e.me : e.Ce;
606
- while (i) {
607
- const e2 = i.De;
608
- if (i.C) {
609
- const e3 = i;
610
- deleteFromHeap(e3, e3.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
611
- let t2 = e3.C;
612
- do {
613
- t2 = unlinkSubs(t2);
614
- } while (t2 !== null);
615
- e3.C = null;
616
- e3.ye = null;
617
- }
618
- disposeChildren(i, true);
619
- i = e2;
620
- }
621
- if (n) {
622
- e.me = null;
623
- } else {
624
- e.Ce = null;
625
- e.ve = 0;
626
- }
627
- runDisposal(e, n);
628
- }
629
- function runDisposal(e, t) {
630
- let n = t ? e.we : e.be;
631
- if (!n) return;
632
- if (Array.isArray(n)) {
633
- for (let e2 = 0; e2 < n.length; e2++) {
634
- const t2 = n[e2];
635
- t2.call(t2);
636
- }
637
- } else {
638
- n.call(n);
639
- }
640
- t ? e.we = null : e.be = null;
641
- }
642
- function unlinkSubs(e) {
643
- const t = e.m;
644
- const n = e.D;
645
- const i = e.p;
646
- const r = e.Ue;
647
- if (i !== null) i.Ue = r;
648
- else t.ke = r;
649
- if (r !== null) r.p = i;
650
- else {
651
- t.I = i;
652
- if (i === null) {
653
- t.Ge?.();
654
- t.L && !t.xe && !(t.O & REACTIVE_ZOMBIE) && unobserved(t);
655
- }
656
- }
657
- return n;
658
- }
659
- function unobserved(e) {
660
- deleteFromHeap(e, e.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
661
- let t = e.C;
662
- while (t !== null) {
663
- t = unlinkSubs(t);
664
- }
665
- e.C = null;
666
- disposeChildren(e, true);
667
- }
668
- function recompute(e, t = false) {
669
- const n = e.W;
670
- if (!t) {
671
- if (e.K && (!n || activeTransition) && activeTransition !== e.K)
672
- globalQueue.initTransition(e.K);
673
- deleteFromHeap(e, e.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
674
- if (e.K || n === EFFECT_TRACKED) disposeChildren(e);
675
- else {
676
- markDisposal(e);
677
- e.we = e.be;
678
- e.me = e.Ce;
679
- e.be = null;
680
- e.Ce = null;
681
- e.ve = 0;
682
- }
683
- }
684
- const i = !!(e.O & REACTIVE_OPTIMISTIC_DIRTY);
685
- const r = e.ee !== void 0 && e.ee !== NOT_PENDING;
686
- const s = !!(e.Se & STATUS_PENDING);
687
- const o = context;
688
- context = e;
689
- e.ye = null;
690
- e.O = REACTIVE_RECOMPUTING_DEPS;
691
- e.Ee = clock;
692
- let u = e.X === NOT_PENDING ? e.J : e.X;
693
- let c = e.o;
694
- let a = tracking;
695
- let f = currentOptimisticLane;
696
- tracking = true;
697
- if (i) {
698
- const t2 = resolveLane(e);
699
- if (t2) currentOptimisticLane = t2;
700
- }
701
- try {
702
- u = handleAsync(e, e.L(u));
703
- clearStatus(e, t);
704
- const n2 = resolveLane(e);
705
- if (n2) {
706
- n2.k.delete(e);
707
- updatePendingSignal(n2.te);
708
- }
709
- } catch (t2) {
710
- if (t2 instanceof NotReadyError && currentOptimisticLane) {
711
- const t3 = findLane(currentOptimisticLane);
712
- if (t3.te !== e) {
713
- t3.k.add(e);
714
- e.q = t3;
715
- updatePendingSignal(t3.te);
716
- }
717
- }
718
- if (t2 instanceof NotReadyError) e.he = true;
719
- notifyStatus(
720
- e,
721
- t2 instanceof NotReadyError ? STATUS_PENDING : STATUS_ERROR,
722
- t2,
723
- void 0,
724
- t2 instanceof NotReadyError ? e.q : void 0
725
- );
726
- } finally {
727
- tracking = a;
728
- e.O = REACTIVE_NONE | (t ? e.O & REACTIVE_SNAPSHOT_STALE : 0);
729
- context = o;
730
- }
731
- if (!e.le) {
732
- const o2 = e.ye;
733
- let a2 = o2 !== null ? o2.D : e.C;
734
- if (a2 !== null) {
735
- do {
736
- a2 = unlinkSubs(a2);
737
- } while (a2 !== null);
738
- if (o2 !== null) o2.D = null;
739
- else e.C = null;
740
- }
741
- const f2 = r ? e.ee : e.X === NOT_PENDING ? e.J : e.X;
742
- const l = !e.Ne || !e.Ne(f2, u);
743
- if (l) {
744
- const o3 = r ? e.ee : void 0;
745
- if (t || n && activeTransition !== e.K || i) {
746
- e.J = u;
747
- if (r && i) {
748
- e.ee = u;
749
- e.X = u;
750
- }
751
- } else e.X = u;
752
- if (r && !i && s && !e._e) e.ee = u;
753
- if (!r || i || e.ee !== o3) insertSubs(e, i || r);
754
- } else if (r) {
755
- e.X = u;
756
- } else if (e.o != c) {
757
- for (let t2 = e.I; t2 !== null; t2 = t2.p) {
758
- insertIntoHeapHeight(t2.h, t2.h.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
759
- }
760
- }
761
- }
762
- currentOptimisticLane = f;
763
- (!t || e.Se & STATUS_PENDING) && !e.K && !(activeTransition && r) && globalQueue.se.push(e);
764
- e.K && n && activeTransition !== e.K && runInTransition(e.K, () => recompute(e));
765
- }
766
- function untrack(e, t) {
767
- if (!externalSourceConfig && !tracking && true) return e();
768
- const n = tracking;
769
- tracking = false;
770
- try {
771
- if (externalSourceConfig) return externalSourceConfig.untrack(e);
772
- return e();
773
- } finally {
774
- tracking = n;
775
- }
16
+ function create(html, bypassGuard, flag) {
17
+ const t = document.createElement("template");
18
+ t.innerHTML = html;
19
+ return flag === 2 ? t.content.firstChild.firstChild : t.content.firstChild;
776
20
  }
777
- function setSignal(e, t) {
778
- if (e.K && activeTransition !== e.K) globalQueue.initTransition(e.K);
779
- const n = e.ee !== void 0 && !projectionWriteActive;
780
- const i = e.ee !== void 0 && e.ee !== NOT_PENDING;
781
- const r = n ? i ? e.ee : e.J : e.X === NOT_PENDING ? e.J : e.X;
782
- if (typeof t === "function") t = t(r);
783
- const s = !e.Ne || !e.Ne(r, t) || !!(e.Se & STATUS_UNINITIALIZED);
784
- if (!s) {
785
- if (n && i && e.L) {
786
- insertSubs(e, true);
787
- schedule();
788
- }
789
- return t;
790
- }
791
- if (n) {
792
- const n2 = e.ee === NOT_PENDING;
793
- if (!n2) globalQueue.initTransition(resolveTransition(e));
794
- if (n2) {
795
- e.X = e.J;
796
- globalQueue.Y.push(e);
797
- }
798
- e._e = true;
799
- const i2 = getOrCreateLane(e);
800
- e.q = i2;
801
- e.ee = t;
802
- } else {
803
- if (e.X === NOT_PENDING) globalQueue.se.push(e);
804
- e.X = t;
805
- }
806
- updatePendingSignal(e);
807
- if (e.Pe) {
808
- setSignal(e.Pe, t);
809
- }
810
- e.Ee = clock;
811
- insertSubs(e, n);
812
- schedule();
813
- return t;
814
- }
815
- function computePendingState(e) {
816
- const t = e;
817
- const n = e.V;
818
- if (n && e.X !== NOT_PENDING) {
819
- return !n.Ae && !(n.Se & STATUS_PENDING);
820
- }
821
- if (e.ee !== void 0 && e.ee !== NOT_PENDING) {
822
- if (t.Se & STATUS_PENDING && !(t.Se & STATUS_UNINITIALIZED)) return true;
823
- if (e.Re) {
824
- const t2 = e.q ? findLane(e.q) : null;
825
- return !!(t2 && t2.k.size > 0);
826
- }
827
- return true;
828
- }
829
- if (e.ee !== void 0 && e.ee === NOT_PENDING && !e.Re) {
830
- return false;
831
- }
832
- if (e.X !== NOT_PENDING && !(t.Se & STATUS_UNINITIALIZED)) return true;
833
- return !!(t.Se & STATUS_PENDING && !(t.Se & STATUS_UNINITIALIZED));
834
- }
835
- function updatePendingSignal(e) {
836
- if (e.Qe) {
837
- const t = computePendingState(e);
838
- const n = e.Qe;
839
- setSignal(n, t);
840
- if (!t && n.q) {
841
- const t2 = resolveLane(e);
842
- if (t2 && t2.k.size > 0) {
843
- const e2 = findLane(n.q);
844
- if (e2 !== t2) {
845
- mergeLanes(t2, e2);
846
- }
847
- }
848
- signalLanes.delete(n);
849
- n.q = void 0;
850
- }
851
- }
852
- }
853
- function isWrappable(e) {
854
- return e != null && typeof e === "object" && !Object.isFrozen(e);
855
- }
856
- function updatePath(e, t, n = 0) {
857
- let i, r = e;
858
- if (n < t.length - 1) {
859
- i = t[n];
860
- const s2 = typeof i;
861
- const o = Array.isArray(e);
862
- if (Array.isArray(i)) {
863
- for (let r2 = 0; r2 < i.length; r2++) {
864
- t[n] = i[r2];
865
- updatePath(e, t, n);
866
- }
867
- t[n] = i;
868
- return;
869
- } else if (o && s2 === "function") {
870
- for (let r2 = 0; r2 < e.length; r2++) {
871
- if (i(e[r2], r2)) {
872
- t[n] = r2;
873
- updatePath(e, t, n);
874
- }
875
- }
876
- t[n] = i;
877
- return;
878
- } else if (o && s2 === "object") {
879
- const { from: r2 = 0, to: s3 = e.length - 1, by: o2 = 1 } = i;
880
- for (let i2 = r2; i2 <= s3; i2 += o2) {
881
- t[n] = i2;
882
- updatePath(e, t, n);
883
- }
884
- t[n] = i;
885
- return;
886
- } else if (n < t.length - 2) {
887
- updatePath(e[i], t, n + 1);
888
- return;
889
- }
890
- r = e[i];
891
- }
892
- let s = t[t.length - 1];
893
- if (typeof s === "function") {
894
- s = s(r);
895
- if (s === r) return;
896
- }
897
- if (i === void 0 && s == void 0) return;
898
- if (s === DELETE) {
899
- delete e[i];
900
- } else if (i === void 0 || isWrappable(r) && isWrappable(s) && !Array.isArray(s)) {
901
- const t2 = i !== void 0 ? e[i] : e;
902
- const n2 = Object.keys(s);
903
- for (let e2 = 0; e2 < n2.length; e2++) t2[n2[e2]] = s[n2[e2]];
904
- } else {
905
- e[i] = s;
906
- }
907
- }
908
- var NotReadyError, StatusError, REACTIVE_NONE, REACTIVE_CHECK, REACTIVE_DIRTY, REACTIVE_RECOMPUTING_DEPS, REACTIVE_IN_HEAP, REACTIVE_IN_HEAP_HEIGHT, REACTIVE_ZOMBIE, REACTIVE_DISPOSED, REACTIVE_OPTIMISTIC_DIRTY, REACTIVE_SNAPSHOT_STALE, STATUS_PENDING, STATUS_ERROR, STATUS_UNINITIALIZED, EFFECT_RENDER, EFFECT_USER, EFFECT_TRACKED, NOT_PENDING, transitions, dirtyQueue, zombieQueue, clock, activeTransition, scheduled, projectionWriteActive, stashedOptimisticReads, Queue, GlobalQueue, globalQueue, signalLanes, activeLanes, externalSourceConfig, tracking, context, currentOptimisticLane, DELETE;
909
- var init_prod = __esm({
910
- "../../node_modules/.pnpm/@solidjs+signals@0.13.6/node_modules/@solidjs/signals/dist/prod.js"() {
911
- NotReadyError = class extends Error {
912
- source;
913
- constructor(e) {
914
- super();
915
- this.source = e;
916
- }
917
- };
918
- StatusError = class extends Error {
919
- source;
920
- constructor(e, t) {
921
- super(t instanceof Error ? t.message : String(t), { cause: t });
922
- this.source = e;
923
- }
924
- };
925
- REACTIVE_NONE = 0;
926
- REACTIVE_CHECK = 1 << 0;
927
- REACTIVE_DIRTY = 1 << 1;
928
- REACTIVE_RECOMPUTING_DEPS = 1 << 2;
929
- REACTIVE_IN_HEAP = 1 << 3;
930
- REACTIVE_IN_HEAP_HEIGHT = 1 << 4;
931
- REACTIVE_ZOMBIE = 1 << 5;
932
- REACTIVE_DISPOSED = 1 << 6;
933
- REACTIVE_OPTIMISTIC_DIRTY = 1 << 7;
934
- REACTIVE_SNAPSHOT_STALE = 1 << 8;
935
- STATUS_PENDING = 1 << 0;
936
- STATUS_ERROR = 1 << 1;
937
- STATUS_UNINITIALIZED = 1 << 2;
938
- EFFECT_RENDER = 1;
939
- EFFECT_USER = 2;
940
- EFFECT_TRACKED = 3;
941
- NOT_PENDING = {};
942
- transitions = /* @__PURE__ */ new Set();
943
- dirtyQueue = { l: new Array(2e3).fill(void 0), _: false, P: 0, R: 0 };
944
- zombieQueue = { l: new Array(2e3).fill(void 0), _: false, P: 0, R: 0 };
945
- clock = 0;
946
- activeTransition = null;
947
- scheduled = false;
948
- projectionWriteActive = false;
949
- stashedOptimisticReads = null;
950
- Queue = class {
951
- i = null;
952
- ie = [[], []];
953
- re = [];
954
- created = clock;
955
- addChild(e) {
956
- this.re.push(e);
957
- e.i = this;
958
- }
959
- removeChild(e) {
960
- const t = this.re.indexOf(e);
961
- if (t >= 0) {
962
- this.re.splice(t, 1);
963
- e.i = null;
964
- }
965
- }
966
- notify(e, t, n, i) {
967
- if (this.i) return this.i.notify(e, t, n, i);
968
- return false;
969
- }
970
- run(e) {
971
- if (this.ie[e - 1].length) {
972
- const t = this.ie[e - 1];
973
- this.ie[e - 1] = [];
974
- runQueue(t, e);
975
- }
976
- for (let t = 0; t < this.re.length; t++) this.re[t].run?.(e);
977
- }
978
- enqueue(e, t) {
979
- if (e) {
980
- if (currentOptimisticLane) {
981
- const n = findLane(currentOptimisticLane);
982
- n.G[e - 1].push(t);
983
- } else {
984
- this.ie[e - 1].push(t);
985
- }
986
- }
987
- schedule();
988
- }
989
- stashQueues(e) {
990
- e.ie[0].push(...this.ie[0]);
991
- e.ie[1].push(...this.ie[1]);
992
- this.ie = [[], []];
993
- for (let t = 0; t < this.re.length; t++) {
994
- let n = this.re[t];
995
- let i = e.re[t];
996
- if (!i) {
997
- i = { ie: [[], []], re: [] };
998
- e.re[t] = i;
999
- }
1000
- n.stashQueues(i);
1001
- }
1002
- }
1003
- restoreQueues(e) {
1004
- this.ie[0].push(...e.ie[0]);
1005
- this.ie[1].push(...e.ie[1]);
1006
- for (let t = 0; t < e.re.length; t++) {
1007
- const n = e.re[t];
1008
- let i = this.re[t];
1009
- if (i) i.restoreQueues(n);
1010
- }
1011
- }
1012
- };
1013
- GlobalQueue = class _GlobalQueue extends Queue {
1014
- ne = false;
1015
- se = [];
1016
- Y = [];
1017
- Z = /* @__PURE__ */ new Set();
1018
- static oe;
1019
- static ue;
1020
- static ce = null;
1021
- flush() {
1022
- if (this.ne) return;
1023
- this.ne = true;
1024
- try {
1025
- runHeap(dirtyQueue, _GlobalQueue.oe);
1026
- if (activeTransition) {
1027
- const e = transitionComplete(activeTransition);
1028
- if (!e) {
1029
- const e2 = activeTransition;
1030
- runHeap(zombieQueue, _GlobalQueue.oe);
1031
- this.se = [];
1032
- this.Y = [];
1033
- this.Z = /* @__PURE__ */ new Set();
1034
- runLaneEffects(EFFECT_RENDER);
1035
- runLaneEffects(EFFECT_USER);
1036
- this.stashQueues(e2.ae);
1037
- clock++;
1038
- scheduled = dirtyQueue.R >= dirtyQueue.P;
1039
- reassignPendingTransition(e2.se);
1040
- activeTransition = null;
1041
- if (!e2.j.length && e2.Y.length) {
1042
- stashedOptimisticReads = /* @__PURE__ */ new Set();
1043
- for (let t2 = 0; t2 < e2.Y.length; t2++) {
1044
- const n = e2.Y[t2];
1045
- if (n.L || n.fe) continue;
1046
- stashedOptimisticReads.add(n);
1047
- queueStashedOptimisticEffects(n);
1048
- }
1049
- }
1050
- try {
1051
- finalizePureQueue(null, true);
1052
- } finally {
1053
- stashedOptimisticReads = null;
1054
- }
1055
- return;
1056
- }
1057
- this.se !== activeTransition.se && this.se.push(...activeTransition.se);
1058
- this.restoreQueues(activeTransition.ae);
1059
- transitions.delete(activeTransition);
1060
- const t = activeTransition;
1061
- activeTransition = null;
1062
- reassignPendingTransition(this.se);
1063
- finalizePureQueue(t);
1064
- } else {
1065
- if (transitions.size) runHeap(zombieQueue, _GlobalQueue.oe);
1066
- finalizePureQueue();
1067
- }
1068
- clock++;
1069
- scheduled = dirtyQueue.R >= dirtyQueue.P;
1070
- runLaneEffects(EFFECT_RENDER);
1071
- this.run(EFFECT_RENDER);
1072
- runLaneEffects(EFFECT_USER);
1073
- this.run(EFFECT_USER);
1074
- } finally {
1075
- this.ne = false;
1076
- }
1077
- }
1078
- notify(e, t, n, i) {
1079
- if (t & STATUS_PENDING) {
1080
- if (n & STATUS_PENDING) {
1081
- const t2 = i !== void 0 ? i : e.le;
1082
- if (activeTransition && t2) {
1083
- const e2 = t2.source;
1084
- if (!activeTransition.B.includes(e2)) {
1085
- activeTransition.B.push(e2);
1086
- schedule();
1087
- }
1088
- }
1089
- }
1090
- return true;
1091
- }
1092
- return false;
1093
- }
1094
- initTransition(e) {
1095
- if (e) e = currentTransition(e);
1096
- if (e && e === activeTransition) return;
1097
- if (!e && activeTransition && activeTransition.Ee === clock) return;
1098
- if (!activeTransition) {
1099
- activeTransition = e ?? {
1100
- Ee: clock,
1101
- se: [],
1102
- B: [],
1103
- Y: [],
1104
- Z: /* @__PURE__ */ new Set(),
1105
- j: [],
1106
- ae: { ie: [[], []], re: [] },
1107
- $: false
1108
- };
1109
- } else if (e) {
1110
- const t = activeTransition;
1111
- mergeTransitionState(e, t);
1112
- transitions.delete(t);
1113
- activeTransition = e;
1114
- }
1115
- transitions.add(activeTransition);
1116
- activeTransition.Ee = clock;
1117
- if (this.se !== activeTransition.se) {
1118
- for (let e2 = 0; e2 < this.se.length; e2++) {
1119
- const t = this.se[e2];
1120
- t.K = activeTransition;
1121
- activeTransition.se.push(t);
1122
- }
1123
- this.se = activeTransition.se;
1124
- }
1125
- if (this.Y !== activeTransition.Y) {
1126
- for (let e2 = 0; e2 < this.Y.length; e2++) {
1127
- const t = this.Y[e2];
1128
- t.K = activeTransition;
1129
- activeTransition.Y.push(t);
1130
- }
1131
- this.Y = activeTransition.Y;
1132
- }
1133
- for (const e2 of activeLanes) {
1134
- if (!e2.K) e2.K = activeTransition;
1135
- }
1136
- if (this.Z !== activeTransition.Z) {
1137
- for (const e2 of this.Z) activeTransition.Z.add(e2);
1138
- this.Z = activeTransition.Z;
1139
- }
1140
- }
1141
- };
1142
- globalQueue = new GlobalQueue();
1143
- signalLanes = /* @__PURE__ */ new WeakMap();
1144
- activeLanes = /* @__PURE__ */ new Set();
1145
- externalSourceConfig = null;
1146
- GlobalQueue.oe = recompute;
1147
- GlobalQueue.ue = disposeChildren;
1148
- tracking = false;
1149
- context = null;
1150
- currentOptimisticLane = null;
1151
- DELETE = /* @__PURE__ */ Symbol(0);
1152
- Object.assign(
1153
- function storePath2(...e) {
1154
- return (t) => {
1155
- updatePath(t, e);
1156
- };
1157
- },
1158
- { DELETE }
1159
- );
1160
- }
1161
- });
1162
- function template(html, isImportNode, isSVG, isMathML) {
21
+ function template(html, flag) {
1163
22
  let node;
1164
- const create = (bypassGuard) => {
1165
- const t = document.createElement("template");
1166
- t.innerHTML = html;
1167
- return t.content.firstChild;
1168
- };
1169
- const fn = isImportNode ? (bypassGuard) => solidJs.untrack(() => document.importNode(node || (node = create()), true)) : (bypassGuard) => (node || (node = create())).cloneNode(true);
23
+ const fn = flag === 1 ? (bypassGuard) => document.importNode(node || (node = create(html, bypassGuard, flag)), true) : (bypassGuard) => (node || (node = create(html, bypassGuard, flag))).cloneNode(true);
1170
24
  return fn;
1171
25
  }
1172
26
  function setAttribute(node, name, value) {
@@ -1203,9 +57,8 @@ function isHydrating(node) {
1203
57
  }
1204
58
  var effect, isServer, isDev;
1205
59
  var init_web = __esm({
1206
- "../../node_modules/.pnpm/@solidjs+web@2.0.0-beta.4_@solidjs+signals@0.13.6_solid-js@2.0.0-beta.4/node_modules/@solidjs/web/dist/web.js"() {
1207
- init_prod();
1208
- effect = (fn, effectFn, initial) => solidJs.createRenderEffect(fn, effectFn, initial, {
60
+ "../../node_modules/.pnpm/@solidjs+web@2.0.0-beta.7_@solidjs+signals@2.0.0-beta.7_solid-js@2.0.0-beta.7/node_modules/@solidjs/web/dist/web.js"() {
61
+ effect = (fn, effectFn) => solidJs.createRenderEffect(fn, effectFn, {
1209
62
  transparent: true
1210
63
  });
1211
64
  isServer = false;