virtua 0.52.7 → 0.52.9

package/lib/index.cjs

@@ -13,108 +13,104 @@ var n, r = [], {min: s, max: l, abs: i, floor: c} = Math, a = (e, t, o) => s(o,
     return [ new Promise(t => {
         e = t;
     }), e ];
-}, $ = "undefined" != typeof window, p = e => e.ownerDocument, w = e => e.defaultView, m = () => (null == n && (n = /iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0), 
-n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, p: c, t: a, m: f, S: u, _: d}, h = 0) => {
-    let g = !!d, $ = !!h, p = 1, w = 0, S = 0, _ = 0, v = 0, z = 0, y = 0, x = 0, I = 0, b = null, k = [ 0, $ ? l(h - 1, 0) : -1 ], R = 0, T = !1;
-    const M = /* @__PURE__ */ new Set, C = () => _ - S, O = () => C() + z + v, E = e => o(e) - z, L = e => {
-        e && (m() && 0 !== x || b && 1 === I ? z += e : v += e);
+}, $ = "undefined" != typeof window, p = e => e.ownerDocument, m = e => e.defaultView, w = () => (null == n && (n = /iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0), 
+n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: a, m: f, S: u, _: d, v: h}, g = 0) => {
+    let $ = !!g, p = 1, m = 0, S = 0, _ = 0, v = 0, z = 0, y = 0, x = 0, b = 0, I = null, k = [ 0, $ ? l(g - 1, 0) : -1 ], R = !1;
+    const T = /* @__PURE__ */ new Set, M = () => _ - S, C = () => M() + z + v, O = e => o(e) - z, E = e => {
+        if (2 === b) return !0;
+        if (I && 1 === b) return e < I[0];
+        const t = M(), o = O(e), r = n(e);
+        return 1 !== x && 0 === b ? o + r <= t : o < t && o + r < t + m;
+    }, L = e => {
+        e && (w() && 0 !== x || I && 1 === b ? z += e : v += e);
     };
     return {
-        v: () => {
-            M.clear();
+        I: () => {
+            T.clear();
         },
-        I: () => p,
+        k: () => p,
         l: (t = 200) => {
-            if (!T || $) return k;
+            if (!R || $) return k;
             let o, n;
             if (y) [o, n] = k; else {
-                let r = l(0, O()), i = r + w;
-                g || (t = l(0, t), 1 !== x && (r -= t), 2 !== x && (i += t)), [o, n] = k = e(l(0, r), l(0, i)), 
-                b && (o = s(o, b[0]), n = l(n, b[1]));
+                let r = l(0, C()), i = r + m;
+                u() || (t = l(0, t), 1 !== x && (r -= t), 2 !== x && (i += t)), [o, n] = k = e(l(0, r), l(0, i)), 
+                I && (o = s(o, I[0]), n = l(n, I[1]));
             }
-            return [ l(o, 0), s(n, f() - 1) ];
+            return [ l(o, 0), s(n, a() - 1) ];
         },
-        k: e => t(e - S),
-        R: c,
-        u: E,
+        R: e => t(e - S),
+        T: r,
+        u: O,
         h: n,
-        T: f,
-        M: () => _,
-        C: () => 0 !== x,
-        o: () => w,
-        O: () => S,
-        t: a,
-        L: () => (y = v, v = 0, [ y, 2 === I ]),
-        q: (e, t) => {
+        M: a,
+        C: () => _,
+        O: () => 0 !== x,
+        o: () => m,
+        L: () => S,
+        t: c,
+        q: () => (y = v, v = 0, [ y, 2 === b ]),
+        W: (e, t) => {
             const o = [ e, t ];
-            return M.add(o), () => {
-                M.delete(o);
+            return T.add(o), () => {
+                T.delete(o);
             };
         },
-        A: (o, s) => {
-            let l, f, h = 0;
-            switch (o) {
+        A: (t, o) => {
+            let n, s, l = 0;
+            switch (t) {
               case 1:
                 {
-                    if (s === _ && 0 === I) break;
+                    if (o === _ && 0 === b) break;
                     const e = y;
                     y = 0;
-                    const t = s - _, o = i(t);
-                    e && o < i(e) + 1 || 0 !== I || (x = t < 0 ? 2 : 1), $ && ($ = !1), _ = s, h = 4;
-                    const n = C();
-                    n >= -w && n <= a() && (h += 1, f = o > w);
+                    const t = o - _, n = i(t);
+                    e && n < i(e) + 1 || 0 !== b || (x = t < 0 ? 2 : 1), $ && ($ = !1), _ = o, l = 4;
+                    const r = M();
+                    r >= -m && r <= c() && (l += 1, s = n > m);
                     break;
                 }
 
               case 2:
-                h = 8, 0 !== x && (l = !0, h += 1), x = 0, I = 0, b = null;
+                l = 8, 0 !== x && (n = !0, l += 1), x = 0, b = 0, I = null;
                 break;
 
               case 3:
                 {
-                    const e = s.filter(([e, t]) => !c(e, t));
+                    const e = o.filter(([e, t]) => !r(e, t));
                     if (!e.length) break;
-                    L(e.reduce((e, [t, o]) => {
-                        let r;
-                        if (2 === I) r = !0; else if (b && 1 === I) r = t < b[0]; else {
-                            const e = C(), o = E(t), s = n(t);
-                            r = 1 !== x && 0 === I ? o + s <= e : o < e && o + s < e + w;
-                        }
-                        return r && (e += o - n(t)), e;
-                    }, 0));
-                    for (const [t, o] of e) {
-                        const e = n(t), s = r(t, o);
-                        g && (R += s ? o : o - e);
-                    }
-                    g && w && R > w && (L(d(t(O()))), g = !1), h = 3, f = !0;
+                    L(d(e, E, C(), m)), l = 3, s = !0;
                     break;
                 }
 
               case 4:
-                w !== s && (w || (T = f = !0), w = s, h = 3);
+                m !== o && (m || (R = s = !0), m = o, l = 3);
                 break;
 
               case 5:
-                s[1] ? (L(u(s[0], !0)), I = 2, h = 1) : (u(s[0]), h = 1);
+                o[1] ? (L(f(o[0], !0)), b = 2, l = 1) : (f(o[0]), l = 1);
                 break;
 
               case 6:
-                S = s;
+                S = o;
                 break;
 
               case 7:
-                I = 1;
+                b = 1;
                 break;
 
               case 9:
-                L(s), h = 3;
-                break;
+                {
+                    const e = h(o, C());
+                    null != e && (L(e), l = 3);
+                    break;
+                }
 
               case 8:
-                b = e(s, s + w), h = 1;
+                I = e(o, o + m), l = 1;
             }
-            h && (p = 1 + (2147483647 & p), l && z && (v += z, z = 0), M.forEach(([e, t]) => {
-                h & e && t(f);
+            l && (p = 1 + (2147483647 & p), n && z && (v += z, z = 0), T.forEach(([e, t]) => {
+                l & e && t(s);
             }));
         }
     };
@@ -130,140 +126,140 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, p: c, t: a, m:
     }
     return a(s, 0, t - 1);
 }, y = (e, t, o) => {
-    let n = o && o[1] || t || 40, r = -1, i = 0;
-    const c = o && o[0], a = c ? v(c.slice(0, s(e, c.length)), l(0, e - c.length)) : v([], e), u = v([], e + 1), d = e => {
-        const t = a[e];
+    let n = o && o[1] || t || 40, r = -1, i = 0, c = !t, a = 0;
+    const u = o && o[0], d = u ? v(u.slice(0, s(e, u.length)), l(0, e - u.length)) : v([], e), h = v([], e + 1), g = e => {
+        const t = d[e];
         return -1 === t ? n : t;
-    }, h = t => {
+    }, $ = t => {
         if (!e) return 0;
-        if (r >= t) return u[t];
-        r < 0 && (u[0] = 0, r = 0);
-        let o = r, n = u[o];
-        for (;o < t; ) n += d(o), u[++o] = n;
+        if (r >= t) return h[t];
+        r < 0 && (h[0] = 0, r = 0);
+        let o = r, n = h[o];
+        for (;o < t; ) n += g(o), h[++o] = n;
         return r = t, n;
     };
     return {
         l: (t, o) => {
             let n, r;
-            return i = s(i, e - 1), h(i) <= t ? (r = z(h, e, o, i), n = z(h, e, t, i, r)) : (n = z(h, e, t, void 0, i), 
-            r = z(h, e, o, n)), i = n, [ n, r ];
-        },
-        i: t => z(h, e, t),
-        u: h,
-        h: d,
-        $: (e, t) => {
-            const o = -1 === a[e];
-            return a[e] = t, r = s(e, r), o;
-        },
-        p: (e, t = -1) => a[e] === t,
-        t: () => h(e),
-        m: () => e,
-        S: (t, o) => {
+            return a = s(a, e - 1), $(a) <= t ? (r = z($, e, o, a), n = z($, e, t, a, r)) : (n = z($, e, t, void 0, a), 
+            r = z($, e, o, n)), a = n, [ n, r ];
+        },
+        i: t => z($, e, t),
+        u: $,
+        h: g,
+        $: (e, t = -1) => d[e] === t,
+        _: (t, o, a, u) => {
+            let h = t.reduce((e, [t, n]) => o(t) ? e + (n - g(t)) : e, 0);
+            for (const [e, o] of t) i += -1 === d[e] ? o : o - g(e), d[e] = o, r = s(e, r);
+            if (c && u && i > u) {
+                let t = 0;
+                const o = z($, e, a + h), s = [];
+                d.forEach((e, n) => {
+                    -1 !== e && (e && s.push(e), n < o && t++);
+                }), r = -1, f(s);
+                const i = s.length, u = i / 2 | 0, g = i % 2 == 0 ? (s[u - 1] + s[u]) / 2 : s[u], p = n;
+                h += ((n = g) - p) * l(o - t, 0), c = !1;
+            }
+            return h;
+        },
+        t: () => $(e),
+        p: () => e,
+        m: (t, o) => {
             const l = t - e;
-            return r = o ? -1 : s(t - 1, r), e = t, l > 0 ? (v(u, l), v(a, l, o), n * l) : (u.splice(l), 
-            (o ? a.splice(0, -l) : a.splice(l)).reduce((e, t) => e - (-1 === t ? n : t), 0));
-        },
-        _: t ? void 0 : e => {
-            let t = 0;
-            const o = [];
-            a.forEach((n, r) => {
-                -1 !== n && (n && o.push(n), r < e && t++);
-            }), r = -1, f(o);
-            const s = o.length, i = s / 2 | 0, c = s % 2 == 0 ? (o[i - 1] + o[i]) / 2 : o[i], u = n;
-            return ((n = c) - u) * l(e - t, 0);
-        },
-        W: () => [ a.slice(), n ]
+            return r = o ? -1 : s(t - 1, r), e = t, l > 0 ? (v(h, l), v(d, l, o), n * l) : (h.splice(l), 
+            (o ? d.splice(0, -l) : d.splice(l)).reduce((e, t) => e - (-1 === t ? n : t), 0));
+        },
+        S: () => c,
+        H: () => [ d.slice(), n ]
     };
-}, x = e => "number" == typeof e ? e : e.length, I = (e, t) => "number" == typeof e ? t : e[t], b = (e, t, o = 0) => {
+}, x = e => "number" == typeof e ? e : e.length, b = (e, t) => "number" == typeof e ? t : e[t], I = (e, t, o = 0) => {
     let n = x(e);
     const r = "number" == typeof t, i = "auto" === t;
-    let u = (r ? t : 40) + o, d = -1, h = 0, g = 0, $ = null;
-    const p = [], w = [], m = [], S = e => i || !!m[e], _ = () => {
-        p.length || v(p, n);
-    }, y = e => {
-        const t = p[e];
-        return -1 === t ? u : t;
+    let u = (r ? t : 40) + o, d = -1, h = 0, g = i, $ = 0, p = 0, m = null;
+    const w = [], S = [], _ = [], y = e => i || !!_[e], b = () => {
+        w.length || v(w, n);
     }, I = e => {
+        const t = w[e];
+        return -1 === t ? u : t;
+    }, k = e => {
         if (!n) return 0;
-        if (!p.length) return e * u;
-        if (d >= e) return w[e];
-        d < 0 && (w[0] = 0, d = 0);
-        let t = d, o = w[t];
-        for (;t < e; ) o += y(t), w[++t] = o;
+        if (!w.length) return e * u;
+        if (d >= e) return S[e];
+        d < 0 && (S[0] = 0, d = 0);
+        let t = d, o = S[t];
+        for (;t < e; ) o += I(t), S[++t] = o;
         return d = e, o;
-    }, b = (e, t) => {
-        p[e] = t, d = s(e, d);
-    }, k = e => p.length ? z(I, n, e) : u ? a(c(e / u), 0, n - 1) : 0, R = () => s(h, n), T = () => l(n - g, R());
+    }, R = (e, t) => {
+        w[e] = t, d = s(e, d);
+    }, T = e => w.length ? z(k, n, e) : u ? a(c(e / u), 0, n - 1) : 0, M = () => s($, n), C = () => l(n - p, M()), O = e => (w.length ? I(e) : u) - o;
     return {
         l: (e, t) => {
-            const r = I(R()), s = I(n) - I(T()), i = e + (r ? r - o : 0);
-            return [ k(i), k(l(i, t - (s ? s - o : 0))) ];
-        },
-        i: k,
-        u: I,
-        h: e => (p.length ? y(e) : u) - o,
-        $: (e, t) => {
-            if (!S(e)) return !1;
-            _();
-            const n = -1 === p[e];
-            return b(e, t + o), n;
-        },
-        p: (e, t) => (p.length ? p[e] : -1) === t + o,
-        t: () => n ? I(n) - o : 0,
-        m: () => n,
-        S: e => {
+            const r = k(M()), s = k(n) - k(C()), i = e + (r ? r - o : 0);
+            return [ T(i), T(l(i, t - (s ? s - o : 0))) ];
+        },
+        i: T,
+        u: k,
+        h: O,
+        _: (e, t, n, r) => {
+            let s = e.reduce((e, [o, n]) => y(o) && t(o) ? e + (n - O(o)) : e, 0);
+            for (const [t, n] of e) y(t) && (b(), h += -1 === w[t] ? n : n - O(t), R(t, n + o));
+            if (g && r && h > r) {
+                let e = 0;
+                const t = T(n + s), o = [];
+                w.forEach((n, r) => {
+                    -1 !== n && (n && o.push(n), r < t && e++);
+                }), d = -1, f(o);
+                const r = o.length, i = r / 2 | 0, c = r % 2 == 0 ? (o[i - 1] + o[i]) / 2 : o[i], a = u;
+                s += ((u = c) - a) * l(t - e, 0), g = !1;
+            }
+            return s;
+        },
+        $: (e, t = -1) => {
+            const n = w.length ? w[e] : -1;
+            return -1 === t ? y(e) && -1 === n : n === t + o;
+        },
+        t: () => n ? k(n) - o : 0,
+        p: () => n,
+        m: e => {
             const t = e - n;
-            return d = s(e - 1, d), n = e, p.length && (t > 0 ? v(p, t) : p.splice(t)), 0;
-        },
-        _: i ? e => {
-            let t = 0;
-            const o = [];
-            p.forEach((n, r) => {
-                -1 !== n && (n && o.push(n), r < e && t++);
-            }), d = -1, f(o);
-            const n = o.length, r = n / 2 | 0, s = n % 2 == 0 ? (o[r - 1] + o[r]) / 2 : o[r], i = u;
-            return ((u = s) - i) * l(e - t, 0);
-        } : void 0,
-        H: S,
-        P: (e = 0, t = 0) => {
-            h = e, g = t;
-        },
-        B: R,
-        D: T,
-        V: (e, t) => "number" == typeof t ? r ? t : null : r || i || "auto" === t ? null : e.map(e => null != e ? e[t] : null),
-        X: (e, t) => {
+            return d = s(e - 1, d), n = e, w.length && (t > 0 ? v(w, t) : w.splice(t)), 0;
+        },
+        S: () => g,
+        P: y,
+        B: (e = 0, t = 0) => {
+            $ = e, p = t;
+        },
+        V: M,
+        X: C,
+        Y: (e, t) => "number" == typeof t ? r ? t : null : r || i || "auto" === t ? null : e.map(e => null != e ? e[t] : null),
+        v: (e, t) => {
             if (null == e) return;
             if ("number" == typeof e) {
                 const n = e + o;
                 if (n === u) return;
-                const r = k(t) * (n - u);
+                const r = T(t) * (n - u);
                 return u = n, r;
             }
-            if (e === $ && n === m.length) return;
-            $ = e, m.length = n, _();
-            const r = k(t), s = I(r);
+            if (e === m && n === _.length) return;
+            m = e, _.length = n, b();
+            const r = T(t), s = k(r);
             let l;
             for (let t = 0; t < n; t++) {
                 const n = e[t], r = "number" != typeof n;
-                if (!r || !m[t]) {
-                    m[t] = r;
+                if (!r || !_[t]) {
+                    _[t] = r;
                     const e = r ? -1 : n + o;
-                    p[t] !== e && (b(t, e), l = !0);
+                    w[t] !== e && (R(t, e), l = !0);
                 }
             }
-            return l ? I(r) - s : void 0;
+            return l ? k(r) - s : void 0;
         }
     };
-}, k = (e, t, o, n, r, s) => {
-    const l = x(o);
-    t.P(r, s), l !== e.T() && e.A(5, [ l ]);
-    const i = t.X(n, e.M() - e.u(0));
-    null != i && e.A(9, i);
-}, R = /*#__PURE__*/ new WeakMap, T = (e, t, o) => {
+}, k = /*#__PURE__*/ new WeakMap, R = (e, t, o) => {
     const n = [];
     for (const r of e) r >= t && r < o && n.push(r);
     return f(n);
-}, M = (e, t, o) => {
+}, T = (e, t, o) => {
     if (t >= o) return -1;
     let n = 0, r = e.length;
     for (;n < r; ) {
@@ -271,22 +267,22 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, p: c, t: a, m:
         e[o] <= t ? n = o + 1 : r = o;
     }
     return n - 1;
-}, C = (e, t, o, n, r) => {
+}, M = (e, t, o, n, r) => {
     const s = t.length;
     for (;o < s && t[o] < n; o++) {
         const n = t[o];
         n > r && (e.push(n), r = n);
     }
     return o;
-}, O = (e, t, o, n, r, s) => {
+}, C = (e, t, o, n, r, s) => {
     const l = [];
     for (let e = 0; e < o; e++) l.push(e);
-    const i = C(l, e, 0, n, o - 1);
+    const i = M(l, e, 0, n, o - 1);
     for (let e = n; e <= r; e++) l.push(e);
-    C(l, e, i, s, r);
+    M(l, e, i, s, r);
     for (let e = s; e < t; e++) l.push(e);
     return l;
-}, E = (e, t) => s(e.rowIndex + (e.rowSpan || 1), t), L = (e, t) => s(e.colIndex + (e.colSpan || 1), t), q = (e, t, o, n, r, l) => {
+}, O = (e, t) => s(e.rowIndex + (e.rowSpan || 1), t), E = (e, t) => s(e.colIndex + (e.colSpan || 1), t), L = (e, t, o, n, r, l) => {
     const i = t.length, c = n.length;
     let a = "[l0]", f = 0, u = 0, d = 0;
     for (;f < l; ) {
@@ -301,7 +297,7 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, p: c, t: a, m:
         a += " " + $ + " [l" + g + "]", f = g;
     }
     return a;
-}, A = (e, t, o, n, r) => {
+}, q = (e, t, o, n, r) => {
     const s = {
         display: "grid",
         gridTemplateRows: "subgrid",
@@ -313,56 +309,56 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, p: c, t: a, m:
 }, W = e => {
     let t;
     return {
-        Y(o) {
-            (t || (t = new (w(p(o)).ResizeObserver)(e))).observe(o);
+        j(o) {
+            (t || (t = new (m(p(o)).ResizeObserver)(e))).observe(o);
         },
-        j(e) {
+        J(e) {
             t.unobserve(e);
         },
-        J() {
+        D() {
             t && t.disconnect();
         }
     };
-}, H = (e, t, o, n, r, s, l) => {
+}, A = (e, t, o, n, r, s, l) => {
     let i, c, a = 0, f = !1, g = !1, $ = !1, p = !1;
-    const w = Date.now, S = n ? "scrollLeft" : "scrollTop", _ = n ? "left" : "top", v = e => r ? -e : e, z = () => v(o[S]), y = (e, t) => {
+    const m = Date.now, S = n ? "scrollLeft" : "scrollTop", _ = n ? "left" : "top", v = e => r ? -e : e, z = () => v(o[S]), y = (e, t) => {
         o.scrollTo({
             [_]: v(e),
             behavior: t ? "smooth" : "instant"
         });
     }, x = () => {
-        if (f || g) return f = !1, void I();
+        if (f || g) return f = !1, void b();
         $ = !1, e.A(2);
-    }, I = () => {
-        d(c), c = u(x, 150);
     }, b = () => {
-        a = w(), $ && (p = !0), l && e.A(6, l()), e.A(1, z()), I();
+        d(c), c = u(x, 150);
+    }, I = () => {
+        a = m(), $ && (p = !0), l && e.A(6, l()), e.A(1, z()), b();
     }, k = t => {
-        if (f || !e.C() || t.ctrlKey) return;
-        const o = w() - a;
+        if (f || !e.O() || t.ctrlKey) return;
+        const o = m() - a;
         150 > o && 50 < o && (n ? t.deltaX : t.deltaY) && (f = !0);
     }, R = () => {
         g = !0, $ = p = !1;
     }, T = () => {
-        g = !1, m() && ($ = !0);
+        g = !1, w() && ($ = !0);
     };
-    return t.addEventListener("scroll", b), t.addEventListener("wheel", k, {
+    return t.addEventListener("scroll", I), t.addEventListener("wheel", k, {
         passive: !0
     }), t.addEventListener("touchstart", R, {
         passive: !0
     }), t.addEventListener("touchend", T, {
         passive: !0
     }), {
-        J: () => {
-            t.removeEventListener("scroll", b), t.removeEventListener("wheel", k), t.removeEventListener("touchstart", R), 
+        D: () => {
+            t.removeEventListener("scroll", I), t.removeEventListener("wheel", k), t.removeEventListener("touchstart", R), 
             t.removeEventListener("touchend", T), d(c);
         },
         U: () => {
-            const [t, n] = e.L();
+            const [t, n] = e.q();
             if (!t) return;
             p && s && s(), p = !1;
-            const r = e.M() + t;
-            r <= 0 || r >= e.O() + e.t() - e.o() ? y(r) : o.scrollBy({
+            const r = e.C(), l = r + t, c = e.L() + e.t() - e.o();
+            l <= 0 || l >= c || r >= c ? y(l) : o.scrollBy({
                 [_]: v(t),
                 behavior: "instant"
             }), n && (i && i(), e.o() > e.t() && e.A(1, z()));
@@ -375,7 +371,7 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, p: c, t: a, m:
             }, c = () => {
                 if (!n) {
                     if (e.o() && (d(r), r = u(l, 150)), o) {
-                        for (let [t, o] = e.l(0); t <= o; t++) if (e.R(t)) return;
+                        for (let [t, o] = e.l(0); t <= o; t++) if (e.T(t)) return;
                         l();
                     }
                     e.A(7), y(t(), o);
@@ -383,7 +379,7 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, p: c, t: a, m:
             }, a = () => {
                 if (n) return;
                 let t;
-                s = e.q(2, () => {
+                s = e.W(2, () => {
                     t || (t = !0, h(() => {
                         t = !1, c();
                     }));
@@ -392,7 +388,7 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, p: c, t: a, m:
             o ? (e.A(8, t()), h(a)) : a();
         }
     };
-}, P = (e, t) => {
+}, H = (e, t) => {
     let o, n, r = g();
     const s = /* @__PURE__ */ new WeakMap, l = W(n => {
         const r = [];
@@ -404,18 +400,18 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, p: c, t: a, m:
     });
     return {
         G(s, i = s.parentElement) {
-            l.Y(o = i), n = H(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
+            l.j(o = i), n = A(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
                 const e = t ? "overflowX" : "overflowY", o = i.style, n = o[e];
                 o[e] = "hidden", u(() => {
                     o[e] = n;
                 });
             }), r[1](!0);
         },
-        v() {
-            l.J(), n && n.J(), r[1](!1), r = g();
+        I() {
+            l.D(), n && n.D(), r[1](!1), r = g();
         },
-        K: (e, t) => (s.set(e, t), l.Y(e), () => {
-            s.delete(e), l.j(e);
+        K: (e, t) => (s.set(e, t), l.j(e), () => {
+            s.delete(e), l.J(e);
         }),
         async N(e, t) {
             await r[0] && n.F(e, t);
@@ -423,9 +419,9 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, p: c, t: a, m:
         Z() {
             n && n.U();
         },
-        ee: e.O
+        ee: e.L
     };
-}, B = (e, t) => {
+}, P = (e, t) => {
     let o, n, r, s, l, i = g();
     const c = /* @__PURE__ */ new WeakMap, a = W(n => {
         const r = [];
@@ -437,21 +433,21 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, p: c, t: a, m:
     });
     return {
         G(c) {
-            const f = p(c), u = w(f), d = o = f.scrollingElement, h = t && "rtl" === getComputedStyle(d).direction, g = (e, t, o, n, r = 0) => {
+            const f = p(c), u = m(f), d = o = f.scrollingElement, h = t && "rtl" === getComputedStyle(d).direction, g = (e, t, o, n, r = 0) => {
                 const s = n ? "offsetLeft" : "offsetTop", l = r + (h ? t.clientWidth - e[s] - e.offsetWidth : e[s]), i = e.offsetParent;
                 return e !== o && i ? g(i, t, o, n, l) : l;
-            }, $ = s = () => g(c, d, f.body, t), m = l = () => {
+            }, $ = s = () => g(c, d, f.body, t), w = l = () => {
                 e.A(4, d[t ? "clientWidth" : "clientHeight"]);
             };
-            u.addEventListener("resize", m), a.Y(d), r = () => {
-                u.removeEventListener("resize", m);
-            }, n = H(e, u, d, t, h, null, $), i[1](!0);
+            u.addEventListener("resize", w), a.j(d), r = () => {
+                u.removeEventListener("resize", w);
+            }, n = A(e, u, d, t, h, null, $), i[1](!0);
         },
-        v() {
-            r && r(), a.J(), n && n.J(), i[1](!1), i = g();
+        I() {
+            r && r(), a.D(), n && n.D(), i[1](!1), i = g();
         },
-        K: (e, t) => (c.set(e, t), a.Y(e), () => {
-            c.delete(e), a.j(e);
+        K: (e, t) => (c.set(e, t), a.j(e), () => {
+            c.delete(e), a.J(e);
         }),
         async N(e, t) {
             await i[0] && n.F(e, t);
@@ -461,7 +457,7 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, p: c, t: a, m:
         },
         ee: () => s()
     };
-}, D = (e, t) => {
+}, B = (e, t) => {
     let o, n, r, s = g();
     const l = /* @__PURE__ */ new WeakMap, i = /* @__PURE__ */ new WeakMap, c = W(n => {
         const r = [], s = [];
@@ -478,8 +474,8 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, p: c, t: a, m:
         },
         G(l) {
             const i = o = l.parentElement;
-            c.Y(i);
-            const a = (e, t) => H(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
+            c.j(i);
+            const a = (e, t) => A(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
                 const e = t ? "overflowX" : "overflowY", o = i.style, n = o[e];
                 o[e] = "hidden", u(() => {
                     o[e] = n;
@@ -487,11 +483,11 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, p: c, t: a, m:
             });
             n = a(e, !1), r = a(t, !0), s[1](!0);
         },
-        v() {
-            c.J(), n && n.J(), r && r.J(), s[1](!1), s = g();
+        I() {
+            c.D(), n && n.D(), r && r.D(), s[1](!1), s = g();
         },
-        K: (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);
+        K: (e, t, o) => (null != t && l.set(e, t), null != o && i.set(e, o), c.j(e), () => {
+            l.delete(e), i.delete(e), c.J(e);
         }),
         Z() {
             n && n.U(), r && r.U();
@@ -500,8 +496,8 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, p: c, t: a, m:
 }, V = (e, t) => {
     e.N(() => t);
 }, X = (e, t, o, {align: n, smooth: r, offset: s = 0} = {}) => {
-    if (o = a(o, 0, t.T() - 1), "nearest" === n) {
-        const e = t.u(o), r = t.M();
+    if (o = a(o, 0, t.M() - 1), "nearest" === n) {
+        const e = t.u(o), r = t.C();
         if (e < r) n = "start"; else {
             if (!(e + t.h(o) > r + t.o())) return;
             n = "end";
@@ -509,12 +505,12 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, p: c, t: a, m:
     }
     e.N(() => s + e.ee() + t.u(o) + ("end" === n ? t.h(o) - t.o() : "center" === n ? (t.h(o) - t.o()) / 2 : 0), r);
 }, Y = (e, t, o, n, r, i, c) => {
-    const f = t.T(), u = o.B(), d = o.D();
+    const f = t.M(), u = o.V(), d = o.X();
     r = a(r, 0, f - 1);
-    const h = T(n, u, d), g = M(h, r, d), $ = g < 0 ? -1 : h[g], p = () => o.u(u) + ($ < 0 || $ === r ? 0 : o.u($ + 1) - o.u($)), w = () => o.u(f) - o.u(d);
+    const h = R(n, u, d), g = T(h, r, d), $ = g < 0 ? -1 : h[g], p = () => o.u(u) + ($ < 0 || $ === r ? 0 : o.u($ + 1) - o.u($)), m = () => o.u(f) - o.u(d);
     if ("nearest" === i) {
         if (r < u || r >= d) return;
-        const e = p(), o = t.M() + e, n = t.o() - e - w(), c = t.h(r);
+        const e = p(), o = t.C() + e, n = t.o() - e - m(), c = t.h(r);
         let a = t.u(r);
         if ($ === r) {
             const e = (g + 1 < h.length ? h[g + 1] : d) - 1;
@@ -526,23 +522,23 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, p: c, t: a, m:
         }
     }
     e.N(c, () => {
-        const e = p(), o = t.h(r) - (t.o() - e - w());
+        const e = p(), o = t.h(r) - (t.o() - e - m());
         return t.u(r) - e + ("end" === i ? o : "center" === i ? o / 2 : 0);
     });
-}, j = $ ? e.useLayoutEffect : e.useEffect, J = "current", U = (e, t) => {
-    if (Array.isArray(e)) for (const o of e) U(o, t); else null == e || "boolean" == typeof e || t.push(e);
-}, F = (e, t) => {
+}, j = $ ? e.useLayoutEffect : e.useEffect, J = "current", D = (e, t) => {
+    if (Array.isArray(e)) for (const o of e) D(o, t); else null == e || "boolean" == typeof e || t.push(e);
+}, U = (e, t) => {
     const o = e.key;
     return null != o ? o : "_" + t;
-}, G = t => {
+}, F = t => {
     const o = (0, e.useRef)(null);
     return o.current || (o.current = t());
-}, K = t => {
+}, G = t => {
     const o = (0, e.useRef)(t);
     return j(() => {
         o[J] = t;
     }, [ t ]), o;
-}, N = /*#__PURE__*/ /*#__PURE__*/ (0, e.memo)(({te: o, oe: n, ne: r, re: s, se: l, le: i, ie: c, ce: a}) => {
+}, K = /*#__PURE__*/ /*#__PURE__*/ (0, e.memo)(({te: o, oe: n, ne: r, re: s, se: l, le: i, ie: c, ce: a}) => {
     const f = (0, e.useRef)(null);
     j(() => n(f[J], r), [ r ]);
     const u = (0, e.useMemo)(() => {
@@ -566,55 +562,56 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, p: c, t: a, m:
         index: r,
         children: o
     });
-}), Q = (t, o) => (0, e.useMemo)(() => {
+}), N = (t, o) => (0, e.useMemo)(() => {
     if ("function" == typeof t) return [ e => t(o[e], e), o.length ];
     const e = (e => {
         const t = [];
-        return U(e, t), t;
+        return D(e, t), t;
     })(t);
     return [ t => e[t], e.length ];
-}, [ t, o ]), Z = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: n, data: r, bufferSize: s, itemSize: l, shift: i, horizontal: c, keepMounted: a, cache: u, startMargin: d = 0, ssrCount: g, as: $ = "div", item: p = "div", scrollRef: w, onScroll: m, onScrollEnd: v}, z) => {
-    const [x, I] = Q(n, r), b = (0, e.useRef)(null), k = (0, e.useRef)(!!g), R = K(m), T = K(v), [M, C, O, E] = G(() => {
-        const e = !!c, t = y(I, l, u), o = _(t, g);
-        return [ o, t, P(o, e), e ];
+}, [ t, o ]), Q = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: n, data: r, bufferSize: s, itemSize: l, shift: i, horizontal: c, keepMounted: a, cache: u, startMargin: d = 0, ssrCount: g, as: $ = "div", item: p = "div", scrollRef: m, onScroll: w, onScrollEnd: v}, z) => {
+    "use no memo";
+    const [x, b] = N(n, r), I = (0, e.useRef)(null), k = (0, e.useRef)(!!g), R = G(w), T = G(v), [M, C, O, E] = F(() => {
+        const e = !!c, t = y(b, l, u), o = _(t, g);
+        return [ o, t, H(o, e), e ];
     });
-    I !== M.T() && M.A(5, [ I, i ]), d !== M.O() && M.A(6, d);
-    const [L, q] = (0, e.useReducer)(M.I, void 0, M.I), A = M.C(), W = M.t(), H = [], B = e => {
+    b !== M.M() && M.A(5, [ b, i ]), d !== M.L() && M.A(6, d);
+    const [L, q] = (0, e.useReducer)(M.k, void 0, M.k), W = M.O(), A = M.t(), P = [], B = e => {
         const o = x(e);
         /* @__PURE__ */ /* @__PURE__ */
-        return (0, t.jsx)(N, {
+        return (0, t.jsx)(K, {
             oe: O.K,
             ne: e,
             re: M.u(e),
-            se: M.R(e),
+            se: M.T(e),
             le: p,
             te: o,
             ie: E,
             ce: k[J]
-        }, F(o, e));
+        }, U(o, e));
     };
     if (j(() => {
-        k[J] = !1, M.q(1, e => {
+        k[J] = !1, M.W(1, e => {
             e ? (0, o.flushSync)(q) : q();
-        }), M.q(4, () => {
-            R.current && R.current(M.M());
-        }), M.q(8, () => {
+        }), M.W(4, () => {
+            R.current && R.current(M.C());
+        }), M.W(8, () => {
             T.current && T.current();
         });
-        const e = b[J];
-        return w ? h(() => {
-            w.current && O.G(e, w[J]);
+        const e = I[J];
+        return m ? h(() => {
+            m.current && O.G(e, m[J]);
         }) : O.G(e), () => {
-            M.v(), O.v();
+            M.I(), O.I();
         };
     }, []), j(() => {
         O.Z();
     }, [ L ]), (0, e.useImperativeHandle)(z, () => ({
         get cache() {
-            return C.W();
+            return C.H();
         },
         get scrollOffset() {
-            return M.M();
+            return M.C();
         },
         get scrollSize() {
             return S(M);
@@ -622,36 +619,36 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, p: c, t: a, m:
         get viewportSize() {
             return M.o();
         },
-        findItemIndex: M.k,
+        findItemIndex: M.R,
         getItemOffset: M.u,
         getItemSize: M.h,
         scrollToIndex: (e, t) => X(O, M, e, t),
         scrollTo: e => V(O, e),
         scrollBy: e => ((e, t, o) => {
-            V(e, o + t.M());
+            V(e, o + t.C());
         })(O, M, e)
     }), []), a) {
         const e = new Set(a);
         for (let [t, o] = M.l(s); t <= o; t++) e.add(t);
         f([ ...e ]).forEach(e => {
-            e < I && H.push(B(e));
+            e < b && P.push(B(e));
         });
-    } else for (let [e, t] = M.l(s); e <= t; e++) H.push(B(e));
+    } else for (let [e, t] = M.l(s); e <= t; e++) P.push(B(e));
     /* @__PURE__ */ /* @__PURE__ */
     return (0, t.jsx)($, {
-        ref: b,
+        ref: I,
         style: {
             contain: "size style",
             overflowAnchor: "none",
             flex: "none",
             position: "relative",
-            width: E ? W : "100%",
-            height: E ? "100%" : W,
-            pointerEvents: A ? "none" : void 0
+            width: E ? A : "100%",
+            height: E ? "100%" : A,
+            pointerEvents: W ? "none" : void 0
         },
-        children: H
+        children: P
     });
-}), ee = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: e, data: o, bufferSize: n, itemSize: r, shift: s, horizontal: l, keepMounted: i, cache: c, ssrCount: a, item: f, onScroll: u, onScrollEnd: d, style: h, ...g}, $) => /* @__PURE__ */ /* @__PURE__ */ (0, 
+}), Z = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: e, data: o, bufferSize: n, itemSize: r, shift: s, horizontal: l, keepMounted: i, cache: c, ssrCount: a, item: f, onScroll: u, onScrollEnd: d, style: h, ...g}, $) => /* @__PURE__ */ /* @__PURE__ */ (0, 
 t.jsx)("div", {
     ...g,
     style: {
@@ -662,7 +659,7 @@ t.jsx)("div", {
         height: "100%",
         ...h
     },
-    children: /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(Z, {
+    children: /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(Q, {
         ref: $,
         data: o,
         bufferSize: n,
@@ -677,54 +674,55 @@ t.jsx)("div", {
         onScrollEnd: d,
         children: e
     })
-})), te = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: n, data: r, bufferSize: s, itemSize: l, shift: i, horizontal: c, cache: a, ssrCount: f, as: u = "div", item: d = "div", onScroll: h, onScrollEnd: g}, $) => {
-    const [p, w] = Q(n, r), m = (0, e.useRef)(null), S = K(h), v = K(g), z = (0, e.useRef)(!!f), [x, I, b, k] = G(() => {
-        const e = !!c, t = y(w, l, a), o = _(t, f);
-        return [ o, t, B(o, e), e ];
+})), ee = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: n, data: r, bufferSize: s, itemSize: l, shift: i, horizontal: c, cache: a, ssrCount: f, as: u = "div", item: d = "div", onScroll: h, onScrollEnd: g}, $) => {
+    "use no memo";
+    const [p, m] = N(n, r), w = (0, e.useRef)(null), S = G(h), v = G(g), z = (0, e.useRef)(!!f), [x, b, I, k] = F(() => {
+        const e = !!c, t = y(m, l, a), o = _(t, f);
+        return [ o, t, P(o, e), e ];
     });
-    w !== x.T() && x.A(5, [ w, i ]);
-    const [R, T] = (0, e.useReducer)(x.I, void 0, x.I), M = x.C(), C = x.t(), O = [];
-    j(() => (z[J] = !1, x.q(1, e => {
+    m !== x.M() && x.A(5, [ m, i ]);
+    const [R, T] = (0, e.useReducer)(x.k, void 0, x.k), M = x.O(), C = x.t(), O = [];
+    j(() => (z[J] = !1, x.W(1, e => {
         e ? (0, o.flushSync)(T) : T();
-    }), x.q(4, () => {
+    }), x.W(4, () => {
         S.current && S.current();
-    }), x.q(8, () => {
+    }), x.W(8, () => {
         v.current && v.current();
-    }), b.G(m[J]), () => {
-        x.v(), b.v();
+    }), I.G(w[J]), () => {
+        x.I(), I.I();
     }), []), j(() => {
-        b.Z();
+        I.Z();
     }, [ R ]), (0, e.useImperativeHandle)($, () => ({
         get cache() {
-            return I.W();
+            return b.H();
         },
         get scrollOffset() {
-            return x.M();
+            return x.C();
         },
         get viewportSize() {
             return x.o();
         },
-        findItemIndex: x.k,
+        findItemIndex: x.R,
         getItemOffset: x.u,
         getItemSize: x.h,
-        scrollToIndex: (e, t) => X(b, x, e, t)
+        scrollToIndex: (e, t) => X(I, x, e, t)
     }), []);
     for (let [e, o] = x.l(s); e <= o; e++) {
         const o = p(e);
-        O.push(/* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(N, {
-            oe: b.K,
+        O.push(/* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(K, {
+            oe: I.K,
             ne: e,
             re: x.u(e),
-            se: x.R(e),
+            se: x.T(e),
             le: d,
             te: o,
             ie: k,
             ce: z[J]
-        }, F(o, e)));
+        }, U(o, e)));
     }
     /* @__PURE__ */ /* @__PURE__ */
     return (0, t.jsx)(u, {
-        ref: m,
+        ref: w,
         style: {
             contain: "size style",
             overflowAnchor: "none",
@@ -736,7 +734,7 @@ t.jsx)("div", {
         },
         children: O
     });
-}), oe = /*#__PURE__*/ /*#__PURE__*/ (0, e.memo)(({ae: {fe: o, ue: n, de: r, he: s, ge: l, $e: i, pe: c, we: a}, te: f, me: u, Se: d, _e: h, oe: g}) => {
+}), te = /*#__PURE__*/ /*#__PURE__*/ (0, e.memo)(({ae: {fe: o, ue: n, de: r, he: s, ge: l, $e: i, pe: c, me: a}, te: f, we: u, Se: d, _e: h, oe: g}) => {
     const $ = (0, e.useRef)(null);
     return j(() => {
         if (null != s || null != l) return g($[J], s, l);
@@ -753,35 +751,36 @@ t.jsx)("div", {
             colIndex: o
         })
     });
-}), ne = /*#__PURE__*/ /*#__PURE__*/ (0, e.memo)(({ae: {ve: e, ze: o, we: n}, te: r, me: s, ye: l, oe: i}) => /* @__PURE__ */ /* @__PURE__ */ (0, 
+}), oe = /*#__PURE__*/ /*#__PURE__*/ (0, e.memo)(({ae: {ve: e, ze: o, me: n}, te: r, we: s, ye: l, oe: i}) => /* @__PURE__ */ /* @__PURE__ */ (0, 
 t.jsx)("div", {
     role: "row",
     "aria-rowindex": e + 1,
     style: n,
-    children: o.map(o => /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(oe, {
+    children: o.map(o => /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(te, {
         ae: o,
         te: r,
-        me: s,
-        Se: I(l, o.fe),
+        we: s,
+        Se: b(l, o.fe),
         _e: e,
         oe: i
     }, o.fe))
-})), re = ({ae: {xe: e, we: o}, te: n, Ie: r, ye: s, oe: l}) => /* @__PURE__ */ /* @__PURE__ */ (0, 
+})), ne = ({ae: {xe: e, me: o}, te: n, be: r, ye: s, oe: l}) => /* @__PURE__ */ /* @__PURE__ */ (0, 
 t.jsx)("div", {
     role: "rowgroup",
     style: o,
-    children: e.map(e => /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(ne, {
+    children: e.map(e => /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(oe, {
         ae: e,
         te: n,
-        me: I(r, e.ve),
+        we: b(r, e.ve),
         ye: s,
         oe: l
     }, e.ve))
-}), se = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: n, rows: i, cols: c, rowHeight: u, colWidth: d, headerRows: h, sectionRows: g, footerRows: $, headerCols: p, footerCols: w, spans: m, keepMounted: v, bufferSize: z, gap: y = 0, ariaSort: x, onVerticalScroll: C, onHorizontalScroll: W, onScrollEnd: H, style: P, ...B}, V) => {
-    const X = (0, e.useRef)(null), U = K(C), F = K(W), N = K(H), [Q, Z, ee, te, oe] = G(() => {
-        const e = b(i, u, y), t = b(c, d, y), o = _(e), n = _(t);
-        return [ o, n, e, t, D(o, n) ];
-    }), se = (0, e.useMemo)(() => ee.V(i, u), [ i, u ]), le = (0, e.useMemo)(() => te.V(c, d), [ c, d ]), ie = (0, 
+}), re = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: n, rows: i, cols: c, rowHeight: u, colWidth: d, headerRows: h, sectionRows: g, footerRows: $, headerCols: p, footerCols: m, spans: w, keepMounted: v, bufferSize: z, gap: y = 0, ariaSort: M, onVerticalScroll: W, onHorizontalScroll: A, onScrollEnd: H, style: P, ...V}, X) => {
+    "use no memo";
+    const D = (0, e.useRef)(null), U = G(W), K = G(A), N = G(H), [Q, Z, ee, te, re] = F(() => {
+        const e = I(i, u, y), t = I(c, d, y), o = _(e), n = _(t);
+        return [ o, n, e, t, B(o, n) ];
+    }), se = (0, e.useMemo)(() => ee.Y(i, u), [ i, u ]), le = (0, e.useMemo)(() => te.Y(c, d), [ c, d ]), ie = (0, 
     e.useMemo)(() => ((e = r) => {
         const t = /* @__PURE__ */ new Map;
         for (const o of e) {
@@ -792,77 +791,79 @@ t.jsx)("div", {
             }
         }
         return t;
-    })(m), [ m ]);
-    k(Q, ee, i, se, h, $), k(Z, te, c, le, p, w);
-    const ce = () => Q.I() + Z.I(), [ae, fe] = (0, e.useReducer)(ce, void 0, ce), ue = Q.C() || Z.C(), de = Q.u(0), he = Z.u(0), ge = Q.T(), $e = Z.T(), pe = ((e, t, [o, n], [i, c], u, d = r, h = r, g) => {
-        const $ = e.m(), p = t.m(), w = e.B(), m = e.D(), S = t.B(), _ = t.D();
-        o = a(o, w, m), n = s(n, m - 1), i = a(i, S, _), c = s(c, _ - 1);
-        const v = T(d, w, m), z = l(S - 1, 0), y = [], x = [], I = [];
-        for (const e of h) e.rowIndex < $ && e.colIndex < p && (I.push(e), y.push(e.rowIndex));
-        const b = I.length, k = M(v, o, m), C = k < 0 ? -1 : v[k];
-        C >= 0 && y.push(C);
-        const W = O(f(y), $, w, o, n, m);
-        for (let e = 0; e < W.length; e++) for (const t of u.get(W[e]) || r) {
-            const {rowIndex: r, colIndex: a} = t, f = E(t, $), u = L(t, p);
-            if ((e < 1 || W[e - 1] < r) && a < p && (f - r > 1 || u - a > 1)) {
-                let e = (r < w || l(r, o) < s(f, n + 1) || m < f || C >= r && C < f) && (a < S || l(a, i) < s(u, c + 1) || _ < u);
-                for (let t = 0; !e && t < b; t++) {
-                    const o = I[t];
+    })(w), [ w ]);
+    ee.B(h, $), te.B(p, m);
+    const ce = x(i), ae = x(c);
+    ce !== Q.M() && Q.A(5, [ ce ]), ae !== Z.M() && Z.A(5, [ ae ]), Q.A(9, se), Z.A(9, le);
+    const fe = () => Q.k() + Z.k(), [ue, de] = (0, e.useReducer)(fe, void 0, fe), he = Q.O() || Z.O(), ge = Q.u(0), $e = Z.u(0), pe = Q.M(), me = Z.M(), we = ((e, t, [o, n], [i, c], u, d = r, h = r, g) => {
+        const $ = e.p(), p = t.p(), m = e.V(), w = e.X(), S = t.V(), _ = t.X();
+        o = a(o, m, w), n = s(n, w - 1), i = a(i, S, _), c = s(c, _ - 1);
+        const v = R(d, m, w), z = l(S - 1, 0), y = [], x = [], b = [];
+        for (const e of h) e.rowIndex < $ && e.colIndex < p && (b.push(e), y.push(e.rowIndex));
+        const I = b.length, M = T(v, o, w), W = M < 0 ? -1 : v[M];
+        W >= 0 && y.push(W);
+        const A = C(f(y), $, m, o, n, w);
+        for (let e = 0; e < A.length; e++) for (const t of u.get(A[e]) || r) {
+            const {rowIndex: r, colIndex: a} = t, f = O(t, $), u = E(t, p);
+            if ((e < 1 || A[e - 1] < r) && a < p && (f - r > 1 || u - a > 1)) {
+                let e = (r < m || l(r, o) < s(f, n + 1) || w < f || W >= r && W < f) && (a < S || l(a, i) < s(u, c + 1) || _ < u);
+                for (let t = 0; !e && t < I; t++) {
+                    const o = b[t];
                     e = o.rowIndex >= r && o.rowIndex < f && o.colIndex >= a && o.colIndex < u;
                 }
-                e && I.push(t);
+                e && b.push(t);
             }
         }
-        for (const {rowIndex: e, colIndex: t} of I) {
-            const o = M(v, e, m);
+        for (const {rowIndex: e, colIndex: t} of b) {
+            const o = T(v, e, w);
             y.push(e), o >= 0 && y.push(v[o]), x.push(t);
         }
         f(y), f(x);
-        const H = O(y, $, w, o, n, m), P = O(x, p, S, i, c, _), B = H.length, D = P.length, V = /* @__PURE__ */ new Map, X = [], Y = [];
-        for (const e of I) {
-            const t = E(e, $), o = L(e, p);
-            X.push(t), Y.push(o);
+        const H = C(y, $, m, o, n, w), P = C(x, p, S, i, c, _), B = H.length, V = P.length, X = /* @__PURE__ */ new Map, Y = [], j = [];
+        for (const e of b) {
+            const t = O(e, $), o = E(e, p);
+            Y.push(t), j.push(o);
             const n = P.indexOf(e.colIndex);
             for (let r = H.indexOf(e.rowIndex); r < B && H[r] < t; r++) {
                 const t = H[r] * p;
-                for (let r = n; r < D && P[r] < o; r++) V.set(t + P[r], e);
+                for (let r = n; r < V && P[r] < o; r++) X.set(t + P[r], e);
             }
         }
-        const j = [];
-        for (const e of P) j.push(!t.H(e) && null);
-        const J = [], U = e.u(w), F = [];
+        const J = [];
+        for (const e of P) J.push(!t.P(e) && null);
+        const D = [], U = e.u(m), F = [];
         let G = F;
-        const K = R.get(e), N = /* @__PURE__ */ new Map;
+        const K = k.get(e), N = /* @__PURE__ */ new Map;
         for (const r of H) {
-            const s = r < w, a = r >= m, f = M(v, r, m), u = s ? 0 : a ? m : f < 0 ? -1 : v[f];
+            const s = r < m, a = r >= w, f = T(v, r, w), u = s ? 0 : a ? w : f < 0 ? -1 : v[f];
             if (r === u) {
-                const e = s ? w : a ? $ : f + 1 < v.length ? v[f + 1] : m;
-                X.push(e);
+                const e = s ? m : a ? $ : f + 1 < v.length ? v[f + 1] : w;
+                Y.push(e);
                 const t = [];
                 F.push({
-                    be: s ? -1 : a ? -2 : -3 - u,
+                    Ie: s ? -1 : a ? -2 : -3 - u,
                     xe: t,
-                    we: A(u, e, s || a ? 0 : null, a ? "bottom" : "top", 4)
+                    me: q(u, e, s || a ? 0 : null, a ? "bottom" : "top", 4)
                 }), G = t;
             } else u < 0 && (G = F);
-            const d = f >= 0 && r === u, h = s || a || r === C || r >= o && r <= n, y = d ? U : null, x = r * p, I = K && K.get(r), b = I && I.ze, k = [];
-            let R = 0, T = !e.H(r) && null, O = r + 1, q = !1;
-            for (let e = 0; e < D; e++) {
-                const o = P[e], n = o < S, a = o >= _, f = n || a || o >= i && o <= c, u = V.get(x + o);
+            const d = f >= 0 && r === u, h = s || a || r === W || r >= o && r <= n, y = d ? U : null, x = r * p, b = K && K.get(r), I = b && b.ze, k = [];
+            let R = 0, M = !e.P(r) && null, C = r + 1, L = !1;
+            for (let e = 0; e < V; e++) {
+                const o = P[e], n = o < S, a = o >= _, f = n || a || o >= i && o <= c, u = X.get(x + o);
                 if (u ? u.rowIndex === r && u.colIndex === o : h && f) {
-                    const i = u ? E(u, $) : r + 1, c = u ? L(u, p) : o + 1, f = i - r, h = c - o, w = f > 1, m = h > 1, S = w || m;
+                    const i = u ? O(u, $) : r + 1, c = u ? E(u, p) : o + 1, f = i - r, h = c - o, m = f > 1, w = h > 1, S = m || w;
                     let _, v;
-                    O = l(O, i);
+                    C = l(C, i);
                     const y = n ? t.u(o) : null, x = a ? t.u(p) - t.u(c) : null;
-                    !1 !== T || w || (_ = r, T = !0), !1 !== j[e] || m || (v = o, j[e] = !0);
-                    const I = s ? "columnheader" : o === z && (n || d) ? "rowheader" : "cell", M = S ? f : void 0, C = S ? h : void 0, A = "cell" !== I && g && g.rowIndex === r && g.colIndex === o ? g.order : void 0;
-                    let W;
-                    if (b) {
-                        const e = b.length;
-                        for (;R < e && b[R].fe < o; ) R++;
-                        R < e && b[R].fe === o && (W = b[R]);
+                    !1 !== M || m || (_ = r, M = !0), !1 !== J[e] || w || (v = o, J[e] = !0);
+                    const b = s ? "columnheader" : o === z && (n || d) ? "rowheader" : "cell", T = S ? f : void 0, q = S ? h : void 0, W = "cell" !== b && g && g.rowIndex === r && g.colIndex === o ? g.order : void 0;
+                    let A;
+                    if (I) {
+                        const e = I.length;
+                        for (;R < e && I[R].fe < o; ) R++;
+                        R < e && I[R].fe === o && (A = I[R]);
                     }
-                    if (!W || W.ue !== M || W.de !== C || W.ke !== y || W.Re !== x || W.he !== _ || W.ge !== v || W.$e !== I || W.pe !== A) {
+                    if (!A || A.ue !== T || A.de !== q || A.ke !== y || A.Re !== x || A.he !== _ || A.ge !== v || A.$e !== b || A.pe !== W) {
                         let e = "1/l" + o;
                         S && (e += "/l" + i + "/l" + c);
                         const t = {
@@ -870,67 +871,67 @@ t.jsx)("div", {
                             display: "grid",
                             gridArea: e
                         };
-                        w && (t.height = "0px", t.minHeight = "100%", t.zIndex = 1), m && (t.width = "0px", 
+                        m && (t.height = "0px", t.minHeight = "100%", t.zIndex = 1), w && (t.width = "0px", 
                         t.minWidth = "100%"), (n || a) && (t[n ? "insetInlineStart" : "insetInlineEnd"] = (n ? y : x) + "px", 
-                        t.position = "sticky", t.zIndex = 2), W = {
+                        t.position = "sticky", t.zIndex = 2), A = {
                             fe: o,
-                            ue: M,
-                            de: C,
+                            ue: T,
+                            de: q,
                             he: _,
                             ge: v,
-                            $e: I,
-                            pe: A,
-                            we: t,
+                            $e: b,
+                            pe: W,
+                            me: t,
                             ke: y,
                             Re: x
-                        }, q = !0;
+                        }, L = !0;
                     }
-                    k.push(W);
+                    k.push(A);
                 }
             }
-            if (J.push(T), k.length) {
-                const e = I && !q && I.ze.length === k.length && I.Te === y ? I : {
+            if (D.push(M), k.length) {
+                const e = b && !L && b.ze.length === k.length && b.Te === y ? b : {
                     ve: r,
                     ze: k,
-                    we: A(r, O, y, "top", 3),
+                    me: q(r, C, y, "top", 3),
                     Te: y
                 };
                 N.set(r, e), G.push(e);
             }
         }
-        return R.set(e, N), {
-            Me: q(e, H, J, f(X), "max-content", $),
-            Ce: q(t, P, j, f(Y), "minmax(max-content,auto)", p),
+        return k.set(e, N), {
+            Me: L(e, H, D, f(Y), "max-content", $),
+            Ce: L(t, P, J, f(j), "minmax(max-content,auto)", p),
             Oe: F
         };
-    })(ee, te, Q.l(z), Z.l(z), ie, g, v, x), we = K(e => ((e, t, o, n, s, l = r, {rowIndex: i, colIndex: c, rowAlign: a, colAlign: f}) => {
+    })(ee, te, Q.l(z), Z.l(z), ie, g, v, M), Se = G(e => ((e, t, o, n, s, l = r, {rowIndex: i, colIndex: c, rowAlign: a, colAlign: f}) => {
         null != i && Y(e, t, n, l, i, a, !1), null != c && Y(e, o, s, r, c, f, !0);
-    })(oe, Q, Z, ee, te, g, e));
+    })(re, Q, Z, ee, te, g, e));
     return j(() => {
         const e = e => {
-            e ? (0, o.flushSync)(fe) : fe();
+            e ? (0, o.flushSync)(de) : de();
         };
-        Q.q(1, e), Z.q(1, e);
+        Q.W(1, e), Z.W(1, e);
         let t = !1;
-        Q.q(4, () => {
-            t = !0, U.current && U.current(Q.M());
-        }), Z.q(4, () => {
-            t = !0, F.current && F.current(Z.M());
+        Q.W(4, () => {
+            t = !0, U.current && U.current(Q.C());
+        }), Z.W(4, () => {
+            t = !0, K.current && K.current(Z.C());
         });
         const n = () => {
-            !t || Q.C() || Z.C() || (t = !1, N.current && N.current());
+            !t || Q.O() || Z.O() || (t = !1, N.current && N.current());
         };
-        return Q.q(8, n), Z.q(8, n), oe.G(X[J]), () => {
-            Q.v(), Z.v(), oe.v();
+        return Q.W(8, n), Z.W(8, n), re.G(D[J]), () => {
+            Q.I(), Z.I(), re.I();
         };
     }, []), j(() => {
-        oe.Z();
-    }, [ ae ]), (0, e.useImperativeHandle)(V, () => ({
+        re.Z();
+    }, [ ue ]), (0, e.useImperativeHandle)(X, () => ({
         get verticalScrollOffset() {
-            return Q.M();
+            return Q.C();
         },
         get horizontalScrollOffset() {
-            return Z.M();
+            return Z.C();
         },
         get scrollHeight() {
             return S(Q);
@@ -944,31 +945,31 @@ t.jsx)("div", {
         get viewportWidth() {
             return Z.o();
         },
-        findRowIndex: Q.k,
-        findColIndex: Z.k,
+        findRowIndex: Q.R,
+        findColIndex: Z.R,
         getRowOffset: Q.u,
         getColOffset: Z.u,
         getRowSize: Q.h,
         getColSize: Z.h,
-        scrollToIndex: e => we[J](e),
+        scrollToIndex: e => Se[J](e),
         scrollTo: ({vertical: e, horizontal: t}) => ((e, t, o) => {
             null != t && e.N(!1, () => t), null != o && e.N(!0, () => o);
-        })(oe, e, t),
+        })(re, e, t),
         scrollBy: ({vertical: e, horizontal: t}) => ((e, t, o, n, r) => {
             if (null != n) {
-                const o = n + t.M();
+                const o = n + t.C();
                 e.N(!1, () => o);
             }
             if (null != r) {
-                const t = r + o.M();
+                const t = r + o.C();
                 e.N(!0, () => t);
             }
-        })(oe, Q, Z, e, t)
+        })(re, Q, Z, e, t)
     }), []), /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)("div", {
         role: "table",
-        "aria-rowcount": ge,
-        "aria-colcount": $e,
-        ...B,
+        "aria-rowcount": pe,
+        "aria-colcount": me,
+        ...V,
         style: {
             overflow: "auto",
             contain: "strict",
@@ -977,36 +978,36 @@ t.jsx)("div", {
             ...P
         },
         children: /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)("div", {
-            ref: X,
+            ref: D,
             style: {
                 contain: "size style",
                 overflowAnchor: "none",
                 flex: "none",
                 display: "grid",
-                gridTemplateRows: pe.Me,
-                gridTemplateColumns: pe.Ce,
+                gridTemplateRows: we.Me,
+                gridTemplateColumns: we.Ce,
                 gap: y,
-                marginTop: de,
-                marginInlineStart: he,
-                height: S(Q) - de,
-                pointerEvents: ue ? "none" : void 0
+                marginTop: ge,
+                marginInlineStart: $e,
+                height: S(Q) - ge,
+                pointerEvents: he ? "none" : void 0
             },
-            children: pe.Oe.map(e => "xe" in e ? /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(re, {
+            children: we.Oe.map(e => "xe" in e ? /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(ne, {
                 ae: e,
                 te: n,
-                Ie: i,
+                be: i,
                 ye: c,
-                oe: oe.K
-            }, e.be) : /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(ne, {
+                oe: re.K
+            }, e.Ie) : /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(oe, {
                 ae: e,
                 te: n,
-                me: I(i, e.ve),
+                we: b(i, e.ve),
                 ye: c,
-                oe: oe.K
+                oe: re.K
             }, e.ve))
         })
     });
 });
 
-exports.VGrid = se, exports.VList = ee, exports.Virtualizer = Z, exports.WindowVirtualizer = te;
+exports.VGrid = re, exports.VList = Z, exports.Virtualizer = Q, exports.WindowVirtualizer = ee;
 //# sourceMappingURL=index.cjs.map