virtua 0.52.9 → 0.53.0

package/lib/index.cjs

@@ -6,7 +6,7 @@ Object.defineProperty(exports, Symbol.toStringTag, {
 
 let e = require("react"), t = require("react/jsx-runtime"), o = require("react-dom");
 
-var n, r = [], {min: s, max: l, abs: i, floor: c} = Math, a = (e, t, o) => s(o, l(t, e)), f = e => e.sort((e, t) => e - t), u = setTimeout, d = clearTimeout, h = "function" == typeof queueMicrotask ? queueMicrotask : e => {
+var n, r = [], {min: s, max: l, abs: i, floor: c} = Math, f = (e, t, o) => s(o, l(t, e)), a = e => e.sort((e, t) => e - t), u = setTimeout, d = clearTimeout, h = "function" == typeof queueMicrotask ? queueMicrotask : e => {
     Promise.resolve().then(e);
 }, g = () => {
     let e;
@@ -14,81 +14,81 @@ var n, r = [], {min: s, max: l, abs: i, floor: c} = Math, a = (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: a, m: f, S: u, _: d, v: h}, g = 0) => {
-    let $ = !!g, p = 1, m = 0, S = 0, _ = 0, v = 0, z = 0, y = 0, x = 0, b = 0, I = null, k = [ 0, $ ? l(g - 1, 0) : -1 ], R = !1;
-    const T = /* @__PURE__ */ new Set, M = () => _ - S, C = () => M() + z + v, O = e => o(e) - z, E = e => {
-        if (2 === b) return !0;
-        if (I && 1 === b) return e < I[0];
-        const t = M(), o = O(e), r = n(e);
-        return 1 !== x && 0 === b ? o + r <= t : o < t && o + r < t + m;
+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 || I && 1 === b ? z += e : v += e);
+        e && (w() && 0 !== x || b && 1 === I ? z += e : v += e);
     };
     return {
         I: () => {
-            T.clear();
+            R.clear();
         },
         k: () => p,
         l: (t = 200) => {
-            if (!R || $) return k;
+            if (!T || $) return k;
             let o, n;
             if (y) [o, n] = k; else {
-                let r = l(0, C()), i = r + m;
+                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)), 
-                I && (o = s(o, I[0]), n = l(n, I[1]));
+                b && (o = s(o, b[0]), n = l(n, b[1]));
             }
-            return [ l(o, 0), s(n, a() - 1) ];
+            return [ l(o, 0), s(n, f() - 1) ];
         },
-        R: e => t(e - S),
-        T: r,
-        u: O,
+        T: e => t(e - S),
+        R: r,
+        u: E,
         h: n,
-        M: a,
-        C: () => _,
-        O: () => 0 !== x,
+        O: f,
+        M: () => _,
+        C: () => 0 !== x,
         o: () => m,
         L: () => S,
         t: c,
-        q: () => (y = v, v = 0, [ y, 2 === b ]),
-        W: (e, t) => {
+        q: () => (y = v, v = 0, [ y, 2 === I ]),
+        A: (e, t) => {
             const o = [ e, t ];
-            return T.add(o), () => {
-                T.delete(o);
+            return R.add(o), () => {
+                R.delete(o);
             };
         },
-        A: (t, o) => {
+        W: (t, o) => {
             let n, s, l = 0;
             switch (t) {
               case 1:
                 {
-                    if (o === _ && 0 === b) break;
+                    if (o === _ && 0 === I) break;
                     const e = y;
                     y = 0;
                     const t = o - _, n = i(t);
-                    e && n < i(e) + 1 || 0 !== b || (x = t < 0 ? 2 : 1), $ && ($ = !1), _ = o, l = 4;
-                    const r = M();
+                    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);
                     break;
                 }
 
               case 2:
-                l = 8, 0 !== x && (n = !0, l += 1), x = 0, b = 0, I = null;
+                l = 8, 0 !== x && (n = !0, l += 1), x = 0, I = 0, b = null;
                 break;
 
               case 3:
                 {
                     const e = o.filter(([e, t]) => !r(e, t));
                     if (!e.length) break;
-                    L(d(e, E, C(), m)), l = 3, s = !0;
+                    L(d(e, C, M(), m)), l = 3, s = !0;
                     break;
                 }
 
               case 4:
-                m !== o && (m || (R = s = !0), m = o, l = 3);
+                m !== o && (m || (T = s = !0), m = o, l = 3);
                 break;
 
               case 5:
-                o[1] ? (L(f(o[0], !0)), b = 2, l = 1) : (f(o[0]), l = 1);
+                o[1] ? (L(a(o[0], !0)), I = 2, l = 1) : (a(o[0]), l = 1);
                 break;
 
               case 6:
@@ -96,20 +96,20 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: a, m:
                 break;
 
               case 7:
-                b = 1;
+                I = 1;
                 break;
 
               case 9:
                 {
-                    const e = h(o, C());
+                    const e = h(o, M());
                     null != e && (L(e), l = 3);
                     break;
                 }
 
               case 8:
-                I = e(o, o + m), l = 1;
+                b = e(o, o + m), l = 1;
             }
-            l && (p = 1 + (2147483647 & p), n && z && (v += z, z = 0), T.forEach(([e, t]) => {
+            l && (p = 1 + (2147483647 & p), n && z && (v += z, z = 0), R.forEach(([e, t]) => {
                 l & e && t(s);
             }));
         }
@@ -124,9 +124,9 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: a, m:
         const t = c((n + r) / 2);
         e(t) <= o ? (s = t, n = t + 1) : r = t - 1;
     }
-    return a(s, 0, t - 1);
+    return f(s, 0, t - 1);
 }, y = (e, t, o) => {
-    let n = o && o[1] || t || 40, r = -1, i = 0, c = !t, a = 0;
+    let n = o && o[1] || t || 40, r = -1, i = 0, c = !t, f = 0;
     const u = o && o[0], d = u ? v(u.slice(0, s(e, u.length)), l(0, e - u.length)) : v([], e), h = v([], e + 1), g = e => {
         const t = d[e];
         return -1 === t ? n : t;
@@ -141,22 +141,22 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: a, m:
     return {
         l: (t, o) => {
             let n, r;
-            return a = s(a, e - 1), $(a) <= t ? (r = z($, e, o, a), n = z($, e, t, a, r)) : (n = z($, e, t, void 0, a), 
-            r = z($, e, o, n)), a = n, [ n, r ];
+            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, a, u) => {
+        _: (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) {
                 let t = 0;
-                const o = z($, e, a + h), s = [];
+                const o = z($, e, f + h), s = [];
                 d.forEach((e, n) => {
                     -1 !== e && (e && s.push(e), n < o && t++);
-                }), r = -1, f(s);
+                }), r = -1, a(s);
                 const i = s.length, u = i / 2 | 0, g = i % 2 == 0 ? (s[u - 1] + s[u]) / 2 : s[u], p = n;
                 h += ((n = g) - p) * l(o - t, 0), c = !1;
             }
@@ -172,13 +172,13 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: a, m:
         S: () => c,
         H: () => [ d.slice(), n ]
     };
-}, x = e => "number" == typeof e ? e : e.length, b = (e, t) => "number" == typeof e ? t : e[t], I = (e, t, o = 0) => {
+}, x = e => "number" == typeof e ? e : e.length, I = (e, t) => "number" == typeof e ? t : e[t], b = (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], b = () => {
+    const w = [], S = [], _ = [], y = e => i || !!_[e], I = () => {
         w.length || v(w, n);
-    }, I = e => {
+    }, b = e => {
         const t = w[e];
         return -1 === t ? u : t;
     }, k = e => {
@@ -187,30 +187,30 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: a, m:
         if (d >= e) return S[e];
         d < 0 && (S[0] = 0, d = 0);
         let t = d, o = S[t];
-        for (;t < e; ) o += I(t), S[++t] = o;
+        for (;t < e; ) o += b(t), S[++t] = o;
         return d = e, o;
-    }, R = (e, t) => {
+    }, T = (e, t) => {
         w[e] = t, d = s(e, d);
-    }, T = e => w.length ? z(k, n, e) : u ? a(c(e / u), 0, n - 1) : 0, M = () => s($, n), C = () => l(n - p, M()), O = e => (w.length ? I(e) : u) - o;
+    }, 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;
     return {
         l: (e, t) => {
-            const r = k(M()), s = k(n) - k(C()), i = e + (r ? r - o : 0);
-            return [ T(i), T(l(i, t - (s ? s - o : 0))) ];
+            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))) ];
         },
-        i: T,
+        i: R,
         u: k,
-        h: O,
+        h: E,
         _: (e, t, n, r) => {
-            let s = e.reduce((e, [o, n]) => y(o) && t(o) ? e + (n - O(o)) : e, 0);
-            for (const [t, n] of e) y(t) && (b(), h += -1 === w[t] ? n : n - O(t), R(t, n + o));
+            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));
             if (g && r && h > r) {
                 let e = 0;
-                const t = T(n + s), o = [];
+                const t = R(n + s), o = [];
                 w.forEach((n, r) => {
                     -1 !== n && (n && o.push(n), r < t && e++);
-                }), d = -1, f(o);
-                const r = o.length, i = r / 2 | 0, c = r % 2 == 0 ? (o[i - 1] + o[i]) / 2 : o[i], a = u;
-                s += ((u = c) - a) * l(t - e, 0), g = !1;
+                }), d = -1, a(o);
+                const r = o.length, i = r / 2 | 0, c = r % 2 == 0 ? (o[i - 1] + o[i]) / 2 : o[i], f = u;
+                s += ((u = c) - f) * l(t - e, 0), g = !1;
             }
             return s;
         },
@@ -225,41 +225,41 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: a, m:
             return d = s(e - 1, d), n = e, w.length && (t > 0 ? v(w, t) : w.splice(t)), 0;
         },
         S: () => g,
-        P: y,
-        B: (e = 0, t = 0) => {
+        B: y,
+        P: (e = 0, t = 0) => {
             $ = e, p = t;
         },
+        Y: O,
         V: M,
-        X: C,
-        Y: (e, t) => "number" == typeof t ? r ? t : null : r || i || "auto" === t ? null : e.map(e => null != e ? e[t] : null),
+        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) => {
             if (null == e) return;
             if ("number" == typeof e) {
                 const n = e + o;
                 if (n === u) return;
-                const r = T(t) * (n - u);
+                const r = R(t) * (n - u);
                 return u = n, r;
             }
             if (e === m && n === _.length) return;
-            m = e, _.length = n, b();
-            const r = T(t), s = k(r);
+            m = e, _.length = n, I();
+            const r = R(t), s = k(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 && (R(t, e), l = !0);
+                    w[t] !== e && (T(t, e), l = !0);
                 }
             }
             return l ? k(r) - s : void 0;
         }
     };
-}, k = /*#__PURE__*/ new WeakMap, R = (e, t, o) => {
+}, k = /*#__PURE__*/ new WeakMap, T = (e, t, o) => {
     const n = [];
     for (const r of e) r >= t && r < o && n.push(r);
-    return f(n);
-}, T = (e, t, o) => {
+    return a(n);
+}, R = (e, t, o) => {
     if (t >= o) return -1;
     let n = 0, r = e.length;
     for (;n < r; ) {
@@ -267,36 +267,36 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: a, m:
         e[o] <= t ? n = o + 1 : r = o;
     }
     return n - 1;
-}, M = (e, t, o, n, r) => {
+}, O = (e, t, o, n, r) => {
     const s = t.length;
     for (;o < s && t[o] < n; o++) {
         const n = t[o];
         n > r && (e.push(n), r = n);
     }
     return o;
-}, C = (e, t, o, n, r, s) => {
+}, M = (e, t, o, n, r, s) => {
     const l = [];
     for (let e = 0; e < o; e++) l.push(e);
-    const i = M(l, e, 0, n, o - 1);
+    const i = O(l, e, 0, n, o - 1);
     for (let e = n; e <= r; e++) l.push(e);
-    M(l, e, i, s, r);
+    O(l, e, i, s, r);
     for (let e = s; e < t; e++) l.push(e);
     return l;
-}, O = (e, t) => s(e.rowIndex + (e.rowSpan || 1), t), E = (e, t) => s(e.colIndex + (e.colSpan || 1), t), L = (e, t, o, n, r, l) => {
+}, E = (e, t) => s(e.rowIndex + (e.rowSpan || 1), t), C = (e, t) => s(e.colIndex + (e.colSpan || 1), t), L = (e, t, o, n, r, l) => {
     const i = t.length, c = n.length;
-    let a = "[l0]", f = 0, u = 0, d = 0;
-    for (;f < l; ) {
-        for (;d < c && n[d] <= f; ) d++;
+    let f = "[l0]", a = 0, u = 0, d = 0;
+    for (;a < l; ) {
+        for (;d < c && n[d] <= a; ) d++;
         const h = u < i ? t[u] : l;
         let g, $;
-        if (h === f) {
-            g = f + 1;
+        if (h === a) {
+            g = a + 1;
             const t = o[u];
-            $ = null == t ? e.h(f) + "px" : t ? r : "minmax(" + e.h(f) + "px,auto)", u++;
-        } else g = s(h, d < c ? n[d] : l), $ = "minmax(" + (e.u(g - 1) + e.h(g - 1) - e.u(f)) + "px,auto)";
-        a += " " + $ + " [l" + g + "]", f = g;
+            $ = 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)";
+        f += " " + $ + " [l" + g + "]", a = g;
     }
-    return a;
+    return f;
 }, q = (e, t, o, n, r) => {
     const s = {
         display: "grid",
@@ -306,7 +306,7 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: a, m:
         gridRow: "l" + e + "/l" + t
     };
     return null != o && (s.position = "sticky", s[n] = o + "px", s.zIndex = r), s;
-}, W = e => {
+}, A = e => {
     let t;
     return {
         j(o) {
@@ -319,49 +319,50 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: a, m:
             t && t.disconnect();
         }
     };
-}, A = (e, t, o, n, r, s, l) => {
-    let i, c, a = 0, f = !1, g = !1, $ = !1, p = !1;
+}, W = (e, t, o, n, r, s, l) => {
+    let i, c, f = 0, a = !1, g = !1, $ = !1, p = !1;
     const m = Date.now, S = n ? "scrollLeft" : "scrollTop", _ = n ? "left" : "top", v = e => r ? -e : e, z = () => v(o[S]), y = (e, t) => {
         o.scrollTo({
             [_]: v(e),
             behavior: t ? "smooth" : "instant"
         });
     }, x = () => {
-        if (f || g) return f = !1, void b();
-        $ = !1, e.A(2);
-    }, b = () => {
-        d(c), c = u(x, 150);
+        if (a || g) return a = !1, void I();
+        $ = !1, e.W(2);
     }, I = () => {
-        a = m(), $ && (p = !0), l && e.A(6, l()), e.A(1, z()), b();
+        d(c), c = u(x, 150);
+    }, b = () => {
+        f = m(), $ && (p = !0), l && e.W(6, l()), e.W(1, z()), I();
     }, k = t => {
-        if (f || !e.O() || t.ctrlKey) return;
-        const o = m() - a;
-        150 > o && 50 < o && (n ? t.deltaX : t.deltaY) && (f = !0);
-    }, R = () => {
-        g = !0, $ = p = !1;
+        if (a || !e.C() || t.ctrlKey) return;
+        const o = m() - f;
+        150 > o && 50 < o && (n ? t.deltaX : t.deltaY) && (a = !0);
     }, T = () => {
+        g = !0, $ = p = !1;
+    }, R = () => {
         g = !1, w() && ($ = !0);
     };
-    return t.addEventListener("scroll", I), t.addEventListener("wheel", k, {
+    return t.addEventListener("scroll", b), t.addEventListener("wheel", k, {
         passive: !0
-    }), t.addEventListener("touchstart", R, {
+    }), t.addEventListener("touchstart", T, {
         passive: !0
-    }), t.addEventListener("touchend", T, {
+    }), t.addEventListener("touchend", R, {
         passive: !0
     }), {
+        G: b,
         D: () => {
-            t.removeEventListener("scroll", I), t.removeEventListener("wheel", k), t.removeEventListener("touchstart", R), 
-            t.removeEventListener("touchend", T), d(c);
+            t.removeEventListener("scroll", b), t.removeEventListener("wheel", k), t.removeEventListener("touchstart", T), 
+            t.removeEventListener("touchend", R), d(c);
         },
         U: () => {
             const [t, n] = e.q();
             if (!t) return;
             p && s && s(), p = !1;
-            const r = e.C(), l = r + t, c = e.L() + e.t() - e.o();
+            const r = e.M(), l = r + t, c = e.L() + e.t() - e.o();
             l <= 0 || l >= c || r >= c ? y(l) : o.scrollBy({
                 [_]: v(t),
                 behavior: "instant"
-            }), n && (i && i(), e.o() > e.t() && e.A(1, z()));
+            }), n && (i && i(), e.o() > e.t() && e.W(1, z()));
         },
         F: (t, o) => {
             let n, r, s;
@@ -371,295 +372,295 @@ n), S = e => l(e.t(), e.o()), _ = ({l: e, i: t, u: o, h: n, $: r, t: c, p: a, m:
             }, c = () => {
                 if (!n) {
                     if (e.o() && (d(r), r = u(l, 150)), o) {
-                        for (let [t, o] = e.l(0); t <= o; t++) if (e.T(t)) return;
+                        for (let [t, o] = e.l(0); t <= o; t++) if (e.R(t)) return;
                         l();
                     }
-                    e.A(7), y(t(), o);
+                    e.W(7), y(t(), o);
                 }
-            }, a = () => {
+            };
+            o && e.W(8, t()), (() => {
                 if (n) return;
                 let t;
-                s = e.W(2, () => {
+                s = e.A(2, () => {
                     t || (t = !0, h(() => {
                         t = !1, c();
                     }));
                 }), c();
-            };
-            o ? (e.A(8, t()), h(a)) : a();
+            })();
         }
     };
 }, H = (e, t) => {
-    let o, n, r = g();
-    const s = /* @__PURE__ */ new WeakMap, l = W(n => {
-        const r = [];
-        for (const {target: l, contentRect: {width: i, height: c}} of n) if (l === o) (i || c) && e.A(4, t ? i : c); else if (l.offsetParent) {
-            const e = s.get(l);
-            null != e && r.push([ e, t ? i : c ]);
+    let o, n, r = g(), s = !0;
+    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) {
+            const e = l.get(c);
+            null != e && i.push([ e, t ? f : a ]);
         }
-        r.length && e.A(3, r);
+        i.length && e.W(3, i);
     });
     return {
-        G(s, i = s.parentElement) {
-            l.j(o = i), n = A(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
-                const e = t ? "overflowX" : "overflowY", o = i.style, n = o[e];
+        K(s, l = s.parentElement) {
+            i.j(o = l), n = W(e, l, l, t, t && "rtl" === getComputedStyle(l).direction, () => {
+                const e = t ? "overflowX" : "overflowY", o = l.style, n = o[e];
                 o[e] = "hidden", u(() => {
                     o[e] = n;
                 });
             }), r[1](!0);
         },
         I() {
-            l.D(), n && n.D(), r[1](!1), r = g();
+            i.D(), n && n.D(), r[1](!1), r = g();
         },
-        K: (e, t) => (s.set(e, t), l.j(e), () => {
-            s.delete(e), l.J(e);
+        N: (e, t) => (l.set(e, t), i.j(e), () => {
+            l.delete(e), i.J(e);
         }),
-        async N(e, t) {
+        async Z(e, t) {
             await r[0] && n.F(e, t);
         },
-        Z() {
+        ee() {
             n && n.U();
         },
-        ee: e.L
+        te: e.L
     };
-}, P = (e, t) => {
+}, B = (e, t) => {
     let o, n, r, s, l, i = g();
-    const c = /* @__PURE__ */ new WeakMap, a = W(n => {
+    const c = /* @__PURE__ */ new WeakMap, f = A(n => {
         const r = [];
         for (const {target: e, contentRect: {width: s, height: i}} of n) if (e === o) l && l(); else if (e.offsetParent) {
             const o = c.get(e);
             null != o && r.push([ o, t ? s : i ]);
         }
-        r.length && e.A(3, r);
+        r.length && e.W(3, r);
     });
     return {
-        G(c) {
-            const f = p(c), u = m(f), d = o = f.scrollingElement, h = t && "rtl" === getComputedStyle(d).direction, g = (e, t, o, n, r = 0) => {
+        K(c) {
+            const a = p(c), u = m(a), d = o = a.scrollingElement, h = t && "rtl" === getComputedStyle(d).direction, g = (e, t, o, n, r = 0) => {
                 const s = n ? "offsetLeft" : "offsetTop", l = r + (h ? t.clientWidth - e[s] - e.offsetWidth : e[s]), i = e.offsetParent;
                 return e !== o && i ? g(i, t, o, n, l) : l;
-            }, $ = s = () => g(c, d, f.body, t), w = l = () => {
-                e.A(4, d[t ? "clientWidth" : "clientHeight"]);
+            }, $ = s = () => g(c, d, a.body, t), w = l = () => {
+                e.W(4, d[t ? "clientWidth" : "clientHeight"]);
             };
-            u.addEventListener("resize", w), a.j(d), r = () => {
+            u.addEventListener("resize", w), f.j(d), r = () => {
                 u.removeEventListener("resize", w);
-            }, n = A(e, u, d, t, h, null, $), i[1](!0);
+            }, n = W(e, u, d, t, h, null, $), i[1](!0);
         },
         I() {
-            r && r(), a.D(), n && n.D(), i[1](!1), i = g();
+            r && r(), f.D(), n && n.D(), i[1](!1), i = g();
         },
-        K: (e, t) => (c.set(e, t), a.j(e), () => {
-            c.delete(e), a.J(e);
+        N: (e, t) => (c.set(e, t), f.j(e), () => {
+            c.delete(e), f.J(e);
         }),
-        async N(e, t) {
+        async Z(e, t) {
             await i[0] && n.F(e, t);
         },
-        Z() {
+        ee() {
             n && n.U();
         },
-        ee: () => s()
+        te: () => s()
     };
-}, B = (e, t) => {
-    let o, n, r, s = g();
-    const l = /* @__PURE__ */ new WeakMap, i = /* @__PURE__ */ new WeakMap, c = W(n => {
-        const r = [], s = [];
-        for (const {target: c, contentRect: {width: a, height: f}} of n) if (c === o) (a || f) && (e.A(4, f), 
-        t.A(4, a)); else if (c.offsetParent) {
-            const e = l.get(c), t = i.get(c);
-            null != e && r.push([ e, f ]), null != t && s.push([ t, a ]);
+}, P = (e, t) => {
+    let o, n, r, s = g(), l = !0;
+    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) {
+            const e = i.get(u), t = c.get(u);
+            null != e && f.push([ e, h ]), null != t && a.push([ t, d ]);
         }
-        r.length && e.A(3, r), s.length && t.A(3, s);
+        f.length && e.W(3, f), a.length && t.W(3, a);
     });
     return {
-        async N(e, t) {
+        async Z(e, t) {
             await s[0] && (e ? r : n).F(t);
         },
-        G(l) {
-            const i = o = l.parentElement;
-            c.j(i);
-            const a = (e, t) => A(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
+        K(l, i = l.parentElement) {
+            f.j(o = i);
+            const c = (e, t) => W(e, i, i, t, t && "rtl" === getComputedStyle(i).direction, () => {
                 const e = t ? "overflowX" : "overflowY", o = i.style, n = o[e];
                 o[e] = "hidden", u(() => {
                     o[e] = n;
                 });
             });
-            n = a(e, !1), r = a(t, !0), s[1](!0);
+            n = c(e, !1), r = c(t, !0), s[1](!0);
         },
         I() {
-            c.D(), n && n.D(), r && r.D(), s[1](!1), s = g();
+            f.D(), n && n.D(), r && r.D(), s[1](!1), s = g();
         },
-        K: (e, t, o) => (null != t && l.set(e, t), null != o && i.set(e, o), c.j(e), () => {
-            l.delete(e), i.delete(e), c.J(e);
+        N: (e, t, o) => (null != t && i.set(e, t), null != o && c.set(e, o), f.j(e), () => {
+            i.delete(e), c.delete(e), f.J(e);
         }),
-        Z() {
+        ee() {
             n && n.U(), r && r.U();
         }
     };
-}, V = (e, t) => {
-    e.N(() => t);
+}, Y = (e, t) => {
+    e.Z(() => t);
+}, V = (e, t, o) => {
+    Y(e, o + t.M());
 }, X = (e, t, o, {align: n, smooth: r, offset: s = 0} = {}) => {
-    if (o = a(o, 0, t.M() - 1), "nearest" === n) {
-        const e = t.u(o), r = t.C();
+    if (o = f(o, 0, t.O() - 1), "nearest" === n) {
+        const e = t.u(o), r = t.M();
         if (e < r) n = "start"; else {
             if (!(e + t.h(o) > r + t.o())) return;
             n = "end";
         }
     }
-    e.N(() => s + e.ee() + t.u(o) + ("end" === n ? t.h(o) - t.o() : "center" === n ? (t.h(o) - t.o()) / 2 : 0), r);
-}, Y = (e, t, o, n, r, i, c) => {
-    const f = t.M(), u = o.V(), d = o.X();
-    r = a(r, 0, f - 1);
-    const h = R(n, u, d), g = T(h, r, d), $ = g < 0 ? -1 : h[g], p = () => o.u(u) + ($ < 0 || $ === r ? 0 : o.u($ + 1) - o.u($)), m = () => o.u(f) - o.u(d);
+    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);
+}, j = (e, t, o, n, r, i, c) => {
+    const a = t.O(), u = o.Y(), 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);
     if ("nearest" === i) {
         if (r < u || r >= d) return;
-        const e = p(), o = t.C() + e, n = t.o() - e - m(), c = t.h(r);
-        let a = t.u(r);
+        const e = p(), o = t.M() + e, n = t.o() - e - m(), c = t.h(r);
+        let f = t.u(r);
         if ($ === r) {
             const e = (g + 1 < h.length ? h[g + 1] : d) - 1;
-            a = l(a, s(o, t.u(e) + t.h(e) - c));
+            f = l(f, s(o, t.u(e) + t.h(e) - c));
         }
-        if (a < o) i = "start"; else {
-            if (!(a + c > o + n)) return;
+        if (f < o) i = "start"; else {
+            if (!(f + c > o + n)) return;
             i = "end";
         }
     }
-    e.N(c, () => {
+    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);
     });
-}, j = $ ? e.useLayoutEffect : e.useEffect, J = "current", D = (e, t) => {
-    if (Array.isArray(e)) for (const o of e) D(o, t); else null == e || "boolean" == typeof e || t.push(e);
+}, 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);
 }, U = (e, t) => {
     const o = e.key;
     return null != o ? o : "_" + t;
 }, F = t => {
     const o = (0, e.useRef)(null);
     return o.current || (o.current = t());
-}, G = t => {
+}, K = t => {
     const o = (0, e.useRef)(t);
-    return j(() => {
-        o[J] = t;
+    return J(() => {
+        o[D] = t;
     }, [ t ]), o;
-}, K = /*#__PURE__*/ /*#__PURE__*/ (0, e.memo)(({te: o, oe: n, ne: r, re: s, se: l, le: i, ie: c, ce: a}) => {
-    const f = (0, e.useRef)(null);
-    j(() => n(f[J], r), [ r ]);
+}, N = /*#__PURE__*/ /*#__PURE__*/ (0, e.memo)(({oe: o, ne: n, re: r, se: s, le: l, ie: i, ce: c, fe: f}) => {
+    const a = (0, e.useRef)(null);
+    J(() => n(a[D], r), [ r ]);
     const u = (0, e.useMemo)(() => {
         const e = {
             contain: "layout style",
-            position: l && a ? void 0 : "absolute",
+            position: l && f ? void 0 : "absolute",
             [c ? "height" : "width"]: "100%",
             [c ? "top" : "left"]: 0,
             [c ? "insetInlineStart" : "top"]: s,
-            visibility: !l || a ? void 0 : "hidden"
+            visibility: !l || f ? void 0 : "hidden"
         };
         return c && (e.display = "inline-flex"), e;
-    }, [ s, l, a, c ]);
+    }, [ s, l, f, c ]);
     return "string" == typeof i ? /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(i, {
-        ref: f,
+        ref: a,
         style: u,
         children: o
     }) : /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(i, {
-        ref: f,
+        ref: a,
         style: u,
         index: r,
         children: o
     });
-}), N = (t, o) => (0, e.useMemo)(() => {
+}), Q = (t, o) => (0, e.useMemo)(() => {
     if ("function" == typeof t) return [ e => t(o[e], e), o.length ];
     const e = (e => {
         const t = [];
-        return D(e, t), t;
+        return G(e, t), t;
     })(t);
     return [ t => e[t], e.length ];
-}, [ t, o ]), Q = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: n, data: r, bufferSize: s, itemSize: l, shift: i, horizontal: c, keepMounted: a, cache: u, startMargin: d = 0, ssrCount: g, as: $ = "div", item: p = "div", scrollRef: m, onScroll: w, onScrollEnd: v}, z) => {
+}, [ 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) => {
     "use no memo";
-    const [x, b] = N(n, r), I = (0, e.useRef)(null), k = (0, e.useRef)(!!g), R = G(w), T = G(v), [M, C, O, E] = F(() => {
-        const e = !!c, t = y(b, l, u), o = _(t, g);
+    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 e = !!c, t = y(I, l, u), o = _(t, g);
         return [ o, t, H(o, e), e ];
     });
-    b !== M.M() && M.A(5, [ b, i ]), d !== M.L() && M.A(6, d);
-    const [L, q] = (0, e.useReducer)(M.k, void 0, M.k), W = M.O(), A = M.t(), P = [], B = e => {
+    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);
         /* @__PURE__ */ /* @__PURE__ */
-        return (0, t.jsx)(K, {
-            oe: O.K,
-            ne: e,
-            re: M.u(e),
-            se: M.T(e),
-            le: p,
-            te: o,
-            ie: E,
-            ce: k[J]
+        return (0, t.jsx)(N, {
+            ne: E.N,
+            re: e,
+            se: O.u(e),
+            le: O.R(e),
+            ie: p,
+            oe: o,
+            ce: C,
+            fe: k[D]
         }, U(o, e));
     };
-    if (j(() => {
-        k[J] = !1, M.W(1, e => {
+    if (J(() => {
+        k[D] = !1, O.A(1, e => {
             e ? (0, o.flushSync)(q) : q();
-        }), M.W(4, () => {
-            R.current && R.current(M.C());
-        }), M.W(8, () => {
-            T.current && T.current();
+        }), O.A(4, () => {
+            T.current && T.current(O.M());
+        }), O.A(8, () => {
+            R.current && R.current();
         });
-        const e = I[J];
+        const e = b[D];
         return m ? h(() => {
-            m.current && O.G(e, m[J]);
-        }) : O.G(e), () => {
-            M.I(), O.I();
+            m.current && E.K(e, m[D]);
+        }) : E.K(e), () => {
+            O.I(), E.I();
         };
-    }, []), j(() => {
-        O.Z();
+    }, []), J(() => {
+        E.ee();
     }, [ L ]), (0, e.useImperativeHandle)(z, () => ({
         get cache() {
-            return C.H();
+            return M.H();
         },
         get scrollOffset() {
-            return M.C();
+            return O.M();
         },
         get scrollSize() {
-            return S(M);
+            return S(O);
         },
         get viewportSize() {
-            return M.o();
-        },
-        findItemIndex: M.R,
-        getItemOffset: M.u,
-        getItemSize: M.h,
-        scrollToIndex: (e, t) => X(O, M, e, t),
-        scrollTo: e => V(O, e),
-        scrollBy: e => ((e, t, o) => {
-            V(e, o + t.C());
-        })(O, M, e)
-    }), []), a) {
-        const e = new Set(a);
-        for (let [t, o] = M.l(s); t <= o; t++) e.add(t);
-        f([ ...e ]).forEach(e => {
-            e < b && P.push(B(e));
+            return O.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)
+    }), []), f) {
+        const e = new Set(f);
+        for (let [t, o] = O.l(s); t <= o; t++) e.add(t);
+        a([ ...e ]).forEach(e => {
+            e < I && B.push(P(e));
         });
-    } else for (let [e, t] = M.l(s); e <= t; e++) P.push(B(e));
+    } else for (let [e, t] = O.l(s); e <= t; e++) B.push(P(e));
     /* @__PURE__ */ /* @__PURE__ */
     return (0, t.jsx)($, {
-        ref: I,
+        ref: b,
         style: {
             contain: "size style",
             overflowAnchor: "none",
             flex: "none",
             position: "relative",
-            width: E ? A : "100%",
-            height: E ? "100%" : A,
-            pointerEvents: W ? "none" : void 0
+            width: C ? W : "100%",
+            height: C ? "100%" : W,
+            pointerEvents: A ? "none" : void 0
         },
-        children: P
+        children: B
     });
-}), Z = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: e, data: o, bufferSize: n, itemSize: r, shift: s, horizontal: l, keepMounted: i, cache: c, ssrCount: a, item: f, onScroll: u, onScrollEnd: d, style: h, ...g}, $) => /* @__PURE__ */ /* @__PURE__ */ (0, 
+}), 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, 
 t.jsx)("div", {
     ...g,
     style: {
-        display: l ? "inline-block" : "block",
+        display: "block",
         [l ? "overflowX" : "overflowY"]: "auto",
         contain: "strict",
         width: "100%",
         height: "100%",
         ...h
     },
-    children: /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(Q, {
+    children: /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(Z, {
         ref: $,
         data: o,
         bufferSize: n,
@@ -668,56 +669,56 @@ t.jsx)("div", {
         horizontal: l,
         keepMounted: i,
         cache: c,
-        ssrCount: a,
-        item: f,
+        ssrCount: f,
+        item: a,
         onScroll: u,
         onScrollEnd: d,
         children: e
     })
-})), ee = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: n, data: r, bufferSize: s, itemSize: l, shift: i, horizontal: c, cache: a, ssrCount: f, as: u = "div", item: d = "div", onScroll: h, onScrollEnd: g}, $) => {
+})), 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}, $) => {
     "use no memo";
-    const [p, m] = N(n, r), w = (0, e.useRef)(null), S = G(h), v = G(g), z = (0, e.useRef)(!!f), [x, b, I, k] = F(() => {
-        const e = !!c, t = y(m, l, a), o = _(t, f);
-        return [ o, t, P(o, e), e ];
+    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);
+        return [ o, t, B(o, e), e ];
     });
-    m !== x.M() && x.A(5, [ m, i ]);
-    const [R, T] = (0, e.useReducer)(x.k, void 0, x.k), M = x.O(), C = x.t(), O = [];
-    j(() => (z[J] = !1, x.W(1, e => {
-        e ? (0, o.flushSync)(T) : T();
-    }), x.W(4, () => {
+    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.W(8, () => {
+    }), x.A(8, () => {
         v.current && v.current();
-    }), I.G(w[J]), () => {
-        x.I(), I.I();
-    }), []), j(() => {
-        I.Z();
-    }, [ R ]), (0, e.useImperativeHandle)($, () => ({
+    }), b.K(w[D]), () => {
+        x.I(), b.I();
+    }), []), J(() => {
+        b.ee();
+    }, [ T ]), (0, e.useImperativeHandle)($, () => ({
         get cache() {
-            return b.H();
+            return I.H();
         },
         get scrollOffset() {
-            return x.C();
+            return x.M();
         },
         get viewportSize() {
             return x.o();
         },
-        findItemIndex: x.R,
+        findItemIndex: x.T,
         getItemOffset: x.u,
         getItemSize: x.h,
-        scrollToIndex: (e, t) => X(I, x, e, t)
+        scrollToIndex: (e, t) => X(b, x, e, t)
     }), []);
     for (let [e, o] = x.l(s); e <= o; e++) {
         const o = p(e);
-        O.push(/* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(K, {
-            oe: I.K,
-            ne: e,
-            re: x.u(e),
-            se: x.T(e),
-            le: d,
-            te: o,
-            ie: k,
-            ce: z[J]
+        E.push(/* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(N, {
+            ne: b.N,
+            re: e,
+            se: x.u(e),
+            le: x.R(e),
+            ie: d,
+            oe: o,
+            ce: k,
+            fe: z[D]
         }, U(o, e)));
     }
     /* @__PURE__ */ /* @__PURE__ */
@@ -728,16 +729,16 @@ t.jsx)("div", {
             overflowAnchor: "none",
             flex: "none",
             position: "relative",
-            width: k ? C : "100%",
-            height: k ? "100%" : C,
-            pointerEvents: M ? "none" : void 0
+            width: k ? M : "100%",
+            height: k ? "100%" : M,
+            pointerEvents: O ? "none" : void 0
         },
-        children: O
+        children: E
     });
-}), te = /*#__PURE__*/ /*#__PURE__*/ (0, e.memo)(({ae: {fe: o, ue: n, de: r, he: s, ge: l, $e: i, pe: c, me: a}, te: f, we: u, Se: d, _e: h, oe: g}) => {
+}), 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);
-    return j(() => {
-        if (null != s || null != l) return g($[J], s, l);
+    return J(() => {
+        if (null != s || null != l) return g($[D], s, l);
     }, [ s, l, g ]), /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)("div", {
         ref: $,
         role: i,
@@ -745,42 +746,42 @@ t.jsx)("div", {
         "aria-rowspan": n,
         "aria-colspan": r,
         "aria-sort": c,
-        style: a,
-        children: f(u, d, {
+        style: f,
+        children: a(u, d, {
             rowIndex: h,
             colIndex: o
         })
     });
-}), oe = /*#__PURE__*/ /*#__PURE__*/ (0, e.memo)(({ae: {ve: e, ze: o, me: n}, te: r, we: s, ye: l, oe: i}) => /* @__PURE__ */ /* @__PURE__ */ (0, 
+}), ne = /*#__PURE__*/ /*#__PURE__*/ (0, e.memo)(({ae: {ze: e, ye: o, we: n}, oe: r, Se: s, xe: l, ne: i}) => /* @__PURE__ */ /* @__PURE__ */ (0, 
 t.jsx)("div", {
     role: "row",
     "aria-rowindex": e + 1,
     style: n,
-    children: o.map(o => /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(te, {
+    children: o.map(o => /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(oe, {
         ae: o,
-        te: r,
-        we: s,
-        Se: b(l, o.fe),
-        _e: e,
-        oe: i
-    }, o.fe))
-})), ne = ({ae: {xe: e, me: o}, te: n, be: r, ye: s, oe: l}) => /* @__PURE__ */ /* @__PURE__ */ (0, 
+        oe: r,
+        Se: s,
+        _e: I(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, 
 t.jsx)("div", {
     role: "rowgroup",
     style: o,
-    children: e.map(e => /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(oe, {
+    children: e.map(e => /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(ne, {
         ae: e,
-        te: n,
-        we: b(r, e.ve),
-        ye: s,
-        oe: l
-    }, e.ve))
-}), re = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: n, rows: i, cols: c, rowHeight: u, colWidth: d, headerRows: h, sectionRows: g, footerRows: $, headerCols: p, footerCols: m, spans: w, keepMounted: v, bufferSize: z, gap: y = 0, ariaSort: M, onVerticalScroll: W, onHorizontalScroll: A, onScrollEnd: H, style: P, ...V}, X) => {
+        oe: n,
+        Se: I(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) => {
     "use no memo";
-    const D = (0, e.useRef)(null), U = G(W), K = G(A), N = G(H), [Q, Z, ee, te, re] = F(() => {
-        const e = I(i, u, y), t = I(c, d, y), o = _(e), n = _(t);
-        return [ o, n, e, t, B(o, n) ];
-    }), se = (0, e.useMemo)(() => ee.Y(i, u), [ i, u ]), le = (0, e.useMemo)(() => te.Y(c, d), [ c, d ]), ie = (0, 
+    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);
+        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, 
     e.useMemo)(() => ((e = r) => {
         const t = /* @__PURE__ */ new Map;
         for (const o of e) {
@@ -792,78 +793,78 @@ t.jsx)("div", {
         }
         return t;
     })(w), [ w ]);
-    ee.B(h, $), te.B(p, m);
-    const ce = x(i), ae = x(c);
-    ce !== Q.M() && Q.A(5, [ ce ]), ae !== Z.M() && Z.A(5, [ ae ]), Q.A(9, se), Z.A(9, le);
-    const fe = () => Q.k() + Z.k(), [ue, de] = (0, e.useReducer)(fe, void 0, fe), he = Q.O() || Z.O(), ge = Q.u(0), $e = Z.u(0), pe = Q.M(), me = Z.M(), we = ((e, t, [o, n], [i, c], u, d = r, h = r, g) => {
-        const $ = e.p(), p = t.p(), m = e.V(), w = e.X(), S = t.V(), _ = t.X();
-        o = a(o, m, w), n = s(n, w - 1), i = a(i, S, _), c = s(c, _ - 1);
-        const v = R(d, m, w), z = l(S - 1, 0), y = [], x = [], b = [];
-        for (const e of h) e.rowIndex < $ && e.colIndex < p && (b.push(e), y.push(e.rowIndex));
-        const I = b.length, M = T(v, o, w), W = M < 0 ? -1 : v[M];
-        W >= 0 && y.push(W);
-        const A = C(f(y), $, m, o, n, w);
-        for (let e = 0; e < A.length; e++) for (const t of u.get(A[e]) || r) {
-            const {rowIndex: r, colIndex: a} = t, f = O(t, $), u = E(t, p);
-            if ((e < 1 || A[e - 1] < r) && a < p && (f - r > 1 || u - a > 1)) {
-                let e = (r < m || l(r, o) < s(f, n + 1) || w < f || W >= r && W < f) && (a < S || l(a, i) < s(u, c + 1) || _ < u);
-                for (let t = 0; !e && t < I; t++) {
-                    const o = b[t];
-                    e = o.rowIndex >= r && o.rowIndex < f && o.colIndex >= a && o.colIndex < u;
+    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();
+        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];
+        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];
+                    e = o.rowIndex >= r && o.rowIndex < a && o.colIndex >= f && o.colIndex < u;
                 }
-                e && b.push(t);
+                e && I.push(t);
             }
         }
-        for (const {rowIndex: e, colIndex: t} of b) {
-            const o = T(v, e, w);
+        for (const {rowIndex: e, colIndex: t} of I) {
+            const o = R(v, e, w);
             y.push(e), o >= 0 && y.push(v[o]), x.push(t);
         }
-        f(y), f(x);
-        const H = C(y, $, m, o, n, w), P = C(x, p, S, i, c, _), B = H.length, V = P.length, X = /* @__PURE__ */ new Map, Y = [], j = [];
-        for (const e of b) {
-            const t = O(e, $), o = E(e, p);
-            Y.push(t), j.push(o);
-            const n = P.indexOf(e.colIndex);
-            for (let r = H.indexOf(e.rowIndex); r < B && H[r] < t; r++) {
+        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 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 < V && P[r] < o; r++) X.set(t + P[r], e);
+                for (let r = n; r < Y && B[r] < o; r++) V.set(t + B[r], e);
             }
         }
         const J = [];
-        for (const e of P) J.push(!t.P(e) && null);
-        const D = [], U = e.u(m), F = [];
-        let G = F;
+        for (const e of B) J.push(!t.B(e) && null);
+        const D = [], G = e.u(m), U = [];
+        let F = U;
         const K = k.get(e), N = /* @__PURE__ */ new Map;
         for (const r of H) {
-            const s = r < m, a = r >= w, f = T(v, r, w), u = s ? 0 : a ? w : f < 0 ? -1 : v[f];
+            const s = r < m, f = r >= w, a = R(v, r, w), u = s ? 0 : f ? w : a < 0 ? -1 : v[a];
             if (r === u) {
-                const e = s ? m : a ? $ : f + 1 < v.length ? v[f + 1] : w;
-                Y.push(e);
+                const e = s ? m : f ? $ : a + 1 < v.length ? v[a + 1] : w;
+                X.push(e);
                 const t = [];
-                F.push({
-                    Ie: s ? -1 : a ? -2 : -3 - u,
-                    xe: t,
-                    me: q(u, e, s || a ? 0 : null, a ? "bottom" : "top", 4)
-                }), G = t;
-            } else u < 0 && (G = F);
-            const d = f >= 0 && r === u, h = s || a || r === W || r >= o && r <= n, y = d ? U : null, x = r * p, b = K && K.get(r), I = b && b.ze, k = [];
-            let R = 0, M = !e.P(r) && null, C = r + 1, L = !1;
-            for (let e = 0; e < V; e++) {
-                const o = P[e], n = o < S, a = o >= _, f = n || a || o >= i && o <= c, u = X.get(x + o);
-                if (u ? u.rowIndex === r && u.colIndex === o : h && f) {
-                    const i = u ? O(u, $) : r + 1, c = u ? E(u, p) : o + 1, f = i - r, h = c - o, m = f > 1, w = h > 1, S = m || w;
+                U.push({
+                    ke: s ? -1 : f ? -2 : -3 - u,
+                    Ie: 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);
+                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;
-                    C = l(C, i);
-                    const y = n ? t.u(o) : null, x = a ? t.u(p) - t.u(c) : null;
-                    !1 !== M || m || (_ = r, M = !0), !1 !== J[e] || w || (v = o, J[e] = !0);
-                    const b = s ? "columnheader" : o === z && (n || d) ? "rowheader" : "cell", T = S ? f : void 0, q = S ? h : void 0, W = "cell" !== b && g && g.rowIndex === r && g.colIndex === o ? g.order : void 0;
-                    let A;
-                    if (I) {
-                        const e = I.length;
-                        for (;R < e && I[R].fe < o; ) R++;
-                        R < e && I[R].fe === o && (A = I[R]);
+                    M = l(M, i);
+                    const y = n ? t.u(o) : null, x = f ? t.u(p) - t.u(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;
+                    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 (!A || A.ue !== T || A.de !== q || A.ke !== y || A.Re !== x || A.he !== _ || A.ge !== v || A.$e !== b || A.pe !== W) {
+                    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) {
                         let e = "1/l" + o;
                         S && (e += "/l" + i + "/l" + c);
                         const t = {
@@ -872,66 +873,66 @@ t.jsx)("div", {
                             gridArea: e
                         };
                         m && (t.height = "0px", t.minHeight = "100%", t.zIndex = 1), w && (t.width = "0px", 
-                        t.minWidth = "100%"), (n || a) && (t[n ? "insetInlineStart" : "insetInlineEnd"] = (n ? y : x) + "px", 
-                        t.position = "sticky", t.zIndex = 2), A = {
-                            fe: o,
-                            ue: T,
-                            de: q,
-                            he: _,
-                            ge: v,
-                            $e: b,
-                            pe: W,
-                            me: t,
-                            ke: y,
+                        t.minWidth = "100%"), (n || f) && (t[n ? "insetInlineStart" : "insetInlineEnd"] = (n ? y : x) + "px", 
+                        t.position = "sticky", t.zIndex = 2), W = {
+                            ue: o,
+                            de: R,
+                            he: q,
+                            ge: _,
+                            $e: v,
+                            pe: I,
+                            me: A,
+                            we: t,
+                            Te: y,
                             Re: x
                         }, L = !0;
                     }
-                    k.push(A);
+                    k.push(W);
                 }
             }
-            if (D.push(M), k.length) {
-                const e = b && !L && b.ze.length === k.length && b.Te === y ? b : {
-                    ve: r,
-                    ze: k,
-                    me: q(r, C, y, "top", 3),
-                    Te: y
+            if (D.push(O), k.length) {
+                const e = I && !L && I.ye.length === k.length && I.Oe === y ? I : {
+                    ze: r,
+                    ye: k,
+                    we: q(r, M, y, "top", 3),
+                    Oe: y
                 };
-                N.set(r, e), G.push(e);
+                N.set(r, e), F.push(e);
             }
         }
         return k.set(e, N), {
-            Me: L(e, H, D, f(Y), "max-content", $),
-            Ce: L(t, P, J, f(j), "minmax(max-content,auto)", p),
-            Oe: F
+            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, M), Se = G(e => ((e, t, o, n, s, l = r, {rowIndex: i, colIndex: c, rowAlign: a, colAlign: f}) => {
-        null != i && Y(e, t, n, l, i, a, !1), null != c && Y(e, o, s, r, c, f, !0);
-    })(re, Q, Z, ee, te, g, e));
-    return j(() => {
+    })(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}) => {
+        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));
+    return J(() => {
         const e = e => {
             e ? (0, o.flushSync)(de) : de();
         };
-        Q.W(1, e), Z.W(1, e);
+        Q.A(1, e), Z.A(1, e);
         let t = !1;
-        Q.W(4, () => {
-            t = !0, U.current && U.current(Q.C());
-        }), Z.W(4, () => {
-            t = !0, K.current && K.current(Z.C());
+        Q.A(4, () => {
+            t = !0, G.current && G.current(Q.M());
+        }), Z.A(4, () => {
+            t = !0, U.current && U.current(Z.M());
         });
         const n = () => {
-            !t || Q.O() || Z.O() || (t = !1, N.current && N.current());
+            !t || Q.C() || Z.C() || (t = !1, N.current && N.current());
         };
-        return Q.W(8, n), Z.W(8, n), re.G(D[J]), () => {
-            Q.I(), Z.I(), re.I();
+        return Q.A(8, n), Z.A(8, n), oe.K(X[D]), () => {
+            Q.I(), Z.I(), oe.I();
         };
-    }, []), j(() => {
-        re.Z();
-    }, [ ue ]), (0, e.useImperativeHandle)(X, () => ({
+    }, []), J(() => {
+        oe.ee();
+    }, [ ue ]), (0, e.useImperativeHandle)(V, () => ({
         get verticalScrollOffset() {
-            return Q.C();
+            return Q.M();
         },
         get horizontalScrollOffset() {
-            return Z.C();
+            return Z.M();
         },
         get scrollHeight() {
             return S(Q);
@@ -945,69 +946,240 @@ t.jsx)("div", {
         get viewportWidth() {
             return Z.o();
         },
-        findRowIndex: Q.R,
-        findColIndex: Z.R,
+        findRowIndex: Q.T,
+        findColIndex: Z.T,
         getRowOffset: Q.u,
         getColOffset: Z.u,
         getRowSize: Q.h,
         getColSize: Z.h,
-        scrollToIndex: e => Se[J](e),
+        scrollToIndex: e => Se[D](e),
         scrollTo: ({vertical: e, horizontal: t}) => ((e, t, o) => {
-            null != t && e.N(!1, () => t), null != o && e.N(!0, () => o);
-        })(re, e, t),
+            null != t && e.Z(!1, () => t), null != o && e.Z(!0, () => o);
+        })(oe, e, t),
         scrollBy: ({vertical: e, horizontal: t}) => ((e, t, o, n, r) => {
             if (null != n) {
-                const o = n + t.C();
-                e.N(!1, () => o);
+                const o = n + t.M();
+                e.Z(!1, () => o);
             }
             if (null != r) {
-                const t = r + o.C();
-                e.N(!0, () => t);
+                const t = r + o.M();
+                e.Z(!0, () => t);
             }
-        })(re, Q, Z, e, t)
+        })(oe, Q, Z, e, t)
     }), []), /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)("div", {
         role: "table",
         "aria-rowcount": pe,
         "aria-colcount": me,
-        ...V,
+        ...Y,
         style: {
             overflow: "auto",
             contain: "strict",
             width: "100%",
             height: "100%",
-            ...P
+            ...B
         },
         children: /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)("div", {
-            ref: D,
+            ref: X,
             style: {
                 contain: "size style",
                 overflowAnchor: "none",
                 flex: "none",
                 display: "grid",
                 gridTemplateRows: we.Me,
-                gridTemplateColumns: we.Ce,
+                gridTemplateColumns: we.Ee,
                 gap: y,
                 marginTop: ge,
                 marginInlineStart: $e,
                 height: S(Q) - ge,
                 pointerEvents: he ? "none" : void 0
             },
-            children: we.Oe.map(e => "xe" in e ? /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(ne, {
+            children: we.Ce.map(e => "Ie" in e ? /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(re, {
                 ae: e,
-                te: n,
+                oe: n,
                 be: i,
-                ye: c,
-                oe: re.K
-            }, e.Ie) : /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(oe, {
+                xe: c,
+                ne: oe.N
+            }, e.ke) : /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(ne, {
                 ae: e,
-                te: n,
-                we: b(i, e.ve),
-                ye: c,
-                oe: re.K
-            }, e.ve))
+                oe: n,
+                Se: I(i, e.ze),
+                xe: c,
+                ne: oe.N
+            }, e.ze))
+        })
+    });
+}), le = (e, t) => t ? `calc(${100 * e}% + ${t}px)` : 100 * e + "%", ie = /*#__PURE__*/ /*#__PURE__*/ (0, 
+e.memo)(({oe: o, ne: n, re: r, se: s, Le: l, qe: i, le: c}) => {
+    const f = (0, e.useRef)(null);
+    J(() => n(f[D], r), [ r ]);
+    const a = (0, e.useMemo)(() => ({
+        contain: "layout style",
+        position: "absolute",
+        top: s,
+        insetInlineStart: l,
+        width: i,
+        visibility: c ? "hidden" : void 0
+    }), [ s, l, i, c ]);
+    /* @__PURE__ */ /* @__PURE__ */
+    return (0, t.jsx)("div", {
+        ref: f,
+        style: a,
+        children: o
+    });
+}), ce = /*#__PURE__*/ /*#__PURE__*/ (0, e.forwardRef)(({children: n, data: r, lanes: i, gap: c, itemSize: f, bufferSize: u, cache: d, onScroll: h, onScrollEnd: g, style: $, ...p}, m) => {
+    "use no memo";
+    const w = (0, e.useRef)(null), y = K(h), x = K(g), [I, b, k] = 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;
+                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 (;d < t; ) {
+                    const e = ++d;
+                    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]);
+                }
+            }, x = t => t >= e ? b() : (y(t), m[t]), I = e => (y(e), S[e]), b = () => e ? I(e - 1) : 0, k = t => {
+                if (!e) return 0;
+                const o = z(I, e, t);
+                return I(o) <= t ? o + 1 : o;
+            };
+            return {
+                l: (t, o) => {
+                    const n = z(x, e, o);
+                    return [ s(k(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) {
+                        const e = [];
+                        let t = 0;
+                        if (h.forEach(n => {
+                            const r = p[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;
+                        }
+                    }
+                    return $;
+                },
+                t: b,
+                p: () => e,
+                m: 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;
+                },
+                Ae: (e, t = 0) => {
+                    c = l(e, 1), f = t;
+                },
+                S: () => g,
+                H: () => [ p.slice(), u ],
+                We: () => i,
+                He: () => o,
+                Be: e => (y(e), w[e])
+            };
+        })(r.length, i, c, f, d), t = _(e);
+        return [ t, e, H(t, !1) ];
+    });
+    r.length !== I.O() && I.W(5, [ r.length ]), b.Ae(i, c), I.W(9, void 0);
+    const [T, R] = (0, e.useReducer)(I.k, void 0, I.k), O = I.C(), M = I.t();
+    J(() => (I.A(1, e => {
+        e ? (0, o.flushSync)(R) : R();
+    }), I.A(4, () => {
+        y.current && y.current(I.M());
+    }), I.A(8, () => {
+        x.current && x.current();
+    }), k.K(w[D]), () => {
+        I.I(), k.I();
+    }), []), J(() => {
+        k.ee();
+    }, [ T ]), (0, e.useImperativeHandle)(m, () => ({
+        get cache() {
+            return b.H();
+        },
+        get scrollOffset() {
+            return I.M();
+        },
+        get scrollSize() {
+            return S(I);
+        },
+        get viewportSize() {
+            return I.o();
+        },
+        getItemOffset: I.u,
+        getItemSize: I.h,
+        scrollToIndex: (e, t) => X(k, I, e, t),
+        scrollTo: e => Y(k, e),
+        scrollBy: e => V(k, I, e)
+    }), []);
+    const E = [], C = b.We(), L = b.He(), q = le(1 / C, L / C - L), [A, W] = I.l(u);
+    for (let e = A; e <= W; e++) {
+        const o = n(r[e], e), s = b.Be(e);
+        E.push(/* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)(ie, {
+            ne: k.N,
+            re: e,
+            se: I.u(e),
+            Le: le(s / C, s * L / C),
+            qe: q,
+            le: I.R(e),
+            oe: o
+        }, U(o, e)));
+    }
+    /* @__PURE__ */ /* @__PURE__ */
+    return (0, t.jsx)("div", {
+        ...p,
+        style: {
+            display: "block",
+            overflowY: "auto",
+            contain: "strict",
+            width: "100%",
+            height: "100%",
+            ...$
+        },
+        children: /* @__PURE__ */ /* @__PURE__ */ (0, t.jsx)("div", {
+            ref: w,
+            style: {
+                contain: "size style",
+                overflowAnchor: "none",
+                flex: "none",
+                position: "relative",
+                width: "100%",
+                height: M,
+                pointerEvents: O ? "none" : void 0
+            },
+            children: E
         })
     });
 });
 
-exports.VGrid = re, exports.VList = Z, exports.Virtualizer = Q, exports.WindowVirtualizer = ee;
+exports.VGrid = se, exports.VList = ee, exports.VMasonry = ce, exports.Virtualizer = Z, 
+exports.WindowVirtualizer = te;
 //# sourceMappingURL=index.cjs.map