virtua 0.53.1 → 0.53.2

package/lib/index.cjs

@@ -14,103 +14,100 @@ var n, r = [], {min: s, max: l, abs: i, floor: c} = Math, f = (e, t, o) => s(o,
         e = t;
     }), 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: f, m: a, S: u, _: d, v: h}, g = 0) => {
-    let $ = !!g, p = 1, m = 0, S = 0, _ = 0, v = 0, z = 0, y = 0, x = 0, I = 0, b = null, k = [ 0, $ ? l(g - 1, 0) : -1 ], T = !1;
-    const R = /* @__PURE__ */ new Set, O = () => _ - S, M = () => O() + z + v, E = e => o(e) - z, C = e => {
-        if (2 === I) return !0;
-        if (b && 1 === I) return e < b[0];
-        const t = O(), o = E(e), r = n(e);
-        return 1 !== x && 0 === I ? o + r <= t : o < t && o + r < t + m;
-    }, L = e => {
-        e && (w() && 0 !== x || b && 1 === I ? z += e : v += e);
+n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, t: r, $: c, p: f, m: a, S: u}, d = 0) => {
+    let h = !!d, g = 1, $ = 0, p = 0, m = 0, S = 0, _ = 0, v = 0, z = 0, y = 0, x = null, b = [ 0, h ? l(d - 1, 0) : -1 ], I = !1;
+    const R = /* @__PURE__ */ new Set, k = () => m - p, T = () => k() + _ + S, O = e => t(e) - _, M = e => {
+        if (2 === y) return !0;
+        if (x && 1 === y) return e < x[0];
+        const t = k(), n = O(e), r = o(e);
+        return 1 !== z && 0 === y ? n + r <= t : n < t && n + r < t + $;
+    }, E = e => {
+        e && (w() && 0 !== z || x && 1 === y ? _ += e : S += e);
     };
     return {
-        I: () => {
+        _: () => {
             R.clear();
         },
-        k: () => p,
+        v: () => g,
         l: (t = 200) => {
-            if (!T || $) return k;
+            if (!I || h) return b;
             let o, n;
-            if (y) [o, n] = k; else {
-                let r = l(0, M()), 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)), 
-                b && (o = s(o, b[0]), n = l(n, b[1]));
+            if (v) [o, n] = b; else {
+                let r = l(0, T()), i = r + $;
+                a() || (t = l(0, t), 1 !== z && (r -= t), 2 !== z && (i += t)), [o, n] = b = e(l(0, r), l(0, i)), 
+                x && (o = s(o, x[0]), n = l(n, x[1]));
             }
-            return [ l(o, 0), s(n, f() - 1) ];
+            return [ l(o, 0), s(n, c() - 1) ];
         },
-        T: e => t(e - S),
-        R: r,
-        u: E,
-        h: n,
-        O: f,
-        M: () => _,
-        C: () => 0 !== x,
-        o: () => m,
-        L: () => S,
-        t: c,
-        q: () => (y = v, v = 0, [ y, 2 === I ]),
-        A: (e, t) => {
+        I: n,
+        i: O,
+        u: o,
+        R: c,
+        k: () => m,
+        T,
+        O: () => 0 !== z,
+        o: () => $,
+        M: () => p,
+        t: r,
+        C: () => (v = S, S = 0, [ v, 2 === y ]),
+        L: (e, t) => {
             const o = [ e, t ];
             return R.add(o), () => {
                 R.delete(o);
             };
         },
-        W: (t, o) => {
-            let n, s, l = 0;
+        q: (t, o) => {
+            let s, l, c = 0;
             switch (t) {
               case 1:
                 {
-                    if (o === _ && 0 === I) break;
-                    const e = y;
-                    y = 0;
-                    const t = o - _, n = i(t);
-                    e && n < i(e) + 1 || 0 !== I || (x = t < 0 ? 2 : 1), $ && ($ = !1), _ = o, l = 4;
-                    const r = O();
-                    r >= -m && r <= c() && (l += 1, s = n > m);
+                    if (o === m && 0 === y) break;
+                    const e = v;
+                    v = 0;
+                    const t = o - m, n = i(t);
+                    e && n < i(e) + 1 || 0 !== y || (z = t < 0 ? 2 : 1), h && (h = !1), m = o, c = 4;
+                    const s = k();
+                    s >= -$ && s <= r() && (c += 1, l = n > $);
                     break;
                 }
 
               case 2:
-                l = 8, 0 !== x && (n = !0, l += 1), x = 0, I = 0, b = null;
+                c = 8, 0 !== z && (s = !0, c += 1), z = 0, y = 0, x = null;
                 break;
 
               case 3:
                 {
-                    const e = o.filter(([e, t]) => !r(e, t));
+                    const e = o.filter(([e, t]) => !n(e, t));
                     if (!e.length) break;
-                    L(d(e, C, M(), m)), l = 3, s = !0;
+                    E(u(e, M, T(), $)), c = 3, l = !0;
                     break;
                 }
 
               case 4:
-                m !== o && (m || (T = s = !0), m = o, l = 3);
+                $ !== o && ($ || (I = l = !0), $ = o, c = 3);
                 break;
 
               case 5:
-                o[1] ? (L(a(o[0], !0)), I = 2, l = 1) : (a(o[0]), l = 1);
+                o[1] ? (E(f(o[0], !0)), y = 2, c = 1) : (f(o[0]), c = 1);
                 break;
 
               case 6:
-                S = o;
+                p = o;
                 break;
 
               case 7:
-                I = 1;
+                y = 1;
                 break;
 
               case 9:
-                {
-                    const e = h(o, M());
-                    null != e && (L(e), l = 3);
-                    break;
-                }
+                null != o && (E(o), c = 3);
+                break;
 
               case 8:
-                b = e(o, o + m), l = 1;
+                x = e(o, o + $), c = 1;
             }
-            l && (p = 1 + (2147483647 & p), n && z && (v += z, z = 0), R.forEach(([e, t]) => {
-                l & e && t(s);
+            c && (g = 1 + (2147483647 & g), s && _ && (S += _, _ = 0), R.forEach(([e, t]) => {
+                c & e && t(l);
             }));
         }
     };
@@ -144,11 +141,11 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: f, m:
             return f = s(f, e - 1), $(f) <= t ? (r = z($, e, o, f), n = z($, e, t, f, r)) : (n = z($, e, t, void 0, f), 
             r = z($, e, o, n)), f = n, [ n, r ];
         },
-        i: t => z($, e, t),
-        u: $,
-        h: g,
-        $: (e, t = -1) => d[e] === t,
-        _: (t, o, f, u) => {
+        A: t => z($, e, t),
+        i: $,
+        u: g,
+        h: (e, t = -1) => d[e] === t,
+        S: (t, o, f, 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) {
@@ -163,49 +160,49 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: f, m:
             return h;
         },
         t: () => $(e),
-        p: () => e,
-        m: (t, o) => {
+        $: () => e,
+        p: (t, o) => {
             const l = t - e;
             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 ]
+        m: () => c,
+        W: () => [ 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 = i, $ = 0, p = 0, m = null;
-    const w = [], S = [], _ = [], y = e => i || !!_[e], I = () => {
+    const w = [], S = [], _ = [], y = e => i || !!_[e], b = () => {
         w.length || v(w, n);
-    }, b = e => {
+    }, I = e => {
         const t = w[e];
         return -1 === t ? u : t;
-    }, k = e => {
+    }, R = e => {
         if (!n) return 0;
         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 += b(t), S[++t] = o;
+        for (;t < e; ) o += I(t), S[++t] = o;
         return d = e, o;
-    }, T = (e, t) => {
+    }, k = (e, t) => {
         w[e] = t, d = s(e, d);
-    }, R = e => w.length ? z(k, n, e) : u ? f(c(e / u), 0, n - 1) : 0, O = () => s($, n), M = () => l(n - p, O()), E = e => (w.length ? b(e) : u) - o;
+    }, T = e => w.length ? z(R, n, e) : u ? f(c(e / u), 0, n - 1) : 0, O = () => s($, n), M = () => l(n - p, O()), E = e => (w.length ? I(e) : u) - o;
     return {
         l: (e, t) => {
-            const r = k(O()), s = k(n) - k(M()), i = e + (r ? r - o : 0);
-            return [ R(i), R(l(i, t - (s ? s - o : 0))) ];
+            const r = R(O()), s = R(n) - R(M()), i = e + (r ? r - o : 0);
+            return [ T(i), T(l(i, t - (s ? s - o : 0))) ];
         },
+        A: T,
         i: R,
-        u: k,
-        h: E,
-        _: (e, t, n, r) => {
+        u: E,
+        S: (e, t, n, r) => {
             let s = e.reduce((e, [o, n]) => y(o) && t(o) ? e + (n - E(o)) : e, 0);
-            for (const [t, n] of e) y(t) && (I(), h += -1 === w[t] ? n : n - E(t), T(t, n + o));
+            for (const [t, n] of e) y(t) && (b(), h += -1 === w[t] ? n : n - E(t), k(t, n + o));
             if (g && r && h > r) {
                 let e = 0;
-                const t = R(n + s), o = [];
+                const t = T(n + s), o = [];
                 w.forEach((n, r) => {
                     -1 !== n && (n && o.push(n), r < t && e++);
                 }), d = -1, a(o);
@@ -214,52 +211,52 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: f, m:
             }
             return s;
         },
-        $: (e, t = -1) => {
+        h: (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 => {
+        t: () => n ? R(n) - o : 0,
+        $: () => n,
+        p: e => {
             const t = e - n;
             return d = s(e - 1, d), n = e, w.length && (t > 0 ? v(w, t) : w.splice(t)), 0;
         },
-        S: () => g,
-        B: y,
-        P: (e = 0, t = 0) => {
+        m: () => g,
+        H: y,
+        B: (e = 0, t = 0) => {
             $ = e, p = t;
         },
-        Y: O,
+        P: O,
         V: M,
-        X: (e, t) => "number" == typeof t ? r ? t : null : r || i || "auto" === t ? null : e.map(e => null != e ? e[t] : null),
-        v: (e, t) => {
+        Y: (e, t) => "number" == typeof t ? r ? t : null : r || i || "auto" === t ? null : e.map(e => null != e ? e[t] : null),
+        X: (e, t) => {
             if (null == e) return;
             if ("number" == typeof e) {
                 const n = e + o;
                 if (n === u) return;
-                const r = R(t) * (n - u);
+                const r = T(t) * (n - u);
                 return u = n, r;
             }
             if (e === m && n === _.length) return;
-            m = e, _.length = n, I();
-            const r = R(t), s = k(r);
+            m = e, _.length = n, b();
+            const r = T(t), s = R(r);
             let l;
             for (let t = 0; t < n; t++) {
                 const n = e[t], r = "number" != typeof n;
                 if (!r || !_[t]) {
                     _[t] = r;
                     const e = r ? -1 : n + o;
-                    w[t] !== e && (T(t, e), l = !0);
+                    w[t] !== e && (k(t, e), l = !0);
                 }
             }
-            return l ? k(r) - s : void 0;
+            return l ? R(r) - s : void 0;
         }
     };
-}, k = /*#__PURE__*/ new WeakMap, T = (e, t, o) => {
+}, R = /*#__PURE__*/ new WeakMap, k = (e, t, o) => {
     const n = [];
     for (const r of e) r >= t && r < o && n.push(r);
     return a(n);
-}, R = (e, t, o) => {
+}, T = (e, t, o) => {
     if (t >= o) return -1;
     let n = 0, r = e.length;
     for (;n < r; ) {
@@ -292,8 +289,8 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: f, m:
         if (h === a) {
             g = a + 1;
             const t = o[u];
-            $ = null == t ? e.h(a) + "px" : t ? r : "minmax(" + e.h(a) + "px,auto)", u++;
-        } else g = s(h, d < c ? n[d] : l), $ = "minmax(" + (e.u(g - 1) + e.h(g - 1) - e.u(a)) + "px,auto)";
+            $ = null == t ? e.u(a) + "px" : t ? r : "minmax(" + e.u(a) + "px,auto)", u++;
+        } else g = s(h, d < c ? n[d] : l), $ = "minmax(" + (e.i(g - 1) + e.u(g - 1) - e.i(a)) + "px,auto)";
         f += " " + $ + " [l" + g + "]", a = g;
     }
     return f;
@@ -327,42 +324,42 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: f, m:
             behavior: t ? "smooth" : "instant"
         });
     }, x = () => {
-        if (a || g) return a = !1, void I();
-        $ = !1, e.W(2);
-    }, I = () => {
-        d(c), c = u(x, 150);
+        if (a || g) return a = !1, void b();
+        $ = !1, e.q(2);
     }, b = () => {
-        f = m(), $ && (p = !0), l && e.W(6, l()), e.W(1, z()), I();
-    }, k = t => {
-        if (a || !e.C() || t.ctrlKey) return;
+        d(c), c = u(x, 150);
+    }, I = () => {
+        f = m(), $ && (p = !0), l && e.q(6, l()), e.q(1, z()), b();
+    }, R = t => {
+        if (a || !e.O() || t.ctrlKey) return;
         const o = m() - f;
         150 > o && 50 < o && (n ? t.deltaX : t.deltaY) && (a = !0);
-    }, T = () => {
+    }, k = () => {
         g = !0, $ = p = !1;
-    }, R = () => {
+    }, T = () => {
         g = !1, w() && ($ = !0);
     };
-    return t.addEventListener("scroll", b), t.addEventListener("wheel", k, {
+    return t.addEventListener("scroll", I), t.addEventListener("wheel", R, {
         passive: !0
-    }), t.addEventListener("touchstart", T, {
+    }), t.addEventListener("touchstart", k, {
         passive: !0
-    }), t.addEventListener("touchend", R, {
+    }), t.addEventListener("touchend", T, {
         passive: !0
     }), {
-        G: b,
+        G: I,
         D: () => {
-            t.removeEventListener("scroll", b), t.removeEventListener("wheel", k), t.removeEventListener("touchstart", T), 
-            t.removeEventListener("touchend", R), d(c);
+            t.removeEventListener("scroll", I), t.removeEventListener("wheel", R), t.removeEventListener("touchstart", k), 
+            t.removeEventListener("touchend", T), d(c);
         },
         U: () => {
-            const [t, n] = e.q();
+            const [t, n] = e.C();
             if (!t) return;
             p && s && s(), p = !1;
-            const r = e.M(), l = r + t, c = e.L() + e.t() - e.o();
+            const r = e.k(), l = r + t, c = e.M() + 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.W(1, z()));
+            }), n && (i && i(), e.o() > e.t() && e.q(1, z()));
         },
         F: (t, o) => {
             let n, r, s;
@@ -372,16 +369,16 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: f, 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.I(t)) return;
                         l();
                     }
-                    e.W(7), y(t(), o);
+                    e.q(7), y(t(), o);
                 }
             };
-            o && e.W(8, t()), (() => {
+            o && e.q(8, t()), (() => {
                 if (n) return;
                 let t;
-                s = e.A(2, () => {
+                s = e.L(2, () => {
                     t || (t = !0, h(() => {
                         t = !1, c();
                     }));
@@ -394,11 +391,11 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: f, m:
     const l = /* @__PURE__ */ new WeakMap, i = A(r => {
         const i = [];
         for (const {target: c, contentRect: {width: f, height: a}} of r) if (c === o) f || a ? (s || n.G(), 
-        s = !0, e.W(4, t ? f : a)) : s = !1; else if (c.offsetParent) {
+        s = !0, e.q(4, t ? f : a)) : s = !1; else if (c.offsetParent) {
             const e = l.get(c);
             null != e && i.push([ e, t ? f : a ]);
         }
-        i.length && e.W(3, i);
+        i.length && e.q(3, i);
     });
     return {
         K(s, l = s.parentElement) {
@@ -409,7 +406,7 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: f, m:
                 });
             }), r[1](!0);
         },
-        I() {
+        _() {
             i.D(), n && n.D(), r[1](!1), r = g();
         },
         N: (e, t) => (l.set(e, t), i.j(e), () => {
@@ -421,7 +418,7 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: f, m:
         ee() {
             n && n.U();
         },
-        te: e.L
+        te: e.M
     };
 }, B = (e, t) => {
     let o, n, r, s, l, i = g();
@@ -431,7 +428,7 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: f, m:
             const o = c.get(e);
             null != o && r.push([ o, t ? s : i ]);
         }
-        r.length && e.W(3, r);
+        r.length && e.q(3, r);
     });
     return {
         K(c) {
@@ -439,13 +436,13 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: f, m:
                 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, a.body, t), w = l = () => {
-                e.W(4, d[t ? "clientWidth" : "clientHeight"]);
+                e.q(4, d[t ? "clientWidth" : "clientHeight"]);
             };
             u.addEventListener("resize", w), f.j(d), r = () => {
                 u.removeEventListener("resize", w);
             }, n = W(e, u, d, t, h, null, $), i[1](!0);
         },
-        I() {
+        _() {
             r && r(), f.D(), n && n.D(), i[1](!1), i = g();
         },
         N: (e, t) => (c.set(e, t), f.j(e), () => {
@@ -464,11 +461,11 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: f, m:
     const i = /* @__PURE__ */ new WeakMap, c = /* @__PURE__ */ new WeakMap, f = A(s => {
         const f = [], a = [];
         for (const {target: u, contentRect: {width: d, height: h}} of s) if (u === o) d || h ? (l || (n.G(), 
-        r.G()), l = !0, e.W(4, h), t.W(4, d)) : l = !1; else if (u.offsetParent) {
+        r.G()), l = !0, e.q(4, h), t.q(4, d)) : l = !1; else if (u.offsetParent) {
             const e = i.get(u), t = c.get(u);
             null != e && f.push([ e, h ]), null != t && a.push([ t, d ]);
         }
-        f.length && e.W(3, f), a.length && t.W(3, a);
+        f.length && e.q(3, f), a.length && t.q(3, a);
     });
     return {
         async Z(e, t) {
@@ -484,7 +481,7 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: f, m:
             });
             n = c(e, !1), r = c(t, !0), s[1](!0);
         },
-        I() {
+        _() {
             f.D(), n && n.D(), r && r.D(), s[1](!1), s = g();
         },
         N: (e, t, o) => (null != t && i.set(e, t), null != o && c.set(e, o), f.j(e), () => {
@@ -494,30 +491,30 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: f, m:
             n && n.U(), r && r.U();
         }
     };
-}, Y = (e, t) => {
+}, V = (e, t) => {
     e.Z(() => t);
-}, V = (e, t, o) => {
-    Y(e, o + t.M());
+}, Y = (e, t, o) => {
+    V(e, o + t.k());
 }, X = (e, t, o, {align: n, smooth: r, offset: s = 0} = {}) => {
-    if (o = f(o, 0, t.O() - 1), "nearest" === n) {
-        const e = t.u(o), r = t.M();
+    if (o = f(o, 0, t.R() - 1), "nearest" === n) {
+        const e = t.i(o), r = t.k();
         if (e < r) n = "start"; else {
-            if (!(e + t.h(o) > r + t.o())) return;
+            if (!(e + t.u(o) > r + t.o())) return;
             n = "end";
         }
     }
-    e.Z(() => s + e.te() + t.u(o) + ("end" === n ? t.h(o) - t.o() : "center" === n ? (t.h(o) - t.o()) / 2 : 0), r);
+    e.Z(() => s + e.te() + t.i(o) + ("end" === n ? t.u(o) - t.o() : "center" === n ? (t.u(o) - t.o()) / 2 : 0), r);
 }, j = (e, t, o, n, r, i, c) => {
-    const a = t.O(), u = o.Y(), d = o.V();
+    const a = t.R(), u = o.P(), d = o.V();
     r = f(r, 0, a - 1);
-    const h = T(n, u, d), g = R(h, r, d), $ = g < 0 ? -1 : h[g], p = () => o.u(u) + ($ < 0 || $ === r ? 0 : o.u($ + 1) - o.u($)), m = () => o.u(a) - o.u(d);
+    const h = k(n, u, d), g = T(h, r, d), $ = g < 0 ? -1 : h[g], p = () => o.i(u) + ($ < 0 || $ === r ? 0 : o.i($ + 1) - o.i($)), m = () => o.i(a) - o.i(d);
     if ("nearest" === i) {
         if (r < u || r >= d) return;
-        const e = p(), o = t.M() + e, n = t.o() - e - m(), c = t.h(r);
-        let f = t.u(r);
+        const e = p(), o = t.k() + e, n = t.o() - e - m(), c = t.u(r);
+        let f = t.i(r);
         if ($ === r) {
             const e = (g + 1 < h.length ? h[g + 1] : d) - 1;
-            f = l(f, s(o, t.u(e) + t.h(e) - c));
+            f = l(f, s(o, t.i(e) + t.u(e) - c));
         }
         if (f < o) i = "start"; else {
             if (!(f + c > o + n)) return;
@@ -525,8 +522,8 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: f, m:
         }
     }
     e.Z(c, () => {
-        const e = p(), o = t.h(r) - (t.o() - e - m());
-        return t.u(r) - e + ("end" === i ? o : "center" === i ? o / 2 : 0);
+        const e = p(), o = t.u(r) - (t.o() - e - m());
+        return t.i(r) - e + ("end" === i ? o : "center" === i ? o / 2 : 0);
     });
 }, J = $ ? e.useLayoutEffect : e.useEffect, D = "current", G = (e, t) => {
     if (Array.isArray(e)) for (const o of e) G(o, t); else null == e || "boolean" == typeof e || t.push(e);
@@ -572,96 +569,98 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: f, m:
         return G(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: f, cache: u, startMargin: d = 0, ssrCount: g, as: $ = "div", item: p = "div", scrollRef: m, onScroll: w, onScrollEnd: v}, z) => {
+}, [ t, o ]), Z = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: n, data: r, bufferSize: s, itemSize: l, shift: i, horizontal: c, keepMounted: f, cache: u, startMargin: d = 0, ssrCount: g, as: $ = "div", item: p = "div", scrollRef: m, onScroll: w, onScrollEnd: v, onResize: z}, x) => {
     "use no memo";
-    const [x, I] = Q(n, r), b = (0, e.useRef)(null), k = (0, e.useRef)(!!g), T = K(w), R = K(v), [O, M, E, C] = F(() => {
+    const [b, I] = Q(n, r), R = (0, e.useRef)(null), k = (0, e.useRef)(!!g), T = K(w), O = K(v), M = K(z), [E, C, L, q] = F(() => {
         const e = !!c, t = y(I, l, u), o = _(t, g);
         return [ o, t, H(o, e), e ];
     });
-    I !== O.O() && O.W(5, [ I, i ]), d !== O.L() && O.W(6, d);
-    const [L, q] = (0, e.useReducer)(O.k, void 0, O.k), A = O.C(), W = O.t(), B = [], P = e => {
-        const o = x(e);
+    I !== E.R() && E.q(5, [ I, i ]), d !== E.M() && E.q(6, d);
+    const [A, W] = (0, e.useReducer)(E.v, void 0, E.v), B = E.O(), P = E.t(), j = [], G = e => {
+        const o = b(e);
         /* @__PURE__ */ /* @__PURE__ */
         return (0, t.jsx)(N, {
-            ne: E.N,
+            ne: L.N,
             re: e,
-            se: O.u(e),
-            le: O.R(e),
+            se: E.i(e),
+            le: E.I(e),
             ie: p,
             oe: o,
-            ce: C,
+            ce: q,
             fe: k[D]
         }, U(o, e));
     };
     if (J(() => {
-        k[D] = !1, O.A(1, e => {
-            e ? (0, o.flushSync)(q) : q();
-        }), O.A(4, () => {
-            T.current && T.current(O.M());
-        }), O.A(8, () => {
-            R.current && R.current();
+        k[D] = !1, E.L(1, e => {
+            e ? (0, o.flushSync)(W) : W();
+        }), E.L(4, () => {
+            T.current && T.current(E.k());
+        }), E.L(8, () => {
+            O.current && O.current();
+        }), E.L(2, () => {
+            M.current && M.current();
         });
-        const e = b[D];
+        const e = R[D];
         return m ? h(() => {
-            m.current && E.K(e, m[D]);
-        }) : E.K(e), () => {
-            O.I(), E.I();
+            m.current && L.K(e, m[D]);
+        }) : L.K(e), () => {
+            E._(), L._();
         };
     }, []), J(() => {
-        E.ee();
-    }, [ L ]), (0, e.useImperativeHandle)(z, () => ({
+        L.ee();
+    }, [ A ]), (0, e.useImperativeHandle)(x, () => ({
         get cache() {
-            return M.H();
+            return C.W();
         },
         get scrollOffset() {
-            return O.M();
+            return E.k();
         },
         get scrollSize() {
-            return S(O);
+            return S(E);
         },
         get viewportSize() {
-            return O.o();
+            return E.o();
         },
-        findItemIndex: O.T,
-        getItemOffset: O.u,
-        getItemSize: O.h,
-        scrollToIndex: (e, t) => X(E, O, e, t),
-        scrollTo: e => Y(E, e),
-        scrollBy: e => V(E, O, e)
+        findItemIndex: e => C.A(e - E.M()),
+        getItemOffset: E.i,
+        getItemSize: E.u,
+        scrollToIndex: (e, t) => X(L, E, e, t),
+        scrollTo: e => V(L, e),
+        scrollBy: e => Y(L, E, e)
     }), []), f) {
         const e = new Set(f);
-        for (let [t, o] = O.l(s); t <= o; t++) e.add(t);
+        for (let [t, o] = E.l(s); t <= o; t++) e.add(t);
         a([ ...e ]).forEach(e => {
-            e < I && B.push(P(e));
+            e < I && j.push(G(e));
         });
-    } else for (let [e, t] = O.l(s); e <= t; e++) B.push(P(e));
+    } else for (let [e, t] = E.l(s); e <= t; e++) j.push(G(e));
     /* @__PURE__ */ /* @__PURE__ */
     return (0, t.jsx)($, {
-        ref: b,
+        ref: R,
         style: {
             contain: "size style",
             overflowAnchor: "none",
             flex: "none",
             position: "relative",
-            width: C ? W : "100%",
-            height: C ? "100%" : W,
-            pointerEvents: A ? "none" : void 0
+            width: q ? P : "100%",
+            height: q ? "100%" : P,
+            pointerEvents: B ? "none" : void 0
         },
-        children: B
+        children: j
     });
-}), ee = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: e, data: o, bufferSize: n, itemSize: r, shift: s, horizontal: l, keepMounted: i, cache: c, ssrCount: f, item: a, onScroll: u, onScrollEnd: d, style: h, ...g}, $) => /* @__PURE__ */ /* @__PURE__ */ (0, 
+}), ee = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: e, data: o, bufferSize: n, itemSize: r, shift: s, horizontal: l, keepMounted: i, cache: c, ssrCount: f, item: a, onScroll: u, onScrollEnd: d, onResize: h, style: g, ...$}, p) => /* @__PURE__ */ /* @__PURE__ */ (0, 
 t.jsx)("div", {
-    ...g,
+    ...$,
     style: {
         display: "block",
         [l ? "overflowX" : "overflowY"]: "auto",
         contain: "strict",
         width: "100%",
         height: "100%",
-        ...h
+        ...g
     },
     children: /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(Z, {
-        ref: $,
+        ref: p,
         data: o,
         bufferSize: n,
         itemSize: r,
@@ -673,67 +672,71 @@ t.jsx)("div", {
         item: a,
         onScroll: u,
         onScrollEnd: d,
+        onResize: h,
         children: e
     })
-})), te = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: n, data: r, bufferSize: s, itemSize: l, shift: i, horizontal: c, cache: f, ssrCount: a, as: u = "div", item: d = "div", onScroll: h, onScrollEnd: g}, $) => {
+})), te = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: n, data: r, bufferSize: s, itemSize: l, shift: i, horizontal: c, cache: f, ssrCount: a, as: u = "div", item: d = "div", onScroll: h, onScrollEnd: g, onResize: $}, p) => {
     "use no memo";
-    const [p, m] = Q(n, r), w = (0, e.useRef)(null), S = K(h), v = K(g), z = (0, e.useRef)(!!a), [x, I, b, k] = F(() => {
-        const e = !!c, t = y(m, l, f), o = _(t, a);
+    const [m, w] = Q(n, r), S = (0, e.useRef)(null), v = K(h), z = K(g), x = K($), b = (0, 
+    e.useRef)(!!a), [I, R, k, T] = F(() => {
+        const e = !!c, t = y(w, l, f), o = _(t, a);
         return [ o, t, B(o, e), e ];
     });
-    m !== x.O() && x.W(5, [ m, i ]);
-    const [T, R] = (0, e.useReducer)(x.k, void 0, x.k), O = x.C(), M = x.t(), E = [];
-    J(() => (z[D] = !1, x.A(1, e => {
-        e ? (0, o.flushSync)(R) : R();
-    }), x.A(4, () => {
-        S.current && S.current();
-    }), x.A(8, () => {
+    w !== I.R() && I.q(5, [ w, i ]);
+    const [O, M] = (0, e.useReducer)(I.v, void 0, I.v), E = I.O(), C = I.t(), L = [];
+    J(() => (b[D] = !1, I.L(1, e => {
+        e ? (0, o.flushSync)(M) : M();
+    }), I.L(4, () => {
         v.current && v.current();
-    }), b.K(w[D]), () => {
-        x.I(), b.I();
+    }), I.L(8, () => {
+        z.current && z.current();
+    }), I.L(2, () => {
+        x.current && x.current();
+    }), k.K(S[D]), () => {
+        I._(), k._();
     }), []), J(() => {
-        b.ee();
-    }, [ T ]), (0, e.useImperativeHandle)($, () => ({
+        k.ee();
+    }, [ O ]), (0, e.useImperativeHandle)(p, () => ({
         get cache() {
-            return I.H();
+            return R.W();
         },
         get scrollOffset() {
-            return x.M();
+            return I.k();
         },
         get viewportSize() {
-            return x.o();
+            return I.o();
         },
-        findItemIndex: x.T,
-        getItemOffset: x.u,
-        getItemSize: x.h,
-        scrollToIndex: (e, t) => X(b, x, e, t)
+        findItemIndex: e => R.A(e - I.M()),
+        getItemOffset: I.i,
+        getItemSize: I.u,
+        scrollToIndex: (e, t) => X(k, I, e, t)
     }), []);
-    for (let [e, o] = x.l(s); e <= o; e++) {
-        const o = p(e);
-        E.push(/* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(N, {
-            ne: b.N,
+    for (let [e, o] = I.l(s); e <= o; e++) {
+        const o = m(e);
+        L.push(/* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(N, {
+            ne: k.N,
             re: e,
-            se: x.u(e),
-            le: x.R(e),
+            se: I.i(e),
+            le: I.I(e),
             ie: d,
             oe: o,
-            ce: k,
-            fe: z[D]
+            ce: T,
+            fe: b[D]
         }, U(o, e)));
     }
     /* @__PURE__ */ /* @__PURE__ */
     return (0, t.jsx)(u, {
-        ref: w,
+        ref: S,
         style: {
             contain: "size style",
             overflowAnchor: "none",
             flex: "none",
             position: "relative",
-            width: k ? M : "100%",
-            height: k ? "100%" : M,
-            pointerEvents: O ? "none" : void 0
+            width: T ? C : "100%",
+            height: T ? "100%" : C,
+            pointerEvents: E ? "none" : void 0
         },
-        children: E
+        children: L
     });
 }), oe = /*#__PURE__*/ /*#__PURE__*/ (0, e.memo)(({ae: {ue: o, de: n, he: r, ge: s, $e: l, pe: i, me: c, we: f}, oe: a, Se: u, _e: d, ve: h, ne: g}) => {
     const $ = (0, e.useRef)(null);
@@ -761,27 +764,27 @@ t.jsx)("div", {
         ae: o,
         oe: r,
         Se: s,
-        _e: I(l, o.ue),
+        _e: b(l, o.ue),
         ve: e,
         ne: i
     }, o.ue))
-})), re = ({ae: {Ie: e, we: o}, oe: n, be: r, xe: s, ne: l}) => /* @__PURE__ */ /* @__PURE__ */ (0, 
+})), re = ({ae: {be: e, we: o}, oe: n, Ie: r, xe: s, ne: l}) => /* @__PURE__ */ /* @__PURE__ */ (0, 
 t.jsx)("div", {
     role: "rowgroup",
     style: o,
     children: e.map(e => /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(ne, {
         ae: e,
         oe: n,
-        Se: I(r, e.ze),
+        Se: b(r, e.ze),
         xe: s,
         ne: l
     }, e.ze))
-}), se = /*#__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: O, onVerticalScroll: A, onHorizontalScroll: W, onScrollEnd: H, style: B, ...Y}, V) => {
+}), se = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: n, rows: i, cols: c, rowHeight: u, colWidth: d, headerRows: g, sectionRows: $, footerRows: p, headerCols: m, footerCols: w, spans: v, keepMounted: z, bufferSize: y, gap: O = 0, ariaSort: A, onVerticalScroll: W, onHorizontalScroll: H, onScrollEnd: B, onResize: V, style: Y, ...X}, G) => {
     "use no memo";
-    const X = (0, e.useRef)(null), G = K(A), U = K(W), N = K(H), [Q, Z, ee, te, oe] = F(() => {
-        const e = b(i, u, y), t = b(c, d, y), o = _(e), n = _(t);
+    const U = (0, e.useRef)(null), N = K(W), Q = K(H), Z = K(B), ee = K(V), [te, oe, se, le, ie] = F(() => {
+        const e = I(i, u, O), t = I(c, d, O), o = _(e), n = _(t);
         return [ o, n, e, t, P(o, n) ];
-    }), se = (0, e.useMemo)(() => ee.X(i, u), [ i, u ]), le = (0, e.useMemo)(() => te.X(c, d), [ c, d ]), ie = (0, 
+    }), ce = (0, e.useMemo)(() => se.Y(i, u), [ i, u ]), fe = (0, e.useMemo)(() => le.Y(c, d), [ c, d ]), ae = (0, 
     e.useMemo)(() => ((e = r) => {
         const t = /* @__PURE__ */ new Map;
         for (const o of e) {
@@ -792,79 +795,80 @@ t.jsx)("div", {
             }
         }
         return t;
-    })(w), [ w ]);
-    ee.P(h, $), te.P(p, m);
-    const ce = x(i), fe = x(c);
-    ce !== Q.O() && Q.W(5, [ ce ]), fe !== Z.O() && Z.W(5, [ fe ]), Q.W(9, se), Z.W(9, le);
-    const ae = () => Q.k() + Z.k(), [ue, de] = (0, e.useReducer)(ae, void 0, ae), he = Q.C() || Z.C(), ge = Q.u(0), $e = Z.u(0), pe = Q.O(), me = Z.O(), we = ((e, t, [o, n], [i, c], u, d = r, h = r, g) => {
-        const $ = e.p(), p = t.p(), m = e.Y(), w = e.V(), S = t.Y(), _ = t.V();
+    })(v), [ v ]);
+    se.B(g, p), le.B(m, w);
+    const ue = x(i), de = x(c);
+    ue !== te.R() && te.q(5, [ ue ]), de !== oe.R() && oe.q(5, [ de ]), te.q(9, se.X(ce, te.T())), 
+    oe.q(9, le.X(fe, oe.T()));
+    const he = () => te.v() + oe.v(), [ge, $e] = (0, e.useReducer)(he, void 0, he), pe = te.O() || oe.O(), me = te.i(0), we = oe.i(0), Se = te.R(), _e = oe.R(), ve = ((e, t, [o, n], [i, c], u, d = r, h = r, g) => {
+        const $ = e.$(), p = t.$(), m = e.P(), w = e.V(), S = t.P(), _ = t.V();
         o = f(o, m, w), n = s(n, w - 1), i = f(i, S, _), c = s(c, _ - 1);
-        const v = T(d, m, w), 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, O = R(v, o, w), A = O < 0 ? -1 : v[O];
+        const v = k(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, O = T(v, o, w), A = O < 0 ? -1 : v[O];
         A >= 0 && y.push(A);
         const W = M(a(y), $, m, o, n, w);
         for (let e = 0; e < W.length; e++) for (const t of u.get(W[e]) || r) {
             const {rowIndex: r, colIndex: f} = t, a = E(t, $), u = C(t, p);
             if ((e < 1 || W[e - 1] < r) && f < p && (a - r > 1 || u - f > 1)) {
                 let e = (r < m || l(r, o) < s(a, n + 1) || w < a || A >= r && A < a) && (f < S || l(f, i) < s(u, c + 1) || _ < u);
-                for (let t = 0; !e && t < b; t++) {
-                    const o = I[t];
+                for (let t = 0; !e && t < I; t++) {
+                    const o = b[t];
                     e = o.rowIndex >= r && o.rowIndex < a && o.colIndex >= f && o.colIndex < u;
                 }
-                e && I.push(t);
+                e && b.push(t);
             }
         }
-        for (const {rowIndex: e, colIndex: t} of I) {
-            const o = R(v, e, w);
+        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);
         }
         a(y), a(x);
-        const H = M(y, $, m, o, n, w), B = M(x, p, S, i, c, _), P = H.length, Y = B.length, V = /* @__PURE__ */ new Map, X = [], j = [];
-        for (const e of I) {
+        const H = M(y, $, m, o, n, w), B = M(x, p, S, i, c, _), P = H.length, V = B.length, Y = /* @__PURE__ */ new Map, X = [], j = [];
+        for (const e of b) {
             const t = E(e, $), o = C(e, p);
             X.push(t), j.push(o);
             const n = B.indexOf(e.colIndex);
             for (let r = H.indexOf(e.rowIndex); r < P && H[r] < t; r++) {
                 const t = H[r] * p;
-                for (let r = n; r < Y && B[r] < o; r++) V.set(t + B[r], e);
+                for (let r = n; r < V && B[r] < o; r++) Y.set(t + B[r], e);
             }
         }
         const J = [];
-        for (const e of B) J.push(!t.B(e) && null);
-        const D = [], G = e.u(m), U = [];
+        for (const e of B) J.push(!t.H(e) && null);
+        const D = [], G = e.i(m), U = [];
         let F = U;
-        const K = k.get(e), N = /* @__PURE__ */ new Map;
+        const K = R.get(e), N = /* @__PURE__ */ new Map;
         for (const r of H) {
-            const s = r < m, f = r >= w, a = R(v, r, w), u = s ? 0 : f ? w : a < 0 ? -1 : v[a];
+            const s = r < m, f = r >= w, a = T(v, r, w), u = s ? 0 : f ? w : a < 0 ? -1 : v[a];
             if (r === u) {
                 const e = s ? m : f ? $ : a + 1 < v.length ? v[a + 1] : w;
                 X.push(e);
                 const t = [];
                 U.push({
-                    ke: s ? -1 : f ? -2 : -3 - u,
-                    Ie: t,
+                    Re: s ? -1 : f ? -2 : -3 - u,
+                    be: t,
                     we: q(u, e, s || f ? 0 : null, f ? "bottom" : "top", 4)
                 }), F = t;
             } else u < 0 && (F = U);
-            const d = a >= 0 && r === u, h = s || f || r === A || r >= o && r <= n, y = d ? G : null, x = r * p, I = K && K.get(r), b = I && I.ye, k = [];
-            let T = 0, O = !e.B(r) && null, M = r + 1, L = !1;
-            for (let e = 0; e < Y; e++) {
-                const o = B[e], n = o < S, f = o >= _, a = n || f || o >= i && o <= c, u = V.get(x + o);
+            const d = a >= 0 && r === u, h = s || f || r === A || r >= o && r <= n, y = d ? G : null, x = r * p, b = K && K.get(r), I = b && b.ye, R = [];
+            let k = 0, O = !e.H(r) && null, M = r + 1, L = !1;
+            for (let e = 0; e < V; e++) {
+                const o = B[e], n = o < S, f = o >= _, a = n || f || o >= i && o <= c, u = Y.get(x + o);
                 if (u ? u.rowIndex === r && u.colIndex === o : h && a) {
                     const i = u ? E(u, $) : r + 1, c = u ? C(u, p) : o + 1, a = i - r, h = c - o, m = a > 1, w = h > 1, S = m || w;
                     let _, v;
                     M = l(M, i);
-                    const y = n ? t.u(o) : null, x = f ? t.u(p) - t.u(c) : null;
+                    const y = n ? t.i(o) : null, x = f ? t.i(p) - t.i(c) : null;
                     !1 !== O || m || (_ = r, O = !0), !1 !== J[e] || w || (v = o, J[e] = !0);
-                    const I = s ? "columnheader" : o === z && (n || d) ? "rowheader" : "cell", R = S ? a : void 0, q = S ? h : void 0, A = "cell" !== I && g && g.rowIndex === r && g.colIndex === o ? g.order : void 0;
+                    const b = s ? "columnheader" : o === z && (n || d) ? "rowheader" : "cell", T = S ? a : void 0, q = S ? h : void 0, A = "cell" !== b && g && g.rowIndex === r && g.colIndex === o ? g.order : void 0;
                     let W;
-                    if (b) {
-                        const e = b.length;
-                        for (;T < e && b[T].ue < o; ) T++;
-                        T < e && b[T].ue === o && (W = b[T]);
+                    if (I) {
+                        const e = I.length;
+                        for (;k < e && I[k].ue < o; ) k++;
+                        k < e && I[k].ue === o && (W = I[k]);
                     }
-                    if (!W || W.de !== R || W.he !== q || W.Te !== y || W.Re !== x || W.ge !== _ || W.$e !== v || W.pe !== I || W.me !== A) {
+                    if (!W || W.de !== T || W.he !== q || W.ke !== y || W.Te !== x || W.ge !== _ || W.$e !== v || W.pe !== b || W.me !== A) {
                         let e = "1/l" + o;
                         S && (e += "/l" + i + "/l" + c);
                         const t = {
@@ -876,135 +880,142 @@ t.jsx)("div", {
                         t.minWidth = "100%"), (n || f) && (t[n ? "insetInlineStart" : "insetInlineEnd"] = (n ? y : x) + "px", 
                         t.position = "sticky", t.zIndex = 2), W = {
                             ue: o,
-                            de: R,
+                            de: T,
                             he: q,
                             ge: _,
                             $e: v,
-                            pe: I,
+                            pe: b,
                             me: A,
                             we: t,
-                            Te: y,
-                            Re: x
+                            ke: y,
+                            Te: x
                         }, L = !0;
                     }
-                    k.push(W);
+                    R.push(W);
                 }
             }
-            if (D.push(O), k.length) {
-                const e = I && !L && I.ye.length === k.length && I.Oe === y ? I : {
+            if (D.push(O), R.length) {
+                const e = b && !L && b.ye.length === R.length && b.Oe === y ? b : {
                     ze: r,
-                    ye: k,
+                    ye: R,
                     we: q(r, M, y, "top", 3),
                     Oe: y
                 };
                 N.set(r, e), F.push(e);
             }
         }
-        return k.set(e, N), {
+        return R.set(e, N), {
             Me: L(e, H, D, a(X), "max-content", $),
             Ee: L(t, B, J, a(j), "minmax(max-content,auto)", p),
             Ce: U
         };
-    })(ee, te, Q.l(z), Z.l(z), ie, g, v, O), Se = K(e => ((e, t, o, n, s, l = r, {rowIndex: i, colIndex: c, rowAlign: f, colAlign: a}) => {
+    })(se, le, te.l(y), oe.l(y), ae, $, z, A), ze = K(e => ((e, t, o, n, s, l = r, {rowIndex: i, colIndex: c, rowAlign: f, colAlign: a}) => {
         null != i && j(e, t, n, l, i, f, !1), null != c && j(e, o, s, r, c, a, !0);
-    })(oe, Q, Z, ee, te, g, e));
+    })(ie, te, oe, se, le, $, e));
     return J(() => {
         const e = e => {
-            e ? (0, o.flushSync)(de) : de();
+            e ? (0, o.flushSync)($e) : $e();
         };
-        Q.A(1, e), Z.A(1, e);
+        te.L(1, e), oe.L(1, e);
         let t = !1;
-        Q.A(4, () => {
-            t = !0, G.current && G.current(Q.M());
-        }), Z.A(4, () => {
-            t = !0, U.current && U.current(Z.M());
+        te.L(4, () => {
+            t = !0, N.current && N.current(te.k());
+        }), oe.L(4, () => {
+            t = !0, Q.current && Q.current(oe.k());
         });
         const n = () => {
-            !t || Q.C() || Z.C() || (t = !1, N.current && N.current());
+            !t || te.O() || oe.O() || (t = !1, Z.current && Z.current());
+        };
+        let r;
+        te.L(8, n), oe.L(8, n);
+        const s = () => {
+            r || (r = !0, h(() => {
+                r = !1, ee.current && ee.current();
+            }));
         };
-        return Q.A(8, n), Z.A(8, n), oe.K(X[D]), () => {
-            Q.I(), Z.I(), oe.I();
+        return te.L(2, s), oe.L(2, s), ie.K(U[D]), () => {
+            te._(), oe._(), ie._();
         };
     }, []), J(() => {
-        oe.ee();
-    }, [ ue ]), (0, e.useImperativeHandle)(V, () => ({
+        ie.ee();
+    }, [ ge ]), (0, e.useImperativeHandle)(G, () => ({
         get verticalScrollOffset() {
-            return Q.M();
+            return te.k();
         },
         get horizontalScrollOffset() {
-            return Z.M();
+            return oe.k();
         },
         get scrollHeight() {
-            return S(Q);
+            return S(te);
         },
         get scrollWidth() {
-            return S(Z);
+            return S(oe);
         },
         get viewportHeight() {
-            return Q.o();
+            return te.o();
         },
         get viewportWidth() {
-            return Z.o();
+            return oe.o();
         },
-        findRowIndex: Q.T,
-        findColIndex: Z.T,
-        getRowOffset: Q.u,
-        getColOffset: Z.u,
-        getRowSize: Q.h,
-        getColSize: Z.h,
-        scrollToIndex: e => Se[D](e),
+        findRowIndex: se.A,
+        findColIndex: le.A,
+        getRowOffset: te.i,
+        getColOffset: oe.i,
+        getRowSize: te.u,
+        getColSize: oe.u,
+        scrollToIndex: e => ze[D](e),
         scrollTo: ({vertical: e, horizontal: t}) => ((e, t, o) => {
             null != t && e.Z(!1, () => t), null != o && e.Z(!0, () => o);
-        })(oe, e, t),
+        })(ie, e, t),
         scrollBy: ({vertical: e, horizontal: t}) => ((e, t, o, n, r) => {
             if (null != n) {
-                const o = n + t.M();
+                const o = n + t.k();
                 e.Z(!1, () => o);
             }
             if (null != r) {
-                const t = r + o.M();
+                const t = r + o.k();
                 e.Z(!0, () => t);
             }
-        })(oe, Q, Z, e, t)
+        })(ie, te, oe, e, t)
     }), []), /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)("div", {
         role: "table",
-        "aria-rowcount": pe,
-        "aria-colcount": me,
-        ...Y,
+        "aria-rowcount": Se,
+        "aria-colcount": _e,
+        ...X,
         style: {
             overflow: "auto",
             contain: "strict",
             width: "100%",
             height: "100%",
-            ...B
+            ...Y
         },
         children: /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)("div", {
-            ref: X,
+            ref: U,
             style: {
                 contain: "size style",
                 overflowAnchor: "none",
                 flex: "none",
                 display: "grid",
-                gridTemplateRows: we.Me,
-                gridTemplateColumns: we.Ee,
-                gap: y,
-                marginTop: ge,
-                marginInlineStart: $e,
-                height: S(Q) - ge,
-                pointerEvents: he ? "none" : void 0
+                gridTemplateRows: ve.Me,
+                gridTemplateColumns: ve.Ee,
+                gap: O,
+                marginTop: me,
+                marginInlineStart: we,
+                height: S(te) - me,
+                pointerEvents: pe ? "none" : void 0
             },
-            children: we.Ce.map(e => "Ie" in e ? /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(re, {
+            children: ve.Ce.map(e => "be" in e ? /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(re, {
                 ae: e,
                 oe: n,
-                be: i,
+                Ie: i,
                 xe: c,
-                ne: oe.N
-            }, e.ke) : /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(ne, {
+                ne: ie.N
+            }, e.Re) : /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(ne, {
                 ae: e,
                 oe: n,
-                Se: I(i, e.ze),
+                Se: b(i, e.ze),
                 xe: c,
-                ne: oe.N
+                ne: ie.N
             }, e.ze))
         })
     });
@@ -1026,163 +1037,161 @@ e.memo)(({oe: o, ne: n, re: r, se: s, Le: l, qe: i, le: c}) => {
         style: a,
         children: o
     });
-}), ce = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: n, data: r, lanes: i, gap: c, itemSize: f, bufferSize: u, keepMounted: d, cache: h, onScroll: g, onScrollEnd: $, style: p, ...m}, w) => {
+}), ce = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: n, data: r, lanes: i, gap: c, itemSize: f, bufferSize: u, keepMounted: d, cache: h, onScroll: g, onScrollEnd: $, onResize: p, style: m, ...w}, y) => {
     "use no memo";
-    const y = (0, e.useRef)(null), x = K(g), I = K($), [b, k, T] = F(() => {
+    const x = (0, e.useRef)(null), b = K(g), I = K($), R = K(p), [k, T, O] = F(() => {
         const e = ((e, t, o = 0, n, r) => {
-            let i = l(t, 1), c = i, f = o, u = r && r[1] || n || 40, d = -1, h = n ? void 0 : /* @__PURE__ */ new Set, g = !n;
-            const $ = r && r[0], p = $ ? v($.slice(0, s(e, $.length)), l(0, e - $.length)) : v([], e), m = [], w = [], S = [], _ = e => {
-                const t = p[e];
-                return -1 === t ? u : t;
-            }, y = t => {
-                if (t = s(t, e - 1), d >= t) return;
+            let i = l(t, 1), c = r && r[1] || n || 40, f = -1, u = n ? void 0 : /* @__PURE__ */ new Set, d = !n;
+            const h = r && r[0], g = h ? v(h.slice(0, s(e, h.length)), l(0, e - h.length)) : v([], e), $ = [], p = [], m = [], w = e => {
+                const t = g[e];
+                return -1 === t ? c : t;
+            }, S = t => {
+                if (t = s(t, e - 1), f >= t) return;
                 const n = [], r = [];
                 for (let e = 0; e < i; e++) n.push(0), r.push(-1);
-                for (let e = d, t = i; e >= 0 && t; e--) {
-                    const o = w[e];
-                    -1 === r[o] && (r[o] = e, n[o] = m[e] + _(e), t--);
+                for (let e = f, t = i; e >= 0 && t; e--) {
+                    const o = p[e];
+                    -1 === r[o] && (r[o] = e, n[o] = $[e] + w(e), t--);
                 }
-                for (;d < t; ) {
-                    const e = ++d;
+                for (;f < t; ) {
+                    const e = ++f;
                     let t = 0, s = 1 / 0, c = 1 / 0;
                     for (let e = 0; e < i; e++) {
                         const l = n[e] + (r[e] >= 0 ? o : 0);
                         (l < s || l === s && r[e] < c) && (t = e, s = l, c = r[e]);
                     }
-                    m[e] = s, w[e] = t, n[t] = s + _(e), r[t] = e, S[e] = l(e ? S[e - 1] : 0, n[t]);
+                    $[e] = s, p[e] = t, n[t] = s + w(e), r[t] = e, m[e] = l(e ? m[e - 1] : 0, n[t]);
                 }
-            }, x = t => t >= e ? b() : (y(t), m[t]), I = e => (y(e), S[e]), b = () => e ? I(e - 1) : 0, k = t => {
+            }, _ = t => t >= e ? x() : (S(t), $[t]), y = e => (S(e), m[e]), x = () => e ? y(e - 1) : 0, b = t => {
                 if (!e) return 0;
-                const o = z(I, e, t);
-                return I(o) <= t ? o + 1 : o;
+                const o = z(y, e, t);
+                return y(o) <= t ? o + 1 : o;
             };
             return {
                 l: (t, o) => {
-                    const n = z(x, e, o);
-                    return [ s(k(t), n), n ];
+                    const n = z(_, e, o);
+                    return [ s(b(t), n), n ];
                 },
-                i: t => z(x, e, t),
-                u: x,
-                h: _,
-                $: (e, t = -1) => p[e] === t,
-                _: (t, n, r, l) => {
-                    let c = k(r);
-                    for (;c > 0 && !n(c - 1); ) c--;
-                    for (;c < e && n(c); ) c++;
-                    const f = x(c);
-                    for (const [e, o] of t) p[e] = o, h && h.add(e), d = s(e - 1, d);
-                    let $ = x(c) - f;
-                    if (h && l) {
+                i: _,
+                u: w,
+                h: (e, t = -1) => g[e] === t,
+                S: (t, n, r, l) => {
+                    let h = b(r);
+                    for (;h > 0 && !n(h - 1); ) h--;
+                    for (;h < e && n(h); ) h++;
+                    const $ = _(h);
+                    for (const [e, o] of t) g[e] = o, u && u.add(e), f = s(e - 1, f);
+                    let p = _(h) - $;
+                    if (u && l) {
                         const e = [];
                         let t = 0;
-                        if (h.forEach(n => {
-                            const r = p[n];
+                        if (u.forEach(n => {
+                            const r = g[n];
                             r > 0 && (e.push(r), t += r + o);
                         }), t > l * i) {
                             a(e);
-                            const t = e.length, o = t / 2 | 0, n = t % 2 == 0 ? (e[o - 1] + e[o]) / 2 : e[o], s = k(r + $), l = x(s);
-                            u = n, d = -1, $ += x(s) - l, h = void 0, g = !1;
+                            const t = e.length, o = t / 2 | 0, n = t % 2 == 0 ? (e[o - 1] + e[o]) / 2 : e[o], s = b(r + p), l = _(s);
+                            c = n, f = -1, p += _(s) - l, u = void 0, d = !1;
                         }
                     }
-                    return $;
+                    return p;
                 },
-                t: b,
-                p: () => e,
-                m: t => {
+                t: x,
+                $: () => e,
+                p: t => {
                     const o = t - e;
-                    return d = s(t - 1, d), e = t, o > 0 ? v(p, o) : p.splice(o), 0;
-                },
-                v: (e, t) => {
-                    if (c === i && f === o) return;
-                    const r = k(t), s = x(r);
-                    return i = c, o = f, d = -1, h = n ? void 0 : /* @__PURE__ */ new Set, x(r) - s;
+                    return f = s(t - 1, f), e = t, o > 0 ? v(g, o) : g.splice(o), 0;
                 },
-                Ae: (e, t = 0) => {
-                    c = l(e, 1), f = t;
+                X: (e, t = 0, r) => {
+                    if ((e = l(e, 1)) === i && t === o) return;
+                    const s = b(r), c = _(s);
+                    return i = e, o = t, f = -1, u = n ? void 0 : /* @__PURE__ */ new Set, _(s) - c;
                 },
-                S: () => g,
-                H: () => [ p.slice(), u ],
-                We: () => i,
-                He: () => o,
-                Be: e => (y(e), w[e])
+                m: () => d,
+                W: () => [ g.slice(), c ],
+                Ae: () => i,
+                We: () => o,
+                He: e => (S(e), p[e])
             };
         })(r.length, i, c, f, h), t = _(e);
         return [ t, e, H(t, !1) ];
     });
-    r.length !== b.O() && b.W(5, [ r.length ]), k.Ae(i, c), b.W(9, void 0);
-    const [R, O] = (0, e.useReducer)(b.k, void 0, b.k), M = b.C(), E = b.t();
-    J(() => (b.A(1, e => {
-        e ? (0, o.flushSync)(O) : O();
-    }), b.A(4, () => {
-        x.current && x.current(b.M());
-    }), b.A(8, () => {
+    r.length !== k.R() && k.q(5, [ r.length ]), k.q(9, T.X(i, c, k.T()));
+    const [M, E] = (0, e.useReducer)(k.v, void 0, k.v), C = k.O(), L = k.t();
+    J(() => (k.L(1, e => {
+        e ? (0, o.flushSync)(E) : E();
+    }), k.L(4, () => {
+        b.current && b.current(k.k());
+    }), k.L(8, () => {
         I.current && I.current();
-    }), T.K(y[D]), () => {
-        b.I(), T.I();
+    }), k.L(2, () => {
+        R.current && R.current();
+    }), O.K(x[D]), () => {
+        k._(), O._();
     }), []), J(() => {
-        T.ee();
-    }, [ R ]), (0, e.useImperativeHandle)(w, () => ({
+        O.ee();
+    }, [ M ]), (0, e.useImperativeHandle)(y, () => ({
         get cache() {
-            return k.H();
+            return T.W();
         },
         get scrollOffset() {
-            return b.M();
+            return k.k();
         },
         get scrollSize() {
-            return S(b);
+            return S(k);
         },
         get viewportSize() {
-            return b.o();
+            return k.o();
         },
-        getItemOffset: b.u,
-        getItemSize: b.h,
-        scrollToIndex: (e, t) => X(T, b, e, t),
-        scrollTo: e => Y(T, e),
-        scrollBy: e => V(T, b, e)
+        getItemOffset: k.i,
+        getItemSize: k.u,
+        scrollToIndex: (e, t) => X(O, k, e, t),
+        scrollTo: e => V(O, e),
+        scrollBy: e => Y(O, k, e)
     }), []);
-    const C = [], L = k.We(), q = k.He(), A = le(1 / L, q / L - q), W = e => {
-        const o = n(r[e], e), s = k.Be(e);
+    const q = [], A = T.Ae(), W = T.We(), B = le(1 / A, W / A - W), P = e => {
+        const o = n(r[e], e), s = T.He(e);
         /* @__PURE__ */ /* @__PURE__ */
         return (0, t.jsx)(ie, {
-            ne: T.N,
+            ne: O.N,
             re: e,
-            se: b.u(e),
-            Le: le(s / L, s * q / L),
-            qe: A,
-            le: b.R(e),
+            se: k.i(e),
+            Le: le(s / A, s * W / A),
+            qe: B,
+            le: k.I(e),
             oe: o
         }, U(o, e));
     };
     if (d) {
         const e = new Set(d);
-        for (let [t, o] = b.l(u); t <= o; t++) e.add(t);
+        for (let [t, o] = k.l(u); t <= o; t++) e.add(t);
         a([ ...e ]).forEach(e => {
-            e < r.length && C.push(W(e));
+            e < r.length && q.push(P(e));
         });
-    } else for (let [e, t] = b.l(u); e <= t; e++) C.push(W(e));
+    } else for (let [e, t] = k.l(u); e <= t; e++) q.push(P(e));
     /* @__PURE__ */ /* @__PURE__ */
     return (0, t.jsx)("div", {
-        ...m,
+        ...w,
         style: {
             display: "block",
             overflowY: "auto",
             contain: "strict",
             width: "100%",
             height: "100%",
-            ...p
+            ...m
         },
         children: /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)("div", {
-            ref: y,
+            ref: x,
             style: {
                 contain: "size style",
                 overflowAnchor: "none",
                 flex: "none",
                 position: "relative",
                 width: "100%",
-                height: E,
-                pointerEvents: M ? "none" : void 0
+                height: L,
+                pointerEvents: C ? "none" : void 0
             },
-            children: C
+            children: q
         })
     });
 });