virtua 0.48.6 → 0.48.8
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/lib/core/index.cjs +8 -2
- package/lib/core/index.cjs.map +1 -1
- package/lib/core/index.js +110 -104
- package/lib/core/index.js.map +1 -1
- package/lib/index.cjs +8 -2
- package/lib/index.cjs.map +1 -1
- package/lib/index.js +8 -2
- package/lib/index.js.map +1 -1
- package/lib/solid/index.cjs +126 -124
- package/lib/solid/index.cjs.map +1 -1
- package/lib/solid/index.js +106 -104
- package/lib/solid/index.js.map +1 -1
- package/lib/solid/index.jsx +30 -20
- package/lib/solid/index.jsx.map +1 -1
- package/lib/vue/index.cjs +44 -40
- package/lib/vue/index.cjs.map +1 -1
- package/lib/vue/index.js +67 -63
- package/lib/vue/index.js.map +1 -1
- package/package.json +12 -9
package/lib/solid/index.cjs
CHANGED
|
@@ -1,13 +1,13 @@
|
|
|
1
1
|
var e = require("solid-js/web"), t = require("solid-js");
|
|
2
2
|
|
|
3
|
-
const r = null, {min: n, max: o, abs: s, floor: i} = Math,
|
|
3
|
+
const r = null, {min: n, max: o, abs: s, floor: i} = Math, c = (e, t, r) => n(r, o(t, e)), l = e => [ ...e ].sort(((e, t) => e - t)), u = "function" == typeof queueMicrotask ? queueMicrotask : e => {
|
|
4
4
|
Promise.resolve().then(e);
|
|
5
|
-
},
|
|
5
|
+
}, f = () => {
|
|
6
6
|
let e;
|
|
7
7
|
return [ new Promise((t => {
|
|
8
8
|
e = t;
|
|
9
9
|
})), e ];
|
|
10
|
-
},
|
|
10
|
+
}, a = e => {
|
|
11
11
|
let t;
|
|
12
12
|
return () => (e && (t = e(), e = void 0), t);
|
|
13
13
|
}, d = (e, t, r) => {
|
|
@@ -20,55 +20,55 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
20
20
|
}, h = (e, t, r) => {
|
|
21
21
|
const o = -1 === e.o[t];
|
|
22
22
|
return e.o[t] = r, e.l = n(t, e.l), o;
|
|
23
|
-
},
|
|
23
|
+
}, p = (e, t) => {
|
|
24
24
|
if (!e.u) return 0;
|
|
25
25
|
if (e.l >= t) return e.h[t];
|
|
26
26
|
e.l < 0 && (e.h[0] = 0, e.l = 0);
|
|
27
27
|
let r = e.l, n = e.h[r];
|
|
28
28
|
for (;r < t; ) n += g(e, r), e.h[++r] = n;
|
|
29
29
|
return e.l = t, n;
|
|
30
|
-
},
|
|
30
|
+
}, v = (e, t, r = 0, n = e.u - 1) => {
|
|
31
31
|
let o = r;
|
|
32
32
|
for (;r <= n; ) {
|
|
33
33
|
const s = i((r + n) / 2);
|
|
34
|
-
|
|
34
|
+
p(e, s) <= t ? (o = s, r = s + 1) : n = s - 1;
|
|
35
35
|
}
|
|
36
|
-
return
|
|
36
|
+
return c(o, 0, e.u - 1);
|
|
37
37
|
}, m = (e, t, r) => {
|
|
38
38
|
const o = t - e.u;
|
|
39
39
|
return e.l = r ? -1 : n(t - 1, e.l), e.u = t, o > 0 ? (d(e.h, o), d(e.o, o, r),
|
|
40
40
|
e.i * o) : (e.h.splice(o), (r ? e.o.splice(0, -o) : e.o.splice(o)).reduce(((t, r) => t - (-1 === r ? e.i : r)), 0));
|
|
41
|
-
}, S = e => e.documentElement, $ = e => e.ownerDocument, b = e => e.defaultView, x = /*#__PURE__*/
|
|
42
|
-
let
|
|
41
|
+
}, S = e => e.documentElement, $ = e => e.ownerDocument, b = e => e.defaultView, x = /*#__PURE__*/ a((() => !!/iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0)), z = /*#__PURE__*/ a((() => "scrollBehavior" in S(document).style)), w = (e, t = 40, i = 0, c, u = !1) => {
|
|
42
|
+
let f = !!i, a = 1, S = 0, $ = 0, b = 0, z = 0, w = 0, y = 0, _ = 0, I = 0, k = r, T = [ 0, f ? o(i - 1, 0) : -1 ], M = 0, O = !1;
|
|
43
43
|
const R = ((e, t, r) => ({
|
|
44
44
|
i: t,
|
|
45
45
|
o: r ? d(r.slice(0, n(e, r.length)), o(0, e - r.length)) : d([], e),
|
|
46
46
|
u: e,
|
|
47
47
|
l: -1,
|
|
48
48
|
h: d([], e + 1)
|
|
49
|
-
}))(e,
|
|
50
|
-
if (o = n(o, e.u - 1),
|
|
51
|
-
const n =
|
|
52
|
-
return [
|
|
49
|
+
}))(e, c ? c[1] : t, c && c[0]), q = new Set, J = () => b - $, B = () => J() + w + z, C = (e, t) => ((e, t, r, o) => {
|
|
50
|
+
if (o = n(o, e.u - 1), p(e, o) <= t) {
|
|
51
|
+
const n = v(e, r, o);
|
|
52
|
+
return [ v(e, t, o, n), n ];
|
|
53
53
|
}
|
|
54
54
|
{
|
|
55
|
-
const n =
|
|
56
|
-
return [ n,
|
|
55
|
+
const n = v(e, t, void 0, o);
|
|
56
|
+
return [ n, v(e, r, n) ];
|
|
57
57
|
}
|
|
58
|
-
})(R, e, t, T[0]), E = () =>
|
|
59
|
-
const r =
|
|
58
|
+
})(R, e, t, T[0]), E = () => p(R, R.u), H = (e, t) => {
|
|
59
|
+
const r = p(R, e) - w;
|
|
60
60
|
return t ? E() - r - L(e) : r;
|
|
61
61
|
}, L = e => g(R, e), P = (e, t = -1) => R.o[e] === t, W = e => {
|
|
62
62
|
e && (x() && 0 !== _ || k && 1 === I ? w += e : z += e);
|
|
63
63
|
};
|
|
64
64
|
return {
|
|
65
|
-
|
|
65
|
+
p: () => {
|
|
66
66
|
q.clear();
|
|
67
67
|
},
|
|
68
|
-
|
|
68
|
+
v: () => a,
|
|
69
69
|
m: () => (e => [ e.o.slice(), e.i ])(R),
|
|
70
70
|
S: (e = 200) => {
|
|
71
|
-
if (!O ||
|
|
71
|
+
if (!O || f) return T;
|
|
72
72
|
let t, r;
|
|
73
73
|
if (y) [t, r] = T; else {
|
|
74
74
|
let s = o(0, B()), i = s + S;
|
|
@@ -77,7 +77,7 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
77
77
|
}
|
|
78
78
|
return [ o(t, 0), n(r, R.u - 1) ];
|
|
79
79
|
},
|
|
80
|
-
$: e =>
|
|
80
|
+
$: e => v(R, e - $),
|
|
81
81
|
_: P,
|
|
82
82
|
I: H,
|
|
83
83
|
k: L,
|
|
@@ -95,7 +95,7 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
95
95
|
};
|
|
96
96
|
},
|
|
97
97
|
H: (e, t) => {
|
|
98
|
-
let n, i,
|
|
98
|
+
let n, i, c = 0;
|
|
99
99
|
switch (e) {
|
|
100
100
|
case 1:
|
|
101
101
|
{
|
|
@@ -103,22 +103,28 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
103
103
|
const e = y;
|
|
104
104
|
y = 0;
|
|
105
105
|
const r = t - b, n = s(r);
|
|
106
|
-
e && n < s(e) + 1 || 0 !== I || (_ = r < 0 ? 2 : 1),
|
|
106
|
+
e && n < s(e) + 1 || 0 !== I || (_ = r < 0 ? 2 : 1), f && (f = !1), b = t, c = 4;
|
|
107
107
|
const o = J();
|
|
108
|
-
o >= -S && o <= E() && (
|
|
108
|
+
o >= -S && o <= E() && (c += 1, i = n > S);
|
|
109
109
|
break;
|
|
110
110
|
}
|
|
111
111
|
|
|
112
112
|
case 2:
|
|
113
|
-
|
|
113
|
+
c = 8, 0 !== _ && (n = !0, c += 1), _ = 0, I = 0, k = r;
|
|
114
114
|
break;
|
|
115
115
|
|
|
116
116
|
case 3:
|
|
117
117
|
{
|
|
118
118
|
const e = t.filter((([e, t]) => !P(e, t)));
|
|
119
119
|
if (!e.length) break;
|
|
120
|
-
W(e.reduce(((e, [t, r]) =>
|
|
121
|
-
|
|
120
|
+
W(e.reduce(((e, [t, r]) => {
|
|
121
|
+
let n;
|
|
122
|
+
if (2 === I) n = !0; else if (k && 1 === I) n = t < k[0]; else {
|
|
123
|
+
const e = J(), r = H(t), o = L(t);
|
|
124
|
+
n = 1 !== _ && 0 === I ? r + o < e : r < e && r + o < e + S;
|
|
125
|
+
}
|
|
126
|
+
return n && (e += r - L(t)), e;
|
|
127
|
+
}), 0));
|
|
122
128
|
for (const [t, r] of e) {
|
|
123
129
|
const e = L(t), n = h(R, t, r);
|
|
124
130
|
u && (M += n ? r : r - e);
|
|
@@ -129,18 +135,18 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
129
135
|
e.o.forEach(((e, o) => {
|
|
130
136
|
-1 !== e && (n.push(e), o < t && r++);
|
|
131
137
|
})), e.l = -1;
|
|
132
|
-
const s =
|
|
133
|
-
return ((e.i = u) -
|
|
134
|
-
})(R,
|
|
138
|
+
const s = l(n), i = s.length, c = i / 2 | 0, u = i % 2 == 0 ? (s[c - 1] + s[c]) / 2 : s[c], f = e.i;
|
|
139
|
+
return ((e.i = u) - f) * o(t - r, 0);
|
|
140
|
+
})(R, v(R, B()))), u = !1), c = 3, i = !0;
|
|
135
141
|
break;
|
|
136
142
|
}
|
|
137
143
|
|
|
138
144
|
case 4:
|
|
139
|
-
S !== t && (S || (O = i = !0), S = t,
|
|
145
|
+
S !== t && (S || (O = i = !0), S = t, c = 3);
|
|
140
146
|
break;
|
|
141
147
|
|
|
142
148
|
case 5:
|
|
143
|
-
t[1] ? (W(m(R, t[0], !0)), I = 2,
|
|
149
|
+
t[1] ? (W(m(R, t[0], !0)), I = 2, c = 1) : (m(R, t[0]), c = 1);
|
|
144
150
|
break;
|
|
145
151
|
|
|
146
152
|
case 6:
|
|
@@ -152,16 +158,16 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
152
158
|
break;
|
|
153
159
|
|
|
154
160
|
case 8:
|
|
155
|
-
k = C(t, t + S),
|
|
161
|
+
k = C(t, t + S), c = 1;
|
|
156
162
|
}
|
|
157
|
-
|
|
158
|
-
|
|
163
|
+
c && (a = 1 + (2147483647 & a), n && w && (z += w, w = 0), q.forEach((([e, t]) => {
|
|
164
|
+
c & e && t(i);
|
|
159
165
|
})));
|
|
160
166
|
}
|
|
161
167
|
};
|
|
162
168
|
}, y = setTimeout, _ = (e, t) => t ? -e : e, I = (e, t, n, o, s, i) => {
|
|
163
|
-
const
|
|
164
|
-
let
|
|
169
|
+
const c = Date.now;
|
|
170
|
+
let l = 0, u = !1, f = !1, a = !1, d = !1;
|
|
165
171
|
const g = (() => {
|
|
166
172
|
let t;
|
|
167
173
|
const n = () => {
|
|
@@ -169,32 +175,32 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
169
175
|
}, o = () => {
|
|
170
176
|
n(), t = y((() => {
|
|
171
177
|
t = r, (() => {
|
|
172
|
-
if (u ||
|
|
173
|
-
|
|
178
|
+
if (u || f) return u = !1, void g();
|
|
179
|
+
a = !1, e.H(2);
|
|
174
180
|
})();
|
|
175
181
|
}), 150);
|
|
176
182
|
};
|
|
177
183
|
return o.L = n, o;
|
|
178
184
|
})(), h = () => {
|
|
179
|
-
|
|
180
|
-
},
|
|
185
|
+
l = c(), a && (d = !0), i && e.H(6, i()), e.H(1, o()), g();
|
|
186
|
+
}, p = t => {
|
|
181
187
|
if (u || !e.O() || t.ctrlKey) return;
|
|
182
|
-
const r =
|
|
188
|
+
const r = c() - l;
|
|
183
189
|
150 > r && 50 < r && (n ? t.deltaX : t.deltaY) && (u = !0);
|
|
184
|
-
},
|
|
185
|
-
|
|
190
|
+
}, v = () => {
|
|
191
|
+
f = !0, a = d = !1;
|
|
186
192
|
}, m = () => {
|
|
187
|
-
|
|
193
|
+
f = !1, x() && (a = !0);
|
|
188
194
|
};
|
|
189
|
-
return t.addEventListener("scroll", h), t.addEventListener("wheel",
|
|
195
|
+
return t.addEventListener("scroll", h), t.addEventListener("wheel", p, {
|
|
190
196
|
passive: !0
|
|
191
|
-
}), t.addEventListener("touchstart",
|
|
197
|
+
}), t.addEventListener("touchstart", v, {
|
|
192
198
|
passive: !0
|
|
193
199
|
}), t.addEventListener("touchend", m, {
|
|
194
200
|
passive: !0
|
|
195
201
|
}), {
|
|
196
202
|
P: () => {
|
|
197
|
-
t.removeEventListener("scroll", h), t.removeEventListener("wheel",
|
|
203
|
+
t.removeEventListener("scroll", h), t.removeEventListener("wheel", p), t.removeEventListener("touchstart", v),
|
|
198
204
|
t.removeEventListener("touchend", m), g.L();
|
|
199
205
|
},
|
|
200
206
|
W: () => {
|
|
@@ -208,7 +214,7 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
208
214
|
if (!await t()) return;
|
|
209
215
|
n && n();
|
|
210
216
|
const i = () => {
|
|
211
|
-
const [t, r] =
|
|
217
|
+
const [t, r] = f();
|
|
212
218
|
return n = () => {
|
|
213
219
|
r(!1);
|
|
214
220
|
}, e.R() && y(n, 150), [ t, e.C(2, (() => {
|
|
@@ -292,17 +298,17 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
292
298
|
});
|
|
293
299
|
}, O = (e, t) => e[0] === t[0] && e[1] === t[1], R = n => {
|
|
294
300
|
let s;
|
|
295
|
-
const {itemSize: i, horizontal: u = !1, cache:
|
|
301
|
+
const {itemSize: i, horizontal: u = !1, cache: a} = n;
|
|
296
302
|
n = t.mergeProps({
|
|
297
303
|
as: "div"
|
|
298
304
|
}, n);
|
|
299
|
-
const d = w(n.data.length, i, void 0,
|
|
305
|
+
const d = w(n.data.length, i, void 0, a, !i), g = ((e, t) => {
|
|
300
306
|
let n;
|
|
301
307
|
const o = t ? "width" : "height", s = new WeakMap, i = T((t => {
|
|
302
308
|
const i = [];
|
|
303
|
-
for (const {target:
|
|
304
|
-
const e = s.get(
|
|
305
|
-
e != r && i.push([ e,
|
|
309
|
+
for (const {target: c, contentRect: l} of t) if (c.offsetParent) if (c === n) e.H(4, l[o]); else {
|
|
310
|
+
const e = s.get(c);
|
|
311
|
+
e != r && i.push([ e, l[o] ]);
|
|
306
312
|
}
|
|
307
313
|
i.length && e.H(3, i);
|
|
308
314
|
}));
|
|
@@ -313,30 +319,30 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
313
319
|
K: (e, t) => (s.set(e, t), i.j(e), () => {
|
|
314
320
|
s.delete(e), i.N(e);
|
|
315
321
|
}),
|
|
316
|
-
|
|
322
|
+
p: i.P
|
|
317
323
|
};
|
|
318
324
|
})(d, u), h = ((e, t) => {
|
|
319
|
-
let r, n, o =
|
|
320
|
-
const i = t ? "scrollLeft" : "scrollTop",
|
|
325
|
+
let r, n, o = f(), s = !1;
|
|
326
|
+
const i = t ? "scrollLeft" : "scrollTop", l = t ? "overflowX" : "overflowY", [u, a] = k(e, (() => o[0]), ((e, n) => {
|
|
321
327
|
e = _(e, s), n ? r.scrollTo({
|
|
322
328
|
[t ? "left" : "top"]: e,
|
|
323
329
|
behavior: "smooth"
|
|
324
330
|
}) : r[i] = e;
|
|
325
331
|
}));
|
|
326
332
|
return {
|
|
327
|
-
Z(
|
|
333
|
+
Z(c, u) {
|
|
328
334
|
r = u, t && (s = "rtl" === getComputedStyle(u).direction), n = I(e, u, t, (() => _(u[i], s)), ((t, r, n) => {
|
|
329
335
|
if (n) {
|
|
330
|
-
const e = u.style, t = e[
|
|
331
|
-
e[
|
|
332
|
-
e[
|
|
336
|
+
const e = u.style, t = e[l];
|
|
337
|
+
e[l] = "hidden", y((() => {
|
|
338
|
+
e[l] = t;
|
|
333
339
|
}));
|
|
334
340
|
}
|
|
335
|
-
u[i] = _(e.M() + t, s), r &&
|
|
341
|
+
u[i] = _(e.M() + t, s), r && a();
|
|
336
342
|
})), o[1](!0);
|
|
337
343
|
},
|
|
338
|
-
|
|
339
|
-
n && n.P(), o[1](!1), o =
|
|
344
|
+
p() {
|
|
345
|
+
n && n.P(), o[1](!1), o = f();
|
|
340
346
|
},
|
|
341
347
|
ee: () => s,
|
|
342
348
|
te(e) {
|
|
@@ -346,7 +352,7 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
346
352
|
t += e.M(), u((() => t));
|
|
347
353
|
},
|
|
348
354
|
ne(t, {align: r, smooth: n, offset: o = 0} = {}) {
|
|
349
|
-
if (t =
|
|
355
|
+
if (t = c(t, 0, e.T() - 1), "nearest" === r) {
|
|
350
356
|
const n = e.I(t), o = e.M();
|
|
351
357
|
if (n < o) r = "start"; else {
|
|
352
358
|
if (!(n + e.k(t) > o + e.R())) return;
|
|
@@ -359,21 +365,19 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
359
365
|
n && n.W();
|
|
360
366
|
}
|
|
361
367
|
};
|
|
362
|
-
})(d, u), [
|
|
368
|
+
})(d, u), [p, v] = t.createSignal(d.v());
|
|
363
369
|
d.C(1, (() => {
|
|
364
|
-
|
|
370
|
+
v(d.v());
|
|
365
371
|
})), d.C(4, (() => {
|
|
366
|
-
|
|
367
|
-
null === (e = n.onScroll) || void 0 === e || e.call(n, d.M());
|
|
372
|
+
n.onScroll?.(d.M());
|
|
368
373
|
})), d.C(8, (() => {
|
|
369
|
-
|
|
370
|
-
null === (e = n.onScrollEnd) || void 0 === e || e.call(n);
|
|
374
|
+
n.onScrollEnd?.();
|
|
371
375
|
}));
|
|
372
376
|
const m = t.createMemo((e => {
|
|
373
|
-
|
|
377
|
+
p();
|
|
374
378
|
const t = d.S(n.bufferSize);
|
|
375
379
|
return e && O(e, t) ? e : t;
|
|
376
|
-
})), S = t.createMemo((() =>
|
|
380
|
+
})), S = t.createMemo((() => p() && d.O())), $ = t.createMemo((() => p() && d.J())), b = t.createMemo((() => p() && h.ee()));
|
|
377
381
|
t.onMount((() => {
|
|
378
382
|
n.ref && n.ref({
|
|
379
383
|
get cache() {
|
|
@@ -397,11 +401,11 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
397
401
|
});
|
|
398
402
|
const e = s, r = n.scrollRef || e.parentElement;
|
|
399
403
|
g.G(r), h.Z(e, r), t.onCleanup((() => {
|
|
400
|
-
n.ref && n.ref(), d.
|
|
404
|
+
n.ref && n.ref(), d.p(), g.p(), h.p();
|
|
401
405
|
}));
|
|
402
406
|
})), t.createComputed(t.on((() => n.startMargin || 0), (e => {
|
|
403
407
|
e !== d.q() && d.H(6, e);
|
|
404
|
-
}))), t.createEffect(t.on(
|
|
408
|
+
}))), t.createEffect(t.on(p, (() => {
|
|
405
409
|
h.oe();
|
|
406
410
|
})));
|
|
407
411
|
const x = t.createMemo((() => {
|
|
@@ -413,7 +417,7 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
413
417
|
if (n.keepMounted) {
|
|
414
418
|
const e = new Set(n.keepMounted);
|
|
415
419
|
for (let [t, r] = m(); t <= r; t++) e.add(t);
|
|
416
|
-
|
|
420
|
+
l([ ...e ]).forEach((e => {
|
|
417
421
|
r.push(n.data[e]), o.push(e);
|
|
418
422
|
}));
|
|
419
423
|
} else for (let [e, t] = m(); e <= t; e++) r.push(n.data[e]), o.push(e);
|
|
@@ -446,8 +450,8 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
446
450
|
return x().se;
|
|
447
451
|
},
|
|
448
452
|
children: (r, o) => ((r, o) => {
|
|
449
|
-
const s = t.createMemo((() => (
|
|
450
|
-
d._(o())))),
|
|
453
|
+
const s = t.createMemo((() => (p(), d.I(o(), b())))), i = t.createMemo((() => (p(),
|
|
454
|
+
d._(o())))), c = t.createMemo((() => t.untrack((() => n.children(r, o)))));
|
|
451
455
|
return e.createComponent(M, {
|
|
452
456
|
get V() {
|
|
453
457
|
return n.item;
|
|
@@ -465,7 +469,7 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
465
469
|
return i();
|
|
466
470
|
},
|
|
467
471
|
get F() {
|
|
468
|
-
return
|
|
472
|
+
return c();
|
|
469
473
|
},
|
|
470
474
|
D: u
|
|
471
475
|
});
|
|
@@ -532,7 +536,7 @@ exports.VList = r => {
|
|
|
532
536
|
var s;
|
|
533
537
|
}, exports.Virtualizer = R, exports.WindowVirtualizer = n => {
|
|
534
538
|
let o;
|
|
535
|
-
const {ref: s, data: i, children:
|
|
539
|
+
const {ref: s, data: i, children: l, itemSize: a, shift: d, horizontal: g = !1, cache: h, onScrollEnd: p} = n, v = w(n.data.length, a, void 0, h, !a), m = ((e, t) => {
|
|
536
540
|
const n = t ? "width" : "height", o = t ? "innerWidth" : "innerHeight", s = new WeakMap, i = T((t => {
|
|
537
541
|
const o = [];
|
|
538
542
|
for (const {target: e, contentRect: i} of t) {
|
|
@@ -542,26 +546,26 @@ exports.VList = r => {
|
|
|
542
546
|
}
|
|
543
547
|
o.length && e.H(3, o);
|
|
544
548
|
}));
|
|
545
|
-
let
|
|
549
|
+
let c;
|
|
546
550
|
return {
|
|
547
551
|
G(t) {
|
|
548
552
|
const r = b($(t)), n = () => {
|
|
549
553
|
e.H(4, r[o]);
|
|
550
554
|
};
|
|
551
|
-
r.addEventListener("resize", n), u(n),
|
|
555
|
+
r.addEventListener("resize", n), u(n), c = () => {
|
|
552
556
|
r.removeEventListener("resize", n);
|
|
553
557
|
};
|
|
554
558
|
},
|
|
555
559
|
K: (e, t) => (s.set(e, t), i.j(e), () => {
|
|
556
560
|
s.delete(e), i.N(e);
|
|
557
561
|
}),
|
|
558
|
-
|
|
559
|
-
|
|
562
|
+
p() {
|
|
563
|
+
c && c(), i.P();
|
|
560
564
|
}
|
|
561
565
|
};
|
|
562
|
-
})(
|
|
563
|
-
let r, n, o =
|
|
564
|
-
const i = t ? "left" : "top", [
|
|
566
|
+
})(v, g), x = ((e, t) => {
|
|
567
|
+
let r, n, o = f(), s = !1;
|
|
568
|
+
const i = t ? "left" : "top", [l] = k(e, (() => o[0]), ((e, t) => {
|
|
565
569
|
e = _(e, s);
|
|
566
570
|
const n = b($(r));
|
|
567
571
|
t ? n.scroll({
|
|
@@ -571,23 +575,23 @@ exports.VList = r => {
|
|
|
571
575
|
[i]: e
|
|
572
576
|
});
|
|
573
577
|
})), u = (e, t, r, n, o = 0) => {
|
|
574
|
-
const i = n ? "offsetLeft" : "offsetTop",
|
|
575
|
-
return e !== t &&
|
|
578
|
+
const i = n ? "offsetLeft" : "offsetTop", c = o + (n && s ? r.innerWidth - e[i] - e.offsetWidth : e[i]), l = e.offsetParent;
|
|
579
|
+
return e !== t && l ? u(l, t, r, n, c) : c;
|
|
576
580
|
};
|
|
577
581
|
return {
|
|
578
|
-
Z(
|
|
579
|
-
r =
|
|
580
|
-
const
|
|
581
|
-
t && (s = "rtl" === getComputedStyle(S(
|
|
582
|
-
r ?
|
|
582
|
+
Z(c) {
|
|
583
|
+
r = c;
|
|
584
|
+
const l = t ? "scrollX" : "scrollY", f = $(c), a = b(f);
|
|
585
|
+
t && (s = "rtl" === getComputedStyle(S(f)).direction), n = I(e, a, t, (() => _(a[l], s)), ((t, r) => {
|
|
586
|
+
r ? a.scroll({
|
|
583
587
|
[i]: _(e.M() + t, s)
|
|
584
|
-
}) :
|
|
588
|
+
}) : a.scrollBy({
|
|
585
589
|
[i]: _(t, s)
|
|
586
590
|
});
|
|
587
|
-
}), (() => u(
|
|
591
|
+
}), (() => u(c, f.body, a, t))), o[1](!0);
|
|
588
592
|
},
|
|
589
|
-
|
|
590
|
-
n && n.P(), r = void 0, o[1](!1), o =
|
|
593
|
+
p() {
|
|
594
|
+
n && n.P(), r = void 0, o[1](!1), o = f();
|
|
591
595
|
},
|
|
592
596
|
ee: () => s,
|
|
593
597
|
oe: () => {
|
|
@@ -595,49 +599,47 @@ exports.VList = r => {
|
|
|
595
599
|
},
|
|
596
600
|
ne(n, {align: o, smooth: s, offset: i = 0} = {}) {
|
|
597
601
|
if (!r) return;
|
|
598
|
-
if (n =
|
|
602
|
+
if (n = c(n, 0, e.T() - 1), "nearest" === o) {
|
|
599
603
|
const t = e.I(n), r = e.M();
|
|
600
604
|
if (t < r) o = "start"; else {
|
|
601
605
|
if (!(t + e.k(n) > r + e.R())) return;
|
|
602
606
|
o = "end";
|
|
603
607
|
}
|
|
604
608
|
}
|
|
605
|
-
const
|
|
606
|
-
|
|
609
|
+
const f = $(r), a = b(f), d = S(f), g = () => e.R() - (t ? d.clientWidth : d.clientHeight);
|
|
610
|
+
l((() => i + u(r, f.body, a, t) + e.I(n) + ("end" === o ? e.k(n) - (e.R() - g()) : "center" === o ? (e.k(n) - (e.R() - g())) / 2 : 0)), s);
|
|
607
611
|
}
|
|
608
612
|
};
|
|
609
|
-
})(
|
|
610
|
-
|
|
611
|
-
y(
|
|
612
|
-
})),
|
|
613
|
-
|
|
614
|
-
|
|
615
|
-
|
|
616
|
-
var e;
|
|
617
|
-
null === (e = n.onScrollEnd) || void 0 === e || e.call(n);
|
|
613
|
+
})(v, g), [z, y] = t.createSignal(v.v());
|
|
614
|
+
v.C(1, (() => {
|
|
615
|
+
y(v.v());
|
|
616
|
+
})), v.C(4, (() => {
|
|
617
|
+
n.onScroll?.();
|
|
618
|
+
})), v.C(8, (() => {
|
|
619
|
+
n.onScrollEnd?.();
|
|
618
620
|
}));
|
|
619
621
|
const R = t.createMemo((e => {
|
|
620
622
|
z();
|
|
621
|
-
const t =
|
|
623
|
+
const t = v.S(n.bufferSize);
|
|
622
624
|
return e && O(e, t) ? e : t;
|
|
623
|
-
})), q = t.createMemo((() => z() &&
|
|
625
|
+
})), q = t.createMemo((() => z() && v.O())), B = t.createMemo((() => z() && v.J())), C = t.createMemo((() => z() && x.ee()));
|
|
624
626
|
t.onMount((() => {
|
|
625
627
|
n.ref && n.ref({
|
|
626
628
|
get cache() {
|
|
627
|
-
return
|
|
629
|
+
return v.m();
|
|
628
630
|
},
|
|
629
631
|
get scrollOffset() {
|
|
630
|
-
return
|
|
632
|
+
return v.M();
|
|
631
633
|
},
|
|
632
634
|
get viewportSize() {
|
|
633
|
-
return
|
|
635
|
+
return v.R();
|
|
634
636
|
},
|
|
635
|
-
findItemIndex:
|
|
636
|
-
getItemOffset:
|
|
637
|
-
getItemSize:
|
|
637
|
+
findItemIndex: v.$,
|
|
638
|
+
getItemOffset: v.I,
|
|
639
|
+
getItemSize: v.k,
|
|
638
640
|
scrollToIndex: x.ne
|
|
639
641
|
}), m.G(o), x.Z(o), t.onCleanup((() => {
|
|
640
|
-
n.ref && n.ref(), p
|
|
642
|
+
n.ref && n.ref(), v.p(), m.p(), x.p();
|
|
641
643
|
}));
|
|
642
644
|
})), t.createEffect(t.on(z, (() => {
|
|
643
645
|
x.oe();
|
|
@@ -645,7 +647,7 @@ exports.VList = r => {
|
|
|
645
647
|
const E = t.createMemo((() => {
|
|
646
648
|
const e = n.data.length;
|
|
647
649
|
t.untrack((() => {
|
|
648
|
-
e !==
|
|
650
|
+
e !== v.T() && v.H(5, [ e, n.shift ]);
|
|
649
651
|
}));
|
|
650
652
|
const r = [];
|
|
651
653
|
for (let [e, t] = R(); e <= t; e++) r.push(n.data[e]);
|
|
@@ -658,8 +660,8 @@ exports.VList = r => {
|
|
|
658
660
|
return E();
|
|
659
661
|
},
|
|
660
662
|
children: (r, o) => {
|
|
661
|
-
const s = t.createMemo((() => R()[0] + o())), i = t.createMemo((() => (z(),
|
|
662
|
-
|
|
663
|
+
const s = t.createMemo((() => R()[0] + o())), i = t.createMemo((() => (z(), v.I(s(), C())))), c = t.createMemo((() => (z(),
|
|
664
|
+
v._(s())))), l = t.createMemo((() => t.untrack((() => n.children(r, s)))));
|
|
663
665
|
return e.createComponent(M, {
|
|
664
666
|
get Y() {
|
|
665
667
|
return s();
|
|
@@ -671,10 +673,10 @@ exports.VList = r => {
|
|
|
671
673
|
return i();
|
|
672
674
|
},
|
|
673
675
|
get A() {
|
|
674
|
-
return
|
|
676
|
+
return c();
|
|
675
677
|
},
|
|
676
678
|
get F() {
|
|
677
|
-
return
|
|
679
|
+
return l();
|
|
678
680
|
},
|
|
679
681
|
D: g
|
|
680
682
|
});
|