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

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.
@@ -1,8 +1,8 @@
1
1
  import { createRenderEffect, untrack as untrack$1, runWithOwner, sharedConfig } from 'solid-js';
2
2
 
3
- // ../../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
3
+ // ../../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
4
4
 
5
- // ../../node_modules/.pnpm/@solidjs+signals@0.13.6/node_modules/@solidjs/signals/dist/prod.js
5
+ // ../../node_modules/.pnpm/@solidjs+signals@0.13.9/node_modules/@solidjs/signals/dist/prod.js
6
6
  var NotReadyError = class extends Error {
7
7
  source;
8
8
  constructor(e) {
@@ -564,39 +564,125 @@ function assignOrMergeLane(e, t) {
564
564
  }
565
565
  e.q = t;
566
566
  }
567
+ function unlinkSubs(e) {
568
+ const t = e.m;
569
+ const n = e.D;
570
+ const i = e.p;
571
+ const r = e.Ie;
572
+ if (i !== null) i.Ie = r;
573
+ else t.pe = r;
574
+ if (r !== null) r.p = i;
575
+ else {
576
+ t.I = i;
577
+ if (i === null) {
578
+ t.he?.();
579
+ t.L && !t.Ae && !(t.O & REACTIVE_ZOMBIE) && unobserved(t);
580
+ }
581
+ }
582
+ return n;
583
+ }
584
+ function unobserved(e) {
585
+ deleteFromHeap(e, e.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
586
+ let t = e.C;
587
+ while (t !== null) {
588
+ t = unlinkSubs(t);
589
+ }
590
+ e.C = null;
591
+ disposeChildren(e, true);
592
+ }
593
+ function markDisposal(e) {
594
+ let t = e.Pe;
595
+ while (t) {
596
+ t.O |= REACTIVE_ZOMBIE;
597
+ if (t.O & REACTIVE_IN_HEAP) {
598
+ deleteFromHeap(t, dirtyQueue);
599
+ insertIntoHeap(t, zombieQueue);
600
+ }
601
+ markDisposal(t);
602
+ t = t.ge;
603
+ }
604
+ }
605
+ function disposeChildren(e, t = false, n) {
606
+ if (e.O & REACTIVE_DISPOSED) return;
607
+ if (t) e.O = REACTIVE_DISPOSED;
608
+ if (t && e.L) e.Ce = null;
609
+ let i = n ? e.De : e.Pe;
610
+ while (i) {
611
+ const e2 = i.ge;
612
+ if (i.C) {
613
+ const e3 = i;
614
+ deleteFromHeap(e3, e3.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
615
+ let t2 = e3.C;
616
+ do {
617
+ t2 = unlinkSubs(t2);
618
+ } while (t2 !== null);
619
+ e3.C = null;
620
+ e3.Ne = null;
621
+ }
622
+ disposeChildren(i, true);
623
+ i = e2;
624
+ }
625
+ if (n) {
626
+ e.De = null;
627
+ } else {
628
+ e.Pe = null;
629
+ e.ye = 0;
630
+ }
631
+ runDisposal(e, n);
632
+ }
633
+ function runDisposal(e, t) {
634
+ let n = t ? e.ve : e.me;
635
+ if (!n) return;
636
+ if (Array.isArray(n)) {
637
+ for (let e2 = 0; e2 < n.length; e2++) {
638
+ const t2 = n[e2];
639
+ t2.call(t2);
640
+ }
641
+ } else {
642
+ n.call(n);
643
+ }
644
+ t ? e.ve = null : e.me = null;
645
+ }
646
+ function cleanup(e) {
647
+ if (!context) return e;
648
+ if (!context.me) context.me = e;
649
+ else if (Array.isArray(context.me)) context.me.push(e);
650
+ else context.me = [context.me, e];
651
+ return e;
652
+ }
567
653
  function addPendingSource(e, t) {
568
- if (e.Ie === t || e.pe?.has(t)) return false;
569
- if (!e.Ie) {
570
- e.Ie = t;
654
+ if (e.be === t || e.Le?.has(t)) return false;
655
+ if (!e.be) {
656
+ e.be = t;
571
657
  return true;
572
658
  }
573
- if (!e.pe) {
574
- e.pe = /* @__PURE__ */ new Set([e.Ie, t]);
659
+ if (!e.Le) {
660
+ e.Le = /* @__PURE__ */ new Set([e.be, t]);
575
661
  } else {
576
- e.pe.add(t);
662
+ e.Le.add(t);
577
663
  }
578
- e.Ie = void 0;
664
+ e.be = void 0;
579
665
  return true;
580
666
  }
581
667
  function removePendingSource(e, t) {
582
- if (e.Ie) {
583
- if (e.Ie !== t) return false;
584
- e.Ie = void 0;
668
+ if (e.be) {
669
+ if (e.be !== t) return false;
670
+ e.be = void 0;
585
671
  return true;
586
672
  }
587
- if (!e.pe?.delete(t)) return false;
588
- if (e.pe.size === 1) {
589
- e.Ie = e.pe.values().next().value;
590
- e.pe = void 0;
591
- } else if (e.pe.size === 0) {
592
- e.pe = void 0;
673
+ if (!e.Le?.delete(t)) return false;
674
+ if (e.Le.size === 1) {
675
+ e.be = e.Le.values().next().value;
676
+ e.Le = void 0;
677
+ } else if (e.Le.size === 0) {
678
+ e.Le = void 0;
593
679
  }
594
680
  return true;
595
681
  }
596
682
  function clearPendingSources(e) {
597
- e.Ie = void 0;
598
- e.pe?.clear();
599
- e.pe = void 0;
683
+ e.be = void 0;
684
+ e.Le?.clear();
685
+ e.Le = void 0;
600
686
  }
601
687
  function setPendingError(e, t, n) {
602
688
  if (!t) {
@@ -625,7 +711,7 @@ function settlePendingSource(e) {
625
711
  if (n.has(i) || !removePendingSource(i, e)) return;
626
712
  n.add(i);
627
713
  i.Ee = clock;
628
- const r = i.Ie ?? i.pe?.values().next().value;
714
+ const r = i.be ?? i.Le?.values().next().value;
629
715
  if (r) {
630
716
  setPendingError(i, r);
631
717
  updatePendingSignal(i);
@@ -633,7 +719,7 @@ function settlePendingSource(e) {
633
719
  i.Se &= ~STATUS_PENDING;
634
720
  setPendingError(i);
635
721
  updatePendingSignal(i);
636
- if (i.he) {
722
+ if (i.Ue) {
637
723
  if (i.W === EFFECT_TRACKED) {
638
724
  const e2 = i;
639
725
  if (!e2.H) {
@@ -647,7 +733,7 @@ function settlePendingSource(e) {
647
733
  }
648
734
  t = true;
649
735
  }
650
- i.he = false;
736
+ i.Ue = false;
651
737
  }
652
738
  forEachDependent(i, settle);
653
739
  };
@@ -659,19 +745,19 @@ function handleAsync(e, t, n) {
659
745
  const r = i && untrack(() => t[Symbol.asyncIterator]);
660
746
  const s = !r && i && untrack(() => typeof t.then === "function");
661
747
  if (!s && !r) {
662
- e.Ae = null;
748
+ e.Ce = null;
663
749
  return t;
664
750
  }
665
- e.Ae = t;
751
+ e.Ce = t;
666
752
  let o;
667
753
  const handleError = (n2) => {
668
- if (e.Ae !== t) return;
754
+ if (e.Ce !== t) return;
669
755
  globalQueue.initTransition(resolveTransition(e));
670
756
  notifyStatus(e, n2 instanceof NotReadyError ? STATUS_PENDING : STATUS_ERROR, n2);
671
757
  e.Ee = clock;
672
758
  };
673
759
  const asyncWrite = (i2, r2) => {
674
- if (e.Ae !== t) return;
760
+ if (e.Ce !== t) return;
675
761
  if (e.O & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY)) return;
676
762
  globalQueue.initTransition(resolveTransition(e));
677
763
  clearStatus(e);
@@ -686,12 +772,12 @@ function handleAsync(e, t, n) {
686
772
  e.Ee = clock;
687
773
  } else if (s2) {
688
774
  const t2 = e.J;
689
- const n2 = e.Ne;
775
+ const n2 = e.ke;
690
776
  if (!n2 || !n2(i2, t2)) {
691
777
  e.J = i2;
692
778
  e.Ee = clock;
693
- if (e.Pe) {
694
- setSignal(e.Pe, i2);
779
+ if (e.Ge) {
780
+ setSignal(e.Ge, i2);
695
781
  }
696
782
  insertSubs(e, true);
697
783
  }
@@ -725,33 +811,53 @@ function handleAsync(e, t, n) {
725
811
  if (r) {
726
812
  const n2 = t[Symbol.asyncIterator]();
727
813
  let i2 = false;
814
+ let r2 = false;
815
+ cleanup(() => {
816
+ if (r2) return;
817
+ r2 = true;
818
+ try {
819
+ const e2 = n2.return?.();
820
+ if (e2 && typeof e2.then === "function") {
821
+ e2.then(void 0, () => {
822
+ });
823
+ }
824
+ } catch {
825
+ }
826
+ });
728
827
  const iterate = () => {
729
- let e2, t2 = false, r3 = true;
828
+ let s3, u = false, c = true;
730
829
  n2.next().then(
731
830
  (n3) => {
732
- if (r3) {
733
- e2 = n3;
734
- t2 = true;
831
+ if (c) {
832
+ s3 = n3;
833
+ u = true;
834
+ if (n3.done) r2 = true;
835
+ } else if (e.Ce !== t) {
836
+ return;
735
837
  } else if (!n3.done) asyncWrite(n3.value, iterate);
736
838
  else {
839
+ r2 = true;
737
840
  schedule();
738
841
  flush();
739
842
  }
740
843
  },
741
- (e3) => {
742
- if (!r3) handleError(e3);
844
+ (n3) => {
845
+ if (!c && e.Ce === t) {
846
+ r2 = true;
847
+ handleError(n3);
848
+ }
743
849
  }
744
850
  );
745
- r3 = false;
746
- if (t2 && !e2.done) {
747
- o = e2.value;
851
+ c = false;
852
+ if (u && !s3.done) {
853
+ o = s3.value;
748
854
  i2 = true;
749
855
  return iterate();
750
856
  }
751
- return t2 && e2.done;
857
+ return u && s3.done;
752
858
  };
753
- const r2 = iterate();
754
- if (!i2 && !r2) {
859
+ const s2 = iterate();
860
+ if (!i2 && !s2) {
755
861
  globalQueue.initTransition(resolveTransition(e));
756
862
  throw new NotReadyError(context);
757
863
  }
@@ -760,11 +866,11 @@ function handleAsync(e, t, n) {
760
866
  }
761
867
  function clearStatus(e, t = false) {
762
868
  clearPendingSources(e);
763
- e.he = false;
869
+ e.Ue = false;
764
870
  e.Se = t ? 0 : e.Se & STATUS_UNINITIALIZED;
765
871
  setPendingError(e);
766
872
  updatePendingSignal(e);
767
- e.ge?.();
873
+ e.xe?.();
768
874
  }
769
875
  function notifyStatus(e, t, n, i, r) {
770
876
  if (t === STATUS_ERROR && !(n instanceof StatusError) && !(n instanceof NotReadyError))
@@ -790,104 +896,26 @@ function notifyStatus(e, t, n, i, r) {
790
896
  }
791
897
  const a = i || c;
792
898
  const f = i || u ? void 0 : r;
793
- if (e.ge) {
899
+ if (e.xe) {
794
900
  if (i && t === STATUS_PENDING) {
795
901
  return;
796
902
  }
797
903
  if (a) {
798
- e.ge(t, n);
904
+ e.xe(t, n);
799
905
  } else {
800
- e.ge();
906
+ e.xe();
801
907
  }
802
908
  return;
803
909
  }
804
910
  forEachDependent(e, (e2) => {
805
911
  e2.Ee = clock;
806
- if (t === STATUS_PENDING && s && e2.Ie !== s && !e2.pe?.has(s) || t !== STATUS_PENDING && (e2.le !== n || e2.Ie || e2.pe)) {
912
+ if (t === STATUS_PENDING && s && e2.be !== s && !e2.Le?.has(s) || t !== STATUS_PENDING && (e2.le !== n || e2.be || e2.Le)) {
807
913
  if (!a && !e2.K) globalQueue.se.push(e2);
808
914
  notifyStatus(e2, t, n, a, f);
809
915
  }
810
916
  });
811
917
  }
812
918
  var externalSourceConfig = null;
813
- function markDisposal(e) {
814
- let t = e.Ce;
815
- while (t) {
816
- t.O |= REACTIVE_ZOMBIE;
817
- if (t.O & REACTIVE_IN_HEAP) {
818
- deleteFromHeap(t, dirtyQueue);
819
- insertIntoHeap(t, zombieQueue);
820
- }
821
- markDisposal(t);
822
- t = t.De;
823
- }
824
- }
825
- function disposeChildren(e, t = false, n) {
826
- if (e.O & REACTIVE_DISPOSED) return;
827
- if (t) e.O = REACTIVE_DISPOSED;
828
- let i = n ? e.me : e.Ce;
829
- while (i) {
830
- const e2 = i.De;
831
- if (i.C) {
832
- const e3 = i;
833
- deleteFromHeap(e3, e3.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
834
- let t2 = e3.C;
835
- do {
836
- t2 = unlinkSubs(t2);
837
- } while (t2 !== null);
838
- e3.C = null;
839
- e3.ye = null;
840
- }
841
- disposeChildren(i, true);
842
- i = e2;
843
- }
844
- if (n) {
845
- e.me = null;
846
- } else {
847
- e.Ce = null;
848
- e.ve = 0;
849
- }
850
- runDisposal(e, n);
851
- }
852
- function runDisposal(e, t) {
853
- let n = t ? e.we : e.be;
854
- if (!n) return;
855
- if (Array.isArray(n)) {
856
- for (let e2 = 0; e2 < n.length; e2++) {
857
- const t2 = n[e2];
858
- t2.call(t2);
859
- }
860
- } else {
861
- n.call(n);
862
- }
863
- t ? e.we = null : e.be = null;
864
- }
865
- function unlinkSubs(e) {
866
- const t = e.m;
867
- const n = e.D;
868
- const i = e.p;
869
- const r = e.Ue;
870
- if (i !== null) i.Ue = r;
871
- else t.ke = r;
872
- if (r !== null) r.p = i;
873
- else {
874
- t.I = i;
875
- if (i === null) {
876
- t.Ge?.();
877
- t.L && !t.xe && !(t.O & REACTIVE_ZOMBIE) && unobserved(t);
878
- }
879
- }
880
- return n;
881
- }
882
- function unobserved(e) {
883
- deleteFromHeap(e, e.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
884
- let t = e.C;
885
- while (t !== null) {
886
- t = unlinkSubs(t);
887
- }
888
- e.C = null;
889
- disposeChildren(e, true);
890
- }
891
919
  GlobalQueue.oe = recompute;
892
920
  GlobalQueue.ue = disposeChildren;
893
921
  var tracking = false;
@@ -899,14 +927,15 @@ function recompute(e, t = false) {
899
927
  if (e.K && (!n || activeTransition) && activeTransition !== e.K)
900
928
  globalQueue.initTransition(e.K);
901
929
  deleteFromHeap(e, e.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
930
+ e.Ce = null;
902
931
  if (e.K || n === EFFECT_TRACKED) disposeChildren(e);
903
932
  else {
904
933
  markDisposal(e);
905
- e.we = e.be;
906
- e.me = e.Ce;
907
- e.be = null;
908
- e.Ce = null;
909
- e.ve = 0;
934
+ e.ve = e.me;
935
+ e.De = e.Pe;
936
+ e.me = null;
937
+ e.Pe = null;
938
+ e.ye = 0;
910
939
  }
911
940
  }
912
941
  const i = !!(e.O & REACTIVE_OPTIMISTIC_DIRTY);
@@ -914,7 +943,7 @@ function recompute(e, t = false) {
914
943
  const s = !!(e.Se & STATUS_PENDING);
915
944
  const o = context;
916
945
  context = e;
917
- e.ye = null;
946
+ e.Ne = null;
918
947
  e.O = REACTIVE_RECOMPUTING_DEPS;
919
948
  e.Ee = clock;
920
949
  let u = e.X === NOT_PENDING ? e.J : e.X;
@@ -943,7 +972,7 @@ function recompute(e, t = false) {
943
972
  updatePendingSignal(t3.te);
944
973
  }
945
974
  }
946
- if (t2 instanceof NotReadyError) e.he = true;
975
+ if (t2 instanceof NotReadyError) e.Ue = true;
947
976
  notifyStatus(
948
977
  e,
949
978
  t2 instanceof NotReadyError ? STATUS_PENDING : STATUS_ERROR,
@@ -957,7 +986,7 @@ function recompute(e, t = false) {
957
986
  context = o;
958
987
  }
959
988
  if (!e.le) {
960
- const o2 = e.ye;
989
+ const o2 = e.Ne;
961
990
  let a2 = o2 !== null ? o2.D : e.C;
962
991
  if (a2 !== null) {
963
992
  do {
@@ -967,7 +996,7 @@ function recompute(e, t = false) {
967
996
  else e.C = null;
968
997
  }
969
998
  const f2 = r ? e.ee : e.X === NOT_PENDING ? e.J : e.X;
970
- const l = !e.Ne || !e.Ne(f2, u);
999
+ const l = !e.ke || !e.ke(f2, u);
971
1000
  if (l) {
972
1001
  const o3 = r ? e.ee : void 0;
973
1002
  if (t || n && activeTransition !== e.K || i) {
@@ -1008,7 +1037,7 @@ function setSignal(e, t) {
1008
1037
  const i = e.ee !== void 0 && e.ee !== NOT_PENDING;
1009
1038
  const r = n ? i ? e.ee : e.J : e.X === NOT_PENDING ? e.J : e.X;
1010
1039
  if (typeof t === "function") t = t(r);
1011
- const s = !e.Ne || !e.Ne(r, t) || !!(e.Se & STATUS_UNINITIALIZED);
1040
+ const s = !e.ke || !e.ke(r, t) || !!(e.Se & STATUS_UNINITIALIZED);
1012
1041
  if (!s) {
1013
1042
  if (n && i && e.L) {
1014
1043
  insertSubs(e, true);
@@ -1032,8 +1061,8 @@ function setSignal(e, t) {
1032
1061
  e.X = t;
1033
1062
  }
1034
1063
  updatePendingSignal(e);
1035
- if (e.Pe) {
1036
- setSignal(e.Pe, t);
1064
+ if (e.Ge) {
1065
+ setSignal(e.Ge, t);
1037
1066
  }
1038
1067
  e.Ee = clock;
1039
1068
  insertSubs(e, n);
@@ -1044,7 +1073,7 @@ function computePendingState(e) {
1044
1073
  const t = e;
1045
1074
  const n = e.V;
1046
1075
  if (n && e.X !== NOT_PENDING) {
1047
- return !n.Ae && !(n.Se & STATUS_PENDING);
1076
+ return !n.Ce && !(n.Se & STATUS_PENDING);
1048
1077
  }
1049
1078
  if (e.ee !== void 0 && e.ee !== NOT_PENDING) {
1050
1079
  if (t.Se & STATUS_PENDING && !(t.Se & STATUS_UNINITIALIZED)) return true;
@@ -1079,7 +1108,7 @@ function updatePendingSignal(e) {
1079
1108
  }
1080
1109
  }
1081
1110
  function isWrappable(e) {
1082
- return e != null && typeof e === "object" && !Object.isFrozen(e);
1111
+ return e != null && typeof e === "object" && !Object.isFrozen(e) && !(typeof Node !== "undefined" && e instanceof Node);
1083
1112
  }
1084
1113
  var DELETE = /* @__PURE__ */ Symbol(0);
1085
1114
  function updatePath(e, t, n = 0) {
@@ -1143,7 +1172,7 @@ Object.assign(
1143
1172
  { DELETE }
1144
1173
  );
1145
1174
 
1146
- // ../../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
1175
+ // ../../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
1147
1176
  var effect = (fn, effectFn, initial) => createRenderEffect(fn, effectFn, initial, {
1148
1177
  transparent: true
1149
1178
  });