virtua 0.53.1 → 0.53.2

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 (55) hide show
  1. package/lib/angular/VGrid.d.ts +5 -1
  2. package/lib/angular/VList.d.ts +5 -1
  3. package/lib/angular/VMasonry.d.ts +5 -1
  4. package/lib/angular/Virtualizer.d.ts +5 -1
  5. package/lib/angular/WindowVirtualizer.d.ts +5 -1
  6. package/lib/angular/index.js +368 -352
  7. package/lib/angular/index.js.map +1 -1
  8. package/lib/core/index.cjs +101 -108
  9. package/lib/core/index.cjs.map +1 -1
  10. package/lib/core/index.d.ts +1 -1
  11. package/lib/core/index.js +193 -200
  12. package/lib/core/index.js.map +1 -1
  13. package/lib/index.cjs +413 -404
  14. package/lib/index.cjs.map +1 -1
  15. package/lib/index.js +416 -408
  16. package/lib/index.js.map +1 -1
  17. package/lib/react/VGrid.d.ts +4 -0
  18. package/lib/react/VList.d.ts +1 -1
  19. package/lib/react/VMasonry.d.ts +4 -0
  20. package/lib/react/Virtualizer.d.ts +4 -0
  21. package/lib/react/WindowVirtualizer.d.ts +4 -0
  22. package/lib/react/types.d.ts +1 -1
  23. package/lib/solid/VGrid.d.ts +4 -0
  24. package/lib/solid/VList.d.ts +1 -1
  25. package/lib/solid/VMasonry.d.ts +4 -0
  26. package/lib/solid/Virtualizer.d.ts +4 -0
  27. package/lib/solid/WindowVirtualizer.d.ts +4 -0
  28. package/lib/solid/index.cjs +446 -436
  29. package/lib/solid/index.cjs.map +1 -1
  30. package/lib/solid/index.js +410 -400
  31. package/lib/solid/index.js.map +1 -1
  32. package/lib/solid/index.jsx +38 -22
  33. package/lib/solid/index.jsx.map +1 -1
  34. package/lib/solid/types.d.ts +1 -1
  35. package/lib/svelte/VGrid.svelte +26 -6
  36. package/lib/svelte/VGrid.type.d.ts +4 -0
  37. package/lib/svelte/VList.svelte +2 -0
  38. package/lib/svelte/VList.type.d.ts +1 -1
  39. package/lib/svelte/VMasonry.svelte +9 -2
  40. package/lib/svelte/VMasonry.type.d.ts +4 -0
  41. package/lib/svelte/Virtualizer.svelte +9 -2
  42. package/lib/svelte/Virtualizer.type.d.ts +4 -0
  43. package/lib/svelte/WindowVirtualizer.svelte +9 -2
  44. package/lib/svelte/WindowVirtualizer.type.d.ts +4 -0
  45. package/lib/svelte/types.d.ts +1 -1
  46. package/lib/vue/VGrid.d.ts +4 -0
  47. package/lib/vue/VList.d.ts +1 -1
  48. package/lib/vue/VMasonry.d.ts +4 -0
  49. package/lib/vue/Virtualizer.d.ts +4 -0
  50. package/lib/vue/WindowVirtualizer.d.ts +4 -0
  51. package/lib/vue/index.cjs +619 -609
  52. package/lib/vue/index.cjs.map +1 -1
  53. package/lib/vue/index.js +599 -589
  54. package/lib/vue/index.js.map +1 -1
  55. package/package.json +1 -1
package/lib/core/index.js CHANGED
@@ -6,120 +6,117 @@ var t, e = [], {min: n, max: o, abs: r, floor: s} = Math, l = (t, e, r) => n(r,
6
6
  t = e;
7
7
  }), t ];
8
8
  }, $ = "undefined" != typeof window, g = t => t.ownerDocument, d = t => t.defaultView, p = () => (null == t && (t = /iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0),
9
- t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$getViewportSize()), y = ({$getRange: t, $findIndex: e, $getItemOffset: s, $getItemSize: l, $isSizeEqual: c, $getTotalSize: i, $getLength: f, $setLength: u, $isEstimating: a, $resize: $, $relayout: g}, d = 0) => {
10
- let m = !!d, w = 1, h = 0, b = 0, S = 0, v = 0, I = 0, y = 0, x = 0, z = 0, k = null, T = [ 0, m ? o(d - 1, 0) : -1 ], L = !1;
11
- const M = /* @__PURE__ */ new Set, R = () => S - b, O = () => R() + I + v, E = t => s(t) - I, _ = t => {
12
- if (2 === z) return !0;
13
- if (k && 1 === z) return t < k[0];
14
- const e = R(), n = E(t), o = l(t);
15
- return 1 !== x && 0 === z ? n + o <= e : n < e && n + o < e + h;
16
- }, q = t => {
17
- t && (p() && 0 !== x || k && 1 === z ? I += t : v += t);
9
+ t), m = 5, w = 6, h = 9, b = 1, S = 2, v = 4, y = 8, I = t => o(t.$getTotalSize(), t.$getViewportSize()), x = ({$getRange: t, $getItemOffset: e, $getItemSize: s, $isSizeEqual: l, $getTotalSize: c, $getLength: i, $setLength: f, $isEstimating: u, $resize: a}, $ = 0) => {
10
+ let g = !!$, d = 1, m = 0, w = 0, h = 0, b = 0, S = 0, v = 0, y = 0, I = 0, x = null, z = [ 0, g ? o($ - 1, 0) : -1 ], k = !1;
11
+ const T = /* @__PURE__ */ new Set, L = () => h - w, M = () => L() + S + b, R = t => e(t) - S, O = t => {
12
+ if (2 === I) return !0;
13
+ if (x && 1 === I) return t < x[0];
14
+ const e = L(), n = R(t), o = s(t);
15
+ return 1 !== y && 0 === I ? n + o <= e : n < e && n + o < e + m;
16
+ }, E = t => {
17
+ t && (p() && 0 !== y || x && 1 === I ? S += t : b += t);
18
18
  };
19
19
  return {
20
20
  $dispose: () => {
21
- M.clear();
21
+ T.clear();
22
22
  },
23
- $getStateVersion: () => w,
23
+ $getStateVersion: () => d,
24
24
  $getRange: (e = 200) => {
25
- if (!L || m) return T;
25
+ if (!k || g) return z;
26
26
  let r, s;
27
- if (y) [r, s] = T; else {
28
- let l = o(0, O()), c = l + h;
29
- a() || (e = o(0, e), 1 !== x && (l -= e), 2 !== x && (c += e)), [r, s] = T = t(o(0, l), o(0, c)),
30
- k && (r = n(r, k[0]), s = o(s, k[1]));
27
+ if (v) [r, s] = z; else {
28
+ let l = o(0, M()), c = l + m;
29
+ u() || (e = o(0, e), 1 !== y && (l -= e), 2 !== y && (c += e)), [r, s] = z = t(o(0, l), o(0, c)),
30
+ x && (r = n(r, x[0]), s = o(s, x[1]));
31
31
  }
32
- return [ o(r, 0), n(s, f() - 1) ];
32
+ return [ o(r, 0), n(s, i() - 1) ];
33
33
  },
34
- $findItemIndex: t => e(t - b),
35
- $isUnmeasuredItem: c,
36
- $getItemOffset: E,
37
- $getItemSize: l,
38
- $getItemsLength: f,
39
- $getScrollOffset: () => S,
40
- $isScrolling: () => 0 !== x,
41
- $getViewportSize: () => h,
42
- $getStartSpacerSize: () => b,
43
- $getTotalSize: i,
44
- t: () => (y = v, v = 0, [ y, 2 === z ]),
34
+ $isUnmeasuredItem: l,
35
+ $getItemOffset: R,
36
+ $getItemSize: s,
37
+ $getItemsLength: i,
38
+ $getScrollOffset: () => h,
39
+ $getVisibleOffset: M,
40
+ $isScrolling: () => 0 !== y,
41
+ $getViewportSize: () => m,
42
+ $getStartSpacerSize: () => w,
43
+ $getTotalSize: c,
44
+ t: () => (v = b, b = 0, [ v, 2 === I ]),
45
45
  $subscribe: (t, e) => {
46
46
  const n = [ t, e ];
47
- return M.add(n), () => {
48
- M.delete(n);
47
+ return T.add(n), () => {
48
+ T.delete(n);
49
49
  };
50
50
  },
51
51
  $update: (e, n) => {
52
- let o, s, l = 0;
52
+ let o, s, i = 0;
53
53
  switch (e) {
54
54
  case 1:
55
55
  {
56
- if (n === S && 0 === z) break;
57
- const t = y;
58
- y = 0;
59
- const e = n - S, o = r(e);
60
- t && o < r(t) + 1 || 0 !== z || (x = e < 0 ? 2 : 1), m && (m = !1), S = n, l = 4;
61
- const c = R();
62
- c >= -h && c <= i() && (l += 1, s = o > h);
56
+ if (n === h && 0 === I) break;
57
+ const t = v;
58
+ v = 0;
59
+ const e = n - h, o = r(e);
60
+ t && o < r(t) + 1 || 0 !== I || (y = e < 0 ? 2 : 1), g && (g = !1), h = n, i = 4;
61
+ const l = L();
62
+ l >= -m && l <= c() && (i += 1, s = o > m);
63
63
  break;
64
64
  }
65
65
 
66
66
  case 2:
67
- l = 8, 0 !== x && (o = !0, l += 1), x = 0, z = 0, k = null;
67
+ i = 8, 0 !== y && (o = !0, i += 1), y = 0, I = 0, x = null;
68
68
  break;
69
69
 
70
70
  case 3:
71
71
  {
72
- const t = n.filter(([t, e]) => !c(t, e));
72
+ const t = n.filter(([t, e]) => !l(t, e));
73
73
  if (!t.length) break;
74
- q($(t, _, O(), h)), l = 3, s = !0;
74
+ E(a(t, O, M(), m)), i = 3, s = !0;
75
75
  break;
76
76
  }
77
77
 
78
78
  case 4:
79
- h !== n && (h || (L = s = !0), h = n, l = 3);
79
+ m !== n && (m || (k = s = !0), m = n, i = 3);
80
80
  break;
81
81
 
82
82
  case 5:
83
- n[1] ? (q(u(n[0], !0)), z = 2, l = 1) : (u(n[0]), l = 1);
83
+ n[1] ? (E(f(n[0], !0)), I = 2, i = 1) : (f(n[0]), i = 1);
84
84
  break;
85
85
 
86
86
  case 6:
87
- b = n;
87
+ w = n;
88
88
  break;
89
89
 
90
90
  case 7:
91
- z = 1;
91
+ I = 1;
92
92
  break;
93
93
 
94
94
  case 9:
95
- {
96
- const t = g(n, O());
97
- null != t && (q(t), l = 3);
98
- break;
99
- }
95
+ null != n && (E(n), i = 3);
96
+ break;
100
97
 
101
98
  case 8:
102
- k = t(n, n + h), l = 1;
99
+ x = t(n, n + m), i = 1;
103
100
  }
104
- l && (w = 1 + (2147483647 & w), o && I && (v += I, I = 0), M.forEach(([t, e]) => {
105
- l & t && e(s);
101
+ i && (d = 1 + (2147483647 & d), o && S && (b += S, S = 0), T.forEach(([t, e]) => {
102
+ i & t && e(s);
106
103
  }));
107
104
  }
108
105
  };
109
- }, x = (t, e, n) => {
106
+ }, z = (t, e, n) => {
110
107
  const o = n ? "unshift" : "push";
111
108
  for (let n = 0; n < e; n++) t[o](-1);
112
109
  return t;
113
- }, z = (t, e, n, o = 0, r = e - 1) => {
110
+ }, k = (t, e, n, o = 0, r = e - 1) => {
114
111
  let c = o;
115
112
  for (;o <= r; ) {
116
113
  const e = s((o + r) / 2);
117
114
  t(e) <= n ? (c = e, o = e + 1) : r = e - 1;
118
115
  }
119
116
  return l(c, 0, e - 1);
120
- }, k = (t, e, r) => {
117
+ }, T = (t, e, r) => {
121
118
  let s = r && r[1] || e || 40, l = -1, i = 0, f = !e, u = 0;
122
- const a = r && r[0], $ = a ? x(a.slice(0, n(t, a.length)), o(0, t - a.length)) : x([], t), g = x([], t + 1), d = t => {
119
+ const a = r && r[0], $ = a ? z(a.slice(0, n(t, a.length)), o(0, t - a.length)) : z([], t), g = z([], t + 1), d = t => {
123
120
  const e = $[t];
124
121
  return -1 === e ? s : e;
125
122
  }, p = e => {
@@ -133,10 +130,10 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
133
130
  return {
134
131
  $getRange: (e, o) => {
135
132
  let r, s;
136
- return u = n(u, t - 1), p(u) <= e ? (s = z(p, t, o, u), r = z(p, t, e, u, s)) : (r = z(p, t, e, void 0, u),
137
- s = z(p, t, o, r)), u = r, [ r, s ];
133
+ return u = n(u, t - 1), p(u) <= e ? (s = k(p, t, o, u), r = k(p, t, e, u, s)) : (r = k(p, t, e, void 0, u),
134
+ s = k(p, t, o, r)), u = r, [ r, s ];
138
135
  },
139
- $findIndex: e => z(p, t, e),
136
+ $findIndex: e => k(p, t, e),
140
137
  $getItemOffset: p,
141
138
  $getItemSize: d,
142
139
  $isSizeEqual: (t, e = -1) => $[t] === e,
@@ -145,7 +142,7 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
145
142
  for (const [t, o] of e) i += -1 === $[t] ? o : o - d(t), $[t] = o, l = n(t, l);
146
143
  if (f && a && i > a) {
147
144
  let e = 0;
148
- const n = z(p, t, u + g), r = [];
145
+ const n = k(p, t, u + g), r = [];
149
146
  $.forEach((t, o) => {
150
147
  -1 !== t && (t && r.push(t), o < n && e++);
151
148
  }), l = -1, c(r);
@@ -158,43 +155,43 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
158
155
  $getLength: () => t,
159
156
  $setLength: (e, o) => {
160
157
  const r = e - t;
161
- return l = o ? -1 : n(e - 1, l), t = e, r > 0 ? (x(g, r), x($, r, o), s * r) : (g.splice(r),
158
+ return l = o ? -1 : n(e - 1, l), t = e, r > 0 ? (z(g, r), z($, r, o), s * r) : (g.splice(r),
162
159
  (o ? $.splice(0, -r) : $.splice(r)).reduce((t, e) => t - (-1 === e ? s : e), 0));
163
160
  },
164
161
  $isEstimating: () => f,
165
162
  $snapshot: () => [ $.slice(), s ]
166
163
  };
167
- }, T = t => "number" == typeof t ? t : t.length, L = (t, e) => "number" == typeof t ? e : t[e], M = (t, e, r = 0) => {
168
- let i = T(t);
164
+ }, L = t => "number" == typeof t ? t : t.length, M = (t, e) => "number" == typeof t ? e : t[e], R = (t, e, r = 0) => {
165
+ let i = L(t);
169
166
  const f = "number" == typeof e, u = "auto" === e;
170
167
  let a = (f ? e : 40) + r, $ = -1, g = 0, d = u, p = 0, m = 0, w = null;
171
- const h = [], b = [], S = [], v = t => u || !!S[t], I = () => {
172
- h.length || x(h, i);
173
- }, y = t => {
168
+ const h = [], b = [], S = [], v = t => u || !!S[t], y = () => {
169
+ h.length || z(h, i);
170
+ }, I = t => {
174
171
  const e = h[t];
175
172
  return -1 === e ? a : e;
176
- }, k = t => {
173
+ }, x = t => {
177
174
  if (!i) return 0;
178
175
  if (!h.length) return t * a;
179
176
  if ($ >= t) return b[t];
180
177
  $ < 0 && (b[0] = 0, $ = 0);
181
178
  let e = $, n = b[e];
182
- for (;e < t; ) n += y(e), b[++e] = n;
179
+ for (;e < t; ) n += I(e), b[++e] = n;
183
180
  return $ = t, n;
184
- }, L = (t, e) => {
181
+ }, T = (t, e) => {
185
182
  h[t] = e, $ = n(t, $);
186
- }, M = t => h.length ? z(k, i, t) : a ? l(s(t / a), 0, i - 1) : 0, R = () => n(p, i), O = () => o(i - m, R()), E = t => (h.length ? y(t) : a) - r;
183
+ }, M = t => h.length ? k(x, i, t) : a ? l(s(t / a), 0, i - 1) : 0, R = () => n(p, i), O = () => o(i - m, R()), E = t => (h.length ? I(t) : a) - r;
187
184
  return {
188
185
  $getRange: (t, e) => {
189
- const n = k(R()), s = k(i) - k(O()), l = t + (n ? n - r : 0);
186
+ const n = x(R()), s = x(i) - x(O()), l = t + (n ? n - r : 0);
190
187
  return [ M(l), M(o(l, e - (s ? s - r : 0))) ];
191
188
  },
192
189
  $findIndex: M,
193
- $getItemOffset: k,
190
+ $getItemOffset: x,
194
191
  $getItemSize: E,
195
192
  $resize: (t, e, n, s) => {
196
193
  let l = t.reduce((t, [n, o]) => v(n) && e(n) ? t + (o - E(n)) : t, 0);
197
- for (const [e, n] of t) v(e) && (I(), g += -1 === h[e] ? n : n - E(e), L(e, n + r));
194
+ for (const [e, n] of t) v(e) && (y(), g += -1 === h[e] ? n : n - E(e), T(e, n + r));
198
195
  if (d && s && g > s) {
199
196
  let t = 0;
200
197
  const e = M(n + l), r = [];
@@ -210,11 +207,11 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
210
207
  const n = h.length ? h[t] : -1;
211
208
  return -1 === e ? v(t) && -1 === n : n === e + r;
212
209
  },
213
- $getTotalSize: () => i ? k(i) - r : 0,
210
+ $getTotalSize: () => i ? x(i) - r : 0,
214
211
  $getLength: () => i,
215
212
  $setLength: t => {
216
213
  const e = t - i;
217
- return $ = n(t - 1, $), i = t, h.length && (e > 0 ? x(h, e) : h.splice(e)), 0;
214
+ return $ = n(t - 1, $), i = t, h.length && (e > 0 ? z(h, e) : h.splice(e)), 0;
218
215
  },
219
216
  $isEstimating: () => d,
220
217
  $isMeasurable: v,
@@ -233,21 +230,21 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
233
230
  return a = n, o;
234
231
  }
235
232
  if (t === w && i === S.length) return;
236
- w = t, S.length = i, I();
237
- const n = M(e), o = k(n);
233
+ w = t, S.length = i, y();
234
+ const n = M(e), o = x(n);
238
235
  let s;
239
236
  for (let e = 0; e < i; e++) {
240
237
  const n = t[e], o = "number" != typeof n;
241
238
  if (!o || !S[e]) {
242
239
  S[e] = o;
243
240
  const t = o ? -1 : n + r;
244
- h[e] !== t && (L(e, t), s = !0);
241
+ h[e] !== t && (T(e, t), s = !0);
245
242
  }
246
243
  }
247
- return s ? k(n) - o : void 0;
244
+ return s ? x(n) - o : void 0;
248
245
  }
249
246
  };
250
- }, R = /*#__PURE__*/ new WeakMap, O = (t = e) => {
247
+ }, O = /*#__PURE__*/ new WeakMap, E = (t = e) => {
251
248
  const n = /* @__PURE__ */ new Map;
252
249
  for (const e of t) {
253
250
  const t = e.rowIndex + (e.rowSpan || 1);
@@ -257,11 +254,11 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
257
254
  }
258
255
  }
259
256
  return n;
260
- }, E = (t, e, n) => {
257
+ }, _ = (t, e, n) => {
261
258
  const o = [];
262
259
  for (const r of t) r >= e && r < n && o.push(r);
263
260
  return c(o);
264
- }, _ = (t, e, n) => {
261
+ }, q = (t, e, n) => {
265
262
  if (e >= n) return -1;
266
263
  let o = 0, r = t.length;
267
264
  for (;o < r; ) {
@@ -269,22 +266,22 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
269
266
  t[n] <= e ? o = n + 1 : r = n;
270
267
  }
271
268
  return o - 1;
272
- }, q = (t, e, n, o, r) => {
269
+ }, C = (t, e, n, o, r) => {
273
270
  const s = e.length;
274
271
  for (;n < s && e[n] < o; n++) {
275
272
  const o = e[n];
276
273
  o > r && (t.push(o), r = o);
277
274
  }
278
275
  return n;
279
- }, C = (t, e, n, o, r, s) => {
276
+ }, P = (t, e, n, o, r, s) => {
280
277
  const l = [];
281
278
  for (let t = 0; t < n; t++) l.push(t);
282
- const c = q(l, t, 0, o, n - 1);
279
+ const c = C(l, t, 0, o, n - 1);
283
280
  for (let t = o; t <= r; t++) l.push(t);
284
- q(l, t, c, s, r);
281
+ C(l, t, c, s, r);
285
282
  for (let t = s; t < e; t++) l.push(t);
286
283
  return l;
287
- }, P = (t, e) => n(t.rowIndex + (t.rowSpan || 1), e), W = (t, e) => n(t.colIndex + (t.colSpan || 1), e), A = (t, e, o, r, s, l) => {
284
+ }, W = (t, e) => n(t.rowIndex + (t.rowSpan || 1), e), A = (t, e) => n(t.colIndex + (t.colSpan || 1), e), V = (t, e, o, r, s, l) => {
288
285
  const c = e.length, i = r.length;
289
286
  let f = "[l0]", u = 0, a = 0, $ = 0;
290
287
  for (;u < l; ) {
@@ -307,13 +304,13 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
307
304
  }, J = (t, r, [s, i], [f, u], a, $ = e, g = e, d) => {
308
305
  const p = t.$getLength(), m = r.$getLength(), w = t.$getPinnedStart(), h = t.$getTrailStart(), b = r.$getPinnedStart(), S = r.$getTrailStart();
309
306
  s = l(s, w, h), i = n(i, h - 1), f = l(f, b, S), u = n(u, S - 1);
310
- const v = E($, w, h), I = o(b - 1, 0), y = [], x = [], z = [];
311
- for (const t of g) t.rowIndex < p && t.colIndex < m && (z.push(t), y.push(t.rowIndex));
312
- const k = z.length, T = _(v, s, h), L = T < 0 ? -1 : v[T];
313
- L >= 0 && y.push(L);
314
- const M = C(c(y), p, w, s, i, h);
307
+ const v = _($, w, h), y = o(b - 1, 0), I = [], x = [], z = [];
308
+ for (const t of g) t.rowIndex < p && t.colIndex < m && (z.push(t), I.push(t.rowIndex));
309
+ const k = z.length, T = q(v, s, h), L = T < 0 ? -1 : v[T];
310
+ L >= 0 && I.push(L);
311
+ const M = P(c(I), p, w, s, i, h);
315
312
  for (let t = 0; t < M.length; t++) for (const r of a.get(M[t]) || e) {
316
- const {rowIndex: e, colIndex: l} = r, c = P(r, p), a = W(r, m);
313
+ const {rowIndex: e, colIndex: l} = r, c = W(r, p), a = A(r, m);
317
314
  if ((t < 1 || M[t - 1] < e) && l < m && (c - e > 1 || a - l > 1)) {
318
315
  let t = (e < w || o(e, s) < n(c, i + 1) || h < c || L >= e && L < c) && (l < b || o(l, f) < n(a, u + 1) || S < a);
319
316
  for (let n = 0; !t && n < k; n++) {
@@ -324,27 +321,27 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
324
321
  }
325
322
  }
326
323
  for (const {rowIndex: t, colIndex: e} of z) {
327
- const n = _(v, t, h);
328
- y.push(t), n >= 0 && y.push(v[n]), x.push(e);
324
+ const n = q(v, t, h);
325
+ I.push(t), n >= 0 && I.push(v[n]), x.push(e);
329
326
  }
330
- c(y), c(x);
331
- const O = C(y, p, w, s, i, h), q = C(x, m, b, f, u, S), B = O.length, J = q.length, X = /* @__PURE__ */ new Map, Y = [], D = [];
327
+ c(I), c(x);
328
+ const R = P(I, p, w, s, i, h), E = P(x, m, b, f, u, S), C = R.length, B = E.length, J = /* @__PURE__ */ new Map, Y = [], D = [];
332
329
  for (const t of z) {
333
- const e = P(t, p), n = W(t, m);
330
+ const e = W(t, p), n = A(t, m);
334
331
  Y.push(e), D.push(n);
335
- const o = q.indexOf(t.colIndex);
336
- for (let r = O.indexOf(t.rowIndex); r < B && O[r] < e; r++) {
337
- const e = O[r] * m;
338
- for (let r = o; r < J && q[r] < n; r++) X.set(e + q[r], t);
332
+ const o = E.indexOf(t.colIndex);
333
+ for (let r = R.indexOf(t.rowIndex); r < C && R[r] < e; r++) {
334
+ const e = R[r] * m;
335
+ for (let r = o; r < B && E[r] < n; r++) J.set(e + E[r], t);
339
336
  }
340
337
  }
341
338
  const G = [];
342
- for (const t of q) G.push(!r.$isMeasurable(t) && null);
339
+ for (const t of E) G.push(!r.$isMeasurable(t) && null);
343
340
  const U = [], Z = t.$getItemOffset(w), j = [];
344
341
  let F = j;
345
- const H = R.get(t), K = /* @__PURE__ */ new Map;
346
- for (const e of O) {
347
- const n = e < w, l = e >= h, c = _(v, e, h), a = n ? 0 : l ? h : c < 0 ? -1 : v[c];
342
+ const H = O.get(t), K = /* @__PURE__ */ new Map;
343
+ for (const e of R) {
344
+ const n = e < w, l = e >= h, c = q(v, e, h), a = n ? 0 : l ? h : c < 0 ? -1 : v[c];
348
345
  if (e === a) {
349
346
  const t = n ? w : l ? p : c + 1 < v.length ? v[c + 1] : h;
350
347
  Y.push(t);
@@ -352,27 +349,27 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
352
349
  j.push({
353
350
  $key: n ? -1 : l ? -2 : -3 - a,
354
351
  $rows: e,
355
- $style: V(a, t, n || l ? 0 : null, l ? "bottom" : "top", 4)
352
+ $style: X(a, t, n || l ? 0 : null, l ? "bottom" : "top", 4)
356
353
  }), F = e;
357
354
  } else a < 0 && (F = j);
358
- const $ = c >= 0 && e === a, g = n || l || e === L || e >= s && e <= i, y = $ ? Z : null, x = e * m, z = H && H.get(e), k = z && z.$cells, T = [];
359
- let M = 0, R = !t.$isMeasurable(e) && null, O = e + 1, E = !1;
360
- for (let t = 0; t < J; t++) {
361
- const s = q[t], l = s < b, c = s >= S, i = l || c || s >= f && s <= u, a = X.get(x + s);
355
+ const $ = c >= 0 && e === a, g = n || l || e === L || e >= s && e <= i, I = $ ? Z : null, x = e * m, z = H && H.get(e), k = z && z.$cells, T = [];
356
+ let M = 0, R = !t.$isMeasurable(e) && null, O = e + 1, _ = !1;
357
+ for (let t = 0; t < B; t++) {
358
+ const s = E[t], l = s < b, c = s >= S, i = l || c || s >= f && s <= u, a = J.get(x + s);
362
359
  if (a ? a.rowIndex === e && a.colIndex === s : g && i) {
363
- const i = a ? P(a, p) : e + 1, f = a ? W(a, m) : s + 1, u = i - e, g = f - s, w = u > 1, h = g > 1, b = w || h;
360
+ const i = a ? W(a, p) : e + 1, f = a ? A(a, m) : s + 1, u = i - e, g = f - s, w = u > 1, h = g > 1, b = w || h;
364
361
  let S, v;
365
362
  O = o(O, i);
366
- const y = l ? r.$getItemOffset(s) : null, x = c ? r.$getItemOffset(m) - r.$getItemOffset(f) : null;
363
+ const I = l ? r.$getItemOffset(s) : null, x = c ? r.$getItemOffset(m) - r.$getItemOffset(f) : null;
367
364
  !1 !== R || w || (S = e, R = !0), !1 !== G[t] || h || (v = s, G[t] = !0);
368
- const z = n ? "columnheader" : s === I && (l || $) ? "rowheader" : "cell", L = b ? u : void 0, _ = b ? g : void 0, q = "cell" !== z && d && d.rowIndex === e && d.colIndex === s ? d.order : void 0;
365
+ const z = n ? "columnheader" : s === y && (l || $) ? "rowheader" : "cell", L = b ? u : void 0, E = b ? g : void 0, q = "cell" !== z && d && d.rowIndex === e && d.colIndex === s ? d.order : void 0;
369
366
  let C;
370
367
  if (k) {
371
368
  const t = k.length;
372
369
  for (;M < t && k[M].$col < s; ) M++;
373
370
  M < t && k[M].$col === s && (C = k[M]);
374
371
  }
375
- if (!C || C.$rowSpan !== L || C.$colSpan !== _ || C.$start !== y || C.$end !== x || C.$measureRow !== S || C.$measureCol !== v || C.$role !== z || C.$sort !== q) {
372
+ if (!C || C.$rowSpan !== L || C.$colSpan !== E || C.$start !== I || C.$end !== x || C.$measureRow !== S || C.$measureCol !== v || C.$role !== z || C.$sort !== q) {
376
373
  let t = "1/l" + s;
377
374
  b && (t += "/l" + i + "/l" + f);
378
375
  const e = {
@@ -381,39 +378,39 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
381
378
  gridArea: t
382
379
  };
383
380
  w && (e.height = "0px", e.minHeight = "100%", e.zIndex = 1), h && (e.width = "0px",
384
- e.minWidth = "100%"), (l || c) && (e[l ? "insetInlineStart" : "insetInlineEnd"] = (l ? y : x) + "px",
381
+ e.minWidth = "100%"), (l || c) && (e[l ? "insetInlineStart" : "insetInlineEnd"] = (l ? I : x) + "px",
385
382
  e.position = "sticky", e.zIndex = 2), C = {
386
383
  $col: s,
387
384
  $rowSpan: L,
388
- $colSpan: _,
385
+ $colSpan: E,
389
386
  $measureRow: S,
390
387
  $measureCol: v,
391
388
  $role: z,
392
389
  $sort: q,
393
390
  $style: e,
394
- $start: y,
391
+ $start: I,
395
392
  $end: x
396
- }, E = !0;
393
+ }, _ = !0;
397
394
  }
398
395
  T.push(C);
399
396
  }
400
397
  }
401
398
  if (U.push(R), T.length) {
402
- const t = z && !E && z.$cells.length === T.length && z.$top === y ? z : {
399
+ const t = z && !_ && z.$cells.length === T.length && z.$top === I ? z : {
403
400
  $row: e,
404
401
  $cells: T,
405
- $style: V(e, O, y, "top", 3),
406
- $top: y
402
+ $style: X(e, O, I, "top", 3),
403
+ $top: I
407
404
  };
408
405
  K.set(e, t), F.push(t);
409
406
  }
410
407
  }
411
- return R.set(t, K), {
412
- $rowTemplate: A(t, O, U, c(Y), "max-content", p),
413
- $colTemplate: A(r, q, G, c(D), "minmax(max-content,auto)", m),
408
+ return O.set(t, K), {
409
+ $rowTemplate: V(t, R, U, c(Y), "max-content", p),
410
+ $colTemplate: V(r, E, G, c(D), "minmax(max-content,auto)", m),
414
411
  $groups: j
415
412
  };
416
- }, V = (t, e, n, o, r) => {
413
+ }, X = (t, e, n, o, r) => {
417
414
  const s = {
418
415
  display: "grid",
419
416
  gridTemplateRows: "subgrid",
@@ -422,84 +419,80 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
422
419
  gridRow: "l" + t + "/l" + e
423
420
  };
424
421
  return null != n && (s.position = "sticky", s[o] = n + "px", s.zIndex = r), s;
425
- }, X = (t, e, r = 0, s, l) => {
426
- let i = o(e, 1), f = i, u = r, a = l && l[1] || s || 40, $ = -1, g = s ? void 0 : /* @__PURE__ */ new Set, d = !s;
427
- const p = l && l[0], m = p ? x(p.slice(0, n(t, p.length)), o(0, t - p.length)) : x([], t), w = [], h = [], b = [], S = t => {
428
- const e = m[t];
429
- return -1 === e ? a : e;
430
- }, v = e => {
431
- if (e = n(e, t - 1), $ >= e) return;
422
+ }, Y = (t, e, r = 0, s, l) => {
423
+ let i = o(e, 1), f = l && l[1] || s || 40, u = -1, a = s ? void 0 : /* @__PURE__ */ new Set, $ = !s;
424
+ const g = l && l[0], d = g ? z(g.slice(0, n(t, g.length)), o(0, t - g.length)) : z([], t), p = [], m = [], w = [], h = t => {
425
+ const e = d[t];
426
+ return -1 === e ? f : e;
427
+ }, b = e => {
428
+ if (e = n(e, t - 1), u >= e) return;
432
429
  const s = [], l = [];
433
430
  for (let t = 0; t < i; t++) s.push(0), l.push(-1);
434
- for (let t = $, e = i; t >= 0 && e; t--) {
435
- const n = h[t];
436
- -1 === l[n] && (l[n] = t, s[n] = w[t] + S(t), e--);
431
+ for (let t = u, e = i; t >= 0 && e; t--) {
432
+ const n = m[t];
433
+ -1 === l[n] && (l[n] = t, s[n] = p[t] + h(t), e--);
437
434
  }
438
- for (;$ < e; ) {
439
- const t = ++$;
435
+ for (;u < e; ) {
436
+ const t = ++u;
440
437
  let e = 0, n = 1 / 0, c = 1 / 0;
441
438
  for (let t = 0; t < i; t++) {
442
439
  const o = s[t] + (l[t] >= 0 ? r : 0);
443
440
  (o < n || o === n && l[t] < c) && (e = t, n = o, c = l[t]);
444
441
  }
445
- w[t] = n, h[t] = e, s[e] = n + S(t), l[e] = t, b[t] = o(t ? b[t - 1] : 0, s[e]);
442
+ p[t] = n, m[t] = e, s[e] = n + h(t), l[e] = t, w[t] = o(t ? w[t - 1] : 0, s[e]);
446
443
  }
447
- }, I = e => e >= t ? k() : (v(e), w[e]), y = t => (v(t), b[t]), k = () => t ? y(t - 1) : 0, T = e => {
444
+ }, S = e => e >= t ? y() : (b(e), p[e]), v = t => (b(t), w[t]), y = () => t ? v(t - 1) : 0, I = e => {
448
445
  if (!t) return 0;
449
- const n = z(y, t, e);
450
- return y(n) <= e ? n + 1 : n;
446
+ const n = k(v, t, e);
447
+ return v(n) <= e ? n + 1 : n;
451
448
  };
452
449
  return {
453
450
  $getRange: (e, o) => {
454
- const r = z(I, t, o);
455
- return [ n(T(e), r), r ];
451
+ const r = k(S, t, o);
452
+ return [ n(I(e), r), r ];
456
453
  },
457
- $findIndex: e => z(I, t, e),
458
- $getItemOffset: I,
459
- $getItemSize: S,
460
- $isSizeEqual: (t, e = -1) => m[t] === e,
454
+ $getItemOffset: S,
455
+ $getItemSize: h,
456
+ $isSizeEqual: (t, e = -1) => d[t] === e,
461
457
  $resize: (e, o, s, l) => {
462
- let f = T(s);
463
- for (;f > 0 && !o(f - 1); ) f--;
464
- for (;f < t && o(f); ) f++;
465
- const u = I(f);
466
- for (const [t, o] of e) m[t] = o, g && g.add(t), $ = n(t - 1, $);
467
- let p = I(f) - u;
468
- if (g && l) {
458
+ let g = I(s);
459
+ for (;g > 0 && !o(g - 1); ) g--;
460
+ for (;g < t && o(g); ) g++;
461
+ const p = S(g);
462
+ for (const [t, o] of e) d[t] = o, a && a.add(t), u = n(t - 1, u);
463
+ let m = S(g) - p;
464
+ if (a && l) {
469
465
  const t = [];
470
466
  let e = 0;
471
- if (g.forEach(n => {
472
- const o = m[n];
467
+ if (a.forEach(n => {
468
+ const o = d[n];
473
469
  o > 0 && (t.push(o), e += o + r);
474
470
  }), e > l * i) {
475
471
  c(t);
476
- const e = t.length, n = e / 2 | 0, o = e % 2 == 0 ? (t[n - 1] + t[n]) / 2 : t[n], r = T(s + p), l = I(r);
477
- a = o, $ = -1, p += I(r) - l, g = void 0, d = !1;
472
+ const e = t.length, n = e / 2 | 0, o = e % 2 == 0 ? (t[n - 1] + t[n]) / 2 : t[n], r = I(s + m), l = S(r);
473
+ f = o, u = -1, m += S(r) - l, a = void 0, $ = !1;
478
474
  }
479
475
  }
480
- return p;
476
+ return m;
481
477
  },
482
- $getTotalSize: k,
478
+ $getTotalSize: y,
483
479
  $getLength: () => t,
484
480
  $setLength: e => {
485
481
  const o = e - t;
486
- return $ = n(e - 1, $), t = e, o > 0 ? x(m, o) : m.splice(o), 0;
487
- },
488
- $relayout: (t, e) => {
489
- if (f === i && u === r) return;
490
- const n = T(e), o = I(n);
491
- return i = f, r = u, $ = -1, g = s ? void 0 : /* @__PURE__ */ new Set, I(n) - o;
482
+ return u = n(e - 1, u), t = e, o > 0 ? z(d, o) : d.splice(o), 0;
492
483
  },
493
- $setOptions: (t, e = 0) => {
494
- f = o(t, 1), u = e;
484
+ $relayout: (t, e = 0, n) => {
485
+ if ((t = o(t, 1)) === i && e === r) return;
486
+ const l = I(n), c = S(l);
487
+ return i = t, r = e, u = -1, a = s ? void 0 : /* @__PURE__ */ new Set, S(l) - c;
495
488
  },
496
- $isEstimating: () => d,
497
- $snapshot: () => [ m.slice(), a ],
489
+ $isEstimating: () => $,
490
+ $snapshot: () => [ d.slice(), f ],
498
491
  $getLanes: () => i,
499
492
  $getGap: () => r,
500
- $getItemLane: t => (v(t), h[t])
493
+ $getItemLane: t => (b(t), m[t])
501
494
  };
502
- }, Y = t => {
495
+ }, D = t => {
503
496
  let e;
504
497
  return {
505
498
  o(n) {
@@ -512,9 +505,9 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
512
505
  e && e.disconnect();
513
506
  }
514
507
  };
515
- }, D = (t, e, n, o, r, s, l) => {
508
+ }, G = (t, e, n, o, r, s, l) => {
516
509
  let c, a, $ = 0, g = !1, d = !1, m = !1, w = !1;
517
- const h = Date.now, b = o ? "scrollLeft" : "scrollTop", S = o ? "left" : "top", v = t => r ? -t : t, I = () => v(n[b]), y = (t, e) => {
510
+ const h = Date.now, b = o ? "scrollLeft" : "scrollTop", S = o ? "left" : "top", v = t => r ? -t : t, y = () => v(n[b]), I = (t, e) => {
518
511
  n.scrollTo({
519
512
  [S]: v(t),
520
513
  behavior: e ? "smooth" : "instant"
@@ -525,7 +518,7 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
525
518
  }, z = () => {
526
519
  f(a), a = i(x, 150);
527
520
  }, k = () => {
528
- $ = h(), m && (w = !0), l && t.$update(6, l()), t.$update(1, I()), z();
521
+ $ = h(), m && (w = !0), l && t.$update(6, l()), t.$update(1, y()), z();
529
522
  }, T = e => {
530
523
  if (g || !t.$isScrolling() || e.ctrlKey) return;
531
524
  const n = h() - $;
@@ -552,10 +545,10 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
552
545
  if (!e) return;
553
546
  w && s && s(), w = !1;
554
547
  const r = t.$getScrollOffset(), l = r + e, i = t.$getStartSpacerSize() + t.$getTotalSize() - t.$getViewportSize();
555
- l <= 0 || l >= i || r >= i ? y(l) : n.scrollBy({
548
+ l <= 0 || l >= i || r >= i ? I(l) : n.scrollBy({
556
549
  [S]: v(e),
557
550
  behavior: "instant"
558
- }), o && (c && c(), t.$getViewportSize() > t.$getTotalSize() && t.$update(1, I()));
551
+ }), o && (c && c(), t.$getViewportSize() > t.$getTotalSize() && t.$update(1, y()));
559
552
  },
560
553
  p: (e, n) => {
561
554
  let o, r, s;
@@ -568,7 +561,7 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
568
561
  for (let [e, n] = t.$getRange(0); e <= n; e++) if (t.$isUnmeasuredItem(e)) return;
569
562
  l();
570
563
  }
571
- t.$update(7), y(e(), n);
564
+ t.$update(7), I(e(), n);
572
565
  }
573
566
  };
574
567
  n && t.$update(8, e()), (() => {
@@ -582,9 +575,9 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
582
575
  })();
583
576
  }
584
577
  };
585
- }, G = (t, e) => {
578
+ }, U = (t, e) => {
586
579
  let n, o, r = a(), s = !0;
587
- const l = /* @__PURE__ */ new WeakMap, c = Y(r => {
580
+ const l = /* @__PURE__ */ new WeakMap, c = D(r => {
588
581
  const c = [];
589
582
  for (const {target: i, contentRect: {width: f, height: u}} of r) if (i === n) f || u ? (s || o.u(),
590
583
  s = !0, t.$update(4, e ? f : u)) : s = !1; else if (i.offsetParent) {
@@ -595,7 +588,7 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
595
588
  });
596
589
  return {
597
590
  $observe(s, l = s.parentElement) {
598
- c.o(n = l), o = D(t, l, l, e, e && "rtl" === getComputedStyle(l).direction, () => {
591
+ c.o(n = l), o = G(t, l, l, e, e && "rtl" === getComputedStyle(l).direction, () => {
599
592
  const t = e ? "overflowX" : "overflowY", n = l.style, o = n[t];
600
593
  n[t] = "hidden", i(() => {
601
594
  n[t] = o;
@@ -616,9 +609,9 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
616
609
  },
617
610
  $getBaseOffset: t.$getStartSpacerSize
618
611
  };
619
- }, U = (t, e) => {
612
+ }, Z = (t, e) => {
620
613
  let n, o, r, s, l, c = a();
621
- const i = /* @__PURE__ */ new WeakMap, f = Y(o => {
614
+ const i = /* @__PURE__ */ new WeakMap, f = D(o => {
622
615
  const r = [];
623
616
  for (const {target: t, contentRect: {width: s, height: c}} of o) if (t === n) l && l(); else if (t.offsetParent) {
624
617
  const n = i.get(t);
@@ -636,7 +629,7 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
636
629
  };
637
630
  a.addEventListener("resize", h), f.o($), r = () => {
638
631
  a.removeEventListener("resize", h);
639
- }, o = D(t, a, $, e, p, null, w), c[1](!0);
632
+ }, o = G(t, a, $, e, p, null, w), c[1](!0);
640
633
  },
641
634
  $dispose() {
642
635
  r && r(), f.i(), o && o.i(), c[1](!1), c = a();
@@ -652,9 +645,9 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
652
645
  },
653
646
  $getBaseOffset: () => s()
654
647
  };
655
- }, Z = (t, e) => {
648
+ }, j = (t, e) => {
656
649
  let n, o, r, s = a(), l = !0;
657
- const c = /* @__PURE__ */ new WeakMap, f = /* @__PURE__ */ new WeakMap, u = Y(s => {
650
+ const c = /* @__PURE__ */ new WeakMap, f = /* @__PURE__ */ new WeakMap, u = D(s => {
658
651
  const i = [], u = [];
659
652
  for (const {target: a, contentRect: {width: $, height: g}} of s) if (a === n) $ || g ? (l || (o.u(),
660
653
  r.u()), l = !0, t.$update(4, g), e.$update(4, $)) : l = !1; else if (a.offsetParent) {
@@ -669,7 +662,7 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
669
662
  },
670
663
  $observe(l, c = l.parentElement) {
671
664
  u.o(n = c);
672
- const f = (t, e) => D(t, c, c, e, e && "rtl" === getComputedStyle(c).direction, () => {
665
+ const f = (t, e) => G(t, c, c, e, e && "rtl" === getComputedStyle(c).direction, () => {
673
666
  const t = e ? "overflowX" : "overflowY", n = c.style, o = n[t];
674
667
  n[t] = "hidden", i(() => {
675
668
  n[t] = o;
@@ -688,11 +681,11 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
688
681
  o && o.$(), r && r.$();
689
682
  }
690
683
  };
691
- }, j = (t, e) => {
684
+ }, F = (t, e) => {
692
685
  t.$scroll(() => e);
693
- }, F = (t, e, n) => {
694
- j(t, n + e.$getScrollOffset());
695
- }, H = (t, e, n, {align: o, smooth: r, offset: s = 0} = {}) => {
686
+ }, H = (t, e, n) => {
687
+ F(t, n + e.$getScrollOffset());
688
+ }, K = (t, e, n, {align: o, smooth: r, offset: s = 0} = {}) => {
696
689
  if (n = l(n, 0, e.$getItemsLength() - 1), "nearest" === o) {
697
690
  const t = e.$getItemOffset(n), r = e.$getScrollOffset();
698
691
  if (t < r) o = "start"; else {
@@ -701,9 +694,9 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
701
694
  }
702
695
  }
703
696
  t.$scroll(() => s + t.$getBaseOffset() + e.$getItemOffset(n) + ("end" === o ? e.$getItemSize(n) - e.$getViewportSize() : "center" === o ? (e.$getItemSize(n) - e.$getViewportSize()) / 2 : 0), r);
704
- }, K = (t, e, n) => {
697
+ }, N = (t, e, n) => {
705
698
  null != e && t.$scroll(!1, () => e), null != n && t.$scroll(!0, () => n);
706
- }, N = (t, e, n, o, r) => {
699
+ }, Q = (t, e, n, o, r) => {
707
700
  if (null != o) {
708
701
  const n = o + e.$getScrollOffset();
709
702
  t.$scroll(!1, () => n);
@@ -712,10 +705,10 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
712
705
  const e = r + n.$getScrollOffset();
713
706
  t.$scroll(!0, () => e);
714
707
  }
715
- }, Q = (t, e, r, s, c, i, f) => {
708
+ }, tt = (t, e, r, s, c, i, f) => {
716
709
  const u = e.$getItemsLength(), a = r.$getPinnedStart(), $ = r.$getTrailStart();
717
710
  c = l(c, 0, u - 1);
718
- const g = E(s, a, $), d = _(g, c, $), p = d < 0 ? -1 : g[d], m = () => r.$getItemOffset(a) + (p < 0 || p === c ? 0 : r.$getItemOffset(p + 1) - r.$getItemOffset(p)), w = () => r.$getItemOffset(u) - r.$getItemOffset($);
711
+ const g = _(s, a, $), d = q(g, c, $), p = d < 0 ? -1 : g[d], m = () => r.$getItemOffset(a) + (p < 0 || p === c ? 0 : r.$getItemOffset(p + 1) - r.$getItemOffset(p)), w = () => r.$getItemOffset(u) - r.$getItemOffset($);
719
712
  if ("nearest" === i) {
720
713
  if (c < a || c >= $) return;
721
714
  const t = m(), r = e.$getScrollOffset() + t, s = e.$getViewportSize() - t - w(), l = e.$getItemSize(c);
@@ -733,9 +726,9 @@ t), m = 5, w = 6, h = 9, b = 1, S = 4, v = 8, I = t => o(t.$getTotalSize(), t.$g
733
726
  const t = m(), n = e.$getItemSize(c) - (e.$getViewportSize() - t - w());
734
727
  return e.$getItemOffset(c) - t + ("end" === i ? n : "center" === i ? n / 2 : 0);
735
728
  });
736
- }, tt = (t, n, o, r, s, l = e, {rowIndex: c, colIndex: i, rowAlign: f, colAlign: u}) => {
737
- null != c && Q(t, n, r, l, c, f, !1), null != i && Q(t, o, s, e, i, u, !0);
729
+ }, et = (t, n, o, r, s, l = e, {rowIndex: c, colIndex: i, rowAlign: f, colAlign: u}) => {
730
+ null != c && tt(t, n, r, l, c, f, !1), null != i && tt(t, o, s, e, i, u, !0);
738
731
  };
739
732
 
740
- export { m as ACTION_ITEMS_LENGTH_CHANGE, h as ACTION_RELAYOUT, w as ACTION_START_OFFSET_CHANGE, v as UPDATE_SCROLL_END_EVENT, S as UPDATE_SCROLL_EVENT, b as UPDATE_VIRTUAL_STATE, G as createContainerDriver, Z as createContainerGridDriver, M as createGridLayout, J as createGridPlan, O as createGridSpanIndex, k as createListLayout, X as createMasonryLayout, y as createVirtualStore, U as createWindowDriver, L as getAxisItem, T as getAxisLength, I as getScrollSize, N as gridScrollBy, K as gridScrollTo, tt as gridScrollToIndex, B as gridStyleToString, $ as isBrowser, u as microtask, F as scrollBy, j as scrollTo, H as scrollToIndex, c as sort };
733
+ export { m as ACTION_ITEMS_LENGTH_CHANGE, h as ACTION_RELAYOUT, w as ACTION_START_OFFSET_CHANGE, y as UPDATE_SCROLL_END_EVENT, v as UPDATE_SCROLL_EVENT, S as UPDATE_SIZE_EVENT, b as UPDATE_VIRTUAL_STATE, U as createContainerDriver, j as createContainerGridDriver, R as createGridLayout, J as createGridPlan, E as createGridSpanIndex, T as createListLayout, Y as createMasonryLayout, x as createVirtualStore, Z as createWindowDriver, M as getAxisItem, L as getAxisLength, I as getScrollSize, Q as gridScrollBy, N as gridScrollTo, et as gridScrollToIndex, B as gridStyleToString, $ as isBrowser, u as microtask, H as scrollBy, F as scrollTo, K as scrollToIndex, c as sort };
741
734
  //# sourceMappingURL=index.js.map