virtua 0.48.6 → 0.48.7
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 +1 -1
- package/lib/index.cjs.map +1 -1
- package/lib/index.js +1 -1
- package/lib/index.js.map +1 -1
- package/lib/solid/index.cjs +119 -123
- package/lib/solid/index.cjs.map +1 -1
- package/lib/solid/index.js +99 -103
- package/lib/solid/index.js.map +1 -1
- package/lib/solid/index.jsx +11 -14
- package/lib/solid/index.jsx.map +1 -1
- package/lib/vue/index.cjs +37 -39
- package/lib/vue/index.cjs.map +1 -1
- package/lib/vue/index.js +60 -62
- 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,21 +103,21 @@ 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]) => ((2 === I || (k && 1 === I ? t < k[0] : H(
|
|
120
|
+
W(e.reduce(((e, [t, r]) => ((2 === I || (k && 1 === I ? t < k[0] : H(1 !== _ && 0 === I ? t + 1 : t) < J())) && (e += r - L(t)),
|
|
121
121
|
e)), 0));
|
|
122
122
|
for (const [t, r] of e) {
|
|
123
123
|
const e = L(t), n = h(R, t, r);
|
|
@@ -129,18 +129,18 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
129
129
|
e.o.forEach(((e, o) => {
|
|
130
130
|
-1 !== e && (n.push(e), o < t && r++);
|
|
131
131
|
})), e.l = -1;
|
|
132
|
-
const s =
|
|
133
|
-
return ((e.i = u) -
|
|
134
|
-
})(R,
|
|
132
|
+
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;
|
|
133
|
+
return ((e.i = u) - f) * o(t - r, 0);
|
|
134
|
+
})(R, v(R, B()))), u = !1), c = 3, i = !0;
|
|
135
135
|
break;
|
|
136
136
|
}
|
|
137
137
|
|
|
138
138
|
case 4:
|
|
139
|
-
S !== t && (S || (O = i = !0), S = t,
|
|
139
|
+
S !== t && (S || (O = i = !0), S = t, c = 3);
|
|
140
140
|
break;
|
|
141
141
|
|
|
142
142
|
case 5:
|
|
143
|
-
t[1] ? (W(m(R, t[0], !0)), I = 2,
|
|
143
|
+
t[1] ? (W(m(R, t[0], !0)), I = 2, c = 1) : (m(R, t[0]), c = 1);
|
|
144
144
|
break;
|
|
145
145
|
|
|
146
146
|
case 6:
|
|
@@ -152,16 +152,16 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
152
152
|
break;
|
|
153
153
|
|
|
154
154
|
case 8:
|
|
155
|
-
k = C(t, t + S),
|
|
155
|
+
k = C(t, t + S), c = 1;
|
|
156
156
|
}
|
|
157
|
-
|
|
158
|
-
|
|
157
|
+
c && (a = 1 + (2147483647 & a), n && w && (z += w, w = 0), q.forEach((([e, t]) => {
|
|
158
|
+
c & e && t(i);
|
|
159
159
|
})));
|
|
160
160
|
}
|
|
161
161
|
};
|
|
162
162
|
}, y = setTimeout, _ = (e, t) => t ? -e : e, I = (e, t, n, o, s, i) => {
|
|
163
|
-
const
|
|
164
|
-
let
|
|
163
|
+
const c = Date.now;
|
|
164
|
+
let l = 0, u = !1, f = !1, a = !1, d = !1;
|
|
165
165
|
const g = (() => {
|
|
166
166
|
let t;
|
|
167
167
|
const n = () => {
|
|
@@ -169,32 +169,32 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
169
169
|
}, o = () => {
|
|
170
170
|
n(), t = y((() => {
|
|
171
171
|
t = r, (() => {
|
|
172
|
-
if (u ||
|
|
173
|
-
|
|
172
|
+
if (u || f) return u = !1, void g();
|
|
173
|
+
a = !1, e.H(2);
|
|
174
174
|
})();
|
|
175
175
|
}), 150);
|
|
176
176
|
};
|
|
177
177
|
return o.L = n, o;
|
|
178
178
|
})(), h = () => {
|
|
179
|
-
|
|
180
|
-
},
|
|
179
|
+
l = c(), a && (d = !0), i && e.H(6, i()), e.H(1, o()), g();
|
|
180
|
+
}, p = t => {
|
|
181
181
|
if (u || !e.O() || t.ctrlKey) return;
|
|
182
|
-
const r =
|
|
182
|
+
const r = c() - l;
|
|
183
183
|
150 > r && 50 < r && (n ? t.deltaX : t.deltaY) && (u = !0);
|
|
184
|
-
},
|
|
185
|
-
|
|
184
|
+
}, v = () => {
|
|
185
|
+
f = !0, a = d = !1;
|
|
186
186
|
}, m = () => {
|
|
187
|
-
|
|
187
|
+
f = !1, x() && (a = !0);
|
|
188
188
|
};
|
|
189
|
-
return t.addEventListener("scroll", h), t.addEventListener("wheel",
|
|
189
|
+
return t.addEventListener("scroll", h), t.addEventListener("wheel", p, {
|
|
190
190
|
passive: !0
|
|
191
|
-
}), t.addEventListener("touchstart",
|
|
191
|
+
}), t.addEventListener("touchstart", v, {
|
|
192
192
|
passive: !0
|
|
193
193
|
}), t.addEventListener("touchend", m, {
|
|
194
194
|
passive: !0
|
|
195
195
|
}), {
|
|
196
196
|
P: () => {
|
|
197
|
-
t.removeEventListener("scroll", h), t.removeEventListener("wheel",
|
|
197
|
+
t.removeEventListener("scroll", h), t.removeEventListener("wheel", p), t.removeEventListener("touchstart", v),
|
|
198
198
|
t.removeEventListener("touchend", m), g.L();
|
|
199
199
|
},
|
|
200
200
|
W: () => {
|
|
@@ -208,7 +208,7 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
208
208
|
if (!await t()) return;
|
|
209
209
|
n && n();
|
|
210
210
|
const i = () => {
|
|
211
|
-
const [t, r] =
|
|
211
|
+
const [t, r] = f();
|
|
212
212
|
return n = () => {
|
|
213
213
|
r(!1);
|
|
214
214
|
}, e.R() && y(n, 150), [ t, e.C(2, (() => {
|
|
@@ -292,17 +292,17 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
292
292
|
});
|
|
293
293
|
}, O = (e, t) => e[0] === t[0] && e[1] === t[1], R = n => {
|
|
294
294
|
let s;
|
|
295
|
-
const {itemSize: i, horizontal: u = !1, cache:
|
|
295
|
+
const {itemSize: i, horizontal: u = !1, cache: a} = n;
|
|
296
296
|
n = t.mergeProps({
|
|
297
297
|
as: "div"
|
|
298
298
|
}, n);
|
|
299
|
-
const d = w(n.data.length, i, void 0,
|
|
299
|
+
const d = w(n.data.length, i, void 0, a, !i), g = ((e, t) => {
|
|
300
300
|
let n;
|
|
301
301
|
const o = t ? "width" : "height", s = new WeakMap, i = T((t => {
|
|
302
302
|
const i = [];
|
|
303
|
-
for (const {target:
|
|
304
|
-
const e = s.get(
|
|
305
|
-
e != r && i.push([ e,
|
|
303
|
+
for (const {target: c, contentRect: l} of t) if (c.offsetParent) if (c === n) e.H(4, l[o]); else {
|
|
304
|
+
const e = s.get(c);
|
|
305
|
+
e != r && i.push([ e, l[o] ]);
|
|
306
306
|
}
|
|
307
307
|
i.length && e.H(3, i);
|
|
308
308
|
}));
|
|
@@ -313,30 +313,30 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
313
313
|
K: (e, t) => (s.set(e, t), i.j(e), () => {
|
|
314
314
|
s.delete(e), i.N(e);
|
|
315
315
|
}),
|
|
316
|
-
|
|
316
|
+
p: i.P
|
|
317
317
|
};
|
|
318
318
|
})(d, u), h = ((e, t) => {
|
|
319
|
-
let r, n, o =
|
|
320
|
-
const i = t ? "scrollLeft" : "scrollTop",
|
|
319
|
+
let r, n, o = f(), s = !1;
|
|
320
|
+
const i = t ? "scrollLeft" : "scrollTop", l = t ? "overflowX" : "overflowY", [u, a] = k(e, (() => o[0]), ((e, n) => {
|
|
321
321
|
e = _(e, s), n ? r.scrollTo({
|
|
322
322
|
[t ? "left" : "top"]: e,
|
|
323
323
|
behavior: "smooth"
|
|
324
324
|
}) : r[i] = e;
|
|
325
325
|
}));
|
|
326
326
|
return {
|
|
327
|
-
Z(
|
|
327
|
+
Z(c, u) {
|
|
328
328
|
r = u, t && (s = "rtl" === getComputedStyle(u).direction), n = I(e, u, t, (() => _(u[i], s)), ((t, r, n) => {
|
|
329
329
|
if (n) {
|
|
330
|
-
const e = u.style, t = e[
|
|
331
|
-
e[
|
|
332
|
-
e[
|
|
330
|
+
const e = u.style, t = e[l];
|
|
331
|
+
e[l] = "hidden", y((() => {
|
|
332
|
+
e[l] = t;
|
|
333
333
|
}));
|
|
334
334
|
}
|
|
335
|
-
u[i] = _(e.M() + t, s), r &&
|
|
335
|
+
u[i] = _(e.M() + t, s), r && a();
|
|
336
336
|
})), o[1](!0);
|
|
337
337
|
},
|
|
338
|
-
|
|
339
|
-
n && n.P(), o[1](!1), o =
|
|
338
|
+
p() {
|
|
339
|
+
n && n.P(), o[1](!1), o = f();
|
|
340
340
|
},
|
|
341
341
|
ee: () => s,
|
|
342
342
|
te(e) {
|
|
@@ -346,7 +346,7 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
346
346
|
t += e.M(), u((() => t));
|
|
347
347
|
},
|
|
348
348
|
ne(t, {align: r, smooth: n, offset: o = 0} = {}) {
|
|
349
|
-
if (t =
|
|
349
|
+
if (t = c(t, 0, e.T() - 1), "nearest" === r) {
|
|
350
350
|
const n = e.I(t), o = e.M();
|
|
351
351
|
if (n < o) r = "start"; else {
|
|
352
352
|
if (!(n + e.k(t) > o + e.R())) return;
|
|
@@ -359,21 +359,19 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
359
359
|
n && n.W();
|
|
360
360
|
}
|
|
361
361
|
};
|
|
362
|
-
})(d, u), [
|
|
362
|
+
})(d, u), [p, v] = t.createSignal(d.v());
|
|
363
363
|
d.C(1, (() => {
|
|
364
|
-
|
|
364
|
+
v(d.v());
|
|
365
365
|
})), d.C(4, (() => {
|
|
366
|
-
|
|
367
|
-
null === (e = n.onScroll) || void 0 === e || e.call(n, d.M());
|
|
366
|
+
n.onScroll?.(d.M());
|
|
368
367
|
})), d.C(8, (() => {
|
|
369
|
-
|
|
370
|
-
null === (e = n.onScrollEnd) || void 0 === e || e.call(n);
|
|
368
|
+
n.onScrollEnd?.();
|
|
371
369
|
}));
|
|
372
370
|
const m = t.createMemo((e => {
|
|
373
|
-
|
|
371
|
+
p();
|
|
374
372
|
const t = d.S(n.bufferSize);
|
|
375
373
|
return e && O(e, t) ? e : t;
|
|
376
|
-
})), S = t.createMemo((() =>
|
|
374
|
+
})), S = t.createMemo((() => p() && d.O())), $ = t.createMemo((() => p() && d.J())), b = t.createMemo((() => p() && h.ee()));
|
|
377
375
|
t.onMount((() => {
|
|
378
376
|
n.ref && n.ref({
|
|
379
377
|
get cache() {
|
|
@@ -397,11 +395,11 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
397
395
|
});
|
|
398
396
|
const e = s, r = n.scrollRef || e.parentElement;
|
|
399
397
|
g.G(r), h.Z(e, r), t.onCleanup((() => {
|
|
400
|
-
n.ref && n.ref(), d.
|
|
398
|
+
n.ref && n.ref(), d.p(), g.p(), h.p();
|
|
401
399
|
}));
|
|
402
400
|
})), t.createComputed(t.on((() => n.startMargin || 0), (e => {
|
|
403
401
|
e !== d.q() && d.H(6, e);
|
|
404
|
-
}))), t.createEffect(t.on(
|
|
402
|
+
}))), t.createEffect(t.on(p, (() => {
|
|
405
403
|
h.oe();
|
|
406
404
|
})));
|
|
407
405
|
const x = t.createMemo((() => {
|
|
@@ -413,7 +411,7 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
413
411
|
if (n.keepMounted) {
|
|
414
412
|
const e = new Set(n.keepMounted);
|
|
415
413
|
for (let [t, r] = m(); t <= r; t++) e.add(t);
|
|
416
|
-
|
|
414
|
+
l([ ...e ]).forEach((e => {
|
|
417
415
|
r.push(n.data[e]), o.push(e);
|
|
418
416
|
}));
|
|
419
417
|
} else for (let [e, t] = m(); e <= t; e++) r.push(n.data[e]), o.push(e);
|
|
@@ -446,8 +444,8 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
446
444
|
return x().se;
|
|
447
445
|
},
|
|
448
446
|
children: (r, o) => ((r, o) => {
|
|
449
|
-
const s = t.createMemo((() => (
|
|
450
|
-
d._(o())))),
|
|
447
|
+
const s = t.createMemo((() => (p(), d.I(o(), b())))), i = t.createMemo((() => (p(),
|
|
448
|
+
d._(o())))), c = t.createMemo((() => t.untrack((() => n.children(r, o)))));
|
|
451
449
|
return e.createComponent(M, {
|
|
452
450
|
get V() {
|
|
453
451
|
return n.item;
|
|
@@ -465,7 +463,7 @@ const r = null, {min: n, max: o, abs: s, floor: i} = Math, l = (e, t, r) => n(r,
|
|
|
465
463
|
return i();
|
|
466
464
|
},
|
|
467
465
|
get F() {
|
|
468
|
-
return
|
|
466
|
+
return c();
|
|
469
467
|
},
|
|
470
468
|
D: u
|
|
471
469
|
});
|
|
@@ -532,7 +530,7 @@ exports.VList = r => {
|
|
|
532
530
|
var s;
|
|
533
531
|
}, exports.Virtualizer = R, exports.WindowVirtualizer = n => {
|
|
534
532
|
let o;
|
|
535
|
-
const {ref: s, data: i, children:
|
|
533
|
+
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
534
|
const n = t ? "width" : "height", o = t ? "innerWidth" : "innerHeight", s = new WeakMap, i = T((t => {
|
|
537
535
|
const o = [];
|
|
538
536
|
for (const {target: e, contentRect: i} of t) {
|
|
@@ -542,26 +540,26 @@ exports.VList = r => {
|
|
|
542
540
|
}
|
|
543
541
|
o.length && e.H(3, o);
|
|
544
542
|
}));
|
|
545
|
-
let
|
|
543
|
+
let c;
|
|
546
544
|
return {
|
|
547
545
|
G(t) {
|
|
548
546
|
const r = b($(t)), n = () => {
|
|
549
547
|
e.H(4, r[o]);
|
|
550
548
|
};
|
|
551
|
-
r.addEventListener("resize", n), u(n),
|
|
549
|
+
r.addEventListener("resize", n), u(n), c = () => {
|
|
552
550
|
r.removeEventListener("resize", n);
|
|
553
551
|
};
|
|
554
552
|
},
|
|
555
553
|
K: (e, t) => (s.set(e, t), i.j(e), () => {
|
|
556
554
|
s.delete(e), i.N(e);
|
|
557
555
|
}),
|
|
558
|
-
|
|
559
|
-
|
|
556
|
+
p() {
|
|
557
|
+
c && c(), i.P();
|
|
560
558
|
}
|
|
561
559
|
};
|
|
562
|
-
})(
|
|
563
|
-
let r, n, o =
|
|
564
|
-
const i = t ? "left" : "top", [
|
|
560
|
+
})(v, g), x = ((e, t) => {
|
|
561
|
+
let r, n, o = f(), s = !1;
|
|
562
|
+
const i = t ? "left" : "top", [l] = k(e, (() => o[0]), ((e, t) => {
|
|
565
563
|
e = _(e, s);
|
|
566
564
|
const n = b($(r));
|
|
567
565
|
t ? n.scroll({
|
|
@@ -571,23 +569,23 @@ exports.VList = r => {
|
|
|
571
569
|
[i]: e
|
|
572
570
|
});
|
|
573
571
|
})), u = (e, t, r, n, o = 0) => {
|
|
574
|
-
const i = n ? "offsetLeft" : "offsetTop",
|
|
575
|
-
return e !== t &&
|
|
572
|
+
const i = n ? "offsetLeft" : "offsetTop", c = o + (n && s ? r.innerWidth - e[i] - e.offsetWidth : e[i]), l = e.offsetParent;
|
|
573
|
+
return e !== t && l ? u(l, t, r, n, c) : c;
|
|
576
574
|
};
|
|
577
575
|
return {
|
|
578
|
-
Z(
|
|
579
|
-
r =
|
|
580
|
-
const
|
|
581
|
-
t && (s = "rtl" === getComputedStyle(S(
|
|
582
|
-
r ?
|
|
576
|
+
Z(c) {
|
|
577
|
+
r = c;
|
|
578
|
+
const l = t ? "scrollX" : "scrollY", f = $(c), a = b(f);
|
|
579
|
+
t && (s = "rtl" === getComputedStyle(S(f)).direction), n = I(e, a, t, (() => _(a[l], s)), ((t, r) => {
|
|
580
|
+
r ? a.scroll({
|
|
583
581
|
[i]: _(e.M() + t, s)
|
|
584
|
-
}) :
|
|
582
|
+
}) : a.scrollBy({
|
|
585
583
|
[i]: _(t, s)
|
|
586
584
|
});
|
|
587
|
-
}), (() => u(
|
|
585
|
+
}), (() => u(c, f.body, a, t))), o[1](!0);
|
|
588
586
|
},
|
|
589
|
-
|
|
590
|
-
n && n.P(), r = void 0, o[1](!1), o =
|
|
587
|
+
p() {
|
|
588
|
+
n && n.P(), r = void 0, o[1](!1), o = f();
|
|
591
589
|
},
|
|
592
590
|
ee: () => s,
|
|
593
591
|
oe: () => {
|
|
@@ -595,49 +593,47 @@ exports.VList = r => {
|
|
|
595
593
|
},
|
|
596
594
|
ne(n, {align: o, smooth: s, offset: i = 0} = {}) {
|
|
597
595
|
if (!r) return;
|
|
598
|
-
if (n =
|
|
596
|
+
if (n = c(n, 0, e.T() - 1), "nearest" === o) {
|
|
599
597
|
const t = e.I(n), r = e.M();
|
|
600
598
|
if (t < r) o = "start"; else {
|
|
601
599
|
if (!(t + e.k(n) > r + e.R())) return;
|
|
602
600
|
o = "end";
|
|
603
601
|
}
|
|
604
602
|
}
|
|
605
|
-
const
|
|
606
|
-
|
|
603
|
+
const f = $(r), a = b(f), d = S(f), g = () => e.R() - (t ? d.clientWidth : d.clientHeight);
|
|
604
|
+
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
605
|
}
|
|
608
606
|
};
|
|
609
|
-
})(
|
|
610
|
-
|
|
611
|
-
y(
|
|
612
|
-
})),
|
|
613
|
-
|
|
614
|
-
|
|
615
|
-
|
|
616
|
-
var e;
|
|
617
|
-
null === (e = n.onScrollEnd) || void 0 === e || e.call(n);
|
|
607
|
+
})(v, g), [z, y] = t.createSignal(v.v());
|
|
608
|
+
v.C(1, (() => {
|
|
609
|
+
y(v.v());
|
|
610
|
+
})), v.C(4, (() => {
|
|
611
|
+
n.onScroll?.();
|
|
612
|
+
})), v.C(8, (() => {
|
|
613
|
+
n.onScrollEnd?.();
|
|
618
614
|
}));
|
|
619
615
|
const R = t.createMemo((e => {
|
|
620
616
|
z();
|
|
621
|
-
const t =
|
|
617
|
+
const t = v.S(n.bufferSize);
|
|
622
618
|
return e && O(e, t) ? e : t;
|
|
623
|
-
})), q = t.createMemo((() => z() &&
|
|
619
|
+
})), q = t.createMemo((() => z() && v.O())), B = t.createMemo((() => z() && v.J())), C = t.createMemo((() => z() && x.ee()));
|
|
624
620
|
t.onMount((() => {
|
|
625
621
|
n.ref && n.ref({
|
|
626
622
|
get cache() {
|
|
627
|
-
return
|
|
623
|
+
return v.m();
|
|
628
624
|
},
|
|
629
625
|
get scrollOffset() {
|
|
630
|
-
return
|
|
626
|
+
return v.M();
|
|
631
627
|
},
|
|
632
628
|
get viewportSize() {
|
|
633
|
-
return
|
|
629
|
+
return v.R();
|
|
634
630
|
},
|
|
635
|
-
findItemIndex:
|
|
636
|
-
getItemOffset:
|
|
637
|
-
getItemSize:
|
|
631
|
+
findItemIndex: v.$,
|
|
632
|
+
getItemOffset: v.I,
|
|
633
|
+
getItemSize: v.k,
|
|
638
634
|
scrollToIndex: x.ne
|
|
639
635
|
}), m.G(o), x.Z(o), t.onCleanup((() => {
|
|
640
|
-
n.ref && n.ref(), p
|
|
636
|
+
n.ref && n.ref(), v.p(), m.p(), x.p();
|
|
641
637
|
}));
|
|
642
638
|
})), t.createEffect(t.on(z, (() => {
|
|
643
639
|
x.oe();
|
|
@@ -645,7 +641,7 @@ exports.VList = r => {
|
|
|
645
641
|
const E = t.createMemo((() => {
|
|
646
642
|
const e = n.data.length;
|
|
647
643
|
t.untrack((() => {
|
|
648
|
-
e !==
|
|
644
|
+
e !== v.T() && v.H(5, [ e, n.shift ]);
|
|
649
645
|
}));
|
|
650
646
|
const r = [];
|
|
651
647
|
for (let [e, t] = R(); e <= t; e++) r.push(n.data[e]);
|
|
@@ -658,8 +654,8 @@ exports.VList = r => {
|
|
|
658
654
|
return E();
|
|
659
655
|
},
|
|
660
656
|
children: (r, o) => {
|
|
661
|
-
const s = t.createMemo((() => R()[0] + o())), i = t.createMemo((() => (z(),
|
|
662
|
-
|
|
657
|
+
const s = t.createMemo((() => R()[0] + o())), i = t.createMemo((() => (z(), v.I(s(), C())))), c = t.createMemo((() => (z(),
|
|
658
|
+
v._(s())))), l = t.createMemo((() => t.untrack((() => n.children(r, s)))));
|
|
663
659
|
return e.createComponent(M, {
|
|
664
660
|
get Y() {
|
|
665
661
|
return s();
|
|
@@ -671,10 +667,10 @@ exports.VList = r => {
|
|
|
671
667
|
return i();
|
|
672
668
|
},
|
|
673
669
|
get A() {
|
|
674
|
-
return
|
|
670
|
+
return c();
|
|
675
671
|
},
|
|
676
672
|
get F() {
|
|
677
|
-
return
|
|
673
|
+
return l();
|
|
678
674
|
},
|
|
679
675
|
D: g
|
|
680
676
|
});
|