virtua 0.53.0 → 0.53.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/lib/index.js CHANGED
@@ -16,10 +16,10 @@ var a, u = [], {min: d, max: h, abs: g, floor: $} = Math, p = (e, t, o) => d(o,
16
16
  }, z = "undefined" != typeof window, y = e => e.ownerDocument, x = e => e.defaultView, I = () => (null == a && (a = /iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0),
17
17
  a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m: i, S: c, _: f, v: a}, u = 0) => {
18
18
  let $ = !!u, p = 1, m = 0, w = 0, S = 0, _ = 0, v = 0, z = 0, y = 0, x = 0, b = null, k = [ 0, $ ? h(u - 1, 0) : -1 ], T = !1;
19
- const R = /* @__PURE__ */ new Set, O = () => S - w, E = () => O() + v + _, M = e => o(e) - v, C = e => {
19
+ const R = /* @__PURE__ */ new Set, O = () => S - w, M = () => O() + v + _, E = e => o(e) - v, C = e => {
20
20
  if (2 === x) return !0;
21
21
  if (b && 1 === x) return e < b[0];
22
- const t = O(), o = M(e), r = n(e);
22
+ const t = O(), o = E(e), r = n(e);
23
23
  return 1 !== y && 0 === x ? o + r <= t : o < t && o + r < t + m;
24
24
  }, L = e => {
25
25
  e && (I() && 0 !== y || b && 1 === x ? v += e : _ += e);
@@ -33,7 +33,7 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
33
33
  if (!T || $) return k;
34
34
  let o, n;
35
35
  if (z) [o, n] = k; else {
36
- let r = h(0, E()), s = r + m;
36
+ let r = h(0, M()), s = r + m;
37
37
  c() || (t = h(0, t), 1 !== y && (r -= t), 2 !== y && (s += t)), [o, n] = k = e(h(0, r), h(0, s)),
38
38
  b && (o = d(o, b[0]), n = h(n, b[1]));
39
39
  }
@@ -41,7 +41,7 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
41
41
  },
42
42
  T: e => t(e - w),
43
43
  R: r,
44
- u: M,
44
+ u: E,
45
45
  h: n,
46
46
  O: l,
47
47
  M: () => S,
@@ -79,7 +79,7 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
79
79
  {
80
80
  const e = o.filter(([e, t]) => !r(e, t));
81
81
  if (!e.length) break;
82
- L(f(e, C, E(), m)), c = 3, l = !0;
82
+ L(f(e, C, M(), m)), c = 3, l = !0;
83
83
  break;
84
84
  }
85
85
 
@@ -101,7 +101,7 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
101
101
 
102
102
  case 9:
103
103
  {
104
- const e = a(o, E());
104
+ const e = a(o, M());
105
105
  null != e && (L(e), c = 3);
106
106
  break;
107
107
  }
@@ -172,8 +172,8 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
172
172
  S: () => l,
173
173
  q: () => [ f.slice(), n ]
174
174
  };
175
- }, E = e => "number" == typeof e ? e : e.length, M = (e, t) => "number" == typeof e ? t : e[t], C = (e, t, o = 0) => {
176
- let n = E(e);
175
+ }, M = e => "number" == typeof e ? e : e.length, E = (e, t) => "number" == typeof e ? t : e[t], C = (e, t, o = 0) => {
176
+ let n = M(e);
177
177
  const r = "number" == typeof t, s = "auto" === t;
178
178
  let l = (r ? t : 40) + o, i = -1, c = 0, f = s, a = 0, u = 0, g = null;
179
179
  const w = [], S = [], _ = [], v = e => s || !!_[e], z = () => {
@@ -191,7 +191,7 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
191
191
  return i = e, o;
192
192
  }, I = (e, t) => {
193
193
  w[e] = t, i = d(e, i);
194
- }, b = e => w.length ? R(x, n, e) : l ? p($(e / l), 0, n - 1) : 0, k = () => d(a, n), O = () => h(n - u, k()), M = e => (w.length ? y(e) : l) - o;
194
+ }, b = e => w.length ? R(x, n, e) : l ? p($(e / l), 0, n - 1) : 0, k = () => d(a, n), O = () => h(n - u, k()), E = e => (w.length ? y(e) : l) - o;
195
195
  return {
196
196
  l: (e, t) => {
197
197
  const r = x(k()), s = x(n) - x(O()), l = e + (r ? r - o : 0);
@@ -199,10 +199,10 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
199
199
  },
200
200
  i: b,
201
201
  u: x,
202
- h: M,
202
+ h: E,
203
203
  _: (e, t, n, r) => {
204
- let s = e.reduce((e, [o, n]) => v(o) && t(o) ? e + (n - M(o)) : e, 0);
205
- for (const [t, n] of e) v(t) && (z(), c += -1 === w[t] ? n : n - M(t), I(t, n + o));
204
+ let s = e.reduce((e, [o, n]) => v(o) && t(o) ? e + (n - E(o)) : e, 0);
205
+ for (const [t, n] of e) v(t) && (z(), c += -1 === w[t] ? n : n - E(t), I(t, n + o));
206
206
  if (f && r && c > r) {
207
207
  let e = 0;
208
208
  const t = b(n + s), o = [];
@@ -575,19 +575,19 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
575
575
  return [ e => o[e], o.length ];
576
576
  }, [ e, t ]), le = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: r, shift: s, horizontal: a, keepMounted: u, cache: d, startMargin: h = 0, ssrCount: g, as: $ = "div", item: p = "div", scrollRef: w, onScroll: S, onScrollEnd: v}, z) => {
577
577
  "use no memo";
578
- const [y, x] = se(e, t), I = i(null), T = i(!!g), R = ne(S), E = ne(v), [M, C, L, A] = oe(() => {
578
+ const [y, x] = se(e, t), I = i(null), T = i(!!g), R = ne(S), M = ne(v), [E, C, L, A] = oe(() => {
579
579
  const e = !!a, t = O(x, r, d), o = k(t, g);
580
580
  return [ o, t, j(o, e), e ];
581
581
  });
582
- x !== M.O() && M.H(5, [ x, s ]), h !== M.L() && M.H(6, h);
583
- const [W, H] = l(M.k, void 0, M.k), q = M.C(), B = M.t(), P = [], Y = e => {
582
+ x !== E.O() && E.H(5, [ x, s ]), h !== E.L() && E.H(6, h);
583
+ const [W, H] = l(E.k, void 0, E.k), q = E.C(), B = E.t(), P = [], Y = e => {
584
584
  const t = y(e);
585
585
  /* @__PURE__ */
586
586
  return c(re, {
587
587
  ne: L.N,
588
588
  re: e,
589
- se: M.u(e),
590
- le: M.R(e),
589
+ se: E.u(e),
590
+ le: E.R(e),
591
591
  ie: p,
592
592
  oe: t,
593
593
  ce: A,
@@ -595,18 +595,18 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
595
595
  }, te(t, e));
596
596
  };
597
597
  if (Q(() => {
598
- T[Z] = !1, M.W(1, e => {
598
+ T[Z] = !1, E.W(1, e => {
599
599
  e ? f(H) : H();
600
- }), M.W(4, () => {
601
- R.current && R.current(M.M());
602
- }), M.W(8, () => {
603
- E.current && E.current();
600
+ }), E.W(4, () => {
601
+ R.current && R.current(E.M());
602
+ }), E.W(8, () => {
603
+ M.current && M.current();
604
604
  });
605
605
  const e = I[Z];
606
606
  return w ? _(() => {
607
607
  w.current && L.K(e, w[Z]);
608
608
  }) : L.K(e), () => {
609
- M.I(), L.I();
609
+ E.I(), L.I();
610
610
  };
611
611
  }, []), Q(() => {
612
612
  L.ee();
@@ -615,27 +615,27 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
615
615
  return C.q();
616
616
  },
617
617
  get scrollOffset() {
618
- return M.M();
618
+ return E.M();
619
619
  },
620
620
  get scrollSize() {
621
- return b(M);
621
+ return b(E);
622
622
  },
623
623
  get viewportSize() {
624
- return M.o();
624
+ return E.o();
625
625
  },
626
- findItemIndex: M.T,
627
- getItemOffset: M.u,
628
- getItemSize: M.h,
629
- scrollToIndex: (e, t) => K(L, M, e, t),
626
+ findItemIndex: E.T,
627
+ getItemOffset: E.u,
628
+ getItemSize: E.h,
629
+ scrollToIndex: (e, t) => K(L, E, e, t),
630
630
  scrollTo: e => U(L, e),
631
- scrollBy: e => F(L, M, e)
631
+ scrollBy: e => F(L, E, e)
632
632
  }), []), u) {
633
633
  const e = new Set(u);
634
- for (let [t, n] = M.l(o); t <= n; t++) e.add(t);
634
+ for (let [t, n] = E.l(o); t <= n; t++) e.add(t);
635
635
  m([ ...e ]).forEach(e => {
636
636
  e < x && P.push(Y(e));
637
637
  });
638
- } else for (let [e, t] = M.l(o); e <= t; e++) P.push(Y(e));
638
+ } else for (let [e, t] = E.l(o); e <= t; e++) P.push(Y(e));
639
639
  /* @__PURE__ */
640
640
  return c($, {
641
641
  ref: I,
@@ -682,9 +682,9 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
682
682
  return [ o, t, D(o, e), e ];
683
683
  });
684
684
  S !== x.O() && x.H(5, [ S, s ]);
685
- const [R, E] = l(x.k, void 0, x.k), M = x.C(), C = x.t(), L = [];
685
+ const [R, M] = l(x.k, void 0, x.k), E = x.C(), C = x.t(), L = [];
686
686
  Q(() => (y[Z] = !1, x.W(1, e => {
687
- e ? f(E) : E();
687
+ e ? f(M) : M();
688
688
  }), x.W(4, () => {
689
689
  v.current && v.current();
690
690
  }), x.W(8, () => {
@@ -731,7 +731,7 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
731
731
  position: "relative",
732
732
  width: T ? C : "100%",
733
733
  height: T ? "100%" : C,
734
- pointerEvents: M ? "none" : void 0
734
+ pointerEvents: E ? "none" : void 0
735
735
  },
736
736
  children: L
737
737
  });
@@ -760,7 +760,7 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
760
760
  ae: t,
761
761
  oe: n,
762
762
  Se: r,
763
- _e: M(s, t.ue),
763
+ _e: E(s, t.ue),
764
764
  ve: e,
765
765
  ne: l
766
766
  }, t.ue))
@@ -770,7 +770,7 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
770
770
  children: e.map(e => /* @__PURE__ */ c(ae, {
771
771
  ae: e,
772
772
  oe: o,
773
- Se: M(n, e.ze),
773
+ Se: E(n, e.ze),
774
774
  xe: r,
775
775
  ne: s
776
776
  }, e.ze))
@@ -791,7 +791,7 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
791
791
  return t;
792
792
  })(v), [ v ]);
793
793
  te.P(g, w), re.P(S, _);
794
- const fe = E(t), de = E(o);
794
+ const fe = M(t), de = M(o);
795
795
  fe !== K.O() && K.H(5, [ fe ]), de !== ee.O() && ee.H(5, [ de ]), K.H(9, le), ee.H(9, ie);
796
796
  const he = () => K.k() + ee.k(), [ge, $e] = l(he, void 0, he), pe = K.C() || ee.C(), me = K.u(0), we = ee.u(0), Se = K.O(), _e = ee.O(), ve = ((e, t, [o, n], [r, s], l, i = u, c = u, f) => {
797
797
  const a = e.p(), g = t.p(), $ = e.Y(), w = e.V(), S = t.Y(), _ = t.V();
@@ -817,18 +817,18 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
817
817
  y.push(e), o >= 0 && y.push(v[o]), x.push(t);
818
818
  }
819
819
  m(y), m(x);
820
- const O = q(y, a, $, o, n, w), E = q(x, g, S, r, s, _), M = O.length, C = E.length, H = /* @__PURE__ */ new Map, X = [], J = [];
820
+ const O = q(y, a, $, o, n, w), M = q(x, g, S, r, s, _), E = O.length, C = M.length, H = /* @__PURE__ */ new Map, X = [], J = [];
821
821
  for (const e of I) {
822
822
  const t = B(e, a), o = P(e, g);
823
823
  X.push(t), J.push(o);
824
- const n = E.indexOf(e.colIndex);
825
- for (let r = O.indexOf(e.rowIndex); r < M && O[r] < t; r++) {
824
+ const n = M.indexOf(e.colIndex);
825
+ for (let r = O.indexOf(e.rowIndex); r < E && O[r] < t; r++) {
826
826
  const t = O[r] * g;
827
- for (let r = n; r < C && E[r] < o; r++) H.set(t + E[r], e);
827
+ for (let r = n; r < C && M[r] < o; r++) H.set(t + M[r], e);
828
828
  }
829
829
  }
830
830
  const j = [];
831
- for (const e of E) j.push(!t.B(e) && null);
831
+ for (const e of M) j.push(!t.B(e) && null);
832
832
  const D = [], G = e.u($), U = [];
833
833
  let F = U;
834
834
  const K = L.get(e), N = /* @__PURE__ */ new Map;
@@ -845,23 +845,23 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
845
845
  }), F = t;
846
846
  } else d < 0 && (F = U);
847
847
  const p = u >= 0 && l === d, m = i || c || l === T || l >= o && l <= n, y = p ? G : null, x = l * g, I = K && K.get(l), b = I && I.ye, k = [];
848
- let R = 0, O = !e.B(l) && null, M = l + 1, L = !1;
848
+ let R = 0, O = !e.B(l) && null, E = l + 1, L = !1;
849
849
  for (let e = 0; e < C; e++) {
850
- const o = E[e], n = o < S, c = o >= _, u = n || c || o >= r && o <= s, d = H.get(x + o);
850
+ const o = M[e], n = o < S, c = o >= _, u = n || c || o >= r && o <= s, d = H.get(x + o);
851
851
  if (d ? d.rowIndex === l && d.colIndex === o : m && u) {
852
852
  const r = d ? B(d, a) : l + 1, s = d ? P(d, g) : o + 1, u = r - l, $ = s - o, m = u > 1, w = $ > 1, S = m || w;
853
853
  let _, v;
854
- M = h(M, r);
854
+ E = h(E, r);
855
855
  const y = n ? t.u(o) : null, x = c ? t.u(g) - t.u(s) : null;
856
856
  !1 !== O || m || (_ = l, O = !0), !1 !== j[e] || w || (v = o, j[e] = !0);
857
- const I = i ? "columnheader" : o === z && (n || p) ? "rowheader" : "cell", T = S ? u : void 0, E = S ? $ : void 0, C = "cell" !== I && f && f.rowIndex === l && f.colIndex === o ? f.order : void 0;
857
+ const I = i ? "columnheader" : o === z && (n || p) ? "rowheader" : "cell", T = S ? u : void 0, M = S ? $ : void 0, C = "cell" !== I && f && f.rowIndex === l && f.colIndex === o ? f.order : void 0;
858
858
  let A;
859
859
  if (b) {
860
860
  const e = b.length;
861
861
  for (;R < e && b[R].ue < o; ) R++;
862
862
  R < e && b[R].ue === o && (A = b[R]);
863
863
  }
864
- if (!A || A.de !== T || A.he !== E || A.Te !== y || A.Re !== x || A.ge !== _ || A.$e !== v || A.pe !== I || A.me !== C) {
864
+ if (!A || A.de !== T || A.he !== M || A.Te !== y || A.Re !== x || A.ge !== _ || A.$e !== v || A.pe !== I || A.me !== C) {
865
865
  let e = "1/l" + o;
866
866
  S && (e += "/l" + r + "/l" + s);
867
867
  const t = {
@@ -874,7 +874,7 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
874
874
  t.position = "sticky", t.zIndex = 2), A = {
875
875
  ue: o,
876
876
  de: T,
877
- he: E,
877
+ he: M,
878
878
  ge: _,
879
879
  $e: v,
880
880
  pe: I,
@@ -891,15 +891,15 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
891
891
  const e = I && !L && I.ye.length === k.length && I.Oe === y ? I : {
892
892
  ze: l,
893
893
  ye: k,
894
- we: V(l, M, y, "top", 3),
894
+ we: V(l, E, y, "top", 3),
895
895
  Oe: y
896
896
  };
897
897
  N.set(l, e), F.push(e);
898
898
  }
899
899
  }
900
900
  return L.set(e, N), {
901
- Ee: Y(e, O, D, m(X), "max-content", a),
902
- Me: Y(t, E, j, m(J), "minmax(max-content,auto)", g),
901
+ Me: Y(e, O, D, m(X), "max-content", a),
902
+ Ee: Y(t, M, j, m(J), "minmax(max-content,auto)", g),
903
903
  Ce: U
904
904
  };
905
905
  })(te, re, K.l(y), ee.l(y), ce, $, z, I), ze = ne(e => ((e, t, o, n, r, s = u, {rowIndex: l, colIndex: i, rowAlign: c, colAlign: f}) => {
@@ -982,8 +982,8 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
982
982
  overflowAnchor: "none",
983
983
  flex: "none",
984
984
  display: "grid",
985
- gridTemplateRows: ve.Ee,
986
- gridTemplateColumns: ve.Me,
985
+ gridTemplateRows: ve.Me,
986
+ gridTemplateColumns: ve.Ee,
987
987
  gap: x,
988
988
  marginTop: me,
989
989
  marginInlineStart: we,
@@ -999,7 +999,7 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
999
999
  }, n.ke) : /* @__PURE__ */ c(ae, {
1000
1000
  ae: n,
1001
1001
  oe: e,
1002
- Se: M(t, n.ze),
1002
+ Se: E(t, n.ze),
1003
1003
  xe: o,
1004
1004
  ne: se.N
1005
1005
  }, n.ze))
@@ -1022,9 +1022,9 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
1022
1022
  style: u,
1023
1023
  children: e
1024
1024
  });
1025
- }), $e = /*#__PURE__*/ e(({children: e, data: t, lanes: o, gap: r, itemSize: s, bufferSize: a, cache: u, onScroll: g, onScrollEnd: $, style: p, ...w}, S) => {
1025
+ }), $e = /*#__PURE__*/ e(({children: e, data: t, lanes: o, gap: r, itemSize: s, bufferSize: a, keepMounted: u, cache: g, onScroll: $, onScrollEnd: p, style: w, ...S}, _) => {
1026
1026
  "use no memo";
1027
- const _ = i(null), v = ne(g), z = ne($), [y, x, I] = oe(() => {
1027
+ const v = i(null), z = ne($), y = ne(p), [x, I, O] = oe(() => {
1028
1028
  const e = ((e, t, o = 0, n, r) => {
1029
1029
  let s = h(t, 1), l = s, i = o, c = r && r[1] || n || 40, f = -1, a = n ? void 0 : /* @__PURE__ */ new Set, u = !n;
1030
1030
  const g = r && r[0], $ = g ? T(g.slice(0, d(e, g.length)), h(0, e - g.length)) : T([], e), p = [], w = [], S = [], _ = e => {
@@ -1102,76 +1102,83 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
1102
1102
  qe: () => o,
1103
1103
  Be: e => (v(e), w[e])
1104
1104
  };
1105
- })(t.length, o, r, s, u), n = k(e);
1105
+ })(t.length, o, r, s, g), n = k(e);
1106
1106
  return [ n, e, j(n, !1) ];
1107
1107
  });
1108
- t.length !== y.O() && y.H(5, [ t.length ]), x.We(o, r), y.H(9, void 0);
1109
- const [O, E] = l(y.k, void 0, y.k), M = y.C(), C = y.t();
1110
- Q(() => (y.W(1, e => {
1108
+ t.length !== x.O() && x.H(5, [ t.length ]), I.We(o, r), x.H(9, void 0);
1109
+ const [M, E] = l(x.k, void 0, x.k), C = x.C(), L = x.t();
1110
+ Q(() => (x.W(1, e => {
1111
1111
  e ? f(E) : E();
1112
- }), y.W(4, () => {
1113
- v.current && v.current(y.M());
1114
- }), y.W(8, () => {
1115
- z.current && z.current();
1116
- }), I.K(_[Z]), () => {
1117
- y.I(), I.I();
1112
+ }), x.W(4, () => {
1113
+ z.current && z.current(x.M());
1114
+ }), x.W(8, () => {
1115
+ y.current && y.current();
1116
+ }), O.K(v[Z]), () => {
1117
+ x.I(), O.I();
1118
1118
  }), []), Q(() => {
1119
- I.ee();
1120
- }, [ O ]), n(S, () => ({
1119
+ O.ee();
1120
+ }, [ M ]), n(_, () => ({
1121
1121
  get cache() {
1122
- return x.q();
1122
+ return I.q();
1123
1123
  },
1124
1124
  get scrollOffset() {
1125
- return y.M();
1125
+ return x.M();
1126
1126
  },
1127
1127
  get scrollSize() {
1128
- return b(y);
1128
+ return b(x);
1129
1129
  },
1130
1130
  get viewportSize() {
1131
- return y.o();
1131
+ return x.o();
1132
1132
  },
1133
- getItemOffset: y.u,
1134
- getItemSize: y.h,
1135
- scrollToIndex: (e, t) => K(I, y, e, t),
1136
- scrollTo: e => U(I, e),
1137
- scrollBy: e => F(I, y, e)
1133
+ getItemOffset: x.u,
1134
+ getItemSize: x.h,
1135
+ scrollToIndex: (e, t) => K(O, x, e, t),
1136
+ scrollTo: e => U(O, e),
1137
+ scrollBy: e => F(O, x, e)
1138
1138
  }), []);
1139
- const L = [], A = x.He(), W = x.qe(), H = he(1 / A, W / A - W), [q, B] = y.l(a);
1140
- for (let o = q; o <= B; o++) {
1141
- const n = e(t[o], o), r = x.Be(o);
1142
- L.push(/* @__PURE__ */ c(ge, {
1143
- ne: I.N,
1139
+ const A = [], W = I.He(), H = I.qe(), q = he(1 / W, H / W - H), B = o => {
1140
+ const n = e(t[o], o), r = I.Be(o);
1141
+ /* @__PURE__ */
1142
+ return c(ge, {
1143
+ ne: O.N,
1144
1144
  re: o,
1145
- se: y.u(o),
1146
- Le: he(r / A, r * W / A),
1147
- Ae: H,
1148
- le: y.R(o),
1145
+ se: x.u(o),
1146
+ Le: he(r / W, r * H / W),
1147
+ Ae: q,
1148
+ le: x.R(o),
1149
1149
  oe: n
1150
- }, te(n, o)));
1151
- }
1150
+ }, te(n, o));
1151
+ };
1152
+ if (u) {
1153
+ const e = new Set(u);
1154
+ for (let [t, o] = x.l(a); t <= o; t++) e.add(t);
1155
+ m([ ...e ]).forEach(e => {
1156
+ e < t.length && A.push(B(e));
1157
+ });
1158
+ } else for (let [e, t] = x.l(a); e <= t; e++) A.push(B(e));
1152
1159
  /* @__PURE__ */
1153
1160
  return c("div", {
1154
- ...w,
1161
+ ...S,
1155
1162
  style: {
1156
1163
  display: "block",
1157
1164
  overflowY: "auto",
1158
1165
  contain: "strict",
1159
1166
  width: "100%",
1160
1167
  height: "100%",
1161
- ...p
1168
+ ...w
1162
1169
  },
1163
1170
  children: /* @__PURE__ */ c("div", {
1164
- ref: _,
1171
+ ref: v,
1165
1172
  style: {
1166
1173
  contain: "size style",
1167
1174
  overflowAnchor: "none",
1168
1175
  flex: "none",
1169
1176
  position: "relative",
1170
1177
  width: "100%",
1171
- height: C,
1172
- pointerEvents: M ? "none" : void 0
1178
+ height: L,
1179
+ pointerEvents: C ? "none" : void 0
1173
1180
  },
1174
- children: L
1181
+ children: A
1175
1182
  })
1176
1183
  });
1177
1184
  });