virtua 0.52.7 → 0.52.8

package/lib/solid/index.js

@@ -1,101 +1,94 @@
 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 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";
+import { For as d, createComputed as p, createEffect as h, createMemo as $, createSignal as v, mergeProps as m, 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)), C = e => e.sort((e, t) => e - t), O = setTimeout, L = clearTimeout, W = "function" == typeof queueMicrotask ? queueMicrotask : e => {
+var _, b = [], {min: I, max: k, abs: T, floor: R} = Math, M = (e, t, r) => I(r, k(t, e)), C = e => e.sort((e, t) => e - t), O = setTimeout, E = clearTimeout, L = "function" == typeof queueMicrotask ? queueMicrotask : e => {
     Promise.resolve().then(e);
-}, E = () => {
+}, W = () => {
     let e;
     return [ new Promise(t => {
         e = t;
     }), 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);
+_), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, v: n, m: o, l: s, S: l, _: i, I: c, k: u, T: a}, f = 0) => {
+    let g = !!f, d = 1, p = 0, h = 0, $ = 0, v = 0, m = 0, w = 0, S = 0, x = 0, z = null, y = [ 0, g ? k(f - 1, 0) : -1 ], _ = !1;
+    const b = /* @__PURE__ */ new Set, R = () => $ - h, M = () => R() + m + v, C = e => r(e) - m, O = e => {
+        if (2 === x) return !0;
+        if (z && 1 === x) return e < z[0];
+        const t = R(), r = C(e), o = n(e);
+        return 1 !== S && 0 === x ? r + o <= t : r < t && r + o < t + p;
+    }, E = e => {
+        e && (q() && 0 !== S || z && 1 === x ? m += e : v += e);
     };
     return {
-        T: () => {
-            R.clear();
+        R: () => {
+            b.clear();
         },
-        R: () => d,
+        M: () => d,
         p: (t = 200) => {
-            if (!I || g) return y;
+            if (!_ || g) return y;
             let r, n;
             if (w) [r, n] = y; else {
-                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]));
+                let o = k(0, M()), s = o + p;
+                c() || (t = k(0, t), 1 !== S && (o -= t), 2 !== S && (s += t)), [r, n] = y = e(k(0, o), k(0, s)), 
+                z && (r = I(r, z[0]), n = k(n, z[1]));
             }
-            return [ k(r, 0), b(n, i() - 1) ];
+            return [ k(r, 0), I(n, l() - 1) ];
         },
-        M: e => t(e - h),
-        C: s,
-        $: O,
-        m: n,
-        O: i,
-        L: () => $,
-        W: () => 0 !== S,
+        C: e => t(e - h),
+        O: o,
+        $: C,
+        v: n,
+        L: l,
+        W: () => $,
+        H: () => 0 !== S,
         u: () => p,
-        H: () => h,
-        l,
-        P: () => (w = m, m = 0, [ w, 2 === x ]),
-        q: (e, t) => {
+        P: () => h,
+        l: s,
+        q: () => (w = v, v = 0, [ w, 2 === x ]),
+        A: (e, t) => {
             const r = [ e, t ];
-            return R.add(r), () => {
-                R.delete(r);
+            return b.add(r), () => {
+                b.delete(r);
             };
         },
-        A: (r, i) => {
-            let a, y, b = 0;
-            switch (r) {
+        B: (t, r) => {
+            let n, l, c = 0;
+            switch (t) {
               case 1:
                 {
-                    if (i === $ && 0 === x) break;
+                    if (r === $ && 0 === x) break;
                     const e = w;
                     w = 0;
-                    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 >= -p && n <= l() && (b += 1, y = r > p);
+                    const t = r - $, n = T(t);
+                    e && n < T(e) + 1 || 0 !== x || (S = t < 0 ? 2 : 1), g && (g = !1), $ = r, c = 4;
+                    const o = R();
+                    o >= -p && o <= s() && (c += 1, l = n > p);
                     break;
                 }
 
               case 2:
-                b = 8, 0 !== S && (a = !0, b += 1), S = 0, x = 0, z = null;
+                c = 8, 0 !== S && (n = !0, c += 1), S = 0, x = 0, z = null;
                 break;
 
               case 3:
                 {
-                    const e = i.filter(([e, t]) => !s(e, t));
+                    const e = r.filter(([e, t]) => !o(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 = 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 && (_ += s ? r : r - e);
-                    }
-                    f && p && _ > p && (L(u(t(C()))), f = !1), b = 3, y = !0;
+                    E(u(e, O, M(), p)), c = 3, l = !0;
                     break;
                 }
 
               case 4:
-                p !== i && (p || (I = y = !0), p = i, b = 3);
+                p !== r && (p || (_ = l = !0), p = r, c = 3);
                 break;
 
               case 5:
-                i[1] ? (L(c(i[0], !0)), x = 2, b = 1) : (c(i[0]), b = 1);
+                r[1] ? (E(i(r[0], !0)), x = 2, c = 1) : (i(r[0]), c = 1);
                 break;
 
               case 6:
-                h = i;
+                h = r;
                 break;
 
               case 7:
@@ -103,163 +96,166 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
                 break;
 
               case 9:
-                L(i), b = 3;
-                break;
+                {
+                    const e = a(r, M());
+                    null != e && (E(e), c = 3);
+                    break;
+                }
 
               case 8:
-                z = e(i, i + p), b = 1;
+                z = e(r, r + p), c = 1;
             }
-            b && (d = 1 + (2147483647 & d), a && v && (m += v, v = 0), R.forEach(([e, t]) => {
-                b & e && t(y);
+            c && (d = 1 + (2147483647 & d), n && m && (v += m, m = 0), b.forEach(([e, t]) => {
+                c & e && t(l);
             }));
         }
     };
-}, D = (e, t, r) => {
+}, V = (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) => {
+}, j = (e, t, r, n = 0, o = t - 1) => {
     let s = n;
     for (;n <= o; ) {
         const t = R((n + o) / 2);
         e(t) <= r ? (s = t, n = t + 1) : o = t - 1;
     }
     return M(s, 0, t - 1);
-}, j = (e, t, r) => {
-    let n = r && r[1] || t || 40, o = -1, s = 0;
-    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];
+}, J = (e, t, r) => {
+    let n = r && r[1] || t || 40, o = -1, s = 0, l = !t, i = 0;
+    const c = r && r[0], u = c ? V(c.slice(0, I(e, c.length)), k(0, e - c.length)) : V([], e), a = V([], e + 1), f = e => {
+        const t = u[e];
         return -1 === t ? n : t;
-    }, a = t => {
+    }, g = t => {
         if (!e) return 0;
-        if (o >= t) return c[t];
-        o < 0 && (c[0] = 0, o = 0);
-        let r = o, n = c[r];
-        for (;r < t; ) n += u(r), c[++r] = n;
+        if (o >= t) return a[t];
+        o < 0 && (a[0] = 0, o = 0);
+        let r = o, n = a[r];
+        for (;r < t; ) n += f(r), a[++r] = n;
         return o = t, n;
     };
     return {
         p: (t, r) => {
             let 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 ];
+            return i = I(i, e - 1), g(i) <= t ? (o = j(g, e, r, i), n = j(g, e, t, i, o)) : (n = j(g, e, t, void 0, i), 
+            o = j(g, e, r, n)), i = n, [ n, o ];
         },
-        h: t => V(a, e, t),
-        $: a,
-        m: u,
-        v: (e, t) => {
-            const r = -1 === i[e];
-            return i[e] = t, o = b(e, o), r;
+        h: t => j(g, e, t),
+        $: g,
+        v: f,
+        m: (e, t = -1) => u[e] === t,
+        k: (t, r, i, c) => {
+            let a = t.reduce((e, [t, n]) => r(t) ? e + (n - f(t)) : e, 0);
+            for (const [e, r] of t) s += -1 === u[e] ? r : r - f(e), u[e] = r, o = I(e, o);
+            if (l && c && s > c) {
+                let t = 0;
+                const r = j(g, e, i + a), s = [];
+                u.forEach((e, n) => {
+                    -1 !== e && (e && s.push(e), n < r && t++);
+                }), o = -1, C(s);
+                const c = s.length, f = c / 2 | 0, d = c % 2 == 0 ? (s[f - 1] + s[f]) / 2 : s[f], p = n;
+                a += ((n = d) - p) * k(r - t, 0), l = !1;
+            }
+            return a;
         },
-        S: (e, t = -1) => i[e] === t,
-        l: () => a(e),
-        _: () => e,
-        I: (t, r) => {
+        l: () => g(e),
+        S: () => e,
+        _: (t, r) => {
             const s = t - e;
-            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 = [];
-            i.forEach((n, o) => {
-                -1 !== n && (n && r.push(n), o < e && t++);
-            }), 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);
+            return o = r ? -1 : I(t - 1, o), e = t, s > 0 ? (V(a, s), V(u, s, r), n * s) : (a.splice(s), 
+            (r ? u.splice(0, -s) : u.splice(s)).reduce((e, t) => e - (-1 === t ? n : t), 0));
         },
-        B: () => [ i.slice(), n ]
+        I: () => l,
+        V: () => [ u.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 = J(e);
+}, X = e => "number" == typeof e ? e : e.length, Y = (e, t) => "number" == typeof e ? t : e[t], D = (e, t, r = 0) => {
+    let n = X(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;
+    let l = (o ? t : 40) + r, i = -1, c = 0, u = s, a = 0, f = 0, g = null;
+    const d = [], p = [], h = [], $ = e => s || !!h[e], v = () => {
+        d.length || V(d, n);
     }, m = e => {
+        const t = d[e];
+        return -1 === t ? l : t;
+    }, w = 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;
+        if (!d.length) return e * l;
+        if (i >= e) return p[e];
+        i < 0 && (p[0] = 0, i = 0);
+        let t = i, r = p[t];
+        for (;t < e; ) r += m(t), p[++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());
+    }, S = (e, t) => {
+        d[e] = t, i = I(e, i);
+    }, x = e => d.length ? j(w, n, e) : l ? M(R(e / l), 0, n - 1) : 0, z = () => I(a, n), y = () => k(n - f, z()), _ = e => (d.length ? m(e) : l) - r;
     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))) ];
+            const o = w(z()), s = w(n) - w(y()), l = e + (o ? o - r : 0);
+            return [ x(l), x(k(l, t - (s ? s - r : 0))) ];
+        },
+        h: x,
+        $: w,
+        v: _,
+        k: (e, t, n, o) => {
+            let s = e.reduce((e, [r, n]) => $(r) && t(r) ? e + (n - _(r)) : e, 0);
+            for (const [t, n] of e) $(t) && (v(), c += -1 === d[t] ? n : n - _(t), S(t, n + r));
+            if (u && o && c > o) {
+                let e = 0;
+                const t = x(n + s), r = [];
+                d.forEach((n, o) => {
+                    -1 !== n && (n && r.push(n), o < t && e++);
+                }), i = -1, C(r);
+                const o = r.length, c = o / 2 | 0, a = o % 2 == 0 ? (r[c - 1] + r[c]) / 2 : r[c], f = l;
+                s += ((l = a) - f) * k(t - e, 0), u = !1;
+            }
+            return s;
         },
-        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;
+        m: (e, t = -1) => {
+            const n = d.length ? d[e] : -1;
+            return -1 === t ? $(e) && -1 === n : n === t + r;
         },
-        S: (e, t) => (f.length ? f[e] : -1) === t + r,
-        l: () => n ? m(n) - r : 0,
-        _: () => n,
-        I: e => {
+        l: () => n ? w(n) - r : 0,
+        S: () => n,
+        _: e => {
             const t = e - n;
-            return i = b(e - 1, i), n = e, f.length && (t > 0 ? D(f, t) : f.splice(t)), 0;
+            return i = I(e - 1, i), n = e, d.length && (t > 0 ? V(d, t) : d.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,
-        V: (e = 0, t = 0) => {
-            c = e, u = t;
+        I: () => u,
+        j: $,
+        J: (e = 0, t = 0) => {
+            a = e, f = 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) => {
+        X: z,
+        Y: y,
+        D: (e, t) => "number" == typeof t ? o ? t : null : o || s || "auto" === t ? null : e.map(e => null != e ? e[t] : null),
+        T: (e, t) => {
             if (null == e) return;
             if ("number" == typeof e) {
                 const n = e + r;
                 if (n === l) return;
-                const o = w(t) * (n - l);
+                const o = x(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);
+            if (e === g && n === h.length) return;
+            g = e, h.length = n, v();
+            const o = x(t), s = w(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;
+                if (!o || !h[t]) {
+                    h[t] = o;
                     const e = o ? -1 : n + r;
-                    f[t] !== e && (v(t, e), i = !0);
+                    d[t] !== e && (S(t, e), i = !0);
                 }
             }
-            return i ? m(o) - s : void 0;
+            return i ? w(o) - s : void 0;
         }
     };
-}, U = (e, t, r, n, o, s) => {
-    const l = J(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) => {
+}, U = /*#__PURE__*/ new WeakMap, Z = (e, t, r) => {
     const n = [];
     for (const o of e) o >= t && o < r && n.push(o);
     return C(n);
-}, G = (e, t, r) => {
+}, F = (e, t, r) => {
     if (t >= r) return -1;
     let n = 0, o = e.length;
     for (;n < o; ) {
@@ -267,22 +263,22 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
         e[r] <= t ? n = r + 1 : o = r;
     }
     return n - 1;
-}, K = (e, t, r, n, o) => {
+}, G = (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;
-}, N = (e, t, r, n, o, s) => {
+}, K = (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);
+    const i = G(l, e, 0, n, r - 1);
     for (let e = n; e <= o; e++) l.push(e);
-    K(l, e, i, s, o);
+    G(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) => {
+}, N = (e, t) => I(e.rowIndex + (e.rowSpan || 1), t), Q = (e, t) => I(e.colIndex + (e.colSpan || 1), t), ee = (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; ) {
@@ -292,16 +288,16 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
         if (g === u) {
             d = u + 1;
             const t = r[a];
-            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)";
+            p = null == t ? e.v(u) + "px" : t ? o : "minmax(" + e.v(u) + "px,auto)", a++;
+        } else d = I(g, f < i ? n[f] : s), p = "minmax(" + (e.$(d - 1) + e.v(d - 1) - e.$(u)) + "px,auto)";
         c += " " + p + " [l" + d + "]", u = d;
     }
     return c;
-}, re = e => {
+}, te = e => {
     let t = "";
     for (const r in e) t += r.replace(/[A-Z]/g, e => "-" + e.toLowerCase()) + ":" + e[r] + ";";
     return t;
-}, ne = (e, t, r, n, o) => {
+}, re = (e, t, r, n, o) => {
     const s = {
         display: "grid",
         gridTemplateRows: "subgrid",
@@ -310,7 +306,7 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
         gridRow: "l" + e + "/l" + t
     };
     return null != r && (s.position = "sticky", s[n] = r + "px", s.zIndex = o), s;
-}, oe = e => {
+}, ne = e => {
     let t;
     return {
         U(r) {
@@ -323,97 +319,97 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
             t && t.disconnect();
         }
     };
-}, se = (e, t, r, n, o, s, l) => {
+}, oe = (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) => {
+    const p = Date.now, h = n ? "scrollLeft" : "scrollTop", $ = n ? "left" : "top", v = e => o ? -e : e, m = () => v(r[h]), w = (e, t) => {
         r.scrollTo({
-            [$]: m(e),
+            [$]: v(e),
             behavior: t ? "smooth" : "instant"
         });
     }, S = () => {
         if (a || f) return a = !1, void x();
-        g = !1, e.A(2);
+        g = !1, e.B(2);
     }, x = () => {
-        L(c), c = O(S, 150);
+        E(c), c = O(S, 150);
     }, z = () => {
-        u = p(), g && (d = !0), l && e.A(6, l()), e.A(1, v()), x();
+        u = p(), g && (d = !0), l && e.B(6, l()), e.B(1, m()), x();
     }, y = t => {
-        if (a || !e.W() || t.ctrlKey) return;
+        if (a || !e.H() || t.ctrlKey) return;
         const r = p() - u;
         150 > r && 50 < r && (n ? t.deltaX : t.deltaY) && (a = !0);
     }, _ = () => {
         f = !0, g = d = !1;
-    }, I = () => {
+    }, b = () => {
         f = !1, q() && (g = !0);
     };
     return t.addEventListener("scroll", z), t.addEventListener("wheel", y, {
         passive: !0
     }), t.addEventListener("touchstart", _, {
         passive: !0
-    }), t.addEventListener("touchend", I, {
+    }), t.addEventListener("touchend", b, {
         passive: !0
     }), {
         F: () => {
             t.removeEventListener("scroll", z), t.removeEventListener("wheel", y), t.removeEventListener("touchstart", _), 
-            t.removeEventListener("touchend", I), L(c);
+            t.removeEventListener("touchend", b), E(c);
         },
         G: () => {
-            const [t, n] = e.P();
+            const [t, n] = e.q();
             if (!t) return;
             d && s && s(), d = !1;
-            const o = e.L() + t;
-            o <= 0 || o >= e.H() + e.l() - e.u() ? w(o) : r.scrollBy({
-                [$]: m(t),
+            const o = e.W(), l = o + t, c = e.P() + e.l() - e.u();
+            l <= 0 || l >= c || o >= c ? w(l) : r.scrollBy({
+                [$]: v(t),
                 behavior: "instant"
-            }), n && (i && i(), e.u() > e.l() && e.A(1, v()));
+            }), n && (i && i(), e.u() > e.l() && e.B(1, m()));
         },
         K: (t, r) => {
             let n, o, s;
             i && i();
             const l = i = () => {
-                n = !0, L(o), s && s();
+                n = !0, E(o), s && s();
             }, c = () => {
                 if (!n) {
-                    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;
+                    if (e.u() && (E(o), o = O(l, 150)), r) {
+                        for (let [t, r] = e.p(0); t <= r; t++) if (e.O(t)) return;
                         l();
                     }
-                    e.A(7), w(t(), r);
+                    e.B(7), w(t(), r);
                 }
             }, u = () => {
                 if (n) return;
                 let t;
-                s = e.q(2, () => {
-                    t || (t = !0, W(() => {
+                s = e.A(2, () => {
+                    t || (t = !0, L(() => {
                         t = !1, c();
                     }));
                 }), c();
             };
-            r ? (e.A(8, t()), W(u)) : u();
+            r ? (e.B(8, t()), L(u)) : u();
         }
     };
-}, le = (e, t) => {
+}, se = (e, t) => {
     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();
+}, le = (e, t, r, {align: n, smooth: o, offset: s = 0} = {}) => {
+    if (r = M(r, 0, t.L() - 1), "nearest" === n) {
+        const e = t.$(r), o = t.W();
         if (e < o) n = "start"; else {
-            if (!(e + t.m(r) > o + t.u())) return;
+            if (!(e + t.v(r) > o + t.u())) return;
             n = "end";
         }
     }
-    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();
+    e.N(() => s + e.ee() + t.$(r) + ("end" === n ? t.v(r) - t.u() : "center" === n ? (t.v(r) - t.u()) / 2 : 0), o);
+}, ie = (e, t, r, n, o, s, l) => {
+    const i = t.L(), c = r.X(), u = r.Y();
     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);
+    const a = Z(n, c, u), f = F(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 - p(), l = t.m(o);
+        const e = d(), r = t.W() + e, n = t.u() - e - p(), l = t.v(o);
         let i = t.$(o);
         if (g === o) {
             const e = (f + 1 < a.length ? a[f + 1] : u) - 1;
-            i = k(i, b(r, t.$(e) + t.m(e) - l));
+            i = k(i, I(r, t.$(e) + t.v(e) - l));
         }
         if (i < r) s = "start"; else {
             if (!(i + l > r + n)) return;
@@ -421,12 +417,12 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
         }
     }
     e.N(l, () => {
-        const e = d(), r = t.m(o) - (t.u() - e - p());
+        const e = d(), r = t.v(o) - (t.u() - e - p());
         return t.$(o) - e + ("end" === s ? r : "center" === s ? r / 2 : 0);
     });
-}, ue = r => {
+}, ce = r => {
     let n;
-    r = v({
+    r = m({
         te: "div"
     }, r), h(() => {
         n && S(r.re(n, r.ne));
@@ -459,33 +455,33 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
             return r.ce;
         }
     });
-}, ae = (e, t) => e[0] === t[0] && e[1] === t[1], fe = r => {
+}, ue = (e, t) => e[0] === t[0] && e[1] === t[1], ae = r => {
     let n;
     const {itemSize: s, horizontal: l = !1, cache: i, ssrCount: c} = r;
-    r = v({
+    r = m({
         as: "div"
     }, r);
-    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, l = oe(n => {
+    const [u, a] = v(!!c), f = J(r.data.length, s, i), g = B(f, c), z = ((e, t) => {
+        let r, n, o = W();
+        const s = /* @__PURE__ */ new WeakMap, l = ne(n => {
             const o = [];
-            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) {
+            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) {
                 const e = s.get(l);
                 null != e && o.push([ e, t ? i : c ]);
             }
-            o.length && e.A(3, o);
+            o.length && e.B(3, o);
         });
         return {
             ue(s, i = s.parentElement) {
-                l.U(r = i), n = se(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
+                l.U(r = i), n = oe(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() {
-                l.F(), n && n.F(), o[1](!1), o = E();
+            R() {
+                l.F(), n && n.F(), o[1](!1), o = W();
             },
             ae: (e, t) => (s.set(e, t), l.U(e), () => {
                 s.delete(e), l.Z(e);
@@ -496,27 +492,27 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
             fe() {
                 n && n.G();
             },
-            ee: e.H
+            ee: e.P
         };
-    })(g, l), [_, I] = m(g.R());
-    g.q(1, () => {
-        I(g.R());
-    }), g.q(4, () => {
-        r.onScroll?.(g.L());
-    }), g.q(8, () => {
+    })(g, l), [_, b] = v(g.M());
+    g.A(1, () => {
+        b(g.M());
+    }), g.A(4, () => {
+        r.onScroll?.(g.W());
+    }), g.A(8, () => {
         r.onScrollEnd?.();
     });
-    const b = $(e => {
+    const I = $(e => {
         _();
         const t = g.p(r.bufferSize);
-        return e && ae(e, t) ? e : t;
-    }), k = $(() => _() && g.W()), T = $(() => _() && g.l()), R = r.ref;
+        return e && ue(e, t) ? e : t;
+    }), k = $(() => _() && g.H()), T = $(() => _() && g.l()), R = r.ref;
     !o && R && (R({
         get cache() {
-            return f.B();
+            return f.V();
         },
         get scrollOffset() {
-            return g.L();
+            return g.W();
         },
         get scrollSize() {
             return A(g);
@@ -524,36 +520,36 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
         get viewportSize() {
             return g.u();
         },
-        findItemIndex: g.M,
+        findItemIndex: g.C,
         getItemOffset: g.$,
-        getItemSize: g.m,
-        scrollToIndex: (e, t) => ie(z, g, e, t),
-        scrollTo: e => le(z, e),
+        getItemSize: g.v,
+        scrollToIndex: (e, t) => le(z, g, e, t),
+        scrollTo: e => se(z, e),
         scrollBy: e => ((e, t, r) => {
-            le(e, r + t.L());
+            se(e, r + t.W());
         })(z, g, e)
     }), S(() => R())), x(() => {
         a(!1), z.ue(n, r.scrollRef), S(() => {
-            g.T(), z.T();
+            g.R(), z.R();
         });
     }), p(w(() => r.startMargin || 0, e => {
-        e !== g.H() && g.A(6, e);
+        e !== g.P() && g.B(6, e);
     })), h(w(_, () => {
         z.fe();
     }));
     const M = $(() => {
         const e = r.data.length;
         y(() => {
-            e !== g.O() && g.A(5, [ e, r.shift ]);
+            e !== g.L() && g.B(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);
+            for (let [e, t] = I(); e <= t; e++) o.add(e);
             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);
+        } else for (let [e, o] = I(); e <= o; e++) t.push(r.data[e]), n.push(e);
         return {
             ge: t,
             de: n
@@ -583,8 +579,8 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
                     return M().ge;
                 },
                 children: (e, n) => ((e, n) => {
-                    const o = $(() => (_(), g.$(n()))), s = $(() => (_(), g.C(n()))), i = $(() => y(() => r.children(e, n)));
-                    return t(ue, {
+                    const o = $(() => (_(), g.$(n()))), s = $(() => (_(), g.O(n()))), i = $(() => y(() => r.children(e, n)));
+                    return t(ce, {
                         get te() {
                             return r.item;
                         },
@@ -612,9 +608,9 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
             });
         }
     });
-}, ge = /*#__PURE__*/ f("<div>"), de = e => {
+}, fe = /*#__PURE__*/ f("<div>"), ge = e => {
     const [r, o] = z(e, [ "ref", "data", "children", "bufferSize", "itemSize", "ssrCount", "shift", "horizontal", "keepMounted", "cache", "item", "onScroll", "onScrollEnd", "style" ]);
-    return s = ge(), u(s, l(o, {
+    return s = fe(), u(s, l(o, {
         get style() {
             return {
                 display: r.horizontal ? "inline-block" : "block",
@@ -625,7 +621,7 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
                 ...r.style
             };
         }
-    }), !1, !0), n(s, t(fe, {
+    }), !1, !0), n(s, t(ae, {
         ref(e) {
             var t = r.ref;
             "function" == typeof t ? t(e) : r.ref = e;
@@ -668,17 +664,17 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
         }
     })), s;
     var s;
-}, pe = /*#__PURE__*/ f('<div style="contain:size style;overflow-anchor:none;flex:none;position:relative">'), he = e => {
+}, de = /*#__PURE__*/ f('<div style="contain:size style;overflow-anchor:none;flex:none;position:relative">'), pe = e => {
     let s;
-    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 {ref: l, data: i, children: u, itemSize: a, ssrCount: f, shift: p, horizontal: m = !1, cache: z, onScrollEnd: _} = e, [b, I] = v(!!f), k = J(e.data.length, a, z), T = B(k, f), R = ((e, t) => {
+        let r, n, o, s, l, i = W();
+        const c = /* @__PURE__ */ new WeakMap, u = ne(n => {
             const o = [];
             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 : i ]);
             }
-            o.length && e.A(3, o);
+            o.length && e.B(3, o);
         });
         return {
             ue(c) {
@@ -686,14 +682,14 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
                     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"]);
+                    e.B(4, g[t ? "clientWidth" : "clientHeight"]);
                 };
                 f.addEventListener("resize", $), u.U(g), o = () => {
                     f.removeEventListener("resize", $);
-                }, n = se(e, f, g, t, d, null, h), i[1](!0);
+                }, n = oe(e, f, g, t, d, null, h), i[1](!0);
             },
-            T() {
-                o && o(), u.F(), n && n.F(), i[1](!1), i = E();
+            R() {
+                o && o(), u.F(), n && n.F(), i[1](!1), i = W();
             },
             ae: (e, t) => (c.set(e, t), u.U(e), () => {
                 c.delete(e), u.Z(e);
@@ -706,36 +702,36 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
             },
             ee: () => s()
         };
-    })(T, v), [M, C] = m(T.R());
-    T.q(1, () => {
-        C(T.R());
-    }), T.q(4, () => {
+    })(T, m), [M, C] = v(T.M());
+    T.A(1, () => {
+        C(T.M());
+    }), T.A(4, () => {
         e.onScroll?.();
-    }), T.q(8, () => {
+    }), T.A(8, () => {
         e.onScrollEnd?.();
     });
     const O = $(t => {
         M();
         const r = T.p(e.bufferSize);
-        return t && ae(t, r) ? t : r;
-    }), L = $(() => M() && T.W()), W = $(() => M() && T.l()), q = e.ref;
+        return t && ue(t, r) ? t : r;
+    }), E = $(() => M() && T.H()), L = $(() => M() && T.l()), q = e.ref;
     !o && q && (q({
         get cache() {
-            return k.B();
+            return k.V();
         },
         get scrollOffset() {
-            return T.L();
+            return T.W();
         },
         get viewportSize() {
             return T.u();
         },
-        findItemIndex: T.M,
+        findItemIndex: T.C,
         getItemOffset: T.$,
-        getItemSize: T.m,
-        scrollToIndex: (e, t) => ie(R, T, e, t)
+        getItemSize: T.v,
+        scrollToIndex: (e, t) => le(R, T, e, t)
     }), S(() => q())), x(() => {
-        b(!1), R.ue(s), S(() => {
-            T.T(), R.T();
+        I(!1), R.ue(s), S(() => {
+            T.R(), R.R();
         });
     }), h(w(M, () => {
         R.fe();
@@ -743,20 +739,20 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
     const A = $(() => {
         const t = e.data.length;
         y(() => {
-            t !== T.O() && T.A(5, [ t, e.shift ]);
+            t !== T.L() && T.B(5, [ t, e.shift ]);
         });
         const r = [];
         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, {
+    return V = de(), "function" == typeof s ? g(s, V) : s = V, n(V, t(d, {
         get each() {
             return A();
         },
         children: (r, n) => {
             const o = $(() => O()[0] + n()), s = $(() => (M(), T.$(o()))), l = $(() => (M(), 
-            T.C(o()))), i = $(() => y(() => e.children(r, o)));
-            return t(ue, {
+            T.O(o()))), i = $(() => y(() => e.children(r, o)));
+            return t(ce, {
                 get ne() {
                     return o();
                 },
@@ -772,27 +768,27 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
                 get ce() {
                     return i();
                 },
-                oe: v,
+                oe: m,
                 get le() {
-                    return I();
+                    return b();
                 }
             });
         }
     })), r(e => {
-        var t = v ? W() + "px" : "100%", r = v ? "100%" : W() + "px", n = L() ? "none" : void 0;
-        return t !== e.e && c(D, "width", e.e = t), r !== e.t && c(D, "height", e.t = r), 
-        n !== e.a && c(D, "pointer-events", e.a = n), e;
+        var t = m ? L() + "px" : "100%", r = m ? "100%" : L() + "px", n = E() ? "none" : void 0;
+        return t !== e.e && c(V, "width", e.e = t), r !== e.t && c(V, "height", e.t = r), 
+        n !== e.a && c(V, "pointer-events", e.a = n), e;
     }, {
         e: void 0,
         t: void 0,
         a: void 0
-    }), D;
-    var D;
-}, $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 => {
+    }), V;
+    var V;
+}, he = /*#__PURE__*/ f("<div>"), $e = /*#__PURE__*/ f("<div role=row>"), ve = /*#__PURE__*/ f("<div role=rowgroup>"), me = /*#__PURE__*/ f("<div role=table><div>"), we = e => {
     let t;
-    const [o, s] = m(void 0);
+    const [o, s] = v(void 0);
     p(() => s(e.pe));
-    const l = $(() => o().he), c = $(() => o().$e), u = $(() => e.me), f = $(() => e.ve), d = $(() => {
+    const l = $(() => o().he), c = $(() => o().$e), u = $(() => e.ve), f = $(() => e.me), d = $(() => {
         const t = u(), r = f();
         return y(() => e.ce(t, r, {
             rowIndex: e.we,
@@ -802,9 +798,9 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
     h(w([ l, c ], ([r, n]) => {
         !t || null == r && null == n || S(e.re(t, r, n));
     }));
-    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();
+    const m = $(() => te(o().xe));
+    return x = he(), "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().be, c = m();
         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;
@@ -817,24 +813,24 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
         n: void 0
     }), x;
     var x;
-}, xe = e => {
-    const o = $(() => e.pe), s = $(() => o().be.map(e => e.Se)), l = $(() => re(o().xe));
-    return c = me(), n(c, t(d, {
+}, Se = e => {
+    const o = $(() => e.pe), s = $(() => o().Ie.map(e => e.Se)), l = $(() => te(o().xe));
+    return c = $e(), n(c, t(d, {
         get each() {
             return s();
         },
-        children: (r, n) => t(Se, {
+        children: (r, n) => t(we, {
             get pe() {
-                return o().be[n()];
+                return o().Ie[n()];
             },
             get ce() {
                 return e.ce;
             },
-            get me() {
-                return e.me;
-            },
             get ve() {
-                return X(e.ke, r);
+                return e.ve;
+            },
+            get me() {
+                return Y(e.ke, r);
             },
             get we() {
                 return o().Te;
@@ -851,21 +847,21 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
         t: void 0
     }), c;
     var c;
-}, ze = e => {
-    const o = $(() => e.pe.Re.map(e => e.Te)), s = $(() => re(e.pe.xe));
+}, xe = e => {
+    const o = $(() => e.pe.Re.map(e => e.Te)), s = $(() => te(e.pe.xe));
     return l = ve(), n(l, t(d, {
         get each() {
             return o();
         },
-        children: (r, n) => t(xe, {
+        children: (r, n) => t(Se, {
             get pe() {
                 return e.pe.Re[n()];
             },
             get ce() {
                 return e.ce;
             },
-            get me() {
-                return X(e.Me, r);
+            get ve() {
+                return Y(e.Me, r);
             },
             get ke() {
                 return e.ke;
@@ -876,11 +872,11 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
         })
     })), r(e => a(l, s(), e)), l;
     var l;
-}, ye = e => {
+}, ze = e => {
     let s;
-    const i = v({
+    const i = m({
         gap: 0
-    }, 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) => {
+    }, 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" ]), E = D(c, y, T), L = D(f, _, T), H = $(() => E.D(e.rows, e.rowHeight)), P = $(() => L.D(e.cols, e.colWidth)), q = $(() => ((e = b) => {
         const t = /* @__PURE__ */ new Map;
         for (const r of e) {
             const e = r.rowIndex + (r.rowSpan || 1);
@@ -890,16 +886,16 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
             }
         }
         return t;
-    })(e.spans)), D = B(L), V = B(W), j = ((e, t) => {
-        let r, n, o, s = E();
-        const l = /* @__PURE__ */ new WeakMap, i = /* @__PURE__ */ new WeakMap, c = oe(n => {
+    })(e.spans)), V = B(E), j = B(L), J = ((e, t) => {
+        let r, n, o, s = W();
+        const l = /* @__PURE__ */ new WeakMap, i = /* @__PURE__ */ new WeakMap, c = ne(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) {
+            for (const {target: c, contentRect: {width: u, height: a}} of n) if (c === r) (u || a) && (e.B(4, a), 
+            t.B(4, u)); else if (c.offsetParent) {
                 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);
+            o.length && e.B(3, o), s.length && t.B(3, s);
         });
         return {
             async N(e, t) {
@@ -908,7 +904,7 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
             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 u = (e, t) => oe(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;
@@ -916,8 +912,8 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
                 });
                 n = u(e, !1), o = u(t, !0), s[1](!0);
             },
-            T() {
-                c.F(), n && n.F(), o && o.F(), s[1](!1), s = E();
+            R() {
+                c.F(), n && n.F(), o && o.F(), s[1](!1), s = W();
             },
             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);
@@ -926,35 +922,35 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
                 n && n.G(), o && o.G();
             }
         };
-    })(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());
+    })(V, j), G = () => V.M() + j.M(), [te, se] = v(G()), le = () => se(G());
+    V.A(1, le), j.A(1, le);
+    let ce = !1;
+    V.A(4, () => {
+        ce = !0, e.onVerticalScroll && e.onVerticalScroll(V.W());
+    }), j.A(4, () => {
+        ce = !0, e.onHorizontalScroll && e.onHorizontalScroll(j.W());
     });
     const ue = () => {
-        !ie || D.W() || V.W() || (ie = !1, e.onScrollEnd && e.onScrollEnd());
+        !ce || V.H() || j.H() || (ce = !1, e.onScrollEnd && e.onScrollEnd());
     };
-    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);
+    V.A(8, ue), j.A(8, ue), p(() => {
+        E.J(e.headerRows, e.footerRows), L.J(e.headerCols, e.footerCols);
+        const t = X(e.rows), r = X(e.cols);
+        t !== V.L() && V.B(5, [ t ]), r !== j.L() && j.B(5, [ r ]), V.B(9, H()), j.B(9, P());
     });
-    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);
+    const ae = $(() => te() && V.L()), fe = $(() => te() && j.L()), ge = $(() => (te(), 
+    ((e, t, [r, n], [o, s], l, i = b, c = b, u) => {
+        const a = e.S(), f = t.S(), g = e.X(), d = e.Y(), p = t.X(), h = t.Y();
+        r = M(r, g, d), n = I(n, d - 1), o = M(o, p, h), s = I(s, h - 1);
+        const $ = Z(i, g, d), v = k(p - 1, 0), m = [], w = [], S = [];
+        for (const e of c) e.rowIndex < a && e.colIndex < f && (S.push(e), m.push(e.rowIndex));
+        const x = S.length, z = F($, r, d), y = z < 0 ? -1 : $[z];
+        y >= 0 && m.push(y);
+        const _ = K(C(m), a, g, r, n, d);
+        for (let e = 0; e < _.length; e++) for (const t of l.get(_[e]) || b) {
+            const {rowIndex: l, colIndex: i} = t, c = N(t, a), u = Q(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);
+                let e = (l < g || k(l, r) < I(c, n + 1) || d < c || y >= l && y < c) && (i < p || k(i, o) < I(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;
@@ -963,57 +959,57 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
             }
         }
         for (const {rowIndex: e, colIndex: t} of S) {
-            const r = G($, e, d);
-            v.push(e), r >= 0 && v.push($[r]), w.push(t);
+            const r = F($, e, d);
+            m.push(e), r >= 0 && m.push($[r]), w.push(t);
         }
-        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 = [];
+        C(m), C(w);
+        const T = K(m, a, g, r, n, d), R = K(w, f, p, o, s, h), O = T.length, E = R.length, L = /* @__PURE__ */ new Map, W = [], H = [];
         for (const e of S) {
-            const t = Q(e, a), r = ee(e, f);
-            E.push(t), H.push(r);
+            const t = N(e, a), r = Q(e, f);
+            W.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);
+                for (let o = n; o < E && R[o] < r; o++) L.set(t + R[o], e);
             }
         }
         const P = [];
-        for (const e of R) P.push(!t.D(e) && null);
+        for (const e of R) P.push(!t.j(e) && null);
         const q = [], A = e.$(g), B = [];
-        let D = B;
-        const V = Z.get(e), j = /* @__PURE__ */ new Map;
+        let V = B;
+        const j = U.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];
+            const i = l < g, c = l >= d, m = F($, l, d), w = i ? 0 : c ? d : m < 0 ? -1 : $[m];
             if (l === w) {
-                const e = i ? g : c ? a : v + 1 < $.length ? $[v + 1] : d;
-                E.push(e);
+                const e = i ? g : c ? a : m + 1 < $.length ? $[m + 1] : d;
+                W.push(e);
                 const t = [];
                 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);
+                    xe: re(w, e, i || c ? 0 : null, c ? "bottom" : "top", 4)
+                }), V = t;
+            } else w < 0 && (V = B);
+            const S = m >= 0 && l === w, x = i || c || l === y || l >= r && l <= n, z = S ? A : null, _ = l * f, b = j && j.get(l), I = b && b.Ie, T = [];
+            let M = 0, C = !e.j(l) && null, O = l + 1, H = !1;
+            for (let e = 0; e < E; e++) {
+                const r = R[e], n = r < p, c = r >= h, g = n || c || r >= o && r <= s, d = L.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 || $;
+                    const o = d ? N(d, a) : l + 1, s = d ? Q(d, f) : r + 1, g = o - l, p = s - r, h = g > 1, $ = p > 1, m = 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].Se < r; ) M++;
-                        M < e && b[M].Se === r && (W = b[M]);
+                    const _ = i ? "columnheader" : r === v && (n || S) ? "rowheader" : "cell", b = m ? g : void 0, R = m ? p : void 0, E = "cell" !== _ && u && u.rowIndex === l && u.colIndex === r ? u.order : void 0;
+                    let L;
+                    if (I) {
+                        const e = I.length;
+                        for (;M < e && I[M].Se < r; ) M++;
+                        M < e && I[M].Se === r && (L = I[M]);
                     }
-                    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) {
+                    if (!L || L.ye !== b || L._e !== R || L.Oe !== z || L.Ee !== y || L.he !== w || L.$e !== x || L.ze !== _ || L.be !== E) {
                         let e = "1/l" + r;
-                        v && (e += "/l" + o + "/l" + s);
+                        m && (e += "/l" + o + "/l" + s);
                         const t = {
                             contain: "layout style",
                             display: "grid",
@@ -1021,39 +1017,39 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
                         };
                         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 = {
+                        t.position = "sticky", t.zIndex = 2), L = {
                             Se: r,
-                            ye: I,
+                            ye: b,
                             _e: R,
                             he: w,
                             $e: x,
                             ze: _,
-                            Ie: L,
+                            be: E,
                             xe: t,
                             Oe: z,
-                            Le: y
+                            Ee: y
                         }, H = !0;
                     }
-                    T.push(W);
+                    T.push(L);
                 }
             }
             if (q.push(C), T.length) {
-                const e = I && !H && I.be.length === T.length && I.We === z ? I : {
+                const e = b && !H && b.Ie.length === T.length && b.Le === z ? b : {
                     Te: l,
-                    be: T,
-                    xe: ne(l, O, z, "top", 3),
-                    We: z
+                    Ie: T,
+                    xe: re(l, O, z, "top", 3),
+                    Le: z
                 };
-                j.set(l, e), D.push(e);
+                J.set(l, e), V.push(e);
             }
         }
-        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),
+        return U.set(e, J), {
+            We: ee(e, T, q, C(W), "max-content", a),
+            He: ee(t, R, P, C(H), "minmax(max-content,auto)", f),
             Pe: B
         };
-    })(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);
+    })(E, L, V.p(e.bufferSize), j.p(e.bufferSize), q(), e.sectionRows, e.keepMounted, e.ariaSort))), de = $(() => ge().Pe.map(e => "Re" in e ? e.Ce : e.Te)), pe = $(() => te() && (V.H() || j.H())), he = $(() => {
+        const {We: e, He: t} = ge(), r = V.$(0), n = j.$(0);
         return {
             contain: "size style",
             "overflow-anchor": "none",
@@ -1064,58 +1060,58 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
             gap: i.gap + "px",
             "margin-top": r + "px",
             "margin-inline-start": n + "px",
-            height: A(D) - r + "px",
+            height: A(V) - r + "px",
             "pointer-events": pe() ? "none" : void 0
         };
     }), $e = e.ref;
     return !o && $e && ($e({
         get verticalScrollOffset() {
-            return D.L();
+            return V.W();
         },
         get horizontalScrollOffset() {
-            return V.L();
+            return j.W();
         },
         get scrollHeight() {
-            return A(D);
+            return A(V);
         },
         get scrollWidth() {
-            return A(V);
+            return A(j);
         },
         get viewportHeight() {
-            return D.u();
+            return V.u();
         },
         get viewportWidth() {
-            return V.u();
+            return j.u();
         },
-        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),
+        findRowIndex: V.C,
+        findColIndex: j.C,
+        getRowOffset: V.$,
+        getColOffset: j.$,
+        getRowSize: V.v,
+        getColSize: j.v,
+        scrollToIndex: t => ((e, t, r, n, o, s = b, {rowIndex: l, colIndex: i, rowAlign: c, colAlign: u}) => {
+            null != l && ie(e, t, n, s, l, c, !1), null != i && ie(e, r, o, b, i, u, !0);
+        })(J, V, j, E, L, e.sectionRows, t),
         scrollTo: ({vertical: e, horizontal: t}) => ((e, t, r) => {
             null != t && e.N(!1, () => t), null != r && e.N(!0, () => r);
-        })(j, e, t),
+        })(J, e, t),
         scrollBy: ({vertical: e, horizontal: t}) => ((e, t, r, n, o) => {
             if (null != n) {
-                const r = n + t.L();
+                const r = n + t.W();
                 e.N(!1, () => r);
             }
             if (null != o) {
-                const t = o + r.L();
+                const t = o + r.W();
                 e.N(!0, () => t);
             }
-        })(j, D, V, e, t)
+        })(J, V, j, e, t)
     }), S(() => $e())), x(() => {
-        j.ue(s), S(() => {
-            D.T(), V.T(), j.T();
+        J.ue(s), S(() => {
+            V.R(), j.R(), J.R();
         });
-    }), h(w(K, () => {
-        j.fe();
-    })), me = we(), ve = me.firstChild, u(me, l({
+    }), h(w(te, () => {
+        J.fe();
+    })), ve = me(), we = ve.firstChild, u(ve, l({
         get "aria-rowcount"() {
             return ae();
         },
@@ -1132,11 +1128,11 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
                 ...e.style
             };
         }
-    }), !1, !0), "function" == typeof s ? g(s, ve) : s = ve, n(ve, t(d, {
+    }), !1, !0), "function" == typeof s ? g(s, we) : s = we, n(we, t(d, {
         get each() {
             return de();
         },
-        children: (r, n) => r < 0 ? t(ze, {
+        children: (r, n) => r < 0 ? t(xe, {
             get pe() {
                 return ge().Pe[n()];
             },
@@ -1150,28 +1146,28 @@ _), A = e => k(e.l(), e.u()), B = ({p: e, h: t, $: r, m: n, v: o, S: s, l, _: i,
                 return e.cols;
             },
             get re() {
-                return j.ae;
+                return J.ae;
             }
-        }) : t(xe, {
+        }) : t(Se, {
             get pe() {
                 return ge().Pe[n()];
             },
             get ce() {
                 return e.children;
             },
-            get me() {
-                return X(e.rows, r);
+            get ve() {
+                return Y(e.rows, r);
             },
             get ke() {
                 return e.cols;
             },
             get re() {
-                return j.ae;
+                return J.ae;
             }
         })
-    })), r(e => a(ve, he(), e)), me;
-    var me, ve;
+    })), r(e => a(we, he(), e)), ve;
+    var ve, we;
 };
 
-export { ye as VGrid, de as VList, fe as Virtualizer, he as WindowVirtualizer };
+export { ze as VGrid, ge as VList, ae as Virtualizer, pe as WindowVirtualizer };
 //# sourceMappingURL=index.js.map