virtua 0.52.6 → 0.52.8

package/lib/vue/index.js

@@ -1,99 +1,92 @@
 import { computed as e, createVNode as t, defineComponent as o, isVNode as r, mergeProps as n, onMounted as s, onUnmounted as l, ref as i, watch as c, watchEffect as a } from "vue";
 
-var u, f = [], {min: d, max: p, abs: m, floor: g} = Math, _ = (e, t, o) => d(o, p(t, e)), $ = e => e.sort((e, t) => e - t), h = setTimeout, S = clearTimeout, w = "function" == typeof queueMicrotask ? queueMicrotask : e => {
+var u, f = [], {min: d, max: p, abs: m, floor: _} = Math, g = (e, t, o) => d(o, p(t, e)), $ = e => e.sort((e, t) => e - t), h = setTimeout, w = clearTimeout, y = "function" == typeof queueMicrotask ? queueMicrotask : e => {
     Promise.resolve().then(e);
-}, z = () => {
+}, S = () => {
     let e;
     return [ new Promise(t => {
         e = t;
     }), e ];
-}, y = e => e.ownerDocument, b = e => e.defaultView, x = () => (null == u && (u = /iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0), 
-u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S: i, v: c, I: a}, u = 0) => {
-    let f = !!a, g = !!u, _ = 1, $ = 0, h = 0, S = 0, w = 0, z = 0, y = 0, b = 0, v = 0, I = null, k = [ 0, g ? p(u - 1, 0) : -1 ], O = 0, T = !1;
-    const R = /* @__PURE__ */ new Set, A = () => S - h, M = () => A() + z + w, N = e => o(e) - z, C = e => {
-        e && (x() && 0 !== b || I && 1 === v ? z += e : w += e);
+}, b = e => e.ownerDocument, z = e => e.defaultView, x = () => (null == u && (u = /iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0), 
+u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, t: s, h: l, S: i, v: c, I: a, k: u}, f = 0) => {
+    let _ = !!f, g = 1, $ = 0, h = 0, w = 0, y = 0, S = 0, b = 0, z = 0, v = 0, I = null, k = [ 0, _ ? p(f - 1, 0) : -1 ], O = !1;
+    const T = /* @__PURE__ */ new Set, R = () => w - h, N = () => R() + S + y, E = e => o(e) - S, M = e => {
+        if (2 === v) return !0;
+        if (I && 1 === v) return e < I[0];
+        const t = R(), o = E(e), n = r(e);
+        return 1 !== z && 0 === v ? o + n <= t : o < t && o + n < t + $;
+    }, A = e => {
+        e && (x() && 0 !== z || I && 1 === v ? S += e : y += e);
     };
     return {
-        k: () => {
-            R.clear();
+        O: () => {
+            T.clear();
         },
-        O: () => _,
+        T: () => g,
         l: (t = 200) => {
-            if (!T || g) return k;
+            if (!O || _) return k;
             let o, r;
-            if (y) [o, r] = k; else {
-                let n = p(0, M()), s = n + $;
-                f || (t = p(0, t), 1 !== b && (n -= t), 2 !== b && (s += t)), [o, r] = k = e(p(0, n), p(0, s)), 
+            if (b) [o, r] = k; else {
+                let n = p(0, N()), s = n + $;
+                c() || (t = p(0, t), 1 !== z && (n -= t), 2 !== z && (s += t)), [o, r] = k = e(p(0, n), p(0, s)), 
                 I && (o = d(o, I[0]), r = p(r, I[1]));
             }
-            return [ p(o, 0), d(r, i() - 1) ];
+            return [ p(o, 0), d(r, l() - 1) ];
         },
-        T: e => t(e - h),
-        R: s,
-        u: N,
+        R: e => t(e - h),
+        N: n,
+        u: E,
         p: r,
-        A: i,
-        M: () => S,
-        N: () => 0 !== b,
+        M: l,
+        A: () => w,
+        C: () => 0 !== z,
         o: () => $,
-        C: () => h,
-        t: l,
-        j: () => (y = w, w = 0, [ y, 2 === v ]),
-        q: (e, t) => {
+        j: () => h,
+        t: s,
+        q: () => (b = y, y = 0, [ b, 2 === v ]),
+        P: (e, t) => {
             const o = [ e, t ];
-            return R.add(o), () => {
-                R.delete(o);
+            return T.add(o), () => {
+                T.delete(o);
             };
         },
-        P: (o, i) => {
-            let u, d, p = 0;
-            switch (o) {
+        B: (t, o) => {
+            let r, l, c = 0;
+            switch (t) {
               case 1:
                 {
-                    if (i === S && 0 === v) break;
-                    const e = y;
-                    y = 0;
-                    const t = i - S, o = m(t);
-                    e && o < m(e) + 1 || 0 !== v || (b = t < 0 ? 2 : 1), g && (g = !1), S = i, p = 4;
-                    const r = A();
-                    r >= -$ && r <= l() && (p += 1, d = o > $);
+                    if (o === w && 0 === v) break;
+                    const e = b;
+                    b = 0;
+                    const t = o - w, r = m(t);
+                    e && r < m(e) + 1 || 0 !== v || (z = t < 0 ? 2 : 1), _ && (_ = !1), w = o, c = 4;
+                    const n = R();
+                    n >= -$ && n <= s() && (c += 1, l = r > $);
                     break;
                 }
 
               case 2:
-                p = 8, 0 !== b && (u = !0, p += 1), b = 0, v = 0, I = null;
+                c = 8, 0 !== z && (r = !0, c += 1), z = 0, v = 0, I = null;
                 break;
 
               case 3:
                 {
-                    const e = i.filter(([e, t]) => !s(e, t));
+                    const e = o.filter(([e, t]) => !n(e, t));
                     if (!e.length) break;
-                    C(e.reduce((e, [t, o]) => {
-                        let n;
-                        if (2 === v) n = !0; else if (I && 1 === v) n = t < I[0]; else {
-                            const e = A(), o = N(t), s = r(t);
-                            n = 1 !== b && 0 === v ? o + s <= e : o < e && o + s < e + $;
-                        }
-                        return n && (e += o - r(t)), e;
-                    }, 0));
-                    for (const [t, o] of e) {
-                        const e = r(t), s = n(t, o);
-                        f && (O += s ? o : o - e);
-                    }
-                    f && $ && O > $ && (C(a(t(M()))), f = !1), p = 3, d = !0;
+                    A(a(e, M, N(), $)), c = 3, l = !0;
                     break;
                 }
 
               case 4:
-                $ !== i && ($ || (T = d = !0), $ = i, p = 3);
+                $ !== o && ($ || (O = l = !0), $ = o, c = 3);
                 break;
 
               case 5:
-                i[1] ? (C(c(i[0], !0)), v = 2, p = 1) : (c(i[0]), p = 1);
+                o[1] ? (A(i(o[0], !0)), v = 2, c = 1) : (i(o[0]), c = 1);
                 break;
 
               case 6:
-                h = i;
+                h = o;
                 break;
 
               case 7:
@@ -101,153 +94,166 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
                 break;
 
               case 9:
-                C(i), p = 3;
-                break;
+                {
+                    const e = u(o, N());
+                    null != e && (A(e), c = 3);
+                    break;
+                }
 
               case 8:
-                I = e(i, i + $), p = 1;
+                I = e(o, o + $), c = 1;
             }
-            p && (_ = 1 + (2147483647 & _), u && z && (w += z, z = 0), R.forEach(([e, t]) => {
-                p & e && t(d);
+            c && (g = 1 + (2147483647 & g), r && S && (y += S, S = 0), T.forEach(([e, t]) => {
+                c & e && t(l);
             }));
         }
     };
-}, k = (e, t, o, r = 0, n = t - 1) => {
+}, k = (e, t, o) => {
+    const r = o ? "unshift" : "push";
+    for (let o = 0; o < t; o++) e[r](-1);
+    return e;
+}, O = (e, t, o, r = 0, n = t - 1) => {
     let s = r;
     for (;r <= n; ) {
-        const t = g((r + n) / 2);
+        const t = _((r + n) / 2);
         e(t) <= o ? (s = t, r = t + 1) : n = t - 1;
     }
-    return _(s, 0, t - 1);
-}, O = (e, t, o) => {
-    const r = o ? "unshift" : "push";
-    for (let o = 0; o < t; o++) e[r](-1);
-    return e;
+    return g(s, 0, t - 1);
 }, T = (e, t, o) => {
-    let r = o && o[1] || t || 40, n = -1, s = 0;
-    const l = o && o[0], i = l ? O(l.slice(0, d(e, l.length)), p(0, e - l.length)) : O([], e), c = O([], e + 1), a = e => {
-        const t = i[e];
+    let r = o && o[1] || t || 40, n = -1, s = 0, l = !t, i = 0;
+    const c = o && o[0], a = c ? k(c.slice(0, d(e, c.length)), p(0, e - c.length)) : k([], e), u = k([], e + 1), f = e => {
+        const t = a[e];
         return -1 === t ? r : t;
-    }, u = t => {
+    }, m = t => {
         if (!e) return 0;
-        if (n >= t) return c[t];
-        n < 0 && (c[0] = 0, n = 0);
-        let o = n, r = c[o];
-        for (;o < t; ) r += a(o), c[++o] = r;
+        if (n >= t) return u[t];
+        n < 0 && (u[0] = 0, n = 0);
+        let o = n, r = u[o];
+        for (;o < t; ) r += f(o), u[++o] = r;
         return n = t, r;
     };
     return {
         l: (t, o) => {
             let r, n;
-            return s = d(s, e - 1), u(s) <= t ? (n = k(u, e, o, s), r = k(u, e, t, s, n)) : (r = k(u, e, t, void 0, s), 
-            n = k(u, e, o, r)), s = r, [ r, n ];
+            return i = d(i, e - 1), m(i) <= t ? (n = O(m, e, o, i), r = O(m, e, t, i, n)) : (r = O(m, e, t, void 0, i), 
+            n = O(m, e, o, r)), i = r, [ r, n ];
         },
-        i: t => k(u, e, t),
-        u,
-        p: a,
-        m: (e, t) => {
-            const o = -1 === i[e];
-            return i[e] = t, n = d(e, n), o;
+        i: t => O(m, e, t),
+        u: m,
+        p: f,
+        m: (e, t = -1) => a[e] === t,
+        I: (t, o, i, c) => {
+            let u = t.reduce((e, [t, r]) => o(t) ? e + (r - f(t)) : e, 0);
+            for (const [e, o] of t) s += -1 === a[e] ? o : o - f(e), a[e] = o, n = d(e, n);
+            if (l && c && s > c) {
+                let t = 0;
+                const o = O(m, e, i + u), s = [];
+                a.forEach((e, r) => {
+                    -1 !== e && (e && s.push(e), r < o && t++);
+                }), n = -1, $(s);
+                const c = s.length, f = c / 2 | 0, d = c % 2 == 0 ? (s[f - 1] + s[f]) / 2 : s[f], _ = r;
+                u += ((r = d) - _) * p(o - t, 0), l = !1;
+            }
+            return u;
         },
-        h: (e, t = -1) => i[e] === t,
-        t: () => u(e),
-        S: () => e,
-        v: (t, o) => {
+        t: () => m(e),
+        h: () => e,
+        S: (t, o) => {
             const s = t - e;
-            return n = o ? -1 : d(t - 1, n), e = t, s > 0 ? (O(c, s), O(i, s, o), r * s) : (c.splice(s), 
-            (o ? i.splice(0, -s) : i.splice(s)).reduce((e, t) => e - (-1 === t ? r : t), 0));
-        },
-        I: t ? void 0 : e => {
-            let t = 0;
-            const o = [];
-            i.forEach((r, n) => {
-                -1 !== r && (r && o.push(r), n < e && t++);
-            }), n = -1, $(o);
-            const s = o.length, l = s / 2 | 0, c = s % 2 == 0 ? (o[l - 1] + o[l]) / 2 : o[l], a = r;
-            return ((r = c) - a) * p(e - t, 0);
+            return n = o ? -1 : d(t - 1, n), e = t, s > 0 ? (k(u, s), k(a, s, o), r * s) : (u.splice(s), 
+            (o ? a.splice(0, -s) : a.splice(s)).reduce((e, t) => e - (-1 === t ? r : t), 0));
         },
-        B: () => [ i.slice(), r ]
-    };
-}, R = e => "number" == typeof e ? e : e.length, A = (e, t) => "number" == typeof e ? t : e[t], M = (e, t, o = 0) => {
-    let r = 0, n = 0;
-    const s = (e = 0, t = 0) => {
-        r = e, n = t;
-    }, l = e => d(r, e), i = e => p(e - n, l(e)), c = (e, t, r, n, s) => {
-        const c = t(l(r)), a = t(r) - t(i(r)), u = n + (c ? c - o : 0);
-        return e(u, p(u, s - (a ? a - o : 0)));
+        v: () => l,
+        H: () => [ a.slice(), r ]
     };
-    if ("number" == typeof t) {
-        let r = R(e), n = t;
-        const a = e => n + o ? _(g(e / (n + o)), 0, r - 1) : 0, u = e => e * (n + o), f = (e, t) => [ a(e), a(t) ];
-        return {
-            l: (e, t) => c(f, u, r, e, t),
-            i: a,
-            u,
-            p: () => n,
-            m: () => !1,
-            h: () => !1,
-            t: () => r ? r * (n + o) - o : 0,
-            S: () => r,
-            v: e => (r = e, 0),
-            L: () => !1,
-            H: s,
-            W: () => l(r),
-            V: () => i(r),
-            D: (e, t) => "number" == typeof t ? t : null,
-            F: (e, t) => {
-                if (null == e || e === n) return;
-                const o = a(t) * (e - n);
-                return n = e, o;
-            }
-        };
-    }
-    const a = "auto" === t;
-    let u = null;
-    const f = [], m = T(R(e), void 0, [ [], 40 + o ]), $ = e => a || !!f[e];
+}, R = e => "number" == typeof e ? e : e.length, N = (e, t) => "number" == typeof e ? t : e[t], E = (e, t, o = 0) => {
+    let r = R(e);
+    const n = "number" == typeof t, s = "auto" === t;
+    let l = (n ? t : 40) + o, i = -1, c = 0, a = s, u = 0, f = 0, m = null;
+    const h = [], w = [], y = [], S = e => s || !!y[e], b = () => {
+        h.length || k(h, r);
+    }, z = e => {
+        const t = h[e];
+        return -1 === t ? l : t;
+    }, x = e => {
+        if (!r) return 0;
+        if (!h.length) return e * l;
+        if (i >= e) return w[e];
+        i < 0 && (w[0] = 0, i = 0);
+        let t = i, o = w[t];
+        for (;t < e; ) o += z(t), w[++t] = o;
+        return i = e, o;
+    }, v = (e, t) => {
+        h[e] = t, i = d(e, i);
+    }, I = e => h.length ? O(x, r, e) : l ? g(_(e / l), 0, r - 1) : 0, T = () => d(u, r), N = () => p(r - f, T()), E = e => (h.length ? z(e) : l) - o;
     return {
-        l: (e, t) => c(m.l, m.u, m.S(), e, t),
-        i: m.i,
-        u: m.u,
-        p: e => m.p(e) - o,
-        m: (e, t) => $(e) && m.m(e, t + o),
-        h: (e, t) => m.h(e, t + o),
-        t: () => m.S() ? m.t() - o : 0,
-        S: m.S,
-        v: m.v,
-        I: a ? m.I : void 0,
-        L: $,
-        H: s,
-        W: () => l(m.S()),
-        V: () => i(m.S()),
-        D: (e, t) => a || "string" != typeof t || "auto" === t ? null : e.map(e => null != e ? e[t] : null),
-        F: (e, t) => {
-            if (!e) return;
-            const r = m.S();
-            if (e === u && r === f.length) return;
-            u = e, f.length = r;
-            const n = m.i(t), s = m.u(n);
-            let l;
+        l: (e, t) => {
+            const n = x(T()), s = x(r) - x(N()), l = e + (n ? n - o : 0);
+            return [ I(l), I(p(l, t - (s ? s - o : 0))) ];
+        },
+        i: I,
+        u: x,
+        p: E,
+        I: (e, t, r, n) => {
+            let s = e.reduce((e, [o, r]) => S(o) && t(o) ? e + (r - E(o)) : e, 0);
+            for (const [t, r] of e) S(t) && (b(), c += -1 === h[t] ? r : r - E(t), v(t, r + o));
+            if (a && n && c > n) {
+                let e = 0;
+                const t = I(r + s), o = [];
+                h.forEach((r, n) => {
+                    -1 !== r && (r && o.push(r), n < t && e++);
+                }), i = -1, $(o);
+                const n = o.length, c = n / 2 | 0, u = n % 2 == 0 ? (o[c - 1] + o[c]) / 2 : o[c], f = l;
+                s += ((l = u) - f) * p(t - e, 0), a = !1;
+            }
+            return s;
+        },
+        m: (e, t = -1) => {
+            const r = h.length ? h[e] : -1;
+            return -1 === t ? S(e) && -1 === r : r === t + o;
+        },
+        t: () => r ? x(r) - o : 0,
+        h: () => r,
+        S: e => {
+            const t = e - r;
+            return i = d(e - 1, i), r = e, h.length && (t > 0 ? k(h, t) : h.splice(t)), 0;
+        },
+        v: () => a,
+        L: S,
+        W: (e = 0, t = 0) => {
+            u = e, f = t;
+        },
+        V: T,
+        F: N,
+        X: (e, t) => "number" == typeof t ? n ? t : null : n || s || "auto" === t ? null : e.map(e => null != e ? e[t] : null),
+        k: (e, t) => {
+            if (null == e) return;
+            if ("number" == typeof e) {
+                const r = e + o;
+                if (r === l) return;
+                const n = I(t) * (r - l);
+                return l = r, n;
+            }
+            if (e === m && r === y.length) return;
+            m = e, y.length = r, b();
+            const n = I(t), s = x(n);
+            let i;
             for (let t = 0; t < r; t++) {
                 const r = e[t], n = "number" != typeof r;
-                if (!n || !f[t]) {
-                    f[t] = n;
+                if (!n || !y[t]) {
+                    y[t] = n;
                     const e = n ? -1 : r + o;
-                    m.h(t, e) || (m.m(t, e), l = !0);
+                    h[t] !== e && (v(t, e), i = !0);
                 }
             }
-            return l ? m.u(n) - s : void 0;
+            return i ? x(n) - s : void 0;
         }
     };
-}, N = (e, t, o, r, n, s) => {
-    const l = R(o);
-    t.H(n, s), l !== e.A() && e.P(5, [ l ]);
-    const i = t.F(r, e.M() - e.u(0));
-    null != i && e.P(9, i);
-}, C = /*#__PURE__*/ new WeakMap, E = (e, t, o) => {
+}, M = /*#__PURE__*/ new WeakMap, A = (e, t, o) => {
     const r = [];
     for (const n of e) n >= t && n < o && r.push(n);
     return $(r);
-}, j = (e, t, o) => {
+}, C = (e, t, o) => {
     if (t >= o) return -1;
     let r = 0, n = e.length;
     for (;r < n; ) {
@@ -255,37 +261,37 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
         e[o] <= t ? r = o + 1 : n = o;
     }
     return r - 1;
-}, q = (e, t, o, r, n) => {
+}, j = (e, t, o, r, n) => {
     const s = t.length;
     for (;o < s && t[o] < r; o++) {
         const r = t[o];
         r > n && (e.push(r), n = r);
     }
     return o;
-}, P = (e, t, o, r, n, s) => {
+}, q = (e, t, o, r, n, s) => {
     const l = [];
     for (let e = 0; e < o; e++) l.push(e);
-    const i = q(l, e, 0, r, o - 1);
+    const i = j(l, e, 0, r, o - 1);
     for (let e = r; e <= n; e++) l.push(e);
-    q(l, e, i, s, n);
+    j(l, e, i, s, n);
     for (let e = s; e < t; e++) l.push(e);
     return l;
-}, B = (e, t) => d(e.rowIndex + (e.rowSpan || 1), t), L = (e, t) => d(e.colIndex + (e.colSpan || 1), t), H = (e, t, o, r, n, s) => {
+}, P = (e, t) => d(e.rowIndex + (e.rowSpan || 1), t), B = (e, t) => d(e.colIndex + (e.colSpan || 1), t), H = (e, t, o, r, n, s) => {
     const l = t.length, i = r.length;
     let c = "[l0]", a = 0, u = 0, f = 0;
     for (;a < s; ) {
         for (;f < i && r[f] <= a; ) f++;
         const p = u < l ? t[u] : s;
-        let m, g;
+        let m, _;
         if (p === a) {
             m = a + 1;
             const t = o[u];
-            g = null == t ? e.p(a) + "px" : t ? n : "minmax(" + e.p(a) + "px,auto)", u++;
-        } else m = d(p, f < i ? r[f] : s), g = "minmax(" + (e.u(m - 1) + e.p(m - 1) - e.u(a)) + "px,auto)";
-        c += " " + g + " [l" + m + "]", a = m;
+            _ = null == t ? e.p(a) + "px" : t ? n : "minmax(" + e.p(a) + "px,auto)", u++;
+        } else m = d(p, f < i ? r[f] : s), _ = "minmax(" + (e.u(m - 1) + e.p(m - 1) - e.u(a)) + "px,auto)";
+        c += " " + _ + " [l" + m + "]", a = m;
     }
     return c;
-}, W = (e, t, o, r, n) => {
+}, L = (e, t, o, r, n) => {
     const s = {
         display: "grid",
         gridTemplateRows: "subgrid",
@@ -294,35 +300,35 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
         gridRow: "l" + e + "/l" + t
     };
     return null != o && (s.position = "sticky", s[r] = o + "px", s.zIndex = n), s;
-}, V = e => {
+}, W = e => {
     let t;
     return {
-        X(o) {
-            (t || (t = new (b(y(o)).ResizeObserver)(e))).observe(o);
+        Y(o) {
+            (t || (t = new (z(b(o)).ResizeObserver)(e))).observe(o);
         },
-        Y(e) {
+        J(e) {
             t.unobserve(e);
         },
-        J() {
+        D() {
             t && t.disconnect();
         }
     };
-}, D = (e, t, o, r, n, s, l) => {
+}, V = (e, t, o, r, n, s, l) => {
     let i, c, a = 0, u = !1, f = !1, d = !1, p = !1;
-    const m = Date.now, g = r ? "scrollLeft" : "scrollTop", _ = r ? "left" : "top", $ = e => n ? -e : e, z = () => $(o[g]), y = (e, t) => {
+    const m = Date.now, _ = r ? "scrollLeft" : "scrollTop", g = r ? "left" : "top", $ = e => n ? -e : e, S = () => $(o[_]), b = (e, t) => {
         o.scrollTo({
-            [_]: $(e),
+            [g]: $(e),
             behavior: t ? "smooth" : "instant"
         });
-    }, b = () => {
+    }, z = () => {
         if (u || f) return u = !1, void v();
-        d = !1, e.P(2);
+        d = !1, e.B(2);
     }, v = () => {
-        S(c), c = h(b, 150);
+        w(c), c = h(z, 150);
     }, I = () => {
-        a = m(), d && (p = !0), l && e.P(6, l()), e.P(1, z()), v();
+        a = m(), d && (p = !0), l && e.B(6, l()), e.B(1, S()), v();
     }, k = t => {
-        if (u || !e.N() || t.ctrlKey) return;
+        if (u || !e.C() || t.ctrlKey) return;
         const o = m() - a;
         150 > o && 50 < o && (r ? t.deltaX : t.deltaY) && (u = !0);
     }, O = () => {
@@ -337,50 +343,50 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
     }), t.addEventListener("touchend", T, {
         passive: !0
     }), {
-        J: () => {
+        D: () => {
             t.removeEventListener("scroll", I), t.removeEventListener("wheel", k), t.removeEventListener("touchstart", O), 
-            t.removeEventListener("touchend", T), S(c);
+            t.removeEventListener("touchend", T), w(c);
         },
         U: () => {
-            const [t, r] = e.j();
+            const [t, r] = e.q();
             if (!t) return;
             p && s && s(), p = !1;
-            const n = e.M() + t;
-            n <= 0 || n >= e.C() + e.t() - e.o() ? y(n) : o.scrollBy({
-                [_]: $(t),
+            const n = e.A(), l = n + t, c = e.j() + e.t() - e.o();
+            l <= 0 || l >= c || n >= c ? b(l) : o.scrollBy({
+                [g]: $(t),
                 behavior: "instant"
-            }), r && (i && i(), e.o() > e.t() && e.P(1, z()));
+            }), r && (i && i(), e.o() > e.t() && e.B(1, S()));
         },
         G: (t, o) => {
             let r, n, s;
             i && i();
             const l = i = () => {
-                r = !0, S(n), s && s();
+                r = !0, w(n), s && s();
             }, c = () => {
                 if (!r) {
-                    if (e.o() && (S(n), n = h(l, 150)), o) {
-                        for (let [t, o] = e.l(0); t <= o; t++) if (e.R(t)) return;
+                    if (e.o() && (w(n), n = h(l, 150)), o) {
+                        for (let [t, o] = e.l(0); t <= o; t++) if (e.N(t)) return;
                         l();
                     }
-                    e.P(7), y(t(), o);
+                    e.B(7), b(t(), o);
                 }
             }, a = () => {
                 if (r) return;
                 let t;
-                s = e.q(2, () => {
-                    t || (t = !0, w(() => {
+                s = e.P(2, () => {
+                    t || (t = !0, y(() => {
                         t = !1, c();
                     }));
                 }), c();
             };
-            o ? (e.P(8, t()), w(a)) : a();
+            o ? (e.B(8, t()), y(a)) : a();
         }
     };
 }, F = (e, t) => {
     e.K(() => t);
 }, X = (e, t, o, {align: r, smooth: n, offset: s = 0} = {}) => {
-    if (o = _(o, 0, t.A() - 1), "nearest" === r) {
-        const e = t.u(o), n = t.M();
+    if (o = g(o, 0, t.M() - 1), "nearest" === r) {
+        const e = t.u(o), n = t.A();
         if (e < n) r = "start"; else {
             if (!(e + t.p(o) > n + t.o())) return;
             r = "end";
@@ -388,12 +394,12 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
     }
     e.K(() => s + e.Z() + t.u(o) + ("end" === r ? t.p(o) - t.o() : "center" === r ? (t.p(o) - t.o()) / 2 : 0), n);
 }, Y = (e, t, o, r, n, s, l) => {
-    const i = t.A(), c = o.W(), a = o.V();
-    n = _(n, 0, i - 1);
-    const u = E(r, c, a), f = j(u, n, a), m = f < 0 ? -1 : u[f], g = () => o.u(c) + (m < 0 || m === n ? 0 : o.u(m + 1) - o.u(m)), $ = () => o.u(i) - o.u(a);
+    const i = t.M(), c = o.V(), a = o.F();
+    n = g(n, 0, i - 1);
+    const u = A(r, c, a), f = C(u, n, a), m = f < 0 ? -1 : u[f], _ = () => o.u(c) + (m < 0 || m === n ? 0 : o.u(m + 1) - o.u(m)), $ = () => o.u(i) - o.u(a);
     if ("nearest" === s) {
         if (n < c || n >= a) return;
-        const e = g(), o = t.M() + e, r = t.o() - e - $(), l = t.p(n);
+        const e = _(), o = t.A() + e, r = t.o() - e - $(), l = t.p(n);
         let i = t.u(n);
         if (m === n) {
             const e = (f + 1 < u.length ? u[f + 1] : a) - 1;
@@ -405,11 +411,11 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
         }
     }
     e.K(l, () => {
-        const e = g(), o = t.p(n) - (t.o() - e - $());
+        const e = _(), o = t.p(n) - (t.o() - e - $());
         return t.u(n) - e + ("end" === s ? o : "center" === s ? o / 2 : 0);
     });
 }, J = /* @__PURE__ */ o(o => {
-    const r = i(), s = e(() => o.ee.value && o.te.u(o.oe)), l = e(() => o.ee.value && o.te.R(o.oe)), a = e(() => o.re({
+    const r = i(), s = e(() => o.ee.value && o.te.u(o.oe)), l = e(() => o.ee.value && o.te.N(o.oe)), a = e(() => o.re({
         item: o.ne,
         index: o.oe
     }));
@@ -421,7 +427,7 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
         const {le: e, ie: i, ce: c, oe: u, ne: f} = o, d = l.value, {style: p, ...m} = o.ae?.({
             item: f,
             index: u
-        }) || {}, g = {
+        }) || {}, _ = {
             contain: "layout style",
             position: d && i ? void 0 : "absolute",
             [e ? "height" : "width"]: "100%",
@@ -430,9 +436,9 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
             visibility: !d || i ? void 0 : "hidden",
             ...p
         };
-        return e && (g.display = "inline-flex"), t(c, n({
+        return e && (_.display = "inline-flex"), t(c, n({
             ref: r,
-            style: g
+            style: _
         }, m), {
             default: () => [ a.value ]
         }, 16, [ "style" ]);
@@ -450,13 +456,13 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
         ce: null,
         ae: null
     }
-}), U = (e, t) => {
+}), D = (e, t) => {
     if (1 === e.length) {
         const t = e[0].key;
         if (null != t) return t;
     }
     return "_" + t;
-}, G = (e, t) => e[0] === t[0] && e[1] === t[1], K = /* @__PURE__ */ o({
+}, U = (e, t) => e[0] === t[0] && e[1] === t[1], G = /* @__PURE__ */ o({
     props: {
         data: {
             type: Array,
@@ -487,30 +493,30 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
     emits: [ "scroll", "scrollEnd" ],
     setup(o, {emit: n, expose: a, slots: u}) {
         let f = !!o.ssrCount;
-        const d = o.horizontal, p = i(), m = T(o.data.length, o.itemSize, o.cache), g = I(m, o.ssrCount), _ = ((e, t) => {
-            let o, r, n = z();
-            const s = /* @__PURE__ */ new WeakMap, l = V(r => {
+        const d = o.horizontal, p = i(), m = T(o.data.length, o.itemSize, o.cache), _ = I(m, o.ssrCount), g = ((e, t) => {
+            let o, r, n = S();
+            const s = /* @__PURE__ */ new WeakMap, l = W(r => {
                 const n = [];
-                for (const {target: l, contentRect: {width: i, height: c}} of r) if (l === o) (i || c) && e.P(4, t ? i : c); else if (l.offsetParent) {
+                for (const {target: l, contentRect: {width: i, height: c}} of r) if (l === o) (i || c) && e.B(4, t ? i : c); else if (l.offsetParent) {
                     const e = s.get(l);
                     null != e && n.push([ e, t ? i : c ]);
                 }
-                n.length && e.P(3, n);
+                n.length && e.B(3, n);
             });
             return {
                 ue(s, i = s.parentElement) {
-                    l.X(o = i), r = D(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
+                    l.Y(o = i), r = V(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
                         const e = t ? "overflowX" : "overflowY", o = i.style, r = o[e];
                         o[e] = "hidden", h(() => {
                             o[e] = r;
                         });
                     }), n[1](!0);
                 },
-                k() {
-                    l.J(), r && r.J(), n[1](!1), n = z();
+                O() {
+                    l.D(), r && r.D(), n[1](!1), n = S();
                 },
-                fe: (e, t) => (s.set(e, t), l.X(e), () => {
-                    s.delete(e), l.Y(e);
+                fe: (e, t) => (s.set(e, t), l.Y(e), () => {
+                    s.delete(e), l.J(e);
                 }),
                 async K(e, t) {
                     await n[0] && r.G(e, t);
@@ -518,73 +524,73 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
                 de() {
                     r && r.U();
                 },
-                Z: e.C
+                Z: e.j
             };
-        })(g, d), S = i(g.O());
-        g.q(1, () => {
-            S.value = g.O();
-        }), g.q(4, () => {
-            n("scroll", g.M());
-        }), g.q(8, () => {
+        })(_, d), w = i(_.T());
+        _.P(1, () => {
+            w.value = _.T();
+        }), _.P(4, () => {
+            n("scroll", _.A());
+        }), _.P(8, () => {
             n("scrollEnd");
         });
-        const w = e(e => {
-            S.value;
-            const t = g.l(o.bufferSize);
-            return e && G(e, t) ? e : t;
-        }), y = e(() => S.value && g.N()), b = e(() => S.value && g.t());
+        const y = e(e => {
+            w.value;
+            const t = _.l(o.bufferSize);
+            return e && U(e, t) ? e : t;
+        }), b = e(() => w.value && _.C()), z = e(() => w.value && _.t());
         return s(() => {
             f = !1;
             const e = p.value, t = requestAnimationFrame(() => {
-                _.ue(e, o.scrollRef);
+                g.ue(e, o.scrollRef);
             });
             l(() => {
                 cancelAnimationFrame(t);
             });
         }), l(() => {
-            g.k(), _.k();
+            _.O(), g.O();
         }), c(() => o.data.length, e => {
-            g.P(5, [ e, o.shift ]);
+            _.B(5, [ e, o.shift ]);
         }), c(() => o.startMargin, e => {
-            g.P(6, e);
+            _.B(6, e);
         }, {
             immediate: !0
-        }), c([ S ], () => {
-            _.de();
+        }), c([ w ], () => {
+            g.de();
         }, {
             flush: "post"
         }), a({
             get cache() {
-                return m.B();
+                return m.H();
             },
             get scrollOffset() {
-                return g.M();
+                return _.A();
             },
             get scrollSize() {
-                return v(g);
+                return v(_);
             },
             get viewportSize() {
-                return g.o();
+                return _.o();
             },
-            findItemIndex: g.T,
-            getItemOffset: g.u,
-            getItemSize: g.p,
-            scrollToIndex: (e, t) => X(_, g, e, t),
-            scrollTo: e => F(_, e),
+            findItemIndex: _.R,
+            getItemOffset: _.u,
+            getItemSize: _.p,
+            scrollToIndex: (e, t) => X(g, _, e, t),
+            scrollTo: e => F(g, e),
             scrollBy: e => ((e, t, o) => {
-                F(e, o + t.M());
-            })(_, g, e)
+                F(e, o + t.A());
+            })(g, _, e)
         }), () => {
-            const e = o.as, n = o.item, s = b.value, l = [], i = e => {
+            const e = o.as, n = o.item, s = z.value, l = [], i = e => {
                 const r = u.default({
                     item: o.data[e],
                     index: e
                 });
                 return t(J, {
-                    key: U(r, e),
-                    ee: S,
-                    te: g,
-                    se: _.fe,
+                    key: D(r, e),
+                    ee: w,
+                    te: _,
+                    se: g.fe,
                     oe: e,
                     re: u.default,
                     ne: o.data[e],
@@ -596,11 +602,11 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
             };
             if (o.keepMounted) {
                 const e = o.data.length, t = new Set(o.keepMounted);
-                for (let [e, o] = w.value; e <= o; e++) t.add(e);
+                for (let [e, o] = y.value; e <= o; e++) t.add(e);
                 $([ ...t ]).forEach(t => {
                     t < e && l.push(i(t));
                 });
-            } else for (let [e, t] = w.value; e <= t; e++) l.push(i(e));
+            } else for (let [e, t] = y.value; e <= t; e++) l.push(i(e));
             return t(e, {
                 ref: p,
                 style: {
@@ -610,7 +616,7 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
                     position: "relative",
                     width: d ? s + "px" : "100%",
                     height: d ? "100%" : s + "px",
-                    pointerEvents: y.value ? "none" : void 0
+                    pointerEvents: b.value ? "none" : void 0
                 }
             }, "function" == typeof (c = l) || "[object Object]" === Object.prototype.toString.call(c) && !r(c) ? l : {
                 default: () => [ l ],
@@ -619,7 +625,7 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
             var c;
         };
     }
-}), Q = /* @__PURE__ */ o({
+}), K = /* @__PURE__ */ o({
     props: {
         data: {
             type: Array,
@@ -669,7 +675,7 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
                     width: "100%",
                     height: "100%"
                 }
-            }, [ t(K, {
+            }, [ t(G, {
                 ref: u,
                 data: e.data,
                 bufferSize: e.bufferSize,
@@ -689,7 +695,7 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
             var o;
         };
     }
-}), Z = /* @__PURE__ */ o({
+}), Q = /* @__PURE__ */ o({
     props: {
         data: {
             type: Array,
@@ -713,33 +719,33 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
     emits: [ "scroll", "scrollEnd" ],
     setup(o, {emit: n, slots: a, expose: u}) {
         let f = !!o.ssrCount;
-        const d = o.horizontal, p = i(), m = T(o.data.length, o.itemSize, o.cache), g = I(m, o.ssrCount), _ = ((e, t) => {
-            let o, r, n, s, l, i = z();
-            const c = /* @__PURE__ */ new WeakMap, a = V(r => {
+        const d = o.horizontal, p = i(), m = T(o.data.length, o.itemSize, o.cache), _ = I(m, o.ssrCount), g = ((e, t) => {
+            let o, r, n, s, l, i = S();
+            const c = /* @__PURE__ */ new WeakMap, a = W(r => {
                 const n = [];
                 for (const {target: e, contentRect: {width: s, height: i}} of r) if (e === o) l && l(); else if (e.offsetParent) {
                     const o = c.get(e);
                     null != o && n.push([ o, t ? s : i ]);
                 }
-                n.length && e.P(3, n);
+                n.length && e.B(3, n);
             });
             return {
                 ue(c) {
-                    const u = y(c), f = b(u), d = o = u.scrollingElement, p = t && "rtl" === getComputedStyle(d).direction, m = (e, t, o, r, n = 0) => {
+                    const u = b(c), f = z(u), d = o = u.scrollingElement, p = t && "rtl" === getComputedStyle(d).direction, m = (e, t, o, r, n = 0) => {
                         const s = r ? "offsetLeft" : "offsetTop", l = n + (p ? t.clientWidth - e[s] - e.offsetWidth : e[s]), i = e.offsetParent;
                         return e !== o && i ? m(i, t, o, r, l) : l;
-                    }, g = s = () => m(c, d, u.body, t), _ = l = () => {
-                        e.P(4, d[t ? "clientWidth" : "clientHeight"]);
+                    }, _ = s = () => m(c, d, u.body, t), g = l = () => {
+                        e.B(4, d[t ? "clientWidth" : "clientHeight"]);
                     };
-                    f.addEventListener("resize", _), a.X(d), n = () => {
-                        f.removeEventListener("resize", _);
-                    }, r = D(e, f, d, t, p, null, g), i[1](!0);
+                    f.addEventListener("resize", g), a.Y(d), n = () => {
+                        f.removeEventListener("resize", g);
+                    }, r = V(e, f, d, t, p, null, _), i[1](!0);
                 },
-                k() {
-                    n && n(), a.J(), r && r.J(), i[1](!1), i = z();
+                O() {
+                    n && n(), a.D(), r && r.D(), i[1](!1), i = S();
                 },
-                fe: (e, t) => (c.set(e, t), a.X(e), () => {
-                    c.delete(e), a.Y(e);
+                fe: (e, t) => (c.set(e, t), a.Y(e), () => {
+                    c.delete(e), a.J(e);
                 }),
                 async K(e, t) {
                     await i[0] && r.G(e, t);
@@ -749,57 +755,57 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
                 },
                 Z: () => s()
             };
-        })(g, d), $ = i(g.O());
-        g.q(1, () => {
-            $.value = g.O();
-        }), g.q(4, () => {
+        })(_, d), $ = i(_.T());
+        _.P(1, () => {
+            $.value = _.T();
+        }), _.P(4, () => {
             n("scroll");
-        }), g.q(8, () => {
+        }), _.P(8, () => {
             n("scrollEnd");
         });
         const h = e(e => {
             $.value;
-            const t = g.l(o.bufferSize);
-            return e && G(e, t) ? e : t;
-        }), S = e(() => $.value && g.N()), w = e(() => $.value && g.t());
+            const t = _.l(o.bufferSize);
+            return e && U(e, t) ? e : t;
+        }), w = e(() => $.value && _.C()), y = e(() => $.value && _.t());
         return s(() => {
             f = !1;
             const e = p.value;
-            e && _.ue(e);
+            e && g.ue(e);
         }), l(() => {
-            g.k(), _.k();
+            _.O(), g.O();
         }), c(() => o.data.length, e => {
-            g.P(5, [ e, o.shift ]);
+            _.B(5, [ e, o.shift ]);
         }), c([ $ ], () => {
-            _.de();
+            g.de();
         }, {
             flush: "post"
         }), u({
             get cache() {
-                return m.B();
+                return m.H();
             },
             get scrollOffset() {
-                return g.M();
+                return _.A();
             },
             get viewportSize() {
-                return g.o();
+                return _.o();
             },
-            findItemIndex: g.T,
-            getItemOffset: g.u,
-            getItemSize: g.p,
-            scrollToIndex: (e, t) => X(_, g, e, t)
+            findItemIndex: _.R,
+            getItemOffset: _.u,
+            getItemSize: _.p,
+            scrollToIndex: (e, t) => X(g, _, e, t)
         }), () => {
-            const e = o.as, n = o.item, s = w.value, l = [];
+            const e = o.as, n = o.item, s = y.value, l = [];
             for (let [e, r] = h.value; e <= r; e++) {
                 const r = a.default({
                     item: o.data[e],
                     index: e
                 });
                 l.push(t(J, {
-                    key: U(r, e),
+                    key: D(r, e),
                     ee: $,
-                    te: g,
-                    se: _.fe,
+                    te: _,
+                    se: g.fe,
                     oe: e,
                     re: a.default,
                     ne: o.data[e],
@@ -817,7 +823,7 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
                     position: "relative",
                     width: d ? s + "px" : "100%",
                     height: d ? "100%" : s + "px",
-                    pointerEvents: S.value ? "none" : void 0
+                    pointerEvents: w.value ? "none" : void 0
                 }
             }, "function" == typeof (i = l) || "[object Object]" === Object.prototype.toString.call(i) && !r(i) ? l : {
                 default: () => [ l ],
@@ -826,14 +832,14 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
             var i;
         };
     }
-}), ee = /* @__PURE__ */ o(e => {
+}), Z = /* @__PURE__ */ o(e => {
     const o = i();
-    return c([ o, () => e.me.pe, () => e.me.ge ], ([t, o, r], n, s) => {
+    return c([ o, () => e.me.pe, () => e.me._e ], ([t, o, r], n, s) => {
         !t || null == o && null == r || s(e.se(t, o, r));
     }, {
         flush: "post"
     }), () => {
-        const {_e: r, $e: n, he: s, Se: l, we: i, ze: c} = e.me;
+        const {ge: r, $e: n, he: s, we: l, ye: i, Se: c} = e.me;
         return t("div", {
             ref: o,
             role: l,
@@ -843,8 +849,8 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
             "aria-sort": i,
             style: c
         }, [ e.re({
-            row: e.ye,
-            col: e.be,
+            row: e.be,
+            col: e.ze,
             cell: {
                 rowIndex: e.xe,
                 colIndex: r
@@ -855,47 +861,47 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
     props: {
         me: null,
         re: null,
-        ye: null,
         be: null,
+        ze: null,
         xe: null,
         se: null
     }
-}), te = /* @__PURE__ */ o(e => () => {
-    const {ve: o, Ie: r, ze: n} = e.me;
+}), ee = /* @__PURE__ */ o(e => () => {
+    const {ve: o, Ie: r, Se: n} = e.me;
     return t("div", {
         role: "row",
         "aria-rowindex": o + 1,
         style: n
-    }, [ r.map(r => t(ee, {
-        key: r._e,
+    }, [ r.map(r => t(Z, {
+        key: r.ge,
         me: r,
         re: e.re,
-        ye: e.ye,
-        be: A(e.ke, r._e),
+        be: e.be,
+        ze: N(e.ke, r.ge),
         xe: o,
         se: e.se
-    }, null, 8, [ "me", "re", "ye", "be", "xe", "se" ])) ], 12, [ "aria-rowindex" ]);
+    }, null, 8, [ "me", "re", "be", "ze", "xe", "se" ])) ], 12, [ "aria-rowindex" ]);
 }, {
     props: {
         me: null,
         re: null,
-        ye: null,
+        be: null,
         ke: null,
         se: null
     }
-}), oe = /* @__PURE__ */ o(e => () => {
-    const {Oe: o, ze: r} = e.me;
+}), te = /* @__PURE__ */ o(e => () => {
+    const {Oe: o, Se: r} = e.me;
     return t("div", {
         role: "rowgroup",
         style: r
-    }, [ o.map(o => t(te, {
+    }, [ o.map(o => t(ee, {
         key: o.ve,
         me: o,
         re: e.re,
-        ye: A(e.Te, o.ve),
+        be: N(e.Te, o.ve),
         ke: e.ke,
         se: e.se
-    }, null, 8, [ "me", "re", "ye", "ke", "se" ])) ], 4);
+    }, null, 8, [ "me", "re", "be", "ke", "se" ])) ], 4);
 }, {
     props: {
         me: null,
@@ -904,7 +910,7 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
         ke: null,
         se: null
     }
-}), re = /* @__PURE__ */ o({
+}), oe = /* @__PURE__ */ o({
     props: {
         rows: {
             type: [ Number, Array ],
@@ -938,7 +944,7 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
     },
     emits: [ "verticalScroll", "horizontalScroll", "scrollEnd" ],
     setup(o, {emit: r, expose: n, slots: u}) {
-        const m = i(), g = M(o.rows, o.rowHeight, o.gap), S = M(o.cols, o.colWidth, o.gap), w = e(() => g.D(o.rows, o.rowHeight)), y = e(() => S.D(o.cols, o.colWidth)), b = e(() => ((e = f) => {
+        const m = i(), _ = E(o.rows, o.rowHeight, o.gap), w = E(o.cols, o.colWidth, o.gap), y = e(() => _.X(o.rows, o.rowHeight)), b = e(() => w.X(o.cols, o.colWidth)), z = e(() => ((e = f) => {
             const t = /* @__PURE__ */ new Map;
             for (const o of e) {
                 const e = o.rowIndex + (o.rowSpan || 1);
@@ -948,16 +954,16 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
                 }
             }
             return t;
-        })(o.spans)), x = I(g), k = I(S), O = ((e, t) => {
-            let o, r, n, s = z();
-            const l = /* @__PURE__ */ new WeakMap, i = /* @__PURE__ */ new WeakMap, c = V(r => {
+        })(o.spans)), x = I(_), k = I(w), O = ((e, t) => {
+            let o, r, n, s = S();
+            const l = /* @__PURE__ */ new WeakMap, i = /* @__PURE__ */ new WeakMap, c = W(r => {
                 const n = [], s = [];
-                for (const {target: c, contentRect: {width: a, height: u}} of r) if (c === o) (a || u) && (e.P(4, u), 
-                t.P(4, a)); else if (c.offsetParent) {
+                for (const {target: c, contentRect: {width: a, height: u}} of r) if (c === o) (a || u) && (e.B(4, u), 
+                t.B(4, a)); else if (c.offsetParent) {
                     const e = l.get(c), t = i.get(c);
                     null != e && n.push([ e, u ]), null != t && s.push([ t, a ]);
                 }
-                n.length && e.P(3, n), s.length && t.P(3, s);
+                n.length && e.B(3, n), s.length && t.B(3, s);
             });
             return {
                 async K(e, t) {
@@ -965,8 +971,8 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
                 },
                 ue(l) {
                     const i = o = l.parentElement;
-                    c.X(i);
-                    const a = (e, t) => D(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
+                    c.Y(i);
+                    const a = (e, t) => V(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
                         const e = t ? "overflowX" : "overflowY", o = i.style, r = o[e];
                         o[e] = "hidden", h(() => {
                             o[e] = r;
@@ -974,47 +980,47 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
                     });
                     r = a(e, !1), n = a(t, !0), s[1](!0);
                 },
-                k() {
-                    c.J(), r && r.J(), n && n.J(), s[1](!1), s = z();
+                O() {
+                    c.D(), r && r.D(), n && n.D(), s[1](!1), s = S();
                 },
-                fe: (e, t, o) => (null != t && l.set(e, t), null != o && i.set(e, o), c.X(e), () => {
-                    l.delete(e), i.delete(e), c.Y(e);
+                fe: (e, t, o) => (null != t && l.set(e, t), null != o && i.set(e, o), c.Y(e), () => {
+                    l.delete(e), i.delete(e), c.J(e);
                 }),
                 de() {
                     r && r.U(), n && n.U();
                 }
             };
-        })(x, k), T = i(x.O() + k.O()), R = () => {
-            T.value = x.O() + k.O();
+        })(x, k), T = i(x.T() + k.T()), j = () => {
+            T.value = x.T() + k.T();
         };
-        x.q(1, R), k.q(1, R);
-        let q = !1;
-        x.q(4, () => {
-            q = !0, r("verticalScroll", x.M());
-        }), k.q(4, () => {
-            q = !0, r("horizontalScroll", k.M());
+        x.P(1, j), k.P(1, j);
+        let F = !1;
+        x.P(4, () => {
+            F = !0, r("verticalScroll", x.A());
+        }), k.P(4, () => {
+            F = !0, r("horizontalScroll", k.A());
         });
-        const F = () => {
-            !q || x.N() || k.N() || (q = !1, r("scrollEnd"));
+        const X = () => {
+            !F || x.C() || k.C() || (F = !1, r("scrollEnd"));
         };
-        x.q(8, F), k.q(8, F), a(() => {
-            N(x, g, o.rows, w.value, o.headerRows, o.footerRows);
-        }), a(() => {
-            N(k, S, o.cols, y.value, o.headerCols, o.footerCols);
+        x.P(8, X), k.P(8, X), a(() => {
+            _.W(o.headerRows, o.footerRows), w.W(o.headerCols, o.footerCols);
+            const e = R(o.rows), t = R(o.cols);
+            e !== x.M() && x.B(5, [ e ]), t !== k.M() && k.B(5, [ t ]), x.B(9, y.value), k.B(9, b.value);
         });
-        const X = e(() => T.value && x.A()), J = e(() => T.value && k.A()), U = e(() => (T.value, 
+        const J = e(() => T.value && x.M()), D = e(() => T.value && k.M()), U = e(() => (T.value, 
         ((e, t, [o, r], [n, s], l, i = f, c = f, a) => {
-            const u = e.S(), m = t.S(), g = e.W(), h = e.V(), S = t.W(), w = t.V();
-            o = _(o, g, h), r = d(r, h - 1), n = _(n, S, w), s = d(s, w - 1);
-            const z = E(i, g, h), y = p(S - 1, 0), b = [], x = [], v = [];
-            for (const e of c) e.rowIndex < u && e.colIndex < m && (v.push(e), b.push(e.rowIndex));
-            const I = v.length, k = j(z, o, h), O = k < 0 ? -1 : z[k];
-            O >= 0 && b.push(O);
-            const T = P($(b), u, g, o, r, h);
+            const u = e.h(), m = t.h(), _ = e.V(), h = e.F(), w = t.V(), y = t.F();
+            o = g(o, _, h), r = d(r, h - 1), n = g(n, w, y), s = d(s, y - 1);
+            const S = A(i, _, h), b = p(w - 1, 0), z = [], x = [], v = [];
+            for (const e of c) e.rowIndex < u && e.colIndex < m && (v.push(e), z.push(e.rowIndex));
+            const I = v.length, k = C(S, o, h), O = k < 0 ? -1 : S[k];
+            O >= 0 && z.push(O);
+            const T = q($(z), u, _, o, r, h);
             for (let e = 0; e < T.length; e++) for (const t of l.get(T[e]) || f) {
-                const {rowIndex: l, colIndex: i} = t, c = B(t, u), a = L(t, m);
+                const {rowIndex: l, colIndex: i} = t, c = P(t, u), a = B(t, m);
                 if ((e < 1 || T[e - 1] < l) && i < m && (c - l > 1 || a - i > 1)) {
-                    let e = (l < g || p(l, o) < d(c, r + 1) || h < c || O >= l && O < c) && (i < S || p(i, n) < d(a, s + 1) || w < a);
+                    let e = (l < _ || p(l, o) < d(c, r + 1) || h < c || O >= l && O < c) && (i < w || p(i, n) < d(a, s + 1) || y < a);
                     for (let t = 0; !e && t < I; t++) {
                         const o = v[t];
                         e = o.rowIndex >= l && o.rowIndex < c && o.colIndex >= i && o.colIndex < a;
@@ -1023,110 +1029,110 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
                 }
             }
             for (const {rowIndex: e, colIndex: t} of v) {
-                const o = j(z, e, h);
-                b.push(e), o >= 0 && b.push(z[o]), x.push(t);
+                const o = C(S, e, h);
+                z.push(e), o >= 0 && z.push(S[o]), x.push(t);
             }
-            $(b), $(x);
-            const R = P(b, u, g, o, r, h), A = P(x, m, S, n, s, w), M = R.length, N = A.length, q = /* @__PURE__ */ new Map, V = [], D = [];
+            $(z), $(x);
+            const R = q(z, u, _, o, r, h), N = q(x, m, w, n, s, y), E = R.length, j = N.length, W = /* @__PURE__ */ new Map, V = [], F = [];
             for (const e of v) {
-                const t = B(e, u), o = L(e, m);
-                V.push(t), D.push(o);
-                const r = A.indexOf(e.colIndex);
-                for (let n = R.indexOf(e.rowIndex); n < M && R[n] < t; n++) {
+                const t = P(e, u), o = B(e, m);
+                V.push(t), F.push(o);
+                const r = N.indexOf(e.colIndex);
+                for (let n = R.indexOf(e.rowIndex); n < E && R[n] < t; n++) {
                     const t = R[n] * m;
-                    for (let n = r; n < N && A[n] < o; n++) q.set(t + A[n], e);
+                    for (let n = r; n < j && N[n] < o; n++) W.set(t + N[n], e);
                 }
             }
-            const F = [];
-            for (const e of A) F.push(!t.L(e) && null);
-            const X = [], Y = e.u(g), J = [];
-            let U = J;
-            const G = C.get(e), K = /* @__PURE__ */ new Map;
+            const X = [];
+            for (const e of N) X.push(!t.L(e) && null);
+            const Y = [], J = e.u(_), D = [];
+            let U = D;
+            const G = M.get(e), K = /* @__PURE__ */ new Map;
             for (const l of R) {
-                const i = l < g, c = l >= h, f = j(z, l, h), d = i ? 0 : c ? h : f < 0 ? -1 : z[f];
+                const i = l < _, c = l >= h, f = C(S, l, h), d = i ? 0 : c ? h : f < 0 ? -1 : S[f];
                 if (l === d) {
-                    const e = i ? g : c ? u : f + 1 < z.length ? z[f + 1] : h;
+                    const e = i ? _ : c ? u : f + 1 < S.length ? S[f + 1] : h;
                     V.push(e);
                     const t = [];
-                    J.push({
+                    D.push({
                         Re: i ? -1 : c ? -2 : -3 - d,
                         Oe: t,
-                        ze: W(d, e, i || c ? 0 : null, c ? "bottom" : "top", 4)
+                        Se: L(d, e, i || c ? 0 : null, c ? "bottom" : "top", 4)
                     }), U = t;
-                } else d < 0 && (U = J);
-                const _ = f >= 0 && l === d, $ = i || c || l === O || l >= o && l <= r, b = _ ? Y : null, x = l * m, v = G && G.get(l), I = v && v.Ie, k = [];
-                let T = 0, R = !e.L(l) && null, M = l + 1, C = !1;
-                for (let e = 0; e < N; e++) {
-                    const o = A[e], r = o < S, c = o >= w, f = r || c || o >= n && o <= s, d = q.get(x + o);
+                } else d < 0 && (U = D);
+                const g = f >= 0 && l === d, $ = i || c || l === O || l >= o && l <= r, z = g ? J : null, x = l * m, v = G && G.get(l), I = v && v.Ie, k = [];
+                let T = 0, R = !e.L(l) && null, E = l + 1, M = !1;
+                for (let e = 0; e < j; e++) {
+                    const o = N[e], r = o < w, c = o >= y, f = r || c || o >= n && o <= s, d = W.get(x + o);
                     if (d ? d.rowIndex === l && d.colIndex === o : $ && f) {
-                        const n = d ? B(d, u) : l + 1, s = d ? L(d, m) : o + 1, f = n - l, g = s - o, $ = f > 1, h = g > 1, S = $ || h;
-                        let w, z;
-                        M = p(M, n);
-                        const b = r ? t.u(o) : null, x = c ? t.u(m) - t.u(s) : null;
-                        !1 !== R || $ || (w = l, R = !0), !1 !== F[e] || h || (z = o, F[e] = !0);
-                        const v = i ? "columnheader" : o === y && (r || _) ? "rowheader" : "cell", O = S ? f : void 0, A = S ? g : void 0, N = "cell" !== v && a && a.rowIndex === l && a.colIndex === o ? a.order : void 0;
-                        let E;
+                        const n = d ? P(d, u) : l + 1, s = d ? B(d, m) : o + 1, f = n - l, _ = s - o, $ = f > 1, h = _ > 1, w = $ || h;
+                        let y, S;
+                        E = p(E, n);
+                        const z = r ? t.u(o) : null, x = c ? t.u(m) - t.u(s) : null;
+                        !1 !== R || $ || (y = l, R = !0), !1 !== X[e] || h || (S = o, X[e] = !0);
+                        const v = i ? "columnheader" : o === b && (r || g) ? "rowheader" : "cell", O = w ? f : void 0, N = w ? _ : void 0, A = "cell" !== v && a && a.rowIndex === l && a.colIndex === o ? a.order : void 0;
+                        let C;
                         if (I) {
                             const e = I.length;
-                            for (;T < e && I[T]._e < o; ) T++;
-                            T < e && I[T]._e === o && (E = I[T]);
+                            for (;T < e && I[T].ge < o; ) T++;
+                            T < e && I[T].ge === o && (C = I[T]);
                         }
-                        if (!E || E.$e !== O || E.he !== A || E.Ae !== b || E.Me !== x || E.pe !== w || E.ge !== z || E.Se !== v || E.we !== N) {
+                        if (!C || C.$e !== O || C.he !== N || C.Ne !== z || C.Ee !== x || C.pe !== y || C._e !== S || C.we !== v || C.ye !== A) {
                             let e = "1/l" + o;
-                            S && (e += "/l" + n + "/l" + s);
+                            w && (e += "/l" + n + "/l" + s);
                             const t = {
                                 contain: "layout style",
                                 display: "grid",
                                 gridArea: e
                             };
                             $ && (t.height = "0px", t.minHeight = "100%", t.zIndex = 1), h && (t.width = "0px", 
-                            t.minWidth = "100%"), (r || c) && (t[r ? "insetInlineStart" : "insetInlineEnd"] = (r ? b : x) + "px", 
-                            t.position = "sticky", t.zIndex = 2), E = {
-                                _e: o,
+                            t.minWidth = "100%"), (r || c) && (t[r ? "insetInlineStart" : "insetInlineEnd"] = (r ? z : x) + "px", 
+                            t.position = "sticky", t.zIndex = 2), C = {
+                                ge: o,
                                 $e: O,
-                                he: A,
-                                pe: w,
-                                ge: z,
-                                Se: v,
-                                we: N,
-                                ze: t,
-                                Ae: b,
-                                Me: x
-                            }, C = !0;
+                                he: N,
+                                pe: y,
+                                _e: S,
+                                we: v,
+                                ye: A,
+                                Se: t,
+                                Ne: z,
+                                Ee: x
+                            }, M = !0;
                         }
-                        k.push(E);
+                        k.push(C);
                     }
                 }
-                if (X.push(R), k.length) {
-                    const e = v && !C && v.Ie.length === k.length && v.Ne === b ? v : {
+                if (Y.push(R), k.length) {
+                    const e = v && !M && v.Ie.length === k.length && v.Me === z ? v : {
                         ve: l,
                         Ie: k,
-                        ze: W(l, M, b, "top", 3),
-                        Ne: b
+                        Se: L(l, E, z, "top", 3),
+                        Me: z
                     };
                     K.set(l, e), U.push(e);
                 }
             }
-            return C.set(e, K), {
-                Ce: H(e, R, X, $(V), "max-content", u),
-                Ee: H(t, A, F, $(D), "minmax(max-content,auto)", m),
-                je: J
+            return M.set(e, K), {
+                Ae: H(e, R, Y, $(V), "max-content", u),
+                Ce: H(t, N, X, $(F), "minmax(max-content,auto)", m),
+                je: D
             };
-        })(g, S, x.l(o.bufferSize), k.l(o.bufferSize), b.value, o.sectionRows, o.keepMounted, o.ariaSort))), G = e(() => T.value && (x.N() || k.N()));
+        })(_, w, x.l(o.bufferSize), k.l(o.bufferSize), z.value, o.sectionRows, o.keepMounted, o.ariaSort))), G = e(() => T.value && (x.C() || k.C()));
         return s(() => {
             O.ue(m.value);
         }), l(() => {
-            x.k(), k.k(), O.k();
+            x.O(), k.O(), O.O();
         }), c([ T ], () => {
             O.de();
         }, {
             flush: "post"
         }), n({
             get verticalScrollOffset() {
-                return x.M();
+                return x.A();
             },
             get horizontalScrollOffset() {
-                return k.M();
+                return k.A();
             },
             get scrollHeight() {
                 return v(x);
@@ -1140,30 +1146,30 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
             get viewportWidth() {
                 return k.o();
             },
-            findRowIndex: x.T,
-            findColIndex: k.T,
+            findRowIndex: x.R,
+            findColIndex: k.R,
             getRowOffset: x.u,
             getColOffset: k.u,
             getRowSize: x.p,
             getColSize: k.p,
             scrollToIndex: e => ((e, t, o, r, n, s = f, {rowIndex: l, colIndex: i, rowAlign: c, colAlign: a}) => {
                 null != l && Y(e, t, r, s, l, c, !1), null != i && Y(e, o, n, f, i, a, !0);
-            })(O, x, k, g, S, o.sectionRows, e),
+            })(O, x, k, _, w, o.sectionRows, e),
             scrollTo: ({vertical: e, horizontal: t}) => ((e, t, o) => {
                 null != t && e.K(!1, () => t), null != o && e.K(!0, () => o);
             })(O, e, t),
             scrollBy: ({vertical: e, horizontal: t}) => ((e, t, o, r, n) => {
                 if (null != r) {
-                    const o = r + t.M();
+                    const o = r + t.A();
                     e.K(!1, () => o);
                 }
                 if (null != n) {
-                    const t = n + o.M();
+                    const t = n + o.A();
                     e.K(!0, () => t);
                 }
             })(O, x, k, e, t)
         }), () => {
-            const {Ce: e, Ee: r, je: n} = U.value, s = x.u(0), l = k.u(0), i = {
+            const {Ae: e, Ce: r, je: n} = U.value, s = x.u(0), l = k.u(0), i = {
                 contain: "size style",
                 overflowAnchor: "none",
                 flex: "none",
@@ -1178,8 +1184,8 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
             };
             return t("div", {
                 role: "table",
-                "aria-rowcount": X.value,
-                "aria-colcount": J.value,
+                "aria-rowcount": J.value,
+                "aria-colcount": D.value,
                 style: {
                     overflow: "auto",
                     contain: "strict",
@@ -1189,24 +1195,24 @@ u), v = e => p(e.t(), e.o()), I = ({l: e, i: t, u: o, p: r, m: n, h: s, t: l, S:
             }, [ t("div", {
                 ref: m,
                 style: i
-            }, [ n.map(e => "Oe" in e ? t(oe, {
+            }, [ n.map(e => "Oe" in e ? t(te, {
                 key: e.Re,
                 me: e,
                 re: u.default,
                 Te: o.rows,
                 ke: o.cols,
                 se: O.fe
-            }, null, 8, [ "me", "re", "Te", "ke", "se" ]) : t(te, {
+            }, null, 8, [ "me", "re", "Te", "ke", "se" ]) : t(ee, {
                 key: e.ve,
                 me: e,
                 re: u.default,
-                ye: A(o.rows, e.ve),
+                be: N(o.rows, e.ve),
                 ke: o.cols,
                 se: O.fe
-            }, null, 8, [ "me", "re", "ye", "ke", "se" ])) ], 4) ], 8, [ "aria-rowcount", "aria-colcount" ]);
+            }, null, 8, [ "me", "re", "be", "ke", "se" ])) ], 4) ], 8, [ "aria-rowcount", "aria-colcount" ]);
         };
     }
 });
 
-export { re as VGrid, Q as VList, K as Virtualizer, Z as WindowVirtualizer };
+export { oe as VGrid, K as VList, G as Virtualizer, Q as WindowVirtualizer };
 //# sourceMappingURL=index.js.map