virtua 0.52.7 → 0.52.8

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/lib/vue/index.js CHANGED
@@ -1,99 +1,92 @@
1
1
  import { computed as e, createVNode as t, defineComponent as o, isVNode as r, mergeProps as n, onMounted as s, onUnmounted as l, ref as i, watch as c, watchEffect as a } from "vue";
2
2
 
3
- var u, f = [], {min: d, max: p, abs: m, floor: _} = Math, g = (e, t, o) => d(o, p(t, e)), $ = e => e.sort((e, t) => e - t), h = setTimeout, w = clearTimeout, S = "function" == typeof queueMicrotask ? queueMicrotask : e => {
3
+ var u, f = [], {min: d, max: p, abs: m, floor: _} = Math, g = (e, t, o) => d(o, p(t, e)), $ = e => e.sort((e, t) => e - t), h = setTimeout, w = clearTimeout, y = "function" == typeof queueMicrotask ? queueMicrotask : e => {
4
4
  Promise.resolve().then(e);
5
- }, y = () => {
5
+ }, S = () => {
6
6
  let e;
7
7
  return [ new Promise(t => {
8
8
  e = t;
9
9
  }), e ];
10
10
  }, b = e => e.ownerDocument, z = e => e.defaultView, x = () => (null == u && (u = /iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0),
11
- u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S: i, v: c, I: a}, u = 0) => {
12
- let f = !!a, _ = !!u, g = 1, $ = 0, h = 0, w = 0, S = 0, y = 0, b = 0, z = 0, v = 0, I = null, k = [ 0, _ ? p(u - 1, 0) : -1 ], O = 0, T = !1;
13
- const R = /* @__PURE__ */ new Set, N = () => w - h, A = () => N() + y + S, M = e => o(e) - y, C = e => {
14
- e && (x() && 0 !== z || I && 1 === v ? y += e : S += e);
11
+ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, t: s, h: l, S: i, v: c, I: a, k: u}, f = 0) => {
12
+ let _ = !!f, g = 1, $ = 0, h = 0, w = 0, y = 0, S = 0, b = 0, z = 0, v = 0, I = null, k = [ 0, _ ? p(f - 1, 0) : -1 ], O = !1;
13
+ const T = /* @__PURE__ */ new Set, R = () => w - h, N = () => R() + S + y, E = e => o(e) - S, M = e => {
14
+ if (2 === v) return !0;
15
+ if (I && 1 === v) return e < I[0];
16
+ const t = R(), o = E(e), n = r(e);
17
+ return 1 !== z && 0 === v ? o + n <= t : o < t && o + n < t + $;
18
+ }, A = e => {
19
+ e && (x() && 0 !== z || I && 1 === v ? S += e : y += e);
15
20
  };
16
21
  return {
17
- k: () => {
18
- R.clear();
22
+ O: () => {
23
+ T.clear();
19
24
  },
20
- O: () => g,
25
+ T: () => g,
21
26
  l: (t = 200) => {
22
- if (!T || _) return k;
27
+ if (!O || _) return k;
23
28
  let o, r;
24
29
  if (b) [o, r] = k; else {
25
- let n = p(0, A()), s = n + $;
26
- f || (t = p(0, t), 1 !== z && (n -= t), 2 !== z && (s += t)), [o, r] = k = e(p(0, n), p(0, s)),
30
+ let n = p(0, N()), s = n + $;
31
+ c() || (t = p(0, t), 1 !== z && (n -= t), 2 !== z && (s += t)), [o, r] = k = e(p(0, n), p(0, s)),
27
32
  I && (o = d(o, I[0]), r = p(r, I[1]));
28
33
  }
29
- return [ p(o, 0), d(r, i() - 1) ];
34
+ return [ p(o, 0), d(r, l() - 1) ];
30
35
  },
31
- T: e => t(e - h),
32
- R: s,
33
- u: M,
36
+ R: e => t(e - h),
37
+ N: n,
38
+ u: E,
34
39
  p: r,
35
- N: i,
40
+ M: l,
36
41
  A: () => w,
37
- M: () => 0 !== z,
42
+ C: () => 0 !== z,
38
43
  o: () => $,
39
- C: () => h,
40
- t: l,
41
- j: () => (b = S, S = 0, [ b, 2 === v ]),
42
- q: (e, t) => {
44
+ j: () => h,
45
+ t: s,
46
+ q: () => (b = y, y = 0, [ b, 2 === v ]),
47
+ P: (e, t) => {
43
48
  const o = [ e, t ];
44
- return R.add(o), () => {
45
- R.delete(o);
49
+ return T.add(o), () => {
50
+ T.delete(o);
46
51
  };
47
52
  },
48
- P: (o, i) => {
49
- let u, d, p = 0;
50
- switch (o) {
53
+ B: (t, o) => {
54
+ let r, l, c = 0;
55
+ switch (t) {
51
56
  case 1:
52
57
  {
53
- if (i === w && 0 === v) break;
58
+ if (o === w && 0 === v) break;
54
59
  const e = b;
55
60
  b = 0;
56
- const t = i - w, o = m(t);
57
- e && o < m(e) + 1 || 0 !== v || (z = t < 0 ? 2 : 1), _ && (_ = !1), w = i, p = 4;
58
- const r = N();
59
- r >= -$ && r <= l() && (p += 1, d = o > $);
61
+ const t = o - w, r = m(t);
62
+ e && r < m(e) + 1 || 0 !== v || (z = t < 0 ? 2 : 1), _ && (_ = !1), w = o, c = 4;
63
+ const n = R();
64
+ n >= -$ && n <= s() && (c += 1, l = r > $);
60
65
  break;
61
66
  }
62
67
 
63
68
  case 2:
64
- p = 8, 0 !== z && (u = !0, p += 1), z = 0, v = 0, I = null;
69
+ c = 8, 0 !== z && (r = !0, c += 1), z = 0, v = 0, I = null;
65
70
  break;
66
71
 
67
72
  case 3:
68
73
  {
69
- const e = i.filter(([e, t]) => !s(e, t));
74
+ const e = o.filter(([e, t]) => !n(e, t));
70
75
  if (!e.length) break;
71
- C(e.reduce((e, [t, o]) => {
72
- let n;
73
- if (2 === v) n = !0; else if (I && 1 === v) n = t < I[0]; else {
74
- const e = N(), o = M(t), s = r(t);
75
- n = 1 !== z && 0 === v ? o + s <= e : o < e && o + s < e + $;
76
- }
77
- return n && (e += o - r(t)), e;
78
- }, 0));
79
- for (const [t, o] of e) {
80
- const e = r(t), s = n(t, o);
81
- f && (O += s ? o : o - e);
82
- }
83
- f && $ && O > $ && (C(a(t(A()))), f = !1), p = 3, d = !0;
76
+ A(a(e, M, N(), $)), c = 3, l = !0;
84
77
  break;
85
78
  }
86
79
 
87
80
  case 4:
88
- $ !== i && ($ || (T = d = !0), $ = i, p = 3);
81
+ $ !== o && ($ || (O = l = !0), $ = o, c = 3);
89
82
  break;
90
83
 
91
84
  case 5:
92
- i[1] ? (C(c(i[0], !0)), v = 2, p = 1) : (c(i[0]), p = 1);
85
+ o[1] ? (A(i(o[0], !0)), v = 2, c = 1) : (i(o[0]), c = 1);
93
86
  break;
94
87
 
95
88
  case 6:
96
- h = i;
89
+ h = o;
97
90
  break;
98
91
 
99
92
  case 7:
@@ -101,14 +94,17 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
101
94
  break;
102
95
 
103
96
  case 9:
104
- C(i), p = 3;
105
- break;
97
+ {
98
+ const e = u(o, N());
99
+ null != e && (A(e), c = 3);
100
+ break;
101
+ }
106
102
 
107
103
  case 8:
108
- I = e(i, i + $), p = 1;
104
+ I = e(o, o + $), c = 1;
109
105
  }
110
- p && (g = 1 + (2147483647 & g), u && y && (S += y, y = 0), R.forEach(([e, t]) => {
111
- p & e && t(d);
106
+ c && (g = 1 + (2147483647 & g), r && S && (y += S, S = 0), T.forEach(([e, t]) => {
107
+ c & e && t(l);
112
108
  }));
113
109
  }
114
110
  };
@@ -124,140 +120,140 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
124
120
  }
125
121
  return g(s, 0, t - 1);
126
122
  }, T = (e, t, o) => {
127
- let r = o && o[1] || t || 40, n = -1, s = 0;
128
- const l = o && o[0], i = l ? k(l.slice(0, d(e, l.length)), p(0, e - l.length)) : k([], e), c = k([], e + 1), a = e => {
129
- const t = i[e];
123
+ let r = o && o[1] || t || 40, n = -1, s = 0, l = !t, i = 0;
124
+ const c = o && o[0], a = c ? k(c.slice(0, d(e, c.length)), p(0, e - c.length)) : k([], e), u = k([], e + 1), f = e => {
125
+ const t = a[e];
130
126
  return -1 === t ? r : t;
131
- }, u = t => {
127
+ }, m = t => {
132
128
  if (!e) return 0;
133
- if (n >= t) return c[t];
134
- n < 0 && (c[0] = 0, n = 0);
135
- let o = n, r = c[o];
136
- for (;o < t; ) r += a(o), c[++o] = r;
129
+ if (n >= t) return u[t];
130
+ n < 0 && (u[0] = 0, n = 0);
131
+ let o = n, r = u[o];
132
+ for (;o < t; ) r += f(o), u[++o] = r;
137
133
  return n = t, r;
138
134
  };
139
135
  return {
140
136
  l: (t, o) => {
141
137
  let r, n;
142
- return s = d(s, e - 1), u(s) <= t ? (n = O(u, e, o, s), r = O(u, e, t, s, n)) : (r = O(u, e, t, void 0, s),
143
- n = O(u, e, o, r)), s = r, [ r, n ];
138
+ return i = d(i, e - 1), m(i) <= t ? (n = O(m, e, o, i), r = O(m, e, t, i, n)) : (r = O(m, e, t, void 0, i),
139
+ n = O(m, e, o, r)), i = r, [ r, n ];
144
140
  },
145
- i: t => O(u, e, t),
146
- u,
147
- p: a,
148
- m: (e, t) => {
149
- const o = -1 === i[e];
150
- return i[e] = t, n = d(e, n), o;
141
+ i: t => O(m, e, t),
142
+ u: m,
143
+ p: f,
144
+ m: (e, t = -1) => a[e] === t,
145
+ I: (t, o, i, c) => {
146
+ let u = t.reduce((e, [t, r]) => o(t) ? e + (r - f(t)) : e, 0);
147
+ for (const [e, o] of t) s += -1 === a[e] ? o : o - f(e), a[e] = o, n = d(e, n);
148
+ if (l && c && s > c) {
149
+ let t = 0;
150
+ const o = O(m, e, i + u), s = [];
151
+ a.forEach((e, r) => {
152
+ -1 !== e && (e && s.push(e), r < o && t++);
153
+ }), n = -1, $(s);
154
+ const c = s.length, f = c / 2 | 0, d = c % 2 == 0 ? (s[f - 1] + s[f]) / 2 : s[f], _ = r;
155
+ u += ((r = d) - _) * p(o - t, 0), l = !1;
156
+ }
157
+ return u;
151
158
  },
152
- h: (e, t = -1) => i[e] === t,
153
- t: () => u(e),
154
- S: () => e,
155
- v: (t, o) => {
159
+ t: () => m(e),
160
+ h: () => e,
161
+ S: (t, o) => {
156
162
  const s = t - e;
157
- return n = o ? -1 : d(t - 1, n), e = t, s > 0 ? (k(c, s), k(i, s, o), r * s) : (c.splice(s),
158
- (o ? i.splice(0, -s) : i.splice(s)).reduce((e, t) => e - (-1 === t ? r : t), 0));
163
+ return n = o ? -1 : d(t - 1, n), e = t, s > 0 ? (k(u, s), k(a, s, o), r * s) : (u.splice(s),
164
+ (o ? a.splice(0, -s) : a.splice(s)).reduce((e, t) => e - (-1 === t ? r : t), 0));
159
165
  },
160
- I: t ? void 0 : e => {
161
- let t = 0;
162
- const o = [];
163
- i.forEach((r, n) => {
164
- -1 !== r && (r && o.push(r), n < e && t++);
165
- }), n = -1, $(o);
166
- const s = o.length, l = s / 2 | 0, c = s % 2 == 0 ? (o[l - 1] + o[l]) / 2 : o[l], a = r;
167
- return ((r = c) - a) * p(e - t, 0);
168
- },
169
- B: () => [ i.slice(), r ]
166
+ v: () => l,
167
+ H: () => [ a.slice(), r ]
170
168
  };
171
- }, R = e => "number" == typeof e ? e : e.length, N = (e, t) => "number" == typeof e ? t : e[t], A = (e, t, o = 0) => {
169
+ }, R = e => "number" == typeof e ? e : e.length, N = (e, t) => "number" == typeof e ? t : e[t], E = (e, t, o = 0) => {
172
170
  let r = R(e);
173
171
  const n = "number" == typeof t, s = "auto" === t;
174
- let l = (n ? t : 40) + o, i = -1, c = 0, a = 0, u = null;
175
- const f = [], m = [], h = [], w = e => s || !!h[e], S = () => {
176
- f.length || k(f, r);
177
- }, y = e => {
178
- const t = f[e];
172
+ let l = (n ? t : 40) + o, i = -1, c = 0, a = s, u = 0, f = 0, m = null;
173
+ const h = [], w = [], y = [], S = e => s || !!y[e], b = () => {
174
+ h.length || k(h, r);
175
+ }, z = e => {
176
+ const t = h[e];
179
177
  return -1 === t ? l : t;
180
- }, b = e => {
178
+ }, x = e => {
181
179
  if (!r) return 0;
182
- if (!f.length) return e * l;
183
- if (i >= e) return m[e];
184
- i < 0 && (m[0] = 0, i = 0);
185
- let t = i, o = m[t];
186
- for (;t < e; ) o += y(t), m[++t] = o;
180
+ if (!h.length) return e * l;
181
+ if (i >= e) return w[e];
182
+ i < 0 && (w[0] = 0, i = 0);
183
+ let t = i, o = w[t];
184
+ for (;t < e; ) o += z(t), w[++t] = o;
187
185
  return i = e, o;
188
- }, z = (e, t) => {
189
- f[e] = t, i = d(e, i);
190
- }, x = e => f.length ? O(b, r, e) : l ? g(_(e / l), 0, r - 1) : 0, v = () => d(c, r), I = () => p(r - a, v());
186
+ }, v = (e, t) => {
187
+ h[e] = t, i = d(e, i);
188
+ }, I = e => h.length ? O(x, r, e) : l ? g(_(e / l), 0, r - 1) : 0, T = () => d(u, r), N = () => p(r - f, T()), E = e => (h.length ? z(e) : l) - o;
191
189
  return {
192
190
  l: (e, t) => {
193
- const n = b(v()), s = b(r) - b(I()), l = e + (n ? n - o : 0);
194
- return [ x(l), x(p(l, t - (s ? s - o : 0))) ];
191
+ const n = x(T()), s = x(r) - x(N()), l = e + (n ? n - o : 0);
192
+ return [ I(l), I(p(l, t - (s ? s - o : 0))) ];
193
+ },
194
+ i: I,
195
+ u: x,
196
+ p: E,
197
+ I: (e, t, r, n) => {
198
+ let s = e.reduce((e, [o, r]) => S(o) && t(o) ? e + (r - E(o)) : e, 0);
199
+ for (const [t, r] of e) S(t) && (b(), c += -1 === h[t] ? r : r - E(t), v(t, r + o));
200
+ if (a && n && c > n) {
201
+ let e = 0;
202
+ const t = I(r + s), o = [];
203
+ h.forEach((r, n) => {
204
+ -1 !== r && (r && o.push(r), n < t && e++);
205
+ }), i = -1, $(o);
206
+ const n = o.length, c = n / 2 | 0, u = n % 2 == 0 ? (o[c - 1] + o[c]) / 2 : o[c], f = l;
207
+ s += ((l = u) - f) * p(t - e, 0), a = !1;
208
+ }
209
+ return s;
195
210
  },
196
- i: x,
197
- u: b,
198
- p: e => (f.length ? y(e) : l) - o,
199
- m: (e, t) => {
200
- if (!w(e)) return !1;
201
- S();
202
- const r = -1 === f[e];
203
- return z(e, t + o), r;
211
+ m: (e, t = -1) => {
212
+ const r = h.length ? h[e] : -1;
213
+ return -1 === t ? S(e) && -1 === r : r === t + o;
204
214
  },
205
- h: (e, t) => (f.length ? f[e] : -1) === t + o,
206
- t: () => r ? b(r) - o : 0,
207
- S: () => r,
208
- v: e => {
215
+ t: () => r ? x(r) - o : 0,
216
+ h: () => r,
217
+ S: e => {
209
218
  const t = e - r;
210
- return i = d(e - 1, i), r = e, f.length && (t > 0 ? k(f, t) : f.splice(t)), 0;
219
+ return i = d(e - 1, i), r = e, h.length && (t > 0 ? k(h, t) : h.splice(t)), 0;
211
220
  },
212
- I: s ? e => {
213
- let t = 0;
214
- const o = [];
215
- f.forEach((r, n) => {
216
- -1 !== r && (r && o.push(r), n < e && t++);
217
- }), i = -1, $(o);
218
- const r = o.length, n = r / 2 | 0, s = r % 2 == 0 ? (o[n - 1] + o[n]) / 2 : o[n], c = l;
219
- return ((l = s) - c) * p(e - t, 0);
220
- } : void 0,
221
- H: w,
222
- L: (e = 0, t = 0) => {
223
- c = e, a = t;
221
+ v: () => a,
222
+ L: S,
223
+ W: (e = 0, t = 0) => {
224
+ u = e, f = t;
224
225
  },
225
- W: v,
226
- V: I,
227
- D: (e, t) => "number" == typeof t ? n ? t : null : n || s || "auto" === t ? null : e.map(e => null != e ? e[t] : null),
228
- F: (e, t) => {
226
+ V: T,
227
+ F: N,
228
+ X: (e, t) => "number" == typeof t ? n ? t : null : n || s || "auto" === t ? null : e.map(e => null != e ? e[t] : null),
229
+ k: (e, t) => {
229
230
  if (null == e) return;
230
231
  if ("number" == typeof e) {
231
232
  const r = e + o;
232
233
  if (r === l) return;
233
- const n = x(t) * (r - l);
234
+ const n = I(t) * (r - l);
234
235
  return l = r, n;
235
236
  }
236
- if (e === u && r === h.length) return;
237
- u = e, h.length = r, S();
238
- const n = x(t), s = b(n);
237
+ if (e === m && r === y.length) return;
238
+ m = e, y.length = r, b();
239
+ const n = I(t), s = x(n);
239
240
  let i;
240
241
  for (let t = 0; t < r; t++) {
241
242
  const r = e[t], n = "number" != typeof r;
242
- if (!n || !h[t]) {
243
- h[t] = n;
243
+ if (!n || !y[t]) {
244
+ y[t] = n;
244
245
  const e = n ? -1 : r + o;
245
- f[t] !== e && (z(t, e), i = !0);
246
+ h[t] !== e && (v(t, e), i = !0);
246
247
  }
247
248
  }
248
- return i ? b(n) - s : void 0;
249
+ return i ? x(n) - s : void 0;
249
250
  }
250
251
  };
251
- }, M = (e, t, o, r, n, s) => {
252
- const l = R(o);
253
- t.L(n, s), l !== e.N() && e.P(5, [ l ]);
254
- const i = t.F(r, e.A() - e.u(0));
255
- null != i && e.P(9, i);
256
- }, C = /*#__PURE__*/ new WeakMap, E = (e, t, o) => {
252
+ }, M = /*#__PURE__*/ new WeakMap, A = (e, t, o) => {
257
253
  const r = [];
258
254
  for (const n of e) n >= t && n < o && r.push(n);
259
255
  return $(r);
260
- }, j = (e, t, o) => {
256
+ }, C = (e, t, o) => {
261
257
  if (t >= o) return -1;
262
258
  let r = 0, n = e.length;
263
259
  for (;r < n; ) {
@@ -265,22 +261,22 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
265
261
  e[o] <= t ? r = o + 1 : n = o;
266
262
  }
267
263
  return r - 1;
268
- }, q = (e, t, o, r, n) => {
264
+ }, j = (e, t, o, r, n) => {
269
265
  const s = t.length;
270
266
  for (;o < s && t[o] < r; o++) {
271
267
  const r = t[o];
272
268
  r > n && (e.push(r), n = r);
273
269
  }
274
270
  return o;
275
- }, P = (e, t, o, r, n, s) => {
271
+ }, q = (e, t, o, r, n, s) => {
276
272
  const l = [];
277
273
  for (let e = 0; e < o; e++) l.push(e);
278
- const i = q(l, e, 0, r, o - 1);
274
+ const i = j(l, e, 0, r, o - 1);
279
275
  for (let e = r; e <= n; e++) l.push(e);
280
- q(l, e, i, s, n);
276
+ j(l, e, i, s, n);
281
277
  for (let e = s; e < t; e++) l.push(e);
282
278
  return l;
283
- }, B = (e, t) => d(e.rowIndex + (e.rowSpan || 1), t), H = (e, t) => d(e.colIndex + (e.colSpan || 1), t), L = (e, t, o, r, n, s) => {
279
+ }, P = (e, t) => d(e.rowIndex + (e.rowSpan || 1), t), B = (e, t) => d(e.colIndex + (e.colSpan || 1), t), H = (e, t, o, r, n, s) => {
284
280
  const l = t.length, i = r.length;
285
281
  let c = "[l0]", a = 0, u = 0, f = 0;
286
282
  for (;a < s; ) {
@@ -295,7 +291,7 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
295
291
  c += " " + _ + " [l" + m + "]", a = m;
296
292
  }
297
293
  return c;
298
- }, W = (e, t, o, r, n) => {
294
+ }, L = (e, t, o, r, n) => {
299
295
  const s = {
300
296
  display: "grid",
301
297
  gridTemplateRows: "subgrid",
@@ -304,35 +300,35 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
304
300
  gridRow: "l" + e + "/l" + t
305
301
  };
306
302
  return null != o && (s.position = "sticky", s[r] = o + "px", s.zIndex = n), s;
307
- }, V = e => {
303
+ }, W = e => {
308
304
  let t;
309
305
  return {
310
- X(o) {
306
+ Y(o) {
311
307
  (t || (t = new (z(b(o)).ResizeObserver)(e))).observe(o);
312
308
  },
313
- Y(e) {
309
+ J(e) {
314
310
  t.unobserve(e);
315
311
  },
316
- J() {
312
+ D() {
317
313
  t && t.disconnect();
318
314
  }
319
315
  };
320
- }, D = (e, t, o, r, n, s, l) => {
316
+ }, V = (e, t, o, r, n, s, l) => {
321
317
  let i, c, a = 0, u = !1, f = !1, d = !1, p = !1;
322
- const m = Date.now, _ = r ? "scrollLeft" : "scrollTop", g = r ? "left" : "top", $ = e => n ? -e : e, y = () => $(o[_]), b = (e, t) => {
318
+ const m = Date.now, _ = r ? "scrollLeft" : "scrollTop", g = r ? "left" : "top", $ = e => n ? -e : e, S = () => $(o[_]), b = (e, t) => {
323
319
  o.scrollTo({
324
320
  [g]: $(e),
325
321
  behavior: t ? "smooth" : "instant"
326
322
  });
327
323
  }, z = () => {
328
324
  if (u || f) return u = !1, void v();
329
- d = !1, e.P(2);
325
+ d = !1, e.B(2);
330
326
  }, v = () => {
331
327
  w(c), c = h(z, 150);
332
328
  }, I = () => {
333
- a = m(), d && (p = !0), l && e.P(6, l()), e.P(1, y()), v();
329
+ a = m(), d && (p = !0), l && e.B(6, l()), e.B(1, S()), v();
334
330
  }, k = t => {
335
- if (u || !e.M() || t.ctrlKey) return;
331
+ if (u || !e.C() || t.ctrlKey) return;
336
332
  const o = m() - a;
337
333
  150 > o && 50 < o && (r ? t.deltaX : t.deltaY) && (u = !0);
338
334
  }, O = () => {
@@ -347,19 +343,19 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
347
343
  }), t.addEventListener("touchend", T, {
348
344
  passive: !0
349
345
  }), {
350
- J: () => {
346
+ D: () => {
351
347
  t.removeEventListener("scroll", I), t.removeEventListener("wheel", k), t.removeEventListener("touchstart", O),
352
348
  t.removeEventListener("touchend", T), w(c);
353
349
  },
354
350
  U: () => {
355
- const [t, r] = e.j();
351
+ const [t, r] = e.q();
356
352
  if (!t) return;
357
353
  p && s && s(), p = !1;
358
- const n = e.A() + t;
359
- n <= 0 || n >= e.C() + e.t() - e.o() ? b(n) : o.scrollBy({
354
+ const n = e.A(), l = n + t, c = e.j() + e.t() - e.o();
355
+ l <= 0 || l >= c || n >= c ? b(l) : o.scrollBy({
360
356
  [g]: $(t),
361
357
  behavior: "instant"
362
- }), r && (i && i(), e.o() > e.t() && e.P(1, y()));
358
+ }), r && (i && i(), e.o() > e.t() && e.B(1, S()));
363
359
  },
364
360
  G: (t, o) => {
365
361
  let r, n, s;
@@ -369,27 +365,27 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
369
365
  }, c = () => {
370
366
  if (!r) {
371
367
  if (e.o() && (w(n), n = h(l, 150)), o) {
372
- for (let [t, o] = e.l(0); t <= o; t++) if (e.R(t)) return;
368
+ for (let [t, o] = e.l(0); t <= o; t++) if (e.N(t)) return;
373
369
  l();
374
370
  }
375
- e.P(7), b(t(), o);
371
+ e.B(7), b(t(), o);
376
372
  }
377
373
  }, a = () => {
378
374
  if (r) return;
379
375
  let t;
380
- s = e.q(2, () => {
381
- t || (t = !0, S(() => {
376
+ s = e.P(2, () => {
377
+ t || (t = !0, y(() => {
382
378
  t = !1, c();
383
379
  }));
384
380
  }), c();
385
381
  };
386
- o ? (e.P(8, t()), S(a)) : a();
382
+ o ? (e.B(8, t()), y(a)) : a();
387
383
  }
388
384
  };
389
385
  }, F = (e, t) => {
390
386
  e.K(() => t);
391
387
  }, X = (e, t, o, {align: r, smooth: n, offset: s = 0} = {}) => {
392
- if (o = g(o, 0, t.N() - 1), "nearest" === r) {
388
+ if (o = g(o, 0, t.M() - 1), "nearest" === r) {
393
389
  const e = t.u(o), n = t.A();
394
390
  if (e < n) r = "start"; else {
395
391
  if (!(e + t.p(o) > n + t.o())) return;
@@ -398,9 +394,9 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
398
394
  }
399
395
  e.K(() => s + e.Z() + t.u(o) + ("end" === r ? t.p(o) - t.o() : "center" === r ? (t.p(o) - t.o()) / 2 : 0), n);
400
396
  }, Y = (e, t, o, r, n, s, l) => {
401
- const i = t.N(), c = o.W(), a = o.V();
397
+ const i = t.M(), c = o.V(), a = o.F();
402
398
  n = g(n, 0, i - 1);
403
- const u = E(r, c, a), f = j(u, n, a), m = f < 0 ? -1 : u[f], _ = () => o.u(c) + (m < 0 || m === n ? 0 : o.u(m + 1) - o.u(m)), $ = () => o.u(i) - o.u(a);
399
+ const u = A(r, c, a), f = C(u, n, a), m = f < 0 ? -1 : u[f], _ = () => o.u(c) + (m < 0 || m === n ? 0 : o.u(m + 1) - o.u(m)), $ = () => o.u(i) - o.u(a);
404
400
  if ("nearest" === s) {
405
401
  if (n < c || n >= a) return;
406
402
  const e = _(), o = t.A() + e, r = t.o() - e - $(), l = t.p(n);
@@ -419,7 +415,7 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
419
415
  return t.u(n) - e + ("end" === s ? o : "center" === s ? o / 2 : 0);
420
416
  });
421
417
  }, J = /* @__PURE__ */ o(o => {
422
- const r = i(), s = e(() => o.ee.value && o.te.u(o.oe)), l = e(() => o.ee.value && o.te.R(o.oe)), a = e(() => o.re({
418
+ const r = i(), s = e(() => o.ee.value && o.te.u(o.oe)), l = e(() => o.ee.value && o.te.N(o.oe)), a = e(() => o.re({
423
419
  item: o.ne,
424
420
  index: o.oe
425
421
  }));
@@ -460,13 +456,13 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
460
456
  ce: null,
461
457
  ae: null
462
458
  }
463
- }), U = (e, t) => {
459
+ }), D = (e, t) => {
464
460
  if (1 === e.length) {
465
461
  const t = e[0].key;
466
462
  if (null != t) return t;
467
463
  }
468
464
  return "_" + t;
469
- }, G = (e, t) => e[0] === t[0] && e[1] === t[1], K = /* @__PURE__ */ o({
465
+ }, U = (e, t) => e[0] === t[0] && e[1] === t[1], G = /* @__PURE__ */ o({
470
466
  props: {
471
467
  data: {
472
468
  type: Array,
@@ -498,29 +494,29 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
498
494
  setup(o, {emit: n, expose: a, slots: u}) {
499
495
  let f = !!o.ssrCount;
500
496
  const d = o.horizontal, p = i(), m = T(o.data.length, o.itemSize, o.cache), _ = I(m, o.ssrCount), g = ((e, t) => {
501
- let o, r, n = y();
502
- const s = /* @__PURE__ */ new WeakMap, l = V(r => {
497
+ let o, r, n = S();
498
+ const s = /* @__PURE__ */ new WeakMap, l = W(r => {
503
499
  const n = [];
504
- for (const {target: l, contentRect: {width: i, height: c}} of r) if (l === o) (i || c) && e.P(4, t ? i : c); else if (l.offsetParent) {
500
+ for (const {target: l, contentRect: {width: i, height: c}} of r) if (l === o) (i || c) && e.B(4, t ? i : c); else if (l.offsetParent) {
505
501
  const e = s.get(l);
506
502
  null != e && n.push([ e, t ? i : c ]);
507
503
  }
508
- n.length && e.P(3, n);
504
+ n.length && e.B(3, n);
509
505
  });
510
506
  return {
511
507
  ue(s, i = s.parentElement) {
512
- l.X(o = i), r = D(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
508
+ l.Y(o = i), r = V(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
513
509
  const e = t ? "overflowX" : "overflowY", o = i.style, r = o[e];
514
510
  o[e] = "hidden", h(() => {
515
511
  o[e] = r;
516
512
  });
517
513
  }), n[1](!0);
518
514
  },
519
- k() {
520
- l.J(), r && r.J(), n[1](!1), n = y();
515
+ O() {
516
+ l.D(), r && r.D(), n[1](!1), n = S();
521
517
  },
522
- fe: (e, t) => (s.set(e, t), l.X(e), () => {
523
- s.delete(e), l.Y(e);
518
+ fe: (e, t) => (s.set(e, t), l.Y(e), () => {
519
+ s.delete(e), l.J(e);
524
520
  }),
525
521
  async K(e, t) {
526
522
  await n[0] && r.G(e, t);
@@ -528,21 +524,21 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
528
524
  de() {
529
525
  r && r.U();
530
526
  },
531
- Z: e.C
527
+ Z: e.j
532
528
  };
533
- })(_, d), w = i(_.O());
534
- _.q(1, () => {
535
- w.value = _.O();
536
- }), _.q(4, () => {
529
+ })(_, d), w = i(_.T());
530
+ _.P(1, () => {
531
+ w.value = _.T();
532
+ }), _.P(4, () => {
537
533
  n("scroll", _.A());
538
- }), _.q(8, () => {
534
+ }), _.P(8, () => {
539
535
  n("scrollEnd");
540
536
  });
541
- const S = e(e => {
537
+ const y = e(e => {
542
538
  w.value;
543
539
  const t = _.l(o.bufferSize);
544
- return e && G(e, t) ? e : t;
545
- }), b = e(() => w.value && _.M()), z = e(() => w.value && _.t());
540
+ return e && U(e, t) ? e : t;
541
+ }), b = e(() => w.value && _.C()), z = e(() => w.value && _.t());
546
542
  return s(() => {
547
543
  f = !1;
548
544
  const e = p.value, t = requestAnimationFrame(() => {
@@ -552,11 +548,11 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
552
548
  cancelAnimationFrame(t);
553
549
  });
554
550
  }), l(() => {
555
- _.k(), g.k();
551
+ _.O(), g.O();
556
552
  }), c(() => o.data.length, e => {
557
- _.P(5, [ e, o.shift ]);
553
+ _.B(5, [ e, o.shift ]);
558
554
  }), c(() => o.startMargin, e => {
559
- _.P(6, e);
555
+ _.B(6, e);
560
556
  }, {
561
557
  immediate: !0
562
558
  }), c([ w ], () => {
@@ -565,7 +561,7 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
565
561
  flush: "post"
566
562
  }), a({
567
563
  get cache() {
568
- return m.B();
564
+ return m.H();
569
565
  },
570
566
  get scrollOffset() {
571
567
  return _.A();
@@ -576,7 +572,7 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
576
572
  get viewportSize() {
577
573
  return _.o();
578
574
  },
579
- findItemIndex: _.T,
575
+ findItemIndex: _.R,
580
576
  getItemOffset: _.u,
581
577
  getItemSize: _.p,
582
578
  scrollToIndex: (e, t) => X(g, _, e, t),
@@ -591,7 +587,7 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
591
587
  index: e
592
588
  });
593
589
  return t(J, {
594
- key: U(r, e),
590
+ key: D(r, e),
595
591
  ee: w,
596
592
  te: _,
597
593
  se: g.fe,
@@ -606,11 +602,11 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
606
602
  };
607
603
  if (o.keepMounted) {
608
604
  const e = o.data.length, t = new Set(o.keepMounted);
609
- for (let [e, o] = S.value; e <= o; e++) t.add(e);
605
+ for (let [e, o] = y.value; e <= o; e++) t.add(e);
610
606
  $([ ...t ]).forEach(t => {
611
607
  t < e && l.push(i(t));
612
608
  });
613
- } else for (let [e, t] = S.value; e <= t; e++) l.push(i(e));
609
+ } else for (let [e, t] = y.value; e <= t; e++) l.push(i(e));
614
610
  return t(e, {
615
611
  ref: p,
616
612
  style: {
@@ -629,7 +625,7 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
629
625
  var c;
630
626
  };
631
627
  }
632
- }), Q = /* @__PURE__ */ o({
628
+ }), K = /* @__PURE__ */ o({
633
629
  props: {
634
630
  data: {
635
631
  type: Array,
@@ -679,7 +675,7 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
679
675
  width: "100%",
680
676
  height: "100%"
681
677
  }
682
- }, [ t(K, {
678
+ }, [ t(G, {
683
679
  ref: u,
684
680
  data: e.data,
685
681
  bufferSize: e.bufferSize,
@@ -699,7 +695,7 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
699
695
  var o;
700
696
  };
701
697
  }
702
- }), Z = /* @__PURE__ */ o({
698
+ }), Q = /* @__PURE__ */ o({
703
699
  props: {
704
700
  data: {
705
701
  type: Array,
@@ -724,14 +720,14 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
724
720
  setup(o, {emit: n, slots: a, expose: u}) {
725
721
  let f = !!o.ssrCount;
726
722
  const d = o.horizontal, p = i(), m = T(o.data.length, o.itemSize, o.cache), _ = I(m, o.ssrCount), g = ((e, t) => {
727
- let o, r, n, s, l, i = y();
728
- const c = /* @__PURE__ */ new WeakMap, a = V(r => {
723
+ let o, r, n, s, l, i = S();
724
+ const c = /* @__PURE__ */ new WeakMap, a = W(r => {
729
725
  const n = [];
730
726
  for (const {target: e, contentRect: {width: s, height: i}} of r) if (e === o) l && l(); else if (e.offsetParent) {
731
727
  const o = c.get(e);
732
728
  null != o && n.push([ o, t ? s : i ]);
733
729
  }
734
- n.length && e.P(3, n);
730
+ n.length && e.B(3, n);
735
731
  });
736
732
  return {
737
733
  ue(c) {
@@ -739,17 +735,17 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
739
735
  const s = r ? "offsetLeft" : "offsetTop", l = n + (p ? t.clientWidth - e[s] - e.offsetWidth : e[s]), i = e.offsetParent;
740
736
  return e !== o && i ? m(i, t, o, r, l) : l;
741
737
  }, _ = s = () => m(c, d, u.body, t), g = l = () => {
742
- e.P(4, d[t ? "clientWidth" : "clientHeight"]);
738
+ e.B(4, d[t ? "clientWidth" : "clientHeight"]);
743
739
  };
744
- f.addEventListener("resize", g), a.X(d), n = () => {
740
+ f.addEventListener("resize", g), a.Y(d), n = () => {
745
741
  f.removeEventListener("resize", g);
746
- }, r = D(e, f, d, t, p, null, _), i[1](!0);
742
+ }, r = V(e, f, d, t, p, null, _), i[1](!0);
747
743
  },
748
- k() {
749
- n && n(), a.J(), r && r.J(), i[1](!1), i = y();
744
+ O() {
745
+ n && n(), a.D(), r && r.D(), i[1](!1), i = S();
750
746
  },
751
- fe: (e, t) => (c.set(e, t), a.X(e), () => {
752
- c.delete(e), a.Y(e);
747
+ fe: (e, t) => (c.set(e, t), a.Y(e), () => {
748
+ c.delete(e), a.J(e);
753
749
  }),
754
750
  async K(e, t) {
755
751
  await i[0] && r.G(e, t);
@@ -759,34 +755,34 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
759
755
  },
760
756
  Z: () => s()
761
757
  };
762
- })(_, d), $ = i(_.O());
763
- _.q(1, () => {
764
- $.value = _.O();
765
- }), _.q(4, () => {
758
+ })(_, d), $ = i(_.T());
759
+ _.P(1, () => {
760
+ $.value = _.T();
761
+ }), _.P(4, () => {
766
762
  n("scroll");
767
- }), _.q(8, () => {
763
+ }), _.P(8, () => {
768
764
  n("scrollEnd");
769
765
  });
770
766
  const h = e(e => {
771
767
  $.value;
772
768
  const t = _.l(o.bufferSize);
773
- return e && G(e, t) ? e : t;
774
- }), w = e(() => $.value && _.M()), S = e(() => $.value && _.t());
769
+ return e && U(e, t) ? e : t;
770
+ }), w = e(() => $.value && _.C()), y = e(() => $.value && _.t());
775
771
  return s(() => {
776
772
  f = !1;
777
773
  const e = p.value;
778
774
  e && g.ue(e);
779
775
  }), l(() => {
780
- _.k(), g.k();
776
+ _.O(), g.O();
781
777
  }), c(() => o.data.length, e => {
782
- _.P(5, [ e, o.shift ]);
778
+ _.B(5, [ e, o.shift ]);
783
779
  }), c([ $ ], () => {
784
780
  g.de();
785
781
  }, {
786
782
  flush: "post"
787
783
  }), u({
788
784
  get cache() {
789
- return m.B();
785
+ return m.H();
790
786
  },
791
787
  get scrollOffset() {
792
788
  return _.A();
@@ -794,19 +790,19 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
794
790
  get viewportSize() {
795
791
  return _.o();
796
792
  },
797
- findItemIndex: _.T,
793
+ findItemIndex: _.R,
798
794
  getItemOffset: _.u,
799
795
  getItemSize: _.p,
800
796
  scrollToIndex: (e, t) => X(g, _, e, t)
801
797
  }), () => {
802
- const e = o.as, n = o.item, s = S.value, l = [];
798
+ const e = o.as, n = o.item, s = y.value, l = [];
803
799
  for (let [e, r] = h.value; e <= r; e++) {
804
800
  const r = a.default({
805
801
  item: o.data[e],
806
802
  index: e
807
803
  });
808
804
  l.push(t(J, {
809
- key: U(r, e),
805
+ key: D(r, e),
810
806
  ee: $,
811
807
  te: _,
812
808
  se: g.fe,
@@ -836,14 +832,14 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
836
832
  var i;
837
833
  };
838
834
  }
839
- }), ee = /* @__PURE__ */ o(e => {
835
+ }), Z = /* @__PURE__ */ o(e => {
840
836
  const o = i();
841
837
  return c([ o, () => e.me.pe, () => e.me._e ], ([t, o, r], n, s) => {
842
838
  !t || null == o && null == r || s(e.se(t, o, r));
843
839
  }, {
844
840
  flush: "post"
845
841
  }), () => {
846
- const {ge: r, $e: n, he: s, we: l, Se: i, ye: c} = e.me;
842
+ const {ge: r, $e: n, he: s, we: l, ye: i, Se: c} = e.me;
847
843
  return t("div", {
848
844
  ref: o,
849
845
  role: l,
@@ -870,13 +866,13 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
870
866
  xe: null,
871
867
  se: null
872
868
  }
873
- }), te = /* @__PURE__ */ o(e => () => {
874
- const {ve: o, Ie: r, ye: n} = e.me;
869
+ }), ee = /* @__PURE__ */ o(e => () => {
870
+ const {ve: o, Ie: r, Se: n} = e.me;
875
871
  return t("div", {
876
872
  role: "row",
877
873
  "aria-rowindex": o + 1,
878
874
  style: n
879
- }, [ r.map(r => t(ee, {
875
+ }, [ r.map(r => t(Z, {
880
876
  key: r.ge,
881
877
  me: r,
882
878
  re: e.re,
@@ -893,12 +889,12 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
893
889
  ke: null,
894
890
  se: null
895
891
  }
896
- }), oe = /* @__PURE__ */ o(e => () => {
897
- const {Oe: o, ye: r} = e.me;
892
+ }), te = /* @__PURE__ */ o(e => () => {
893
+ const {Oe: o, Se: r} = e.me;
898
894
  return t("div", {
899
895
  role: "rowgroup",
900
896
  style: r
901
- }, [ o.map(o => t(te, {
897
+ }, [ o.map(o => t(ee, {
902
898
  key: o.ve,
903
899
  me: o,
904
900
  re: e.re,
@@ -914,7 +910,7 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
914
910
  ke: null,
915
911
  se: null
916
912
  }
917
- }), re = /* @__PURE__ */ o({
913
+ }), oe = /* @__PURE__ */ o({
918
914
  props: {
919
915
  rows: {
920
916
  type: [ Number, Array ],
@@ -948,7 +944,7 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
948
944
  },
949
945
  emits: [ "verticalScroll", "horizontalScroll", "scrollEnd" ],
950
946
  setup(o, {emit: r, expose: n, slots: u}) {
951
- const m = i(), _ = A(o.rows, o.rowHeight, o.gap), w = A(o.cols, o.colWidth, o.gap), S = e(() => _.D(o.rows, o.rowHeight)), b = e(() => w.D(o.cols, o.colWidth)), z = e(() => ((e = f) => {
947
+ const m = i(), _ = E(o.rows, o.rowHeight, o.gap), w = E(o.cols, o.colWidth, o.gap), y = e(() => _.X(o.rows, o.rowHeight)), b = e(() => w.X(o.cols, o.colWidth)), z = e(() => ((e = f) => {
952
948
  const t = /* @__PURE__ */ new Map;
953
949
  for (const o of e) {
954
950
  const e = o.rowIndex + (o.rowSpan || 1);
@@ -959,15 +955,15 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
959
955
  }
960
956
  return t;
961
957
  })(o.spans)), x = I(_), k = I(w), O = ((e, t) => {
962
- let o, r, n, s = y();
963
- const l = /* @__PURE__ */ new WeakMap, i = /* @__PURE__ */ new WeakMap, c = V(r => {
958
+ let o, r, n, s = S();
959
+ const l = /* @__PURE__ */ new WeakMap, i = /* @__PURE__ */ new WeakMap, c = W(r => {
964
960
  const n = [], s = [];
965
- for (const {target: c, contentRect: {width: a, height: u}} of r) if (c === o) (a || u) && (e.P(4, u),
966
- t.P(4, a)); else if (c.offsetParent) {
961
+ for (const {target: c, contentRect: {width: a, height: u}} of r) if (c === o) (a || u) && (e.B(4, u),
962
+ t.B(4, a)); else if (c.offsetParent) {
967
963
  const e = l.get(c), t = i.get(c);
968
964
  null != e && n.push([ e, u ]), null != t && s.push([ t, a ]);
969
965
  }
970
- n.length && e.P(3, n), s.length && t.P(3, s);
966
+ n.length && e.B(3, n), s.length && t.B(3, s);
971
967
  });
972
968
  return {
973
969
  async K(e, t) {
@@ -975,8 +971,8 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
975
971
  },
976
972
  ue(l) {
977
973
  const i = o = l.parentElement;
978
- c.X(i);
979
- const a = (e, t) => D(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
974
+ c.Y(i);
975
+ const a = (e, t) => V(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
980
976
  const e = t ? "overflowX" : "overflowY", o = i.style, r = o[e];
981
977
  o[e] = "hidden", h(() => {
982
978
  o[e] = r;
@@ -984,47 +980,47 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
984
980
  });
985
981
  r = a(e, !1), n = a(t, !0), s[1](!0);
986
982
  },
987
- k() {
988
- c.J(), r && r.J(), n && n.J(), s[1](!1), s = y();
983
+ O() {
984
+ c.D(), r && r.D(), n && n.D(), s[1](!1), s = S();
989
985
  },
990
- fe: (e, t, o) => (null != t && l.set(e, t), null != o && i.set(e, o), c.X(e), () => {
991
- l.delete(e), i.delete(e), c.Y(e);
986
+ fe: (e, t, o) => (null != t && l.set(e, t), null != o && i.set(e, o), c.Y(e), () => {
987
+ l.delete(e), i.delete(e), c.J(e);
992
988
  }),
993
989
  de() {
994
990
  r && r.U(), n && n.U();
995
991
  }
996
992
  };
997
- })(x, k), T = i(x.O() + k.O()), R = () => {
998
- T.value = x.O() + k.O();
993
+ })(x, k), T = i(x.T() + k.T()), j = () => {
994
+ T.value = x.T() + k.T();
999
995
  };
1000
- x.q(1, R), k.q(1, R);
1001
- let q = !1;
1002
- x.q(4, () => {
1003
- q = !0, r("verticalScroll", x.A());
1004
- }), k.q(4, () => {
1005
- q = !0, r("horizontalScroll", k.A());
996
+ x.P(1, j), k.P(1, j);
997
+ let F = !1;
998
+ x.P(4, () => {
999
+ F = !0, r("verticalScroll", x.A());
1000
+ }), k.P(4, () => {
1001
+ F = !0, r("horizontalScroll", k.A());
1006
1002
  });
1007
- const F = () => {
1008
- !q || x.M() || k.M() || (q = !1, r("scrollEnd"));
1003
+ const X = () => {
1004
+ !F || x.C() || k.C() || (F = !1, r("scrollEnd"));
1009
1005
  };
1010
- x.q(8, F), k.q(8, F), a(() => {
1011
- M(x, _, o.rows, S.value, o.headerRows, o.footerRows);
1012
- }), a(() => {
1013
- M(k, w, o.cols, b.value, o.headerCols, o.footerCols);
1006
+ x.P(8, X), k.P(8, X), a(() => {
1007
+ _.W(o.headerRows, o.footerRows), w.W(o.headerCols, o.footerCols);
1008
+ const e = R(o.rows), t = R(o.cols);
1009
+ e !== x.M() && x.B(5, [ e ]), t !== k.M() && k.B(5, [ t ]), x.B(9, y.value), k.B(9, b.value);
1014
1010
  });
1015
- const X = e(() => T.value && x.N()), J = e(() => T.value && k.N()), U = e(() => (T.value,
1011
+ const J = e(() => T.value && x.M()), D = e(() => T.value && k.M()), U = e(() => (T.value,
1016
1012
  ((e, t, [o, r], [n, s], l, i = f, c = f, a) => {
1017
- const u = e.S(), m = t.S(), _ = e.W(), h = e.V(), w = t.W(), S = t.V();
1018
- o = g(o, _, h), r = d(r, h - 1), n = g(n, w, S), s = d(s, S - 1);
1019
- const y = E(i, _, h), b = p(w - 1, 0), z = [], x = [], v = [];
1013
+ const u = e.h(), m = t.h(), _ = e.V(), h = e.F(), w = t.V(), y = t.F();
1014
+ o = g(o, _, h), r = d(r, h - 1), n = g(n, w, y), s = d(s, y - 1);
1015
+ const S = A(i, _, h), b = p(w - 1, 0), z = [], x = [], v = [];
1020
1016
  for (const e of c) e.rowIndex < u && e.colIndex < m && (v.push(e), z.push(e.rowIndex));
1021
- const I = v.length, k = j(y, o, h), O = k < 0 ? -1 : y[k];
1017
+ const I = v.length, k = C(S, o, h), O = k < 0 ? -1 : S[k];
1022
1018
  O >= 0 && z.push(O);
1023
- const T = P($(z), u, _, o, r, h);
1019
+ const T = q($(z), u, _, o, r, h);
1024
1020
  for (let e = 0; e < T.length; e++) for (const t of l.get(T[e]) || f) {
1025
- const {rowIndex: l, colIndex: i} = t, c = B(t, u), a = H(t, m);
1021
+ const {rowIndex: l, colIndex: i} = t, c = P(t, u), a = B(t, m);
1026
1022
  if ((e < 1 || T[e - 1] < l) && i < m && (c - l > 1 || a - i > 1)) {
1027
- let e = (l < _ || p(l, o) < d(c, r + 1) || h < c || O >= l && O < c) && (i < w || p(i, n) < d(a, s + 1) || S < a);
1023
+ let e = (l < _ || p(l, o) < d(c, r + 1) || h < c || O >= l && O < c) && (i < w || p(i, n) < d(a, s + 1) || y < a);
1028
1024
  for (let t = 0; !e && t < I; t++) {
1029
1025
  const o = v[t];
1030
1026
  e = o.rowIndex >= l && o.rowIndex < c && o.colIndex >= i && o.colIndex < a;
@@ -1033,55 +1029,55 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
1033
1029
  }
1034
1030
  }
1035
1031
  for (const {rowIndex: e, colIndex: t} of v) {
1036
- const o = j(y, e, h);
1037
- z.push(e), o >= 0 && z.push(y[o]), x.push(t);
1032
+ const o = C(S, e, h);
1033
+ z.push(e), o >= 0 && z.push(S[o]), x.push(t);
1038
1034
  }
1039
1035
  $(z), $(x);
1040
- const R = P(z, u, _, o, r, h), N = P(x, m, w, n, s, S), A = R.length, M = N.length, q = /* @__PURE__ */ new Map, V = [], D = [];
1036
+ const R = q(z, u, _, o, r, h), N = q(x, m, w, n, s, y), E = R.length, j = N.length, W = /* @__PURE__ */ new Map, V = [], F = [];
1041
1037
  for (const e of v) {
1042
- const t = B(e, u), o = H(e, m);
1043
- V.push(t), D.push(o);
1038
+ const t = P(e, u), o = B(e, m);
1039
+ V.push(t), F.push(o);
1044
1040
  const r = N.indexOf(e.colIndex);
1045
- for (let n = R.indexOf(e.rowIndex); n < A && R[n] < t; n++) {
1041
+ for (let n = R.indexOf(e.rowIndex); n < E && R[n] < t; n++) {
1046
1042
  const t = R[n] * m;
1047
- for (let n = r; n < M && N[n] < o; n++) q.set(t + N[n], e);
1043
+ for (let n = r; n < j && N[n] < o; n++) W.set(t + N[n], e);
1048
1044
  }
1049
1045
  }
1050
- const F = [];
1051
- for (const e of N) F.push(!t.H(e) && null);
1052
- const X = [], Y = e.u(_), J = [];
1053
- let U = J;
1054
- const G = C.get(e), K = /* @__PURE__ */ new Map;
1046
+ const X = [];
1047
+ for (const e of N) X.push(!t.L(e) && null);
1048
+ const Y = [], J = e.u(_), D = [];
1049
+ let U = D;
1050
+ const G = M.get(e), K = /* @__PURE__ */ new Map;
1055
1051
  for (const l of R) {
1056
- const i = l < _, c = l >= h, f = j(y, l, h), d = i ? 0 : c ? h : f < 0 ? -1 : y[f];
1052
+ const i = l < _, c = l >= h, f = C(S, l, h), d = i ? 0 : c ? h : f < 0 ? -1 : S[f];
1057
1053
  if (l === d) {
1058
- const e = i ? _ : c ? u : f + 1 < y.length ? y[f + 1] : h;
1054
+ const e = i ? _ : c ? u : f + 1 < S.length ? S[f + 1] : h;
1059
1055
  V.push(e);
1060
1056
  const t = [];
1061
- J.push({
1057
+ D.push({
1062
1058
  Re: i ? -1 : c ? -2 : -3 - d,
1063
1059
  Oe: t,
1064
- ye: W(d, e, i || c ? 0 : null, c ? "bottom" : "top", 4)
1060
+ Se: L(d, e, i || c ? 0 : null, c ? "bottom" : "top", 4)
1065
1061
  }), U = t;
1066
- } else d < 0 && (U = J);
1067
- const g = f >= 0 && l === d, $ = i || c || l === O || l >= o && l <= r, z = g ? Y : null, x = l * m, v = G && G.get(l), I = v && v.Ie, k = [];
1068
- let T = 0, R = !e.H(l) && null, A = l + 1, C = !1;
1069
- for (let e = 0; e < M; e++) {
1070
- const o = N[e], r = o < w, c = o >= S, f = r || c || o >= n && o <= s, d = q.get(x + o);
1062
+ } else d < 0 && (U = D);
1063
+ const g = f >= 0 && l === d, $ = i || c || l === O || l >= o && l <= r, z = g ? J : null, x = l * m, v = G && G.get(l), I = v && v.Ie, k = [];
1064
+ let T = 0, R = !e.L(l) && null, E = l + 1, M = !1;
1065
+ for (let e = 0; e < j; e++) {
1066
+ const o = N[e], r = o < w, c = o >= y, f = r || c || o >= n && o <= s, d = W.get(x + o);
1071
1067
  if (d ? d.rowIndex === l && d.colIndex === o : $ && f) {
1072
- const n = d ? B(d, u) : l + 1, s = d ? H(d, m) : o + 1, f = n - l, _ = s - o, $ = f > 1, h = _ > 1, w = $ || h;
1073
- let S, y;
1074
- A = p(A, n);
1068
+ const n = d ? P(d, u) : l + 1, s = d ? B(d, m) : o + 1, f = n - l, _ = s - o, $ = f > 1, h = _ > 1, w = $ || h;
1069
+ let y, S;
1070
+ E = p(E, n);
1075
1071
  const z = r ? t.u(o) : null, x = c ? t.u(m) - t.u(s) : null;
1076
- !1 !== R || $ || (S = l, R = !0), !1 !== F[e] || h || (y = o, F[e] = !0);
1077
- const v = i ? "columnheader" : o === b && (r || g) ? "rowheader" : "cell", O = w ? f : void 0, N = w ? _ : void 0, M = "cell" !== v && a && a.rowIndex === l && a.colIndex === o ? a.order : void 0;
1078
- let E;
1072
+ !1 !== R || $ || (y = l, R = !0), !1 !== X[e] || h || (S = o, X[e] = !0);
1073
+ const v = i ? "columnheader" : o === b && (r || g) ? "rowheader" : "cell", O = w ? f : void 0, N = w ? _ : void 0, A = "cell" !== v && a && a.rowIndex === l && a.colIndex === o ? a.order : void 0;
1074
+ let C;
1079
1075
  if (I) {
1080
1076
  const e = I.length;
1081
1077
  for (;T < e && I[T].ge < o; ) T++;
1082
- T < e && I[T].ge === o && (E = I[T]);
1078
+ T < e && I[T].ge === o && (C = I[T]);
1083
1079
  }
1084
- if (!E || E.$e !== O || E.he !== N || E.Ne !== z || E.Ae !== x || E.pe !== S || E._e !== y || E.we !== v || E.Se !== M) {
1080
+ if (!C || C.$e !== O || C.he !== N || C.Ne !== z || C.Ee !== x || C.pe !== y || C._e !== S || C.we !== v || C.ye !== A) {
1085
1081
  let e = "1/l" + o;
1086
1082
  w && (e += "/l" + n + "/l" + s);
1087
1083
  const t = {
@@ -1091,42 +1087,42 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
1091
1087
  };
1092
1088
  $ && (t.height = "0px", t.minHeight = "100%", t.zIndex = 1), h && (t.width = "0px",
1093
1089
  t.minWidth = "100%"), (r || c) && (t[r ? "insetInlineStart" : "insetInlineEnd"] = (r ? z : x) + "px",
1094
- t.position = "sticky", t.zIndex = 2), E = {
1090
+ t.position = "sticky", t.zIndex = 2), C = {
1095
1091
  ge: o,
1096
1092
  $e: O,
1097
1093
  he: N,
1098
- pe: S,
1099
- _e: y,
1094
+ pe: y,
1095
+ _e: S,
1100
1096
  we: v,
1101
- Se: M,
1102
- ye: t,
1097
+ ye: A,
1098
+ Se: t,
1103
1099
  Ne: z,
1104
- Ae: x
1105
- }, C = !0;
1100
+ Ee: x
1101
+ }, M = !0;
1106
1102
  }
1107
- k.push(E);
1103
+ k.push(C);
1108
1104
  }
1109
1105
  }
1110
- if (X.push(R), k.length) {
1111
- const e = v && !C && v.Ie.length === k.length && v.Me === z ? v : {
1106
+ if (Y.push(R), k.length) {
1107
+ const e = v && !M && v.Ie.length === k.length && v.Me === z ? v : {
1112
1108
  ve: l,
1113
1109
  Ie: k,
1114
- ye: W(l, A, z, "top", 3),
1110
+ Se: L(l, E, z, "top", 3),
1115
1111
  Me: z
1116
1112
  };
1117
1113
  K.set(l, e), U.push(e);
1118
1114
  }
1119
1115
  }
1120
- return C.set(e, K), {
1121
- Ce: L(e, R, X, $(V), "max-content", u),
1122
- Ee: L(t, N, F, $(D), "minmax(max-content,auto)", m),
1123
- je: J
1116
+ return M.set(e, K), {
1117
+ Ae: H(e, R, Y, $(V), "max-content", u),
1118
+ Ce: H(t, N, X, $(F), "minmax(max-content,auto)", m),
1119
+ je: D
1124
1120
  };
1125
- })(_, w, x.l(o.bufferSize), k.l(o.bufferSize), z.value, o.sectionRows, o.keepMounted, o.ariaSort))), G = e(() => T.value && (x.M() || k.M()));
1121
+ })(_, w, x.l(o.bufferSize), k.l(o.bufferSize), z.value, o.sectionRows, o.keepMounted, o.ariaSort))), G = e(() => T.value && (x.C() || k.C()));
1126
1122
  return s(() => {
1127
1123
  O.ue(m.value);
1128
1124
  }), l(() => {
1129
- x.k(), k.k(), O.k();
1125
+ x.O(), k.O(), O.O();
1130
1126
  }), c([ T ], () => {
1131
1127
  O.de();
1132
1128
  }, {
@@ -1150,8 +1146,8 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
1150
1146
  get viewportWidth() {
1151
1147
  return k.o();
1152
1148
  },
1153
- findRowIndex: x.T,
1154
- findColIndex: k.T,
1149
+ findRowIndex: x.R,
1150
+ findColIndex: k.R,
1155
1151
  getRowOffset: x.u,
1156
1152
  getColOffset: k.u,
1157
1153
  getRowSize: x.p,
@@ -1173,7 +1169,7 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
1173
1169
  }
1174
1170
  })(O, x, k, e, t)
1175
1171
  }), () => {
1176
- const {Ce: e, Ee: r, je: n} = U.value, s = x.u(0), l = k.u(0), i = {
1172
+ const {Ae: e, Ce: r, je: n} = U.value, s = x.u(0), l = k.u(0), i = {
1177
1173
  contain: "size style",
1178
1174
  overflowAnchor: "none",
1179
1175
  flex: "none",
@@ -1188,8 +1184,8 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
1188
1184
  };
1189
1185
  return t("div", {
1190
1186
  role: "table",
1191
- "aria-rowcount": X.value,
1192
- "aria-colcount": J.value,
1187
+ "aria-rowcount": J.value,
1188
+ "aria-colcount": D.value,
1193
1189
  style: {
1194
1190
  overflow: "auto",
1195
1191
  contain: "strict",
@@ -1199,14 +1195,14 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
1199
1195
  }, [ t("div", {
1200
1196
  ref: m,
1201
1197
  style: i
1202
- }, [ n.map(e => "Oe" in e ? t(oe, {
1198
+ }, [ n.map(e => "Oe" in e ? t(te, {
1203
1199
  key: e.Re,
1204
1200
  me: e,
1205
1201
  re: u.default,
1206
1202
  Te: o.rows,
1207
1203
  ke: o.cols,
1208
1204
  se: O.fe
1209
- }, null, 8, [ "me", "re", "Te", "ke", "se" ]) : t(te, {
1205
+ }, null, 8, [ "me", "re", "Te", "ke", "se" ]) : t(ee, {
1210
1206
  key: e.ve,
1211
1207
  me: e,
1212
1208
  re: u.default,
@@ -1218,5 +1214,5 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
1218
1214
  }
1219
1215
  });
1220
1216
 
1221
- export { re as VGrid, Q as VList, K as Virtualizer, Z as WindowVirtualizer };
1217
+ export { oe as VGrid, K as VList, G as Virtualizer, Q as WindowVirtualizer };
1222
1218
  //# sourceMappingURL=index.js.map