virtua 0.49.0 → 0.49.2

package/lib/index.cjs

@@ -1,66 +1,66 @@
 "use client";
 var e = require("react/jsx-runtime"), t = require("react"), o = require("react-dom");
 
-const n = null, {min: r, max: s, abs: i, floor: l} = Math, c = (e, t, o) => r(o, s(t, e)), f = e => [ ...e ].sort(((e, t) => e - t)), u = "function" == typeof queueMicrotask ? queueMicrotask : e => {
+const r = null, {min: n, max: s, abs: i, floor: l} = Math, c = (e, t, o) => n(o, s(t, e)), f = e => [ ...e ].sort((e, t) => e - t), u = "function" == typeof queueMicrotask ? queueMicrotask : e => {
     Promise.resolve().then(e);
 }, d = () => {
     let e;
-    return [ new Promise((t => {
+    return [ new Promise(t => {
         e = t;
-    })), e ];
+    }), e ];
 }, a = e => {
     let t;
     return () => (e && (t = e(), e = void 0), t);
 }, h = (e, t, o) => {
-    const n = o ? "unshift" : "push";
-    for (let o = 0; o < t; o++) e[n](-1);
+    const r = o ? "unshift" : "push";
+    for (let o = 0; o < t; o++) e[r](-1);
     return e;
 }, g = (e, t) => {
     const o = e.t[t];
     return -1 === o ? e.o : o;
 }, p = (e, t, o) => {
-    const n = -1 === e.t[t];
-    return e.t[t] = o, e.i = r(t, e.i), n;
+    const r = -1 === e.t[t];
+    return e.t[t] = o, e.i = n(t, e.i), r;
 }, v = (e, t) => {
     if (!e.l) return 0;
     if (e.i >= t) return e.u[t];
     e.i < 0 && (e.u[0] = 0, e.i = 0);
-    let o = e.i, n = e.u[o];
-    for (;o < t; ) n += g(e, o), e.u[++o] = n;
-    return e.i = t, n;
-}, _ = (e, t, o = 0, n = e.l - 1) => {
-    let r = o;
-    for (;o <= n; ) {
-        const s = l((o + n) / 2);
-        v(e, s) <= t ? (r = s, o = s + 1) : n = s - 1;
+    let o = e.i, r = e.u[o];
+    for (;o < t; ) r += g(e, o), e.u[++o] = r;
+    return e.i = t, r;
+}, _ = (e, t, o = 0, r = e.l - 1) => {
+    let n = o;
+    for (;o <= r; ) {
+        const s = l((o + r) / 2);
+        v(e, s) <= t ? (n = s, o = s + 1) : r = s - 1;
     }
-    return c(r, 0, e.l - 1);
+    return c(n, 0, e.l - 1);
 }, w = (e, t, o) => {
-    const n = t - e.l;
-    return e.i = o ? -1 : r(t - 1, e.i), e.l = t, n > 0 ? (h(e.u, n), h(e.t, n, o), 
-    e.o * n) : (e.u.splice(n), (o ? e.t.splice(0, -n) : e.t.splice(n)).reduce(((t, o) => t - (-1 === o ? e.o : o)), 0));
-}, S = "undefined" != typeof window, m = e => e.documentElement, $ = e => e.ownerDocument, z = e => e.defaultView, y = /*#__PURE__*/ a((() => !!/iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0)), b = /*#__PURE__*/ a((() => "scrollBehavior" in m(document).style)), x = e => s(e.h(), e.p()), I = (e, t = 40, o = 0, l, c = !1) => {
-    let u = !!o, d = 1, a = 0, S = 0, m = 0, $ = 0, z = 0, b = 0, x = 0, I = 0, k = n, R = [ 0, u ? s(o - 1, 0) : -1 ], T = 0, C = !1;
+    const r = t - e.l;
+    return e.i = o ? -1 : n(t - 1, e.i), e.l = t, r > 0 ? (h(e.u, r), h(e.t, r, o), 
+    e.o * r) : (e.u.splice(r), (o ? e.t.splice(0, -r) : e.t.splice(r)).reduce((t, o) => t - (-1 === o ? e.o : o), 0));
+}, S = "undefined" != typeof window, m = e => e.documentElement, $ = e => e.ownerDocument, z = e => e.defaultView, b = /*#__PURE__*/ a(() => !!/iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0), y = /*#__PURE__*/ a(() => "scrollBehavior" in m(document).style), x = e => s(e.h(), e.p()), I = (e, t = 40, o = 0, l, c = !1) => {
+    let u = !!o, d = 1, a = 0, S = 0, m = 0, $ = 0, z = 0, y = 0, x = 0, I = 0, k = r, R = [ 0, u ? s(o - 1, 0) : -1 ], T = 0, C = !1;
     const M = ((e, t, o) => ({
         o: t,
-        t: o ? h(o.slice(0, r(e, o.length)), s(0, e - o.length)) : h([], e),
+        t: o ? h(o.slice(0, n(e, o.length)), s(0, e - o.length)) : h([], e),
         l: e,
         i: -1,
         u: h([], e + 1)
-    }))(e, l ? l[1] : t, l && l[0]), O = new Set, E = () => m - S, H = () => E() + z + $, W = (e, t) => ((e, t, o, n) => {
-        if (n = r(n, e.l - 1), v(e, n) <= t) {
-            const r = _(e, o, n);
-            return [ _(e, t, n, r), r ];
+    }))(e, l ? l[1] : t, l && l[0]), O = new Set, E = () => m - S, H = () => E() + z + $, W = (e, t) => ((e, t, o, r) => {
+        if (r = n(r, e.l - 1), v(e, r) <= t) {
+            const n = _(e, o, r);
+            return [ _(e, t, r, n), n ];
         }
         {
-            const r = _(e, t, void 0, n);
-            return [ r, _(e, o, r) ];
+            const n = _(e, t, void 0, r);
+            return [ n, _(e, o, n) ];
         }
     })(M, e, t, R[0]), q = () => v(M, M.l), B = (e, t) => {
         const o = v(M, e) - z;
         return t ? q() - o - J(e) : o;
     }, J = e => g(M, e), A = (e, t = -1) => M.t[e] === t, L = e => {
-        e && (y() && 0 !== x || k && 1 === I ? z += e : $ += e);
+        e && (b() && 0 !== x || k && 1 === I ? z += e : $ += e);
     };
     return {
         v: () => {
@@ -71,12 +71,12 @@ const n = null, {min: r, max: s, abs: i, floor: l} = Math, c = (e, t, o) => r(o,
         m: (e = 200) => {
             if (!C || u) return R;
             let t, o;
-            if (b) [t, o] = R; else {
-                let n = s(0, H()), i = n + a;
-                c || (e = s(0, e), 1 !== x && (n -= e), 2 !== x && (i += e)), [t, o] = R = W(s(0, n), s(0, i)), 
-                k && (t = r(t, k[0]), o = s(o, k[1]));
+            if (y) [t, o] = R; else {
+                let r = s(0, H()), i = r + a;
+                c || (e = s(0, e), 1 !== x && (r -= e), 2 !== x && (i += e)), [t, o] = R = W(s(0, r), s(0, i)), 
+                k && (t = n(t, k[0]), o = s(o, k[1]));
             }
-            return [ s(t, 0), r(o, M.l - 1) ];
+            return [ s(t, 0), n(o, M.l - 1) ];
         },
         $: e => _(M, e - S),
         I: A,
@@ -88,7 +88,7 @@ const n = null, {min: r, max: s, abs: i, floor: l} = Math, c = (e, t, o) => r(o,
         p: () => a,
         O: () => S,
         h: q,
-        H: () => (b = $, $ = 0, [ b, 2 === I ]),
+        H: () => (y = $, $ = 0, [ y, 2 === I ]),
         W: (e, t) => {
             const o = [ e, t ];
             return O.add(o), () => {
@@ -96,54 +96,54 @@ const n = null, {min: r, max: s, abs: i, floor: l} = Math, c = (e, t, o) => r(o,
             };
         },
         q: (e, t) => {
-            let o, r, l = 0;
+            let o, n, l = 0;
             switch (e) {
               case 1:
                 {
                     if (t === m && 0 === I) break;
-                    const e = b;
-                    b = 0;
-                    const o = t - m, n = i(o);
-                    e && n < i(e) + 1 || 0 !== I || (x = o < 0 ? 2 : 1), u && (u = !1), m = t, l = 4;
+                    const e = y;
+                    y = 0;
+                    const o = t - m, r = i(o);
+                    e && r < i(e) + 1 || 0 !== I || (x = o < 0 ? 2 : 1), u && (u = !1), m = t, l = 4;
                     const s = E();
-                    s >= -a && s <= q() && (l += 1, r = n > a);
+                    s >= -a && s <= q() && (l += 1, n = r > a);
                     break;
                 }
 
               case 2:
-                l = 8, 0 !== x && (o = !0, l += 1), x = 0, I = 0, k = n;
+                l = 8, 0 !== x && (o = !0, l += 1), x = 0, I = 0, k = r;
                 break;
 
               case 3:
                 {
-                    const e = t.filter((([e, t]) => !A(e, t)));
+                    const e = t.filter(([e, t]) => !A(e, t));
                     if (!e.length) break;
-                    L(e.reduce(((e, [t, o]) => {
-                        let n;
-                        if (2 === I) n = !0; else if (k && 1 === I) n = t < k[0]; else {
-                            const e = E(), o = B(t), r = J(t);
-                            n = 1 !== x && 0 === I ? o + r < e : o < e && o + r < e + a;
+                    L(e.reduce((e, [t, o]) => {
+                        let r;
+                        if (2 === I) r = !0; else if (k && 1 === I) r = t < k[0]; else {
+                            const e = E(), o = B(t), n = J(t);
+                            r = 1 !== x && 0 === I ? o + n <= e : o < e && o + n < e + a;
                         }
-                        return n && (e += o - J(t)), e;
-                    }), 0));
+                        return r && (e += o - J(t)), e;
+                    }, 0));
                     for (const [t, o] of e) {
-                        const e = J(t), n = p(M, t, o);
-                        c && (T += n ? o : o - e);
+                        const e = J(t), r = p(M, t, o);
+                        c && (T += r ? o : o - e);
                     }
                     c && a && T > a && (L(((e, t) => {
                         let o = 0;
-                        const n = [];
-                        e.t.forEach(((e, r) => {
-                            -1 !== e && (n.push(e), r < t && o++);
-                        })), e.i = -1;
-                        const r = f(n), i = r.length, l = i / 2 | 0, c = i % 2 == 0 ? (r[l - 1] + r[l]) / 2 : r[l], u = e.o;
+                        const r = [];
+                        e.t.forEach((e, n) => {
+                            -1 !== e && (r.push(e), n < t && o++);
+                        }), e.i = -1;
+                        const n = f(r), i = n.length, l = i / 2 | 0, c = i % 2 == 0 ? (n[l - 1] + n[l]) / 2 : n[l], u = e.o;
                         return ((e.o = c) - u) * s(t - o, 0);
-                    })(M, _(M, H()))), c = !1), l = 3, r = !0;
+                    })(M, _(M, H()))), c = !1), l = 3, n = !0;
                     break;
                 }
 
               case 4:
-                a !== t && (a || (C = r = !0), a = t, l = 3);
+                a !== t && (a || (C = n = !0), a = t, l = 3);
                 break;
 
               case 5:
@@ -161,37 +161,37 @@ const n = null, {min: r, max: s, abs: i, floor: l} = Math, c = (e, t, o) => r(o,
               case 8:
                 k = W(t, t + a), l = 1;
             }
-            l && (d = 1 + (2147483647 & d), o && z && ($ += z, z = 0), O.forEach((([e, t]) => {
-                l & e && t(r);
-            })));
+            l && (d = 1 + (2147483647 & d), o && z && ($ += z, z = 0), O.forEach(([e, t]) => {
+                l & e && t(n);
+            }));
         }
     };
-}, k = setTimeout, R = (e, t) => t ? -e : e, T = (e, t, o, r, s, i) => {
+}, k = setTimeout, R = (e, t) => t ? -e : e, T = (e, t, o, n, s, i) => {
     const l = Date.now;
     let c = 0, f = !1, u = !1, d = !1, a = !1;
     const h = (() => {
         let t;
         const o = () => {
-            t != n && clearTimeout(t);
-        }, r = () => {
-            o(), t = k((() => {
-                t = n, (() => {
+            t != r && clearTimeout(t);
+        }, n = () => {
+            o(), t = k(() => {
+                t = r, (() => {
                     if (f || u) return f = !1, void h();
                     d = !1, e.q(2);
                 })();
-            }), 150);
+            }, 150);
         };
-        return r.B = o, r;
+        return n.B = o, n;
     })(), g = () => {
-        c = l(), d && (a = !0), i && e.q(6, i()), e.q(1, r()), h();
+        c = l(), d && (a = !0), i && e.q(6, i()), e.q(1, n()), h();
     }, p = t => {
         if (f || !e.M() || t.ctrlKey) return;
-        const n = l() - c;
-        150 > n && 50 < n && (o ? t.deltaX : t.deltaY) && (f = !0);
+        const r = l() - c;
+        150 > r && 50 < r && (o ? t.deltaX : t.deltaY) && (f = !0);
     }, v = () => {
         u = !0, d = a = !1;
     }, _ = () => {
-        u = !1, y() && (d = !0);
+        u = !1, b() && (d = !0);
     };
     return t.addEventListener("scroll", g), t.addEventListener("wheel", p, {
         passive: !0
@@ -206,170 +206,170 @@ const n = null, {min: r, max: s, abs: i, floor: l} = Math, c = (e, t, o) => r(o,
         },
         A: () => {
             const [t, o] = e.H();
-            t && (s(t, o, a), a = !1, o && e.p() > e.h() && e.q(1, r()));
+            t && (s(t, o, a), a = !1, o && e.p() > e.h() && e.q(1, n()));
         }
     };
 }, C = (e, t, o) => {
-    let n;
-    return [ async (r, s) => {
+    let r;
+    return [ async (n, s) => {
         if (!await t()) return;
-        n && n();
+        r && r();
         const i = () => {
             const [t, o] = d();
-            return n = () => {
+            return r = () => {
                 o(!1);
-            }, e.p() && k(n, 150), [ t, e.W(2, (() => {
+            }, e.p() && k(r, 150), [ t, e.W(2, () => {
                 o(!0);
-            })) ];
+            }) ];
         };
-        if (s && b()) e.q(8, r()), u((async () => {
+        if (s && y()) e.q(8, n()), u(async () => {
             for (;;) {
                 let t = !0;
-                for (let [o, n] = e.m(); o <= n; o++) if (e.I(o)) {
+                for (let [o, r] = e.m(); o <= r; o++) if (e.I(o)) {
                     t = !1;
                     break;
                 }
                 if (t) break;
-                const [o, n] = i();
+                const [o, r] = i();
                 try {
                     if (!await o) return;
                 } finally {
-                    n();
+                    r();
                 }
             }
-            e.q(7), o(r(), s);
-        })); else for (;;) {
-            const [t, n] = i();
+            e.q(7), o(n(), s);
+        }); else for (;;) {
+            const [t, r] = i();
             try {
-                if (e.q(7), o(r()), !await t) return;
+                if (e.q(7), o(n()), !await t) return;
             } finally {
-                n();
+                r();
             }
         }
     }, () => {
-        n && n();
+        r && r();
     } ];
 }, M = (e, t) => {
-    let o, n, r = d(), s = !1;
-    const i = t ? "scrollLeft" : "scrollTop", l = t ? "overflowX" : "overflowY", [f, u] = C(e, (() => r[0]), ((e, n) => {
-        e = R(e, s), n ? o.scrollTo({
+    let o, r, n = d(), s = !1;
+    const i = t ? "scrollLeft" : "scrollTop", l = t ? "overflowX" : "overflowY", [f, u] = C(e, () => n[0], (e, r) => {
+        e = R(e, s), r ? o.scrollTo({
             [t ? "left" : "top"]: e,
             behavior: "smooth"
         }) : o[i] = e;
-    }));
+    });
     return {
         L(c, f) {
-            o = f, t && (s = "rtl" === getComputedStyle(f).direction), n = T(e, f, t, (() => R(f[i], s)), ((t, o, n) => {
-                if (n) {
+            o = f, t && (s = "rtl" === getComputedStyle(f).direction), r = T(e, f, t, () => R(f[i], s), (t, o, r) => {
+                if (r) {
                     const e = f.style, t = e[l];
-                    e[l] = "hidden", k((() => {
+                    e[l] = "hidden", k(() => {
                         e[l] = t;
-                    }));
+                    });
                 }
                 f[i] = R(e.C() + t, s), o && u();
-            })), r[1](!0);
+            }), n[1](!0);
         },
         v() {
-            n && n.J(), r[1](!1), r = d();
+            r && r.J(), n[1](!1), n = d();
         },
         N: () => s,
         P(e) {
-            f((() => e));
+            f(() => e);
         },
         X(t) {
-            t += e.C(), f((() => t));
+            t += e.C(), f(() => t);
         },
-        Y(t, {align: o, smooth: n, offset: r = 0} = {}) {
+        Y(t, {align: o, smooth: r, offset: n = 0} = {}) {
             if (t = c(t, 0, e.T() - 1), "nearest" === o) {
-                const n = e.k(t), r = e.C();
-                if (n < r) o = "start"; else {
-                    if (!(n + e.R(t) > r + e.p())) return;
+                const r = e.k(t), n = e.C();
+                if (r < n) o = "start"; else {
+                    if (!(r + e.R(t) > n + e.p())) return;
                     o = "end";
                 }
             }
-            f((() => r + e.O() + e.k(t) + ("end" === o ? e.R(t) - e.p() : "center" === o ? (e.R(t) - e.p()) / 2 : 0)), n);
+            f(() => n + e.O() + e.k(t) + ("end" === o ? e.R(t) - e.p() : "center" === o ? (e.R(t) - e.p()) / 2 : 0), r);
         },
-        D: () => {
-            n && n.A();
+        V: () => {
+            r && r.A();
         }
     };
 }, O = (e, t) => {
-    let o, n, r = d(), s = !1;
-    const i = t ? "left" : "top", [l] = C(e, (() => r[0]), ((e, t) => {
+    let o, r, n = d(), s = !1;
+    const i = t ? "left" : "top", [l] = C(e, () => n[0], (e, t) => {
         e = R(e, s);
-        const n = z($(o));
-        t ? n.scroll({
+        const r = z($(o));
+        t ? r.scroll({
             [i]: e,
             behavior: "smooth"
-        }) : n.scroll({
+        }) : r.scroll({
             [i]: e
         });
-    })), f = (e, t, o, n, r = 0) => {
-        const i = n ? "offsetLeft" : "offsetTop", l = r + (n && s ? o.innerWidth - e[i] - e.offsetWidth : e[i]), c = e.offsetParent;
-        return e !== t && c ? f(c, t, o, n, l) : l;
+    }), f = (e, t, o, r, n = 0) => {
+        const i = r ? "offsetLeft" : "offsetTop", l = n + (r && s ? o.innerWidth - e[i] - e.offsetWidth : e[i]), c = e.offsetParent;
+        return e !== t && c ? f(c, t, o, r, l) : l;
     };
     return {
         L(l) {
             o = l;
             const c = t ? "scrollX" : "scrollY", u = $(l), d = z(u);
-            t && (s = "rtl" === getComputedStyle(m(u)).direction), n = T(e, d, t, (() => R(d[c], s)), ((t, o) => {
+            t && (s = "rtl" === getComputedStyle(m(u)).direction), r = T(e, d, t, () => R(d[c], s), (t, o) => {
                 o ? d.scroll({
                     [i]: R(e.C() + t, s)
                 }) : d.scrollBy({
                     [i]: R(t, s)
                 });
-            }), (() => f(l, u.body, d, t))), r[1](!0);
+            }, () => f(l, u.body, d, t)), n[1](!0);
         },
         v() {
-            n && n.J(), o = void 0, r[1](!1), r = d();
+            r && r.J(), o = void 0, n[1](!1), n = d();
         },
         N: () => s,
-        D: () => {
-            n && n.A();
+        V: () => {
+            r && r.A();
         },
-        Y(n, {align: r, smooth: s, offset: i = 0} = {}) {
+        Y(r, {align: n, smooth: s, offset: i = 0} = {}) {
             if (!o) return;
-            if (n = c(n, 0, e.T() - 1), "nearest" === r) {
-                const t = e.k(n), o = e.C();
-                if (t < o) r = "start"; else {
-                    if (!(t + e.R(n) > o + e.p())) return;
-                    r = "end";
+            if (r = c(r, 0, e.T() - 1), "nearest" === n) {
+                const t = e.k(r), o = e.C();
+                if (t < o) n = "start"; else {
+                    if (!(t + e.R(r) > o + e.p())) return;
+                    n = "end";
                 }
             }
             const u = $(o), d = z(u), a = m(u), h = () => e.p() - (t ? a.clientWidth : a.clientHeight);
-            l((() => i + f(o, u.body, d, t) + e.k(n) + ("end" === r ? e.R(n) - (e.p() - h()) : "center" === r ? (e.R(n) - (e.p() - h())) / 2 : 0)), s);
+            l(() => i + f(o, u.body, d, t) + e.k(r) + ("end" === n ? e.R(r) - (e.p() - h()) : "center" === n ? (e.R(r) - (e.p() - h())) / 2 : 0), s);
         }
     };
 }, E = (e, t) => {
-    const o = M(e, !1), n = M(t, !0);
+    const o = M(e, !1), r = M(t, !0);
     return {
         L(e, t) {
-            o.L(e, t), n.L(e, t);
+            o.L(e, t), r.L(e, t);
         },
         v() {
-            o.v(), n.v();
+            o.v(), r.v();
         },
-        N: n.N,
+        N: r.N,
         P(e, t) {
-            null != e && o.P(e), null != t && n.P(t);
+            null != e && o.P(e), null != t && r.P(t);
         },
         X(e, t) {
-            null != e && o.X(e), null != t && n.X(t);
+            null != e && o.X(e), null != t && r.X(t);
         },
         Y(e, t) {
-            null != e && o.Y(e), null != t && n.Y(t);
+            null != e && o.Y(e), null != t && r.Y(t);
         },
-        D() {
-            o.D(), n.D();
+        V() {
+            o.V(), r.V();
         }
     };
 }, H = e => {
     let t;
     return {
-        V(o) {
+        j(o) {
             (t || (t = new (z($(o)).ResizeObserver)(e))).observe(o);
         },
-        j(e) {
+        D(e) {
             t.unobserve(e);
         },
         J() {
@@ -378,45 +378,45 @@ const n = null, {min: r, max: s, abs: i, floor: l} = Math, c = (e, t, o) => r(o,
     };
 }, W = (e, t) => {
     let o;
-    const r = t ? "width" : "height", s = new WeakMap, i = H((t => {
+    const n = t ? "width" : "height", s = new WeakMap, i = H(t => {
         const i = [];
-        for (const {target: l, contentRect: c} of t) if (l.offsetParent) if (l === o) e.q(4, c[r]); else {
+        for (const {target: l, contentRect: c} of t) if (l.offsetParent) if (l === o) e.q(4, c[n]); else {
             const e = s.get(l);
-            e != n && i.push([ e, c[r] ]);
+            e != r && i.push([ e, c[n] ]);
         }
         i.length && e.q(3, i);
-    }));
+    });
     return {
         U(e) {
-            i.V(o = e);
+            i.j(o = e);
         },
-        F: (e, t) => (s.set(e, t), i.V(e), () => {
-            s.delete(e), i.j(e);
+        F: (e, t) => (s.set(e, t), i.j(e), () => {
+            s.delete(e), i.D(e);
         }),
         v: i.J
     };
 }, q = (e, t) => {
-    const o = t ? "width" : "height", r = t ? "innerWidth" : "innerHeight", s = new WeakMap, i = H((t => {
-        const r = [];
+    const o = t ? "width" : "height", n = t ? "innerWidth" : "innerHeight", s = new WeakMap, i = H(t => {
+        const n = [];
         for (const {target: e, contentRect: i} of t) {
             if (!e.offsetParent) continue;
             const t = s.get(e);
-            t != n && r.push([ t, i[o] ]);
+            t != r && n.push([ t, i[o] ]);
         }
-        r.length && e.q(3, r);
-    }));
+        n.length && e.q(3, n);
+    });
     let l;
     return {
         U(t) {
-            const o = z($(t)), n = () => {
-                e.q(4, o[r]);
+            const o = z($(t)), r = () => {
+                e.q(4, o[n]);
             };
-            o.addEventListener("resize", n), u(n), l = () => {
-                o.removeEventListener("resize", n);
+            o.addEventListener("resize", r), u(r), l = () => {
+                o.removeEventListener("resize", r);
             };
         },
-        F: (e, t) => (s.set(e, t), i.V(e), () => {
-            s.delete(e), i.j(e);
+        F: (e, t) => (s.set(e, t), i.j(e), () => {
+            s.delete(e), i.D(e);
         }),
         v() {
             l && l(), i.J();
@@ -424,45 +424,45 @@ const n = null, {min: r, max: s, abs: i, floor: l} = Math, c = (e, t, o) => r(o,
     };
 }, B = (e, t) => {
     let o;
-    const n = new WeakMap, r = new Set, i = new Set, l = new Map, c = (e, t) => `${e}-${t}`, f = H((f => {
+    const r = new WeakMap, n = new Set, i = new Set, l = new Map, c = (e, t) => `${e}-${t}`, f = H(f => {
         const u = new Set, d = new Set;
-        for (const {target: r, contentRect: {width: s, height: i}} of f) if (r.offsetParent) if (r === o) e.q(4, i), 
+        for (const {target: n, contentRect: {width: s, height: i}} of f) if (n.offsetParent) if (n === o) e.q(4, i), 
         t.q(4, s); else {
-            const e = n.get(r);
+            const e = r.get(n);
             if (e) {
-                const [t, o] = e, n = c(t, o), r = l.get(n);
+                const [t, o] = e, r = c(t, o), n = l.get(r);
                 let f, a;
-                r ? (r[0] !== i && (f = !0), r[1] !== s && (a = !0)) : f = a = !0, f && u.add(t), 
-                a && d.add(o), (f || a) && l.set(n, [ i, s ]);
+                n ? (n[0] !== i && (f = !0), n[1] !== s && (a = !0)) : f = a = !0, f && u.add(t), 
+                a && d.add(o), (f || a) && l.set(r, [ i, s ]);
             }
         }
         if (u.size) {
             const t = [];
-            u.forEach((e => {
+            u.forEach(e => {
                 let o = 0;
-                i.forEach((t => {
-                    const n = l.get(c(e, t));
-                    n && (o = s(o, n[0]));
-                })), o && t.push([ e, o ]);
-            })), e.q(3, t);
+                i.forEach(t => {
+                    const r = l.get(c(e, t));
+                    r && (o = s(o, r[0]));
+                }), o && t.push([ e, o ]);
+            }), e.q(3, t);
         }
         if (d.size) {
             const e = [];
-            d.forEach((t => {
+            d.forEach(t => {
                 let o = 0;
-                r.forEach((e => {
-                    const n = l.get(c(e, t));
-                    n && (o = s(o, n[1]));
-                })), o && e.push([ t, o ]);
-            })), t.q(3, e);
+                n.forEach(e => {
+                    const r = l.get(c(e, t));
+                    r && (o = s(o, r[1]));
+                }), o && e.push([ t, o ]);
+            }), t.q(3, e);
         }
-    }));
+    });
     return {
         U(e) {
-            f.V(o = e);
+            f.j(o = e);
         },
-        F: (e, t, o) => (n.set(e, [ t, o ]), r.add(t), i.add(o), f.V(e), () => {
-            n.delete(e), f.j(e);
+        F: (e, t, o) => (r.set(e, [ t, o ]), n.add(t), i.add(o), f.j(e), () => {
+            r.delete(e), f.D(e);
         }),
         G(o) {
             for (const [t] of o) for (let o = 0; o < e.T(); o++) l.delete(c(o, t));
@@ -484,13 +484,13 @@ const n = null, {min: r, max: s, abs: i, floor: l} = Math, c = (e, t, o) => r(o,
     return o[A] || (o[A] = e());
 }, X = e => {
     const o = t.useRef(e);
-    return J((() => {
+    return J(() => {
         o[A] = e;
-    }), [ e ]), o;
-}, Y = t.memo((({Z: o, ee: n, te: r, oe: s, ne: i, re: l, se: c, ie: f}) => {
+    }, [ e ]), o;
+}, Y = /*#__PURE__*/ t.memo(({Z: o, ee: r, te: n, oe: s, re: i, ne: l, se: c, ie: f}) => {
     const u = t.useRef(null);
-    J((() => n(u[A], r)), [ r ]);
-    const d = t.useMemo((() => {
+    J(() => r(u[A], n), [ n ]);
+    const d = t.useMemo(() => {
         const e = {
             contain: "layout style",
             position: i && f ? void 0 : "absolute",
@@ -500,7 +500,7 @@ const n = null, {min: r, max: s, abs: i, floor: l} = Math, c = (e, t, o) => r(o,
             visibility: !i || f ? void 0 : "hidden"
         };
         return c && (e.display = "inline-flex"), e;
-    }), [ s, i, f, c ]);
+    }, [ s, i, f, c ]);
     return "string" == typeof l ? e.jsx(l, {
         ref: u,
         style: d,
@@ -508,54 +508,54 @@ const n = null, {min: r, max: s, abs: i, floor: l} = Math, c = (e, t, o) => r(o,
     }) : e.jsx(l, {
         ref: u,
         style: d,
-        index: r,
+        index: n,
         children: o
     });
-})), D = (e, o) => t.useMemo((() => {
+}), V = (e, o) => t.useMemo(() => {
     if ("function" == typeof e) return [ t => e(o[t], t), o.length ];
     const t = (e => {
         const t = [];
         return L(e, t), t;
     })(e);
     return [ e => t[e], t.length ];
-}), [ e, o ]), V = t.forwardRef((({children: n, data: r, bufferSize: s, itemSize: i, shift: l, horizontal: c, keepMounted: d, cache: a, startMargin: h = 0, ssrCount: g, as: p = "div", item: v = "div", scrollRef: _, onScroll: w, onScrollEnd: S}, m) => {
-    const [$, z] = D(n, r), y = t.useRef(null), b = t.useRef(!!g), k = X(w), R = X(S), [T, C, O, E] = P((() => {
+}, [ e, o ]), j = /*#__PURE__*/ t.forwardRef(({children: r, data: n, bufferSize: s, itemSize: i, shift: l, horizontal: c, keepMounted: d, cache: a, startMargin: h = 0, ssrCount: g, as: p = "div", item: v = "div", scrollRef: _, onScroll: w, onScrollEnd: S}, m) => {
+    const [$, z] = V(r, n), b = t.useRef(null), y = t.useRef(!!g), k = X(w), R = X(S), [T, C, O, E] = P(() => {
         const e = !!c, t = I(z, i, g, a, !i);
         return [ t, W(t, e), M(t, e), e ];
-    }));
+    });
     z !== T.T() && T.q(5, [ z, l ]), h !== T.O() && T.q(6, h);
-    const [H, q] = t.useReducer(T._, void 0, T._), B = T.M(), L = T.h(), V = O.N(), j = [], U = t => {
+    const [H, q] = t.useReducer(T._, void 0, T._), B = T.M(), L = T.h(), j = O.N(), D = [], U = t => {
         const o = $(t);
         return e.jsx(Y, {
             ee: C.F,
             te: t,
-            oe: T.k(t, V),
-            ne: T.I(t),
-            re: v,
+            oe: T.k(t, j),
+            re: T.I(t),
+            ne: v,
             Z: o,
             se: E,
-            ie: b[A]
+            ie: y[A]
         }, N(o, t));
     };
-    if (J((() => {
-        b[A] = !1, T.W(1, (e => {
+    if (J(() => {
+        y[A] = !1, T.W(1, e => {
             e ? o.flushSync(q) : q();
-        })), T.W(4, (() => {
+        }), T.W(4, () => {
             k[A] && k[A](T.C());
-        })), T.W(8, (() => {
+        }), T.W(8, () => {
             R[A] && R[A]();
-        }));
-        const e = y[A], t = t => {
+        });
+        const e = b[A], t = t => {
             C.U(t), O.L(e, t);
         };
-        return _ ? u((() => {
+        return _ ? u(() => {
             _[A] && t(_[A]);
-        })) : t(e.parentElement), () => {
+        }) : t(e.parentElement), () => {
             T.v(), C.v(), O.v();
         };
-    }), []), J((() => {
-        O.D();
-    }), [ H ]), t.useImperativeHandle(m, (() => ({
+    }, []), J(() => {
+        O.V();
+    }, [ H ]), t.useImperativeHandle(m, () => ({
         get cache() {
             return T.S();
         },
@@ -574,15 +574,15 @@ const n = null, {min: r, max: s, abs: i, floor: l} = Math, c = (e, t, o) => r(o,
         scrollToIndex: O.Y,
         scrollTo: O.P,
         scrollBy: O.X
-    })), []), d) {
+    }), []), d) {
         const e = new Set(d);
         for (let [t, o] = T.m(s); t <= o; t++) e.add(t);
-        f([ ...e ]).forEach((e => {
-            j.push(U(e));
-        }));
-    } else for (let [e, t] = T.m(s); e <= t; e++) j.push(U(e));
+        f([ ...e ]).forEach(e => {
+            D.push(U(e));
+        });
+    } else for (let [e, t] = T.m(s); e <= t; e++) D.push(U(e));
     return e.jsx(p, {
-        ref: y,
+        ref: b,
         style: {
             contain: "size style",
             overflowAnchor: "none",
@@ -592,9 +592,9 @@ const n = null, {min: r, max: s, abs: i, floor: l} = Math, c = (e, t, o) => r(o,
             height: E ? "100%" : L,
             pointerEvents: B ? "none" : void 0
         },
-        children: j
+        children: D
     });
-})), j = t.forwardRef((({children: t, data: o, bufferSize: n, itemSize: r, shift: s, horizontal: i, keepMounted: l, cache: c, ssrCount: f, item: u, onScroll: d, onScrollEnd: a, style: h, ...g}, p) => e.jsx("div", {
+}), D = /*#__PURE__*/ t.forwardRef(({children: t, data: o, bufferSize: r, itemSize: n, shift: s, horizontal: i, keepMounted: l, cache: c, ssrCount: f, item: u, onScroll: d, onScrollEnd: a, style: h, ...g}, p) => e.jsx("div", {
     ...g,
     style: {
         display: i ? "inline-block" : "block",
@@ -604,11 +604,11 @@ const n = null, {min: r, max: s, abs: i, floor: l} = Math, c = (e, t, o) => r(o,
         height: "100%",
         ...h
     },
-    children: e.jsx(V, {
+    children: e.jsx(j, {
         ref: p,
         data: o,
-        bufferSize: n,
-        itemSize: r,
+        bufferSize: r,
+        itemSize: n,
         shift: s,
         horizontal: i,
         keepMounted: l,
@@ -619,28 +619,28 @@ const n = null, {min: r, max: s, abs: i, floor: l} = Math, c = (e, t, o) => r(o,
         onScrollEnd: a,
         children: t
     })
-}))), U = t.forwardRef((({children: n, data: r, bufferSize: s, itemSize: i, shift: l, horizontal: c, cache: f, ssrCount: u, as: d = "div", item: a = "div", onScroll: h, onScrollEnd: g}, p) => {
-    const [v, _] = D(n, r), w = t.useRef(null), S = X(h), m = X(g), $ = t.useRef(!!u), [z, y, b, x] = P((() => {
+})), U = /*#__PURE__*/ t.forwardRef(({children: r, data: n, bufferSize: s, itemSize: i, shift: l, horizontal: c, cache: f, ssrCount: u, as: d = "div", item: a = "div", onScroll: h, onScrollEnd: g}, p) => {
+    const [v, _] = V(r, n), w = t.useRef(null), S = X(h), m = X(g), $ = t.useRef(!!u), [z, b, y, x] = P(() => {
         const e = !!c, t = I(_, i, u, f, !i);
         return [ t, q(t, e), O(t, e), e ];
-    }));
+    });
     _ !== z.T() && z.q(5, [ _, l ]);
-    const [k, R] = t.useReducer(z._, void 0, z._), T = z.M(), C = z.h(), M = b.N(), E = [];
-    J((() => {
-        $[A] = !1, z.W(1, (e => {
+    const [k, R] = t.useReducer(z._, void 0, z._), T = z.M(), C = z.h(), M = y.N(), E = [];
+    J(() => {
+        $[A] = !1, z.W(1, e => {
             e ? o.flushSync(R) : R();
-        })), z.W(4, (() => {
+        }), z.W(4, () => {
             S[A] && S[A]();
-        })), z.W(8, (() => {
+        }), z.W(8, () => {
             m[A] && m[A]();
-        }));
+        });
         const e = w[A];
-        return y.U(e), b.L(e), () => {
-            z.v(), y.v(), b.v();
+        return b.U(e), y.L(e), () => {
+            z.v(), b.v(), y.v();
         };
-    }), []), J((() => {
-        b.D();
-    }), [ k ]), t.useImperativeHandle(p, (() => ({
+    }, []), J(() => {
+        y.V();
+    }, [ k ]), t.useImperativeHandle(p, () => ({
         get cache() {
             return z.S();
         },
@@ -653,16 +653,16 @@ const n = null, {min: r, max: s, abs: i, floor: l} = Math, c = (e, t, o) => r(o,
         findItemIndex: z.$,
         getItemOffset: z.k,
         getItemSize: z.R,
-        scrollToIndex: b.Y
-    })), []);
+        scrollToIndex: y.Y
+    }), []);
     for (let [t, o] = z.m(s); t <= o; t++) {
         const o = v(t);
         E.push(e.jsx(Y, {
-            ee: y.F,
+            ee: b.F,
             te: t,
             oe: z.k(t, M),
-            ne: z.I(t),
-            re: a,
+            re: z.I(t),
+            ne: a,
             Z: o,
             se: x,
             ie: $[A]
@@ -681,11 +681,11 @@ const n = null, {min: r, max: s, abs: i, floor: l} = Math, c = (e, t, o) => r(o,
         },
         children: E
     });
-})), F = (e, t) => `${e}-${t}`, G = t.memo((({Z: o, ee: n, le: r, ce: s, fe: i, ue: l, de: c, ae: f, ne: u, he: d}) => {
+}), F = (e, t) => `${e}-${t}`, G = /*#__PURE__*/ t.memo(({Z: o, ee: r, le: n, ce: s, fe: i, ue: l, de: c, ae: f, re: u, he: d}) => {
     const a = t.useRef(null);
-    return J((() => n.F(a[A], r, s)), [ s, r ]), e.jsx(d, {
+    return J(() => r.F(a[A], n, s), [ s, n ]), e.jsx(d, {
         ref: a,
-        style: t.useMemo((() => ({
+        style: t.useMemo(() => ({
             contain: "layout style",
             display: "grid",
             position: "absolute",
@@ -694,117 +694,114 @@ const n = null, {min: r, max: s, abs: i, floor: l} = Math, c = (e, t, o) => r(o,
             visibility: u ? "hidden" : void 0,
             minHeight: c,
             minWidth: f
-        })), [ i, l, f, c, u ]),
+        }), [ i, l, f, c, u ]),
         children: o
     });
-})), K = t.forwardRef((({children: n, row: r, col: s, cellHeight: i = 40, cellWidth: l = 100, bufferSize: c, ssrRowCount: f, ssrColCount: u, item: d = "div", domRef: a, innerDomRef: h, onScroll: g, onScrollEnd: p, style: v, ..._}, w) => {
-    const [S, m, $, z] = P((() => {
-        const e = I(r, i, f), t = I(s, l, u);
+}), K = /*#__PURE__*/ t.forwardRef(({children: r, row: n, col: s, cellHeight: i = 40, cellWidth: l = 100, bufferSize: c, ssrRowCount: f, ssrColCount: u, item: d = "div", domRef: a, onScroll: h, onScrollEnd: g, style: p, ...v}, _) => {
+    const [w, S, m, $] = P(() => {
+        const e = I(n, i, f), t = I(s, l, u);
         return [ e, t, B(e, t), E(e, t) ];
-    }));
-    r !== S.T() && S.q(5, [ r ]), s !== m.T() && m.q(5, [ s ]);
-    const [y, b] = t.useReducer(S._, void 0, S._), [k, R] = t.useReducer(m._, void 0, m._), T = S.M(), C = m.M(), M = x(S), O = x(m), H = t.useRef(null), W = X(g), q = X(p);
-    J((() => {
-        S.W(1, (e => {
+    });
+    n !== w.T() && w.q(5, [ n ]), s !== S.T() && S.q(5, [ s ]);
+    const [z, b] = t.useReducer(w._, void 0, w._), [y, k] = t.useReducer(S._, void 0, S._), R = w.M(), T = S.M(), C = x(w), M = x(S), O = t.useRef(null), H = X(h), W = X(g);
+    J(() => {
+        w.W(1, e => {
             e ? o.flushSync(b) : b();
-        })), m.W(1, (e => {
-            e ? o.flushSync(R) : R();
-        })), S.W(4, (() => {
-            W[A] && W[A](S.C());
-        })), S.W(8, (() => {
-            q[A] && q[A]();
-        }));
-        const e = H[A], t = e.parentElement;
-        return $.U(t), z.L(e, t), () => {
-            S.v(), m.v(), $.v(), z.v();
+        }), S.W(1, e => {
+            e ? o.flushSync(k) : k();
+        }), w.W(4, () => {
+            H[A] && H[A](w.C());
+        }), w.W(8, () => {
+            W[A] && W[A]();
+        });
+        const e = O[A], t = e.parentElement;
+        return m.U(t), $.L(e, t), () => {
+            w.v(), S.v(), m.v(), $.v();
         };
-    }), []), J((() => {
-        z.D();
-    }), [ y, k ]), t.useImperativeHandle(w, (() => ({
+    }, []), J(() => {
+        $.V();
+    }, [ z, y ]), t.useImperativeHandle(_, () => ({
         get scrollTop() {
-            return S.C();
+            return w.C();
         },
         get scrollLeft() {
-            return m.C();
+            return S.C();
         },
         get scrollHeight() {
-            return x(S);
+            return x(w);
         },
         get scrollWidth() {
-            return x(m);
+            return x(S);
         },
         get viewportHeight() {
-            return S.p();
+            return w.p();
         },
         get viewportWidth() {
-            return m.p();
-        },
-        findRowIndex: S.$,
-        findColIndex: m.$,
-        getRowOffset: S.k,
-        getColOffset: m.k,
-        getRowSize: S.R,
-        getColSize: m.R,
+            return S.p();
+        },
+        findRowIndex: w.$,
+        findColIndex: S.$,
+        getRowOffset: w.k,
+        getColOffset: S.k,
+        getRowSize: w.R,
+        getColSize: S.R,
         resizeCols(e) {
-            $.G(e);
+            m.G(e);
         },
         resizeRows(e) {
-            $.K(e);
+            m.K(e);
         },
-        scrollToIndex: z.Y,
-        scrollTo: z.P,
-        scrollBy: z.X
-    })), []);
-    const L = t.useMemo((() => {
+        scrollToIndex: $.Y,
+        scrollTo: $.P,
+        scrollBy: $.X
+    }), []);
+    const q = t.useMemo(() => {
         const e = new Map;
         return (t, o) => {
-            let r = e.get(F(t, o));
-            return r || e.set(F(t, o), r = n({
+            let n = e.get(F(t, o));
+            return n || e.set(F(t, o), n = r({
                 rowIndex: t,
                 colIndex: o
-            })), r;
+            })), n;
         };
-    }), [ n ]), N = z.N(), [Y, D] = S.m(c), [V, j] = m.m(c), U = [];
-    for (let t = Y; t <= D; t++) for (let o = V; o <= j; o++) U.push(e.jsx(G, {
-        ee: $,
+    }, [ r ]), L = $.N(), [N, Y] = w.m(c), [V, j] = S.m(c), D = [];
+    for (let t = N; t <= Y; t++) for (let o = V; o <= j; o++) D.push(e.jsx(G, {
+        ee: m,
         le: t,
         ce: o,
-        fe: S.k(t),
-        ue: m.k(o, N),
-        de: S.R(t),
-        ae: m.R(o),
-        ne: S.I(t) || m.I(o),
+        fe: w.k(t),
+        ue: S.k(o, L),
+        de: w.R(t),
+        ae: S.R(o),
+        re: w.I(t) || S.I(o),
         he: d,
-        Z: L(t, o)
+        Z: q(t, o)
     }, F(t, o)));
     return e.jsx("div", {
         ref: a,
-        ..._,
+        ...v,
         style: {
             overflow: "auto",
             contain: "strict",
             width: "100%",
             height: "100%",
-            ...v
+            ...p
         },
         children: e.jsx("div", {
-            ref: (K = [ H, h ], t.useCallback((e => {
-                for (const t of K) t && ("function" == typeof t ? t(e) : t && (t.current = e));
-            }), K)),
+            ref: O,
             style: {
                 contain: "size style",
                 overflowAnchor: "none",
                 flex: "none",
                 position: "relative",
-                width: O,
-                height: M,
-                pointerEvents: T || C ? "none" : void 0
+                width: M,
+                height: C,
+                pointerEvents: R || T ? "none" : void 0
             },
-            children: U
+            children: D
         })
     });
-    var K;
-}));
+});
 
-exports.VList = j, exports.Virtualizer = V, exports.WindowVirtualizer = U, exports.experimental_VGrid = K;
+exports.VList = D, exports.Virtualizer = j, exports.WindowVirtualizer = U, exports.experimental_VGrid = K;
 //# sourceMappingURL=index.cjs.map