virtua 0.52.6 → 0.52.8
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +1 -1
- package/lib/angular/index.js +289 -280
- package/lib/angular/index.js.map +1 -1
- package/lib/core/index.cjs +482 -476
- package/lib/core/index.cjs.map +1 -1
- package/lib/core/index.d.ts +3 -3
- package/lib/core/index.js +478 -472
- package/lib/core/index.js.map +1 -1
- package/lib/index.cjs +470 -462
- package/lib/index.cjs.map +1 -1
- package/lib/index.js +453 -445
- package/lib/index.js.map +1 -1
- package/lib/solid/index.cjs +423 -417
- package/lib/solid/index.cjs.map +1 -1
- package/lib/solid/index.js +493 -487
- package/lib/solid/index.js.map +1 -1
- package/lib/solid/index.jsx +213 -158
- package/lib/solid/index.jsx.map +1 -1
- package/lib/svelte/VGrid.svelte +14 -5
- package/lib/vue/index.cjs +432 -426
- package/lib/vue/index.cjs.map +1 -1
- package/lib/vue/index.js +441 -435
- package/lib/vue/index.js.map +1 -1
- package/package.json +22 -22
package/lib/solid/index.cjs
CHANGED
|
@@ -11,112 +11,112 @@ var r, n = [], {min: o, max: s, abs: l, floor: i} = Math, c = (e, t, r) => o(r,
|
|
|
11
11
|
return [ new Promise(t => {
|
|
12
12
|
e = t;
|
|
13
13
|
}), e ];
|
|
14
|
-
},
|
|
15
|
-
r), v = e => s(e.l(), e.u()), m = ({
|
|
16
|
-
let h = !!
|
|
17
|
-
const
|
|
18
|
-
|
|
14
|
+
}, p = e => e.ownerDocument, h = e => e.defaultView, $ = () => (null == r && (r = /iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0),
|
|
15
|
+
r), v = e => s(e.l(), e.u()), m = ({p: e, h: t, $: r, v: n, m: i, l: c, S: u, _: a, I: f, k: g, T: d}, p = 0) => {
|
|
16
|
+
let h = !!p, v = 1, m = 0, w = 0, x = 0, S = 0, z = 0, y = 0, _ = 0, b = 0, I = null, k = [ 0, h ? s(p - 1, 0) : -1 ], T = !1;
|
|
17
|
+
const R = /* @__PURE__ */ new Set, M = () => x - w, O = () => M() + z + S, C = e => r(e) - z, E = e => {
|
|
18
|
+
if (2 === b) return !0;
|
|
19
|
+
if (I && 1 === b) return e < I[0];
|
|
20
|
+
const t = M(), r = C(e), o = n(e);
|
|
21
|
+
return 1 !== _ && 0 === b ? r + o <= t : r < t && r + o < t + m;
|
|
22
|
+
}, L = e => {
|
|
23
|
+
e && ($() && 0 !== _ || I && 1 === b ? z += e : S += e);
|
|
19
24
|
};
|
|
20
25
|
return {
|
|
21
|
-
|
|
22
|
-
|
|
26
|
+
R: () => {
|
|
27
|
+
R.clear();
|
|
23
28
|
},
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
if (!
|
|
29
|
+
M: () => v,
|
|
30
|
+
p: (t = 200) => {
|
|
31
|
+
if (!T || h) return k;
|
|
27
32
|
let r, n;
|
|
28
33
|
if (y) [r, n] = k; else {
|
|
29
|
-
let l = s(0,
|
|
30
|
-
|
|
31
|
-
|
|
34
|
+
let l = s(0, O()), i = l + m;
|
|
35
|
+
f() || (t = s(0, t), 1 !== _ && (l -= t), 2 !== _ && (i += t)), [r, n] = k = e(s(0, l), s(0, i)),
|
|
36
|
+
I && (r = o(r, I[0]), n = s(n, I[1]));
|
|
32
37
|
}
|
|
33
|
-
return [ s(r, 0), o(n,
|
|
38
|
+
return [ s(r, 0), o(n, u() - 1) ];
|
|
34
39
|
},
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
$:
|
|
40
|
+
O: e => t(e - w),
|
|
41
|
+
C: i,
|
|
42
|
+
$: C,
|
|
38
43
|
v: n,
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
44
|
+
L: u,
|
|
45
|
+
W: () => x,
|
|
46
|
+
q: () => 0 !== _,
|
|
42
47
|
u: () => m,
|
|
43
|
-
|
|
44
|
-
l:
|
|
45
|
-
|
|
46
|
-
|
|
48
|
+
H: () => w,
|
|
49
|
+
l: c,
|
|
50
|
+
P: () => (y = S, S = 0, [ y, 2 === b ]),
|
|
51
|
+
A: (e, t) => {
|
|
47
52
|
const r = [ e, t ];
|
|
48
|
-
return
|
|
49
|
-
|
|
53
|
+
return R.add(r), () => {
|
|
54
|
+
R.delete(r);
|
|
50
55
|
};
|
|
51
56
|
},
|
|
52
|
-
|
|
53
|
-
let
|
|
54
|
-
switch (
|
|
57
|
+
B: (t, r) => {
|
|
58
|
+
let n, o, s = 0;
|
|
59
|
+
switch (t) {
|
|
55
60
|
case 1:
|
|
56
61
|
{
|
|
57
|
-
if (
|
|
62
|
+
if (r === x && 0 === b) break;
|
|
58
63
|
const e = y;
|
|
59
64
|
y = 0;
|
|
60
|
-
const t =
|
|
61
|
-
e &&
|
|
62
|
-
const
|
|
63
|
-
|
|
65
|
+
const t = r - x, n = l(t);
|
|
66
|
+
e && n < l(e) + 1 || 0 !== b || (_ = t < 0 ? 2 : 1), h && (h = !1), x = r, s = 4;
|
|
67
|
+
const i = M();
|
|
68
|
+
i >= -m && i <= c() && (s += 1, o = n > m);
|
|
64
69
|
break;
|
|
65
70
|
}
|
|
66
71
|
|
|
67
72
|
case 2:
|
|
68
|
-
|
|
73
|
+
s = 8, 0 !== _ && (n = !0, s += 1), _ = 0, b = 0, I = null;
|
|
69
74
|
break;
|
|
70
75
|
|
|
71
76
|
case 3:
|
|
72
77
|
{
|
|
73
|
-
const e =
|
|
78
|
+
const e = r.filter(([e, t]) => !i(e, t));
|
|
74
79
|
if (!e.length) break;
|
|
75
|
-
|
|
76
|
-
let o;
|
|
77
|
-
if (2 === _) o = !0; else if (b && 1 === _) o = t < b[0]; else {
|
|
78
|
-
const e = O(), r = L(t), s = n(t);
|
|
79
|
-
o = 1 !== I && 0 === _ ? r + s <= e : r < e && r + s < e + m;
|
|
80
|
-
}
|
|
81
|
-
return o && (e += r - n(t)), e;
|
|
82
|
-
}, 0));
|
|
83
|
-
for (const [t, r] of e) {
|
|
84
|
-
const e = n(t), o = i(t, r);
|
|
85
|
-
h && (T += o ? r : r - e);
|
|
86
|
-
}
|
|
87
|
-
h && m && T > m && (W(g(t(C()))), h = !1), d = 3, a = !0;
|
|
80
|
+
L(g(e, E, O(), m)), s = 3, o = !0;
|
|
88
81
|
break;
|
|
89
82
|
}
|
|
90
83
|
|
|
91
84
|
case 4:
|
|
92
|
-
m !==
|
|
85
|
+
m !== r && (m || (T = o = !0), m = r, s = 3);
|
|
93
86
|
break;
|
|
94
87
|
|
|
95
88
|
case 5:
|
|
96
|
-
|
|
89
|
+
r[1] ? (L(a(r[0], !0)), b = 2, s = 1) : (a(r[0]), s = 1);
|
|
97
90
|
break;
|
|
98
91
|
|
|
99
92
|
case 6:
|
|
100
|
-
w =
|
|
93
|
+
w = r;
|
|
101
94
|
break;
|
|
102
95
|
|
|
103
96
|
case 7:
|
|
104
|
-
|
|
97
|
+
b = 1;
|
|
105
98
|
break;
|
|
106
99
|
|
|
107
100
|
case 9:
|
|
108
|
-
|
|
109
|
-
|
|
101
|
+
{
|
|
102
|
+
const e = d(r, O());
|
|
103
|
+
null != e && (L(e), s = 3);
|
|
104
|
+
break;
|
|
105
|
+
}
|
|
110
106
|
|
|
111
107
|
case 8:
|
|
112
|
-
|
|
108
|
+
I = e(r, r + m), s = 1;
|
|
113
109
|
}
|
|
114
|
-
|
|
115
|
-
|
|
110
|
+
s && (v = 1 + (2147483647 & v), n && z && (S += z, z = 0), R.forEach(([e, t]) => {
|
|
111
|
+
s & e && t(o);
|
|
116
112
|
}));
|
|
117
113
|
}
|
|
118
114
|
};
|
|
119
|
-
}, w = (e, t, r
|
|
115
|
+
}, w = (e, t, r) => {
|
|
116
|
+
const n = r ? "unshift" : "push";
|
|
117
|
+
for (let r = 0; r < t; r++) e[n](-1);
|
|
118
|
+
return e;
|
|
119
|
+
}, x = (e, t, r, n = 0, o = t - 1) => {
|
|
120
120
|
let s = n;
|
|
121
121
|
for (;n <= o; ) {
|
|
122
122
|
const t = i((n + o) / 2);
|
|
@@ -124,134 +124,140 @@ r), v = e => s(e.l(), e.u()), m = ({h: e, p: t, $: r, v: n, m: i, S: c, l: u, I:
|
|
|
124
124
|
}
|
|
125
125
|
return c(s, 0, t - 1);
|
|
126
126
|
}, S = (e, t, r) => {
|
|
127
|
-
|
|
128
|
-
|
|
129
|
-
|
|
130
|
-
}, x = (e, t, r) => {
|
|
131
|
-
let n = r && r[1] || t || 40, l = -1, i = 0;
|
|
132
|
-
const c = r && r[0], a = c ? S(c.slice(0, o(e, c.length)), s(0, e - c.length)) : S([], e), f = S([], e + 1), g = e => {
|
|
133
|
-
const t = a[e];
|
|
127
|
+
let n = r && r[1] || t || 40, l = -1, i = 0, c = !t, a = 0;
|
|
128
|
+
const f = r && r[0], g = f ? w(f.slice(0, o(e, f.length)), s(0, e - f.length)) : w([], e), d = w([], e + 1), p = e => {
|
|
129
|
+
const t = g[e];
|
|
134
130
|
return -1 === t ? n : t;
|
|
135
|
-
},
|
|
131
|
+
}, h = t => {
|
|
136
132
|
if (!e) return 0;
|
|
137
|
-
if (l >= t) return
|
|
138
|
-
l < 0 && (
|
|
139
|
-
let r = l, n =
|
|
140
|
-
for (;r < t; ) n +=
|
|
133
|
+
if (l >= t) return d[t];
|
|
134
|
+
l < 0 && (d[0] = 0, l = 0);
|
|
135
|
+
let r = l, n = d[r];
|
|
136
|
+
for (;r < t; ) n += p(r), d[++r] = n;
|
|
141
137
|
return l = t, n;
|
|
142
138
|
};
|
|
143
139
|
return {
|
|
144
|
-
|
|
140
|
+
p: (t, r) => {
|
|
145
141
|
let n, s;
|
|
146
|
-
return
|
|
147
|
-
s =
|
|
142
|
+
return a = o(a, e - 1), h(a) <= t ? (s = x(h, e, r, a), n = x(h, e, t, a, s)) : (n = x(h, e, t, void 0, a),
|
|
143
|
+
s = x(h, e, r, n)), a = n, [ n, s ];
|
|
148
144
|
},
|
|
149
|
-
|
|
150
|
-
$:
|
|
151
|
-
v:
|
|
152
|
-
m: (e, t) =>
|
|
153
|
-
|
|
154
|
-
|
|
145
|
+
h: t => x(h, e, t),
|
|
146
|
+
$: h,
|
|
147
|
+
v: p,
|
|
148
|
+
m: (e, t = -1) => g[e] === t,
|
|
149
|
+
k: (t, r, a, f) => {
|
|
150
|
+
let d = t.reduce((e, [t, n]) => r(t) ? e + (n - p(t)) : e, 0);
|
|
151
|
+
for (const [e, r] of t) i += -1 === g[e] ? r : r - p(e), g[e] = r, l = o(e, l);
|
|
152
|
+
if (c && f && i > f) {
|
|
153
|
+
let t = 0;
|
|
154
|
+
const r = x(h, e, a + d), o = [];
|
|
155
|
+
g.forEach((e, n) => {
|
|
156
|
+
-1 !== e && (e && o.push(e), n < r && t++);
|
|
157
|
+
}), l = -1, u(o);
|
|
158
|
+
const i = o.length, f = i / 2 | 0, p = i % 2 == 0 ? (o[f - 1] + o[f]) / 2 : o[f], $ = n;
|
|
159
|
+
d += ((n = p) - $) * s(r - t, 0), c = !1;
|
|
160
|
+
}
|
|
161
|
+
return d;
|
|
155
162
|
},
|
|
156
|
-
|
|
157
|
-
|
|
158
|
-
I: () => e,
|
|
163
|
+
l: () => h(e),
|
|
164
|
+
S: () => e,
|
|
159
165
|
_: (t, r) => {
|
|
160
166
|
const s = t - e;
|
|
161
|
-
return l = r ? -1 : o(t - 1, l), e = t, s > 0 ? (
|
|
162
|
-
(r ?
|
|
167
|
+
return l = r ? -1 : o(t - 1, l), e = t, s > 0 ? (w(d, s), w(g, s, r), n * s) : (d.splice(s),
|
|
168
|
+
(r ? g.splice(0, -s) : g.splice(s)).reduce((e, t) => e - (-1 === t ? n : t), 0));
|
|
163
169
|
},
|
|
164
|
-
|
|
165
|
-
|
|
166
|
-
const r = [];
|
|
167
|
-
a.forEach((n, o) => {
|
|
168
|
-
-1 !== n && (n && r.push(n), o < e && t++);
|
|
169
|
-
}), l = -1, u(r);
|
|
170
|
-
const o = r.length, i = o / 2 | 0, c = o % 2 == 0 ? (r[i - 1] + r[i]) / 2 : r[i], f = n;
|
|
171
|
-
return ((n = c) - f) * s(e - t, 0);
|
|
172
|
-
},
|
|
173
|
-
B: () => [ a.slice(), n ]
|
|
174
|
-
};
|
|
175
|
-
}, z = e => "number" == typeof e ? e : e.length, y = (e, t) => "number" == typeof e ? t : e[t], I = (e, t, r = 0) => {
|
|
176
|
-
let n = 0, l = 0;
|
|
177
|
-
const u = (e = 0, t = 0) => {
|
|
178
|
-
n = e, l = t;
|
|
179
|
-
}, a = e => o(n, e), f = e => s(e - l, a(e)), g = (e, t, n, o, l) => {
|
|
180
|
-
const i = t(a(n)), c = t(n) - t(f(n)), u = o + (i ? i - r : 0);
|
|
181
|
-
return e(u, s(u, l - (c ? c - r : 0)));
|
|
170
|
+
I: () => c,
|
|
171
|
+
j: () => [ g.slice(), n ]
|
|
182
172
|
};
|
|
183
|
-
|
|
184
|
-
|
|
185
|
-
|
|
186
|
-
|
|
187
|
-
|
|
188
|
-
|
|
189
|
-
|
|
190
|
-
|
|
191
|
-
|
|
192
|
-
|
|
193
|
-
|
|
194
|
-
|
|
195
|
-
|
|
196
|
-
|
|
197
|
-
|
|
198
|
-
|
|
199
|
-
|
|
200
|
-
|
|
201
|
-
|
|
202
|
-
|
|
203
|
-
const r = s(t) * (e - o);
|
|
204
|
-
return o = e, r;
|
|
205
|
-
}
|
|
206
|
-
};
|
|
207
|
-
}
|
|
208
|
-
const d = "auto" === t;
|
|
209
|
-
let h = null;
|
|
210
|
-
const p = [], $ = x(z(e), void 0, [ [], 40 + r ]), v = e => d || !!p[e];
|
|
173
|
+
}, z = e => "number" == typeof e ? e : e.length, y = (e, t) => "number" == typeof e ? t : e[t], _ = (e, t, r = 0) => {
|
|
174
|
+
let n = z(e);
|
|
175
|
+
const l = "number" == typeof t, a = "auto" === t;
|
|
176
|
+
let f = (l ? t : 40) + r, g = -1, d = 0, p = a, h = 0, $ = 0, v = null;
|
|
177
|
+
const m = [], S = [], y = [], _ = e => a || !!y[e], b = () => {
|
|
178
|
+
m.length || w(m, n);
|
|
179
|
+
}, I = e => {
|
|
180
|
+
const t = m[e];
|
|
181
|
+
return -1 === t ? f : t;
|
|
182
|
+
}, k = e => {
|
|
183
|
+
if (!n) return 0;
|
|
184
|
+
if (!m.length) return e * f;
|
|
185
|
+
if (g >= e) return S[e];
|
|
186
|
+
g < 0 && (S[0] = 0, g = 0);
|
|
187
|
+
let t = g, r = S[t];
|
|
188
|
+
for (;t < e; ) r += I(t), S[++t] = r;
|
|
189
|
+
return g = e, r;
|
|
190
|
+
}, T = (e, t) => {
|
|
191
|
+
m[e] = t, g = o(e, g);
|
|
192
|
+
}, R = e => m.length ? x(k, n, e) : f ? c(i(e / f), 0, n - 1) : 0, M = () => o(h, n), O = () => s(n - $, M()), C = e => (m.length ? I(e) : f) - r;
|
|
211
193
|
return {
|
|
212
|
-
|
|
213
|
-
|
|
214
|
-
|
|
215
|
-
|
|
216
|
-
|
|
217
|
-
|
|
218
|
-
|
|
219
|
-
|
|
220
|
-
|
|
221
|
-
|
|
222
|
-
|
|
223
|
-
|
|
224
|
-
|
|
225
|
-
|
|
226
|
-
|
|
227
|
-
|
|
228
|
-
|
|
229
|
-
|
|
230
|
-
|
|
231
|
-
|
|
232
|
-
|
|
194
|
+
p: (e, t) => {
|
|
195
|
+
const o = k(M()), l = k(n) - k(O()), i = e + (o ? o - r : 0);
|
|
196
|
+
return [ R(i), R(s(i, t - (l ? l - r : 0))) ];
|
|
197
|
+
},
|
|
198
|
+
h: R,
|
|
199
|
+
$: k,
|
|
200
|
+
v: C,
|
|
201
|
+
k: (e, t, n, o) => {
|
|
202
|
+
let l = e.reduce((e, [r, n]) => _(r) && t(r) ? e + (n - C(r)) : e, 0);
|
|
203
|
+
for (const [t, n] of e) _(t) && (b(), d += -1 === m[t] ? n : n - C(t), T(t, n + r));
|
|
204
|
+
if (p && o && d > o) {
|
|
205
|
+
let e = 0;
|
|
206
|
+
const t = R(n + l), r = [];
|
|
207
|
+
m.forEach((n, o) => {
|
|
208
|
+
-1 !== n && (n && r.push(n), o < t && e++);
|
|
209
|
+
}), g = -1, u(r);
|
|
210
|
+
const o = r.length, i = o / 2 | 0, c = o % 2 == 0 ? (r[i - 1] + r[i]) / 2 : r[i], a = f;
|
|
211
|
+
l += ((f = c) - a) * s(t - e, 0), p = !1;
|
|
212
|
+
}
|
|
213
|
+
return l;
|
|
214
|
+
},
|
|
215
|
+
m: (e, t = -1) => {
|
|
216
|
+
const n = m.length ? m[e] : -1;
|
|
217
|
+
return -1 === t ? _(e) && -1 === n : n === t + r;
|
|
218
|
+
},
|
|
219
|
+
l: () => n ? k(n) - r : 0,
|
|
220
|
+
S: () => n,
|
|
221
|
+
_: e => {
|
|
222
|
+
const t = e - n;
|
|
223
|
+
return g = o(e - 1, g), n = e, m.length && (t > 0 ? w(m, t) : m.splice(t)), 0;
|
|
224
|
+
},
|
|
225
|
+
I: () => p,
|
|
226
|
+
V: _,
|
|
227
|
+
J: (e = 0, t = 0) => {
|
|
228
|
+
h = e, $ = t;
|
|
229
|
+
},
|
|
230
|
+
X: M,
|
|
231
|
+
Y: O,
|
|
232
|
+
D: (e, t) => "number" == typeof t ? l ? t : null : l || a || "auto" === t ? null : e.map(e => null != e ? e[t] : null),
|
|
233
|
+
T: (e, t) => {
|
|
234
|
+
if (null == e) return;
|
|
235
|
+
if ("number" == typeof e) {
|
|
236
|
+
const n = e + r;
|
|
237
|
+
if (n === f) return;
|
|
238
|
+
const o = R(t) * (n - f);
|
|
239
|
+
return f = n, o;
|
|
240
|
+
}
|
|
241
|
+
if (e === v && n === y.length) return;
|
|
242
|
+
v = e, y.length = n, b();
|
|
243
|
+
const o = R(t), s = k(o);
|
|
233
244
|
let l;
|
|
234
245
|
for (let t = 0; t < n; t++) {
|
|
235
246
|
const n = e[t], o = "number" != typeof n;
|
|
236
|
-
if (!o || !
|
|
237
|
-
|
|
247
|
+
if (!o || !y[t]) {
|
|
248
|
+
y[t] = o;
|
|
238
249
|
const e = o ? -1 : n + r;
|
|
239
|
-
|
|
250
|
+
m[t] !== e && (T(t, e), l = !0);
|
|
240
251
|
}
|
|
241
252
|
}
|
|
242
|
-
return l ?
|
|
253
|
+
return l ? k(o) - s : void 0;
|
|
243
254
|
}
|
|
244
255
|
};
|
|
245
|
-
},
|
|
246
|
-
const l = z(r);
|
|
247
|
-
t.j(o, s), l !== e.C() && e.A(5, [ l ]);
|
|
248
|
-
const i = t.Y(n, e.L() - e.$(0));
|
|
249
|
-
null != i && e.A(9, i);
|
|
250
|
-
}, b = /*#__PURE__*/ new WeakMap, k = (e, t, r) => {
|
|
256
|
+
}, b = /*#__PURE__*/ new WeakMap, I = (e, t, r) => {
|
|
251
257
|
const n = [];
|
|
252
258
|
for (const o of e) o >= t && o < r && n.push(o);
|
|
253
259
|
return u(n);
|
|
254
|
-
},
|
|
260
|
+
}, k = (e, t, r) => {
|
|
255
261
|
if (t >= r) return -1;
|
|
256
262
|
let n = 0, o = e.length;
|
|
257
263
|
for (;n < o; ) {
|
|
@@ -259,41 +265,41 @@ r), v = e => s(e.l(), e.u()), m = ({h: e, p: t, $: r, v: n, m: i, S: c, l: u, I:
|
|
|
259
265
|
e[r] <= t ? n = r + 1 : o = r;
|
|
260
266
|
}
|
|
261
267
|
return n - 1;
|
|
262
|
-
},
|
|
268
|
+
}, T = (e, t, r, n, o) => {
|
|
263
269
|
const s = t.length;
|
|
264
270
|
for (;r < s && t[r] < n; r++) {
|
|
265
271
|
const n = t[r];
|
|
266
272
|
n > o && (e.push(n), o = n);
|
|
267
273
|
}
|
|
268
274
|
return r;
|
|
269
|
-
},
|
|
275
|
+
}, R = (e, t, r, n, o, s) => {
|
|
270
276
|
const l = [];
|
|
271
277
|
for (let e = 0; e < r; e++) l.push(e);
|
|
272
|
-
const i =
|
|
278
|
+
const i = T(l, e, 0, n, r - 1);
|
|
273
279
|
for (let e = n; e <= o; e++) l.push(e);
|
|
274
|
-
|
|
280
|
+
T(l, e, i, s, o);
|
|
275
281
|
for (let e = s; e < t; e++) l.push(e);
|
|
276
282
|
return l;
|
|
277
|
-
},
|
|
283
|
+
}, M = (e, t) => o(e.rowIndex + (e.rowSpan || 1), t), O = (e, t) => o(e.colIndex + (e.colSpan || 1), t), C = (e, t, r, n, s, l) => {
|
|
278
284
|
const i = t.length, c = n.length;
|
|
279
285
|
let u = "[l0]", a = 0, f = 0, g = 0;
|
|
280
286
|
for (;a < l; ) {
|
|
281
287
|
for (;g < c && n[g] <= a; ) g++;
|
|
282
288
|
const d = f < i ? t[f] : l;
|
|
283
|
-
let
|
|
289
|
+
let p, h;
|
|
284
290
|
if (d === a) {
|
|
285
|
-
|
|
291
|
+
p = a + 1;
|
|
286
292
|
const t = r[f];
|
|
287
|
-
|
|
288
|
-
} else
|
|
289
|
-
u += " " +
|
|
293
|
+
h = null == t ? e.v(a) + "px" : t ? s : "minmax(" + e.v(a) + "px,auto)", f++;
|
|
294
|
+
} else p = o(d, g < c ? n[g] : l), h = "minmax(" + (e.$(p - 1) + e.v(p - 1) - e.$(a)) + "px,auto)";
|
|
295
|
+
u += " " + h + " [l" + p + "]", a = p;
|
|
290
296
|
}
|
|
291
297
|
return u;
|
|
292
|
-
},
|
|
298
|
+
}, E = e => {
|
|
293
299
|
let t = "";
|
|
294
300
|
for (const r in e) t += r.replace(/[A-Z]/g, e => "-" + e.toLowerCase()) + ":" + e[r] + ";";
|
|
295
301
|
return t;
|
|
296
|
-
},
|
|
302
|
+
}, L = (e, t, r, n, o) => {
|
|
297
303
|
const s = {
|
|
298
304
|
display: "grid",
|
|
299
305
|
gridTemplateRows: "subgrid",
|
|
@@ -302,11 +308,11 @@ r), v = e => s(e.l(), e.u()), m = ({h: e, p: t, $: r, v: n, m: i, S: c, l: u, I:
|
|
|
302
308
|
gridRow: "l" + e + "/l" + t
|
|
303
309
|
};
|
|
304
310
|
return null != r && (s.position = "sticky", s[n] = r + "px", s.zIndex = o), s;
|
|
305
|
-
},
|
|
311
|
+
}, W = e => {
|
|
306
312
|
let t;
|
|
307
313
|
return {
|
|
308
314
|
U(r) {
|
|
309
|
-
(t || (t = new (p(
|
|
315
|
+
(t || (t = new (h(p(r)).ResizeObserver)(e))).observe(r);
|
|
310
316
|
},
|
|
311
317
|
Z(e) {
|
|
312
318
|
t.unobserve(e);
|
|
@@ -315,30 +321,30 @@ r), v = e => s(e.l(), e.u()), m = ({h: e, p: t, $: r, v: n, m: i, S: c, l: u, I:
|
|
|
315
321
|
t && t.disconnect();
|
|
316
322
|
}
|
|
317
323
|
};
|
|
318
|
-
},
|
|
319
|
-
let i, c, u = 0, d = !1,
|
|
320
|
-
const m = Date.now, w = n ? "scrollLeft" : "scrollTop",
|
|
324
|
+
}, q = (e, t, r, n, o, s, l) => {
|
|
325
|
+
let i, c, u = 0, d = !1, p = !1, h = !1, v = !1;
|
|
326
|
+
const m = Date.now, w = n ? "scrollLeft" : "scrollTop", x = n ? "left" : "top", S = e => o ? -e : e, z = () => S(r[w]), y = (e, t) => {
|
|
321
327
|
r.scrollTo({
|
|
322
|
-
[
|
|
328
|
+
[x]: S(e),
|
|
323
329
|
behavior: t ? "smooth" : "instant"
|
|
324
330
|
});
|
|
325
|
-
}, I = () => {
|
|
326
|
-
if (d || h) return d = !1, void _();
|
|
327
|
-
p = !1, e.A(2);
|
|
328
331
|
}, _ = () => {
|
|
329
|
-
|
|
332
|
+
if (d || p) return d = !1, void b();
|
|
333
|
+
h = !1, e.B(2);
|
|
330
334
|
}, b = () => {
|
|
331
|
-
|
|
335
|
+
f(c), c = a(_, 150);
|
|
336
|
+
}, I = () => {
|
|
337
|
+
u = m(), h && (v = !0), l && e.B(6, l()), e.B(1, z()), b();
|
|
332
338
|
}, k = t => {
|
|
333
|
-
if (d || !e.
|
|
339
|
+
if (d || !e.q() || t.ctrlKey) return;
|
|
334
340
|
const r = m() - u;
|
|
335
341
|
150 > r && 50 < r && (n ? t.deltaX : t.deltaY) && (d = !0);
|
|
336
342
|
}, T = () => {
|
|
337
|
-
|
|
343
|
+
p = !0, h = v = !1;
|
|
338
344
|
}, R = () => {
|
|
339
|
-
|
|
345
|
+
p = !1, $() && (h = !0);
|
|
340
346
|
};
|
|
341
|
-
return t.addEventListener("scroll",
|
|
347
|
+
return t.addEventListener("scroll", I), t.addEventListener("wheel", k, {
|
|
342
348
|
passive: !0
|
|
343
349
|
}), t.addEventListener("touchstart", T, {
|
|
344
350
|
passive: !0
|
|
@@ -346,18 +352,18 @@ r), v = e => s(e.l(), e.u()), m = ({h: e, p: t, $: r, v: n, m: i, S: c, l: u, I:
|
|
|
346
352
|
passive: !0
|
|
347
353
|
}), {
|
|
348
354
|
F: () => {
|
|
349
|
-
t.removeEventListener("scroll",
|
|
355
|
+
t.removeEventListener("scroll", I), t.removeEventListener("wheel", k), t.removeEventListener("touchstart", T),
|
|
350
356
|
t.removeEventListener("touchend", R), f(c);
|
|
351
357
|
},
|
|
352
358
|
G: () => {
|
|
353
|
-
const [t, n] = e.
|
|
359
|
+
const [t, n] = e.P();
|
|
354
360
|
if (!t) return;
|
|
355
361
|
v && s && s(), v = !1;
|
|
356
|
-
const o = e.
|
|
357
|
-
|
|
358
|
-
[
|
|
362
|
+
const o = e.W(), l = o + t, c = e.H() + e.l() - e.u();
|
|
363
|
+
l <= 0 || l >= c || o >= c ? y(l) : r.scrollBy({
|
|
364
|
+
[x]: S(t),
|
|
359
365
|
behavior: "instant"
|
|
360
|
-
}), n && (i && i(), e.u() > e.l() && e.
|
|
366
|
+
}), n && (i && i(), e.u() > e.l() && e.B(1, z()));
|
|
361
367
|
},
|
|
362
368
|
K: (t, r) => {
|
|
363
369
|
let n, o, s;
|
|
@@ -367,44 +373,44 @@ r), v = e => s(e.l(), e.u()), m = ({h: e, p: t, $: r, v: n, m: i, S: c, l: u, I:
|
|
|
367
373
|
}, c = () => {
|
|
368
374
|
if (!n) {
|
|
369
375
|
if (e.u() && (f(o), o = a(l, 150)), r) {
|
|
370
|
-
for (let [t, r] = e.
|
|
376
|
+
for (let [t, r] = e.p(0); t <= r; t++) if (e.C(t)) return;
|
|
371
377
|
l();
|
|
372
378
|
}
|
|
373
|
-
e.
|
|
379
|
+
e.B(7), y(t(), r);
|
|
374
380
|
}
|
|
375
381
|
}, u = () => {
|
|
376
382
|
if (n) return;
|
|
377
383
|
let t;
|
|
378
|
-
s = e.
|
|
384
|
+
s = e.A(2, () => {
|
|
379
385
|
t || (t = !0, g(() => {
|
|
380
386
|
t = !1, c();
|
|
381
387
|
}));
|
|
382
388
|
}), c();
|
|
383
389
|
};
|
|
384
|
-
r ? (e.
|
|
390
|
+
r ? (e.B(8, t()), g(u)) : u();
|
|
385
391
|
}
|
|
386
392
|
};
|
|
387
|
-
},
|
|
393
|
+
}, H = (e, t) => {
|
|
388
394
|
e.N(() => t);
|
|
389
|
-
},
|
|
390
|
-
if (r = c(r, 0, t.
|
|
391
|
-
const e = t.$(r), o = t.
|
|
395
|
+
}, P = (e, t, r, {align: n, smooth: o, offset: s = 0} = {}) => {
|
|
396
|
+
if (r = c(r, 0, t.L() - 1), "nearest" === n) {
|
|
397
|
+
const e = t.$(r), o = t.W();
|
|
392
398
|
if (e < o) n = "start"; else {
|
|
393
399
|
if (!(e + t.v(r) > o + t.u())) return;
|
|
394
400
|
n = "end";
|
|
395
401
|
}
|
|
396
402
|
}
|
|
397
403
|
e.N(() => s + e.ee() + t.$(r) + ("end" === n ? t.v(r) - t.u() : "center" === n ? (t.v(r) - t.u()) / 2 : 0), o);
|
|
398
|
-
},
|
|
399
|
-
const a = t.
|
|
404
|
+
}, A = (e, t, r, n, l, i, u) => {
|
|
405
|
+
const a = t.L(), f = r.X(), g = r.Y();
|
|
400
406
|
l = c(l, 0, a - 1);
|
|
401
|
-
const d =
|
|
407
|
+
const d = I(n, f, g), p = k(d, l, g), h = p < 0 ? -1 : d[p], $ = () => r.$(f) + (h < 0 || h === l ? 0 : r.$(h + 1) - r.$(h)), v = () => r.$(a) - r.$(g);
|
|
402
408
|
if ("nearest" === i) {
|
|
403
409
|
if (l < f || l >= g) return;
|
|
404
|
-
const e = $(), r = t.
|
|
410
|
+
const e = $(), r = t.W() + e, n = t.u() - e - v(), c = t.v(l);
|
|
405
411
|
let u = t.$(l);
|
|
406
|
-
if (
|
|
407
|
-
const e = (
|
|
412
|
+
if (h === l) {
|
|
413
|
+
const e = (p + 1 < d.length ? d[p + 1] : g) - 1;
|
|
408
414
|
u = s(u, o(r, t.$(e) + t.v(e) - c));
|
|
409
415
|
}
|
|
410
416
|
if (u < r) i = "start"; else {
|
|
@@ -416,7 +422,7 @@ r), v = e => s(e.l(), e.u()), m = ({h: e, p: t, $: r, v: n, m: i, S: c, l: u, I:
|
|
|
416
422
|
const e = $(), r = t.v(l) - (t.u() - e - v());
|
|
417
423
|
return t.$(l) - e + ("end" === i ? r : "center" === i ? r / 2 : 0);
|
|
418
424
|
});
|
|
419
|
-
},
|
|
425
|
+
}, B = r => {
|
|
420
426
|
let n;
|
|
421
427
|
r = (0, t.mergeProps)({
|
|
422
428
|
te: "div"
|
|
@@ -457,26 +463,26 @@ r), v = e => s(e.l(), e.u()), m = ({h: e, p: t, $: r, v: n, m: i, S: c, l: u, I:
|
|
|
457
463
|
r = (0, t.mergeProps)({
|
|
458
464
|
as: "div"
|
|
459
465
|
}, r);
|
|
460
|
-
const [c, f] = (0, t.createSignal)(!!i), g =
|
|
466
|
+
const [c, f] = (0, t.createSignal)(!!i), g = S(r.data.length, o, l), p = m(g, i), h = ((e, t) => {
|
|
461
467
|
let r, n, o = d();
|
|
462
|
-
const s = /* @__PURE__ */ new WeakMap, l =
|
|
468
|
+
const s = /* @__PURE__ */ new WeakMap, l = W(n => {
|
|
463
469
|
const o = [];
|
|
464
|
-
for (const {target: l, contentRect: {width: i, height: c}} of n) if (l === r) (i || c) && e.
|
|
470
|
+
for (const {target: l, contentRect: {width: i, height: c}} of n) if (l === r) (i || c) && e.B(4, t ? i : c); else if (l.offsetParent) {
|
|
465
471
|
const e = s.get(l);
|
|
466
472
|
null != e && o.push([ e, t ? i : c ]);
|
|
467
473
|
}
|
|
468
|
-
o.length && e.
|
|
474
|
+
o.length && e.B(3, o);
|
|
469
475
|
});
|
|
470
476
|
return {
|
|
471
477
|
ue(s, i = s.parentElement) {
|
|
472
|
-
l.U(r = i), n =
|
|
478
|
+
l.U(r = i), n = q(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
|
|
473
479
|
const e = t ? "overflowX" : "overflowY", r = i.style, n = r[e];
|
|
474
480
|
r[e] = "hidden", a(() => {
|
|
475
481
|
r[e] = n;
|
|
476
482
|
});
|
|
477
483
|
}), o[1](!0);
|
|
478
484
|
},
|
|
479
|
-
|
|
485
|
+
R() {
|
|
480
486
|
l.F(), n && n.F(), o[1](!1), o = d();
|
|
481
487
|
},
|
|
482
488
|
ae: (e, t) => (s.set(e, t), l.U(e), () => {
|
|
@@ -488,64 +494,64 @@ r), v = e => s(e.l(), e.u()), m = ({h: e, p: t, $: r, v: n, m: i, S: c, l: u, I:
|
|
|
488
494
|
fe() {
|
|
489
495
|
n && n.G();
|
|
490
496
|
},
|
|
491
|
-
ee: e.
|
|
497
|
+
ee: e.H
|
|
492
498
|
};
|
|
493
|
-
})(
|
|
494
|
-
|
|
495
|
-
w(
|
|
496
|
-
}),
|
|
497
|
-
r.onScroll?.(
|
|
498
|
-
}),
|
|
499
|
+
})(p, s), [$, w] = (0, t.createSignal)(p.M());
|
|
500
|
+
p.A(1, () => {
|
|
501
|
+
w(p.M());
|
|
502
|
+
}), p.A(4, () => {
|
|
503
|
+
r.onScroll?.(p.W());
|
|
504
|
+
}), p.A(8, () => {
|
|
499
505
|
r.onScrollEnd?.();
|
|
500
506
|
});
|
|
501
|
-
const
|
|
507
|
+
const x = (0, t.createMemo)(e => {
|
|
502
508
|
$();
|
|
503
|
-
const t =
|
|
509
|
+
const t = p.p(r.bufferSize);
|
|
504
510
|
return e && j(e, t) ? e : t;
|
|
505
|
-
}), z = (0, t.createMemo)(() => $() &&
|
|
506
|
-
!e.isServer &&
|
|
511
|
+
}), z = (0, t.createMemo)(() => $() && p.q()), y = (0, t.createMemo)(() => $() && p.l()), _ = r.ref;
|
|
512
|
+
!e.isServer && _ && (_({
|
|
507
513
|
get cache() {
|
|
508
|
-
return g.
|
|
514
|
+
return g.j();
|
|
509
515
|
},
|
|
510
516
|
get scrollOffset() {
|
|
511
|
-
return
|
|
517
|
+
return p.W();
|
|
512
518
|
},
|
|
513
519
|
get scrollSize() {
|
|
514
|
-
return v(
|
|
520
|
+
return v(p);
|
|
515
521
|
},
|
|
516
522
|
get viewportSize() {
|
|
517
|
-
return
|
|
523
|
+
return p.u();
|
|
518
524
|
},
|
|
519
|
-
findItemIndex:
|
|
520
|
-
getItemOffset:
|
|
521
|
-
getItemSize:
|
|
522
|
-
scrollToIndex: (e, t) =>
|
|
523
|
-
scrollTo: e =>
|
|
525
|
+
findItemIndex: p.O,
|
|
526
|
+
getItemOffset: p.$,
|
|
527
|
+
getItemSize: p.v,
|
|
528
|
+
scrollToIndex: (e, t) => P(h, p, e, t),
|
|
529
|
+
scrollTo: e => H(h, e),
|
|
524
530
|
scrollBy: e => ((e, t, r) => {
|
|
525
|
-
|
|
526
|
-
})(
|
|
527
|
-
}), (0, t.onCleanup)(() =>
|
|
528
|
-
f(!1),
|
|
529
|
-
|
|
531
|
+
H(e, r + t.W());
|
|
532
|
+
})(h, p, e)
|
|
533
|
+
}), (0, t.onCleanup)(() => _())), (0, t.onMount)(() => {
|
|
534
|
+
f(!1), h.ue(n, r.scrollRef), (0, t.onCleanup)(() => {
|
|
535
|
+
p.R(), h.R();
|
|
530
536
|
});
|
|
531
537
|
}), (0, t.createComputed)((0, t.on)(() => r.startMargin || 0, e => {
|
|
532
|
-
e !==
|
|
538
|
+
e !== p.H() && p.B(6, e);
|
|
533
539
|
})), (0, t.createEffect)((0, t.on)($, () => {
|
|
534
|
-
|
|
540
|
+
h.fe();
|
|
535
541
|
}));
|
|
536
|
-
const
|
|
542
|
+
const b = (0, t.createMemo)(() => {
|
|
537
543
|
const e = r.data.length;
|
|
538
544
|
(0, t.untrack)(() => {
|
|
539
|
-
e !==
|
|
545
|
+
e !== p.L() && p.B(5, [ e, r.shift ]);
|
|
540
546
|
});
|
|
541
547
|
const n = [], o = [];
|
|
542
548
|
if (r.keepMounted) {
|
|
543
549
|
const t = new Set(r.keepMounted);
|
|
544
|
-
for (let [e, r] =
|
|
550
|
+
for (let [e, r] = x(); e <= r; e++) t.add(e);
|
|
545
551
|
u([ ...t ]).forEach(t => {
|
|
546
552
|
t < e && (n.push(r.data[t]), o.push(t));
|
|
547
553
|
});
|
|
548
|
-
} else for (let [e, t] =
|
|
554
|
+
} else for (let [e, t] = x(); e <= t; e++) n.push(r.data[e]), o.push(e);
|
|
549
555
|
return {
|
|
550
556
|
ge: n,
|
|
551
557
|
de: o
|
|
@@ -572,12 +578,12 @@ r), v = e => s(e.l(), e.u()), m = ({h: e, p: t, $: r, v: n, m: i, S: c, l: u, I:
|
|
|
572
578
|
get children() {
|
|
573
579
|
return (0, e.createComponent)(t.For, {
|
|
574
580
|
get each() {
|
|
575
|
-
return
|
|
581
|
+
return b().ge;
|
|
576
582
|
},
|
|
577
583
|
children: (n, o) => ((n, o) => {
|
|
578
|
-
const l = (0, t.createMemo)(() => ($(),
|
|
579
|
-
|
|
580
|
-
return (0, e.createComponent)(
|
|
584
|
+
const l = (0, t.createMemo)(() => ($(), p.$(o()))), i = (0, t.createMemo)(() => ($(),
|
|
585
|
+
p.C(o()))), u = (0, t.createMemo)(() => (0, t.untrack)(() => r.children(n, o)));
|
|
586
|
+
return (0, e.createComponent)(B, {
|
|
581
587
|
get te() {
|
|
582
588
|
return r.item;
|
|
583
589
|
},
|
|
@@ -585,7 +591,7 @@ r), v = e => s(e.l(), e.u()), m = ({h: e, p: t, $: r, v: n, m: i, S: c, l: u, I:
|
|
|
585
591
|
return o();
|
|
586
592
|
},
|
|
587
593
|
get re() {
|
|
588
|
-
return
|
|
594
|
+
return h.ae;
|
|
589
595
|
},
|
|
590
596
|
get ie() {
|
|
591
597
|
return l();
|
|
@@ -601,32 +607,32 @@ r), v = e => s(e.l(), e.u()), m = ({h: e, p: t, $: r, v: n, m: i, S: c, l: u, I:
|
|
|
601
607
|
return c();
|
|
602
608
|
}
|
|
603
609
|
});
|
|
604
|
-
})(n, (0, t.createMemo)(() =>
|
|
610
|
+
})(n, (0, t.createMemo)(() => b().de[o()]))
|
|
605
611
|
});
|
|
606
612
|
}
|
|
607
613
|
});
|
|
608
614
|
}, J = /*#__PURE__*/ /*#__PURE__*/ (0, e.template)("<div>"), X = /*#__PURE__*/ /*#__PURE__*/ (0,
|
|
609
615
|
e.template)('<div style="contain:size style;overflow-anchor:none;flex:none;position:relative">'), Y = /*#__PURE__*/ /*#__PURE__*/ (0,
|
|
610
|
-
e.template)("<div>"),
|
|
611
|
-
e.template)("<div role=rowgroup>"),
|
|
616
|
+
e.template)("<div>"), D = /*#__PURE__*/ /*#__PURE__*/ (0, e.template)("<div role=row>"), U = /*#__PURE__*/ /*#__PURE__*/ (0,
|
|
617
|
+
e.template)("<div role=rowgroup>"), Z = /*#__PURE__*/ /*#__PURE__*/ (0, e.template)("<div role=table><div>"), F = r => {
|
|
612
618
|
let n;
|
|
613
619
|
const [o, s] = (0, t.createSignal)(void 0);
|
|
614
|
-
(0, t.createComputed)(() => s(r.
|
|
615
|
-
const l = (0, t.createMemo)(() => o().
|
|
620
|
+
(0, t.createComputed)(() => s(r.pe));
|
|
621
|
+
const l = (0, t.createMemo)(() => o().he), i = (0, t.createMemo)(() => o().$e), c = (0,
|
|
616
622
|
t.createMemo)(() => r.ve), u = (0, t.createMemo)(() => r.me), a = (0, t.createMemo)(() => {
|
|
617
623
|
const e = c(), n = u();
|
|
618
624
|
return (0, t.untrack)(() => r.ce(e, n, {
|
|
619
625
|
rowIndex: r.we,
|
|
620
|
-
colIndex: o().
|
|
626
|
+
colIndex: o().xe
|
|
621
627
|
}));
|
|
622
628
|
});
|
|
623
629
|
(0, t.createEffect)((0, t.on)([ l, i ], ([e, o]) => {
|
|
624
630
|
!n || null == e && null == o || (0, t.onCleanup)(r.re(n, e, o));
|
|
625
631
|
}));
|
|
626
|
-
const f = (0, t.createMemo)(() =>
|
|
632
|
+
const f = (0, t.createMemo)(() => E(o().Se));
|
|
627
633
|
return g = Y(), "function" == typeof (d = n) ? (0, e.use)(d, g) : n = g, (0, e.insert)(g, a),
|
|
628
634
|
(0, e.effect)(t => {
|
|
629
|
-
var r = o().ze, n = o().
|
|
635
|
+
var r = o().ze, n = o().xe + 1, s = o().ye, l = o()._e, i = o().be, c = f();
|
|
630
636
|
return r !== t.e && (0, e.setAttribute)(g, "role", t.e = r), n !== t.t && (0, e.setAttribute)(g, "aria-colindex", t.t = n),
|
|
631
637
|
s !== t.a && (0, e.setAttribute)(g, "aria-rowspan", t.a = s), l !== t.o && (0, e.setAttribute)(g, "aria-colspan", t.o = l),
|
|
632
638
|
i !== t.i && (0, e.setAttribute)(g, "aria-sort", t.i = i), t.n = (0, e.style)(g, c, t.n),
|
|
@@ -640,16 +646,16 @@ e.template)("<div role=rowgroup>"), F = /*#__PURE__*/ /*#__PURE__*/ (0, e.templa
|
|
|
640
646
|
n: void 0
|
|
641
647
|
}), g;
|
|
642
648
|
var g, d;
|
|
643
|
-
},
|
|
644
|
-
const n = (0, t.createMemo)(() => r.
|
|
645
|
-
t.createMemo)(() =>
|
|
646
|
-
return l =
|
|
649
|
+
}, G = r => {
|
|
650
|
+
const n = (0, t.createMemo)(() => r.pe), o = (0, t.createMemo)(() => n().Ie.map(e => e.xe)), s = (0,
|
|
651
|
+
t.createMemo)(() => E(n().Se));
|
|
652
|
+
return l = D(), (0, e.insert)(l, (0, e.createComponent)(t.For, {
|
|
647
653
|
get each() {
|
|
648
654
|
return o();
|
|
649
655
|
},
|
|
650
|
-
children: (t, o) => (0, e.createComponent)(
|
|
651
|
-
get
|
|
652
|
-
return n().
|
|
656
|
+
children: (t, o) => (0, e.createComponent)(F, {
|
|
657
|
+
get pe() {
|
|
658
|
+
return n().Ie[o()];
|
|
653
659
|
},
|
|
654
660
|
get ce() {
|
|
655
661
|
return r.ce;
|
|
@@ -676,15 +682,15 @@ e.template)("<div role=rowgroup>"), F = /*#__PURE__*/ /*#__PURE__*/ (0, e.templa
|
|
|
676
682
|
t: void 0
|
|
677
683
|
}), l;
|
|
678
684
|
var l;
|
|
679
|
-
},
|
|
680
|
-
const n = (0, t.createMemo)(() => r.
|
|
681
|
-
return s =
|
|
685
|
+
}, K = r => {
|
|
686
|
+
const n = (0, t.createMemo)(() => r.pe.Re.map(e => e.Te)), o = (0, t.createMemo)(() => E(r.pe.Se));
|
|
687
|
+
return s = U(), (0, e.insert)(s, (0, e.createComponent)(t.For, {
|
|
682
688
|
get each() {
|
|
683
689
|
return n();
|
|
684
690
|
},
|
|
685
|
-
children: (t, n) => (0, e.createComponent)(
|
|
686
|
-
get
|
|
687
|
-
return r.
|
|
691
|
+
children: (t, n) => (0, e.createComponent)(G, {
|
|
692
|
+
get pe() {
|
|
693
|
+
return r.pe.Re[n()];
|
|
688
694
|
},
|
|
689
695
|
get ce() {
|
|
690
696
|
return r.ce;
|
|
@@ -707,8 +713,8 @@ exports.VGrid = r => {
|
|
|
707
713
|
let l;
|
|
708
714
|
const i = (0, t.mergeProps)({
|
|
709
715
|
gap: 0
|
|
710
|
-
}, r), {rows: f, cols: g, rowHeight:
|
|
711
|
-
t.createMemo)(() =>
|
|
716
|
+
}, r), {rows: f, cols: g, rowHeight: p, colWidth: h, gap: $} = i, [, w] = (0, t.splitProps)(r, [ "ref", "children", "rows", "cols", "rowHeight", "colWidth", "headerRows", "sectionRows", "footerRows", "headerCols", "footerCols", "spans", "keepMounted", "bufferSize", "gap", "ariaSort", "onVerticalScroll", "onHorizontalScroll", "onScrollEnd", "style" ]), x = _(f, p, $), S = _(g, h, $), T = (0,
|
|
717
|
+
t.createMemo)(() => x.D(r.rows, r.rowHeight)), E = (0, t.createMemo)(() => S.D(r.cols, r.colWidth)), H = (0,
|
|
712
718
|
t.createMemo)(() => ((e = n) => {
|
|
713
719
|
const t = /* @__PURE__ */ new Map;
|
|
714
720
|
for (const r of e) {
|
|
@@ -719,16 +725,16 @@ exports.VGrid = r => {
|
|
|
719
725
|
}
|
|
720
726
|
}
|
|
721
727
|
return t;
|
|
722
|
-
})(r.spans)), P = m(
|
|
728
|
+
})(r.spans)), P = m(x), B = m(S), j = ((e, t) => {
|
|
723
729
|
let r, n, o, s = d();
|
|
724
|
-
const l = /* @__PURE__ */ new WeakMap, i = /* @__PURE__ */ new WeakMap, c =
|
|
730
|
+
const l = /* @__PURE__ */ new WeakMap, i = /* @__PURE__ */ new WeakMap, c = W(n => {
|
|
725
731
|
const o = [], s = [];
|
|
726
|
-
for (const {target: c, contentRect: {width: u, height: a}} of n) if (c === r) (u || a) && (e.
|
|
727
|
-
t.
|
|
732
|
+
for (const {target: c, contentRect: {width: u, height: a}} of n) if (c === r) (u || a) && (e.B(4, a),
|
|
733
|
+
t.B(4, u)); else if (c.offsetParent) {
|
|
728
734
|
const e = l.get(c), t = i.get(c);
|
|
729
735
|
null != e && o.push([ e, a ]), null != t && s.push([ t, u ]);
|
|
730
736
|
}
|
|
731
|
-
o.length && e.
|
|
737
|
+
o.length && e.B(3, o), s.length && t.B(3, s);
|
|
732
738
|
});
|
|
733
739
|
return {
|
|
734
740
|
async N(e, t) {
|
|
@@ -737,7 +743,7 @@ exports.VGrid = r => {
|
|
|
737
743
|
ue(l) {
|
|
738
744
|
const i = r = l.parentElement;
|
|
739
745
|
c.U(i);
|
|
740
|
-
const u = (e, t) =>
|
|
746
|
+
const u = (e, t) => q(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
|
|
741
747
|
const e = t ? "overflowX" : "overflowY", r = i.style, n = r[e];
|
|
742
748
|
r[e] = "hidden", a(() => {
|
|
743
749
|
r[e] = n;
|
|
@@ -745,7 +751,7 @@ exports.VGrid = r => {
|
|
|
745
751
|
});
|
|
746
752
|
n = u(e, !1), o = u(t, !0), s[1](!0);
|
|
747
753
|
},
|
|
748
|
-
|
|
754
|
+
R() {
|
|
749
755
|
c.F(), n && n.F(), o && o.F(), s[1](!1), s = d();
|
|
750
756
|
},
|
|
751
757
|
ae: (e, t, r) => (null != t && l.set(e, t), null != r && i.set(e, r), c.U(e), () => {
|
|
@@ -755,92 +761,92 @@ exports.VGrid = r => {
|
|
|
755
761
|
n && n.G(), o && o.G();
|
|
756
762
|
}
|
|
757
763
|
};
|
|
758
|
-
})(P,
|
|
759
|
-
P.
|
|
760
|
-
let
|
|
761
|
-
P.
|
|
762
|
-
|
|
763
|
-
}), A
|
|
764
|
-
|
|
764
|
+
})(P, B), V = () => P.M() + B.M(), [J, X] = (0, t.createSignal)(V()), Y = () => X(V());
|
|
765
|
+
P.A(1, Y), B.A(1, Y);
|
|
766
|
+
let D = !1;
|
|
767
|
+
P.A(4, () => {
|
|
768
|
+
D = !0, r.onVerticalScroll && r.onVerticalScroll(P.W());
|
|
769
|
+
}), B.A(4, () => {
|
|
770
|
+
D = !0, r.onHorizontalScroll && r.onHorizontalScroll(B.W());
|
|
765
771
|
});
|
|
766
772
|
const U = () => {
|
|
767
|
-
!
|
|
773
|
+
!D || P.q() || B.q() || (D = !1, r.onScrollEnd && r.onScrollEnd());
|
|
768
774
|
};
|
|
769
|
-
P.
|
|
770
|
-
|
|
771
|
-
|
|
772
|
-
|
|
775
|
+
P.A(8, U), B.A(8, U), (0, t.createComputed)(() => {
|
|
776
|
+
x.J(r.headerRows, r.footerRows), S.J(r.headerCols, r.footerCols);
|
|
777
|
+
const e = z(r.rows), t = z(r.cols);
|
|
778
|
+
e !== P.L() && P.B(5, [ e ]), t !== B.L() && B.B(5, [ t ]), P.B(9, T()), B.B(9, E());
|
|
773
779
|
});
|
|
774
|
-
const
|
|
775
|
-
t.createMemo)(() => (
|
|
776
|
-
const
|
|
777
|
-
r = c(r, v, m), l = o(l, m - 1), i = c(i, w,
|
|
778
|
-
const
|
|
779
|
-
for (const e of d) e.rowIndex <
|
|
780
|
-
const
|
|
781
|
-
|
|
782
|
-
const H =
|
|
780
|
+
const F = (0, t.createMemo)(() => J() && P.L()), N = (0, t.createMemo)(() => J() && B.L()), Q = (0,
|
|
781
|
+
t.createMemo)(() => (J(), ((e, t, [r, l], [i, a], f, g = n, d = n, p) => {
|
|
782
|
+
const h = e.S(), $ = t.S(), v = e.X(), m = e.Y(), w = t.X(), x = t.Y();
|
|
783
|
+
r = c(r, v, m), l = o(l, m - 1), i = c(i, w, x), a = o(a, x - 1);
|
|
784
|
+
const S = I(g, v, m), z = s(w - 1, 0), y = [], _ = [], T = [];
|
|
785
|
+
for (const e of d) e.rowIndex < h && e.colIndex < $ && (T.push(e), y.push(e.rowIndex));
|
|
786
|
+
const E = T.length, W = k(S, r, m), q = W < 0 ? -1 : S[W];
|
|
787
|
+
q >= 0 && y.push(q);
|
|
788
|
+
const H = R(u(y), h, v, r, l, m);
|
|
783
789
|
for (let e = 0; e < H.length; e++) for (const t of f.get(H[e]) || n) {
|
|
784
|
-
const {rowIndex: n, colIndex: c} = t, u =
|
|
790
|
+
const {rowIndex: n, colIndex: c} = t, u = M(t, h), f = O(t, $);
|
|
785
791
|
if ((e < 1 || H[e - 1] < n) && c < $ && (u - n > 1 || f - c > 1)) {
|
|
786
|
-
let e = (n < v || s(n, r) < o(u, l + 1) || m < u ||
|
|
787
|
-
for (let t = 0; !e && t <
|
|
788
|
-
const r =
|
|
792
|
+
let e = (n < v || s(n, r) < o(u, l + 1) || m < u || q >= n && q < u) && (c < w || s(c, i) < o(f, a + 1) || x < f);
|
|
793
|
+
for (let t = 0; !e && t < E; t++) {
|
|
794
|
+
const r = T[t];
|
|
789
795
|
e = r.rowIndex >= n && r.rowIndex < u && r.colIndex >= c && r.colIndex < f;
|
|
790
796
|
}
|
|
791
|
-
e &&
|
|
797
|
+
e && T.push(t);
|
|
792
798
|
}
|
|
793
799
|
}
|
|
794
|
-
for (const {rowIndex: e, colIndex: t} of
|
|
795
|
-
const r =
|
|
796
|
-
y.push(e), r >= 0 && y.push(
|
|
800
|
+
for (const {rowIndex: e, colIndex: t} of T) {
|
|
801
|
+
const r = k(S, e, m);
|
|
802
|
+
y.push(e), r >= 0 && y.push(S[r]), _.push(t);
|
|
797
803
|
}
|
|
798
|
-
u(y), u(
|
|
799
|
-
const P =
|
|
800
|
-
for (const e of
|
|
801
|
-
const t =
|
|
802
|
-
|
|
804
|
+
u(y), u(_);
|
|
805
|
+
const P = R(y, h, v, r, l, m), A = R(_, $, w, i, a, x), B = P.length, j = A.length, V = /* @__PURE__ */ new Map, J = [], X = [];
|
|
806
|
+
for (const e of T) {
|
|
807
|
+
const t = M(e, h), r = O(e, $);
|
|
808
|
+
J.push(t), X.push(r);
|
|
803
809
|
const n = A.indexOf(e.colIndex);
|
|
804
810
|
for (let o = P.indexOf(e.rowIndex); o < B && P[o] < t; o++) {
|
|
805
811
|
const t = P[o] * $;
|
|
806
|
-
for (let o = n; o <
|
|
812
|
+
for (let o = n; o < j && A[o] < r; o++) V.set(t + A[o], e);
|
|
807
813
|
}
|
|
808
814
|
}
|
|
809
|
-
const
|
|
810
|
-
for (const e of A)
|
|
811
|
-
const
|
|
815
|
+
const Y = [];
|
|
816
|
+
for (const e of A) Y.push(!t.V(e) && null);
|
|
817
|
+
const D = [], U = e.$(v), Z = [];
|
|
812
818
|
let F = Z;
|
|
813
819
|
const G = b.get(e), K = /* @__PURE__ */ new Map;
|
|
814
820
|
for (const n of P) {
|
|
815
|
-
const o = n < v, c = n >= m, u =
|
|
821
|
+
const o = n < v, c = n >= m, u = k(S, n, m), f = o ? 0 : c ? m : u < 0 ? -1 : S[u];
|
|
816
822
|
if (n === f) {
|
|
817
|
-
const e = o ? v : c ?
|
|
818
|
-
|
|
823
|
+
const e = o ? v : c ? h : u + 1 < S.length ? S[u + 1] : m;
|
|
824
|
+
J.push(e);
|
|
819
825
|
const t = [];
|
|
820
826
|
Z.push({
|
|
821
827
|
Oe: o ? -1 : c ? -2 : -3 - f,
|
|
822
828
|
Re: t,
|
|
823
|
-
|
|
829
|
+
Se: L(f, e, o || c ? 0 : null, c ? "bottom" : "top", 4)
|
|
824
830
|
}), F = t;
|
|
825
831
|
} else f < 0 && (F = Z);
|
|
826
|
-
const g = u >= 0 && n === f, d = o || c || n ===
|
|
827
|
-
let R = 0,
|
|
828
|
-
for (let e = 0; e <
|
|
829
|
-
const r = A[e], l = r < w, c = r >=
|
|
832
|
+
const g = u >= 0 && n === f, d = o || c || n === q || n >= r && n <= l, y = g ? U : null, _ = n * $, b = G && G.get(n), I = b && b.Ie, T = [];
|
|
833
|
+
let R = 0, C = !e.V(n) && null, E = n + 1, W = !1;
|
|
834
|
+
for (let e = 0; e < j; e++) {
|
|
835
|
+
const r = A[e], l = r < w, c = r >= x, u = l || c || r >= i && r <= a, f = V.get(_ + r);
|
|
830
836
|
if (f ? f.rowIndex === n && f.colIndex === r : d && u) {
|
|
831
|
-
const i = f ?
|
|
832
|
-
let
|
|
833
|
-
|
|
834
|
-
const y = l ? t.$(r) : null,
|
|
835
|
-
!1 !==
|
|
836
|
-
const
|
|
837
|
+
const i = f ? M(f, h) : n + 1, u = f ? O(f, $) : r + 1, a = i - n, d = u - r, v = a > 1, m = d > 1, w = v || m;
|
|
838
|
+
let x, S;
|
|
839
|
+
E = s(E, i);
|
|
840
|
+
const y = l ? t.$(r) : null, _ = c ? t.$($) - t.$(u) : null;
|
|
841
|
+
!1 !== C || v || (x = n, C = !0), !1 !== Y[e] || m || (S = r, Y[e] = !0);
|
|
842
|
+
const b = o ? "columnheader" : r === z && (l || g) ? "rowheader" : "cell", k = w ? a : void 0, L = w ? d : void 0, q = "cell" !== b && p && p.rowIndex === n && p.colIndex === r ? p.order : void 0;
|
|
837
843
|
let H;
|
|
838
|
-
if (
|
|
839
|
-
const e =
|
|
840
|
-
for (;R < e &&
|
|
841
|
-
R < e &&
|
|
844
|
+
if (I) {
|
|
845
|
+
const e = I.length;
|
|
846
|
+
for (;R < e && I[R].xe < r; ) R++;
|
|
847
|
+
R < e && I[R].xe === r && (H = I[R]);
|
|
842
848
|
}
|
|
843
|
-
if (!H || H.ye !==
|
|
849
|
+
if (!H || H.ye !== k || H._e !== L || H.Ce !== y || H.Ee !== _ || H.he !== x || H.$e !== S || H.ze !== b || H.be !== q) {
|
|
844
850
|
let e = "1/l" + r;
|
|
845
851
|
w && (e += "/l" + i + "/l" + u);
|
|
846
852
|
const t = {
|
|
@@ -849,42 +855,42 @@ exports.VGrid = r => {
|
|
|
849
855
|
gridArea: e
|
|
850
856
|
};
|
|
851
857
|
v && (t.height = "0px", t.minHeight = "100%", t.zIndex = 1), m && (t.width = "0px",
|
|
852
|
-
t.minWidth = "100%"), (l || c) && (t[l ? "insetInlineStart" : "insetInlineEnd"] = (l ? y :
|
|
858
|
+
t.minWidth = "100%"), (l || c) && (t[l ? "insetInlineStart" : "insetInlineEnd"] = (l ? y : _) + "px",
|
|
853
859
|
t.position = "sticky", t.zIndex = 2), H = {
|
|
854
|
-
|
|
855
|
-
ye:
|
|
856
|
-
|
|
857
|
-
|
|
858
|
-
$e:
|
|
859
|
-
ze:
|
|
860
|
-
|
|
861
|
-
|
|
860
|
+
xe: r,
|
|
861
|
+
ye: k,
|
|
862
|
+
_e: L,
|
|
863
|
+
he: x,
|
|
864
|
+
$e: S,
|
|
865
|
+
ze: b,
|
|
866
|
+
be: q,
|
|
867
|
+
Se: t,
|
|
862
868
|
Ce: y,
|
|
863
|
-
|
|
869
|
+
Ee: _
|
|
864
870
|
}, W = !0;
|
|
865
871
|
}
|
|
866
|
-
|
|
872
|
+
T.push(H);
|
|
867
873
|
}
|
|
868
874
|
}
|
|
869
|
-
if (
|
|
870
|
-
const e =
|
|
875
|
+
if (D.push(C), T.length) {
|
|
876
|
+
const e = b && !W && b.Ie.length === T.length && b.Le === y ? b : {
|
|
871
877
|
Te: n,
|
|
872
|
-
|
|
873
|
-
|
|
874
|
-
|
|
878
|
+
Ie: T,
|
|
879
|
+
Se: L(n, E, y, "top", 3),
|
|
880
|
+
Le: y
|
|
875
881
|
};
|
|
876
882
|
K.set(n, e), F.push(e);
|
|
877
883
|
}
|
|
878
884
|
}
|
|
879
885
|
return b.set(e, K), {
|
|
880
|
-
|
|
881
|
-
|
|
886
|
+
We: C(e, P, D, u(J), "max-content", h),
|
|
887
|
+
qe: C(t, A, Y, u(X), "minmax(max-content,auto)", $),
|
|
882
888
|
He: Z
|
|
883
889
|
};
|
|
884
|
-
})(
|
|
885
|
-
t.createMemo)(() => Q().He.map(e => "Re" in e ? e.Oe : e.Te)), te = (0, t.createMemo)(() =>
|
|
890
|
+
})(x, S, P.p(r.bufferSize), B.p(r.bufferSize), H(), r.sectionRows, r.keepMounted, r.ariaSort))), ee = (0,
|
|
891
|
+
t.createMemo)(() => Q().He.map(e => "Re" in e ? e.Oe : e.Te)), te = (0, t.createMemo)(() => J() && (P.q() || B.q())), re = (0,
|
|
886
892
|
t.createMemo)(() => {
|
|
887
|
-
const {
|
|
893
|
+
const {We: e, qe: t} = Q(), r = P.$(0), n = B.$(0);
|
|
888
894
|
return {
|
|
889
895
|
contain: "size style",
|
|
890
896
|
"overflow-anchor": "none",
|
|
@@ -901,59 +907,59 @@ exports.VGrid = r => {
|
|
|
901
907
|
}), ne = r.ref;
|
|
902
908
|
return !e.isServer && ne && (ne({
|
|
903
909
|
get verticalScrollOffset() {
|
|
904
|
-
return P.
|
|
910
|
+
return P.W();
|
|
905
911
|
},
|
|
906
912
|
get horizontalScrollOffset() {
|
|
907
|
-
return
|
|
913
|
+
return B.W();
|
|
908
914
|
},
|
|
909
915
|
get scrollHeight() {
|
|
910
916
|
return v(P);
|
|
911
917
|
},
|
|
912
918
|
get scrollWidth() {
|
|
913
|
-
return v(
|
|
919
|
+
return v(B);
|
|
914
920
|
},
|
|
915
921
|
get viewportHeight() {
|
|
916
922
|
return P.u();
|
|
917
923
|
},
|
|
918
924
|
get viewportWidth() {
|
|
919
|
-
return
|
|
925
|
+
return B.u();
|
|
920
926
|
},
|
|
921
|
-
findRowIndex: P.
|
|
922
|
-
findColIndex:
|
|
927
|
+
findRowIndex: P.O,
|
|
928
|
+
findColIndex: B.O,
|
|
923
929
|
getRowOffset: P.$,
|
|
924
|
-
getColOffset:
|
|
930
|
+
getColOffset: B.$,
|
|
925
931
|
getRowSize: P.v,
|
|
926
|
-
getColSize:
|
|
932
|
+
getColSize: B.v,
|
|
927
933
|
scrollToIndex: e => ((e, t, r, o, s, l = n, {rowIndex: i, colIndex: c, rowAlign: u, colAlign: a}) => {
|
|
928
|
-
null != i &&
|
|
929
|
-
})(
|
|
934
|
+
null != i && A(e, t, o, l, i, u, !1), null != c && A(e, r, s, n, c, a, !0);
|
|
935
|
+
})(j, P, B, x, S, r.sectionRows, e),
|
|
930
936
|
scrollTo: ({vertical: e, horizontal: t}) => ((e, t, r) => {
|
|
931
937
|
null != t && e.N(!1, () => t), null != r && e.N(!0, () => r);
|
|
932
|
-
})(
|
|
938
|
+
})(j, e, t),
|
|
933
939
|
scrollBy: ({vertical: e, horizontal: t}) => ((e, t, r, n, o) => {
|
|
934
940
|
if (null != n) {
|
|
935
|
-
const r = n + t.
|
|
941
|
+
const r = n + t.W();
|
|
936
942
|
e.N(!1, () => r);
|
|
937
943
|
}
|
|
938
944
|
if (null != o) {
|
|
939
|
-
const t = o + r.
|
|
945
|
+
const t = o + r.W();
|
|
940
946
|
e.N(!0, () => t);
|
|
941
947
|
}
|
|
942
|
-
})(
|
|
948
|
+
})(j, P, B, e, t)
|
|
943
949
|
}), (0, t.onCleanup)(() => ne())), (0, t.onMount)(() => {
|
|
944
|
-
|
|
945
|
-
P.
|
|
950
|
+
j.ue(l), (0, t.onCleanup)(() => {
|
|
951
|
+
P.R(), B.R(), j.R();
|
|
946
952
|
});
|
|
947
|
-
}), (0, t.createEffect)((0, t.on)(
|
|
948
|
-
|
|
953
|
+
}), (0, t.createEffect)((0, t.on)(J, () => {
|
|
954
|
+
j.fe();
|
|
949
955
|
})), (() => {
|
|
950
|
-
var n =
|
|
956
|
+
var n = Z(), o = n.firstChild;
|
|
951
957
|
(0, e.spread)(n, (0, e.mergeProps)({
|
|
952
958
|
get "aria-rowcount"() {
|
|
953
|
-
return
|
|
959
|
+
return F();
|
|
954
960
|
},
|
|
955
961
|
get "aria-colcount"() {
|
|
956
|
-
return
|
|
962
|
+
return N();
|
|
957
963
|
}
|
|
958
964
|
}, w, {
|
|
959
965
|
get style() {
|
|
@@ -971,8 +977,8 @@ exports.VGrid = r => {
|
|
|
971
977
|
get each() {
|
|
972
978
|
return ee();
|
|
973
979
|
},
|
|
974
|
-
children: (t, n) => t < 0 ? (0, e.createComponent)(
|
|
975
|
-
get
|
|
980
|
+
children: (t, n) => t < 0 ? (0, e.createComponent)(K, {
|
|
981
|
+
get pe() {
|
|
976
982
|
return Q().He[n()];
|
|
977
983
|
},
|
|
978
984
|
get ce() {
|
|
@@ -985,10 +991,10 @@ exports.VGrid = r => {
|
|
|
985
991
|
return r.cols;
|
|
986
992
|
},
|
|
987
993
|
get re() {
|
|
988
|
-
return
|
|
994
|
+
return j.ae;
|
|
989
995
|
}
|
|
990
|
-
}) : (0, e.createComponent)(
|
|
991
|
-
get
|
|
996
|
+
}) : (0, e.createComponent)(G, {
|
|
997
|
+
get pe() {
|
|
992
998
|
return Q().He[n()];
|
|
993
999
|
},
|
|
994
1000
|
get ce() {
|
|
@@ -1001,7 +1007,7 @@ exports.VGrid = r => {
|
|
|
1001
1007
|
return r.cols;
|
|
1002
1008
|
},
|
|
1003
1009
|
get re() {
|
|
1004
|
-
return
|
|
1010
|
+
return j.ae;
|
|
1005
1011
|
}
|
|
1006
1012
|
})
|
|
1007
1013
|
})), (0, e.effect)(t => (0, e.style)(o, re(), t)), n;
|
|
@@ -1065,29 +1071,29 @@ exports.VGrid = r => {
|
|
|
1065
1071
|
}, exports.Virtualizer = V, exports.WindowVirtualizer = r => {
|
|
1066
1072
|
let n;
|
|
1067
1073
|
const {ref: o, data: s, children: l, itemSize: i, ssrCount: c, shift: u, horizontal: a = !1, cache: f, onScrollEnd: g} = r, [$, v] = (0,
|
|
1068
|
-
t.createSignal)(!!c), w =
|
|
1074
|
+
t.createSignal)(!!c), w = S(r.data.length, i, f), x = m(w, c), z = ((e, t) => {
|
|
1069
1075
|
let r, n, o, s, l, i = d();
|
|
1070
|
-
const c = /* @__PURE__ */ new WeakMap, u =
|
|
1076
|
+
const c = /* @__PURE__ */ new WeakMap, u = W(n => {
|
|
1071
1077
|
const o = [];
|
|
1072
1078
|
for (const {target: e, contentRect: {width: s, height: i}} of n) if (e === r) l && l(); else if (e.offsetParent) {
|
|
1073
1079
|
const r = c.get(e);
|
|
1074
1080
|
null != r && o.push([ r, t ? s : i ]);
|
|
1075
1081
|
}
|
|
1076
|
-
o.length && e.
|
|
1082
|
+
o.length && e.B(3, o);
|
|
1077
1083
|
});
|
|
1078
1084
|
return {
|
|
1079
1085
|
ue(c) {
|
|
1080
|
-
const a =
|
|
1086
|
+
const a = p(c), f = h(a), g = r = a.scrollingElement, d = t && "rtl" === getComputedStyle(g).direction, $ = (e, t, r, n, o = 0) => {
|
|
1081
1087
|
const s = n ? "offsetLeft" : "offsetTop", l = o + (d ? t.clientWidth - e[s] - e.offsetWidth : e[s]), i = e.offsetParent;
|
|
1082
1088
|
return e !== r && i ? $(i, t, r, n, l) : l;
|
|
1083
1089
|
}, v = s = () => $(c, g, a.body, t), m = l = () => {
|
|
1084
|
-
e.
|
|
1090
|
+
e.B(4, g[t ? "clientWidth" : "clientHeight"]);
|
|
1085
1091
|
};
|
|
1086
1092
|
f.addEventListener("resize", m), u.U(g), o = () => {
|
|
1087
1093
|
f.removeEventListener("resize", m);
|
|
1088
|
-
}, n =
|
|
1094
|
+
}, n = q(e, f, g, t, d, null, v), i[1](!0);
|
|
1089
1095
|
},
|
|
1090
|
-
|
|
1096
|
+
R() {
|
|
1091
1097
|
o && o(), u.F(), n && n.F(), i[1](!1), i = d();
|
|
1092
1098
|
},
|
|
1093
1099
|
ae: (e, t) => (c.set(e, t), u.U(e), () => {
|
|
@@ -1101,36 +1107,36 @@ exports.VGrid = r => {
|
|
|
1101
1107
|
},
|
|
1102
1108
|
ee: () => s()
|
|
1103
1109
|
};
|
|
1104
|
-
})(
|
|
1105
|
-
|
|
1106
|
-
|
|
1107
|
-
}),
|
|
1110
|
+
})(x, a), [y, _] = (0, t.createSignal)(x.M());
|
|
1111
|
+
x.A(1, () => {
|
|
1112
|
+
_(x.M());
|
|
1113
|
+
}), x.A(4, () => {
|
|
1108
1114
|
r.onScroll?.();
|
|
1109
|
-
}),
|
|
1115
|
+
}), x.A(8, () => {
|
|
1110
1116
|
r.onScrollEnd?.();
|
|
1111
1117
|
});
|
|
1112
|
-
const
|
|
1118
|
+
const b = (0, t.createMemo)(e => {
|
|
1113
1119
|
y();
|
|
1114
|
-
const t =
|
|
1120
|
+
const t = x.p(r.bufferSize);
|
|
1115
1121
|
return e && j(e, t) ? e : t;
|
|
1116
|
-
}),
|
|
1122
|
+
}), I = (0, t.createMemo)(() => y() && x.q()), k = (0, t.createMemo)(() => y() && x.l()), T = r.ref;
|
|
1117
1123
|
!e.isServer && T && (T({
|
|
1118
1124
|
get cache() {
|
|
1119
|
-
return w.
|
|
1125
|
+
return w.j();
|
|
1120
1126
|
},
|
|
1121
1127
|
get scrollOffset() {
|
|
1122
|
-
return
|
|
1128
|
+
return x.W();
|
|
1123
1129
|
},
|
|
1124
1130
|
get viewportSize() {
|
|
1125
|
-
return
|
|
1131
|
+
return x.u();
|
|
1126
1132
|
},
|
|
1127
|
-
findItemIndex:
|
|
1128
|
-
getItemOffset:
|
|
1129
|
-
getItemSize:
|
|
1130
|
-
scrollToIndex: (e, t) =>
|
|
1133
|
+
findItemIndex: x.O,
|
|
1134
|
+
getItemOffset: x.$,
|
|
1135
|
+
getItemSize: x.v,
|
|
1136
|
+
scrollToIndex: (e, t) => P(z, x, e, t)
|
|
1131
1137
|
}), (0, t.onCleanup)(() => T())), (0, t.onMount)(() => {
|
|
1132
1138
|
v(!1), z.ue(n), (0, t.onCleanup)(() => {
|
|
1133
|
-
|
|
1139
|
+
x.R(), z.R();
|
|
1134
1140
|
});
|
|
1135
1141
|
}), (0, t.createEffect)((0, t.on)(y, () => {
|
|
1136
1142
|
z.fe();
|
|
@@ -1138,10 +1144,10 @@ exports.VGrid = r => {
|
|
|
1138
1144
|
const R = (0, t.createMemo)(() => {
|
|
1139
1145
|
const e = r.data.length;
|
|
1140
1146
|
(0, t.untrack)(() => {
|
|
1141
|
-
e !==
|
|
1147
|
+
e !== x.L() && x.B(5, [ e, r.shift ]);
|
|
1142
1148
|
});
|
|
1143
1149
|
const n = [];
|
|
1144
|
-
for (let [e, t] =
|
|
1150
|
+
for (let [e, t] = b(); e <= t; e++) n.push(r.data[e]);
|
|
1145
1151
|
return n;
|
|
1146
1152
|
});
|
|
1147
1153
|
return M = X(), "function" == typeof (O = n) ? (0, e.use)(O, M) : n = M, (0, e.insert)(M, (0,
|
|
@@ -1150,10 +1156,10 @@ exports.VGrid = r => {
|
|
|
1150
1156
|
return R();
|
|
1151
1157
|
},
|
|
1152
1158
|
children: (n, o) => {
|
|
1153
|
-
const s = (0, t.createMemo)(() =>
|
|
1154
|
-
|
|
1159
|
+
const s = (0, t.createMemo)(() => b()[0] + o()), l = (0, t.createMemo)(() => (y(),
|
|
1160
|
+
x.$(s()))), i = (0, t.createMemo)(() => (y(), x.C(s()))), c = (0, t.createMemo)(() => (0,
|
|
1155
1161
|
t.untrack)(() => r.children(n, s)));
|
|
1156
|
-
return (0, e.createComponent)(
|
|
1162
|
+
return (0, e.createComponent)(B, {
|
|
1157
1163
|
get ne() {
|
|
1158
1164
|
return s();
|
|
1159
1165
|
},
|
|
@@ -1176,7 +1182,7 @@ exports.VGrid = r => {
|
|
|
1176
1182
|
});
|
|
1177
1183
|
}
|
|
1178
1184
|
})), (0, e.effect)(t => {
|
|
1179
|
-
var r = a ? k() + "px" : "100%", n = a ? "100%" : k() + "px", o =
|
|
1185
|
+
var r = a ? k() + "px" : "100%", n = a ? "100%" : k() + "px", o = I() ? "none" : void 0;
|
|
1180
1186
|
return r !== t.e && (0, e.setStyleProperty)(M, "width", t.e = r), n !== t.t && (0,
|
|
1181
1187
|
e.setStyleProperty)(M, "height", t.t = n), o !== t.a && (0, e.setStyleProperty)(M, "pointer-events", t.a = o),
|
|
1182
1188
|
t;
|