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