virtua 0.52.5 → 0.52.7

package/lib/solid/index.js

@@ -1,18 +1,18 @@
-import { Dynamic as e, createComponent as t, effect as r, insert as n, isServer as o, memo as s, mergeProps as i, setAttribute as l, setStyleProperty as c, spread as u, style as a, template as f, use as g } from "solid-js/web";
+import { Dynamic as e, createComponent as t, effect as r, insert as n, isServer as o, memo as s, mergeProps as l, setAttribute as i, setStyleProperty as c, spread as u, style as a, template as f, use as g } from "solid-js/web";
 
-import { For as d, createComputed as h, createEffect as p, createMemo as $, createSignal as m, mergeProps as v, on as w, onCleanup as S, onMount as x, splitProps as z, untrack as y } from "solid-js";
+import { For as d, createComputed as p, createEffect as h, createMemo as $, createSignal as m, mergeProps as v, on as w, onCleanup as S, onMount as x, splitProps as z, untrack as y } from "solid-js";
 
-var I, _ = [], {min: b, max: k, abs: T, floor: R} = Math, M = (e, t, r) => b(r, k(t, e)), O = e => e.sort((e, t) => e - t), C = setTimeout, L = clearTimeout, W = "function" == typeof queueMicrotask ? queueMicrotask : e => {
+var _, I = [], {min: b, max: k, abs: T, floor: R} = Math, M = (e, t, r) => b(r, k(t, e)), C = e => e.sort((e, t) => e - t), O = setTimeout, L = clearTimeout, W = "function" == typeof queueMicrotask ? queueMicrotask : e => {
     Promise.resolve().then(e);
 }, E = () => {
     let e;
     return [ new Promise(t => {
         e = t;
     }), e ];
-}, P = e => e.ownerDocument, H = e => e.defaultView, q = () => (null == I && (I = /iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0), 
-I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I: l, _: c, k: u}, a = 0) => {
-    let f = !!u, g = !!a, d = 1, h = 0, p = 0, $ = 0, m = 0, v = 0, w = 0, S = 0, x = 0, z = null, y = [ 0, g ? k(a - 1, 0) : -1 ], I = 0, _ = !1;
-    const R = /* @__PURE__ */ new Set, M = () => $ - p, O = () => M() + v + m, C = e => r(e) - v, L = e => {
+}, H = e => e.ownerDocument, P = e => e.defaultView, q = () => (null == _ && (_ = /iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0), 
+_), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i, I: c, k: u}, a = 0) => {
+    let f = !!u, g = !!a, d = 1, p = 0, h = 0, $ = 0, m = 0, v = 0, w = 0, S = 0, x = 0, z = null, y = [ 0, g ? k(a - 1, 0) : -1 ], _ = 0, I = !1;
+    const R = /* @__PURE__ */ new Set, M = () => $ - h, C = () => M() + v + m, O = e => r(e) - v, L = e => {
         e && (q() && 0 !== S || z && 1 === x ? v += e : m += e);
     };
     return {
@@ -20,45 +20,45 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
             R.clear();
         },
         R: () => d,
-        h: (t = 200) => {
-            if (!_ || g) return y;
+        p: (t = 200) => {
+            if (!I || g) return y;
             let r, n;
             if (w) [r, n] = y; else {
-                let o = k(0, O()), s = o + h;
+                let o = k(0, C()), s = o + p;
                 f || (t = k(0, t), 1 !== S && (o -= t), 2 !== S && (s += t)), [r, n] = y = e(k(0, o), k(0, s)), 
                 z && (r = b(r, z[0]), n = k(n, z[1]));
             }
-            return [ k(r, 0), b(n, l() - 1) ];
+            return [ k(r, 0), b(n, i() - 1) ];
         },
-        M: e => t(e - p),
-        O: s,
-        $: C,
+        M: e => t(e - h),
+        C: s,
+        $: O,
         m: n,
-        C: l,
+        O: i,
         L: () => $,
         W: () => 0 !== S,
-        u: () => h,
-        P: () => p,
-        l: i,
-        H: () => (w = m, m = 0, [ w, 2 === x ]),
+        u: () => p,
+        H: () => h,
+        l,
+        P: () => (w = m, m = 0, [ w, 2 === x ]),
         q: (e, t) => {
             const r = [ e, t ];
             return R.add(r), () => {
                 R.delete(r);
             };
         },
-        A: (r, l) => {
+        A: (r, i) => {
             let a, y, b = 0;
             switch (r) {
               case 1:
                 {
-                    if (l === $ && 0 === x) break;
+                    if (i === $ && 0 === x) break;
                     const e = w;
                     w = 0;
-                    const t = l - $, r = T(t);
-                    e && r < T(e) + 1 || 0 !== x || (S = t < 0 ? 2 : 1), g && (g = !1), $ = l, b = 4;
+                    const t = i - $, r = T(t);
+                    e && r < T(e) + 1 || 0 !== x || (S = t < 0 ? 2 : 1), g && (g = !1), $ = i, b = 4;
                     const n = M();
-                    n >= -h && n <= i() && (b += 1, y = r > h);
+                    n >= -p && n <= l() && (b += 1, y = r > p);
                     break;
                 }
 
@@ -68,34 +68,34 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
 
               case 3:
                 {
-                    const e = l.filter(([e, t]) => !s(e, t));
+                    const e = i.filter(([e, t]) => !s(e, t));
                     if (!e.length) break;
                     L(e.reduce((e, [t, r]) => {
                         let o;
                         if (2 === x) o = !0; else if (z && 1 === x) o = t < z[0]; else {
-                            const e = M(), r = C(t), s = n(t);
-                            o = 1 !== S && 0 === x ? r + s <= e : r < e && r + s < e + h;
+                            const e = M(), r = O(t), s = n(t);
+                            o = 1 !== S && 0 === x ? r + s <= e : r < e && r + s < e + p;
                         }
                         return o && (e += r - n(t)), e;
                     }, 0));
                     for (const [t, r] of e) {
                         const e = n(t), s = o(t, r);
-                        f && (I += s ? r : r - e);
+                        f && (_ += s ? r : r - e);
                     }
-                    f && h && I > h && (L(u(t(O()))), f = !1), b = 3, y = !0;
+                    f && p && _ > p && (L(u(t(C()))), f = !1), b = 3, y = !0;
                     break;
                 }
 
               case 4:
-                h !== l && (h || (_ = y = !0), h = l, b = 3);
+                p !== i && (p || (I = y = !0), p = i, b = 3);
                 break;
 
               case 5:
-                l[1] ? (L(c(l[0], !0)), x = 2, b = 1) : (c(l[0]), b = 1);
+                i[1] ? (L(c(i[0], !0)), x = 2, b = 1) : (c(i[0]), b = 1);
                 break;
 
               case 6:
-                p = l;
+                h = i;
                 break;
 
               case 7:
@@ -103,18 +103,22 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
                 break;
 
               case 9:
-                L(l), b = 3;
+                L(i), b = 3;
                 break;
 
               case 8:
-                z = e(l, l + h), b = 1;
+                z = e(i, i + p), b = 1;
             }
             b && (d = 1 + (2147483647 & d), a && v && (m += v, v = 0), R.forEach(([e, t]) => {
                 b & e && t(y);
             }));
         }
     };
-}, D = (e, t, r, n = 0, o = t - 1) => {
+}, D = (e, t, r) => {
+    const n = r ? "unshift" : "push";
+    for (let r = 0; r < t; r++) e[n](-1);
+    return e;
+}, V = (e, t, r, n = 0, o = t - 1) => {
     let s = n;
     for (;n <= o; ) {
         const t = R((n + o) / 2);
@@ -122,13 +126,9 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
     }
     return M(s, 0, t - 1);
 }, j = (e, t, r) => {
-    const n = r ? "unshift" : "push";
-    for (let r = 0; r < t; r++) e[n](-1);
-    return e;
-}, V = (e, t, r) => {
     let n = r && r[1] || t || 40, o = -1, s = 0;
-    const i = r && r[0], l = i ? j(i.slice(0, b(e, i.length)), k(0, e - i.length)) : j([], e), c = j([], e + 1), u = e => {
-        const t = l[e];
+    const l = r && r[0], i = l ? D(l.slice(0, b(e, l.length)), k(0, e - l.length)) : D([], e), c = D([], e + 1), u = e => {
+        const t = i[e];
         return -1 === t ? n : t;
     }, a = t => {
         if (!e) return 0;
@@ -139,115 +139,127 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
         return o = t, n;
     };
     return {
-        h: (t, r) => {
+        p: (t, r) => {
             let n, o;
-            return s = b(s, e - 1), a(s) <= t ? (o = D(a, e, r, s), n = D(a, e, t, s, o)) : (n = D(a, e, t, void 0, s), 
-            o = D(a, e, r, n)), s = n, [ n, o ];
+            return s = b(s, e - 1), a(s) <= t ? (o = V(a, e, r, s), n = V(a, e, t, s, o)) : (n = V(a, e, t, void 0, s), 
+            o = V(a, e, r, n)), s = n, [ n, o ];
         },
-        p: t => D(a, e, t),
+        h: t => V(a, e, t),
         $: a,
         m: u,
         v: (e, t) => {
-            const r = -1 === l[e];
-            return l[e] = t, o = b(e, o), r;
+            const r = -1 === i[e];
+            return i[e] = t, o = b(e, o), r;
         },
-        S: (e, t = -1) => l[e] === t,
+        S: (e, t = -1) => i[e] === t,
         l: () => a(e),
-        I: () => e,
-        _: (t, r) => {
+        _: () => e,
+        I: (t, r) => {
             const s = t - e;
-            return o = r ? -1 : b(t - 1, o), e = t, s > 0 ? (j(c, s), j(l, s, r), n * s) : (c.splice(s), 
-            (r ? l.splice(0, -s) : l.splice(s)).reduce((e, t) => e - (-1 === t ? n : t), 0));
+            return o = r ? -1 : b(t - 1, o), e = t, s > 0 ? (D(c, s), D(i, s, r), n * s) : (c.splice(s), 
+            (r ? i.splice(0, -s) : i.splice(s)).reduce((e, t) => e - (-1 === t ? n : t), 0));
         },
         k: t ? void 0 : e => {
             let t = 0;
             const r = [];
-            l.forEach((n, o) => {
+            i.forEach((n, o) => {
                 -1 !== n && (n && r.push(n), o < e && t++);
-            }), o = -1, O(r);
-            const s = r.length, i = s / 2 | 0, c = s % 2 == 0 ? (r[i - 1] + r[i]) / 2 : r[i], u = n;
+            }), o = -1, C(r);
+            const s = r.length, l = s / 2 | 0, c = s % 2 == 0 ? (r[l - 1] + r[l]) / 2 : r[l], u = n;
             return ((n = c) - u) * k(e - t, 0);
         },
-        B: () => [ l.slice(), n ]
+        B: () => [ i.slice(), n ]
     };
 }, J = e => "number" == typeof e ? e : e.length, X = (e, t) => "number" == typeof e ? t : e[t], Y = (e, t, r = 0) => {
-    let n = 0, o = 0;
-    const s = (e = 0, t = 0) => {
-        n = e, o = t;
-    }, i = e => b(n, e), l = e => k(e - o, i(e)), c = (e, t, n, o, s) => {
-        const c = t(i(n)), u = t(n) - t(l(n)), a = o + (c ? c - r : 0);
-        return e(a, k(a, s - (u ? u - r : 0)));
-    };
-    if ("number" == typeof t) {
-        let n = J(e), o = t;
-        const u = e => o + r ? M(R(e / (o + r)), 0, n - 1) : 0, a = e => e * (o + r), f = (e, t) => [ u(e), u(t) ];
-        return {
-            h: (e, t) => c(f, a, n, e, t),
-            p: u,
-            $: a,
-            m: () => o,
-            v: () => !1,
-            S: () => !1,
-            l: () => n ? n * (o + r) - r : 0,
-            I: () => n,
-            _: e => (n = e, 0),
-            D: () => !1,
-            j: s,
-            V: () => i(n),
-            J: () => l(n),
-            X: (e, t, r) => {
-                if ("number" != typeof t || t === o) return;
-                const n = u(r) * (t - o);
-                return o = t, n;
-            }
-        };
-    }
-    const u = "auto" === t;
-    let a, f = t;
-    const g = J(e), d = [], h = V(g, void 0, [ [], 40 + r ]), p = e => u || !!d[e], $ = {
-        h: (e, t) => c(h.h, h.$, h.I(), e, t),
-        p: h.p,
-        $: h.$,
-        m: e => h.m(e) - r,
-        v: (e, t) => p(e) && h.v(e, t + r),
-        S: (e, t) => h.S(e, t + r),
-        l: () => h.I() ? h.l() - r : 0,
-        I: h.I,
-        _: h._,
-        k: u ? h.k : void 0,
+    let n = J(e);
+    const o = "number" == typeof t, s = "auto" === t;
+    let l = (o ? t : 40) + r, i = -1, c = 0, u = 0, a = null;
+    const f = [], g = [], d = [], p = e => s || !!d[e], h = () => {
+        f.length || D(f, n);
+    }, $ = e => {
+        const t = f[e];
+        return -1 === t ? l : t;
+    }, m = e => {
+        if (!n) return 0;
+        if (!f.length) return e * l;
+        if (i >= e) return g[e];
+        i < 0 && (g[0] = 0, i = 0);
+        let t = i, r = g[t];
+        for (;t < e; ) r += $(t), g[++t] = r;
+        return i = e, r;
+    }, v = (e, t) => {
+        f[e] = t, i = b(e, i);
+    }, w = e => f.length ? V(m, n, e) : l ? M(R(e / l), 0, n - 1) : 0, S = () => b(c, n), x = () => k(n - u, S());
+    return {
+        p: (e, t) => {
+            const o = m(S()), s = m(n) - m(x()), l = e + (o ? o - r : 0);
+            return [ w(l), w(k(l, t - (s ? s - r : 0))) ];
+        },
+        h: w,
+        $: m,
+        m: e => (f.length ? $(e) : l) - r,
+        v: (e, t) => {
+            if (!p(e)) return !1;
+            h();
+            const n = -1 === f[e];
+            return v(e, t + r), n;
+        },
+        S: (e, t) => (f.length ? f[e] : -1) === t + r,
+        l: () => n ? m(n) - r : 0,
+        _: () => n,
+        I: e => {
+            const t = e - n;
+            return i = b(e - 1, i), n = e, f.length && (t > 0 ? D(f, t) : f.splice(t)), 0;
+        },
+        k: s ? e => {
+            let t = 0;
+            const r = [];
+            f.forEach((n, o) => {
+                -1 !== n && (n && r.push(n), o < e && t++);
+            }), i = -1, C(r);
+            const n = r.length, o = n / 2 | 0, s = n % 2 == 0 ? (r[o - 1] + r[o]) / 2 : r[o], c = l;
+            return ((l = s) - c) * k(e - t, 0);
+        } : void 0,
         D: p,
-        j: s,
-        V: () => i(h.I()),
-        J: () => l(h.I()),
-        X: (e, t, n, o) => {
-            if (u) return;
-            const s = "number" == typeof t || "auto" === t ? f : t, i = h.I();
-            if (!o && e === a && s === f && i === d.length) return;
-            a = e, f = s, d.length = i;
-            const l = h.p(n), c = h.$(l);
-            let g;
-            for (let t = 0; t < i; t++) {
-                const n = e[t], o = null !== n && "object" == typeof n ? n[s] : null, i = "number" != typeof o;
-                if (!i || !d[t]) {
-                    d[t] = i;
-                    const e = i ? -1 : o + r;
-                    h.S(t, e) || (h.v(t, e), g = !0);
+        V: (e = 0, t = 0) => {
+            c = e, u = t;
+        },
+        j: S,
+        J: x,
+        X: (e, t) => "number" == typeof t ? o ? t : null : o || s || "auto" === t ? null : e.map(e => null != e ? e[t] : null),
+        Y: (e, t) => {
+            if (null == e) return;
+            if ("number" == typeof e) {
+                const n = e + r;
+                if (n === l) return;
+                const o = w(t) * (n - l);
+                return l = n, o;
+            }
+            if (e === a && n === d.length) return;
+            a = e, d.length = n, h();
+            const o = w(t), s = m(o);
+            let i;
+            for (let t = 0; t < n; t++) {
+                const n = e[t], o = "number" != typeof n;
+                if (!o || !d[t]) {
+                    d[t] = o;
+                    const e = o ? -1 : n + r;
+                    f[t] !== e && (v(t, e), i = !0);
                 }
             }
-            return g ? h.$(l) - c : void 0;
+            return i ? m(o) - s : void 0;
         }
     };
-    return $.X(e, t, 0), $;
-}, U = (e, t, r, n, o, s, i) => {
+}, U = (e, t, r, n, o, s) => {
     const l = J(r);
-    t.j(o, s), l !== e.C() && e.A(5, [ l ]);
-    const c = t.X(r, n, e.L() - e.$(0), i);
-    null != c && e.A(9, c);
-}, Z = /*#__PURE__*/ new WeakMap, F = (e, t, r, n, o, s) => e < r || k(e, n) < b(t, o + 1) || s < t, G = (e, t, r) => {
+    t.V(o, s), l !== e.O() && e.A(5, [ l ]);
+    const i = t.Y(n, e.L() - e.$(0));
+    null != i && e.A(9, i);
+}, Z = /*#__PURE__*/ new WeakMap, F = (e, t, r) => {
     const n = [];
     for (const o of e) o >= t && o < r && n.push(o);
-    return O(n);
-}, K = (e, t, r) => {
+    return C(n);
+}, G = (e, t, r) => {
     if (t >= r) return -1;
     let n = 0, o = e.length;
     for (;n < o; ) {
@@ -255,41 +267,41 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
         e[r] <= t ? n = r + 1 : o = r;
     }
     return n - 1;
-}, N = (e, t, r, n, o) => {
+}, K = (e, t, r, n, o) => {
     const s = t.length;
     for (;r < s && t[r] < n; r++) {
         const n = t[r];
         n > o && (e.push(n), o = n);
     }
     return r;
-}, Q = (e, t, r, n, o, s) => {
-    const i = [];
-    for (let e = 0; e < r; e++) i.push(e);
-    const l = N(i, e, 0, n, r - 1);
-    for (let e = n; e <= o; e++) i.push(e);
-    N(i, e, l, s, o);
-    for (let e = s; e < t; e++) i.push(e);
-    return i;
-}, ee = (e, t) => b(e.rowIndex + (e.rowSpan || 1), t), te = (e, t) => b(e.colIndex + (e.colSpan || 1), t), re = (e, t, r, n, o, s) => {
-    const i = t.length, l = n.length;
+}, N = (e, t, r, n, o, s) => {
+    const l = [];
+    for (let e = 0; e < r; e++) l.push(e);
+    const i = K(l, e, 0, n, r - 1);
+    for (let e = n; e <= o; e++) l.push(e);
+    K(l, e, i, s, o);
+    for (let e = s; e < t; e++) l.push(e);
+    return l;
+}, Q = (e, t) => b(e.rowIndex + (e.rowSpan || 1), t), ee = (e, t) => b(e.colIndex + (e.colSpan || 1), t), te = (e, t, r, n, o, s) => {
+    const l = t.length, i = n.length;
     let c = "[l0]", u = 0, a = 0, f = 0;
     for (;u < s; ) {
-        for (;f < l && n[f] <= u; ) f++;
-        const g = a < i ? t[a] : s;
-        let d, h;
+        for (;f < i && n[f] <= u; ) f++;
+        const g = a < l ? t[a] : s;
+        let d, p;
         if (g === u) {
             d = u + 1;
             const t = r[a];
-            h = null == t ? e.m(u) + "px" : t ? o : "minmax(" + e.m(u) + "px,auto)", a++;
-        } else d = b(g, f < l ? n[f] : s), h = "minmax(" + (e.$(d - 1) + e.m(d - 1) - e.$(u)) + "px,auto)";
-        c += " " + h + " [l" + d + "]", u = d;
+            p = null == t ? e.m(u) + "px" : t ? o : "minmax(" + e.m(u) + "px,auto)", a++;
+        } else d = b(g, f < i ? n[f] : s), p = "minmax(" + (e.$(d - 1) + e.m(d - 1) - e.$(u)) + "px,auto)";
+        c += " " + p + " [l" + d + "]", u = d;
     }
     return c;
-}, ne = e => {
+}, re = e => {
     let t = "";
     for (const r in e) t += r.replace(/[A-Z]/g, e => "-" + e.toLowerCase()) + ":" + e[r] + ";";
     return t;
-}, oe = (e, t, r, n, o) => {
+}, ne = (e, t, r, n, o) => {
     const s = {
         display: "grid",
         gridTemplateRows: "subgrid",
@@ -298,22 +310,22 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
         gridRow: "l" + e + "/l" + t
     };
     return null != r && (s.position = "sticky", s[n] = r + "px", s.zIndex = o), s;
-}, se = e => {
+}, oe = e => {
     let t;
     return {
-        Y(r) {
-            (t || (t = new (H(P(r)).ResizeObserver)(e))).observe(r);
+        U(r) {
+            (t || (t = new (P(H(r)).ResizeObserver)(e))).observe(r);
         },
-        U(e) {
+        Z(e) {
             t.unobserve(e);
         },
-        Z() {
+        F() {
             t && t.disconnect();
         }
     };
-}, ie = (e, t, r, n, o, s, i) => {
-    let l, c, u = 0, a = !1, f = !1, g = !1, d = !1;
-    const h = Date.now, p = n ? "scrollLeft" : "scrollTop", $ = n ? "left" : "top", m = e => o ? -e : e, v = () => m(r[p]), w = (e, t) => {
+}, se = (e, t, r, n, o, s, l) => {
+    let i, c, u = 0, a = !1, f = !1, g = !1, d = !1;
+    const p = Date.now, h = n ? "scrollLeft" : "scrollTop", $ = n ? "left" : "top", m = e => o ? -e : e, v = () => m(r[h]), w = (e, t) => {
         r.scrollTo({
             [$]: m(e),
             behavior: t ? "smooth" : "instant"
@@ -322,49 +334,49 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
         if (a || f) return a = !1, void x();
         g = !1, e.A(2);
     }, x = () => {
-        L(c), c = C(S, 150);
+        L(c), c = O(S, 150);
     }, z = () => {
-        u = h(), g && (d = !0), i && e.A(6, i()), e.A(1, v()), x();
+        u = p(), g && (d = !0), l && e.A(6, l()), e.A(1, v()), x();
     }, y = t => {
         if (a || !e.W() || t.ctrlKey) return;
-        const r = h() - u;
+        const r = p() - u;
         150 > r && 50 < r && (n ? t.deltaX : t.deltaY) && (a = !0);
-    }, I = () => {
-        f = !0, g = d = !1;
     }, _ = () => {
+        f = !0, g = d = !1;
+    }, I = () => {
         f = !1, q() && (g = !0);
     };
     return t.addEventListener("scroll", z), t.addEventListener("wheel", y, {
         passive: !0
-    }), t.addEventListener("touchstart", I, {
+    }), t.addEventListener("touchstart", _, {
         passive: !0
-    }), t.addEventListener("touchend", _, {
+    }), t.addEventListener("touchend", I, {
         passive: !0
     }), {
-        Z: () => {
-            t.removeEventListener("scroll", z), t.removeEventListener("wheel", y), t.removeEventListener("touchstart", I), 
-            t.removeEventListener("touchend", _), L(c);
-        },
         F: () => {
-            const [t, n] = e.H();
+            t.removeEventListener("scroll", z), t.removeEventListener("wheel", y), t.removeEventListener("touchstart", _), 
+            t.removeEventListener("touchend", I), L(c);
+        },
+        G: () => {
+            const [t, n] = e.P();
             if (!t) return;
             d && s && s(), d = !1;
             const o = e.L() + t;
-            o <= 0 || o >= e.P() + e.l() - e.u() ? w(o) : r.scrollBy({
+            o <= 0 || o >= e.H() + e.l() - e.u() ? w(o) : r.scrollBy({
                 [$]: m(t),
                 behavior: "instant"
-            }), n && (l && l(), e.u() > e.l() && e.A(1, v()));
+            }), n && (i && i(), e.u() > e.l() && e.A(1, v()));
         },
-        G: (t, r) => {
+        K: (t, r) => {
             let n, o, s;
-            l && l();
-            const i = l = () => {
+            i && i();
+            const l = i = () => {
                 n = !0, L(o), s && s();
             }, c = () => {
                 if (!n) {
-                    if (e.u() && (L(o), o = C(i, 150)), r) {
-                        for (let [t, r] = e.h(0); t <= r; t++) if (e.O(t)) return;
-                        i();
+                    if (e.u() && (L(o), o = O(l, 150)), r) {
+                        for (let [t, r] = e.p(0); t <= r; t++) if (e.C(t)) return;
+                        l();
                     }
                     e.A(7), w(t(), r);
                 }
@@ -381,46 +393,46 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
         }
     };
 }, le = (e, t) => {
-    e.K(() => t);
-}, ce = (e, t, r, {align: n, smooth: o, offset: s = 0} = {}) => {
-    if (r = M(r, 0, t.C() - 1), "nearest" === n) {
+    e.N(() => t);
+}, ie = (e, t, r, {align: n, smooth: o, offset: s = 0} = {}) => {
+    if (r = M(r, 0, t.O() - 1), "nearest" === n) {
         const e = t.$(r), o = t.L();
         if (e < o) n = "start"; else {
             if (!(e + t.m(r) > o + t.u())) return;
             n = "end";
         }
     }
-    e.K(() => s + e.N() + t.$(r) + ("end" === n ? t.m(r) - t.u() : "center" === n ? (t.m(r) - t.u()) / 2 : 0), o);
-}, ue = (e, t, r, n, o, s, i) => {
-    const l = t.C(), c = r.V(), u = r.J();
-    o = M(o, 0, l - 1);
-    const a = G(n, c, u), f = K(a, o, u), g = f < 0 ? -1 : a[f], d = () => r.$(c) + (g < 0 || g === o ? 0 : r.$(g + 1) - r.$(g)), h = () => r.$(l) - r.$(u);
+    e.N(() => s + e.ee() + t.$(r) + ("end" === n ? t.m(r) - t.u() : "center" === n ? (t.m(r) - t.u()) / 2 : 0), o);
+}, ce = (e, t, r, n, o, s, l) => {
+    const i = t.O(), c = r.j(), u = r.J();
+    o = M(o, 0, i - 1);
+    const a = F(n, c, u), f = G(a, o, u), g = f < 0 ? -1 : a[f], d = () => r.$(c) + (g < 0 || g === o ? 0 : r.$(g + 1) - r.$(g)), p = () => r.$(i) - r.$(u);
     if ("nearest" === s) {
         if (o < c || o >= u) return;
-        const e = d(), r = t.L() + e, n = t.u() - e - h(), i = t.m(o);
-        let l = t.$(o);
+        const e = d(), r = t.L() + e, n = t.u() - e - p(), l = t.m(o);
+        let i = t.$(o);
         if (g === o) {
             const e = (f + 1 < a.length ? a[f + 1] : u) - 1;
-            l = k(l, b(r, t.$(e) + t.m(e) - i));
+            i = k(i, b(r, t.$(e) + t.m(e) - l));
         }
-        if (l < r) s = "start"; else {
-            if (!(l + i > r + n)) return;
+        if (i < r) s = "start"; else {
+            if (!(i + l > r + n)) return;
             s = "end";
         }
     }
-    e.K(i, () => {
-        const e = d(), r = t.m(o) - (t.u() - e - h());
+    e.N(l, () => {
+        const e = d(), r = t.m(o) - (t.u() - e - p());
         return t.$(o) - e + ("end" === s ? r : "center" === s ? r / 2 : 0);
     });
-}, ae = r => {
+}, ue = r => {
     let n;
     r = v({
-        ee: "div"
-    }, r), p(() => {
-        n && S(r.te(n, r.re));
+        te: "div"
+    }, r), h(() => {
+        n && S(r.re(n, r.ne));
     });
     const o = $(() => {
-        const e = r.ne, t = r.oe, n = r.se, o = {
+        const e = r.oe, t = r.se, n = r.le, o = {
             contain: "layout style",
             position: t && n ? void 0 : "absolute",
             [e ? "height" : "width"]: "100%",
@@ -432,10 +444,10 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
     });
     return t(e, {
         get component() {
-            return r.ee;
+            return r.te;
         },
         get index() {
-            return s(() => "string" == typeof r.ee)() ? void 0 : r.re;
+            return s(() => "string" == typeof r.te)() ? void 0 : r.ne;
         },
         ref(e) {
             "function" == typeof n ? n(e) : n = e;
@@ -444,61 +456,61 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
             return o();
         },
         get children() {
-            return r.le;
+            return r.ce;
         }
     });
-}, fe = (e, t) => e[0] === t[0] && e[1] === t[1], ge = r => {
+}, ae = (e, t) => e[0] === t[0] && e[1] === t[1], fe = r => {
     let n;
-    const {itemSize: s, horizontal: i = !1, cache: l, ssrCount: c} = r;
+    const {itemSize: s, horizontal: l = !1, cache: i, ssrCount: c} = r;
     r = v({
         as: "div"
     }, r);
-    const [u, a] = m(!!c), f = V(r.data.length, s, l), g = B(f, c), z = ((e, t) => {
+    const [u, a] = m(!!c), f = j(r.data.length, s, i), g = B(f, c), z = ((e, t) => {
         let r, n, o = E();
-        const s = /* @__PURE__ */ new WeakMap, i = se(n => {
+        const s = /* @__PURE__ */ new WeakMap, l = oe(n => {
             const o = [];
-            for (const {target: i, contentRect: {width: l, height: c}} of n) if (i === r) (l || c) && e.A(4, t ? l : c); else if (i.offsetParent) {
-                const e = s.get(i);
-                null != e && o.push([ e, t ? l : c ]);
+            for (const {target: l, contentRect: {width: i, height: c}} of n) if (l === r) (i || c) && e.A(4, t ? i : c); else if (l.offsetParent) {
+                const e = s.get(l);
+                null != e && o.push([ e, t ? i : c ]);
             }
             o.length && e.A(3, o);
         });
         return {
-            ce(s, l = s.parentElement) {
-                i.Y(r = l), n = ie(e, l, l, t, t && "rtl" === getComputedStyle(l).direction, () => {
-                    const e = t ? "overflowX" : "overflowY", r = l.style, n = r[e];
-                    r[e] = "hidden", C(() => {
+            ue(s, i = s.parentElement) {
+                l.U(r = i), n = se(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
+                    const e = t ? "overflowX" : "overflowY", r = i.style, n = r[e];
+                    r[e] = "hidden", O(() => {
                         r[e] = n;
                     });
                 }), o[1](!0);
             },
             T() {
-                i.Z(), n && n.Z(), o[1](!1), o = E();
+                l.F(), n && n.F(), o[1](!1), o = E();
             },
-            ue: (e, t) => (s.set(e, t), i.Y(e), () => {
-                s.delete(e), i.U(e);
+            ae: (e, t) => (s.set(e, t), l.U(e), () => {
+                s.delete(e), l.Z(e);
             }),
-            async K(e, t) {
-                await o[0] && n.G(e, t);
+            async N(e, t) {
+                await o[0] && n.K(e, t);
             },
-            ae() {
-                n && n.F();
+            fe() {
+                n && n.G();
             },
-            N: e.P
+            ee: e.H
         };
-    })(g, i), [I, _] = m(g.R());
+    })(g, l), [_, I] = m(g.R());
     g.q(1, () => {
-        _(g.R());
+        I(g.R());
     }), g.q(4, () => {
         r.onScroll?.(g.L());
     }), g.q(8, () => {
         r.onScrollEnd?.();
     });
     const b = $(e => {
-        I();
-        const t = g.h(r.bufferSize);
-        return e && fe(e, t) ? e : t;
-    }), k = $(() => I() && g.W()), T = $(() => I() && g.l()), R = r.ref;
+        _();
+        const t = g.p(r.bufferSize);
+        return e && ae(e, t) ? e : t;
+    }), k = $(() => _() && g.W()), T = $(() => _() && g.l()), R = r.ref;
     !o && R && (R({
         get cache() {
             return f.B();
@@ -515,36 +527,36 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
         findItemIndex: g.M,
         getItemOffset: g.$,
         getItemSize: g.m,
-        scrollToIndex: (e, t) => ce(z, g, e, t),
+        scrollToIndex: (e, t) => ie(z, g, e, t),
         scrollTo: e => le(z, e),
         scrollBy: e => ((e, t, r) => {
             le(e, r + t.L());
         })(z, g, e)
     }), S(() => R())), x(() => {
-        a(!1), z.ce(n, r.scrollRef), S(() => {
+        a(!1), z.ue(n, r.scrollRef), S(() => {
             g.T(), z.T();
         });
-    }), h(w(() => r.startMargin || 0, e => {
-        e !== g.P() && g.A(6, e);
-    })), p(w(I, () => {
-        z.ae();
+    }), p(w(() => r.startMargin || 0, e => {
+        e !== g.H() && g.A(6, e);
+    })), h(w(_, () => {
+        z.fe();
     }));
     const M = $(() => {
         const e = r.data.length;
         y(() => {
-            e !== g.C() && g.A(5, [ e, r.shift ]);
+            e !== g.O() && g.A(5, [ e, r.shift ]);
         });
         const t = [], n = [];
         if (r.keepMounted) {
             const o = new Set(r.keepMounted);
             for (let [e, t] = b(); e <= t; e++) o.add(e);
-            O([ ...o ]).forEach(o => {
+            C([ ...o ]).forEach(o => {
                 o < e && (t.push(r.data[o]), n.push(o));
             });
         } else for (let [e, o] = b(); e <= o; e++) t.push(r.data[e]), n.push(e);
         return {
-            fe: t,
-            ge: n
+            ge: t,
+            de: n
         };
     });
     return t(e, {
@@ -560,49 +572,49 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
                 "overflow-anchor": "none",
                 flex: "none",
                 position: "relative",
-                width: i ? T() + "px" : "100%",
-                height: i ? "100%" : T() + "px",
+                width: l ? T() + "px" : "100%",
+                height: l ? "100%" : T() + "px",
                 "pointer-events": k() ? "none" : void 0
             };
         },
         get children() {
             return t(d, {
                 get each() {
-                    return M().fe;
+                    return M().ge;
                 },
                 children: (e, n) => ((e, n) => {
-                    const o = $(() => (I(), g.$(n()))), s = $(() => (I(), g.O(n()))), l = $(() => y(() => r.children(e, n)));
-                    return t(ae, {
-                        get ee() {
+                    const o = $(() => (_(), g.$(n()))), s = $(() => (_(), g.C(n()))), i = $(() => y(() => r.children(e, n)));
+                    return t(ue, {
+                        get te() {
                             return r.item;
                         },
-                        get re() {
+                        get ne() {
                             return n();
                         },
-                        get te() {
-                            return z.ue;
+                        get re() {
+                            return z.ae;
                         },
                         get ie() {
                             return o();
                         },
-                        get oe() {
+                        get se() {
                             return s();
                         },
-                        get le() {
-                            return l();
+                        get ce() {
+                            return i();
                         },
-                        ne: i,
-                        get se() {
+                        oe: l,
+                        get le() {
                             return u();
                         }
                     });
-                })(e, $(() => M().ge[n()]))
+                })(e, $(() => M().de[n()]))
             });
         }
     });
-}, de = /*#__PURE__*/ f("<div>"), he = e => {
+}, ge = /*#__PURE__*/ f("<div>"), de = e => {
     const [r, o] = z(e, [ "ref", "data", "children", "bufferSize", "itemSize", "ssrCount", "shift", "horizontal", "keepMounted", "cache", "item", "onScroll", "onScrollEnd", "style" ]);
-    return s = de(), u(s, i(o, {
+    return s = ge(), u(s, l(o, {
         get style() {
             return {
                 display: r.horizontal ? "inline-block" : "block",
@@ -613,7 +625,7 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
                 ...r.style
             };
         }
-    }), !1, !0), n(s, t(ge, {
+    }), !1, !0), n(s, t(fe, {
         ref(e) {
             var t = r.ref;
             "function" == typeof t ? t(e) : r.ref = e;
@@ -656,56 +668,56 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
         }
     })), s;
     var s;
-}, pe = /*#__PURE__*/ f('<div style="contain:size style;overflow-anchor:none;flex:none;position:relative">'), $e = e => {
+}, pe = /*#__PURE__*/ f('<div style="contain:size style;overflow-anchor:none;flex:none;position:relative">'), he = e => {
     let s;
-    const {ref: i, data: l, children: u, itemSize: a, ssrCount: f, shift: h, horizontal: v = !1, cache: z, onScrollEnd: I} = e, [_, b] = m(!!f), k = V(e.data.length, a, z), T = B(k, f), R = ((e, t) => {
-        let r, n, o, s, i, l = E();
-        const c = /* @__PURE__ */ new WeakMap, u = se(n => {
+    const {ref: l, data: i, children: u, itemSize: a, ssrCount: f, shift: p, horizontal: v = !1, cache: z, onScrollEnd: _} = e, [I, b] = m(!!f), k = j(e.data.length, a, z), T = B(k, f), R = ((e, t) => {
+        let r, n, o, s, l, i = E();
+        const c = /* @__PURE__ */ new WeakMap, u = oe(n => {
             const o = [];
-            for (const {target: e, contentRect: {width: s, height: l}} of n) if (e === r) i && i(); else if (e.offsetParent) {
+            for (const {target: e, contentRect: {width: s, height: i}} of n) if (e === r) l && l(); else if (e.offsetParent) {
                 const r = c.get(e);
-                null != r && o.push([ r, t ? s : l ]);
+                null != r && o.push([ r, t ? s : i ]);
             }
             o.length && e.A(3, o);
         });
         return {
-            ce(c) {
-                const a = P(c), f = H(a), g = r = a.scrollingElement, d = t && "rtl" === getComputedStyle(g).direction, h = (e, t, r, n, o = 0) => {
-                    const s = n ? "offsetLeft" : "offsetTop", i = o + (d ? t.clientWidth - e[s] - e.offsetWidth : e[s]), l = e.offsetParent;
-                    return e !== r && l ? h(l, t, r, n, i) : i;
-                }, p = s = () => h(c, g, a.body, t), $ = i = () => {
+            ue(c) {
+                const a = H(c), f = P(a), g = r = a.scrollingElement, d = t && "rtl" === getComputedStyle(g).direction, p = (e, t, r, n, o = 0) => {
+                    const s = n ? "offsetLeft" : "offsetTop", l = o + (d ? t.clientWidth - e[s] - e.offsetWidth : e[s]), i = e.offsetParent;
+                    return e !== r && i ? p(i, t, r, n, l) : l;
+                }, h = s = () => p(c, g, a.body, t), $ = l = () => {
                     e.A(4, g[t ? "clientWidth" : "clientHeight"]);
                 };
-                f.addEventListener("resize", $), u.Y(g), o = () => {
+                f.addEventListener("resize", $), u.U(g), o = () => {
                     f.removeEventListener("resize", $);
-                }, n = ie(e, f, g, t, d, null, p), l[1](!0);
+                }, n = se(e, f, g, t, d, null, h), i[1](!0);
             },
             T() {
-                o && o(), u.Z(), n && n.Z(), l[1](!1), l = E();
+                o && o(), u.F(), n && n.F(), i[1](!1), i = E();
             },
-            ue: (e, t) => (c.set(e, t), u.Y(e), () => {
-                c.delete(e), u.U(e);
+            ae: (e, t) => (c.set(e, t), u.U(e), () => {
+                c.delete(e), u.Z(e);
             }),
-            async K(e, t) {
-                await l[0] && n.G(e, t);
+            async N(e, t) {
+                await i[0] && n.K(e, t);
             },
-            ae() {
-                n && n.F();
+            fe() {
+                n && n.G();
             },
-            N: () => s()
+            ee: () => s()
         };
-    })(T, v), [M, O] = m(T.R());
+    })(T, v), [M, C] = m(T.R());
     T.q(1, () => {
-        O(T.R());
+        C(T.R());
     }), T.q(4, () => {
         e.onScroll?.();
     }), T.q(8, () => {
         e.onScrollEnd?.();
     });
-    const C = $(t => {
+    const O = $(t => {
         M();
-        const r = T.h(e.bufferSize);
-        return t && fe(t, r) ? t : r;
+        const r = T.p(e.bufferSize);
+        return t && ae(t, r) ? t : r;
     }), L = $(() => M() && T.W()), W = $(() => M() && T.l()), q = e.ref;
     !o && q && (q({
         get cache() {
@@ -720,21 +732,21 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
         findItemIndex: T.M,
         getItemOffset: T.$,
         getItemSize: T.m,
-        scrollToIndex: (e, t) => ce(R, T, e, t)
+        scrollToIndex: (e, t) => ie(R, T, e, t)
     }), S(() => q())), x(() => {
-        b(!1), R.ce(s), S(() => {
+        b(!1), R.ue(s), S(() => {
             T.T(), R.T();
         });
-    }), p(w(M, () => {
-        R.ae();
+    }), h(w(M, () => {
+        R.fe();
     }));
     const A = $(() => {
         const t = e.data.length;
         y(() => {
-            t !== T.C() && T.A(5, [ t, e.shift ]);
+            t !== T.O() && T.A(5, [ t, e.shift ]);
         });
         const r = [];
-        for (let [t, n] = C(); t <= n; t++) r.push(e.data[t]);
+        for (let [t, n] = O(); t <= n; t++) r.push(e.data[t]);
         return r;
     });
     return D = pe(), "function" == typeof s ? g(s, D) : s = D, n(D, t(d, {
@@ -742,27 +754,27 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
             return A();
         },
         children: (r, n) => {
-            const o = $(() => C()[0] + n()), s = $(() => (M(), T.$(o()))), i = $(() => (M(), 
-            T.O(o()))), l = $(() => y(() => e.children(r, o)));
-            return t(ae, {
-                get re() {
+            const o = $(() => O()[0] + n()), s = $(() => (M(), T.$(o()))), l = $(() => (M(), 
+            T.C(o()))), i = $(() => y(() => e.children(r, o)));
+            return t(ue, {
+                get ne() {
                     return o();
                 },
-                get te() {
-                    return R.ue;
+                get re() {
+                    return R.ae;
                 },
                 get ie() {
                     return s();
                 },
-                get oe() {
+                get se() {
+                    return l();
+                },
+                get ce() {
                     return i();
                 },
+                oe: v,
                 get le() {
-                    return l();
-                },
-                ne: v,
-                get se() {
-                    return _();
+                    return I();
                 }
             });
         }
@@ -776,26 +788,26 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
         a: void 0
     }), D;
     var D;
-}, me = /*#__PURE__*/ f("<div>"), ve = /*#__PURE__*/ f("<div role=row>"), we = /*#__PURE__*/ f("<div role=rowgroup>"), Se = /*#__PURE__*/ f("<div role=table><div>"), xe = e => {
+}, $e = /*#__PURE__*/ f("<div>"), me = /*#__PURE__*/ f("<div role=row>"), ve = /*#__PURE__*/ f("<div role=rowgroup>"), we = /*#__PURE__*/ f("<div role=table><div>"), Se = e => {
     let t;
     const [o, s] = m(void 0);
-    h(() => s(e.de));
-    const i = $(() => o().he), c = $(() => o().pe), u = $(() => e.$e), f = $(() => e.me), d = $(() => {
+    p(() => s(e.pe));
+    const l = $(() => o().he), c = $(() => o().$e), u = $(() => e.me), f = $(() => e.ve), d = $(() => {
         const t = u(), r = f();
-        return y(() => e.le(t, r, {
-            rowIndex: e.ve,
-            colIndex: o().we
+        return y(() => e.ce(t, r, {
+            rowIndex: e.we,
+            colIndex: o().Se
         }));
     });
-    p(w([ i, c ], ([r, n]) => {
-        !t || null == r && null == n || S(e.te(t, r, n));
+    h(w([ l, c ], ([r, n]) => {
+        !t || null == r && null == n || S(e.re(t, r, n));
     }));
-    const v = $(() => ne(o().Se));
-    return x = me(), "function" == typeof t ? g(t, x) : t = x, n(x, d), r(e => {
-        var t = o().xe, r = o().we + 1, n = o().ze, s = o().ye, i = o().Ie, c = v();
-        return t !== e.e && l(x, "role", e.e = t), r !== e.t && l(x, "aria-colindex", e.t = r), 
-        n !== e.a && l(x, "aria-rowspan", e.a = n), s !== e.o && l(x, "aria-colspan", e.o = s), 
-        i !== e.i && l(x, "aria-sort", e.i = i), e.n = a(x, c, e.n), e;
+    const v = $(() => re(o().xe));
+    return x = $e(), "function" == typeof t ? g(t, x) : t = x, n(x, d), r(e => {
+        var t = o().ze, r = o().Se + 1, n = o().ye, s = o()._e, l = o().Ie, c = v();
+        return t !== e.e && i(x, "role", e.e = t), r !== e.t && i(x, "aria-colindex", e.t = r), 
+        n !== e.a && i(x, "aria-rowspan", e.a = n), s !== e.o && i(x, "aria-colspan", e.o = s), 
+        l !== e.i && i(x, "aria-sort", e.i = l), e.n = a(x, c, e.n), e;
     }, {
         e: void 0,
         t: void 0,
@@ -805,230 +817,243 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
         n: void 0
     }), x;
     var x;
-}, ze = e => {
-    const o = $(() => e.de), s = $(() => o()._e.map(e => e.we)), i = $(() => ne(o().Se));
-    return c = ve(), n(c, t(d, {
+}, xe = e => {
+    const o = $(() => e.pe), s = $(() => o().be.map(e => e.Se)), l = $(() => re(o().xe));
+    return c = me(), n(c, t(d, {
         get each() {
             return s();
         },
-        children: (r, n) => t(xe, {
-            get de() {
-                return o()._e[n()];
+        children: (r, n) => t(Se, {
+            get pe() {
+                return o().be[n()];
             },
-            get le() {
-                return e.le;
-            },
-            get $e() {
-                return e.$e;
+            get ce() {
+                return e.ce;
             },
             get me() {
-                return X(e.be, r);
+                return e.me;
             },
             get ve() {
-                return o().ke;
+                return X(e.ke, r);
+            },
+            get we() {
+                return o().Te;
             },
-            get te() {
-                return e.te;
+            get re() {
+                return e.re;
             }
         })
     })), r(e => {
-        var t = o().ke + 1, r = i();
-        return t !== e.e && l(c, "aria-rowindex", e.e = t), e.t = a(c, r, e.t), e;
+        var t = o().Te + 1, r = l();
+        return t !== e.e && i(c, "aria-rowindex", e.e = t), e.t = a(c, r, e.t), e;
     }, {
         e: void 0,
         t: void 0
     }), c;
     var c;
-}, ye = e => {
-    const o = $(() => e.de.Te.map(e => e.ke)), s = $(() => ne(e.de.Se));
-    return i = we(), n(i, t(d, {
+}, ze = e => {
+    const o = $(() => e.pe.Re.map(e => e.Te)), s = $(() => re(e.pe.xe));
+    return l = ve(), n(l, t(d, {
         get each() {
             return o();
         },
-        children: (r, n) => t(ze, {
-            get de() {
-                return e.de.Te[n()];
+        children: (r, n) => t(xe, {
+            get pe() {
+                return e.pe.Re[n()];
             },
-            get le() {
-                return e.le;
+            get ce() {
+                return e.ce;
             },
-            get $e() {
-                return X(e.Re, r);
+            get me() {
+                return X(e.Me, r);
             },
-            get be() {
-                return e.be;
+            get ke() {
+                return e.ke;
             },
-            get te() {
-                return e.te;
+            get re() {
+                return e.re;
             }
         })
-    })), r(e => a(i, s(), e)), i;
-    var i;
-}, Ie = e => {
+    })), r(e => a(l, s(), e)), l;
+    var l;
+}, ye = e => {
     let s;
-    const l = v({
+    const i = v({
         gap: 0
-    }, e), {rows: c, cols: f, rowHeight: y, colWidth: I, gap: T} = l, [, R] = z(e, [ "ref", "children", "rows", "cols", "rowHeight", "colWidth", "headerRows", "sectionRows", "footerRows", "headerCols", "footerCols", "spans", "keepMounted", "bufferSize", "gap", "ariaSort", "onVerticalScroll", "onHorizontalScroll", "onScrollEnd", "style" ]), L = Y(c, y, T), W = Y(f, I, T), P = B(L), H = B(W), q = ((e, t) => {
+    }, e), {rows: c, cols: f, rowHeight: y, colWidth: _, gap: T} = i, [, R] = z(e, [ "ref", "children", "rows", "cols", "rowHeight", "colWidth", "headerRows", "sectionRows", "footerRows", "headerCols", "footerCols", "spans", "keepMounted", "bufferSize", "gap", "ariaSort", "onVerticalScroll", "onHorizontalScroll", "onScrollEnd", "style" ]), L = Y(c, y, T), W = Y(f, _, T), H = $(() => L.X(e.rows, e.rowHeight)), P = $(() => W.X(e.cols, e.colWidth)), q = $(() => ((e = I) => {
+        const t = /* @__PURE__ */ new Map;
+        for (const r of e) {
+            const e = r.rowIndex + (r.rowSpan || 1);
+            for (let n = r.rowIndex; n < e; n++) {
+                const e = t.get(n);
+                e ? e.push(r) : t.set(n, [ r ]);
+            }
+        }
+        return t;
+    })(e.spans)), D = B(L), V = B(W), j = ((e, t) => {
         let r, n, o, s = E();
-        const i = /* @__PURE__ */ new WeakMap, l = /* @__PURE__ */ new WeakMap, c = se(n => {
+        const l = /* @__PURE__ */ new WeakMap, i = /* @__PURE__ */ new WeakMap, c = oe(n => {
             const o = [], s = [];
             for (const {target: c, contentRect: {width: u, height: a}} of n) if (c === r) (u || a) && (e.A(4, a), 
             t.A(4, u)); else if (c.offsetParent) {
-                const e = i.get(c), t = l.get(c);
+                const e = l.get(c), t = i.get(c);
                 null != e && o.push([ e, a ]), null != t && s.push([ t, u ]);
             }
             o.length && e.A(3, o), s.length && t.A(3, s);
         });
         return {
-            async K(e, t) {
-                await s[0] && (e ? o : n).G(t);
+            async N(e, t) {
+                await s[0] && (e ? o : n).K(t);
             },
-            ce(i) {
-                const l = r = i.parentElement;
-                c.Y(l);
-                const u = (e, t) => ie(e, l, l, t, t && "rtl" === getComputedStyle(l).direction, () => {
-                    const e = t ? "overflowX" : "overflowY", r = l.style, n = r[e];
-                    r[e] = "hidden", C(() => {
+            ue(l) {
+                const i = r = l.parentElement;
+                c.U(i);
+                const u = (e, t) => se(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
+                    const e = t ? "overflowX" : "overflowY", r = i.style, n = r[e];
+                    r[e] = "hidden", O(() => {
                         r[e] = n;
                     });
                 });
                 n = u(e, !1), o = u(t, !0), s[1](!0);
             },
             T() {
-                c.Z(), n && n.Z(), o && o.Z(), s[1](!1), s = E();
+                c.F(), n && n.F(), o && o.F(), s[1](!1), s = E();
             },
-            ue: (e, t, r) => (null != t && i.set(e, t), null != r && l.set(e, r), c.Y(e), () => {
-                i.delete(e), l.delete(e), c.U(e);
+            ae: (e, t, r) => (null != t && l.set(e, t), null != r && i.set(e, r), c.U(e), () => {
+                l.delete(e), i.delete(e), c.Z(e);
             }),
-            ae() {
-                n && n.F(), o && o.F();
+            fe() {
+                n && n.G(), o && o.G();
             }
         };
-    })(P, H), D = () => P.R() + H.R(), [j, V] = m(D()), J = () => V(D());
-    P.q(1, J), H.q(1, J);
-    let N = !1;
-    P.q(4, () => {
-        N = !0, e.onVerticalScroll && e.onVerticalScroll(P.L());
-    }), H.q(4, () => {
-        N = !0, e.onHorizontalScroll && e.onHorizontalScroll(H.L());
+    })(D, V), J = () => D.R() + V.R(), [K, re] = m(J()), le = () => re(J());
+    D.q(1, le), V.q(1, le);
+    let ie = !1;
+    D.q(4, () => {
+        ie = !0, e.onVerticalScroll && e.onVerticalScroll(D.L());
+    }), V.q(4, () => {
+        ie = !0, e.onHorizontalScroll && e.onHorizontalScroll(V.L());
     });
-    const ne = () => {
-        !N || P.W() || H.W() || (N = !1, e.onScrollEnd && e.onScrollEnd());
+    const ue = () => {
+        !ie || D.W() || V.W() || (ie = !1, e.onScrollEnd && e.onScrollEnd());
     };
-    P.q(8, ne), H.q(8, ne), h(() => {
-        U(P, L, e.rows, e.rowHeight, e.headerRows, e.footerRows, !0);
-    }), h(() => {
-        U(H, W, e.cols, e.colWidth, e.headerCols, e.footerCols, !0);
+    D.q(8, ue), V.q(8, ue), p(() => {
+        U(D, L, e.rows, H(), e.headerRows, e.footerRows);
+    }), p(() => {
+        U(V, W, e.cols, P(), e.headerCols, e.footerCols);
     });
-    const le = $(() => j() && P.C()), ce = $(() => j() && H.C()), ae = $(() => (j(), 
-    ((e, t, r, n, o = _, s = _, i = _, l) => {
-        const c = e.I(), u = t.I(), a = e.V(), f = e.J(), g = t.V(), d = t.J(), h = M(r[0], a, f), p = b(r[1], f - 1), $ = M(n[0], g, d), m = b(n[1], d - 1), v = G(o, a, f), w = k(g - 1, 0), S = [], x = [], z = [];
-        for (const e of i) e.rowIndex < c && e.colIndex < u && z.push(e);
-        const y = z.length, I = v.length, T = K(v, h, f), R = T < 0 ? -1 : v[T];
-        R >= 0 && S.push(R);
-        for (const e of s) {
-            const t = e.rowIndex, r = e.colIndex, n = ee(e, c), o = te(e, u);
-            if (t < c && r < u && (n - t > 1 || o - r > 1)) {
-                let s = (F(t, n, a, h, p, f) || R >= t && R < n) && F(r, o, g, $, m, d);
-                for (let e = 0; !s && e < y; e++) {
-                    const {rowIndex: i, colIndex: l} = z[e];
-                    s = i >= t && i < n && l >= r && l < o;
+    const ae = $(() => K() && D.O()), fe = $(() => K() && V.O()), ge = $(() => (K(), 
+    ((e, t, [r, n], [o, s], l, i = I, c = I, u) => {
+        const a = e._(), f = t._(), g = e.j(), d = e.J(), p = t.j(), h = t.J();
+        r = M(r, g, d), n = b(n, d - 1), o = M(o, p, h), s = b(s, h - 1);
+        const $ = F(i, g, d), m = k(p - 1, 0), v = [], w = [], S = [];
+        for (const e of c) e.rowIndex < a && e.colIndex < f && (S.push(e), v.push(e.rowIndex));
+        const x = S.length, z = G($, r, d), y = z < 0 ? -1 : $[z];
+        y >= 0 && v.push(y);
+        const _ = N(C(v), a, g, r, n, d);
+        for (let e = 0; e < _.length; e++) for (const t of l.get(_[e]) || I) {
+            const {rowIndex: l, colIndex: i} = t, c = Q(t, a), u = ee(t, f);
+            if ((e < 1 || _[e - 1] < l) && i < f && (c - l > 1 || u - i > 1)) {
+                let e = (l < g || k(l, r) < b(c, n + 1) || d < c || y >= l && y < c) && (i < p || k(i, o) < b(u, s + 1) || h < u);
+                for (let t = 0; !e && t < x; t++) {
+                    const r = S[t];
+                    e = r.rowIndex >= l && r.rowIndex < c && r.colIndex >= i && r.colIndex < u;
                 }
-                s && z.push(e);
+                e && S.push(t);
             }
         }
-        for (const {rowIndex: e, colIndex: t} of z) {
-            const r = K(v, e, f);
-            S.push(e), r >= 0 && S.push(v[r]), x.push(t);
+        for (const {rowIndex: e, colIndex: t} of S) {
+            const r = G($, e, d);
+            v.push(e), r >= 0 && v.push($[r]), w.push(t);
         }
-        O(S), O(x);
-        const C = Q(S, c, a, h, p, f), L = Q(x, u, g, $, m, d), W = C.length, E = L.length, P = /* @__PURE__ */ new Map, H = [], q = [];
-        for (const e of z) {
-            const t = ee(e, c), r = te(e, u);
-            H.push(t), q.push(r);
-            const n = L.indexOf(e.colIndex);
-            for (let o = C.indexOf(e.rowIndex); o < W && C[o] < t; o++) {
-                const t = C[o] * u;
-                for (let o = n; o < E && L[o] < r; o++) P.set(t + L[o], e);
+        C(v), C(w);
+        const T = N(v, a, g, r, n, d), R = N(w, f, p, o, s, h), O = T.length, L = R.length, W = /* @__PURE__ */ new Map, E = [], H = [];
+        for (const e of S) {
+            const t = Q(e, a), r = ee(e, f);
+            E.push(t), H.push(r);
+            const n = R.indexOf(e.colIndex);
+            for (let o = T.indexOf(e.rowIndex); o < O && T[o] < t; o++) {
+                const t = T[o] * f;
+                for (let o = n; o < L && R[o] < r; o++) W.set(t + R[o], e);
             }
         }
-        const A = [];
-        for (const e of L) A.push(!t.D(e) && null);
-        const B = [], D = e.$(a), j = [];
-        let V = j;
-        const J = Z.get(e), X = /* @__PURE__ */ new Map;
-        for (const r of C) {
-            const n = r < a, o = r >= f, s = K(v, r, f), i = n ? 0 : o ? f : s < 0 ? -1 : v[s];
-            if (r === i) {
-                const e = n ? a : o ? c : s + 1 < I ? v[s + 1] : f;
-                H.push(e);
+        const P = [];
+        for (const e of R) P.push(!t.D(e) && null);
+        const q = [], A = e.$(g), B = [];
+        let D = B;
+        const V = Z.get(e), j = /* @__PURE__ */ new Map;
+        for (const l of T) {
+            const i = l < g, c = l >= d, v = G($, l, d), w = i ? 0 : c ? d : v < 0 ? -1 : $[v];
+            if (l === w) {
+                const e = i ? g : c ? a : v + 1 < $.length ? $[v + 1] : d;
+                E.push(e);
                 const t = [];
-                j.push({
-                    Me: n ? -1 : o ? -2 : -3 - i,
-                    Te: t,
-                    Se: oe(i, e, n || o ? 0 : null, o ? "bottom" : "top", 4)
-                }), V = t;
-            } else i < 0 && (V = j);
-            const S = s >= 0 && r === i, x = n || o || r === R || r >= h && r <= p, z = S ? D : null, y = r * u, _ = J && J.get(r), b = _ && _._e, T = [];
-            let M = 0, O = !e.D(r) && null, C = r + 1, W = !1;
-            for (let e = 0; e < E; e++) {
-                const o = L[e], s = o < g, i = o >= d, a = s || i || o >= $ && o <= m, f = P.get(y + o);
-                if (f ? f.rowIndex === r && f.colIndex === o : x && a) {
-                    const a = f ? ee(f, c) : r + 1, g = f ? te(f, u) : o + 1, d = a - r, h = g - o, p = d > 1, $ = h > 1, m = p || $;
-                    let v, x;
-                    C = k(C, a);
-                    const z = s ? t.$(o) : null, y = i ? t.l() - t.$(g - 1) - t.m(g - 1) : null;
-                    !1 !== O || p || (v = r, O = !0), !1 !== A[e] || $ || (x = o, A[e] = !0);
-                    const I = n ? "columnheader" : o === w && (s || S) ? "rowheader" : "cell", _ = m ? d : void 0, R = m ? h : void 0, L = "cell" !== I && l && l.rowIndex === r && l.colIndex === o ? l.order : void 0;
-                    let E;
+                B.push({
+                    Ce: i ? -1 : c ? -2 : -3 - w,
+                    Re: t,
+                    xe: ne(w, e, i || c ? 0 : null, c ? "bottom" : "top", 4)
+                }), D = t;
+            } else w < 0 && (D = B);
+            const S = v >= 0 && l === w, x = i || c || l === y || l >= r && l <= n, z = S ? A : null, _ = l * f, I = V && V.get(l), b = I && I.be, T = [];
+            let M = 0, C = !e.D(l) && null, O = l + 1, H = !1;
+            for (let e = 0; e < L; e++) {
+                const r = R[e], n = r < p, c = r >= h, g = n || c || r >= o && r <= s, d = W.get(_ + r);
+                if (d ? d.rowIndex === l && d.colIndex === r : x && g) {
+                    const o = d ? Q(d, a) : l + 1, s = d ? ee(d, f) : r + 1, g = o - l, p = s - r, h = g > 1, $ = p > 1, v = h || $;
+                    let w, x;
+                    O = k(O, o);
+                    const z = n ? t.$(r) : null, y = c ? t.$(f) - t.$(s) : null;
+                    !1 !== C || h || (w = l, C = !0), !1 !== P[e] || $ || (x = r, P[e] = !0);
+                    const _ = i ? "columnheader" : r === m && (n || S) ? "rowheader" : "cell", I = v ? g : void 0, R = v ? p : void 0, L = "cell" !== _ && u && u.rowIndex === l && u.colIndex === r ? u.order : void 0;
+                    let W;
                     if (b) {
                         const e = b.length;
-                        for (;M < e && b[M].we < o; ) M++;
-                        M < e && b[M].we === o && (E = b[M]);
+                        for (;M < e && b[M].Se < r; ) M++;
+                        M < e && b[M].Se === r && (W = b[M]);
                     }
-                    if (!E || E.ze !== _ || E.ye !== R || E.Oe !== z || E.Ce !== y || E.he !== v || E.pe !== x || E.xe !== I || E.Ie !== L) {
-                        let e = "1/l" + o;
-                        m && (e += "/l" + a + "/l" + g);
+                    if (!W || W.ye !== I || W._e !== R || W.Oe !== z || W.Le !== y || W.he !== w || W.$e !== x || W.ze !== _ || W.Ie !== L) {
+                        let e = "1/l" + r;
+                        v && (e += "/l" + o + "/l" + s);
                         const t = {
                             contain: "layout style",
                             display: "grid",
                             gridArea: e
                         };
-                        p && (t.height = "0px", t.minHeight = "100%", t.zIndex = 1), $ && (t.width = "0px", 
-                        t.minWidth = "100%"), (s || i) && (t[s ? "insetInlineStart" : "insetInlineEnd"] = (s ? z : y) + "px", 
-                        t.position = "sticky", t.zIndex = 2), E = {
-                            we: o,
+                        h && (t.height = "0px", t.minHeight = "100%", t.zIndex = 1), $ && (t.width = "0px", 
+                        t.minWidth = "100%"), (n || c) && (t[n ? "insetInlineStart" : "insetInlineEnd"] = (n ? z : y) + "px", 
+                        t.position = "sticky", t.zIndex = 2), W = {
+                            Se: r,
+                            ye: I,
+                            _e: R,
+                            he: w,
+                            $e: x,
                             ze: _,
-                            ye: R,
-                            he: v,
-                            pe: x,
-                            xe: I,
                             Ie: L,
-                            Se: t,
+                            xe: t,
                             Oe: z,
-                            Ce: y
-                        }, W = !0;
+                            Le: y
+                        }, H = !0;
                     }
-                    T.push(E);
+                    T.push(W);
                 }
             }
-            if (B.push(O), T.length) {
-                const e = _ && !W && _._e.length === T.length && _.Le === z ? _ : {
-                    ke: r,
-                    _e: T,
-                    Se: oe(r, C, z, "top", 3),
-                    Le: z
+            if (q.push(C), T.length) {
+                const e = I && !H && I.be.length === T.length && I.We === z ? I : {
+                    Te: l,
+                    be: T,
+                    xe: ne(l, O, z, "top", 3),
+                    We: z
                 };
-                X.set(r, e), V.push(e);
+                j.set(l, e), D.push(e);
             }
         }
-        return Z.set(e, X), {
-            We: re(e, C, B, O(H), "max-content", c),
-            Ee: re(t, L, A, O(q), "minmax(max-content,auto)", u),
-            Pe: j
+        return Z.set(e, j), {
+            Ee: te(e, T, q, C(E), "max-content", a),
+            He: te(t, R, P, C(H), "minmax(max-content,auto)", f),
+            Pe: B
         };
-    })(L, W, P.h(e.bufferSize), H.h(e.bufferSize), e.sectionRows, e.spans, e.keepMounted, e.ariaSort))), fe = $(() => ae().Pe.map(e => "Te" in e ? e.Me : e.ke)), ge = $(() => j() && (P.W() || H.W())), de = $(() => {
-        const {We: e, Ee: t} = ae(), r = P.$(0), n = H.$(0);
+    })(L, W, D.p(e.bufferSize), V.p(e.bufferSize), q(), e.sectionRows, e.keepMounted, e.ariaSort))), de = $(() => ge().Pe.map(e => "Re" in e ? e.Ce : e.Te)), pe = $(() => K() && (D.W() || V.W())), he = $(() => {
+        const {Ee: e, He: t} = ge(), r = D.$(0), n = V.$(0);
         return {
             contain: "size style",
             "overflow-anchor": "none",
@@ -1036,66 +1061,66 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
             display: "grid",
             "grid-template-rows": e,
             "grid-template-columns": t,
-            gap: l.gap + "px",
+            gap: i.gap + "px",
             "margin-top": r + "px",
             "margin-inline-start": n + "px",
-            height: A(P) - r + "px",
-            "pointer-events": ge() ? "none" : void 0
+            height: A(D) - r + "px",
+            "pointer-events": pe() ? "none" : void 0
         };
-    }), he = e.ref;
-    return !o && he && (he({
+    }), $e = e.ref;
+    return !o && $e && ($e({
         get verticalScrollOffset() {
-            return P.L();
+            return D.L();
         },
         get horizontalScrollOffset() {
-            return H.L();
+            return V.L();
         },
         get scrollHeight() {
-            return A(P);
+            return A(D);
         },
         get scrollWidth() {
-            return A(H);
+            return A(V);
         },
         get viewportHeight() {
-            return P.u();
+            return D.u();
         },
         get viewportWidth() {
-            return H.u();
+            return V.u();
         },
-        findRowIndex: P.M,
-        findColIndex: H.M,
-        getRowOffset: P.$,
-        getColOffset: H.$,
-        getRowSize: P.m,
-        getColSize: H.m,
-        scrollToIndex: t => ((e, t, r, n, o, s = _, {rowIndex: i, colIndex: l, rowAlign: c, colAlign: u}) => {
-            null != i && ue(e, t, n, s, i, c, !1), null != l && ue(e, r, o, _, l, u, !0);
-        })(q, P, H, L, W, e.sectionRows, t),
+        findRowIndex: D.M,
+        findColIndex: V.M,
+        getRowOffset: D.$,
+        getColOffset: V.$,
+        getRowSize: D.m,
+        getColSize: V.m,
+        scrollToIndex: t => ((e, t, r, n, o, s = I, {rowIndex: l, colIndex: i, rowAlign: c, colAlign: u}) => {
+            null != l && ce(e, t, n, s, l, c, !1), null != i && ce(e, r, o, I, i, u, !0);
+        })(j, D, V, L, W, e.sectionRows, t),
         scrollTo: ({vertical: e, horizontal: t}) => ((e, t, r) => {
-            null != t && e.K(!1, () => t), null != r && e.K(!0, () => r);
-        })(q, e, t),
+            null != t && e.N(!1, () => t), null != r && e.N(!0, () => r);
+        })(j, e, t),
         scrollBy: ({vertical: e, horizontal: t}) => ((e, t, r, n, o) => {
             if (null != n) {
                 const r = n + t.L();
-                e.K(!1, () => r);
+                e.N(!1, () => r);
             }
             if (null != o) {
                 const t = o + r.L();
-                e.K(!0, () => t);
+                e.N(!0, () => t);
             }
-        })(q, P, H, e, t)
-    }), S(() => he())), x(() => {
-        q.ce(s), S(() => {
-            P.T(), H.T(), q.T();
+        })(j, D, V, e, t)
+    }), S(() => $e())), x(() => {
+        j.ue(s), S(() => {
+            D.T(), V.T(), j.T();
         });
-    }), p(w(j, () => {
-        q.ae();
-    })), pe = Se(), $e = pe.firstChild, u(pe, i({
+    }), h(w(K, () => {
+        j.fe();
+    })), me = we(), ve = me.firstChild, u(me, l({
         get "aria-rowcount"() {
-            return le();
+            return ae();
         },
         get "aria-colcount"() {
-            return ce();
+            return fe();
         }
     }, R, {
         get style() {
@@ -1107,46 +1132,46 @@ I), A = e => k(e.l(), e.u()), B = ({h: e, p: t, $: r, m: n, v: o, S: s, l: i, I:
                 ...e.style
             };
         }
-    }), !1, !0), "function" == typeof s ? g(s, $e) : s = $e, n($e, t(d, {
+    }), !1, !0), "function" == typeof s ? g(s, ve) : s = ve, n(ve, t(d, {
         get each() {
-            return fe();
+            return de();
         },
-        children: (r, n) => r < 0 ? t(ye, {
-            get de() {
-                return ae().Pe[n()];
+        children: (r, n) => r < 0 ? t(ze, {
+            get pe() {
+                return ge().Pe[n()];
             },
-            get le() {
+            get ce() {
                 return e.children;
             },
-            get Re() {
+            get Me() {
                 return e.rows;
             },
-            get be() {
+            get ke() {
                 return e.cols;
             },
-            get te() {
-                return q.ue;
+            get re() {
+                return j.ae;
             }
-        }) : t(ze, {
-            get de() {
-                return ae().Pe[n()];
+        }) : t(xe, {
+            get pe() {
+                return ge().Pe[n()];
             },
-            get le() {
+            get ce() {
                 return e.children;
             },
-            get $e() {
+            get me() {
                 return X(e.rows, r);
             },
-            get be() {
+            get ke() {
                 return e.cols;
             },
-            get te() {
-                return q.ue;
+            get re() {
+                return j.ae;
             }
         })
-    })), r(e => a($e, de(), e)), pe;
-    var pe, $e;
+    })), r(e => a(ve, he(), e)), me;
+    var me, ve;
 };
 
-export { Ie as VGrid, he as VList, ge as Virtualizer, $e as WindowVirtualizer };
+export { ye as VGrid, de as VList, fe as Virtualizer, he as WindowVirtualizer };
 //# sourceMappingURL=index.js.map