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