virtua 0.53.1 → 0.53.2

package/lib/index.js

@@ -13,112 +13,109 @@ var a, u = [], {min: d, max: h, abs: g, floor: $} = Math, p = (e, t, o) => d(o,
     return [ new Promise(t => {
         e = t;
     }), e ];
-}, z = "undefined" != typeof window, y = e => e.ownerDocument, x = e => e.defaultView, I = () => (null == a && (a = /iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0), 
-a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m: i, S: c, _: f, v: a}, u = 0) => {
-    let $ = !!u, p = 1, m = 0, w = 0, S = 0, _ = 0, v = 0, z = 0, y = 0, x = 0, b = null, k = [ 0, $ ? h(u - 1, 0) : -1 ], T = !1;
-    const R = /* @__PURE__ */ new Set, O = () => S - w, M = () => O() + v + _, E = e => o(e) - v, C = e => {
-        if (2 === x) return !0;
-        if (b && 1 === x) return e < b[0];
-        const t = O(), o = E(e), r = n(e);
-        return 1 !== y && 0 === x ? o + r <= t : o < t && o + r < t + m;
-    }, L = e => {
-        e && (I() && 0 !== y || b && 1 === x ? v += e : _ += e);
+}, z = "undefined" != typeof window, y = e => e.ownerDocument, x = e => e.defaultView, b = () => (null == a && (a = /iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0), 
+a), I = e => h(e.t(), e.o()), R = ({l: e, i: t, u: o, h: n, t: r, $: s, p: l, m: i, S: c}, f = 0) => {
+    let a = !!f, u = 1, $ = 0, p = 0, m = 0, w = 0, S = 0, _ = 0, v = 0, z = 0, y = null, x = [ 0, a ? h(f - 1, 0) : -1 ], I = !1;
+    const R = /* @__PURE__ */ new Set, k = () => m - p, T = () => k() + S + w, O = e => t(e) - S, M = e => {
+        if (2 === z) return !0;
+        if (y && 1 === z) return e < y[0];
+        const t = k(), n = O(e), r = o(e);
+        return 1 !== v && 0 === z ? n + r <= t : n < t && n + r < t + $;
+    }, E = e => {
+        e && (b() && 0 !== v || y && 1 === z ? S += e : w += e);
     };
     return {
-        I: () => {
+        _: () => {
             R.clear();
         },
-        k: () => p,
+        v: () => u,
         l: (t = 200) => {
-            if (!T || $) return k;
+            if (!I || a) return x;
             let o, n;
-            if (z) [o, n] = k; else {
-                let r = h(0, M()), s = r + m;
-                c() || (t = h(0, t), 1 !== y && (r -= t), 2 !== y && (s += t)), [o, n] = k = e(h(0, r), h(0, s)), 
-                b && (o = d(o, b[0]), n = h(n, b[1]));
+            if (_) [o, n] = x; else {
+                let r = h(0, T()), s = r + $;
+                i() || (t = h(0, t), 1 !== v && (r -= t), 2 !== v && (s += t)), [o, n] = x = e(h(0, r), h(0, s)), 
+                y && (o = d(o, y[0]), n = h(n, y[1]));
             }
-            return [ h(o, 0), d(n, l() - 1) ];
+            return [ h(o, 0), d(n, s() - 1) ];
         },
-        T: e => t(e - w),
-        R: r,
-        u: E,
-        h: n,
-        O: l,
-        M: () => S,
-        C: () => 0 !== y,
-        o: () => m,
-        L: () => w,
-        t: s,
-        A: () => (z = _, _ = 0, [ z, 2 === x ]),
-        W: (e, t) => {
+        I: n,
+        i: O,
+        u: o,
+        R: s,
+        k: () => m,
+        T,
+        O: () => 0 !== v,
+        o: () => $,
+        M: () => p,
+        t: r,
+        C: () => (_ = w, w = 0, [ _, 2 === z ]),
+        L: (e, t) => {
             const o = [ e, t ];
             return R.add(o), () => {
                 R.delete(o);
             };
         },
-        H: (t, o) => {
-            let n, l, c = 0;
+        A: (t, o) => {
+            let s, i, f = 0;
             switch (t) {
               case 1:
                 {
-                    if (o === S && 0 === x) break;
-                    const e = z;
-                    z = 0;
-                    const t = o - S, n = g(t);
-                    e && n < g(e) + 1 || 0 !== x || (y = t < 0 ? 2 : 1), $ && ($ = !1), S = o, c = 4;
-                    const r = O();
-                    r >= -m && r <= s() && (c += 1, l = n > m);
+                    if (o === m && 0 === z) break;
+                    const e = _;
+                    _ = 0;
+                    const t = o - m, n = g(t);
+                    e && n < g(e) + 1 || 0 !== z || (v = t < 0 ? 2 : 1), a && (a = !1), m = o, f = 4;
+                    const s = k();
+                    s >= -$ && s <= r() && (f += 1, i = n > $);
                     break;
                 }
 
               case 2:
-                c = 8, 0 !== y && (n = !0, c += 1), y = 0, x = 0, b = null;
+                f = 8, 0 !== v && (s = !0, f += 1), v = 0, z = 0, y = 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(f(e, C, M(), m)), c = 3, l = !0;
+                    E(c(e, M, T(), $)), f = 3, i = !0;
                     break;
                 }
 
               case 4:
-                m !== o && (m || (T = l = !0), m = o, c = 3);
+                $ !== o && ($ || (I = i = !0), $ = o, f = 3);
                 break;
 
               case 5:
-                o[1] ? (L(i(o[0], !0)), x = 2, c = 1) : (i(o[0]), c = 1);
+                o[1] ? (E(l(o[0], !0)), z = 2, f = 1) : (l(o[0]), f = 1);
                 break;
 
               case 6:
-                w = o;
+                p = o;
                 break;
 
               case 7:
-                x = 1;
+                z = 1;
                 break;
 
               case 9:
-                {
-                    const e = a(o, M());
-                    null != e && (L(e), c = 3);
-                    break;
-                }
+                null != o && (E(o), f = 3);
+                break;
 
               case 8:
-                b = e(o, o + m), c = 1;
+                y = e(o, o + $), f = 1;
             }
-            c && (p = 1 + (2147483647 & p), n && v && (_ += v, v = 0), R.forEach(([e, t]) => {
-                c & e && t(l);
+            f && (u = 1 + (2147483647 & u), s && S && (w += S, S = 0), R.forEach(([e, t]) => {
+                f & e && t(i);
             }));
         }
     };
-}, T = (e, t, o) => {
+}, k = (e, t, o) => {
     const n = o ? "unshift" : "push";
     for (let o = 0; o < t; o++) e[n](-1);
     return e;
-}, R = (e, t, o, n = 0, r = t - 1) => {
+}, T = (e, t, o, n = 0, r = t - 1) => {
     let s = n;
     for (;n <= r; ) {
         const t = $((n + r) / 2);
@@ -127,7 +124,7 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
     return p(s, 0, t - 1);
 }, O = (e, t, o) => {
     let n = o && o[1] || t || 40, r = -1, s = 0, l = !t, i = 0;
-    const c = o && o[0], f = c ? T(c.slice(0, d(e, c.length)), h(0, e - c.length)) : T([], e), a = T([], e + 1), u = e => {
+    const c = o && o[0], f = c ? k(c.slice(0, d(e, c.length)), h(0, e - c.length)) : k([], e), a = k([], e + 1), u = e => {
         const t = f[e];
         return -1 === t ? n : t;
     }, g = t => {
@@ -141,19 +138,19 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
     return {
         l: (t, o) => {
             let n, r;
-            return i = d(i, e - 1), g(i) <= t ? (r = R(g, e, o, i), n = R(g, e, t, i, r)) : (n = R(g, e, t, void 0, i), 
-            r = R(g, e, o, n)), i = n, [ n, r ];
+            return i = d(i, e - 1), g(i) <= t ? (r = T(g, e, o, i), n = T(g, e, t, i, r)) : (n = T(g, e, t, void 0, i), 
+            r = T(g, e, o, n)), i = n, [ n, r ];
         },
-        i: t => R(g, e, t),
-        u: g,
-        h: u,
-        $: (e, t = -1) => f[e] === t,
-        _: (t, o, i, c) => {
+        W: t => T(g, e, t),
+        i: g,
+        u,
+        h: (e, t = -1) => f[e] === t,
+        S: (t, o, i, c) => {
             let a = t.reduce((e, [t, n]) => o(t) ? e + (n - u(t)) : e, 0);
             for (const [e, o] of t) s += -1 === f[e] ? o : o - u(e), f[e] = o, r = d(e, r);
             if (l && c && s > c) {
                 let t = 0;
-                const o = R(g, e, i + a), s = [];
+                const o = T(g, e, i + a), s = [];
                 f.forEach((e, n) => {
                     -1 !== e && (e && s.push(e), n < o && t++);
                 }), r = -1, m(s);
@@ -163,21 +160,21 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
             return a;
         },
         t: () => g(e),
-        p: () => e,
-        m: (t, o) => {
+        $: () => e,
+        p: (t, o) => {
             const s = t - e;
-            return r = o ? -1 : d(t - 1, r), e = t, s > 0 ? (T(a, s), T(f, s, o), n * s) : (a.splice(s), 
+            return r = o ? -1 : d(t - 1, r), e = t, s > 0 ? (k(a, s), k(f, s, o), n * s) : (a.splice(s), 
             (o ? f.splice(0, -s) : f.splice(s)).reduce((e, t) => e - (-1 === t ? n : t), 0));
         },
-        S: () => l,
-        q: () => [ f.slice(), n ]
+        m: () => l,
+        H: () => [ f.slice(), n ]
     };
 }, M = e => "number" == typeof e ? e : e.length, E = (e, t) => "number" == typeof e ? t : e[t], C = (e, t, o = 0) => {
     let n = M(e);
     const r = "number" == typeof t, s = "auto" === t;
     let l = (r ? t : 40) + o, i = -1, c = 0, f = s, a = 0, u = 0, g = null;
     const w = [], S = [], _ = [], v = e => s || !!_[e], z = () => {
-        w.length || T(w, n);
+        w.length || k(w, n);
     }, y = e => {
         const t = w[e];
         return -1 === t ? l : t;
@@ -189,23 +186,23 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
         let t = i, o = S[t];
         for (;t < e; ) o += y(t), S[++t] = o;
         return i = e, o;
-    }, I = (e, t) => {
+    }, b = (e, t) => {
         w[e] = t, i = d(e, i);
-    }, b = e => w.length ? R(x, n, e) : l ? p($(e / l), 0, n - 1) : 0, k = () => d(a, n), O = () => h(n - u, k()), E = e => (w.length ? y(e) : l) - o;
+    }, I = e => w.length ? T(x, n, e) : l ? p($(e / l), 0, n - 1) : 0, R = () => d(a, n), O = () => h(n - u, R()), E = e => (w.length ? y(e) : l) - o;
     return {
         l: (e, t) => {
-            const r = x(k()), s = x(n) - x(O()), l = e + (r ? r - o : 0);
-            return [ b(l), b(h(l, t - (s ? s - o : 0))) ];
+            const r = x(R()), s = x(n) - x(O()), l = e + (r ? r - o : 0);
+            return [ I(l), I(h(l, t - (s ? s - o : 0))) ];
         },
-        i: b,
-        u: x,
-        h: E,
-        _: (e, t, n, r) => {
+        W: I,
+        i: x,
+        u: E,
+        S: (e, t, n, r) => {
             let s = e.reduce((e, [o, n]) => v(o) && t(o) ? e + (n - E(o)) : e, 0);
-            for (const [t, n] of e) v(t) && (z(), c += -1 === w[t] ? n : n - E(t), I(t, n + o));
+            for (const [t, n] of e) v(t) && (z(), c += -1 === w[t] ? n : n - E(t), b(t, n + o));
             if (f && r && c > r) {
                 let e = 0;
-                const t = b(n + s), o = [];
+                const t = I(n + s), o = [];
                 w.forEach((n, r) => {
                     -1 !== n && (n && o.push(n), r < t && e++);
                 }), i = -1, m(o);
@@ -214,42 +211,42 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
             }
             return s;
         },
-        $: (e, t = -1) => {
+        h: (e, t = -1) => {
             const n = w.length ? w[e] : -1;
             return -1 === t ? v(e) && -1 === n : n === t + o;
         },
         t: () => n ? x(n) - o : 0,
-        p: () => n,
-        m: e => {
+        $: () => n,
+        p: e => {
             const t = e - n;
-            return i = d(e - 1, i), n = e, w.length && (t > 0 ? T(w, t) : w.splice(t)), 0;
+            return i = d(e - 1, i), n = e, w.length && (t > 0 ? k(w, t) : w.splice(t)), 0;
         },
-        S: () => f,
-        B: v,
-        P: (e = 0, t = 0) => {
+        m: () => f,
+        q: v,
+        B: (e = 0, t = 0) => {
             a = e, u = t;
         },
-        Y: k,
+        P: R,
         V: O,
-        X: (e, t) => "number" == typeof t ? r ? t : null : r || s || "auto" === t ? null : e.map(e => null != e ? e[t] : null),
-        v: (e, t) => {
+        Y: (e, t) => "number" == typeof t ? r ? t : null : r || s || "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 === l) return;
-                const r = b(t) * (n - l);
+                const r = I(t) * (n - l);
                 return l = n, r;
             }
             if (e === g && n === _.length) return;
             g = e, _.length = n, z();
-            const r = b(t), s = x(r);
+            const r = I(t), s = x(r);
             let i;
             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 && (I(t, e), i = !0);
+                    w[t] !== e && (b(t, e), i = !0);
                 }
             }
             return i ? x(r) - s : void 0;
@@ -282,7 +279,7 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
     H(l, e, i, s, r);
     for (let e = s; e < t; e++) l.push(e);
     return l;
-}, B = (e, t) => d(e.rowIndex + (e.rowSpan || 1), t), P = (e, t) => d(e.colIndex + (e.colSpan || 1), t), Y = (e, t, o, n, r, s) => {
+}, B = (e, t) => d(e.rowIndex + (e.rowSpan || 1), t), P = (e, t) => d(e.colIndex + (e.colSpan || 1), t), V = (e, t, o, n, r, s) => {
     const l = t.length, i = n.length;
     let c = "[l0]", f = 0, a = 0, u = 0;
     for (;f < s; ) {
@@ -292,12 +289,12 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
         if (h === f) {
             g = f + 1;
             const t = o[a];
-            $ = null == t ? e.h(f) + "px" : t ? r : "minmax(" + e.h(f) + "px,auto)", a++;
-        } else g = d(h, u < i ? n[u] : s), $ = "minmax(" + (e.u(g - 1) + e.h(g - 1) - e.u(f)) + "px,auto)";
+            $ = null == t ? e.u(f) + "px" : t ? r : "minmax(" + e.u(f) + "px,auto)", a++;
+        } else g = d(h, u < i ? n[u] : s), $ = "minmax(" + (e.i(g - 1) + e.u(g - 1) - e.i(f)) + "px,auto)";
         c += " " + $ + " [l" + g + "]", f = g;
     }
     return c;
-}, V = (e, t, o, n, r) => {
+}, Y = (e, t, o, n, r) => {
     const s = {
         display: "grid",
         gridTemplateRows: "subgrid",
@@ -328,41 +325,41 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
         });
     }, y = () => {
         if (a || u) return a = !1, void x();
-        d = !1, e.H(2);
+        d = !1, e.A(2);
     }, x = () => {
         S(c), c = w(y, 150);
-    }, b = () => {
-        f = g(), d && (h = !0), l && e.H(6, l()), e.H(1, v()), x();
-    }, k = t => {
-        if (a || !e.C() || t.ctrlKey) return;
+    }, I = () => {
+        f = g(), d && (h = !0), l && e.A(6, l()), e.A(1, v()), x();
+    }, R = t => {
+        if (a || !e.O() || t.ctrlKey) return;
         const o = g() - f;
         150 > o && 50 < o && (n ? t.deltaX : t.deltaY) && (a = !0);
-    }, T = () => {
+    }, k = () => {
         u = !0, d = h = !1;
-    }, R = () => {
-        u = !1, I() && (d = !0);
+    }, T = () => {
+        u = !1, b() && (d = !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), S(c);
+            t.removeEventListener("scroll", I), t.removeEventListener("wheel", R), t.removeEventListener("touchstart", k), 
+            t.removeEventListener("touchend", T), S(c);
         },
         U: () => {
-            const [t, n] = e.A();
+            const [t, n] = e.C();
             if (!t) return;
             h && s && s(), h = !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 ? z(l) : o.scrollBy({
                 [p]: m(t),
                 behavior: "instant"
-            }), n && (i && i(), e.o() > e.t() && e.H(1, v()));
+            }), n && (i && i(), e.o() > e.t() && e.A(1, v()));
         },
         F: (t, o) => {
             let n, r, s;
@@ -372,16 +369,16 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
             }, c = () => {
                 if (!n) {
                     if (e.o() && (S(r), r = w(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.H(7), z(t(), o);
+                    e.A(7), z(t(), o);
                 }
             };
-            o && e.H(8, t()), (() => {
+            o && e.A(8, t()), (() => {
                 if (n) return;
                 let t;
-                s = e.W(2, () => {
+                s = e.L(2, () => {
                     t || (t = !0, _(() => {
                         t = !1, c();
                     }));
@@ -394,11 +391,11 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
     const l = /* @__PURE__ */ new WeakMap, i = X(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.H(4, t ? f : a)) : s = !1; else if (c.offsetParent) {
+        s = !0, e.A(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.H(3, i);
+        i.length && e.A(3, i);
     });
     return {
         K(s, l = s.parentElement) {
@@ -409,7 +406,7 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
                 });
             }), r[1](!0);
         },
-        I() {
+        _() {
             i.D(), n && n.D(), r[1](!1), r = v();
         },
         N: (e, t) => (l.set(e, t), i.J(e), () => {
@@ -421,7 +418,7 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
         ee() {
             n && n.U();
         },
-        te: e.L
+        te: e.M
     };
 }, D = (e, t) => {
     let o, n, r, s, l, i = v();
@@ -431,7 +428,7 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
             const o = c.get(e);
             null != o && r.push([ o, t ? s : i ]);
         }
-        r.length && e.H(3, r);
+        r.length && e.A(3, r);
     });
     return {
         K(c) {
@@ -439,13 +436,13 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, 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), p = l = () => {
-                e.H(4, d[t ? "clientWidth" : "clientHeight"]);
+                e.A(4, d[t ? "clientWidth" : "clientHeight"]);
             };
             u.addEventListener("resize", p), f.J(d), r = () => {
                 u.removeEventListener("resize", p);
             }, n = J(e, u, d, t, h, null, $), i[1](!0);
         },
-        I() {
+        _() {
             r && r(), f.D(), n && n.D(), i[1](!1), i = v();
         },
         N: (e, t) => (c.set(e, t), f.J(e), () => {
@@ -464,11 +461,11 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
     const i = /* @__PURE__ */ new WeakMap, c = /* @__PURE__ */ new WeakMap, f = X(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.H(4, h), t.H(4, d)) : l = !1; else if (u.offsetParent) {
+        r.G()), l = !0, e.A(4, h), t.A(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.H(3, f), a.length && t.H(3, a);
+        f.length && e.A(3, f), a.length && t.A(3, a);
     });
     return {
         async Z(e, t) {
@@ -484,7 +481,7 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, 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 = v();
         },
         N: (e, t, o) => (null != t && i.set(e, t), null != o && c.set(e, o), f.J(e), () => {
@@ -497,27 +494,27 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
 }, U = (e, t) => {
     e.Z(() => t);
 }, F = (e, t, o) => {
-    U(e, o + t.M());
+    U(e, o + t.k());
 }, K = (e, t, o, {align: n, smooth: r, offset: s = 0} = {}) => {
-    if (o = p(o, 0, t.O() - 1), "nearest" === n) {
-        const e = t.u(o), r = t.M();
+    if (o = p(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);
 }, N = (e, t, o, n, r, s, l) => {
-    const i = t.O(), c = o.Y(), f = o.V();
+    const i = t.R(), c = o.P(), f = o.V();
     r = p(r, 0, i - 1);
-    const a = A(n, c, f), u = W(a, r, f), g = u < 0 ? -1 : a[u], $ = () => o.u(c) + (g < 0 || g === r ? 0 : o.u(g + 1) - o.u(g)), m = () => o.u(i) - o.u(f);
+    const a = A(n, c, f), u = W(a, r, f), g = u < 0 ? -1 : a[u], $ = () => o.i(c) + (g < 0 || g === r ? 0 : o.i(g + 1) - o.i(g)), m = () => o.i(i) - o.i(f);
     if ("nearest" === s) {
         if (r < c || r >= f) return;
-        const e = $(), o = t.M() + e, n = t.o() - e - m(), l = t.h(r);
-        let i = t.u(r);
+        const e = $(), o = t.k() + e, n = t.o() - e - m(), l = t.u(r);
+        let i = t.i(r);
         if (g === r) {
             const e = (u + 1 < a.length ? a[u + 1] : f) - 1;
-            i = h(i, d(o, t.u(e) + t.h(e) - l));
+            i = h(i, d(o, t.i(e) + t.u(e) - l));
         }
         if (i < o) s = "start"; else {
             if (!(i + l > o + n)) return;
@@ -525,8 +522,8 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
         }
     }
     e.Z(l, () => {
-        const e = $(), o = t.h(r) - (t.o() - e - m());
-        return t.u(r) - e + ("end" === s ? o : "center" === s ? o / 2 : 0);
+        const e = $(), o = t.u(r) - (t.o() - e - m());
+        return t.i(r) - e + ("end" === s ? o : "center" === s ? o / 2 : 0);
     });
 }, Q = z ? r : o, Z = "current", ee = (e, t) => {
     if (Array.isArray(e)) for (const o of e) ee(o, t); else null == e || "boolean" == typeof e || t.push(e);
@@ -573,95 +570,97 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
         return ee(e, t), t;
     })(e);
     return [ e => o[e], o.length ];
-}, [ e, t ]), le = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: r, shift: s, horizontal: a, keepMounted: u, cache: d, startMargin: h = 0, ssrCount: g, as: $ = "div", item: p = "div", scrollRef: w, onScroll: S, onScrollEnd: v}, z) => {
+}, [ e, t ]), le = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: r, shift: s, horizontal: a, keepMounted: u, cache: d, startMargin: h = 0, ssrCount: g, as: $ = "div", item: p = "div", scrollRef: w, onScroll: S, onScrollEnd: v, onResize: z}, y) => {
     "use no memo";
-    const [y, x] = se(e, t), I = i(null), T = i(!!g), R = ne(S), M = ne(v), [E, C, L, A] = oe(() => {
-        const e = !!a, t = O(x, r, d), o = k(t, g);
+    const [x, b] = se(e, t), k = i(null), T = i(!!g), M = ne(S), E = ne(v), C = ne(z), [L, A, W, H] = oe(() => {
+        const e = !!a, t = O(b, r, d), o = R(t, g);
         return [ o, t, j(o, e), e ];
     });
-    x !== E.O() && E.H(5, [ x, s ]), h !== E.L() && E.H(6, h);
-    const [W, H] = l(E.k, void 0, E.k), q = E.C(), B = E.t(), P = [], Y = e => {
-        const t = y(e);
+    b !== L.R() && L.A(5, [ b, s ]), h !== L.M() && L.A(6, h);
+    const [q, B] = l(L.v, void 0, L.v), P = L.O(), V = L.t(), Y = [], X = e => {
+        const t = x(e);
         /* @__PURE__ */
         return c(re, {
-            ne: L.N,
+            ne: W.N,
             re: e,
-            se: E.u(e),
-            le: E.R(e),
+            se: L.i(e),
+            le: L.I(e),
             ie: p,
             oe: t,
-            ce: A,
+            ce: H,
             fe: T[Z]
         }, te(t, e));
     };
     if (Q(() => {
-        T[Z] = !1, E.W(1, e => {
-            e ? f(H) : H();
-        }), E.W(4, () => {
-            R.current && R.current(E.M());
-        }), E.W(8, () => {
-            M.current && M.current();
+        T[Z] = !1, L.L(1, e => {
+            e ? f(B) : B();
+        }), L.L(4, () => {
+            M.current && M.current(L.k());
+        }), L.L(8, () => {
+            E.current && E.current();
+        }), L.L(2, () => {
+            C.current && C.current();
         });
-        const e = I[Z];
+        const e = k[Z];
         return w ? _(() => {
-            w.current && L.K(e, w[Z]);
-        }) : L.K(e), () => {
-            E.I(), L.I();
+            w.current && W.K(e, w[Z]);
+        }) : W.K(e), () => {
+            L._(), W._();
         };
     }, []), Q(() => {
-        L.ee();
-    }, [ W ]), n(z, () => ({
+        W.ee();
+    }, [ q ]), n(y, () => ({
         get cache() {
-            return C.q();
+            return A.H();
         },
         get scrollOffset() {
-            return E.M();
+            return L.k();
         },
         get scrollSize() {
-            return b(E);
+            return I(L);
         },
         get viewportSize() {
-            return E.o();
+            return L.o();
         },
-        findItemIndex: E.T,
-        getItemOffset: E.u,
-        getItemSize: E.h,
-        scrollToIndex: (e, t) => K(L, E, e, t),
-        scrollTo: e => U(L, e),
-        scrollBy: e => F(L, E, e)
+        findItemIndex: e => A.W(e - L.M()),
+        getItemOffset: L.i,
+        getItemSize: L.u,
+        scrollToIndex: (e, t) => K(W, L, e, t),
+        scrollTo: e => U(W, e),
+        scrollBy: e => F(W, L, e)
     }), []), u) {
         const e = new Set(u);
-        for (let [t, n] = E.l(o); t <= n; t++) e.add(t);
+        for (let [t, n] = L.l(o); t <= n; t++) e.add(t);
         m([ ...e ]).forEach(e => {
-            e < x && P.push(Y(e));
+            e < b && Y.push(X(e));
         });
-    } else for (let [e, t] = E.l(o); e <= t; e++) P.push(Y(e));
+    } else for (let [e, t] = L.l(o); e <= t; e++) Y.push(X(e));
     /* @__PURE__ */
     return c($, {
-        ref: I,
+        ref: k,
         style: {
             contain: "size style",
             overflowAnchor: "none",
             flex: "none",
             position: "relative",
-            width: A ? B : "100%",
-            height: A ? "100%" : B,
-            pointerEvents: q ? "none" : void 0
+            width: H ? V : "100%",
+            height: H ? "100%" : V,
+            pointerEvents: P ? "none" : void 0
         },
-        children: P
+        children: Y
     });
-}), ie = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: n, shift: r, horizontal: s, keepMounted: l, cache: i, ssrCount: f, item: a, onScroll: u, onScrollEnd: d, style: h, ...g}, $) => /* @__PURE__ */ c("div", {
-    ...g,
+}), ie = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: n, shift: r, horizontal: s, keepMounted: l, cache: i, ssrCount: f, item: a, onScroll: u, onScrollEnd: d, onResize: h, style: g, ...$}, p) => /* @__PURE__ */ c("div", {
+    ...$,
     style: {
         display: "block",
         [s ? "overflowX" : "overflowY"]: "auto",
         contain: "strict",
         width: "100%",
         height: "100%",
-        ...h
+        ...g
     },
     children: /* @__PURE__ */ c(le, {
-        ref: $,
+        ref: p,
         data: t,
         bufferSize: o,
         itemSize: n,
@@ -673,67 +672,70 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
         item: a,
         onScroll: u,
         onScrollEnd: d,
+        onResize: h,
         children: e
     })
-})), ce = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: r, shift: s, horizontal: a, cache: u, ssrCount: d, as: h = "div", item: g = "div", onScroll: $, onScrollEnd: p}, m) => {
+})), ce = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: r, shift: s, horizontal: a, cache: u, ssrCount: d, as: h = "div", item: g = "div", onScroll: $, onScrollEnd: p, onResize: m}, w) => {
     "use no memo";
-    const [w, S] = se(e, t), _ = i(null), v = ne($), z = ne(p), y = i(!!d), [x, I, b, T] = oe(() => {
-        const e = !!a, t = O(S, r, u), o = k(t, d);
+    const [S, _] = se(e, t), v = i(null), z = ne($), y = ne(p), x = ne(m), b = i(!!d), [I, k, T, M] = oe(() => {
+        const e = !!a, t = O(_, r, u), o = R(t, d);
         return [ o, t, D(o, e), e ];
     });
-    S !== x.O() && x.H(5, [ S, s ]);
-    const [R, M] = l(x.k, void 0, x.k), E = x.C(), C = x.t(), L = [];
-    Q(() => (y[Z] = !1, x.W(1, e => {
-        e ? f(M) : M();
-    }), x.W(4, () => {
-        v.current && v.current();
-    }), x.W(8, () => {
+    _ !== I.R() && I.A(5, [ _, s ]);
+    const [E, C] = l(I.v, void 0, I.v), L = I.O(), A = I.t(), W = [];
+    Q(() => (b[Z] = !1, I.L(1, e => {
+        e ? f(C) : C();
+    }), I.L(4, () => {
         z.current && z.current();
-    }), b.K(_[Z]), () => {
-        x.I(), b.I();
+    }), I.L(8, () => {
+        y.current && y.current();
+    }), I.L(2, () => {
+        x.current && x.current();
+    }), T.K(v[Z]), () => {
+        I._(), T._();
     }), []), Q(() => {
-        b.ee();
-    }, [ R ]), n(m, () => ({
+        T.ee();
+    }, [ E ]), n(w, () => ({
         get cache() {
-            return I.q();
+            return k.H();
         },
         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) => K(b, x, e, t)
+        findItemIndex: e => k.W(e - I.M()),
+        getItemOffset: I.i,
+        getItemSize: I.u,
+        scrollToIndex: (e, t) => K(T, I, e, t)
     }), []);
-    for (let [e, t] = x.l(o); e <= t; e++) {
-        const t = w(e);
-        L.push(/* @__PURE__ */ c(re, {
-            ne: b.N,
+    for (let [e, t] = I.l(o); e <= t; e++) {
+        const t = S(e);
+        W.push(/* @__PURE__ */ c(re, {
+            ne: T.N,
             re: e,
-            se: x.u(e),
-            le: x.R(e),
+            se: I.i(e),
+            le: I.I(e),
             ie: g,
             oe: t,
-            ce: T,
-            fe: y[Z]
+            ce: M,
+            fe: b[Z]
         }, te(t, e)));
     }
     /* @__PURE__ */
     return c(h, {
-        ref: _,
+        ref: v,
         style: {
             contain: "size style",
             overflowAnchor: "none",
             flex: "none",
             position: "relative",
-            width: T ? C : "100%",
-            height: T ? "100%" : C,
-            pointerEvents: E ? "none" : void 0
+            width: M ? A : "100%",
+            height: M ? "100%" : A,
+            pointerEvents: L ? "none" : void 0
         },
-        children: L
+        children: W
     });
 }), fe = /*#__PURE__*/ t(({ae: {ue: e, de: t, he: o, ge: n, $e: r, pe: s, me: l, we: f}, oe: a, Se: u, _e: d, ve: h, ne: g}) => {
     const $ = i(null);
@@ -764,7 +766,7 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
         ve: e,
         ne: l
     }, t.ue))
-})), ue = ({ae: {Ie: e, we: t}, oe: o, be: n, xe: r, ne: s}) => /* @__PURE__ */ c("div", {
+})), ue = ({ae: {be: e, we: t}, oe: o, Ie: n, xe: r, ne: s}) => /* @__PURE__ */ c("div", {
     role: "rowgroup",
     style: t,
     children: e.map(e => /* @__PURE__ */ c(ae, {
@@ -774,12 +776,12 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
         xe: r,
         ne: s
     }, e.ze))
-}), de = /*#__PURE__*/ e(({children: e, rows: t, cols: o, rowHeight: r, colWidth: a, headerRows: g, sectionRows: $, footerRows: w, headerCols: S, footerCols: _, spans: v, keepMounted: z, bufferSize: y, gap: x = 0, ariaSort: I, onVerticalScroll: T, onHorizontalScroll: R, onScrollEnd: O, style: H, ...X}, J) => {
+}), de = /*#__PURE__*/ e(({children: e, rows: t, cols: o, rowHeight: r, colWidth: a, headerRows: g, sectionRows: $, footerRows: w, headerCols: S, footerCols: v, spans: z, keepMounted: y, bufferSize: x, gap: b = 0, ariaSort: k, onVerticalScroll: T, onHorizontalScroll: O, onScrollEnd: H, onResize: X, style: J, ...j}, D) => {
     "use no memo";
-    const j = i(null), D = ne(T), U = ne(R), F = ne(O), [K, ee, te, re, se] = oe(() => {
-        const e = C(t, r, x), n = C(o, a, x), s = k(e), l = k(n);
+    const U = i(null), F = ne(T), K = ne(O), ee = ne(H), te = ne(X), [re, se, le, ie, ce] = oe(() => {
+        const e = C(t, r, b), n = C(o, a, b), s = R(e), l = R(n);
         return [ s, l, e, n, G(s, l) ];
-    }), le = s(() => te.X(t, r), [ t, r ]), ie = s(() => re.X(o, a), [ o, a ]), ce = s(() => ((e = u) => {
+    }), fe = s(() => le.Y(t, r), [ t, r ]), de = s(() => ie.Y(o, a), [ o, a ]), he = s(() => ((e = u) => {
         const t = /* @__PURE__ */ new Map;
         for (const o of e) {
             const e = o.rowIndex + (o.rowSpan || 1);
@@ -789,36 +791,37 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
             }
         }
         return t;
-    })(v), [ v ]);
-    te.P(g, w), re.P(S, _);
-    const fe = M(t), de = M(o);
-    fe !== K.O() && K.H(5, [ fe ]), de !== ee.O() && ee.H(5, [ de ]), K.H(9, le), ee.H(9, ie);
-    const he = () => K.k() + ee.k(), [ge, $e] = l(he, void 0, he), pe = K.C() || ee.C(), me = K.u(0), we = ee.u(0), Se = K.O(), _e = ee.O(), ve = ((e, t, [o, n], [r, s], l, i = u, c = u, f) => {
-        const a = e.p(), g = t.p(), $ = e.Y(), w = e.V(), S = t.Y(), _ = t.V();
+    })(z), [ z ]);
+    le.B(g, w), ie.B(S, v);
+    const ge = M(t), $e = M(o);
+    ge !== re.R() && re.A(5, [ ge ]), $e !== se.R() && se.A(5, [ $e ]), re.A(9, le.X(fe, re.T())), 
+    se.A(9, ie.X(de, se.T()));
+    const pe = () => re.v() + se.v(), [me, we] = l(pe, void 0, pe), Se = re.O() || se.O(), _e = re.i(0), ve = se.i(0), ze = re.R(), ye = se.R(), xe = ((e, t, [o, n], [r, s], l, i = u, c = u, f) => {
+        const a = e.$(), g = t.$(), $ = e.P(), w = e.V(), S = t.P(), _ = t.V();
         o = p(o, $, w), n = d(n, w - 1), r = p(r, S, _), s = d(s, _ - 1);
-        const v = A(i, $, w), z = h(S - 1, 0), y = [], x = [], I = [];
-        for (const e of c) e.rowIndex < a && e.colIndex < g && (I.push(e), y.push(e.rowIndex));
-        const b = I.length, k = W(v, o, w), T = k < 0 ? -1 : v[k];
-        T >= 0 && y.push(T);
-        const R = q(m(y), a, $, o, n, w);
-        for (let e = 0; e < R.length; e++) for (const t of l.get(R[e]) || u) {
+        const v = A(i, $, w), z = h(S - 1, 0), y = [], x = [], b = [];
+        for (const e of c) e.rowIndex < a && e.colIndex < g && (b.push(e), y.push(e.rowIndex));
+        const I = b.length, R = W(v, o, w), k = R < 0 ? -1 : v[R];
+        k >= 0 && y.push(k);
+        const T = q(m(y), a, $, o, n, w);
+        for (let e = 0; e < T.length; e++) for (const t of l.get(T[e]) || u) {
             const {rowIndex: l, colIndex: i} = t, c = B(t, a), f = P(t, g);
-            if ((e < 1 || R[e - 1] < l) && i < g && (c - l > 1 || f - i > 1)) {
-                let e = (l < $ || h(l, o) < d(c, n + 1) || w < c || T >= l && T < c) && (i < S || h(i, r) < d(f, s + 1) || _ < f);
-                for (let t = 0; !e && t < b; t++) {
-                    const o = I[t];
+            if ((e < 1 || T[e - 1] < l) && i < g && (c - l > 1 || f - i > 1)) {
+                let e = (l < $ || h(l, o) < d(c, n + 1) || w < c || k >= l && k < c) && (i < S || h(i, r) < d(f, s + 1) || _ < f);
+                for (let t = 0; !e && t < I; t++) {
+                    const o = b[t];
                     e = o.rowIndex >= l && o.rowIndex < c && o.colIndex >= i && o.colIndex < f;
                 }
-                e && I.push(t);
+                e && b.push(t);
             }
         }
-        for (const {rowIndex: e, colIndex: t} of I) {
+        for (const {rowIndex: e, colIndex: t} of b) {
             const o = W(v, e, w);
             y.push(e), o >= 0 && y.push(v[o]), x.push(t);
         }
         m(y), m(x);
         const O = q(y, a, $, o, n, w), M = q(x, g, S, r, s, _), E = O.length, C = M.length, H = /* @__PURE__ */ new Map, X = [], J = [];
-        for (const e of I) {
+        for (const e of b) {
             const t = B(e, a), o = P(e, g);
             X.push(t), J.push(o);
             const n = M.indexOf(e.colIndex);
@@ -828,8 +831,8 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
             }
         }
         const j = [];
-        for (const e of M) j.push(!t.B(e) && null);
-        const D = [], G = e.u($), U = [];
+        for (const e of M) j.push(!t.q(e) && null);
+        const D = [], G = e.i($), U = [];
         let F = U;
         const K = L.get(e), N = /* @__PURE__ */ new Map;
         for (const l of O) {
@@ -839,29 +842,29 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
                 X.push(e);
                 const t = [];
                 U.push({
-                    ke: i ? -1 : c ? -2 : -3 - d,
-                    Ie: t,
-                    we: V(d, e, i || c ? 0 : null, c ? "bottom" : "top", 4)
+                    Re: i ? -1 : c ? -2 : -3 - d,
+                    be: t,
+                    we: Y(d, e, i || c ? 0 : null, c ? "bottom" : "top", 4)
                 }), F = t;
             } else d < 0 && (F = U);
-            const p = u >= 0 && l === d, m = i || c || l === T || l >= o && l <= n, y = p ? G : null, x = l * g, I = K && K.get(l), b = I && I.ye, k = [];
-            let R = 0, O = !e.B(l) && null, E = l + 1, L = !1;
+            const p = u >= 0 && l === d, m = i || c || l === k || l >= o && l <= n, y = p ? G : null, x = l * g, b = K && K.get(l), I = b && b.ye, R = [];
+            let T = 0, O = !e.q(l) && null, E = l + 1, L = !1;
             for (let e = 0; e < C; e++) {
                 const o = M[e], n = o < S, c = o >= _, u = n || c || o >= r && o <= s, d = H.get(x + o);
                 if (d ? d.rowIndex === l && d.colIndex === o : m && u) {
                     const r = d ? B(d, a) : l + 1, s = d ? P(d, g) : o + 1, u = r - l, $ = s - o, m = u > 1, w = $ > 1, S = m || w;
                     let _, v;
                     E = h(E, r);
-                    const y = n ? t.u(o) : null, x = c ? t.u(g) - t.u(s) : null;
+                    const y = n ? t.i(o) : null, x = c ? t.i(g) - t.i(s) : null;
                     !1 !== O || m || (_ = l, O = !0), !1 !== j[e] || w || (v = o, j[e] = !0);
-                    const I = i ? "columnheader" : o === z && (n || p) ? "rowheader" : "cell", T = S ? u : void 0, M = S ? $ : void 0, C = "cell" !== I && f && f.rowIndex === l && f.colIndex === o ? f.order : void 0;
+                    const b = i ? "columnheader" : o === z && (n || p) ? "rowheader" : "cell", k = S ? u : void 0, M = S ? $ : void 0, C = "cell" !== b && f && f.rowIndex === l && f.colIndex === o ? f.order : void 0;
                     let A;
-                    if (b) {
-                        const e = b.length;
-                        for (;R < e && b[R].ue < o; ) R++;
-                        R < e && b[R].ue === o && (A = b[R]);
+                    if (I) {
+                        const e = I.length;
+                        for (;T < e && I[T].ue < o; ) T++;
+                        T < e && I[T].ue === o && (A = I[T]);
                     }
-                    if (!A || A.de !== T || A.he !== M || A.Te !== y || A.Re !== x || A.ge !== _ || A.$e !== v || A.pe !== I || A.me !== C) {
+                    if (!A || A.de !== k || A.he !== M || A.ke !== y || A.Te !== x || A.ge !== _ || A.$e !== v || A.pe !== b || A.me !== C) {
                         let e = "1/l" + o;
                         S && (e += "/l" + r + "/l" + s);
                         const t = {
@@ -873,135 +876,142 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
                         t.minWidth = "100%"), (n || c) && (t[n ? "insetInlineStart" : "insetInlineEnd"] = (n ? y : x) + "px", 
                         t.position = "sticky", t.zIndex = 2), A = {
                             ue: o,
-                            de: T,
+                            de: k,
                             he: M,
                             ge: _,
                             $e: v,
-                            pe: I,
+                            pe: b,
                             me: C,
                             we: t,
-                            Te: y,
-                            Re: x
+                            ke: y,
+                            Te: x
                         }, L = !0;
                     }
-                    k.push(A);
+                    R.push(A);
                 }
             }
-            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: l,
-                    ye: k,
-                    we: V(l, E, y, "top", 3),
+                    ye: R,
+                    we: Y(l, E, y, "top", 3),
                     Oe: y
                 };
                 N.set(l, e), F.push(e);
             }
         }
         return L.set(e, N), {
-            Me: Y(e, O, D, m(X), "max-content", a),
-            Ee: Y(t, M, j, m(J), "minmax(max-content,auto)", g),
+            Me: V(e, O, D, m(X), "max-content", a),
+            Ee: V(t, M, j, m(J), "minmax(max-content,auto)", g),
             Ce: U
         };
-    })(te, re, K.l(y), ee.l(y), ce, $, z, I), ze = ne(e => ((e, t, o, n, r, s = u, {rowIndex: l, colIndex: i, rowAlign: c, colAlign: f}) => {
+    })(le, ie, re.l(x), se.l(x), he, $, y, k), be = ne(e => ((e, t, o, n, r, s = u, {rowIndex: l, colIndex: i, rowAlign: c, colAlign: f}) => {
         null != l && N(e, t, n, s, l, c, !1), null != i && N(e, o, r, u, i, f, !0);
-    })(se, K, ee, te, re, $, e));
+    })(ce, re, se, le, ie, $, e));
     return Q(() => {
         const e = e => {
-            e ? f($e) : $e();
+            e ? f(we) : we();
         };
-        K.W(1, e), ee.W(1, e);
+        re.L(1, e), se.L(1, e);
         let t = !1;
-        K.W(4, () => {
-            t = !0, D.current && D.current(K.M());
-        }), ee.W(4, () => {
-            t = !0, U.current && U.current(ee.M());
+        re.L(4, () => {
+            t = !0, F.current && F.current(re.k());
+        }), se.L(4, () => {
+            t = !0, K.current && K.current(se.k());
         });
         const o = () => {
-            !t || K.C() || ee.C() || (t = !1, F.current && F.current());
+            !t || re.O() || se.O() || (t = !1, ee.current && ee.current());
         };
-        return K.W(8, o), ee.W(8, o), se.K(j[Z]), () => {
-            K.I(), ee.I(), se.I();
+        let n;
+        re.L(8, o), se.L(8, o);
+        const r = () => {
+            n || (n = !0, _(() => {
+                n = !1, te.current && te.current();
+            }));
+        };
+        return re.L(2, r), se.L(2, r), ce.K(U[Z]), () => {
+            re._(), se._(), ce._();
         };
     }, []), Q(() => {
-        se.ee();
-    }, [ ge ]), n(J, () => ({
+        ce.ee();
+    }, [ me ]), n(D, () => ({
         get verticalScrollOffset() {
-            return K.M();
+            return re.k();
         },
         get horizontalScrollOffset() {
-            return ee.M();
+            return se.k();
         },
         get scrollHeight() {
-            return b(K);
+            return I(re);
         },
         get scrollWidth() {
-            return b(ee);
+            return I(se);
         },
         get viewportHeight() {
-            return K.o();
+            return re.o();
         },
         get viewportWidth() {
-            return ee.o();
+            return se.o();
         },
-        findRowIndex: K.T,
-        findColIndex: ee.T,
-        getRowOffset: K.u,
-        getColOffset: ee.u,
-        getRowSize: K.h,
-        getColSize: ee.h,
-        scrollToIndex: e => ze[Z](e),
+        findRowIndex: le.W,
+        findColIndex: ie.W,
+        getRowOffset: re.i,
+        getColOffset: se.i,
+        getRowSize: re.u,
+        getColSize: se.u,
+        scrollToIndex: e => be[Z](e),
         scrollTo: ({vertical: e, horizontal: t}) => ((e, t, o) => {
             null != t && e.Z(!1, () => t), null != o && e.Z(!0, () => o);
-        })(se, e, t),
+        })(ce, 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);
             }
-        })(se, K, ee, e, t)
+        })(ce, re, se, e, t)
     }), []), /* @__PURE__ */ c("div", {
         role: "table",
-        "aria-rowcount": Se,
-        "aria-colcount": _e,
-        ...X,
+        "aria-rowcount": ze,
+        "aria-colcount": ye,
+        ...j,
         style: {
             overflow: "auto",
             contain: "strict",
             width: "100%",
             height: "100%",
-            ...H
+            ...J
         },
         children: /* @__PURE__ */ c("div", {
-            ref: j,
+            ref: U,
             style: {
                 contain: "size style",
                 overflowAnchor: "none",
                 flex: "none",
                 display: "grid",
-                gridTemplateRows: ve.Me,
-                gridTemplateColumns: ve.Ee,
-                gap: x,
-                marginTop: me,
-                marginInlineStart: we,
-                height: b(K) - me,
-                pointerEvents: pe ? "none" : void 0
+                gridTemplateRows: xe.Me,
+                gridTemplateColumns: xe.Ee,
+                gap: b,
+                marginTop: _e,
+                marginInlineStart: ve,
+                height: I(re) - _e,
+                pointerEvents: Se ? "none" : void 0
             },
-            children: ve.Ce.map(n => "Ie" in n ? /* @__PURE__ */ c(ue, {
+            children: xe.Ce.map(n => "be" in n ? /* @__PURE__ */ c(ue, {
                 ae: n,
                 oe: e,
-                be: t,
+                Ie: t,
                 xe: o,
-                ne: se.N
-            }, n.ke) : /* @__PURE__ */ c(ae, {
+                ne: ce.N
+            }, n.Re) : /* @__PURE__ */ c(ae, {
                 ae: n,
                 oe: e,
                 Se: E(t, n.ze),
                 xe: o,
-                ne: se.N
+                ne: ce.N
             }, n.ze))
         })
     });
@@ -1022,163 +1032,161 @@ a), b = e => h(e.t(), e.o()), k = ({l: e, i: t, u: o, h: n, $: r, t: s, p: l, m:
         style: u,
         children: e
     });
-}), $e = /*#__PURE__*/ e(({children: e, data: t, lanes: o, gap: r, itemSize: s, bufferSize: a, keepMounted: u, cache: g, onScroll: $, onScrollEnd: p, style: w, ...S}, _) => {
+}), $e = /*#__PURE__*/ e(({children: e, data: t, lanes: o, gap: r, itemSize: s, bufferSize: a, keepMounted: u, cache: g, onScroll: $, onScrollEnd: p, onResize: w, style: S, ..._}, v) => {
     "use no memo";
-    const v = i(null), z = ne($), y = ne(p), [x, I, O] = oe(() => {
+    const z = i(null), y = ne($), x = ne(p), b = ne(w), [O, M, E] = oe(() => {
         const e = ((e, t, o = 0, n, r) => {
-            let s = h(t, 1), l = s, i = o, c = r && r[1] || n || 40, f = -1, a = n ? void 0 : /* @__PURE__ */ new Set, u = !n;
-            const g = r && r[0], $ = g ? T(g.slice(0, d(e, g.length)), h(0, e - g.length)) : T([], e), p = [], w = [], S = [], _ = e => {
-                const t = $[e];
-                return -1 === t ? c : t;
-            }, v = t => {
-                if (t = d(t, e - 1), f >= t) return;
+            let s = h(t, 1), l = r && r[1] || n || 40, i = -1, c = n ? void 0 : /* @__PURE__ */ new Set, f = !n;
+            const a = r && r[0], u = a ? k(a.slice(0, d(e, a.length)), h(0, e - a.length)) : k([], e), g = [], $ = [], p = [], w = e => {
+                const t = u[e];
+                return -1 === t ? l : t;
+            }, S = t => {
+                if (t = d(t, e - 1), i >= t) return;
                 const n = [], r = [];
                 for (let e = 0; e < s; e++) n.push(0), r.push(-1);
-                for (let e = f, t = s; e >= 0 && t; e--) {
-                    const o = w[e];
-                    -1 === r[o] && (r[o] = e, n[o] = p[e] + _(e), t--);
+                for (let e = i, t = s; e >= 0 && t; e--) {
+                    const o = $[e];
+                    -1 === r[o] && (r[o] = e, n[o] = g[e] + w(e), t--);
                 }
-                for (;f < t; ) {
-                    const e = ++f;
-                    let t = 0, l = 1 / 0, i = 1 / 0;
+                for (;i < t; ) {
+                    const e = ++i;
+                    let t = 0, l = 1 / 0, c = 1 / 0;
                     for (let e = 0; e < s; e++) {
                         const s = n[e] + (r[e] >= 0 ? o : 0);
-                        (s < l || s === l && r[e] < i) && (t = e, l = s, i = r[e]);
+                        (s < l || s === l && r[e] < c) && (t = e, l = s, c = r[e]);
                     }
-                    p[e] = l, w[e] = t, n[t] = l + _(e), r[t] = e, S[e] = h(e ? S[e - 1] : 0, n[t]);
+                    g[e] = l, $[e] = t, n[t] = l + w(e), r[t] = e, p[e] = h(e ? p[e - 1] : 0, n[t]);
                 }
-            }, z = t => t >= e ? x() : (v(t), p[t]), y = e => (v(e), S[e]), x = () => e ? y(e - 1) : 0, I = t => {
+            }, _ = t => t >= e ? z() : (S(t), g[t]), v = e => (S(e), p[e]), z = () => e ? v(e - 1) : 0, y = t => {
                 if (!e) return 0;
-                const o = R(y, e, t);
-                return y(o) <= t ? o + 1 : o;
+                const o = T(v, e, t);
+                return v(o) <= t ? o + 1 : o;
             };
             return {
                 l: (t, o) => {
-                    const n = R(z, e, o);
-                    return [ d(I(t), n), n ];
+                    const n = T(_, e, o);
+                    return [ d(y(t), n), n ];
                 },
-                i: t => R(z, e, t),
-                u: z,
-                h: _,
-                $: (e, t = -1) => $[e] === t,
-                _: (t, n, r, l) => {
-                    let i = I(r);
-                    for (;i > 0 && !n(i - 1); ) i--;
-                    for (;i < e && n(i); ) i++;
-                    const h = z(i);
-                    for (const [e, o] of t) $[e] = o, a && a.add(e), f = d(e - 1, f);
-                    let g = z(i) - h;
-                    if (a && l) {
+                i: _,
+                u: w,
+                h: (e, t = -1) => u[e] === t,
+                S: (t, n, r, a) => {
+                    let h = y(r);
+                    for (;h > 0 && !n(h - 1); ) h--;
+                    for (;h < e && n(h); ) h++;
+                    const g = _(h);
+                    for (const [e, o] of t) u[e] = o, c && c.add(e), i = d(e - 1, i);
+                    let $ = _(h) - g;
+                    if (c && a) {
                         const e = [];
                         let t = 0;
-                        if (a.forEach(n => {
-                            const r = $[n];
+                        if (c.forEach(n => {
+                            const r = u[n];
                             r > 0 && (e.push(r), t += r + o);
-                        }), t > l * s) {
+                        }), t > a * s) {
                             m(e);
-                            const t = e.length, o = t / 2 | 0, n = t % 2 == 0 ? (e[o - 1] + e[o]) / 2 : e[o], s = I(r + g), l = z(s);
-                            c = n, f = -1, g += z(s) - l, a = void 0, u = !1;
+                            const t = e.length, o = t / 2 | 0, n = t % 2 == 0 ? (e[o - 1] + e[o]) / 2 : e[o], s = y(r + $), a = _(s);
+                            l = n, i = -1, $ += _(s) - a, c = void 0, f = !1;
                         }
                     }
-                    return g;
+                    return $;
                 },
-                t: x,
-                p: () => e,
-                m: t => {
+                t: z,
+                $: () => e,
+                p: t => {
                     const o = t - e;
-                    return f = d(t - 1, f), e = t, o > 0 ? T($, o) : $.splice(o), 0;
-                },
-                v: (e, t) => {
-                    if (l === s && i === o) return;
-                    const r = I(t), c = z(r);
-                    return s = l, o = i, f = -1, a = n ? void 0 : /* @__PURE__ */ new Set, z(r) - c;
+                    return i = d(t - 1, i), e = t, o > 0 ? k(u, o) : u.splice(o), 0;
                 },
-                We: (e, t = 0) => {
-                    l = h(e, 1), i = t;
+                X: (e, t = 0, r) => {
+                    if ((e = h(e, 1)) === s && t === o) return;
+                    const l = y(r), f = _(l);
+                    return s = e, o = t, i = -1, c = n ? void 0 : /* @__PURE__ */ new Set, _(l) - f;
                 },
-                S: () => u,
-                q: () => [ $.slice(), c ],
-                He: () => s,
-                qe: () => o,
-                Be: e => (v(e), w[e])
+                m: () => f,
+                H: () => [ u.slice(), l ],
+                We: () => s,
+                He: () => o,
+                qe: e => (S(e), $[e])
             };
-        })(t.length, o, r, s, g), n = k(e);
+        })(t.length, o, r, s, g), n = R(e);
         return [ n, e, j(n, !1) ];
     });
-    t.length !== x.O() && x.H(5, [ t.length ]), I.We(o, r), x.H(9, void 0);
-    const [M, E] = l(x.k, void 0, x.k), C = x.C(), L = x.t();
-    Q(() => (x.W(1, e => {
-        e ? f(E) : E();
-    }), x.W(4, () => {
-        z.current && z.current(x.M());
-    }), x.W(8, () => {
-        y.current && y.current();
-    }), O.K(v[Z]), () => {
-        x.I(), O.I();
+    t.length !== O.R() && O.A(5, [ t.length ]), O.A(9, M.X(o, r, O.T()));
+    const [C, L] = l(O.v, void 0, O.v), A = O.O(), W = O.t();
+    Q(() => (O.L(1, e => {
+        e ? f(L) : L();
+    }), O.L(4, () => {
+        y.current && y.current(O.k());
+    }), O.L(8, () => {
+        x.current && x.current();
+    }), O.L(2, () => {
+        b.current && b.current();
+    }), E.K(z[Z]), () => {
+        O._(), E._();
     }), []), Q(() => {
-        O.ee();
-    }, [ M ]), n(_, () => ({
+        E.ee();
+    }, [ C ]), n(v, () => ({
         get cache() {
-            return I.q();
+            return M.H();
         },
         get scrollOffset() {
-            return x.M();
+            return O.k();
         },
         get scrollSize() {
-            return b(x);
+            return I(O);
         },
         get viewportSize() {
-            return x.o();
+            return O.o();
         },
-        getItemOffset: x.u,
-        getItemSize: x.h,
-        scrollToIndex: (e, t) => K(O, x, e, t),
-        scrollTo: e => U(O, e),
-        scrollBy: e => F(O, x, e)
+        getItemOffset: O.i,
+        getItemSize: O.u,
+        scrollToIndex: (e, t) => K(E, O, e, t),
+        scrollTo: e => U(E, e),
+        scrollBy: e => F(E, O, e)
     }), []);
-    const A = [], W = I.He(), H = I.qe(), q = he(1 / W, H / W - H), B = o => {
-        const n = e(t[o], o), r = I.Be(o);
+    const H = [], q = M.We(), B = M.He(), P = he(1 / q, B / q - B), V = o => {
+        const n = e(t[o], o), r = M.qe(o);
         /* @__PURE__ */
         return c(ge, {
-            ne: O.N,
+            ne: E.N,
             re: o,
-            se: x.u(o),
-            Le: he(r / W, r * H / W),
-            Ae: q,
-            le: x.R(o),
+            se: O.i(o),
+            Le: he(r / q, r * B / q),
+            Ae: P,
+            le: O.I(o),
             oe: n
         }, te(n, o));
     };
     if (u) {
         const e = new Set(u);
-        for (let [t, o] = x.l(a); t <= o; t++) e.add(t);
+        for (let [t, o] = O.l(a); t <= o; t++) e.add(t);
         m([ ...e ]).forEach(e => {
-            e < t.length && A.push(B(e));
+            e < t.length && H.push(V(e));
         });
-    } else for (let [e, t] = x.l(a); e <= t; e++) A.push(B(e));
+    } else for (let [e, t] = O.l(a); e <= t; e++) H.push(V(e));
     /* @__PURE__ */
     return c("div", {
-        ...S,
+        ..._,
         style: {
             display: "block",
             overflowY: "auto",
             contain: "strict",
             width: "100%",
             height: "100%",
-            ...w
+            ...S
         },
         children: /* @__PURE__ */ c("div", {
-            ref: v,
+            ref: z,
             style: {
                 contain: "size style",
                 overflowAnchor: "none",
                 flex: "none",
                 position: "relative",
                 width: "100%",
-                height: L,
-                pointerEvents: C ? "none" : void 0
+                height: W,
+                pointerEvents: A ? "none" : void 0
             },
-            children: A
+            children: H
         })
     });
 });