virtua 0.50.3 → 0.50.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/lib/index.js CHANGED
@@ -6,228 +6,232 @@ import { jsx as c } from "react/jsx-runtime";
6
6
 
7
7
  import { flushSync as f } from "react-dom";
8
8
 
9
- var {min: u, max: a, abs: d, floor: h} = Math, g = (e, t, o) => u(o, a(t, e)), p = e => [ ...e ].sort((e, t) => e - t), v = setTimeout, S = "function" == typeof queueMicrotask ? queueMicrotask : e => {
9
+ var {min: a, max: u, abs: d, floor: h} = Math, g = (e, t, o) => a(o, u(t, e)), v = e => [ ...e ].sort((e, t) => e - t), S = setTimeout, $ = "function" == typeof queueMicrotask ? queueMicrotask : e => {
10
10
  Promise.resolve().then(e);
11
11
  }, m = () => {
12
12
  let e;
13
13
  return [ new Promise(t => {
14
14
  e = t;
15
15
  }), e ];
16
- }, w = e => {
16
+ }, p = e => {
17
17
  let t;
18
18
  return () => (e && (t = e(), e = void 0), t);
19
- }, _ = (e, t, o) => {
20
- const n = o ? "unshift" : "push";
21
- for (let o = 0; o < t; o++) e[n](-1);
22
- return e;
23
- }, $ = (e, t) => {
24
- const o = e.t[t];
25
- return -1 === o ? e.o : o;
26
- }, z = (e, t, o) => {
27
- const n = -1 === e.t[t];
28
- return e.t[t] = o, e.i = u(t, e.i), n;
29
- }, b = (e, t) => {
30
- if (!e.l) return 0;
31
- if (e.i >= t) return e.u[t];
32
- e.i < 0 && (e.u[0] = 0, e.i = 0);
33
- let o = e.i, n = e.u[o];
34
- for (;o < t; ) n += $(e, o), e.u[++o] = n;
35
- return e.i = t, n;
36
- }, y = (e, t, o = 0, n = e.l - 1) => {
37
- let r = o;
38
- for (;o <= n; ) {
39
- const i = h((o + n) / 2);
40
- b(e, i) <= t ? (r = i, o = i + 1) : n = i - 1;
41
- }
42
- return g(r, 0, e.l - 1);
43
- }, x = (e, t, o) => {
44
- const n = t - e.l;
45
- return e.i = o ? -1 : u(t - 1, e.i), e.l = t, n > 0 ? (_(e.u, n), _(e.t, n, o),
46
- e.o * n) : (e.u.splice(n), (o ? e.t.splice(0, -n) : e.t.splice(n)).reduce((t, o) => t - (-1 === o ? e.o : o), 0));
47
- }, I = "undefined" != typeof window, k = e => e.documentElement, C = e => e.ownerDocument, R = e => e.defaultView, M = /*#__PURE__*/ w(() => !!/iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0), O = /*#__PURE__*/ w(() => "scrollBehavior" in k(document).style), T = e => a(e.h(), e.p()), E = (e, t = 40, o = 0, n, r = !1) => {
48
- let i = !!o, s = 1, l = 0, c = 0, f = 0, h = 0, g = 0, v = 0, S = 0, m = 0, w = null, I = [ 0, i ? a(o - 1, 0) : -1 ], k = 0, C = !1;
49
- const R = ((e, t, o) => ({
50
- o: t,
51
- t: o ? _(o.slice(0, u(e, o.length)), a(0, e - o.length)) : _([], e),
52
- l: e,
53
- i: -1,
54
- u: _([], e + 1)
55
- }))(e, n && n[1] || t, n && n[0]), O = /* @__PURE__ */ new Set, T = () => f - c, E = () => T() + g + h, H = (e, t) => ((e, t, o, n) => {
56
- if (n = u(n, e.l - 1), b(e, n) <= t) {
57
- const r = y(e, o, n);
58
- return [ y(e, t, n, r), r ];
59
- }
60
- {
61
- const r = y(e, t, void 0, n);
62
- return [ r, y(e, o, r) ];
63
- }
64
- })(R, e, t, I[0]), W = () => b(R, R.l), B = (e, t) => {
65
- const o = b(R, e) - g;
66
- return t ? W() - o - J(e) : o;
67
- }, J = e => $(R, e), L = (e, t = -1) => R.t[e] === t, X = e => {
68
- e && (M() && 0 !== S || w && 1 === m ? g += e : h += e);
19
+ }, w = "undefined" != typeof window, z = e => e.documentElement, _ = e => e.ownerDocument, b = e => e.defaultView, y = /*#__PURE__*/ p(() => !!/iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0), I = /*#__PURE__*/ p(() => "scrollBehavior" in z(document).style), x = e => u(e.t(), e.o()), k = ({i: e, l: t, u: o, h: n, v: r, S: i, t: s, $: l, m: c, p: f}, h = 0) => {
20
+ let g = !!f, v = !!h, S = 1, $ = 0, m = 0, p = 0, w = 0, z = 0, _ = 0, b = 0, I = 0, x = null, k = [ 0, v ? u(h - 1, 0) : -1 ], R = 0, C = !1;
21
+ const T = /* @__PURE__ */ new Set, M = () => p - m, O = () => M() + z + w, E = (e, t) => {
22
+ const r = o(e) - z;
23
+ return t ? s() - r - n(e) : r;
24
+ }, L = e => {
25
+ e && (y() && 0 !== b || x && 1 === I ? z += e : w += e);
69
26
  };
70
27
  return {
71
- v: () => {
72
- O.clear();
73
- },
74
- S: () => s,
75
- m: () => (e => [ e.t.slice(), e.o ])(R),
76
- _: (e = 200) => {
77
- if (!C || i) return I;
78
- let t, o;
79
- if (v) [t, o] = I; else {
80
- let n = a(0, E()), i = n + l;
81
- r || (e = a(0, e), 1 !== S && (n -= e), 2 !== S && (i += e)), [t, o] = I = H(a(0, n), a(0, i)),
82
- w && (t = u(t, w[0]), o = a(o, w[1]));
28
+ _: () => {
29
+ T.clear();
30
+ },
31
+ I: () => S,
32
+ i: (t = 200) => {
33
+ if (!C || v) return k;
34
+ let o, n;
35
+ if (_) [o, n] = k; else {
36
+ let r = u(0, O()), i = r + $;
37
+ g || (t = u(0, t), 1 !== b && (r -= t), 2 !== b && (i += t)), [o, n] = k = e(u(0, r), u(0, i)),
38
+ x && (o = a(o, x[0]), n = u(n, x[1]));
83
39
  }
84
- return [ a(t, 0), u(o, R.l - 1) ];
85
- },
86
- $: e => y(R, e - c),
87
- I: L,
88
- k: B,
89
- C: J,
90
- R: () => R.l,
91
- M: () => f,
92
- O: () => 0 !== S,
93
- p: () => l,
94
- T: () => c,
95
- h: W,
96
- H: () => (v = h, h = 0, [ v, 2 === m ]),
97
- W: (e, t) => {
40
+ return [ u(o, 0), a(n, l() - 1) ];
41
+ },
42
+ k: e => t(e - m),
43
+ R: i,
44
+ u: E,
45
+ h: n,
46
+ C: l,
47
+ T: () => p,
48
+ M: () => 0 !== b,
49
+ o: () => $,
50
+ O: () => m,
51
+ t: s,
52
+ L: () => (_ = w, w = 0, [ _, 2 === I ]),
53
+ H: (e, t) => {
98
54
  const o = [ e, t ];
99
- return O.add(o), () => {
100
- O.delete(o);
55
+ return T.add(o), () => {
56
+ T.delete(o);
101
57
  };
102
58
  },
103
- B: (e, t) => {
104
- let o, n, u = 0;
105
- switch (e) {
59
+ W: (o, l) => {
60
+ let a, u, h = 0;
61
+ switch (o) {
106
62
  case 1:
107
63
  {
108
- if (t === f && 0 === m) break;
109
- const e = v;
110
- v = 0;
111
- const o = t - f, r = d(o);
112
- e && r < d(e) + 1 || 0 !== m || (S = o < 0 ? 2 : 1), i && (i = !1), f = t, u = 4;
113
- const s = T();
114
- s >= -l && s <= W() && (u += 1, n = r > l);
64
+ if (l === p && 0 === I) break;
65
+ const e = _;
66
+ _ = 0;
67
+ const t = l - p, o = d(t);
68
+ e && o < d(e) + 1 || 0 !== I || (b = t < 0 ? 2 : 1), v && (v = !1), p = l, h = 4;
69
+ const n = M();
70
+ n >= -$ && n <= s() && (h += 1, u = o > $);
115
71
  break;
116
72
  }
117
73
 
118
74
  case 2:
119
- u = 8, 0 !== S && (o = !0, u += 1), S = 0, m = 0, w = null;
75
+ h = 8, 0 !== b && (a = !0, h += 1), b = 0, I = 0, x = null;
120
76
  break;
121
77
 
122
78
  case 3:
123
79
  {
124
- const e = t.filter(([e, t]) => !L(e, t));
80
+ const e = l.filter(([e, t]) => !i(e, t));
125
81
  if (!e.length) break;
126
- X(e.reduce((e, [t, o]) => {
127
- let n;
128
- if (2 === m) n = !0; else if (w && 1 === m) n = t < w[0]; else {
129
- const e = T(), o = B(t), r = J(t);
130
- n = 1 !== S && 0 === m ? o + r <= e : o < e && o + r < e + l;
82
+ L(e.reduce((e, [t, o]) => {
83
+ let r;
84
+ if (2 === I) r = !0; else if (x && 1 === I) r = t < x[0]; else {
85
+ const e = M(), o = E(t), i = n(t);
86
+ r = 1 !== b && 0 === I ? o + i <= e : o < e && o + i < e + $;
131
87
  }
132
- return n && (e += o - J(t)), e;
88
+ return r && (e += o - n(t)), e;
133
89
  }, 0));
134
90
  for (const [t, o] of e) {
135
- const e = J(t), n = z(R, t, o);
136
- r && (k += n ? o : o - e);
91
+ const e = n(t), i = r(t, o);
92
+ g && (R += i ? o : o - e);
137
93
  }
138
- r && l && k > l && (X(((e, t) => {
139
- let o = 0;
140
- const n = [];
141
- e.t.forEach((e, r) => {
142
- -1 !== e && (n.push(e), r < t && o++);
143
- }), e.i = -1;
144
- const r = p(n), i = r.length, s = i / 2 | 0, l = i % 2 == 0 ? (r[s - 1] + r[s]) / 2 : r[s], c = e.o;
145
- return ((e.o = l) - c) * a(t - o, 0);
146
- })(R, y(R, E()))), r = !1), u = 3, n = !0;
94
+ g && $ && R > $ && (L(f(t(O()))), g = !1), h = 3, u = !0;
147
95
  break;
148
96
  }
149
97
 
150
98
  case 4:
151
- l !== t && (l || (C = n = !0), l = t, u = 3);
99
+ $ !== l && ($ || (C = u = !0), $ = l, h = 3);
152
100
  break;
153
101
 
154
102
  case 5:
155
- t[1] ? (X(x(R, t[0], !0)), m = 2, u = 1) : (x(R, t[0]), u = 1);
103
+ l[1] ? (L(c(l[0], !0)), I = 2, h = 1) : (c(l[0]), h = 1);
156
104
  break;
157
105
 
158
106
  case 6:
159
- c = t;
107
+ m = l;
160
108
  break;
161
109
 
162
110
  case 7:
163
- m = 1;
111
+ I = 1;
164
112
  break;
165
113
 
166
114
  case 8:
167
- w = H(t, t + l), u = 1;
115
+ x = e(l, l + $), h = 1;
168
116
  }
169
- u && (s = 1 + (2147483647 & s), o && g && (h += g, g = 0), O.forEach(([e, t]) => {
170
- u & e && t(n);
117
+ h && (S = 1 + (2147483647 & S), a && z && (w += z, z = 0), T.forEach(([e, t]) => {
118
+ h & e && t(u);
171
119
  }));
172
120
  }
173
121
  };
174
- }, H = e => {
122
+ }, R = (e, t, o, n = 0, r = t - 1) => {
123
+ let i = n;
124
+ for (;n <= r; ) {
125
+ const t = h((n + r) / 2);
126
+ e(t) <= o ? (i = t, n = t + 1) : r = t - 1;
127
+ }
128
+ return g(i, 0, t - 1);
129
+ }, C = (e, t, o) => {
130
+ const n = o ? "unshift" : "push";
131
+ for (let o = 0; o < t; o++) e[n](-1);
132
+ return e;
133
+ }, T = (e, t, o) => {
134
+ let n = o && o[1] || t || 40, r = -1, i = 0;
135
+ const s = o && o[0], l = s ? C(s.slice(0, a(e, s.length)), u(0, e - s.length)) : C([], e), c = C([], e + 1), f = e => {
136
+ const t = l[e];
137
+ return -1 === t ? n : t;
138
+ }, d = t => {
139
+ if (!e) return 0;
140
+ if (r >= t) return c[t];
141
+ r < 0 && (c[0] = 0, r = 0);
142
+ let o = r, n = c[o];
143
+ for (;o < t; ) n += f(o), c[++o] = n;
144
+ return r = t, n;
145
+ };
146
+ return {
147
+ i: (t, o) => {
148
+ let n, r;
149
+ return i = a(i, e - 1), d(i) <= t ? (r = R(d, e, o, i), n = R(d, e, t, i, r)) : (n = R(d, e, t, void 0, i),
150
+ r = R(d, e, o, n)), i = n, [ n, r ];
151
+ },
152
+ l: t => R(d, e, t),
153
+ u: d,
154
+ h: f,
155
+ v: (e, t) => {
156
+ const o = -1 === l[e];
157
+ return l[e] = t, r = a(e, r), o;
158
+ },
159
+ S: (e, t = -1) => l[e] === t,
160
+ t: () => d(e),
161
+ $: () => e,
162
+ m: (t, o) => {
163
+ const i = t - e;
164
+ return r = o ? -1 : a(t - 1, r), e = t, i > 0 ? (C(c, i), C(l, i, o), n * i) : (c.splice(i),
165
+ (o ? l.splice(0, -i) : l.splice(i)).reduce((e, t) => e - (-1 === t ? n : t), 0));
166
+ },
167
+ p: t ? void 0 : e => {
168
+ let t = 0;
169
+ const o = [];
170
+ l.forEach((n, r) => {
171
+ -1 !== n && (n && o.push(n), r < e && t++);
172
+ }), r = -1;
173
+ const i = v(o), s = i.length, c = s / 2 | 0, f = s % 2 == 0 ? (i[c - 1] + i[c]) / 2 : i[c], a = n;
174
+ return ((n = f) - a) * u(e - t, 0);
175
+ },
176
+ B: () => [ l.slice(), n ]
177
+ };
178
+ }, M = e => {
175
179
  let t;
176
180
  return {
177
- J(o) {
178
- (t || (t = new (R(C(o)).ResizeObserver)(e))).observe(o);
181
+ X(o) {
182
+ (t || (t = new (b(_(o)).ResizeObserver)(e))).observe(o);
179
183
  },
180
- L(e) {
184
+ Y(e) {
181
185
  t.unobserve(e);
182
186
  },
183
- X() {
187
+ q() {
184
188
  t && t.disconnect();
185
189
  }
186
190
  };
187
- }, W = (e, t) => t ? -e : e, B = (e, t, o, n, r, i) => {
191
+ }, O = (e, t) => t ? -e : e, E = (e, t, o, n, r, i) => {
188
192
  const s = Date.now;
189
- let l = 0, c = !1, f = !1, u = !1, a = !1;
193
+ let l = 0, c = !1, f = !1, a = !1, u = !1;
190
194
  const d = (() => {
191
195
  let t;
192
196
  const o = () => {
193
197
  null != t && clearTimeout(t);
194
198
  }, n = () => {
195
- o(), t = v(() => {
199
+ o(), t = S(() => {
196
200
  t = null, (() => {
197
201
  if (c || f) return c = !1, void d();
198
- u = !1, e.B(2);
202
+ a = !1, e.W(2);
199
203
  })();
200
204
  }, 150);
201
205
  };
202
- return n.Y = o, n;
206
+ return n.A = o, n;
203
207
  })(), h = () => {
204
- l = s(), u && (a = !0), i && e.B(6, i()), e.B(1, n()), d();
208
+ l = s(), a && (u = !0), i && e.W(6, i()), e.W(1, n()), d();
205
209
  }, g = t => {
206
- if (c || !e.O() || t.ctrlKey) return;
210
+ if (c || !e.M() || t.ctrlKey) return;
207
211
  const n = s() - l;
208
212
  150 > n && 50 < n && (o ? t.deltaX : t.deltaY) && (c = !0);
209
- }, p = () => {
210
- f = !0, u = a = !1;
211
- }, S = () => {
212
- f = !1, M() && (u = !0);
213
+ }, v = () => {
214
+ f = !0, a = u = !1;
215
+ }, $ = () => {
216
+ f = !1, y() && (a = !0);
213
217
  };
214
218
  return t.addEventListener("scroll", h), t.addEventListener("wheel", g, {
215
219
  passive: !0
216
- }), t.addEventListener("touchstart", p, {
220
+ }), t.addEventListener("touchstart", v, {
217
221
  passive: !0
218
- }), t.addEventListener("touchend", S, {
222
+ }), t.addEventListener("touchend", $, {
219
223
  passive: !0
220
224
  }), {
221
- X: () => {
222
- t.removeEventListener("scroll", h), t.removeEventListener("wheel", g), t.removeEventListener("touchstart", p),
223
- t.removeEventListener("touchend", S), d.Y();
225
+ q: () => {
226
+ t.removeEventListener("scroll", h), t.removeEventListener("wheel", g), t.removeEventListener("touchstart", v),
227
+ t.removeEventListener("touchend", $), d.A();
224
228
  },
225
- A: () => {
226
- const [t, o] = e.H();
227
- t && (r(t, o, a), a = !1, o && e.p() > e.h() && e.B(1, n()));
229
+ D: () => {
230
+ const [t, o] = e.L();
231
+ t && (r(t, o, u), u = !1, o && e.o() > e.t() && e.W(1, n()));
228
232
  }
229
233
  };
230
- }, J = (e, t, o) => {
234
+ }, L = (e, t, o) => {
231
235
  let n;
232
236
  return [ async (r, i) => {
233
237
  if (!await t()) return;
@@ -236,14 +240,14 @@ var {min: u, max: a, abs: d, floor: h} = Math, g = (e, t, o) => u(o, a(t, e)), p
236
240
  const [t, o] = m();
237
241
  return n = () => {
238
242
  o(!1);
239
- }, e.p() && v(n, 150), [ t, e.W(2, () => {
243
+ }, e.o() && S(n, 150), [ t, e.H(2, () => {
240
244
  o(!0);
241
245
  }) ];
242
246
  };
243
- if (i && O()) e.B(8, r()), S(async () => {
247
+ if (i && I()) e.W(8, r()), $(async () => {
244
248
  for (;;) {
245
249
  let t = !0;
246
- for (let [o, n] = e._(); o <= n; o++) if (e.I(o)) {
250
+ for (let [o, n] = e.i(); o <= n; o++) if (e.R(o)) {
247
251
  t = !1;
248
252
  break;
249
253
  }
@@ -255,11 +259,11 @@ var {min: u, max: a, abs: d, floor: h} = Math, g = (e, t, o) => u(o, a(t, e)), p
255
259
  n();
256
260
  }
257
261
  }
258
- e.B(7), o(r(), i);
262
+ e.W(7), o(r(), i);
259
263
  }); else for (;;) {
260
264
  const [t, n] = s();
261
265
  try {
262
- if (e.B(7), o(r()), !await t) return;
266
+ if (e.W(7), o(r()), !await t) return;
263
267
  } finally {
264
268
  n();
265
269
  }
@@ -267,66 +271,66 @@ var {min: u, max: a, abs: d, floor: h} = Math, g = (e, t, o) => u(o, a(t, e)), p
267
271
  }, () => {
268
272
  n && n();
269
273
  } ];
270
- }, L = (e, t) => {
274
+ }, H = (e, t) => {
271
275
  let o, n, r = m(), i = !1;
272
- const s = t ? "scrollLeft" : "scrollTop", l = t ? "overflowX" : "overflowY", [c, f] = J(e, () => r[0], (e, n) => {
273
- e = W(e, i), n ? o.scrollTo({
276
+ const s = t ? "scrollLeft" : "scrollTop", l = t ? "overflowX" : "overflowY", [c, f] = L(e, () => r[0], (e, n) => {
277
+ e = O(e, i), n ? o.scrollTo({
274
278
  [t ? "left" : "top"]: e,
275
279
  behavior: "smooth"
276
280
  }) : o[s] = e;
277
- }), u = t ? "width" : "height", a = /* @__PURE__ */ new WeakMap, d = H(t => {
281
+ }), a = t ? "width" : "height", u = /* @__PURE__ */ new WeakMap, d = M(t => {
278
282
  const n = [];
279
- for (const {target: r, contentRect: i} of t) if (r.offsetParent) if (r === o) e.B(4, i[u]); else {
280
- const e = a.get(r);
281
- null != e && n.push([ e, i[u] ]);
283
+ for (const {target: r, contentRect: i} of t) if (r.offsetParent) if (r === o) e.W(4, i[a]); else {
284
+ const e = u.get(r);
285
+ null != e && n.push([ e, i[a] ]);
282
286
  }
283
- n.length && e.B(3, n);
287
+ n.length && e.W(3, n);
284
288
  });
285
289
  return {
286
- N(c, u = c.parentElement) {
287
- d.J(o = u), t && (i = "rtl" === getComputedStyle(u).direction), n = B(e, u, t, () => W(u[s], i), (t, o, n) => {
290
+ N(c, a = c.parentElement) {
291
+ d.X(o = a), t && (i = "rtl" === getComputedStyle(a).direction), n = E(e, a, t, () => O(a[s], i), (t, o, n) => {
288
292
  if (n) {
289
- const e = u.style, t = e[l];
290
- e[l] = "hidden", v(() => {
293
+ const e = a.style, t = e[l];
294
+ e[l] = "hidden", S(() => {
291
295
  e[l] = t;
292
296
  });
293
297
  }
294
- u[s] = W(e.M() + t, i), o && f();
298
+ a[s] = O(e.T() + t, i), o && f();
295
299
  }), r[1](!0);
296
300
  },
297
- v() {
298
- d.X(), n && n.X(), r[1](!1), r = m();
301
+ _() {
302
+ d.q(), n && n.q(), r[1](!1), r = m();
299
303
  },
300
- P: (e, t) => (a.set(e, t), d.J(e), () => {
301
- a.delete(e), d.L(e);
304
+ P: (e, t) => (u.set(e, t), d.X(e), () => {
305
+ u.delete(e), d.Y(e);
302
306
  }),
303
307
  V: () => i,
304
- q: c,
308
+ J: c,
305
309
  j() {
306
- n && n.A();
310
+ n && n.D();
307
311
  },
308
- D: e.T,
309
- G: () => 0
312
+ G: e.O,
313
+ U: () => 0
310
314
  };
311
- }, X = (e, t) => {
315
+ }, W = (e, t) => {
312
316
  let o, n, r, i = m(), s = !1;
313
- const l = t ? "left" : "top", [c] = J(e, () => i[0], (e, t) => {
314
- e = W(e, s);
315
- const n = R(C(o));
317
+ const l = t ? "left" : "top", [c] = L(e, () => i[0], (e, t) => {
318
+ e = O(e, s);
319
+ const n = b(_(o));
316
320
  t ? n.scroll({
317
321
  [l]: e,
318
322
  behavior: "smooth"
319
323
  }) : n.scroll({
320
324
  [l]: e
321
325
  });
322
- }), f = t ? "width" : "height", u = /* @__PURE__ */ new WeakMap, a = H(t => {
326
+ }), f = t ? "width" : "height", a = /* @__PURE__ */ new WeakMap, u = M(t => {
323
327
  const o = [];
324
328
  for (const {target: e, contentRect: n} of t) {
325
329
  if (!e.offsetParent) continue;
326
- const t = u.get(e);
330
+ const t = a.get(e);
327
331
  null != t && o.push([ t, n[f] ]);
328
332
  }
329
- o.length && e.B(3, o);
333
+ o.length && e.W(3, o);
330
334
  }), d = (e, t, o, n, r = 0) => {
331
335
  const i = n ? "offsetLeft" : "offsetTop", l = r + (n && s ? o.innerWidth - e[i] - e.offsetWidth : e[i]), c = e.offsetParent;
332
336
  return e !== t && c ? d(c, t, o, n, l) : l;
@@ -334,61 +338,61 @@ var {min: u, max: a, abs: d, floor: h} = Math, g = (e, t, o) => u(o, a(t, e)), p
334
338
  return {
335
339
  N(c) {
336
340
  o = c;
337
- const f = t ? "scrollX" : "scrollY", u = C(c), a = R(u), h = () => {
338
- e.B(4, a[t ? "innerWidth" : "innerHeight"]);
341
+ const f = t ? "scrollX" : "scrollY", a = _(c), u = b(a), h = () => {
342
+ e.W(4, u[t ? "innerWidth" : "innerHeight"]);
339
343
  };
340
- a.addEventListener("resize", h), S(h), r = () => {
341
- a.removeEventListener("resize", h);
342
- }, t && (s = "rtl" === getComputedStyle(k(u)).direction), n = B(e, a, t, () => W(a[f], s), (t, o) => {
343
- o ? a.scroll({
344
- [l]: W(e.M() + t, s)
345
- }) : a.scrollBy({
346
- [l]: W(t, s)
344
+ u.addEventListener("resize", h), $(h), r = () => {
345
+ u.removeEventListener("resize", h);
346
+ }, t && (s = "rtl" === getComputedStyle(z(a)).direction), n = E(e, u, t, () => O(u[f], s), (t, o) => {
347
+ o ? u.scroll({
348
+ [l]: O(e.T() + t, s)
349
+ }) : u.scrollBy({
350
+ [l]: O(t, s)
347
351
  });
348
- }, () => d(c, u.body, a, t)), i[1](!0);
352
+ }, () => d(c, a.body, u, t)), i[1](!0);
349
353
  },
350
- v() {
351
- r && r(), a.X(), n && n.X(), o = void 0, i[1](!1), i = m();
354
+ _() {
355
+ r && r(), u.q(), n && n.q(), o = void 0, i[1](!1), i = m();
352
356
  },
353
- P: (e, t) => (u.set(e, t), a.J(e), () => {
354
- u.delete(e), a.L(e);
357
+ P: (e, t) => (a.set(e, t), u.X(e), () => {
358
+ a.delete(e), u.Y(e);
355
359
  }),
356
360
  V: () => s,
357
- q: c,
361
+ J: c,
358
362
  j() {
359
- n && n.A();
360
- },
361
- D() {
362
- const e = C(o);
363
- return d(o, e.body, R(e), t);
363
+ n && n.D();
364
364
  },
365
365
  G() {
366
- const n = k(C(o));
367
- return e.p() - (t ? n.clientWidth : n.clientHeight);
366
+ const e = _(o);
367
+ return d(o, e.body, b(e), t);
368
+ },
369
+ U() {
370
+ const n = z(_(o));
371
+ return e.o() - (t ? n.clientWidth : n.clientHeight);
368
372
  }
369
373
  };
370
- }, Y = (e, t) => {
374
+ }, B = (e, t) => {
371
375
  let o, n, r, i = m(), s = !1;
372
- const [l, c] = J(t, () => i[0], (e, t) => {
376
+ const [l, c] = L(t, () => i[0], (e, t) => {
373
377
  const n = {
374
- left: W(e, s)
378
+ left: O(e, s)
375
379
  };
376
380
  t && (n.behavior = "smooth"), o.scrollTo(n);
377
- }), [f, u] = J(e, () => i[0], (e, t) => {
381
+ }), [f, a] = L(e, () => i[0], (e, t) => {
378
382
  const n = {
379
383
  top: e
380
384
  };
381
385
  t && (n.behavior = "smooth"), o.scrollTo(n);
382
- }), d = /* @__PURE__ */ new WeakMap, h = /* @__PURE__ */ new Set, g = /* @__PURE__ */ new Set, p = /* @__PURE__ */ new Map, S = (e, t) => `${e}-${t}`, w = H(n => {
386
+ }), d = /* @__PURE__ */ new WeakMap, h = /* @__PURE__ */ new Set, g = /* @__PURE__ */ new Set, v = /* @__PURE__ */ new Map, $ = (e, t) => `${e}-${t}`, p = M(n => {
383
387
  const r = /* @__PURE__ */ new Set, i = /* @__PURE__ */ new Set;
384
- for (const {target: s, contentRect: {width: l, height: c}} of n) if (s.offsetParent) if (s === o) e.B(4, c),
385
- t.B(4, l); else {
388
+ for (const {target: s, contentRect: {width: l, height: c}} of n) if (s.offsetParent) if (s === o) e.W(4, c),
389
+ t.W(4, l); else {
386
390
  const e = d.get(s);
387
391
  if (e) {
388
- const [t, o] = e, n = S(t, o), s = p.get(n);
389
- let f, u;
390
- s ? (s[0] !== c && (f = !0), s[1] !== l && (u = !0)) : f = u = !0, f && r.add(t),
391
- u && i.add(o), (f || u) && p.set(n, [ c, l ]);
392
+ const [t, o] = e, n = $(t, o), s = v.get(n);
393
+ let f, a;
394
+ s ? (s[0] !== c && (f = !0), s[1] !== l && (a = !0)) : f = a = !0, f && r.add(t),
395
+ a && i.add(o), (f || a) && v.set(n, [ c, l ]);
392
396
  }
393
397
  }
394
398
  if (r.size) {
@@ -396,195 +400,194 @@ var {min: u, max: a, abs: d, floor: h} = Math, g = (e, t, o) => u(o, a(t, e)), p
396
400
  r.forEach(e => {
397
401
  let o = 0;
398
402
  g.forEach(t => {
399
- const n = p.get(S(e, t));
400
- n && (o = a(o, n[0]));
403
+ const n = v.get($(e, t));
404
+ n && (o = u(o, n[0]));
401
405
  }), o && t.push([ e, o ]);
402
- }), e.B(3, t);
406
+ }), e.W(3, t);
403
407
  }
404
408
  if (i.size) {
405
409
  const e = [];
406
410
  i.forEach(t => {
407
411
  let o = 0;
408
412
  h.forEach(e => {
409
- const n = p.get(S(e, t));
410
- n && (o = a(o, n[1]));
413
+ const n = v.get($(e, t));
414
+ n && (o = u(o, n[1]));
411
415
  }), o && e.push([ t, o ]);
412
- }), t.B(3, e);
416
+ }), t.W(3, e);
413
417
  }
414
- }), _ = (e, t, n) => {
418
+ }), w = (e, t, n) => {
415
419
  const r = o, i = t ? "scrollLeft" : "scrollTop", l = t ? "overflowX" : "overflowY", c = t && s;
416
- return B(e, r, t, () => W(r[i], c), (t, o, s) => {
420
+ return E(e, r, t, () => O(r[i], c), (t, o, s) => {
417
421
  if (s) {
418
422
  const e = r.style, t = e[l];
419
- e[l] = "hidden", v(() => {
423
+ e[l] = "hidden", S(() => {
420
424
  e[l] = t;
421
425
  });
422
426
  }
423
- r[i] = W(e.M() + t, c), o && n();
427
+ r[i] = O(e.T() + t, c), o && n();
424
428
  });
425
429
  };
426
430
  return {
427
431
  N(l, f = l.parentElement) {
428
- w.J(o = f), s = "rtl" === getComputedStyle(f).direction, n = _(e, !1, u), r = _(t, !0, c),
432
+ p.X(o = f), s = "rtl" === getComputedStyle(f).direction, n = w(e, !1, a), r = w(t, !0, c),
429
433
  i[1](!0);
430
434
  },
431
- v() {
432
- w.X(), n && n.X(), r && r.X(), i[1](!1), i = m();
435
+ _() {
436
+ p.q(), n && n.q(), r && r.q(), i[1](!1), i = m();
433
437
  },
434
- P: (e, t, o) => (d.set(e, [ t, o ]), h.add(t), g.add(o), w.J(e), () => {
435
- d.delete(e), w.L(e);
438
+ P: (e, t, o) => (d.set(e, [ t, o ]), h.add(t), g.add(o), p.X(e), () => {
439
+ d.delete(e), p.Y(e);
436
440
  }),
437
- U(o) {
438
- for (const [e] of o) for (let o = 0; o < t.R(); o++) p.delete(S(e, o));
439
- e.B(3, o);
440
- },
441
441
  F(o) {
442
- for (const [t] of o) for (let o = 0; o < e.R(); o++) p.delete(S(o, t));
443
- t.B(3, o);
442
+ for (const [e] of o) for (let o = 0; o < t.C(); o++) v.delete($(e, o));
443
+ e.W(3, o);
444
+ },
445
+ K(o) {
446
+ for (const [t] of o) for (let o = 0; o < e.C(); o++) v.delete($(o, t));
447
+ t.W(3, o);
444
448
  },
445
449
  V: () => s,
446
- K: l,
447
- Z: f,
450
+ Z: l,
451
+ ee: f,
448
452
  j() {
449
- n && n.A(), r && r.A();
450
- },
451
- D: o => (o ? t : e).T()
453
+ n && n.D(), r && r.D();
454
+ }
452
455
  };
453
- }, A = (e, t) => {
454
- e.q(() => t);
455
- }, N = (e, t, o, {align: n, smooth: r, offset: i = 0} = {}) => {
456
- if (o = g(o, 0, t.R() - 1), "nearest" === n) {
457
- const e = t.k(o), r = t.M();
456
+ }, X = (e, t) => {
457
+ e.J(() => t);
458
+ }, Y = (e, t, o, {align: n, smooth: r, offset: i = 0} = {}) => {
459
+ if (o = g(o, 0, t.C() - 1), "nearest" === n) {
460
+ const e = t.u(o), r = t.T();
458
461
  if (e < r) n = "start"; else {
459
- if (!(e + t.C(o) > r + t.p())) return;
462
+ if (!(e + t.h(o) > r + t.o())) return;
460
463
  n = "end";
461
464
  }
462
465
  }
463
- e.q(() => i + e.D() + t.k(o) + ("end" === n ? t.C(o) - (t.p() - e.G()) : "center" === n ? (t.C(o) - (t.p() - e.G())) / 2 : 0), r);
464
- }, P = I ? r : o, V = "current", q = (e, t) => {
465
- if (Array.isArray(e)) for (const o of e) q(o, t); else null == e || "boolean" == typeof e || t.push(e);
466
- }, j = (e, t) => {
466
+ e.J(() => i + e.G() + t.u(o) + ("end" === n ? t.h(o) - (t.o() - e.U()) : "center" === n ? (t.h(o) - (t.o() - e.U())) / 2 : 0), r);
467
+ }, q = w ? r : o, A = "current", D = (e, t) => {
468
+ if (Array.isArray(e)) for (const o of e) D(o, t); else null == e || "boolean" == typeof e || t.push(e);
469
+ }, N = (e, t) => {
467
470
  const o = e.key;
468
471
  return null != o ? o : "_" + t;
469
- }, D = e => {
472
+ }, P = e => {
470
473
  const t = l(null);
471
474
  return t.current || (t.current = e());
472
- }, G = e => {
475
+ }, V = e => {
473
476
  const t = l(e);
474
- return P(() => {
475
- t[V] = e;
477
+ return q(() => {
478
+ t[A] = e;
476
479
  }, [ e ]), t;
477
- }, U = /*#__PURE__*/ t(({ee: e, te: t, oe: o, ne: n, re: r, ie: s, se: f, le: u}) => {
478
- const a = l(null);
479
- P(() => t(a[V], o), [ o ]);
480
+ }, J = /*#__PURE__*/ t(({te: e, oe: t, ne: o, re: n, ie: r, se: s, le: f, ce: a}) => {
481
+ const u = l(null);
482
+ q(() => t(u[A], o), [ o ]);
480
483
  const d = i(() => {
481
484
  const e = {
482
485
  contain: "layout style",
483
- position: r && u ? void 0 : "absolute",
486
+ position: r && a ? void 0 : "absolute",
484
487
  [f ? "height" : "width"]: "100%",
485
488
  [f ? "top" : "left"]: 0,
486
489
  [f ? "left" : "top"]: n,
487
- visibility: !r || u ? void 0 : "hidden"
490
+ visibility: !r || a ? void 0 : "hidden"
488
491
  };
489
492
  return f && (e.display = "inline-flex"), e;
490
- }, [ n, r, u, f ]);
493
+ }, [ n, r, a, f ]);
491
494
  /* @__PURE__ */
492
495
  return c(s, "string" == typeof s ? {
493
- ref: a,
496
+ ref: u,
494
497
  style: d,
495
498
  children: e
496
499
  } : {
497
- ref: a,
500
+ ref: u,
498
501
  style: d,
499
502
  index: o,
500
503
  children: e
501
504
  });
502
- }), F = (e, t) => i(() => {
505
+ }), j = (e, t) => i(() => {
503
506
  if ("function" == typeof e) return [ o => e(t[o], o), t.length ];
504
507
  const o = (e => {
505
508
  const t = [];
506
- return q(e, t), t;
509
+ return D(e, t), t;
507
510
  })(e);
508
511
  return [ e => o[e], o.length ];
509
- }, [ e, t ]), K = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: r, shift: i, horizontal: u, keepMounted: a, cache: d, startMargin: h = 0, ssrCount: g, as: v = "div", item: m = "div", scrollRef: w, onScroll: _, onScrollEnd: $}, z) => {
510
- const [b, y] = F(e, t), x = l(null), I = l(!!g), k = G(_), C = G($), [R, M, O] = D(() => {
511
- const e = !!u, t = E(y, r, g, d, !r);
512
- return [ t, L(t, e), e ];
512
+ }, [ e, t ]), G = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: r, shift: i, horizontal: a, keepMounted: u, cache: d, startMargin: h = 0, ssrCount: g, as: S = "div", item: m = "div", scrollRef: p, onScroll: w, onScrollEnd: z}, _) => {
513
+ const [b, y] = j(e, t), I = l(null), R = l(!!g), C = V(w), M = V(z), [O, E, L, W] = P(() => {
514
+ const e = !!a, t = T(y, r, d), o = k(t, g);
515
+ return [ o, t, H(o, e), e ];
513
516
  });
514
- y !== R.R() && R.B(5, [ y, i ]), h !== R.T() && R.B(6, h);
515
- const [H, W] = s(R.S, void 0, R.S), B = R.O(), J = R.h(), X = M.V(), Y = [], q = e => {
517
+ y !== O.C() && O.W(5, [ y, i ]), h !== O.O() && O.W(6, h);
518
+ const [B, D] = s(O.I, void 0, O.I), G = O.M(), U = O.t(), F = L.V(), K = [], Q = e => {
516
519
  const t = b(e);
517
520
  /* @__PURE__ */
518
- return c(U, {
519
- te: M.P,
520
- oe: e,
521
- ne: R.k(e, X),
522
- re: R.I(e),
523
- ie: m,
524
- ee: t,
525
- se: O,
526
- le: I[V]
527
- }, j(t, e));
521
+ return c(J, {
522
+ oe: L.P,
523
+ ne: e,
524
+ re: O.u(e, F),
525
+ ie: O.R(e),
526
+ se: m,
527
+ te: t,
528
+ le: W,
529
+ ce: R[A]
530
+ }, N(t, e));
528
531
  };
529
- if (P(() => {
530
- I[V] = !1, R.W(1, e => {
531
- e ? f(W) : W();
532
- }), R.W(4, () => {
533
- k.current && k.current(R.M());
534
- }), R.W(8, () => {
535
- C.current && C.current();
532
+ if (q(() => {
533
+ R[A] = !1, O.H(1, e => {
534
+ e ? f(D) : D();
535
+ }), O.H(4, () => {
536
+ C.current && C.current(O.T());
537
+ }), O.H(8, () => {
538
+ M.current && M.current();
536
539
  });
537
- const e = x[V];
538
- return w ? S(() => {
539
- w.current && M.N(e, w[V]);
540
- }) : M.N(e), () => {
541
- R.v(), M.v();
540
+ const e = I[A];
541
+ return p ? $(() => {
542
+ p.current && L.N(e, p[A]);
543
+ }) : L.N(e), () => {
544
+ O._(), L._();
542
545
  };
543
- }, []), P(() => {
544
- M.j();
545
- }, [ H ]), n(z, () => ({
546
+ }, []), q(() => {
547
+ L.j();
548
+ }, [ B ]), n(_, () => ({
546
549
  get cache() {
547
- return R.m();
550
+ return E.B();
548
551
  },
549
552
  get scrollOffset() {
550
- return R.M();
553
+ return O.T();
551
554
  },
552
555
  get scrollSize() {
553
- return T(R);
556
+ return x(O);
554
557
  },
555
558
  get viewportSize() {
556
- return R.p();
559
+ return O.o();
557
560
  },
558
- findItemIndex: R.$,
559
- getItemOffset: R.k,
560
- getItemSize: R.C,
561
- scrollToIndex: (e, t) => N(M, R, e, t),
562
- scrollTo: e => A(M, e),
561
+ findItemIndex: O.k,
562
+ getItemOffset: O.u,
563
+ getItemSize: O.h,
564
+ scrollToIndex: (e, t) => Y(L, O, e, t),
565
+ scrollTo: e => X(L, e),
563
566
  scrollBy: e => ((e, t, o) => {
564
- A(e, o + t.M());
565
- })(M, R, e)
566
- }), []), a) {
567
- const e = new Set(a);
568
- for (let [t, n] = R._(o); t <= n; t++) e.add(t);
569
- p([ ...e ]).forEach(e => {
570
- Y.push(q(e));
567
+ X(e, o + t.T());
568
+ })(L, O, e)
569
+ }), []), u) {
570
+ const e = new Set(u);
571
+ for (let [t, n] = O.i(o); t <= n; t++) e.add(t);
572
+ v([ ...e ]).forEach(e => {
573
+ K.push(Q(e));
571
574
  });
572
- } else for (let [e, t] = R._(o); e <= t; e++) Y.push(q(e));
575
+ } else for (let [e, t] = O.i(o); e <= t; e++) K.push(Q(e));
573
576
  /* @__PURE__ */
574
- return c(v, {
575
- ref: x,
577
+ return c(S, {
578
+ ref: I,
576
579
  style: {
577
580
  contain: "size style",
578
581
  overflowAnchor: "none",
579
582
  flex: "none",
580
583
  position: "relative",
581
- width: O ? J : "100%",
582
- height: O ? "100%" : J,
583
- pointerEvents: B ? "none" : void 0
584
+ width: W ? U : "100%",
585
+ height: W ? "100%" : U,
586
+ pointerEvents: G ? "none" : void 0
584
587
  },
585
- children: Y
588
+ children: K
586
589
  });
587
- }), Q = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: n, shift: r, horizontal: i, keepMounted: s, cache: l, ssrCount: f, item: u, onScroll: a, onScrollEnd: d, style: h, ...g}, p) => /* @__PURE__ */ c("div", {
590
+ }), U = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: n, shift: r, horizontal: i, keepMounted: s, cache: l, ssrCount: f, item: a, onScroll: u, onScrollEnd: d, style: h, ...g}, v) => /* @__PURE__ */ c("div", {
588
591
  ...g,
589
592
  style: {
590
593
  display: i ? "inline-block" : "block",
@@ -594,8 +597,8 @@ var {min: u, max: a, abs: d, floor: h} = Math, g = (e, t, o) => u(o, a(t, e)), p
594
597
  height: "100%",
595
598
  ...h
596
599
  },
597
- children: /* @__PURE__ */ c(K, {
598
- ref: p,
600
+ children: /* @__PURE__ */ c(G, {
601
+ ref: v,
599
602
  data: t,
600
603
  bufferSize: o,
601
604
  itemSize: n,
@@ -604,73 +607,73 @@ var {min: u, max: a, abs: d, floor: h} = Math, g = (e, t, o) => u(o, a(t, e)), p
604
607
  keepMounted: s,
605
608
  cache: l,
606
609
  ssrCount: f,
607
- item: u,
608
- onScroll: a,
610
+ item: a,
611
+ onScroll: u,
609
612
  onScrollEnd: d,
610
613
  children: e
611
614
  })
612
- })), Z = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: r, shift: i, horizontal: u, cache: a, ssrCount: d, as: h = "div", item: g = "div", onScroll: p, onScrollEnd: v}, S) => {
613
- const [m, w] = F(e, t), _ = l(null), $ = G(p), z = G(v), b = l(!!d), [y, x, I] = D(() => {
614
- const e = !!u, t = E(w, r, d, a, !r);
615
- return [ t, X(t, e), e ];
615
+ })), F = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: r, shift: i, horizontal: a, cache: u, ssrCount: d, as: h = "div", item: g = "div", onScroll: v, onScrollEnd: S}, $) => {
616
+ const [m, p] = j(e, t), w = l(null), z = V(v), _ = V(S), b = l(!!d), [y, I, x, R] = P(() => {
617
+ const e = !!a, t = T(p, r, u), o = k(t, d);
618
+ return [ o, t, W(o, e), e ];
616
619
  });
617
- w !== y.R() && y.B(5, [ w, i ]);
618
- const [k, C] = s(y.S, void 0, y.S), R = y.O(), M = y.h(), O = x.V(), T = [];
619
- P(() => (b[V] = !1, y.W(1, e => {
620
- e ? f(C) : C();
621
- }), y.W(4, () => {
622
- $.current && $.current();
623
- }), y.W(8, () => {
620
+ p !== y.C() && y.W(5, [ p, i ]);
621
+ const [C, M] = s(y.I, void 0, y.I), O = y.M(), E = y.t(), L = x.V(), H = [];
622
+ q(() => (b[A] = !1, y.H(1, e => {
623
+ e ? f(M) : M();
624
+ }), y.H(4, () => {
624
625
  z.current && z.current();
625
- }), x.N(_[V]), () => {
626
- y.v(), x.v();
627
- }), []), P(() => {
626
+ }), y.H(8, () => {
627
+ _.current && _.current();
628
+ }), x.N(w[A]), () => {
629
+ y._(), x._();
630
+ }), []), q(() => {
628
631
  x.j();
629
- }, [ k ]), n(S, () => ({
632
+ }, [ C ]), n($, () => ({
630
633
  get cache() {
631
- return y.m();
634
+ return I.B();
632
635
  },
633
636
  get scrollOffset() {
634
- return y.M();
637
+ return y.T();
635
638
  },
636
639
  get viewportSize() {
637
- return y.p();
640
+ return y.o();
638
641
  },
639
- findItemIndex: y.$,
640
- getItemOffset: y.k,
641
- getItemSize: y.C,
642
- scrollToIndex: (e, t) => N(x, y, e, t)
642
+ findItemIndex: y.k,
643
+ getItemOffset: y.u,
644
+ getItemSize: y.h,
645
+ scrollToIndex: (e, t) => Y(x, y, e, t)
643
646
  }), []);
644
- for (let [e, t] = y._(o); e <= t; e++) {
647
+ for (let [e, t] = y.i(o); e <= t; e++) {
645
648
  const t = m(e);
646
- T.push(/* @__PURE__ */ c(U, {
647
- te: x.P,
648
- oe: e,
649
- ne: y.k(e, O),
650
- re: y.I(e),
651
- ie: g,
652
- ee: t,
653
- se: I,
654
- le: b[V]
655
- }, j(t, e)));
649
+ H.push(/* @__PURE__ */ c(J, {
650
+ oe: x.P,
651
+ ne: e,
652
+ re: y.u(e, L),
653
+ ie: y.R(e),
654
+ se: g,
655
+ te: t,
656
+ le: R,
657
+ ce: b[A]
658
+ }, N(t, e)));
656
659
  }
657
660
  /* @__PURE__ */
658
661
  return c(h, {
659
- ref: _,
662
+ ref: w,
660
663
  style: {
661
664
  contain: "size style",
662
665
  overflowAnchor: "none",
663
666
  flex: "none",
664
667
  position: "relative",
665
- width: I ? M : "100%",
666
- height: I ? "100%" : M,
667
- pointerEvents: R ? "none" : void 0
668
+ width: R ? E : "100%",
669
+ height: R ? "100%" : E,
670
+ pointerEvents: O ? "none" : void 0
668
671
  },
669
- children: T
672
+ children: H
670
673
  });
671
- }), ee = (e, t) => `${e}-${t}`, te = /*#__PURE__*/ t(({ee: e, te: t, ce: o, fe: n, ue: r, ae: s, de: f, he: u, re: a, ge: d}) => {
674
+ }), K = (e, t) => `${e}-${t}`, Q = /*#__PURE__*/ t(({te: e, oe: t, fe: o, ae: n, ue: r, de: s, he: f, ge: a, ie: u, ve: d}) => {
672
675
  const h = l(null);
673
- return P(() => t(h[V], o, n), [ n, o ]), /* @__PURE__ */ c(d, {
676
+ return q(() => t(h[A], o, n), [ n, o ]), /* @__PURE__ */ c(d, {
674
677
  ref: h,
675
678
  style: i(() => ({
676
679
  contain: "layout style",
@@ -678,122 +681,122 @@ var {min: u, max: a, abs: d, floor: h} = Math, g = (e, t, o) => u(o, a(t, e)), p
678
681
  position: "absolute",
679
682
  top: r,
680
683
  left: s,
681
- visibility: a ? "hidden" : void 0,
684
+ visibility: u ? "hidden" : void 0,
682
685
  minHeight: f,
683
- minWidth: u
684
- }), [ r, s, u, f, a ]),
686
+ minWidth: a
687
+ }), [ r, s, a, f, u ]),
685
688
  children: e
686
689
  });
687
- }), oe = /*#__PURE__*/ e(({children: e, row: t, col: o, cellHeight: r = 40, cellWidth: u = 100, bufferSize: a, ssrRowCount: d, ssrColCount: h, item: p = "div", domRef: v, onScroll: S, onScrollEnd: m, style: w, ..._}, $) => {
688
- const [z, b, y] = D(() => {
689
- const e = E(t, r, d), n = E(o, u, h);
690
- return [ e, n, Y(e, n) ];
690
+ }), Z = /*#__PURE__*/ e(({children: e, row: t, col: o, cellHeight: r = 40, cellWidth: a = 100, bufferSize: u, ssrRowCount: d, ssrColCount: h, item: v = "div", domRef: S, onScroll: $, onScrollEnd: m, style: p, ...w}, z) => {
691
+ const [_, b, y] = P(() => {
692
+ const e = k(T(t, r), d), n = k(T(o, a), h);
693
+ return [ e, n, B(e, n) ];
691
694
  });
692
- t !== z.R() && z.B(5, [ t ]), o !== b.R() && b.B(5, [ o ]);
693
- const [x, I] = s(z.S, void 0, z.S), [k, C] = s(b.S, void 0, b.S), R = z.O(), M = b.O(), O = T(z), H = T(b), W = l(null), B = G(S), J = G(m);
694
- P(() => {
695
- z.W(1, e => {
696
- e ? f(I) : I();
697
- }), b.W(1, e => {
698
- e ? f(C) : C();
699
- }), z.W(4, () => {
700
- B.current && B.current(z.M());
701
- }), z.W(8, () => {
702
- J.current && J.current();
695
+ t !== _.C() && _.W(5, [ t ]), o !== b.C() && b.W(5, [ o ]);
696
+ const [I, R] = s(_.I, void 0, _.I), [C, M] = s(b.I, void 0, b.I), O = _.M(), E = b.M(), L = x(_), H = x(b), W = l(null), X = V($), Y = V(m);
697
+ q(() => {
698
+ _.H(1, e => {
699
+ e ? f(R) : R();
700
+ }), b.H(1, e => {
701
+ e ? f(M) : M();
702
+ }), _.H(4, () => {
703
+ X.current && X.current(_.T());
704
+ }), _.H(8, () => {
705
+ Y.current && Y.current();
703
706
  });
704
- const e = W[V];
707
+ const e = W[A];
705
708
  return y.N(e), () => {
706
- z.v(), b.v(), y.v();
709
+ _._(), b._(), y._();
707
710
  };
708
- }, []), P(() => {
711
+ }, []), q(() => {
709
712
  y.j();
710
- }, [ x, k ]), n($, () => ({
713
+ }, [ I, C ]), n(z, () => ({
711
714
  get scrollTop() {
712
- return z.M();
715
+ return _.T();
713
716
  },
714
717
  get scrollLeft() {
715
- return b.M();
718
+ return b.T();
716
719
  },
717
720
  get scrollHeight() {
718
- return T(z);
721
+ return x(_);
719
722
  },
720
723
  get scrollWidth() {
721
- return T(b);
724
+ return x(b);
722
725
  },
723
726
  get viewportHeight() {
724
- return z.p();
727
+ return _.o();
725
728
  },
726
729
  get viewportWidth() {
727
- return b.p();
728
- },
729
- findRowIndex: z.$,
730
- findColIndex: b.$,
731
- getRowOffset: z.k,
732
- getColOffset: b.k,
733
- getRowSize: z.C,
734
- getColSize: b.C,
730
+ return b.o();
731
+ },
732
+ findRowIndex: _.k,
733
+ findColIndex: b.k,
734
+ getRowOffset: _.u,
735
+ getColOffset: b.u,
736
+ getRowSize: _.h,
737
+ getColSize: b.h,
735
738
  resizeCols(e) {
736
- y.F(e);
739
+ y.K(e);
737
740
  },
738
741
  resizeRows(e) {
739
- y.U(e);
742
+ y.F(e);
740
743
  },
741
744
  scrollToIndex: (e, t) => ((e, t, o, n, r) => {
742
745
  if (null != n) {
743
- const o = g(n, 0, t.R() - 1);
744
- e.Z(() => e.D(!1) + t.k(o));
746
+ const o = g(n, 0, t.C() - 1);
747
+ e.ee(() => t.u(o));
745
748
  }
746
749
  if (null != r) {
747
- const t = g(r, 0, o.R() - 1);
748
- e.K(() => e.D(!0) + o.k(t));
750
+ const t = g(r, 0, o.C() - 1);
751
+ e.Z(() => o.u(t));
749
752
  }
750
- })(y, z, b, e, t),
753
+ })(y, _, b, e, t),
751
754
  scrollTo: (e, t) => ((e, t, o) => {
752
- null != t && e.Z(() => t), null != o && e.K(() => o);
755
+ null != t && e.ee(() => t), null != o && e.Z(() => o);
753
756
  })(y, e, t),
754
757
  scrollBy: (e, t) => ((e, t, o, n, r) => {
755
758
  if (null != n) {
756
- const o = n + t.M();
757
- e.Z(() => o);
759
+ const o = n + t.T();
760
+ e.ee(() => o);
758
761
  }
759
762
  if (null != r) {
760
- const t = r + o.M();
761
- e.K(() => t);
763
+ const t = r + o.T();
764
+ e.Z(() => t);
762
765
  }
763
- })(y, z, b, e, t)
766
+ })(y, _, b, e, t)
764
767
  }), []);
765
- const L = i(() => {
768
+ const D = i(() => {
766
769
  const t = /* @__PURE__ */ new Map;
767
770
  return (o, n) => {
768
- let r = t.get(ee(o, n));
769
- return r || t.set(ee(o, n), r = e({
771
+ let r = t.get(K(o, n));
772
+ return r || t.set(K(o, n), r = e({
770
773
  rowIndex: o,
771
774
  colIndex: n
772
775
  })), r;
773
776
  };
774
- }, [ e ]), X = y.V(), [A, N] = z._(a), [q, j] = b._(a), U = [];
775
- for (let e = A; e <= N; e++) for (let t = q; t <= j; t++) U.push(/* @__PURE__ */ c(te, {
776
- te: y.P,
777
- ce: e,
778
- fe: t,
779
- ue: z.k(e),
780
- ae: b.k(t, X),
781
- de: z.C(e),
782
- he: b.C(t),
783
- re: z.I(e) || b.I(t),
784
- ge: p,
785
- ee: L(e, t)
786
- }, ee(e, t)));
777
+ }, [ e ]), N = y.V(), [J, j] = _.i(u), [G, U] = b.i(u), F = [];
778
+ for (let e = J; e <= j; e++) for (let t = G; t <= U; t++) F.push(/* @__PURE__ */ c(Q, {
779
+ oe: y.P,
780
+ fe: e,
781
+ ae: t,
782
+ ue: _.u(e),
783
+ de: b.u(t, N),
784
+ he: _.h(e),
785
+ ge: b.h(t),
786
+ ie: _.R(e) || b.R(t),
787
+ ve: v,
788
+ te: D(e, t)
789
+ }, K(e, t)));
787
790
  /* @__PURE__ */
788
791
  return c("div", {
789
- ref: v,
790
- ..._,
792
+ ref: S,
793
+ ...w,
791
794
  style: {
792
795
  overflow: "auto",
793
796
  contain: "strict",
794
797
  width: "100%",
795
798
  height: "100%",
796
- ...w
799
+ ...p
797
800
  },
798
801
  children: /* @__PURE__ */ c("div", {
799
802
  ref: W,
@@ -803,13 +806,13 @@ var {min: u, max: a, abs: d, floor: h} = Math, g = (e, t, o) => u(o, a(t, e)), p
803
806
  flex: "none",
804
807
  position: "relative",
805
808
  width: H,
806
- height: O,
807
- pointerEvents: R || M ? "none" : void 0
809
+ height: L,
810
+ pointerEvents: O || E ? "none" : void 0
808
811
  },
809
- children: U
812
+ children: F
810
813
  })
811
814
  });
812
815
  });
813
816
 
814
- export { Q as VList, K as Virtualizer, Z as WindowVirtualizer, oe as experimental_VGrid };
817
+ export { U as VList, G as Virtualizer, F as WindowVirtualizer, Z as experimental_VGrid };
815
818
  //# sourceMappingURL=index.js.map