@tanstack/solid-query-devtools 6.0.0-beta.3 → 6.0.0-beta.5

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,1189 +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.9/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 unlinkSubs(e) {
346
- const t = e.m;
347
- const n = e.D;
348
- const i = e.p;
349
- const r = e.Ie;
350
- if (i !== null) i.Ie = r;
351
- else t.pe = r;
352
- if (r !== null) r.p = i;
353
- else {
354
- t.I = i;
355
- if (i === null) {
356
- t.he?.();
357
- t.L && !t.Ae && !(t.O & REACTIVE_ZOMBIE) && unobserved(t);
358
- }
359
- }
360
- return n;
361
- }
362
- function unobserved(e) {
363
- deleteFromHeap(e, e.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
364
- let t = e.C;
365
- while (t !== null) {
366
- t = unlinkSubs(t);
367
- }
368
- e.C = null;
369
- disposeChildren(e, true);
370
- }
371
- function markDisposal(e) {
372
- let t = e.Pe;
373
- while (t) {
374
- t.O |= REACTIVE_ZOMBIE;
375
- if (t.O & REACTIVE_IN_HEAP) {
376
- deleteFromHeap(t, dirtyQueue);
377
- insertIntoHeap(t, zombieQueue);
378
- }
379
- markDisposal(t);
380
- t = t.ge;
381
- }
382
- }
383
- function disposeChildren(e, t = false, n) {
384
- if (e.O & REACTIVE_DISPOSED) return;
385
- if (t) e.O = REACTIVE_DISPOSED;
386
- if (t && e.L) e.Ce = null;
387
- let i = n ? e.De : e.Pe;
388
- while (i) {
389
- const e2 = i.ge;
390
- if (i.C) {
391
- const e3 = i;
392
- deleteFromHeap(e3, e3.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
393
- let t2 = e3.C;
394
- do {
395
- t2 = unlinkSubs(t2);
396
- } while (t2 !== null);
397
- e3.C = null;
398
- e3.Ne = null;
399
- }
400
- disposeChildren(i, true);
401
- i = e2;
402
- }
403
- if (n) {
404
- e.De = null;
405
- } else {
406
- e.Pe = null;
407
- e.ye = 0;
408
- }
409
- runDisposal(e, n);
410
- }
411
- function runDisposal(e, t) {
412
- let n = t ? e.ve : e.me;
413
- if (!n) return;
414
- if (Array.isArray(n)) {
415
- for (let e2 = 0; e2 < n.length; e2++) {
416
- const t2 = n[e2];
417
- t2.call(t2);
418
- }
419
- } else {
420
- n.call(n);
421
- }
422
- t ? e.ve = null : e.me = null;
423
- }
424
- function cleanup(e) {
425
- if (!context) return e;
426
- if (!context.me) context.me = e;
427
- else if (Array.isArray(context.me)) context.me.push(e);
428
- else context.me = [context.me, e];
429
- return e;
430
- }
431
- function addPendingSource(e, t) {
432
- if (e.be === t || e.Le?.has(t)) return false;
433
- if (!e.be) {
434
- e.be = t;
435
- return true;
436
- }
437
- if (!e.Le) {
438
- e.Le = /* @__PURE__ */ new Set([e.be, t]);
439
- } else {
440
- e.Le.add(t);
441
- }
442
- e.be = void 0;
443
- return true;
444
- }
445
- function removePendingSource(e, t) {
446
- if (e.be) {
447
- if (e.be !== t) return false;
448
- e.be = void 0;
449
- return true;
450
- }
451
- if (!e.Le?.delete(t)) return false;
452
- if (e.Le.size === 1) {
453
- e.be = e.Le.values().next().value;
454
- e.Le = void 0;
455
- } else if (e.Le.size === 0) {
456
- e.Le = void 0;
457
- }
458
- return true;
459
- }
460
- function clearPendingSources(e) {
461
- e.be = void 0;
462
- e.Le?.clear();
463
- e.Le = void 0;
464
- }
465
- function setPendingError(e, t, n) {
466
- if (!t) {
467
- e.le = null;
468
- return;
469
- }
470
- if (n instanceof NotReadyError && n.source === t) {
471
- e.le = n;
472
- return;
473
- }
474
- const i = e.le;
475
- if (!(i instanceof NotReadyError) || i.source !== t) {
476
- e.le = new NotReadyError(t);
477
- }
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;
478
20
  }
479
- function forEachDependent(e, t) {
480
- for (let n = e.I; n !== null; n = n.p) t(n.h);
481
- for (let n = e.A; n !== null; n = n.N) {
482
- for (let e2 = n.I; e2 !== null; e2 = e2.p) t(e2.h);
483
- }
484
- }
485
- function settlePendingSource(e) {
486
- let t = false;
487
- const n = /* @__PURE__ */ new Set();
488
- const settle = (i) => {
489
- if (n.has(i) || !removePendingSource(i, e)) return;
490
- n.add(i);
491
- i.Ee = clock;
492
- const r = i.be ?? i.Le?.values().next().value;
493
- if (r) {
494
- setPendingError(i, r);
495
- updatePendingSignal(i);
496
- } else {
497
- i.Se &= ~STATUS_PENDING;
498
- setPendingError(i);
499
- updatePendingSignal(i);
500
- if (i.Ue) {
501
- if (i.W === EFFECT_TRACKED) {
502
- const e2 = i;
503
- if (!e2.H) {
504
- e2.H = true;
505
- e2.F.enqueue(EFFECT_USER, e2.M);
506
- }
507
- } else {
508
- const e2 = i.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
509
- if (e2.P > i.o) e2.P = i.o;
510
- insertIntoHeap(i, e2);
511
- }
512
- t = true;
513
- }
514
- i.Ue = false;
515
- }
516
- forEachDependent(i, settle);
517
- };
518
- forEachDependent(e, settle);
519
- if (t) schedule();
520
- }
521
- function handleAsync(e, t, n) {
522
- const i = typeof t === "object" && t !== null;
523
- const r = i && untrack(() => t[Symbol.asyncIterator]);
524
- const s = !r && i && untrack(() => typeof t.then === "function");
525
- if (!s && !r) {
526
- e.Ce = null;
527
- return t;
528
- }
529
- e.Ce = t;
530
- let o;
531
- const handleError = (n2) => {
532
- if (e.Ce !== t) return;
533
- globalQueue.initTransition(resolveTransition(e));
534
- notifyStatus(e, n2 instanceof NotReadyError ? STATUS_PENDING : STATUS_ERROR, n2);
535
- e.Ee = clock;
536
- };
537
- const asyncWrite = (i2, r2) => {
538
- if (e.Ce !== t) return;
539
- if (e.O & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY)) return;
540
- globalQueue.initTransition(resolveTransition(e));
541
- clearStatus(e);
542
- const s2 = resolveLane(e);
543
- if (s2) s2.k.delete(e);
544
- if (e.ee !== void 0) {
545
- if (e.ee !== void 0 && e.ee !== NOT_PENDING) e.X = i2;
546
- else {
547
- e.J = i2;
548
- insertSubs(e);
549
- }
550
- e.Ee = clock;
551
- } else if (s2) {
552
- const t2 = e.J;
553
- const n2 = e.ke;
554
- if (!n2 || !n2(i2, t2)) {
555
- e.J = i2;
556
- e.Ee = clock;
557
- if (e.Ge) {
558
- setSignal(e.Ge, i2);
559
- }
560
- insertSubs(e, true);
561
- }
562
- } else {
563
- setSignal(e, () => i2);
564
- }
565
- settlePendingSource(e);
566
- schedule();
567
- flush();
568
- r2?.();
569
- };
570
- if (s) {
571
- let n2 = false, i2 = true;
572
- t.then(
573
- (e2) => {
574
- if (i2) {
575
- o = e2;
576
- n2 = true;
577
- } else asyncWrite(e2);
578
- },
579
- (e2) => {
580
- if (!i2) handleError(e2);
581
- }
582
- );
583
- i2 = false;
584
- if (!n2) {
585
- globalQueue.initTransition(resolveTransition(e));
586
- throw new NotReadyError(context);
587
- }
588
- }
589
- if (r) {
590
- const n2 = t[Symbol.asyncIterator]();
591
- let i2 = false;
592
- let r2 = false;
593
- cleanup(() => {
594
- if (r2) return;
595
- r2 = true;
596
- try {
597
- const e2 = n2.return?.();
598
- if (e2 && typeof e2.then === "function") {
599
- e2.then(void 0, () => {
600
- });
601
- }
602
- } catch {
603
- }
604
- });
605
- const iterate = () => {
606
- let s3, u = false, c = true;
607
- n2.next().then(
608
- (n3) => {
609
- if (c) {
610
- s3 = n3;
611
- u = true;
612
- if (n3.done) r2 = true;
613
- } else if (e.Ce !== t) {
614
- return;
615
- } else if (!n3.done) asyncWrite(n3.value, iterate);
616
- else {
617
- r2 = true;
618
- schedule();
619
- flush();
620
- }
621
- },
622
- (n3) => {
623
- if (!c && e.Ce === t) {
624
- r2 = true;
625
- handleError(n3);
626
- }
627
- }
628
- );
629
- c = false;
630
- if (u && !s3.done) {
631
- o = s3.value;
632
- i2 = true;
633
- return iterate();
634
- }
635
- return u && s3.done;
636
- };
637
- const s2 = iterate();
638
- if (!i2 && !s2) {
639
- globalQueue.initTransition(resolveTransition(e));
640
- throw new NotReadyError(context);
641
- }
642
- }
643
- return o;
644
- }
645
- function clearStatus(e, t = false) {
646
- clearPendingSources(e);
647
- e.Ue = false;
648
- e.Se = t ? 0 : e.Se & STATUS_UNINITIALIZED;
649
- setPendingError(e);
650
- updatePendingSignal(e);
651
- e.xe?.();
652
- }
653
- function notifyStatus(e, t, n, i, r) {
654
- if (t === STATUS_ERROR && !(n instanceof StatusError) && !(n instanceof NotReadyError))
655
- n = new StatusError(e, n);
656
- const s = t === STATUS_PENDING && n instanceof NotReadyError ? n.source : void 0;
657
- const o = s === e;
658
- const u = t === STATUS_PENDING && e.ee !== void 0 && !o;
659
- const c = u && hasActiveOverride(e);
660
- if (!i) {
661
- if (t === STATUS_PENDING && s) {
662
- addPendingSource(e, s);
663
- e.Se = STATUS_PENDING | e.Se & STATUS_UNINITIALIZED;
664
- setPendingError(e, s, n);
665
- } else {
666
- clearPendingSources(e);
667
- e.Se = t | (t !== STATUS_ERROR ? e.Se & STATUS_UNINITIALIZED : 0);
668
- e.le = n;
669
- }
670
- updatePendingSignal(e);
671
- }
672
- if (r && !i) {
673
- assignOrMergeLane(e, r);
674
- }
675
- const a = i || c;
676
- const f = i || u ? void 0 : r;
677
- if (e.xe) {
678
- if (i && t === STATUS_PENDING) {
679
- return;
680
- }
681
- if (a) {
682
- e.xe(t, n);
683
- } else {
684
- e.xe();
685
- }
686
- return;
687
- }
688
- forEachDependent(e, (e2) => {
689
- e2.Ee = clock;
690
- if (t === STATUS_PENDING && s && e2.be !== s && !e2.Le?.has(s) || t !== STATUS_PENDING && (e2.le !== n || e2.be || e2.Le)) {
691
- if (!a && !e2.K) globalQueue.se.push(e2);
692
- notifyStatus(e2, t, n, a, f);
693
- }
694
- });
695
- }
696
- function recompute(e, t = false) {
697
- const n = e.W;
698
- if (!t) {
699
- if (e.K && (!n || activeTransition) && activeTransition !== e.K)
700
- globalQueue.initTransition(e.K);
701
- deleteFromHeap(e, e.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
702
- e.Ce = null;
703
- if (e.K || n === EFFECT_TRACKED) disposeChildren(e);
704
- else {
705
- markDisposal(e);
706
- e.ve = e.me;
707
- e.De = e.Pe;
708
- e.me = null;
709
- e.Pe = null;
710
- e.ye = 0;
711
- }
712
- }
713
- const i = !!(e.O & REACTIVE_OPTIMISTIC_DIRTY);
714
- const r = e.ee !== void 0 && e.ee !== NOT_PENDING;
715
- const s = !!(e.Se & STATUS_PENDING);
716
- const o = context;
717
- context = e;
718
- e.Ne = null;
719
- e.O = REACTIVE_RECOMPUTING_DEPS;
720
- e.Ee = clock;
721
- let u = e.X === NOT_PENDING ? e.J : e.X;
722
- let c = e.o;
723
- let a = tracking;
724
- let f = currentOptimisticLane;
725
- tracking = true;
726
- if (i) {
727
- const t2 = resolveLane(e);
728
- if (t2) currentOptimisticLane = t2;
729
- }
730
- try {
731
- u = handleAsync(e, e.L(u));
732
- clearStatus(e, t);
733
- const n2 = resolveLane(e);
734
- if (n2) {
735
- n2.k.delete(e);
736
- updatePendingSignal(n2.te);
737
- }
738
- } catch (t2) {
739
- if (t2 instanceof NotReadyError && currentOptimisticLane) {
740
- const t3 = findLane(currentOptimisticLane);
741
- if (t3.te !== e) {
742
- t3.k.add(e);
743
- e.q = t3;
744
- updatePendingSignal(t3.te);
745
- }
746
- }
747
- if (t2 instanceof NotReadyError) e.Ue = true;
748
- notifyStatus(
749
- e,
750
- t2 instanceof NotReadyError ? STATUS_PENDING : STATUS_ERROR,
751
- t2,
752
- void 0,
753
- t2 instanceof NotReadyError ? e.q : void 0
754
- );
755
- } finally {
756
- tracking = a;
757
- e.O = REACTIVE_NONE | (t ? e.O & REACTIVE_SNAPSHOT_STALE : 0);
758
- context = o;
759
- }
760
- if (!e.le) {
761
- const o2 = e.Ne;
762
- let a2 = o2 !== null ? o2.D : e.C;
763
- if (a2 !== null) {
764
- do {
765
- a2 = unlinkSubs(a2);
766
- } while (a2 !== null);
767
- if (o2 !== null) o2.D = null;
768
- else e.C = null;
769
- }
770
- const f2 = r ? e.ee : e.X === NOT_PENDING ? e.J : e.X;
771
- const l = !e.ke || !e.ke(f2, u);
772
- if (l) {
773
- const o3 = r ? e.ee : void 0;
774
- if (t || n && activeTransition !== e.K || i) {
775
- e.J = u;
776
- if (r && i) {
777
- e.ee = u;
778
- e.X = u;
779
- }
780
- } else e.X = u;
781
- if (r && !i && s && !e._e) e.ee = u;
782
- if (!r || i || e.ee !== o3) insertSubs(e, i || r);
783
- } else if (r) {
784
- e.X = u;
785
- } else if (e.o != c) {
786
- for (let t2 = e.I; t2 !== null; t2 = t2.p) {
787
- insertIntoHeapHeight(t2.h, t2.h.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
788
- }
789
- }
790
- }
791
- currentOptimisticLane = f;
792
- (!t || e.Se & STATUS_PENDING) && !e.K && !(activeTransition && r) && globalQueue.se.push(e);
793
- e.K && n && activeTransition !== e.K && runInTransition(e.K, () => recompute(e));
794
- }
795
- function untrack(e, t) {
796
- if (!externalSourceConfig && !tracking && true) return e();
797
- const n = tracking;
798
- tracking = false;
799
- try {
800
- if (externalSourceConfig) return externalSourceConfig.untrack(e);
801
- return e();
802
- } finally {
803
- tracking = n;
804
- }
805
- }
806
- function setSignal(e, t) {
807
- if (e.K && activeTransition !== e.K) globalQueue.initTransition(e.K);
808
- const n = e.ee !== void 0 && !projectionWriteActive;
809
- const i = e.ee !== void 0 && e.ee !== NOT_PENDING;
810
- const r = n ? i ? e.ee : e.J : e.X === NOT_PENDING ? e.J : e.X;
811
- if (typeof t === "function") t = t(r);
812
- const s = !e.ke || !e.ke(r, t) || !!(e.Se & STATUS_UNINITIALIZED);
813
- if (!s) {
814
- if (n && i && e.L) {
815
- insertSubs(e, true);
816
- schedule();
817
- }
818
- return t;
819
- }
820
- if (n) {
821
- const n2 = e.ee === NOT_PENDING;
822
- if (!n2) globalQueue.initTransition(resolveTransition(e));
823
- if (n2) {
824
- e.X = e.J;
825
- globalQueue.Y.push(e);
826
- }
827
- e._e = true;
828
- const i2 = getOrCreateLane(e);
829
- e.q = i2;
830
- e.ee = t;
831
- } else {
832
- if (e.X === NOT_PENDING) globalQueue.se.push(e);
833
- e.X = t;
834
- }
835
- updatePendingSignal(e);
836
- if (e.Ge) {
837
- setSignal(e.Ge, t);
838
- }
839
- e.Ee = clock;
840
- insertSubs(e, n);
841
- schedule();
842
- return t;
843
- }
844
- function computePendingState(e) {
845
- const t = e;
846
- const n = e.V;
847
- if (n && e.X !== NOT_PENDING) {
848
- return !n.Ce && !(n.Se & STATUS_PENDING);
849
- }
850
- if (e.ee !== void 0 && e.ee !== NOT_PENDING) {
851
- if (t.Se & STATUS_PENDING && !(t.Se & STATUS_UNINITIALIZED)) return true;
852
- if (e.Re) {
853
- const t2 = e.q ? findLane(e.q) : null;
854
- return !!(t2 && t2.k.size > 0);
855
- }
856
- return true;
857
- }
858
- if (e.ee !== void 0 && e.ee === NOT_PENDING && !e.Re) {
859
- return false;
860
- }
861
- if (e.X !== NOT_PENDING && !(t.Se & STATUS_UNINITIALIZED)) return true;
862
- return !!(t.Se & STATUS_PENDING && !(t.Se & STATUS_UNINITIALIZED));
863
- }
864
- function updatePendingSignal(e) {
865
- if (e.Qe) {
866
- const t = computePendingState(e);
867
- const n = e.Qe;
868
- setSignal(n, t);
869
- if (!t && n.q) {
870
- const t2 = resolveLane(e);
871
- if (t2 && t2.k.size > 0) {
872
- const e2 = findLane(n.q);
873
- if (e2 !== t2) {
874
- mergeLanes(t2, e2);
875
- }
876
- }
877
- signalLanes.delete(n);
878
- n.q = void 0;
879
- }
880
- }
881
- }
882
- function isWrappable(e) {
883
- return e != null && typeof e === "object" && !Object.isFrozen(e) && !(typeof Node !== "undefined" && e instanceof Node);
884
- }
885
- function updatePath(e, t, n = 0) {
886
- let i, r = e;
887
- if (n < t.length - 1) {
888
- i = t[n];
889
- const s2 = typeof i;
890
- const o = Array.isArray(e);
891
- if (Array.isArray(i)) {
892
- for (let r2 = 0; r2 < i.length; r2++) {
893
- t[n] = i[r2];
894
- updatePath(e, t, n);
895
- }
896
- t[n] = i;
897
- return;
898
- } else if (o && s2 === "function") {
899
- for (let r2 = 0; r2 < e.length; r2++) {
900
- if (i(e[r2], r2)) {
901
- t[n] = r2;
902
- updatePath(e, t, n);
903
- }
904
- }
905
- t[n] = i;
906
- return;
907
- } else if (o && s2 === "object") {
908
- const { from: r2 = 0, to: s3 = e.length - 1, by: o2 = 1 } = i;
909
- for (let i2 = r2; i2 <= s3; i2 += o2) {
910
- t[n] = i2;
911
- updatePath(e, t, n);
912
- }
913
- t[n] = i;
914
- return;
915
- } else if (n < t.length - 2) {
916
- updatePath(e[i], t, n + 1);
917
- return;
918
- }
919
- r = e[i];
920
- }
921
- let s = t[t.length - 1];
922
- if (typeof s === "function") {
923
- s = s(r);
924
- if (s === r) return;
925
- }
926
- if (i === void 0 && s == void 0) return;
927
- if (s === DELETE) {
928
- delete e[i];
929
- } else if (i === void 0 || isWrappable(r) && isWrappable(s) && !Array.isArray(s)) {
930
- const t2 = i !== void 0 ? e[i] : e;
931
- const n2 = Object.keys(s);
932
- for (let e2 = 0; e2 < n2.length; e2++) t2[n2[e2]] = s[n2[e2]];
933
- } else {
934
- e[i] = s;
935
- }
936
- }
937
- 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;
938
- var init_prod = __esm({
939
- "../../node_modules/.pnpm/@solidjs+signals@0.13.9/node_modules/@solidjs/signals/dist/prod.js"() {
940
- NotReadyError = class extends Error {
941
- source;
942
- constructor(e) {
943
- super();
944
- this.source = e;
945
- }
946
- };
947
- StatusError = class extends Error {
948
- source;
949
- constructor(e, t) {
950
- super(t instanceof Error ? t.message : String(t), { cause: t });
951
- this.source = e;
952
- }
953
- };
954
- REACTIVE_NONE = 0;
955
- REACTIVE_CHECK = 1 << 0;
956
- REACTIVE_DIRTY = 1 << 1;
957
- REACTIVE_RECOMPUTING_DEPS = 1 << 2;
958
- REACTIVE_IN_HEAP = 1 << 3;
959
- REACTIVE_IN_HEAP_HEIGHT = 1 << 4;
960
- REACTIVE_ZOMBIE = 1 << 5;
961
- REACTIVE_DISPOSED = 1 << 6;
962
- REACTIVE_OPTIMISTIC_DIRTY = 1 << 7;
963
- REACTIVE_SNAPSHOT_STALE = 1 << 8;
964
- STATUS_PENDING = 1 << 0;
965
- STATUS_ERROR = 1 << 1;
966
- STATUS_UNINITIALIZED = 1 << 2;
967
- EFFECT_RENDER = 1;
968
- EFFECT_USER = 2;
969
- EFFECT_TRACKED = 3;
970
- NOT_PENDING = {};
971
- transitions = /* @__PURE__ */ new Set();
972
- dirtyQueue = { l: new Array(2e3).fill(void 0), _: false, P: 0, R: 0 };
973
- zombieQueue = { l: new Array(2e3).fill(void 0), _: false, P: 0, R: 0 };
974
- clock = 0;
975
- activeTransition = null;
976
- scheduled = false;
977
- projectionWriteActive = false;
978
- stashedOptimisticReads = null;
979
- Queue = class {
980
- i = null;
981
- ie = [[], []];
982
- re = [];
983
- created = clock;
984
- addChild(e) {
985
- this.re.push(e);
986
- e.i = this;
987
- }
988
- removeChild(e) {
989
- const t = this.re.indexOf(e);
990
- if (t >= 0) {
991
- this.re.splice(t, 1);
992
- e.i = null;
993
- }
994
- }
995
- notify(e, t, n, i) {
996
- if (this.i) return this.i.notify(e, t, n, i);
997
- return false;
998
- }
999
- run(e) {
1000
- if (this.ie[e - 1].length) {
1001
- const t = this.ie[e - 1];
1002
- this.ie[e - 1] = [];
1003
- runQueue(t, e);
1004
- }
1005
- for (let t = 0; t < this.re.length; t++) this.re[t].run?.(e);
1006
- }
1007
- enqueue(e, t) {
1008
- if (e) {
1009
- if (currentOptimisticLane) {
1010
- const n = findLane(currentOptimisticLane);
1011
- n.G[e - 1].push(t);
1012
- } else {
1013
- this.ie[e - 1].push(t);
1014
- }
1015
- }
1016
- schedule();
1017
- }
1018
- stashQueues(e) {
1019
- e.ie[0].push(...this.ie[0]);
1020
- e.ie[1].push(...this.ie[1]);
1021
- this.ie = [[], []];
1022
- for (let t = 0; t < this.re.length; t++) {
1023
- let n = this.re[t];
1024
- let i = e.re[t];
1025
- if (!i) {
1026
- i = { ie: [[], []], re: [] };
1027
- e.re[t] = i;
1028
- }
1029
- n.stashQueues(i);
1030
- }
1031
- }
1032
- restoreQueues(e) {
1033
- this.ie[0].push(...e.ie[0]);
1034
- this.ie[1].push(...e.ie[1]);
1035
- for (let t = 0; t < e.re.length; t++) {
1036
- const n = e.re[t];
1037
- let i = this.re[t];
1038
- if (i) i.restoreQueues(n);
1039
- }
1040
- }
1041
- };
1042
- GlobalQueue = class _GlobalQueue extends Queue {
1043
- ne = false;
1044
- se = [];
1045
- Y = [];
1046
- Z = /* @__PURE__ */ new Set();
1047
- static oe;
1048
- static ue;
1049
- static ce = null;
1050
- flush() {
1051
- if (this.ne) return;
1052
- this.ne = true;
1053
- try {
1054
- runHeap(dirtyQueue, _GlobalQueue.oe);
1055
- if (activeTransition) {
1056
- const e = transitionComplete(activeTransition);
1057
- if (!e) {
1058
- const e2 = activeTransition;
1059
- runHeap(zombieQueue, _GlobalQueue.oe);
1060
- this.se = [];
1061
- this.Y = [];
1062
- this.Z = /* @__PURE__ */ new Set();
1063
- runLaneEffects(EFFECT_RENDER);
1064
- runLaneEffects(EFFECT_USER);
1065
- this.stashQueues(e2.ae);
1066
- clock++;
1067
- scheduled = dirtyQueue.R >= dirtyQueue.P;
1068
- reassignPendingTransition(e2.se);
1069
- activeTransition = null;
1070
- if (!e2.j.length && e2.Y.length) {
1071
- stashedOptimisticReads = /* @__PURE__ */ new Set();
1072
- for (let t2 = 0; t2 < e2.Y.length; t2++) {
1073
- const n = e2.Y[t2];
1074
- if (n.L || n.fe) continue;
1075
- stashedOptimisticReads.add(n);
1076
- queueStashedOptimisticEffects(n);
1077
- }
1078
- }
1079
- try {
1080
- finalizePureQueue(null, true);
1081
- } finally {
1082
- stashedOptimisticReads = null;
1083
- }
1084
- return;
1085
- }
1086
- this.se !== activeTransition.se && this.se.push(...activeTransition.se);
1087
- this.restoreQueues(activeTransition.ae);
1088
- transitions.delete(activeTransition);
1089
- const t = activeTransition;
1090
- activeTransition = null;
1091
- reassignPendingTransition(this.se);
1092
- finalizePureQueue(t);
1093
- } else {
1094
- if (transitions.size) runHeap(zombieQueue, _GlobalQueue.oe);
1095
- finalizePureQueue();
1096
- }
1097
- clock++;
1098
- scheduled = dirtyQueue.R >= dirtyQueue.P;
1099
- runLaneEffects(EFFECT_RENDER);
1100
- this.run(EFFECT_RENDER);
1101
- runLaneEffects(EFFECT_USER);
1102
- this.run(EFFECT_USER);
1103
- } finally {
1104
- this.ne = false;
1105
- }
1106
- }
1107
- notify(e, t, n, i) {
1108
- if (t & STATUS_PENDING) {
1109
- if (n & STATUS_PENDING) {
1110
- const t2 = i !== void 0 ? i : e.le;
1111
- if (activeTransition && t2) {
1112
- const e2 = t2.source;
1113
- if (!activeTransition.B.includes(e2)) {
1114
- activeTransition.B.push(e2);
1115
- schedule();
1116
- }
1117
- }
1118
- }
1119
- return true;
1120
- }
1121
- return false;
1122
- }
1123
- initTransition(e) {
1124
- if (e) e = currentTransition(e);
1125
- if (e && e === activeTransition) return;
1126
- if (!e && activeTransition && activeTransition.Ee === clock) return;
1127
- if (!activeTransition) {
1128
- activeTransition = e ?? {
1129
- Ee: clock,
1130
- se: [],
1131
- B: [],
1132
- Y: [],
1133
- Z: /* @__PURE__ */ new Set(),
1134
- j: [],
1135
- ae: { ie: [[], []], re: [] },
1136
- $: false
1137
- };
1138
- } else if (e) {
1139
- const t = activeTransition;
1140
- mergeTransitionState(e, t);
1141
- transitions.delete(t);
1142
- activeTransition = e;
1143
- }
1144
- transitions.add(activeTransition);
1145
- activeTransition.Ee = clock;
1146
- if (this.se !== activeTransition.se) {
1147
- for (let e2 = 0; e2 < this.se.length; e2++) {
1148
- const t = this.se[e2];
1149
- t.K = activeTransition;
1150
- activeTransition.se.push(t);
1151
- }
1152
- this.se = activeTransition.se;
1153
- }
1154
- if (this.Y !== activeTransition.Y) {
1155
- for (let e2 = 0; e2 < this.Y.length; e2++) {
1156
- const t = this.Y[e2];
1157
- t.K = activeTransition;
1158
- activeTransition.Y.push(t);
1159
- }
1160
- this.Y = activeTransition.Y;
1161
- }
1162
- for (const e2 of activeLanes) {
1163
- if (!e2.K) e2.K = activeTransition;
1164
- }
1165
- if (this.Z !== activeTransition.Z) {
1166
- for (const e2 of this.Z) activeTransition.Z.add(e2);
1167
- this.Z = activeTransition.Z;
1168
- }
1169
- }
1170
- };
1171
- globalQueue = new GlobalQueue();
1172
- signalLanes = /* @__PURE__ */ new WeakMap();
1173
- activeLanes = /* @__PURE__ */ new Set();
1174
- externalSourceConfig = null;
1175
- GlobalQueue.oe = recompute;
1176
- GlobalQueue.ue = disposeChildren;
1177
- tracking = false;
1178
- context = null;
1179
- currentOptimisticLane = null;
1180
- DELETE = /* @__PURE__ */ Symbol(0);
1181
- Object.assign(
1182
- function storePath2(...e) {
1183
- return (t) => {
1184
- updatePath(t, e);
1185
- };
1186
- },
1187
- { DELETE }
1188
- );
1189
- }
1190
- });
1191
- function template(html, isImportNode, isSVG, isMathML) {
21
+ function template(html, flag) {
1192
22
  let node;
1193
- const create = (bypassGuard) => {
1194
- const t = document.createElement("template");
1195
- t.innerHTML = html;
1196
- return t.content.firstChild;
1197
- };
1198
- 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);
1199
24
  return fn;
1200
25
  }
1201
26
  function setAttribute(node, name, value) {
@@ -1211,7 +36,6 @@ function style(node, value, prev) {
1211
36
  if (typeof value === "string") return nodeStyle.cssText = value;
1212
37
  typeof prev === "string" && (nodeStyle.cssText = prev = void 0);
1213
38
  prev || (prev = {});
1214
- value || (value = {});
1215
39
  let v, s;
1216
40
  for (s in value) {
1217
41
  v = value[s];
@@ -1230,13 +54,18 @@ function ref(fn, element) {
1230
54
  function isHydrating(node) {
1231
55
  return solidJs.sharedConfig.hydrating && (!node || node.isConnected);
1232
56
  }
1233
- var effect, isServer, isDev;
57
+ var transparentOptions, effect, isServer, isDev;
1234
58
  var init_web = __esm({
1235
- "../../node_modules/.pnpm/@solidjs+web@2.0.0-beta.4_@solidjs+signals@0.13.9_solid-js@2.0.0-beta.5/node_modules/@solidjs/web/dist/web.js"() {
1236
- init_prod();
1237
- effect = (fn, effectFn, initial) => solidJs.createRenderEffect(fn, effectFn, initial, {
1238
- transparent: true
1239
- });
59
+ "../../node_modules/.pnpm/@solidjs+web@2.0.0-beta.15_solid-js@2.0.0-beta.15/node_modules/@solidjs/web/dist/web.js"() {
60
+ transparentOptions = {
61
+ transparent: true,
62
+ sync: true
63
+ };
64
+ effect = (fn, effectFn, options) => solidJs.createRenderEffect(fn, effectFn, options ? {
65
+ transparent: true,
66
+ sync: true,
67
+ ...options
68
+ } : transparentOptions);
1240
69
  isServer = false;
1241
70
  isDev = false;
1242
71
  }
@@ -1287,25 +116,25 @@ function SolidQueryDevtools(props) {
1287
116
  solidJs.createEffect(() => props.theme, (theme) => {
1288
117
  devtools.setTheme(theme || "system");
1289
118
  });
1290
- let isMounted = false;
1291
- let isDisposed = false;
1292
- queueMicrotask(() => {
1293
- if (isDisposed) return;
1294
- devtools.mount(ref2);
1295
- isMounted = true;
1296
- });
1297
- solidJs.onCleanup(() => {
1298
- isDisposed = true;
1299
- if (isMounted) {
1300
- devtools.unmount();
1301
- }
119
+ let mounted = false;
120
+ let disposed = false;
121
+ solidJs.onSettled(() => {
122
+ queueMicrotask(() => {
123
+ if (disposed) return;
124
+ solidJs.runWithOwner(null, () => devtools.mount(ref2));
125
+ mounted = true;
126
+ });
127
+ return () => {
128
+ disposed = true;
129
+ if (mounted) {
130
+ devtools.unmount();
131
+ }
132
+ };
1302
133
  });
1303
- return (() => {
1304
- var _el$ = _tmpl$();
1305
- var _ref$ = ref2;
1306
- typeof _ref$ === "function" || Array.isArray(_ref$) ? ref(() => _ref$, _el$) : ref2 = _el$;
1307
- return _el$;
1308
- })();
134
+ var _el$ = _tmpl$();
135
+ var _ref$ = ref2;
136
+ typeof _ref$ === "function" || Array.isArray(_ref$) ? ref(() => _ref$, _el$) : ref2 = _el$;
137
+ return _el$;
1309
138
  }
1310
139
  var _tmpl$;
1311
140
  var init_devtools = __esm({
@@ -1359,30 +188,30 @@ function SolidQueryDevtoolsPanel(props) {
1359
188
  solidJs.createEffect(() => props.theme, (theme) => {
1360
189
  devtools.setTheme(theme || "system");
1361
190
  });
1362
- let isMounted = false;
1363
- let isDisposed = false;
1364
- queueMicrotask(() => {
1365
- if (isDisposed) return;
1366
- devtools.mount(ref2);
1367
- isMounted = true;
191
+ let mounted = false;
192
+ let disposed = false;
193
+ solidJs.onSettled(() => {
194
+ queueMicrotask(() => {
195
+ if (disposed) return;
196
+ solidJs.runWithOwner(null, () => devtools.mount(ref2));
197
+ mounted = true;
198
+ });
199
+ return () => {
200
+ disposed = true;
201
+ if (mounted) {
202
+ devtools.unmount();
203
+ }
204
+ };
1368
205
  });
1369
- solidJs.onCleanup(() => {
1370
- isDisposed = true;
1371
- if (isMounted) {
1372
- devtools.unmount();
1373
- }
206
+ var _el$ = _tmpl$2();
207
+ var _ref$ = ref2;
208
+ typeof _ref$ === "function" || Array.isArray(_ref$) ? ref(() => _ref$, _el$) : ref2 = _el$;
209
+ effect(() => ({
210
+ ...props.style
211
+ }), (_v$, _$p) => {
212
+ style(_el$, _v$, _$p);
1374
213
  });
1375
- return (() => {
1376
- var _el$ = _tmpl$2();
1377
- var _ref$ = ref2;
1378
- typeof _ref$ === "function" || Array.isArray(_ref$) ? ref(() => _ref$, _el$) : ref2 = _el$;
1379
- effect(() => ({
1380
- ...props.style
1381
- }), (_v$, _$p) => {
1382
- style(_el$, _v$, _$p);
1383
- });
1384
- return _el$;
1385
- })();
214
+ return _el$;
1386
215
  }
1387
216
  var _tmpl$2;
1388
217
  var init_devtoolsPanel = __esm({