virtua 0.53.3 → 0.53.4

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (49) hide show
  1. package/README.md +37 -32
  2. package/lib/angular/VGrid.d.ts +1 -1
  3. package/lib/angular/VList.d.ts +1 -1
  4. package/lib/angular/VMasonry.d.ts +1 -1
  5. package/lib/angular/Virtualizer.d.ts +1 -1
  6. package/lib/angular/WindowVirtualizer.d.ts +1 -1
  7. package/lib/angular/index.js +586 -586
  8. package/lib/angular/index.js.map +1 -1
  9. package/lib/core/index.cjs +405 -404
  10. package/lib/core/index.cjs.map +1 -1
  11. package/lib/core/index.d.ts +1 -1
  12. package/lib/core/index.js +416 -415
  13. package/lib/core/index.js.map +1 -1
  14. package/lib/index.cjs +645 -645
  15. package/lib/index.cjs.map +1 -1
  16. package/lib/index.js +639 -639
  17. package/lib/index.js.map +1 -1
  18. package/lib/react/VGrid.d.ts +1 -1
  19. package/lib/react/VMasonry.d.ts +1 -1
  20. package/lib/react/Virtualizer.d.ts +1 -1
  21. package/lib/react/WindowVirtualizer.d.ts +1 -1
  22. package/lib/solid/VGrid.d.ts +1 -1
  23. package/lib/solid/VMasonry.d.ts +1 -1
  24. package/lib/solid/Virtualizer.d.ts +1 -1
  25. package/lib/solid/WindowVirtualizer.d.ts +1 -1
  26. package/lib/solid/index.cjs +672 -671
  27. package/lib/solid/index.cjs.map +1 -1
  28. package/lib/solid/index.js +671 -671
  29. package/lib/solid/index.js.map +1 -1
  30. package/lib/solid/index.jsx +165 -214
  31. package/lib/solid/index.jsx.map +1 -1
  32. package/lib/svelte/VGrid.svelte +15 -20
  33. package/lib/svelte/VGrid.type.d.ts +1 -1
  34. package/lib/svelte/VMasonry.svelte +10 -13
  35. package/lib/svelte/VMasonry.type.d.ts +1 -1
  36. package/lib/svelte/Virtualizer.svelte +8 -8
  37. package/lib/svelte/Virtualizer.type.d.ts +1 -1
  38. package/lib/svelte/WindowVirtualizer.svelte +5 -7
  39. package/lib/svelte/WindowVirtualizer.type.d.ts +1 -1
  40. package/lib/vue/VGrid.d.ts +1 -1
  41. package/lib/vue/VMasonry.d.ts +1 -1
  42. package/lib/vue/Virtualizer.d.ts +1 -1
  43. package/lib/vue/WindowVirtualizer.d.ts +1 -1
  44. package/lib/vue/index.cjs +800 -797
  45. package/lib/vue/index.cjs.map +1 -1
  46. package/lib/vue/index.js +771 -768
  47. package/lib/vue/index.js.map +1 -1
  48. package/package.json +1 -1
  49. package/lib/core/observer.d.ts +0 -1
package/lib/index.js CHANGED
@@ -13,42 +13,49 @@ var a, u = [], {min: d, max: h, abs: g, floor: $} = Math, p = (e, t, o) => d(o,
13
13
  return [ new Promise(t => {
14
14
  e = t;
15
15
  }), e ];
16
- }, z = "undefined" != typeof window, y = e => e.ownerDocument, x = e => e.defaultView, b = () => (null == a && (a = /iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0),
17
- a), I = e => h(e.t(), e.o()), R = ({l: e, i: t, u: o, h: n, t: r, $: s, p: l, m: i, S: c}, f = 0) => {
18
- let a = !!f, u = 1, $ = 0, p = 0, m = 0, w = 0, S = 0, _ = 0, v = 0, z = 0, y = null, x = [ 0, a ? h(f - 1, 0) : -1 ], I = !1;
19
- const R = /* @__PURE__ */ new Set, k = () => m - p, T = () => k() + S + w, O = e => t(e) - S, M = e => {
20
- if (2 === z) return !0;
21
- if (y && 1 === z) return e < y[0];
22
- const t = k(), n = O(e), r = o(e);
23
- return 1 !== v && 0 === z ? n + r <= t : n < t && n + r < t + $;
24
- }, E = e => {
25
- e && (b() && 0 !== v || y && 1 === z ? S += e : w += e);
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
+ a), b = e => h(e.t(), e.o()), R = (e, t, o, n) => {
18
+ const r = e.l(), s = t.i(r);
19
+ t.u(o, n) && e.h(6, t.i(r) - s);
20
+ }, k = ({$: e, p: t, i: o, m: n, S: r, t: s, _: l, v: i, I: c}, f = 0) => {
21
+ let a = !!f, u = 1, $ = 0, p = 0, m = 0, w = 0, S = 0, _ = 0, v = 0, z = 0, y = null, x = [ 0, a ? h(f - 1, 0) : -1 ], b = !1;
22
+ const R = /* @__PURE__ */ new Set, k = () => m - p, T = () => k() + S + w, O = (e, t) => {
23
+ const r = o(e), s = n(e);
24
+ return 1 !== v && 0 === z ? r + s <= t : r < t && r + s < t + $;
25
+ }, M = e => {
26
+ e && (I() && 0 !== v || y && 1 === z ? S += e : w += e);
27
+ }, C = () => {
28
+ const e = l();
29
+ if (2 === z) return e;
30
+ if (y && 1 === z) return d(y[0], e);
31
+ const o = T();
32
+ let n = t(o);
33
+ for (;n > 0 && !O(n - 1, o); ) n--;
34
+ for (;n < e && O(n, o); ) n++;
35
+ return n;
26
36
  };
27
37
  return {
28
- _: () => {
38
+ R: () => {
29
39
  R.clear();
30
40
  },
31
- v: () => u,
32
- l: (t = 200) => {
33
- if (!I || a) return x;
41
+ k: () => u,
42
+ $: (t = 200) => {
43
+ if (!b || a) return x;
34
44
  let o, n;
35
45
  if (_) [o, n] = x; else {
36
46
  let r = h(0, T()), s = r + $;
37
- i() || (t = h(0, t), 1 !== v && (r -= t), 2 !== v && (s += t)), [o, n] = x = e(h(0, r), h(0, s)),
47
+ c() || (t = h(0, t), 1 !== v && (r -= t), 2 !== v && (s += t)), [o, n] = x = e(h(0, r), h(0, s)),
38
48
  y && (o = d(o, y[0]), n = h(n, y[1]));
39
49
  }
40
- return [ h(o, 0), d(n, s() - 1) ];
50
+ return [ h(o, 0), d(n, l() - 1) ];
41
51
  },
42
- I: n,
43
- i: O,
44
- u: o,
45
- R: s,
46
- k: () => m,
47
- T,
52
+ l: C,
53
+ i: e => o(e) - S,
54
+ T: () => m,
48
55
  O: () => 0 !== v,
49
56
  o: () => $,
50
57
  M: () => p,
51
- t: r,
58
+ t: s,
52
59
  C: () => (_ = w, w = 0, [ _, 2 === z ]),
53
60
  L: (e, t) => {
54
61
  const o = [ e, t ];
@@ -56,125 +63,128 @@ a), I = e => h(e.t(), e.o()), R = ({l: e, i: t, u: o, h: n, t: r, $: s, p: l, m:
56
63
  R.delete(o);
57
64
  };
58
65
  },
59
- A: (t, o) => {
60
- let s, i, f = 0;
66
+ h: (t, n, c) => {
67
+ let f, d, h = 0;
61
68
  switch (t) {
62
69
  case 1:
63
70
  {
64
- if (o === m && 0 === z) break;
71
+ if (n === m && 0 === z) break;
65
72
  const e = _;
66
73
  _ = 0;
67
- const t = o - m, n = g(t);
68
- e && n < g(e) + 1 || 0 !== z || (v = t < 0 ? 2 : 1), a && (a = !1), m = o, f = 4;
69
- const s = k();
70
- s >= -$ && s <= r() && (f += 1, i = n > $);
74
+ const t = n - m, o = g(t);
75
+ e && o < g(e) + 1 || 0 !== z || (v = t < 0 ? 2 : 1), a && (a = !1), m = n, h = 4;
76
+ const r = k();
77
+ r >= -$ && r <= s() && (h += 1, d = o > $);
71
78
  break;
72
79
  }
73
80
 
74
81
  case 2:
75
- f = 8, 0 !== v && (s = !0, f += 1), v = 0, z = 0, y = null;
82
+ h = 8, 0 !== v && (f = !0, h += 1), v = 0, z = 0, y = null;
76
83
  break;
77
84
 
78
85
  case 3:
79
- {
80
- const e = o.filter(([e, t]) => !n(e, t));
81
- if (!e.length) break;
82
- E(c(e, M, T(), $)), f = 3, i = !0;
83
- break;
86
+ if (n.length) {
87
+ const e = C(), t = o(e);
88
+ r(n, $), M(o(e) - t), h = 3, d = !0;
84
89
  }
90
+ break;
85
91
 
86
92
  case 4:
87
- $ !== o && ($ || (I = i = !0), $ = o, f = 3);
93
+ $ !== n && ($ || (b = d = !0), $ = n, h = 3);
88
94
  break;
89
95
 
90
96
  case 5:
91
- o[1] ? (E(l(o[0], !0)), z = 2, f = 1) : (l(o[0]), f = 1);
97
+ if (n !== l()) {
98
+ if (c) {
99
+ const e = s();
100
+ i(n, !0), M(s() - e), z = 2;
101
+ } else i(n);
102
+ h = 1;
103
+ }
92
104
  break;
93
105
 
94
106
  case 6:
95
- p = o;
107
+ M(n), h = 1;
96
108
  break;
97
109
 
98
110
  case 7:
99
- z = 1;
111
+ p = n;
100
112
  break;
101
113
 
102
- case 9:
103
- null != o && (E(o), f = 1);
114
+ case 8:
115
+ z = 1;
104
116
  break;
105
117
 
106
- case 8:
107
- y = e(o, o + $), f = 1;
118
+ case 9:
119
+ y = e(n, n + $), h = 1;
108
120
  }
109
- f && (u = 1 + (2147483647 & u), s && S && (w += S, S = 0), R.forEach(([e, t]) => {
110
- f & e && t(i);
121
+ h && (u = 1 + (2147483647 & u), f && S && (w += S, S = 0), R.forEach(([e, t]) => {
122
+ h & e && t(d);
111
123
  }));
112
124
  }
113
125
  };
114
- }, k = (e, t, o) => {
126
+ }, T = (e, t, o) => {
115
127
  const n = o ? "unshift" : "push";
116
128
  for (let o = 0; o < t; o++) e[n](-1);
117
129
  return e;
118
- }, T = (e, t, o, n = 0, r = t - 1) => {
130
+ }, O = (e, t, o, n = 0, r = t - 1) => {
119
131
  let s = n;
120
132
  for (;n <= r; ) {
121
133
  const t = $((n + r) / 2);
122
134
  e(t) <= o ? (s = t, n = t + 1) : r = t - 1;
123
135
  }
124
136
  return p(s, 0, t - 1);
125
- }, O = (e, t, o) => {
137
+ }, M = (e, t, o) => {
126
138
  let n = o && o[1] || t || 40, r = -1, s = 0, l = !t, i = 0;
127
- const c = o && o[0], f = c ? k(c.slice(0, d(e, c.length)), h(0, e - c.length)) : k([], e), a = k([], e + 1), u = e => {
128
- const t = f[e];
139
+ const c = o ? o[0].slice(0, e) : [];
140
+ T(c, e - c.length);
141
+ const f = T([], e + 1), a = e => {
142
+ const t = c[e];
129
143
  return -1 === t ? n : t;
130
- }, g = t => {
144
+ }, u = t => {
131
145
  if (!e) return 0;
132
- if (r >= t) return a[t];
133
- r < 0 && (a[0] = 0, r = 0);
134
- let o = r, n = a[o];
135
- for (;o < t; ) n += u(o), a[++o] = n;
146
+ if (r >= t) return f[t];
147
+ r < 0 && (f[0] = 0, r = 0);
148
+ let o = r, n = f[o];
149
+ for (;o < t; ) n += a(o), f[++o] = n;
136
150
  return r = t, n;
137
151
  };
138
152
  return {
139
- l: (t, o) => {
153
+ $: (t, o) => {
140
154
  let n, r;
141
- return i = d(i, e - 1), g(i) <= t ? (r = T(g, e, o, i), n = T(g, e, t, i, r)) : (n = T(g, e, t, void 0, i),
142
- r = T(g, e, o, n)), i = n, [ n, r ];
155
+ return i = d(i, e - 1), u(i) <= t ? (r = O(u, e, o, i), n = O(u, e, t, i, r)) : (n = O(u, e, t, void 0, i),
156
+ r = O(u, e, o, n)), i = n, [ n, r ];
143
157
  },
144
- W: t => T(g, e, t),
145
- i: g,
146
- u,
147
- h: (e, t = -1) => f[e] === t,
148
- S: (t, o, i, c) => {
149
- let a = t.reduce((e, [t, n]) => o(t) ? e + (n - u(t)) : e, 0);
150
- for (const [e, o] of t) s += -1 === f[e] ? o : o - u(e), f[e] = o, r = d(e, r);
151
- if (l && c && s > c) {
152
- let t = 0;
153
- const o = T(g, e, i + a), s = [];
154
- f.forEach((e, n) => {
155
- -1 !== e && (e && s.push(e), n < o && t++);
156
- }), r = -1, m(s);
157
- const c = s.length, u = c / 2 | 0, d = c % 2 == 0 ? (s[u - 1] + s[u]) / 2 : s[u], $ = n;
158
- a += ((n = d) - $) * h(o - t, 0), l = !1;
158
+ p: t => O(u, e, t),
159
+ i: u,
160
+ m: a,
161
+ A: (e, t = -1) => c[e] === t,
162
+ S: (e, t) => {
163
+ for (const [t, o] of e) s += -1 === c[t] ? o : o - a(t), c[t] = o, r = d(t, r);
164
+ if (l && t && s > t) {
165
+ const e = [];
166
+ c.forEach(t => {
167
+ -1 !== t && t && e.push(t);
168
+ }), r = -1, m(e);
169
+ const t = e.length, o = t / 2 | 0;
170
+ n = t % 2 == 0 ? (e[o - 1] + e[o]) / 2 : e[o], l = !1;
159
171
  }
160
- return a;
161
172
  },
162
- t: () => g(e),
163
- $: () => e,
164
- p: (t, o) => {
165
- const s = t - e;
166
- return r = o ? -1 : d(t - 1, r), e = t, s > 0 ? (k(a, s), k(f, s, o), n * s) : (a.splice(s),
167
- (o ? f.splice(0, -s) : f.splice(s)).reduce((e, t) => e - (-1 === t ? n : t), 0));
173
+ t: () => u(e),
174
+ _: () => e,
175
+ v: (t, o) => {
176
+ const n = t - e;
177
+ r = o ? -1 : d(t - 1, r), e = t, n > 0 ? (T(f, n), T(c, n, o)) : (f.splice(n), o ? c.splice(0, -n) : c.splice(n));
168
178
  },
169
- m: () => l,
170
- H: () => [ f.slice(), n ]
179
+ I: () => l,
180
+ W: () => [ c.slice(), n ]
171
181
  };
172
- }, M = e => "number" == typeof e ? e : e.length, E = (e, t) => "number" == typeof e ? t : e[t], C = (e, t, o = 0) => {
173
- let n = M(e);
182
+ }, C = e => "number" == typeof e ? e : e.length, E = (e, t) => "number" == typeof e ? t : e[t], L = (e, t, o = 0) => {
183
+ let n = C(e);
174
184
  const r = "number" == typeof t, s = "auto" === t;
175
185
  let l = (r ? t : 40) + o, i = -1, c = 0, f = s, a = 0, u = 0, g = null;
176
186
  const w = [], S = [], _ = [], v = e => s || !!_[e], z = () => {
177
- w.length || k(w, n);
187
+ w.length || T(w, n);
178
188
  }, y = e => {
179
189
  const t = w[e];
180
190
  return -1 === t ? l : t;
@@ -186,77 +196,71 @@ a), I = e => h(e.t(), e.o()), R = ({l: e, i: t, u: o, h: n, t: r, $: s, p: l, m:
186
196
  let t = i, o = S[t];
187
197
  for (;t < e; ) o += y(t), S[++t] = o;
188
198
  return i = e, o;
189
- }, b = (e, t) => {
199
+ }, I = (e, t) => {
190
200
  w[e] = t, i = d(e, i);
191
- }, I = e => w.length ? T(x, n, e) : l ? p($(e / l), 0, n - 1) : 0, R = () => d(a, n), O = () => h(n - u, R()), E = e => (w.length ? y(e) : l) - o;
201
+ }, b = e => w.length ? O(x, n, e) : l ? p($(e / l), 0, n - 1) : 0, R = () => d(a, n), k = () => h(n - u, R()), M = e => (w.length ? y(e) : l) - o;
192
202
  return {
193
- l: (e, t) => {
194
- const r = x(R()), s = x(n) - x(O()), l = e + (r ? r - o : 0);
195
- return [ I(l), I(h(l, t - (s ? s - o : 0))) ];
203
+ $: (e, t) => {
204
+ const r = x(R()), s = x(n) - x(k()), l = e + (r ? r - o : 0);
205
+ return [ b(l), b(h(l, t - (s ? s - o : 0))) ];
196
206
  },
197
- W: I,
207
+ p: b,
198
208
  i: x,
199
- u: E,
200
- S: (e, t, n, r) => {
201
- let s = e.reduce((e, [o, n]) => v(o) && t(o) ? e + (n - E(o)) : e, 0);
202
- for (const [t, n] of e) v(t) && (z(), c += -1 === w[t] ? n : n - E(t), b(t, n + o));
203
- if (f && r && c > r) {
204
- let e = 0;
205
- const t = I(n + s), o = [];
206
- w.forEach((n, r) => {
207
- -1 !== n && (n && o.push(n), r < t && e++);
208
- }), i = -1, m(o);
209
- const r = o.length, c = r / 2 | 0, a = r % 2 == 0 ? (o[c - 1] + o[c]) / 2 : o[c], u = l;
210
- s += ((l = a) - u) * h(t - e, 0), f = !1;
209
+ m: M,
210
+ S: (e, t) => {
211
+ for (const [t, n] of e) v(t) && (z(), c += -1 === w[t] ? n : n - M(t), I(t, n + o));
212
+ if (f && t && c > t) {
213
+ const e = [];
214
+ w.forEach(t => {
215
+ -1 !== t && t && e.push(t);
216
+ }), i = -1, m(e);
217
+ const t = e.length, o = t / 2 | 0;
218
+ l = t % 2 == 0 ? (e[o - 1] + e[o]) / 2 : e[o], f = !1;
211
219
  }
212
- return s;
213
220
  },
214
- h: (e, t = -1) => {
221
+ A: (e, t = -1) => {
215
222
  const n = w.length ? w[e] : -1;
216
223
  return -1 === t ? v(e) && -1 === n : n === t + o;
217
224
  },
218
225
  t: () => n ? x(n) - o : 0,
219
- $: () => n,
220
- p: e => {
226
+ _: () => n,
227
+ v: e => {
221
228
  const t = e - n;
222
- return i = d(e - 1, i), n = e, w.length && (t > 0 ? k(w, t) : w.splice(t)), 0;
229
+ i = d(e - 1, i), n = e, w.length && (t > 0 ? T(w, t) : w.splice(t));
223
230
  },
224
- m: () => f,
225
- q: v,
226
- B: (e = 0, t = 0) => {
231
+ I: () => f,
232
+ H: v,
233
+ q: (e = 0, t = 0) => {
227
234
  a = e, u = t;
228
235
  },
229
- P: R,
230
- V: O,
236
+ B: R,
237
+ P: k,
231
238
  Y: (e, t) => "number" == typeof t ? r ? t : null : r || s || "auto" === t ? null : e.map(e => null != e ? e[t] : null),
232
- X: (e, t) => {
233
- if (null == e) return;
239
+ u: e => {
240
+ if (null == e) return !1;
234
241
  if ("number" == typeof e) {
235
- const n = e + o;
236
- if (n === l) return;
237
- const r = I(t) * (n - l);
238
- return l = n, r;
242
+ const t = e + o;
243
+ return t !== l && (l = t, !0);
239
244
  }
240
- if (e === g && n === _.length) return;
245
+ if (e === g && n === _.length) return !1;
241
246
  g = e, _.length = n, z();
242
- const r = I(t), s = x(r);
243
- let i;
244
- for (let t = 0; t < n; t++) {
245
- const n = e[t], r = "number" != typeof n;
246
- if (!r || !_[t]) {
247
- _[t] = r;
248
- const e = r ? -1 : n + o;
249
- w[t] !== e && (b(t, e), i = !0);
247
+ let t = !1;
248
+ for (let r = 0; r < n; r++) {
249
+ const n = e[r], s = "number" != typeof n;
250
+ if (!s || !_[r]) {
251
+ _[r] = s;
252
+ const e = s ? -1 : n + o;
253
+ w[r] !== e && (I(r, e), t = !0);
250
254
  }
251
255
  }
252
- return i ? x(r) - s : void 0;
256
+ return t;
253
257
  }
254
258
  };
255
- }, L = /*#__PURE__*/ new WeakMap, A = (e, t, o) => {
259
+ }, A = /*#__PURE__*/ new WeakMap, W = (e, t, o) => {
256
260
  const n = [];
257
261
  for (const r of e) r >= t && r < o && n.push(r);
258
262
  return m(n);
259
- }, W = (e, t, o) => {
263
+ }, H = (e, t, o) => {
260
264
  if (t >= o) return -1;
261
265
  let n = 0, r = e.length;
262
266
  for (;n < r; ) {
@@ -264,22 +268,22 @@ a), I = e => h(e.t(), e.o()), R = ({l: e, i: t, u: o, h: n, t: r, $: s, p: l, m:
264
268
  e[o] <= t ? n = o + 1 : r = o;
265
269
  }
266
270
  return n - 1;
267
- }, H = (e, t, o, n, r) => {
271
+ }, q = (e, t, o, n, r) => {
268
272
  const s = t.length;
269
273
  for (;o < s && t[o] < n; o++) {
270
274
  const n = t[o];
271
275
  n > r && (e.push(n), r = n);
272
276
  }
273
277
  return o;
274
- }, q = (e, t, o, n, r, s) => {
278
+ }, B = (e, t, o, n, r, s) => {
275
279
  const l = [];
276
280
  for (let e = 0; e < o; e++) l.push(e);
277
- const i = H(l, e, 0, n, o - 1);
281
+ const i = q(l, e, 0, n, o - 1);
278
282
  for (let e = n; e <= r; e++) l.push(e);
279
- H(l, e, i, s, r);
283
+ q(l, e, i, s, r);
280
284
  for (let e = s; e < t; e++) l.push(e);
281
285
  return l;
282
- }, B = (e, t) => d(e.rowIndex + (e.rowSpan || 1), t), P = (e, t) => d(e.colIndex + (e.colSpan || 1), t), V = (e, t, o, n, r, s) => {
286
+ }, P = (e, t) => d(e.rowIndex + (e.rowSpan || 1), t), Y = (e, t) => d(e.colIndex + (e.colSpan || 1), t), V = (e, t, o, n, r, s) => {
283
287
  const l = t.length, i = n.length;
284
288
  let c = "[l0]", f = 0, a = 0, u = 0;
285
289
  for (;f < s; ) {
@@ -289,12 +293,12 @@ a), I = e => h(e.t(), e.o()), R = ({l: e, i: t, u: o, h: n, t: r, $: s, p: l, m:
289
293
  if (h === f) {
290
294
  g = f + 1;
291
295
  const t = o[a];
292
- $ = null == t ? e.u(f) + "px" : t ? r : "minmax(" + e.u(f) + "px,auto)", a++;
293
- } else g = d(h, u < i ? n[u] : s), $ = "minmax(" + (e.i(g - 1) + e.u(g - 1) - e.i(f)) + "px,auto)";
296
+ $ = null == t ? e.m(f) + "px" : t ? r : "minmax(" + e.m(f) + "px,auto)", a++;
297
+ } else g = d(h, u < i ? n[u] : s), $ = "minmax(" + (e.i(g - 1) + e.m(g - 1) - e.i(f)) + "px,auto)";
294
298
  c += " " + $ + " [l" + g + "]", f = g;
295
299
  }
296
300
  return c;
297
- }, Y = (e, t, o, n, r) => {
301
+ }, X = (e, t, o, n, r) => {
298
302
  const s = {
299
303
  display: "grid",
300
304
  gridTemplateRows: "subgrid",
@@ -303,244 +307,250 @@ a), I = e => h(e.t(), e.o()), R = ({l: e, i: t, u: o, h: n, t: r, $: s, p: l, m:
303
307
  gridRow: "l" + e + "/l" + t
304
308
  };
305
309
  return null != o && (s.position = "sticky", s[n] = o + "px", s.zIndex = r), s;
306
- }, X = e => {
310
+ }, J = e => {
307
311
  let t;
308
312
  return {
309
- J(o) {
313
+ V(o) {
310
314
  (t || (t = new (x(y(o)).ResizeObserver)(e))).observe(o);
311
315
  },
312
- j(e) {
316
+ X(e) {
313
317
  t.unobserve(e);
314
318
  },
315
- D() {
319
+ J() {
316
320
  t && t.disconnect();
317
321
  }
318
322
  };
319
- }, J = (e, t, o, n, r, s, l) => {
320
- let i, c, f = 0, a = !1, u = !1, d = !1, h = !1;
321
- const g = Date.now, $ = n ? "scrollLeft" : "scrollTop", p = n ? "left" : "top", m = e => r ? -e : e, v = () => m(o[$]), z = (e, t) => {
322
- o.scrollTo({
323
- [p]: m(e),
323
+ }, j = (e, t, o, n, r, s, l, i) => {
324
+ let c, f, a = 0, u = !1, d = !1, h = !1, g = !1;
325
+ const $ = Date.now, p = r ? "scrollLeft" : "scrollTop", m = r ? "left" : "top", v = e => s ? -e : e, z = () => v(n[p]), y = (e, t) => {
326
+ n.scrollTo({
327
+ [m]: v(e),
324
328
  behavior: t ? "smooth" : "instant"
325
329
  });
326
- }, y = () => {
327
- if (a || u) return a = !1, void x();
328
- d = !1, e.A(2);
329
330
  }, x = () => {
330
- S(c), c = w(y, 150);
331
- }, I = () => {
332
- f = g(), d && (h = !0), l && e.A(6, l()), e.A(1, v()), x();
333
- }, R = t => {
334
- if (a || !e.O() || t.ctrlKey) return;
335
- const o = g() - f;
336
- 150 > o && 50 < o && (n ? t.deltaX : t.deltaY) && (a = !0);
337
- }, k = () => {
338
- u = !0, d = h = !1;
331
+ if (u || d) return u = !1, void b();
332
+ h = !1, e.h(2);
333
+ }, b = () => {
334
+ S(f), f = w(x, 150);
335
+ }, R = () => {
336
+ a = $(), h && (g = !0), i && e.h(7, i()), e.h(1, z()), b();
337
+ }, k = t => {
338
+ if (u || !e.O() || t.ctrlKey) return;
339
+ const o = $() - a;
340
+ 150 > o && 50 < o && (r ? t.deltaX : t.deltaY) && (u = !0);
339
341
  }, T = () => {
340
- u = !1, b() && (d = !0);
342
+ d = !0, h = g = !1;
343
+ }, O = () => {
344
+ d = !1, I() && (h = !0);
341
345
  };
342
- return t.addEventListener("scroll", I), t.addEventListener("wheel", R, {
346
+ return o.addEventListener("scroll", R), o.addEventListener("wheel", k, {
343
347
  passive: !0
344
- }), t.addEventListener("touchstart", k, {
348
+ }), o.addEventListener("touchstart", T, {
345
349
  passive: !0
346
- }), t.addEventListener("touchend", T, {
350
+ }), o.addEventListener("touchend", O, {
347
351
  passive: !0
348
352
  }), {
349
- G: I,
350
- D: () => {
351
- t.removeEventListener("scroll", I), t.removeEventListener("wheel", R), t.removeEventListener("touchstart", k),
352
- t.removeEventListener("touchend", T), S(c);
353
+ j: R,
354
+ J: () => {
355
+ o.removeEventListener("scroll", R), o.removeEventListener("wheel", k), o.removeEventListener("touchstart", T),
356
+ o.removeEventListener("touchend", O), S(f);
353
357
  },
354
- U: () => {
355
- const [t, n] = e.C();
358
+ D: () => {
359
+ const [t, o] = e.C();
356
360
  if (!t) return;
357
- h && s && s(), h = !1;
358
- const r = e.k(), l = r + t, c = e.M() + e.t() - e.o();
359
- l <= 0 || l >= c || r >= c ? z(l) : o.scrollBy({
360
- [p]: m(t),
361
+ g && l && l(), g = !1;
362
+ const r = e.T(), s = r + t, i = e.M() + e.t() - e.o();
363
+ s <= 0 || s >= i || r >= i ? y(s) : n.scrollBy({
364
+ [m]: v(t),
361
365
  behavior: "instant"
362
- }), n && (i && i(), e.o() > e.t() && e.A(1, v()));
366
+ }), o && (c && c(), e.o() > e.t() && e.h(1, z()));
363
367
  },
364
- F: (t, o) => {
365
- let n, r, s;
366
- i && i();
367
- const l = i = () => {
368
- n = !0, S(r), s && s();
369
- }, c = () => {
370
- if (!n) {
371
- if (e.o() && (S(r), r = w(l, 150)), o) {
372
- for (let [t, o] = e.l(0); t <= o; t++) if (e.I(t)) return;
373
- l();
368
+ G: (o, n) => {
369
+ let r, s, l;
370
+ c && c();
371
+ const i = c = () => {
372
+ r = !0, S(s), l && l();
373
+ }, f = () => {
374
+ if (!r) {
375
+ if (e.o() && (S(s), s = w(i, 150)), n) {
376
+ for (let [o, n] = e.$(0); o <= n; o++) if (t.A(o)) return;
377
+ i();
374
378
  }
375
- e.A(7), z(t(), o);
379
+ e.h(8), y(o(), n);
376
380
  }
377
381
  };
378
- o && e.A(8, t()), (() => {
379
- if (n) return;
382
+ n && e.h(9, o()), (() => {
383
+ if (r) return;
380
384
  let t;
381
- s = e.L(2, () => {
385
+ l = e.L(2, () => {
382
386
  t || (t = !0, _(() => {
383
- t = !1, c();
387
+ t = !1, f();
384
388
  }));
385
- }), c();
389
+ }), f();
386
390
  })();
387
391
  }
388
392
  };
389
- }, j = (e, t) => {
390
- let o, n, r = v(), s = !0;
391
- const l = /* @__PURE__ */ new WeakMap, i = X(r => {
392
- const i = [];
393
- for (const {target: c, contentRect: {width: f, height: a}} of r) if (c === o) f || a ? (s || n.G(),
394
- s = !0, e.A(4, t ? f : a)) : s = !1; else if (c.offsetParent) {
395
- const e = l.get(c);
396
- null != e && i.push([ e, t ? f : a ]);
393
+ }, D = (e, t, o) => {
394
+ let n, r, s = v(), l = !0;
395
+ const i = /* @__PURE__ */ new WeakMap, c = J(s => {
396
+ const c = [];
397
+ for (const {target: f, contentRect: {width: a, height: u}} of s) if (f === n) a || u ? (l || r.j(),
398
+ l = !0, e.h(4, o ? a : u)) : l = !1; else if (f.offsetParent) {
399
+ const e = i.get(f);
400
+ if (null != e) {
401
+ const n = o ? a : u;
402
+ t.A(e, n) || c.push([ e, n ]);
403
+ }
397
404
  }
398
- i.length && e.A(3, i);
405
+ e.h(3, c);
399
406
  });
400
407
  return {
401
- K(s, l = s.parentElement) {
402
- i.J(o = l), n = J(e, l, l, t, t && "rtl" === getComputedStyle(l).direction, () => {
403
- const e = t ? "overflowX" : "overflowY", o = l.style, n = o[e];
404
- o[e] = "hidden", w(() => {
405
- o[e] = n;
408
+ F(l, i = l.parentElement) {
409
+ c.V(n = i), r = j(e, t, i, i, o, o && "rtl" === getComputedStyle(i).direction, () => {
410
+ const e = o ? "overflowX" : "overflowY", t = i.style, n = t[e];
411
+ t[e] = "hidden", w(() => {
412
+ t[e] = n;
406
413
  });
407
- }), r[1](!0);
414
+ }), s[1](!0);
408
415
  },
409
- _() {
410
- i.D(), n && n.D(), r[1](!1), r = v();
416
+ R() {
417
+ c.J(), r && r.J(), s[1](!1), s = v();
411
418
  },
412
- N: (e, t) => (l.set(e, t), i.J(e), () => {
413
- l.delete(e), i.j(e);
419
+ K: (e, t) => (i.set(e, t), c.V(e), () => {
420
+ i.delete(e), c.X(e);
414
421
  }),
415
- async Z(e, t) {
416
- await r[0] && n.F(e, t);
422
+ async N(e, t) {
423
+ await s[0] && r.G(e, t);
417
424
  },
418
- ee() {
419
- n && n.U();
425
+ U() {
426
+ r && r.D();
420
427
  },
421
- te: e.M
428
+ Z: e.M
422
429
  };
423
- }, D = (e, t) => {
424
- let o, n, r, s, l, i = v();
425
- const c = /* @__PURE__ */ new WeakMap, f = X(n => {
426
- const r = [];
427
- for (const {target: e, contentRect: {width: s, height: i}} of n) if (e === o) l && l(); else if (e.offsetParent) {
428
- const o = c.get(e);
429
- null != o && r.push([ o, t ? s : i ]);
430
+ }, G = (e, t, o) => {
431
+ let n, r, s, l, i, c = v();
432
+ const f = /* @__PURE__ */ new WeakMap, a = J(r => {
433
+ const s = [];
434
+ for (const {target: e, contentRect: {width: l, height: c}} of r) if (e === n) i && i(); else if (e.offsetParent) {
435
+ const n = f.get(e);
436
+ if (null != n) {
437
+ const e = o ? l : c;
438
+ t.A(n, e) || s.push([ n, e ]);
439
+ }
430
440
  }
431
- r.length && e.A(3, r);
441
+ e.h(3, s);
432
442
  });
433
443
  return {
434
- K(c) {
435
- const a = y(c), u = x(a), d = o = a.scrollingElement, h = t && "rtl" === getComputedStyle(d).direction, g = (e, t, o, n, r = 0) => {
436
- const s = n ? "offsetLeft" : "offsetTop", l = r + (h ? t.clientWidth - e[s] - e.offsetWidth : e[s]), i = e.offsetParent;
437
- return e !== o && i ? g(i, t, o, n, l) : l;
438
- }, $ = s = () => g(c, d, a.body, t), p = l = () => {
439
- e.A(4, d[t ? "clientWidth" : "clientHeight"]);
444
+ F(f) {
445
+ const u = y(f), d = x(u), h = n = u.scrollingElement, g = o && "rtl" === getComputedStyle(h).direction, $ = (e, t, o, n, r = 0) => {
446
+ const s = n ? "offsetLeft" : "offsetTop", l = r + (g ? t.clientWidth - e[s] - e.offsetWidth : e[s]), i = e.offsetParent;
447
+ return e !== o && i ? $(i, t, o, n, l) : l;
448
+ }, p = l = () => $(f, h, u.body, o), m = i = () => {
449
+ e.h(4, h[o ? "clientWidth" : "clientHeight"]);
440
450
  };
441
- u.addEventListener("resize", p), f.J(d), r = () => {
442
- u.removeEventListener("resize", p);
443
- }, n = J(e, u, d, t, h, null, $), i[1](!0);
451
+ d.addEventListener("resize", m), a.V(h), s = () => {
452
+ d.removeEventListener("resize", m);
453
+ }, r = j(e, t, d, h, o, g, null, p), c[1](!0);
444
454
  },
445
- _() {
446
- r && r(), f.D(), n && n.D(), i[1](!1), i = v();
455
+ R() {
456
+ s && s(), a.J(), r && r.J(), c[1](!1), c = v();
447
457
  },
448
- N: (e, t) => (c.set(e, t), f.J(e), () => {
449
- c.delete(e), f.j(e);
458
+ K: (e, t) => (f.set(e, t), a.V(e), () => {
459
+ f.delete(e), a.X(e);
450
460
  }),
451
- async Z(e, t) {
452
- await i[0] && n.F(e, t);
461
+ async N(e, t) {
462
+ await c[0] && r.G(e, t);
453
463
  },
454
- ee() {
455
- n && n.U();
464
+ U() {
465
+ r && r.D();
456
466
  },
457
- te: () => s()
467
+ Z: () => l()
458
468
  };
459
- }, G = (e, t) => {
460
- let o, n, r, s = v(), l = !0;
461
- const i = /* @__PURE__ */ new WeakMap, c = /* @__PURE__ */ new WeakMap, f = X(s => {
462
- const f = [], a = [];
463
- for (const {target: u, contentRect: {width: d, height: h}} of s) if (u === o) d || h ? (l || (n.G(),
464
- r.G()), l = !0, e.A(4, h), t.A(4, d)) : l = !1; else if (u.offsetParent) {
465
- const e = i.get(u), t = c.get(u);
466
- null != e && f.push([ e, h ]), null != t && a.push([ t, d ]);
469
+ }, F = (e, t, o, n) => {
470
+ let r, s, l, i = v(), c = !0;
471
+ const f = /* @__PURE__ */ new WeakMap, a = /* @__PURE__ */ new WeakMap, u = J(i => {
472
+ const u = [], d = [];
473
+ for (const {target: h, contentRect: {width: g, height: $}} of i) if (h === r) g || $ ? (c || (s.j(),
474
+ l.j()), c = !0, e.h(4, $), t.h(4, g)) : c = !1; else if (h.offsetParent) {
475
+ const e = f.get(h), t = a.get(h);
476
+ null == e || o.A(e, $) || u.push([ e, $ ]), null == t || n.A(t, g) || d.push([ t, g ]);
467
477
  }
468
- f.length && e.A(3, f), a.length && t.A(3, a);
478
+ e.h(3, u), t.h(3, d);
469
479
  });
470
480
  return {
471
- async Z(e, t) {
472
- await s[0] && (e ? r : n).F(t);
481
+ async N(e, t) {
482
+ await i[0] && (e ? l : s).G(t);
473
483
  },
474
- K(l, i = l.parentElement) {
475
- f.J(o = i);
476
- const c = (e, t) => J(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
477
- const e = t ? "overflowX" : "overflowY", o = i.style, n = o[e];
478
- o[e] = "hidden", w(() => {
479
- o[e] = n;
484
+ F(c, f = c.parentElement) {
485
+ u.V(r = f);
486
+ const a = (e, t, o) => j(e, t, f, f, o, o && "rtl" === getComputedStyle(f).direction, () => {
487
+ const e = o ? "overflowX" : "overflowY", t = f.style, n = t[e];
488
+ t[e] = "hidden", w(() => {
489
+ t[e] = n;
480
490
  });
481
491
  });
482
- n = c(e, !1), r = c(t, !0), s[1](!0);
492
+ s = a(e, o, !1), l = a(t, n, !0), i[1](!0);
483
493
  },
484
- _() {
485
- f.D(), n && n.D(), r && r.D(), s[1](!1), s = v();
494
+ R() {
495
+ u.J(), s && s.J(), l && l.J(), i[1](!1), i = v();
486
496
  },
487
- N: (e, t, o) => (null != t && i.set(e, t), null != o && c.set(e, o), f.J(e), () => {
488
- i.delete(e), c.delete(e), f.j(e);
497
+ K: (e, t, o) => (null != t && f.set(e, t), null != o && a.set(e, o), u.V(e), () => {
498
+ f.delete(e), a.delete(e), u.X(e);
489
499
  }),
490
- ee() {
491
- n && n.U(), r && r.U();
500
+ U() {
501
+ s && s.D(), l && l.D();
492
502
  }
493
503
  };
494
- }, U = (e, t) => {
495
- e.Z(() => t);
496
- }, F = (e, t, o) => {
497
- U(e, o + t.k());
498
- }, K = (e, t, o, {align: n, smooth: r, offset: s = 0} = {}) => {
499
- if (o = p(o, 0, t.R() - 1), "nearest" === n) {
500
- const e = t.i(o), r = t.k();
501
- if (e < r) n = "start"; else {
502
- if (!(e + t.u(o) > r + t.o())) return;
503
- n = "end";
504
+ }, K = (e, t) => {
505
+ e.N(() => t);
506
+ }, N = (e, t, o) => {
507
+ K(e, o + t.T());
508
+ }, Q = (e, t, o, n, {align: r, smooth: s, offset: l = 0} = {}) => {
509
+ if (n = p(n, 0, o._() - 1), "nearest" === r) {
510
+ const e = t.i(n), s = t.T();
511
+ if (e < s) r = "start"; else {
512
+ if (!(e + o.m(n) > s + t.o())) return;
513
+ r = "end";
504
514
  }
505
515
  }
506
- e.Z(() => s + e.te() + t.i(o) + ("end" === n ? t.u(o) - t.o() : "center" === n ? (t.u(o) - t.o()) / 2 : 0), r);
507
- }, N = (e, t, o, n, r, s, l) => {
508
- const i = t.R(), c = o.P(), f = o.V();
516
+ e.N(() => l + e.Z() + t.i(n) + ("end" === r ? o.m(n) - t.o() : "center" === r ? (o.m(n) - t.o()) / 2 : 0), s);
517
+ }, U = (e, t, o, n, r, s, l) => {
518
+ const i = o._(), c = o.B(), f = o.P();
509
519
  r = p(r, 0, i - 1);
510
- const a = A(n, c, f), u = W(a, r, f), g = u < 0 ? -1 : a[u], $ = () => o.i(c) + (g < 0 || g === r ? 0 : o.i(g + 1) - o.i(g)), m = () => o.i(i) - o.i(f);
520
+ const a = W(n, c, f), u = H(a, r, f), g = u < 0 ? -1 : a[u], $ = () => o.i(c) + (g < 0 || g === r ? 0 : o.i(g + 1) - o.i(g)), m = () => o.i(i) - o.i(f);
511
521
  if ("nearest" === s) {
512
522
  if (r < c || r >= f) return;
513
- const e = $(), o = t.k() + e, n = t.o() - e - m(), l = t.u(r);
514
- let i = t.i(r);
523
+ const e = $(), n = t.T() + e, l = t.o() - e - m(), i = o.m(r);
524
+ let p = t.i(r);
515
525
  if (g === r) {
516
526
  const e = (u + 1 < a.length ? a[u + 1] : f) - 1;
517
- i = h(i, d(o, t.i(e) + t.u(e) - l));
527
+ p = h(p, d(n, t.i(e) + o.m(e) - i));
518
528
  }
519
- if (i < o) s = "start"; else {
520
- if (!(i + l > o + n)) return;
529
+ if (p < n) s = "start"; else {
530
+ if (!(p + i > n + l)) return;
521
531
  s = "end";
522
532
  }
523
533
  }
524
- e.Z(l, () => {
525
- const e = $(), o = t.u(r) - (t.o() - e - m());
526
- return t.i(r) - e + ("end" === s ? o : "center" === s ? o / 2 : 0);
534
+ e.N(l, () => {
535
+ const e = $(), n = o.m(r) - (t.o() - e - m());
536
+ return t.i(r) - e + ("end" === s ? n : "center" === s ? n / 2 : 0);
527
537
  });
528
- }, Q = z ? r : o, Z = "current", ee = (e, t) => {
529
- if (Array.isArray(e)) for (const o of e) ee(o, t); else null == e || "boolean" == typeof e || t.push(e);
530
- }, te = (e, t) => {
538
+ }, Z = z ? r : o, ee = "current", te = (e, t) => {
539
+ if (Array.isArray(e)) for (const o of e) te(o, t); else null == e || "boolean" == typeof e || t.push(e);
540
+ }, oe = (e, t) => {
531
541
  const o = e.key;
532
542
  return null != o ? o : "_" + t;
533
- }, oe = e => {
543
+ }, ne = e => {
534
544
  const t = i(null);
535
545
  return t.current || (t.current = e());
536
- }, ne = e => {
546
+ }, re = e => {
537
547
  const t = i(e);
538
- return Q(() => {
539
- t[Z] = e;
548
+ return Z(() => {
549
+ t[ee] = e;
540
550
  }, [ e ]), t;
541
- }, re = /*#__PURE__*/ t(({oe: e, ne: t, re: o, se: n, le: r, ie: l, ce: f, fe: a}) => {
551
+ }, se = /*#__PURE__*/ t(({ee: e, te: t, oe: o, ne: n, re: r, se: l, le: f, ie: a}) => {
542
552
  const u = i(null);
543
- Q(() => t(u[Z], o), [ o ]);
553
+ Z(() => t(u[ee], o), [ o ]);
544
554
  const d = s(() => {
545
555
  const e = {
546
556
  contain: "layout style",
@@ -563,93 +573,93 @@ a), I = e => h(e.t(), e.o()), R = ({l: e, i: t, u: o, h: n, t: r, $: s, p: l, m:
563
573
  index: o,
564
574
  children: e
565
575
  });
566
- }), se = (e, t) => s(() => {
576
+ }), le = (e, t) => s(() => {
567
577
  if ("function" == typeof e) return [ o => e(t[o], o), t.length ];
568
578
  const o = (e => {
569
579
  const t = [];
570
- return ee(e, t), t;
580
+ return te(e, t), t;
571
581
  })(e);
572
582
  return [ e => o[e], o.length ];
573
- }, [ 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, onResize: z}, y) => {
583
+ }, [ e, t ]), ie = /*#__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, onResize: z}, y) => {
574
584
  "use no memo";
575
- const [x, b] = se(e, t), k = i(null), T = i(!!g), M = ne(S), E = ne(v), C = ne(z), [L, A, W, H] = oe(() => {
576
- const e = !!a, t = O(b, r, d), o = R(t, g);
577
- return [ o, t, j(o, e), e ];
585
+ const [x, I] = le(e, t), R = i(null), T = i(!!g), O = re(S), C = re(v), E = re(z), [L, A, W, H] = ne(() => {
586
+ const e = !!a, t = M(I, r, d), o = k(t, g);
587
+ return [ o, t, D(o, t, e), e ];
578
588
  });
579
- b !== L.R() && L.A(5, [ b, s ]), h !== L.M() && L.A(6, h);
580
- const [q, B] = l(L.v, void 0, L.v), P = L.O(), V = L.t(), Y = [], X = e => {
589
+ L.h(5, I, s), h !== L.M() && L.h(7, h);
590
+ const [q, B] = l(L.k, void 0, L.k), P = L.O(), Y = L.t(), V = [], X = e => {
581
591
  const t = x(e);
582
592
  /* @__PURE__ */
583
- return c(re, {
584
- ne: W.N,
585
- re: e,
586
- se: L.i(e),
587
- le: L.I(e),
588
- ie: p,
589
- oe: t,
590
- ce: H,
591
- fe: T[Z]
592
- }, te(t, e));
593
+ return c(se, {
594
+ te: W.K,
595
+ oe: e,
596
+ ne: L.i(e),
597
+ re: A.A(e),
598
+ se: p,
599
+ ee: t,
600
+ le: H,
601
+ ie: T[ee]
602
+ }, oe(t, e));
593
603
  };
594
- if (Q(() => {
595
- T[Z] = !1, L.L(1, e => {
604
+ if (Z(() => {
605
+ T[ee] = !1, L.L(1, e => {
596
606
  e ? f(B) : B();
597
607
  }), L.L(4, () => {
598
- M.current && M.current(L.k());
608
+ O.current && O.current(L.T());
599
609
  }), L.L(8, () => {
600
- E.current && E.current();
601
- }), L.L(2, () => {
602
610
  C.current && C.current();
611
+ }), L.L(2, () => {
612
+ E.current && E.current();
603
613
  });
604
- const e = k[Z];
614
+ const e = R[ee];
605
615
  return w ? _(() => {
606
- w.current && W.K(e, w[Z]);
607
- }) : W.K(e), () => {
608
- L._(), W._();
616
+ w.current && W.F(e, w[ee]);
617
+ }) : W.F(e), () => {
618
+ L.R(), W.R();
609
619
  };
610
- }, []), Q(() => {
611
- W.ee();
620
+ }, []), Z(() => {
621
+ W.U();
612
622
  }, [ q ]), n(y, () => ({
613
623
  get cache() {
614
- return A.H();
624
+ return A.W();
615
625
  },
616
626
  get scrollOffset() {
617
- return L.k();
627
+ return L.T();
618
628
  },
619
629
  get scrollSize() {
620
- return I(L);
630
+ return b(L);
621
631
  },
622
632
  get viewportSize() {
623
633
  return L.o();
624
634
  },
625
- findItemIndex: e => A.W(e - L.M()),
635
+ findItemIndex: e => A.p(e - L.M()),
626
636
  getItemOffset: L.i,
627
- getItemSize: L.u,
628
- scrollToIndex: (e, t) => K(W, L, e, t),
629
- scrollTo: e => U(W, e),
630
- scrollBy: e => F(W, L, e)
637
+ getItemSize: A.m,
638
+ scrollToIndex: (e, t) => Q(W, L, A, e, t),
639
+ scrollTo: e => K(W, e),
640
+ scrollBy: e => N(W, L, e)
631
641
  }), []), u) {
632
642
  const e = new Set(u);
633
- for (let [t, n] = L.l(o); t <= n; t++) e.add(t);
643
+ for (let [t, n] = L.$(o); t <= n; t++) e.add(t);
634
644
  m([ ...e ]).forEach(e => {
635
- e < b && Y.push(X(e));
645
+ e < I && V.push(X(e));
636
646
  });
637
- } else for (let [e, t] = L.l(o); e <= t; e++) Y.push(X(e));
647
+ } else for (let [e, t] = L.$(o); e <= t; e++) V.push(X(e));
638
648
  /* @__PURE__ */
639
649
  return c($, {
640
- ref: k,
650
+ ref: R,
641
651
  style: {
642
652
  contain: "size style",
643
653
  overflowAnchor: "none",
644
654
  flex: "none",
645
655
  position: "relative",
646
- width: H ? V : "100%",
647
- height: H ? "100%" : V,
656
+ width: H ? Y : "100%",
657
+ height: H ? "100%" : Y,
648
658
  pointerEvents: P ? "none" : void 0
649
659
  },
650
- children: Y
660
+ children: V
651
661
  });
652
- }), ie = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: n, shift: r, horizontal: s, keepMounted: l, cache: i, ssrCount: f, item: a, onScroll: u, onScrollEnd: d, onResize: h, style: g, ...$}, p) => /* @__PURE__ */ c("div", {
662
+ }), ce = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: n, shift: r, horizontal: s, keepMounted: l, cache: i, ssrCount: f, item: a, onScroll: u, onScrollEnd: d, onResize: h, style: g, ...$}, p) => /* @__PURE__ */ c("div", {
653
663
  ...$,
654
664
  style: {
655
665
  display: "block",
@@ -659,7 +669,7 @@ a), I = e => h(e.t(), e.o()), R = ({l: e, i: t, u: o, h: n, t: r, $: s, p: l, m:
659
669
  height: "100%",
660
670
  ...g
661
671
  },
662
- children: /* @__PURE__ */ c(le, {
672
+ children: /* @__PURE__ */ c(ie, {
663
673
  ref: p,
664
674
  data: t,
665
675
  bufferSize: o,
@@ -675,53 +685,53 @@ a), I = e => h(e.t(), e.o()), R = ({l: e, i: t, u: o, h: n, t: r, $: s, p: l, m:
675
685
  onResize: h,
676
686
  children: e
677
687
  })
678
- })), ce = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: r, shift: s, horizontal: a, cache: u, ssrCount: d, as: h = "div", item: g = "div", onScroll: $, onScrollEnd: p, onResize: m}, w) => {
688
+ })), fe = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: r, shift: s, horizontal: a, cache: u, ssrCount: d, as: h = "div", item: g = "div", onScroll: $, onScrollEnd: p, onResize: m}, w) => {
679
689
  "use no memo";
680
- const [S, _] = se(e, t), v = i(null), z = ne($), y = ne(p), x = ne(m), b = i(!!d), [I, k, T, M] = oe(() => {
681
- const e = !!a, t = O(_, r, u), o = R(t, d);
682
- return [ o, t, D(o, e), e ];
690
+ const [S, _] = le(e, t), v = i(null), z = re($), y = re(p), x = re(m), I = i(!!d), [b, R, T, O] = ne(() => {
691
+ const e = !!a, t = M(_, r, u), o = k(t, d);
692
+ return [ o, t, G(o, t, e), e ];
683
693
  });
684
- _ !== I.R() && I.A(5, [ _, s ]);
685
- const [E, C] = l(I.v, void 0, I.v), L = I.O(), A = I.t(), W = [];
686
- Q(() => (b[Z] = !1, I.L(1, e => {
687
- e ? f(C) : C();
688
- }), I.L(4, () => {
694
+ b.h(5, _, s);
695
+ const [C, E] = l(b.k, void 0, b.k), L = b.O(), A = b.t(), W = [];
696
+ Z(() => (I[ee] = !1, b.L(1, e => {
697
+ e ? f(E) : E();
698
+ }), b.L(4, () => {
689
699
  z.current && z.current();
690
- }), I.L(8, () => {
700
+ }), b.L(8, () => {
691
701
  y.current && y.current();
692
- }), I.L(2, () => {
702
+ }), b.L(2, () => {
693
703
  x.current && x.current();
694
- }), T.K(v[Z]), () => {
695
- I._(), T._();
696
- }), []), Q(() => {
697
- T.ee();
698
- }, [ E ]), n(w, () => ({
704
+ }), T.F(v[ee]), () => {
705
+ b.R(), T.R();
706
+ }), []), Z(() => {
707
+ T.U();
708
+ }, [ C ]), n(w, () => ({
699
709
  get cache() {
700
- return k.H();
710
+ return R.W();
701
711
  },
702
712
  get scrollOffset() {
703
- return I.k();
713
+ return b.T();
704
714
  },
705
715
  get viewportSize() {
706
- return I.o();
716
+ return b.o();
707
717
  },
708
- findItemIndex: e => k.W(e - I.M()),
709
- getItemOffset: I.i,
710
- getItemSize: I.u,
711
- scrollToIndex: (e, t) => K(T, I, e, t)
718
+ findItemIndex: e => R.p(e - b.M()),
719
+ getItemOffset: b.i,
720
+ getItemSize: R.m,
721
+ scrollToIndex: (e, t) => Q(T, b, R, e, t)
712
722
  }), []);
713
- for (let [e, t] = I.l(o); e <= t; e++) {
723
+ for (let [e, t] = b.$(o); e <= t; e++) {
714
724
  const t = S(e);
715
- W.push(/* @__PURE__ */ c(re, {
716
- ne: T.N,
717
- re: e,
718
- se: I.i(e),
719
- le: I.I(e),
720
- ie: g,
721
- oe: t,
722
- ce: M,
723
- fe: b[Z]
724
- }, te(t, e)));
725
+ W.push(/* @__PURE__ */ c(se, {
726
+ te: T.K,
727
+ oe: e,
728
+ ne: b.i(e),
729
+ re: R.A(e),
730
+ se: g,
731
+ ee: t,
732
+ le: O,
733
+ ie: I[ee]
734
+ }, oe(t, e)));
725
735
  }
726
736
  /* @__PURE__ */
727
737
  return c(h, {
@@ -731,16 +741,16 @@ a), I = e => h(e.t(), e.o()), R = ({l: e, i: t, u: o, h: n, t: r, $: s, p: l, m:
731
741
  overflowAnchor: "none",
732
742
  flex: "none",
733
743
  position: "relative",
734
- width: M ? A : "100%",
735
- height: M ? "100%" : A,
744
+ width: O ? A : "100%",
745
+ height: O ? "100%" : A,
736
746
  pointerEvents: L ? "none" : void 0
737
747
  },
738
748
  children: W
739
749
  });
740
- }), fe = /*#__PURE__*/ t(({ae: {ue: e, de: t, he: o, ge: n, $e: r, pe: s, me: l, we: f}, oe: a, Se: u, _e: d, ve: h, ne: g}) => {
750
+ }), ae = /*#__PURE__*/ t(({ce: {fe: e, ae: t, ue: o, de: n, he: r, ge: s, $e: l, pe: f}, ee: a, me: u, we: d, Se: h, te: g}) => {
741
751
  const $ = i(null);
742
- return Q(() => {
743
- if (null != n || null != r) return g($[Z], n, r);
752
+ return Z(() => {
753
+ if (null != n || null != r) return g($[ee], n, r);
744
754
  }, [ n, r, g ]), /* @__PURE__ */ c("div", {
745
755
  ref: $,
746
756
  role: s,
@@ -754,34 +764,34 @@ a), I = e => h(e.t(), e.o()), R = ({l: e, i: t, u: o, h: n, t: r, $: s, p: l, m:
754
764
  colIndex: e
755
765
  })
756
766
  });
757
- }), ae = /*#__PURE__*/ t(({ae: {ze: e, ye: t, we: o}, oe: n, Se: r, xe: s, ne: l}) => /* @__PURE__ */ c("div", {
767
+ }), ue = /*#__PURE__*/ t(({ce: {_e: e, ve: t, pe: o}, ee: n, me: r, ze: s, te: l}) => /* @__PURE__ */ c("div", {
758
768
  role: "row",
759
769
  "aria-rowindex": e + 1,
760
770
  style: o,
761
- children: t.map(t => /* @__PURE__ */ c(fe, {
762
- ae: t,
763
- oe: n,
764
- Se: r,
765
- _e: E(s, t.ue),
766
- ve: e,
767
- ne: l
768
- }, t.ue))
769
- })), ue = ({ae: {be: e, we: t}, oe: o, Ie: n, xe: r, ne: s}) => /* @__PURE__ */ c("div", {
771
+ children: t.map(t => /* @__PURE__ */ c(ae, {
772
+ ce: t,
773
+ ee: n,
774
+ me: r,
775
+ we: E(s, t.fe),
776
+ Se: e,
777
+ te: l
778
+ }, t.fe))
779
+ })), de = ({ce: {ye: e, pe: t}, ee: o, xe: n, ze: r, te: s}) => /* @__PURE__ */ c("div", {
770
780
  role: "rowgroup",
771
781
  style: t,
772
- children: e.map(e => /* @__PURE__ */ c(ae, {
773
- ae: e,
774
- oe: o,
775
- Se: E(n, e.ze),
776
- xe: r,
777
- ne: s
778
- }, e.ze))
779
- }), de = /*#__PURE__*/ e(({children: e, rows: t, cols: o, rowHeight: r, colWidth: a, headerRows: g, sectionRows: $, footerRows: w, headerCols: S, footerCols: v, spans: z, keepMounted: y, bufferSize: x, gap: b = 0, ariaSort: k, onVerticalScroll: T, onHorizontalScroll: O, onScrollEnd: H, onResize: X, style: J, ...j}, D) => {
782
+ children: e.map(e => /* @__PURE__ */ c(ue, {
783
+ ce: e,
784
+ ee: o,
785
+ me: E(n, e._e),
786
+ ze: r,
787
+ te: s
788
+ }, e._e))
789
+ }), he = /*#__PURE__*/ e(({children: e, rows: t, cols: o, rowHeight: r, colWidth: a, headerRows: g, sectionRows: $, footerRows: w, headerCols: S, footerCols: v, spans: z, keepMounted: y, bufferSize: x, gap: I = 0, ariaSort: T, onVerticalScroll: O, onHorizontalScroll: M, onScrollEnd: q, onResize: J, style: j, ...D}, G) => {
780
790
  "use no memo";
781
- const U = i(null), F = ne(T), K = ne(O), ee = ne(H), te = ne(X), [re, se, le, ie, ce] = oe(() => {
782
- const e = C(t, r, b), n = C(o, a, b), s = R(e), l = R(n);
783
- return [ s, l, e, n, G(s, l) ];
784
- }), fe = s(() => le.Y(t, r), [ t, r ]), de = s(() => ie.Y(o, a), [ o, a ]), he = s(() => ((e = u) => {
791
+ const K = i(null), N = re(O), Q = re(M), te = re(q), oe = re(J), [se, le, ie, ce, fe] = ne(() => {
792
+ const e = L(t, r, I), n = L(o, a, I), s = k(e), l = k(n);
793
+ return [ s, l, e, n, F(s, l, e, n) ];
794
+ }), ae = s(() => ie.Y(t, r), [ t, r ]), he = s(() => ce.Y(o, a), [ o, a ]), ge = s(() => ((e = u) => {
785
795
  const t = /* @__PURE__ */ new Map;
786
796
  for (const o of e) {
787
797
  const e = o.rowIndex + (o.rowSpan || 1);
@@ -792,79 +802,78 @@ a), I = e => h(e.t(), e.o()), R = ({l: e, i: t, u: o, h: n, t: r, $: s, p: l, m:
792
802
  }
793
803
  return t;
794
804
  })(z), [ z ]);
795
- le.B(g, w), ie.B(S, v);
796
- const ge = M(t), $e = M(o);
797
- ge !== re.R() && re.A(5, [ ge ]), $e !== se.R() && se.A(5, [ $e ]), re.A(9, le.X(fe, re.T())),
798
- se.A(9, ie.X(de, se.T()));
799
- const pe = () => re.v() + se.v(), [me, we] = l(pe, void 0, pe), Se = re.O() || se.O(), _e = re.i(0), ve = se.i(0), ze = re.R(), ye = se.R(), xe = ((e, t, [o, n], [r, s], l, i = u, c = u, f) => {
800
- const a = e.$(), g = t.$(), $ = e.P(), w = e.V(), S = t.P(), _ = t.V();
805
+ ie.q(g, w), ce.q(S, v);
806
+ const $e = C(t), pe = C(o);
807
+ se.h(5, $e), le.h(5, pe), R(se, ie, ae), R(le, ce, he);
808
+ const me = () => se.k() + le.k(), [we, Se] = l(me, void 0, me), _e = se.O() || le.O(), ve = se.i(0), ze = le.i(0), ye = ie._(), xe = ce._(), Ie = ((e, t, [o, n], [r, s], l, i = u, c = u, f) => {
809
+ const a = e._(), g = t._(), $ = e.B(), w = e.P(), S = t.B(), _ = t.P();
801
810
  o = p(o, $, w), n = d(n, w - 1), r = p(r, S, _), s = d(s, _ - 1);
802
- const v = A(i, $, w), z = h(S - 1, 0), y = [], x = [], b = [];
803
- for (const e of c) e.rowIndex < a && e.colIndex < g && (b.push(e), y.push(e.rowIndex));
804
- const I = b.length, R = W(v, o, w), k = R < 0 ? -1 : v[R];
811
+ const v = W(i, $, w), z = h(S - 1, 0), y = [], x = [], I = [];
812
+ for (const e of c) e.rowIndex < a && e.colIndex < g && (I.push(e), y.push(e.rowIndex));
813
+ const b = I.length, R = H(v, o, w), k = R < 0 ? -1 : v[R];
805
814
  k >= 0 && y.push(k);
806
- const T = q(m(y), a, $, o, n, w);
815
+ const T = B(m(y), a, $, o, n, w);
807
816
  for (let e = 0; e < T.length; e++) for (const t of l.get(T[e]) || u) {
808
- const {rowIndex: l, colIndex: i} = t, c = B(t, a), f = P(t, g);
817
+ const {rowIndex: l, colIndex: i} = t, c = P(t, a), f = Y(t, g);
809
818
  if ((e < 1 || T[e - 1] < l) && i < g && (c - l > 1 || f - i > 1)) {
810
819
  let e = (l < $ || h(l, o) < d(c, n + 1) || w < c || k >= l && k < c) && (i < S || h(i, r) < d(f, s + 1) || _ < f);
811
- for (let t = 0; !e && t < I; t++) {
812
- const o = b[t];
820
+ for (let t = 0; !e && t < b; t++) {
821
+ const o = I[t];
813
822
  e = o.rowIndex >= l && o.rowIndex < c && o.colIndex >= i && o.colIndex < f;
814
823
  }
815
- e && b.push(t);
824
+ e && I.push(t);
816
825
  }
817
826
  }
818
- for (const {rowIndex: e, colIndex: t} of b) {
819
- const o = W(v, e, w);
827
+ for (const {rowIndex: e, colIndex: t} of I) {
828
+ const o = H(v, e, w);
820
829
  y.push(e), o >= 0 && y.push(v[o]), x.push(t);
821
830
  }
822
831
  m(y), m(x);
823
- 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 = [];
824
- for (const e of b) {
825
- const t = B(e, a), o = P(e, g);
826
- X.push(t), J.push(o);
832
+ const O = B(y, a, $, o, n, w), M = B(x, g, S, r, s, _), C = O.length, E = M.length, L = /* @__PURE__ */ new Map, q = [], J = [];
833
+ for (const e of I) {
834
+ const t = P(e, a), o = Y(e, g);
835
+ q.push(t), J.push(o);
827
836
  const n = M.indexOf(e.colIndex);
828
- for (let r = O.indexOf(e.rowIndex); r < E && O[r] < t; r++) {
837
+ for (let r = O.indexOf(e.rowIndex); r < C && O[r] < t; r++) {
829
838
  const t = O[r] * g;
830
- for (let r = n; r < C && M[r] < o; r++) H.set(t + M[r], e);
839
+ for (let r = n; r < E && M[r] < o; r++) L.set(t + M[r], e);
831
840
  }
832
841
  }
833
842
  const j = [];
834
- for (const e of M) j.push(!t.q(e) && null);
835
- const D = [], G = e.i($), U = [];
836
- let F = U;
837
- const K = L.get(e), N = /* @__PURE__ */ new Map;
843
+ for (const e of M) j.push(!t.H(e) && null);
844
+ const D = [], G = e.i($), F = [];
845
+ let K = F;
846
+ const N = A.get(e), Q = /* @__PURE__ */ new Map;
838
847
  for (const l of O) {
839
- const i = l < $, c = l >= w, u = W(v, l, w), d = i ? 0 : c ? w : u < 0 ? -1 : v[u];
848
+ const i = l < $, c = l >= w, u = H(v, l, w), d = i ? 0 : c ? w : u < 0 ? -1 : v[u];
840
849
  if (l === d) {
841
850
  const e = i ? $ : c ? a : u + 1 < v.length ? v[u + 1] : w;
842
- X.push(e);
851
+ q.push(e);
843
852
  const t = [];
844
- U.push({
845
- Re: i ? -1 : c ? -2 : -3 - d,
846
- be: t,
847
- we: Y(d, e, i || c ? 0 : null, c ? "bottom" : "top", 4)
848
- }), F = t;
849
- } else d < 0 && (F = U);
850
- const p = u >= 0 && l === d, m = i || c || l === k || l >= o && l <= n, y = p ? G : null, x = l * g, b = K && K.get(l), I = b && b.ye, R = [];
851
- let T = 0, O = !e.q(l) && null, E = l + 1, L = !1;
852
- for (let e = 0; e < C; e++) {
853
- const o = M[e], n = o < S, c = o >= _, u = n || c || o >= r && o <= s, d = H.get(x + o);
853
+ F.push({
854
+ Ie: i ? -1 : c ? -2 : -3 - d,
855
+ ye: t,
856
+ pe: X(d, e, i || c ? 0 : null, c ? "bottom" : "top", 4)
857
+ }), K = t;
858
+ } else d < 0 && (K = F);
859
+ const p = u >= 0 && l === d, m = i || c || l === k || l >= o && l <= n, y = p ? G : null, x = l * g, I = N && N.get(l), b = I && I.ve, R = [];
860
+ let T = 0, O = !e.H(l) && null, C = l + 1, A = !1;
861
+ for (let e = 0; e < E; e++) {
862
+ const o = M[e], n = o < S, c = o >= _, u = n || c || o >= r && o <= s, d = L.get(x + o);
854
863
  if (d ? d.rowIndex === l && d.colIndex === o : m && u) {
855
- 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;
864
+ const r = d ? P(d, a) : l + 1, s = d ? Y(d, g) : o + 1, u = r - l, $ = s - o, m = u > 1, w = $ > 1, S = m || w;
856
865
  let _, v;
857
- E = h(E, r);
866
+ C = h(C, r);
858
867
  const y = n ? t.i(o) : null, x = c ? t.i(g) - t.i(s) : null;
859
868
  !1 !== O || m || (_ = l, O = !0), !1 !== j[e] || w || (v = o, j[e] = !0);
860
- const b = i ? "columnheader" : o === z && (n || p) ? "rowheader" : "cell", k = S ? u : void 0, M = S ? $ : void 0, C = "cell" !== b && f && f.rowIndex === l && f.colIndex === o ? f.order : void 0;
861
- let A;
862
- if (I) {
863
- const e = I.length;
864
- for (;T < e && I[T].ue < o; ) T++;
865
- T < e && I[T].ue === o && (A = I[T]);
869
+ const I = i ? "columnheader" : o === z && (n || p) ? "rowheader" : "cell", k = S ? u : void 0, M = S ? $ : void 0, E = "cell" !== I && f && f.rowIndex === l && f.colIndex === o ? f.order : void 0;
870
+ let L;
871
+ if (b) {
872
+ const e = b.length;
873
+ for (;T < e && b[T].fe < o; ) T++;
874
+ T < e && b[T].fe === o && (L = b[T]);
866
875
  }
867
- if (!A || A.de !== k || A.he !== M || A.ke !== y || A.Te !== x || A.ge !== _ || A.$e !== v || A.pe !== b || A.me !== C) {
876
+ if (!L || L.ae !== k || L.ue !== M || L.be !== y || L.Re !== x || L.de !== _ || L.he !== v || L.ge !== I || L.$e !== E) {
868
877
  let e = "1/l" + o;
869
878
  S && (e += "/l" + r + "/l" + s);
870
879
  const t = {
@@ -874,150 +883,150 @@ a), I = e => h(e.t(), e.o()), R = ({l: e, i: t, u: o, h: n, t: r, $: s, p: l, m:
874
883
  };
875
884
  m && (t.height = "0px", t.minHeight = "100%", t.zIndex = 1), w && (t.width = "0px",
876
885
  t.minWidth = "100%"), (n || c) && (t[n ? "insetInlineStart" : "insetInlineEnd"] = (n ? y : x) + "px",
877
- t.position = "sticky", t.zIndex = 2), A = {
878
- ue: o,
879
- de: k,
880
- he: M,
881
- ge: _,
882
- $e: v,
883
- pe: b,
884
- me: C,
885
- we: t,
886
- ke: y,
887
- Te: x
888
- }, L = !0;
886
+ t.position = "sticky", t.zIndex = 2), L = {
887
+ fe: o,
888
+ ae: k,
889
+ ue: M,
890
+ de: _,
891
+ he: v,
892
+ ge: I,
893
+ $e: E,
894
+ pe: t,
895
+ be: y,
896
+ Re: x
897
+ }, A = !0;
889
898
  }
890
- R.push(A);
899
+ R.push(L);
891
900
  }
892
901
  }
893
902
  if (D.push(O), R.length) {
894
- const e = b && !L && b.ye.length === R.length && b.Oe === y ? b : {
895
- ze: l,
896
- ye: R,
897
- we: Y(l, E, y, "top", 3),
898
- Oe: y
903
+ const e = I && !A && I.ve.length === R.length && I.ke === y ? I : {
904
+ _e: l,
905
+ ve: R,
906
+ pe: X(l, C, y, "top", 3),
907
+ ke: y
899
908
  };
900
- N.set(l, e), F.push(e);
909
+ Q.set(l, e), K.push(e);
901
910
  }
902
911
  }
903
- return L.set(e, N), {
904
- Me: V(e, O, D, m(X), "max-content", a),
905
- Ee: V(t, M, j, m(J), "minmax(max-content,auto)", g),
906
- Ce: U
912
+ return A.set(e, Q), {
913
+ Te: V(e, O, D, m(q), "max-content", a),
914
+ Oe: V(t, M, j, m(J), "minmax(max-content,auto)", g),
915
+ Me: F
907
916
  };
908
- })(le, ie, re.l(x), se.l(x), he, $, y, k), be = ne(e => ((e, t, o, n, r, s = u, {rowIndex: l, colIndex: i, rowAlign: c, colAlign: f}) => {
909
- null != l && N(e, t, n, s, l, c, !1), null != i && N(e, o, r, u, i, f, !0);
910
- })(ce, re, se, le, ie, $, e));
911
- return Q(() => {
917
+ })(ie, ce, se.$(x), le.$(x), ge, $, y, T), be = re(e => ((e, t, o, n, r, s = u, {rowIndex: l, colIndex: i, rowAlign: c, colAlign: f}) => {
918
+ null != l && U(e, t, n, s, l, c, !1), null != i && U(e, o, r, u, i, f, !0);
919
+ })(fe, se, le, ie, ce, $, e));
920
+ return Z(() => {
912
921
  const e = e => {
913
- e ? f(we) : we();
922
+ e ? f(Se) : Se();
914
923
  };
915
- re.L(1, e), se.L(1, e);
924
+ se.L(1, e), le.L(1, e);
916
925
  let t = !1;
917
- re.L(4, () => {
918
- t = !0, F.current && F.current(re.k());
919
- }), se.L(4, () => {
920
- t = !0, K.current && K.current(se.k());
926
+ se.L(4, () => {
927
+ t = !0, N.current && N.current(se.T());
928
+ }), le.L(4, () => {
929
+ t = !0, Q.current && Q.current(le.T());
921
930
  });
922
931
  const o = () => {
923
- !t || re.O() || se.O() || (t = !1, ee.current && ee.current());
932
+ !t || se.O() || le.O() || (t = !1, te.current && te.current());
924
933
  };
925
934
  let n;
926
- re.L(8, o), se.L(8, o);
935
+ se.L(8, o), le.L(8, o);
927
936
  const r = () => {
928
937
  n || (n = !0, _(() => {
929
- n = !1, te.current && te.current();
938
+ n = !1, oe.current && oe.current();
930
939
  }));
931
940
  };
932
- return re.L(2, r), se.L(2, r), ce.K(U[Z]), () => {
933
- re._(), se._(), ce._();
941
+ return se.L(2, r), le.L(2, r), fe.F(K[ee]), () => {
942
+ se.R(), le.R(), fe.R();
934
943
  };
935
- }, []), Q(() => {
936
- ce.ee();
937
- }, [ me ]), n(D, () => ({
944
+ }, []), Z(() => {
945
+ fe.U();
946
+ }, [ we ]), n(G, () => ({
938
947
  get verticalScrollOffset() {
939
- return re.k();
948
+ return se.T();
940
949
  },
941
950
  get horizontalScrollOffset() {
942
- return se.k();
951
+ return le.T();
943
952
  },
944
953
  get scrollHeight() {
945
- return I(re);
954
+ return b(se);
946
955
  },
947
956
  get scrollWidth() {
948
- return I(se);
957
+ return b(le);
949
958
  },
950
959
  get viewportHeight() {
951
- return re.o();
960
+ return se.o();
952
961
  },
953
962
  get viewportWidth() {
954
- return se.o();
963
+ return le.o();
955
964
  },
956
- findRowIndex: le.W,
957
- findColIndex: ie.W,
958
- getRowOffset: re.i,
959
- getColOffset: se.i,
960
- getRowSize: re.u,
961
- getColSize: se.u,
962
- scrollToIndex: e => be[Z](e),
965
+ findRowIndex: ie.p,
966
+ findColIndex: ce.p,
967
+ getRowOffset: se.i,
968
+ getColOffset: le.i,
969
+ getRowSize: ie.m,
970
+ getColSize: ce.m,
971
+ scrollToIndex: e => be[ee](e),
963
972
  scrollTo: ({vertical: e, horizontal: t}) => ((e, t, o) => {
964
- null != t && e.Z(!1, () => t), null != o && e.Z(!0, () => o);
965
- })(ce, e, t),
973
+ null != t && e.N(!1, () => t), null != o && e.N(!0, () => o);
974
+ })(fe, e, t),
966
975
  scrollBy: ({vertical: e, horizontal: t}) => ((e, t, o, n, r) => {
967
976
  if (null != n) {
968
- const o = n + t.k();
969
- e.Z(!1, () => o);
977
+ const o = n + t.T();
978
+ e.N(!1, () => o);
970
979
  }
971
980
  if (null != r) {
972
- const t = r + o.k();
973
- e.Z(!0, () => t);
981
+ const t = r + o.T();
982
+ e.N(!0, () => t);
974
983
  }
975
- })(ce, re, se, e, t)
984
+ })(fe, se, le, e, t)
976
985
  }), []), /* @__PURE__ */ c("div", {
977
986
  role: "table",
978
- "aria-rowcount": ze,
979
- "aria-colcount": ye,
980
- ...j,
987
+ "aria-rowcount": ye,
988
+ "aria-colcount": xe,
989
+ ...D,
981
990
  style: {
982
991
  overflow: "auto",
983
992
  contain: "strict",
984
993
  width: "100%",
985
994
  height: "100%",
986
- ...J
995
+ ...j
987
996
  },
988
997
  children: /* @__PURE__ */ c("div", {
989
- ref: U,
998
+ ref: K,
990
999
  style: {
991
1000
  contain: "size style",
992
1001
  overflowAnchor: "none",
993
1002
  flex: "none",
994
1003
  display: "grid",
995
- gridTemplateRows: xe.Me,
996
- gridTemplateColumns: xe.Ee,
997
- gap: b,
998
- marginTop: _e,
999
- marginInlineStart: ve,
1000
- height: I(re) - _e,
1001
- pointerEvents: Se ? "none" : void 0
1004
+ gridTemplateRows: Ie.Te,
1005
+ gridTemplateColumns: Ie.Oe,
1006
+ gap: I,
1007
+ marginTop: ve,
1008
+ marginInlineStart: ze,
1009
+ height: b(se) - ve,
1010
+ pointerEvents: _e ? "none" : void 0
1002
1011
  },
1003
- children: xe.Ce.map(n => "be" in n ? /* @__PURE__ */ c(ue, {
1004
- ae: n,
1005
- oe: e,
1006
- Ie: t,
1007
- xe: o,
1008
- ne: ce.N
1009
- }, n.Re) : /* @__PURE__ */ c(ae, {
1010
- ae: n,
1011
- oe: e,
1012
- Se: E(t, n.ze),
1013
- xe: o,
1014
- ne: ce.N
1015
- }, n.ze))
1012
+ children: Ie.Me.map(n => "ye" in n ? /* @__PURE__ */ c(de, {
1013
+ ce: n,
1014
+ ee: e,
1015
+ xe: t,
1016
+ ze: o,
1017
+ te: fe.K
1018
+ }, n.Ie) : /* @__PURE__ */ c(ue, {
1019
+ ce: n,
1020
+ ee: e,
1021
+ me: E(t, n._e),
1022
+ ze: o,
1023
+ te: fe.K
1024
+ }, n._e))
1016
1025
  })
1017
1026
  });
1018
- }), he = (e, t) => t ? `calc(${100 * e}% + ${t}px)` : 100 * e + "%", ge = /*#__PURE__*/ t(({oe: e, ne: t, re: o, se: n, Le: r, Ae: l, le: f}) => {
1027
+ }), ge = (e, t) => t ? `calc(${100 * e}% + ${t}px)` : 100 * e + "%", $e = /*#__PURE__*/ t(({ee: e, te: t, oe: o, ne: n, Ce: r, Ee: l, re: f}) => {
1019
1028
  const a = i(null);
1020
- Q(() => t(a[Z], o), [ o ]);
1029
+ Z(() => t(a[ee], o), [ o ]);
1021
1030
  const u = s(() => ({
1022
1031
  contain: "layout style",
1023
1032
  position: "absolute",
@@ -1032,138 +1041,129 @@ a), I = e => h(e.t(), e.o()), R = ({l: e, i: t, u: o, h: n, t: r, $: s, p: l, m:
1032
1041
  style: u,
1033
1042
  children: e
1034
1043
  });
1035
- }), $e = /*#__PURE__*/ e(({children: e, data: t, lanes: o, gap: r, itemSize: s, bufferSize: a, keepMounted: u, cache: g, onScroll: $, onScrollEnd: p, onResize: w, style: S, ..._}, v) => {
1044
+ }), pe = /*#__PURE__*/ e(({children: e, data: t, lanes: o, gap: r, itemSize: s, bufferSize: a, keepMounted: u, cache: g, onScroll: $, onScrollEnd: p, onResize: w, style: S, ..._}, v) => {
1036
1045
  "use no memo";
1037
- const z = i(null), y = ne($), x = ne(p), b = ne(w), [O, M, E] = oe(() => {
1046
+ const z = i(null), y = re($), x = re(p), I = re(w), [M, C, E] = ne(() => {
1038
1047
  const e = ((e, t, o = 0, n, r) => {
1039
1048
  let s = h(t, 1), l = r && r[1] || n || 40, i = -1, c = n ? void 0 : /* @__PURE__ */ new Set, f = !n;
1040
- const a = r && r[0], u = a ? k(a.slice(0, d(e, a.length)), h(0, e - a.length)) : k([], e), g = [], $ = [], p = [], w = e => {
1041
- const t = u[e];
1049
+ const a = r ? r[0].slice(0, e) : [];
1050
+ T(a, e - a.length);
1051
+ const u = [], g = [], $ = [ 0 ], p = e => {
1052
+ const t = a[e];
1042
1053
  return -1 === t ? l : t;
1043
- }, S = t => {
1044
- if (t = d(t, e - 1), i >= t) return;
1045
- const n = [], r = [];
1046
- for (let e = 0; e < s; e++) n.push(0), r.push(-1);
1047
- for (let e = i, t = s; e >= 0 && t; e--) {
1048
- const o = $[e];
1049
- -1 === r[o] && (r[o] = e, n[o] = g[e] + w(e), t--);
1054
+ }, w = () => {
1055
+ if (i >= e - 1) return;
1056
+ const t = [], n = [];
1057
+ for (let e = 0; e < s; e++) t.push(0), n.push(-1);
1058
+ for (let e = i, r = s; e >= 0 && r; e--) {
1059
+ const s = g[e];
1060
+ -1 === n[s] && (n[s] = e, t[s] = u[e] + p(e) + o, r--);
1050
1061
  }
1051
- for (;i < t; ) {
1062
+ for (;i < e - 1; ) {
1052
1063
  const e = ++i;
1053
- let t = 0, l = 1 / 0, c = 1 / 0;
1064
+ let r = 0, l = 1 / 0, c = 1 / 0;
1054
1065
  for (let e = 0; e < s; e++) {
1055
- const s = n[e] + (r[e] >= 0 ? o : 0);
1056
- (s < l || s === l && r[e] < c) && (t = e, l = s, c = r[e]);
1066
+ const o = t[e];
1067
+ (o < l || o === l && n[e] < c) && (r = e, l = o, c = n[e]);
1057
1068
  }
1058
- g[e] = l, $[e] = t, n[t] = l + w(e), r[t] = e, p[e] = h(e ? p[e - 1] : 0, n[t]);
1069
+ const f = l + p(e);
1070
+ u[e] = l, g[e] = r, t[r] = f + o, n[r] = e, $[e + 1] = h($[e], f);
1059
1071
  }
1060
- }, _ = t => t >= e ? z() : (S(t), g[t]), v = e => (S(e), p[e]), z = () => e ? v(e - 1) : 0, y = t => {
1061
- if (!e) return 0;
1062
- const o = T(v, e, t);
1063
- return v(o) <= t ? o + 1 : o;
1064
- };
1072
+ }, S = t => t >= e ? v() : (w(), u[t]), _ = e => (w(), $[e]), v = () => _(e), z = t => O(_, e + 1, t);
1065
1073
  return {
1066
- l: (t, o) => {
1067
- const n = T(_, e, o);
1068
- return [ d(y(t), n), n ];
1074
+ $: (t, o) => {
1075
+ const n = O(S, e, o);
1076
+ return [ d(z(t), n), n ];
1069
1077
  },
1070
- i: _,
1071
- u: w,
1072
- h: (e, t = -1) => u[e] === t,
1073
- S: (t, n, r, a) => {
1074
- let h = y(r);
1075
- for (;h > 0 && !n(h - 1); ) h--;
1076
- for (;h < e && n(h); ) h++;
1077
- const g = _(h);
1078
- for (const [e, o] of t) u[e] = o, c && c.add(e), i = d(e - 1, i);
1079
- let $ = _(h) - g;
1080
- if (c && a) {
1078
+ p: z,
1079
+ i: S,
1080
+ m: p,
1081
+ A: (e, t = -1) => a[e] === t,
1082
+ S: (e, t) => {
1083
+ for (const [t, o] of e) a[t] = o, c && c.add(t), i = d(t - 1, i);
1084
+ if (c && t) {
1081
1085
  const e = [];
1082
- let t = 0;
1083
- if (c.forEach(n => {
1084
- const r = u[n];
1085
- r > 0 && (e.push(r), t += r + o);
1086
- }), t > a * s) {
1086
+ let n = 0;
1087
+ if (c.forEach(t => {
1088
+ const r = a[t];
1089
+ -1 !== r && r && (e.push(r), n += r + o);
1090
+ }), n > t * s) {
1087
1091
  m(e);
1088
- const t = e.length, o = t / 2 | 0, n = t % 2 == 0 ? (e[o - 1] + e[o]) / 2 : e[o], s = y(r + $), a = _(s);
1089
- l = n, i = -1, $ += _(s) - a, c = void 0, f = !1;
1092
+ const t = e.length, o = t / 2 | 0;
1093
+ l = t % 2 == 0 ? (e[o - 1] + e[o]) / 2 : e[o], i = -1, c = void 0, f = !1;
1090
1094
  }
1091
1095
  }
1092
- return $;
1093
1096
  },
1094
- t: z,
1095
- $: () => e,
1096
- p: t => {
1097
+ t: v,
1098
+ _: () => e,
1099
+ v: t => {
1097
1100
  const o = t - e;
1098
- return i = d(t - 1, i), e = t, o > 0 ? k(u, o) : u.splice(o), 0;
1099
- },
1100
- X: (e, t = 0, r) => {
1101
- if ((e = h(e, 1)) === s && t === o) return;
1102
- const l = y(r), f = _(l);
1103
- return s = e, o = t, i = -1, c = n ? void 0 : /* @__PURE__ */ new Set, _(l) - f;
1101
+ i = d(t - 1, i), e = t, o > 0 ? T(a, o) : a.splice(o);
1104
1102
  },
1105
- m: () => f,
1106
- H: () => [ u.slice(), l ],
1107
- We: () => s,
1108
- He: () => o,
1109
- qe: e => (S(e), $[e])
1103
+ u: (e, t = 0) => ((e = h(e, 1)) !== s || t !== o) && (s = e, o = t, i = -1, c = n ? void 0 : /* @__PURE__ */ new Set,
1104
+ !0),
1105
+ I: () => f,
1106
+ W: () => [ a.slice(), l ],
1107
+ Le: () => s,
1108
+ Ae: () => o,
1109
+ We: e => (w(), g[e])
1110
1110
  };
1111
- })(t.length, o, r, s, g), n = R(e);
1112
- return [ n, e, j(n, !1) ];
1111
+ })(t.length, o, r, s, g), n = k(e);
1112
+ return [ n, e, D(n, e, !1) ];
1113
1113
  });
1114
- t.length !== O.R() && O.A(5, [ t.length ]), O.A(9, M.X(o, r, O.T()));
1115
- const [C, L] = l(O.v, void 0, O.v), A = O.O(), W = O.t();
1116
- Q(() => (O.L(1, e => {
1117
- e ? f(L) : L();
1118
- }), O.L(4, () => {
1119
- y.current && y.current(O.k());
1120
- }), O.L(8, () => {
1114
+ M.h(5, t.length), R(M, C, o, r);
1115
+ const [L, A] = l(M.k, void 0, M.k), W = M.O(), H = M.t();
1116
+ Z(() => (M.L(1, e => {
1117
+ e ? f(A) : A();
1118
+ }), M.L(4, () => {
1119
+ y.current && y.current(M.T());
1120
+ }), M.L(8, () => {
1121
1121
  x.current && x.current();
1122
- }), O.L(2, () => {
1123
- b.current && b.current();
1124
- }), E.K(z[Z]), () => {
1125
- O._(), E._();
1126
- }), []), Q(() => {
1127
- E.ee();
1128
- }, [ C ]), n(v, () => ({
1122
+ }), M.L(2, () => {
1123
+ I.current && I.current();
1124
+ }), E.F(z[ee]), () => {
1125
+ M.R(), E.R();
1126
+ }), []), Z(() => {
1127
+ E.U();
1128
+ }, [ L ]), n(v, () => ({
1129
1129
  get cache() {
1130
- return M.H();
1130
+ return C.W();
1131
1131
  },
1132
1132
  get scrollOffset() {
1133
- return O.k();
1133
+ return M.T();
1134
1134
  },
1135
1135
  get scrollSize() {
1136
- return I(O);
1136
+ return b(M);
1137
1137
  },
1138
1138
  get viewportSize() {
1139
- return O.o();
1139
+ return M.o();
1140
1140
  },
1141
- getItemOffset: O.i,
1142
- getItemSize: O.u,
1143
- scrollToIndex: (e, t) => K(E, O, e, t),
1144
- scrollTo: e => U(E, e),
1145
- scrollBy: e => F(E, O, e)
1141
+ getItemOffset: M.i,
1142
+ getItemSize: C.m,
1143
+ scrollToIndex: (e, t) => Q(E, M, C, e, t),
1144
+ scrollTo: e => K(E, e),
1145
+ scrollBy: e => N(E, M, e)
1146
1146
  }), []);
1147
- const H = [], q = M.We(), B = M.He(), P = he(1 / q, B / q - B), V = o => {
1148
- const n = e(t[o], o), r = M.qe(o);
1147
+ const q = [], B = C.Le(), P = C.Ae(), Y = ge(1 / B, P / B - P), V = o => {
1148
+ const n = e(t[o], o), r = C.We(o);
1149
1149
  /* @__PURE__ */
1150
- return c(ge, {
1151
- ne: E.N,
1152
- re: o,
1153
- se: O.i(o),
1154
- Le: he(r / q, r * B / q),
1155
- Ae: P,
1156
- le: O.I(o),
1157
- oe: n
1158
- }, te(n, o));
1150
+ return c($e, {
1151
+ te: E.K,
1152
+ oe: o,
1153
+ ne: M.i(o),
1154
+ Ce: ge(r / B, r * P / B),
1155
+ Ee: Y,
1156
+ re: C.A(o),
1157
+ ee: n
1158
+ }, oe(n, o));
1159
1159
  };
1160
1160
  if (u) {
1161
1161
  const e = new Set(u);
1162
- for (let [t, o] = O.l(a); t <= o; t++) e.add(t);
1162
+ for (let [t, o] = M.$(a); t <= o; t++) e.add(t);
1163
1163
  m([ ...e ]).forEach(e => {
1164
- e < t.length && H.push(V(e));
1164
+ e < t.length && q.push(V(e));
1165
1165
  });
1166
- } else for (let [e, t] = O.l(a); e <= t; e++) H.push(V(e));
1166
+ } else for (let [e, t] = M.$(a); e <= t; e++) q.push(V(e));
1167
1167
  /* @__PURE__ */
1168
1168
  return c("div", {
1169
1169
  ..._,
@@ -1183,13 +1183,13 @@ a), I = e => h(e.t(), e.o()), R = ({l: e, i: t, u: o, h: n, t: r, $: s, p: l, m:
1183
1183
  flex: "none",
1184
1184
  position: "relative",
1185
1185
  width: "100%",
1186
- height: W,
1187
- pointerEvents: A ? "none" : void 0
1186
+ height: H,
1187
+ pointerEvents: W ? "none" : void 0
1188
1188
  },
1189
- children: H
1189
+ children: q
1190
1190
  })
1191
1191
  });
1192
1192
  });
1193
1193
 
1194
- export { de as VGrid, ie as VList, $e as VMasonry, le as Virtualizer, ce as WindowVirtualizer };
1194
+ export { he as VGrid, ce as VList, pe as VMasonry, ie as Virtualizer, fe as WindowVirtualizer };
1195
1195
  //# sourceMappingURL=index.js.map