virtua 0.49.2 → 0.50.0

package/lib/index.js

@@ -1,157 +1,158 @@
 "use client";
-import { jsx as e } from "react/jsx-runtime";
 
-import { useLayoutEffect as t, useEffect as o, useRef as n, memo as r, useMemo as s, forwardRef as i, useReducer as l, useImperativeHandle as c } from "react";
+import { forwardRef as e, memo as t, useEffect as o, useImperativeHandle as n, useLayoutEffect as r, useMemo as i, useReducer as s, useRef as l } from "react";
+
+import { jsx as c } from "react/jsx-runtime";
 
 import { flushSync as f } from "react-dom";
 
-const u = null, {min: d, max: a, abs: h, floor: g} = Math, p = (e, t, o) => d(o, a(t, e)), v = e => [ ...e ].sort((e, t) => e - t), m = "function" == typeof queueMicrotask ? queueMicrotask : e => {
+var {min: u, max: d, abs: a, floor: h} = Math, g = (e, t, o) => u(o, d(t, e)), p = e => [ ...e ].sort((e, t) => e - t), v = "function" == typeof queueMicrotask ? queueMicrotask : e => {
     Promise.resolve().then(e);
-}, _ = () => {
+}, m = () => {
     let e;
     return [ new Promise(t => {
         e = t;
     }), e ];
-}, w = e => {
+}, _ = e => {
     let t;
     return () => (e && (t = e(), e = void 0), t);
-}, S = (e, t, o) => {
+}, w = (e, t, o) => {
     const n = o ? "unshift" : "push";
     for (let o = 0; o < t; o++) e[n](-1);
     return e;
-}, $ = (e, t) => {
+}, S = (e, t) => {
     const o = e.t[t];
     return -1 === o ? e.o : o;
-}, z = (e, t, o) => {
+}, $ = (e, t, o) => {
     const n = -1 === e.t[t];
-    return e.t[t] = o, e.i = d(t, e.i), n;
-}, b = (e, t) => {
+    return e.t[t] = o, e.i = u(t, e.i), n;
+}, z = (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 += $(e, o), e.u[++o] = n;
+    for (;o < t; ) n += S(e, o), e.u[++o] = n;
     return e.i = t, n;
-}, y = (e, t, o = 0, n = e.l - 1) => {
+}, b = (e, t, o = 0, n = e.l - 1) => {
     let r = o;
     for (;o <= n; ) {
-        const s = g((o + n) / 2);
-        b(e, s) <= t ? (r = s, o = s + 1) : n = s - 1;
+        const i = h((o + n) / 2);
+        z(e, i) <= t ? (r = i, o = i + 1) : n = i - 1;
     }
-    return p(r, 0, e.l - 1);
-}, x = (e, t, o) => {
+    return g(r, 0, e.l - 1);
+}, y = (e, t, o) => {
     const n = t - e.l;
-    return e.i = o ? -1 : d(t - 1, e.i), e.l = t, n > 0 ? (S(e.u, n), S(e.t, n, o), 
+    return e.i = o ? -1 : u(t - 1, e.i), e.l = t, n > 0 ? (w(e.u, n), w(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));
-}, I = "undefined" != typeof window, k = e => e.documentElement, R = e => e.ownerDocument, T = e => e.defaultView, C = /*#__PURE__*/ w(() => !!/iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0), M = /*#__PURE__*/ w(() => "scrollBehavior" in k(document).style), O = e => a(e.h(), e.p()), E = (e, t = 40, o = 0, n, r = !1) => {
-    let s = !!o, i = 1, l = 0, c = 0, f = 0, g = 0, p = 0, m = 0, _ = 0, w = 0, I = u, k = [ 0, s ? a(o - 1, 0) : -1 ], R = 0, T = !1;
-    const M = ((e, t, o) => ({
+}, x = "undefined" != typeof window, I = e => e.documentElement, k = e => e.ownerDocument, R = e => e.defaultView, T = /*#__PURE__*/ _(() => !!/iP(hone|od|ad)/.test(navigator.userAgent) || "MacIntel" === navigator.platform && navigator.maxTouchPoints > 0), C = /*#__PURE__*/ _(() => "scrollBehavior" in I(document).style), M = e => d(e.h(), e.p()), O = (e, t = 40, o = 0, n, r = !1) => {
+    let i = !!o, s = 1, l = 0, c = 0, f = 0, h = 0, g = 0, v = 0, m = 0, _ = 0, x = null, I = [ 0, i ? d(o - 1, 0) : -1 ], k = 0, R = !1;
+    const C = ((e, t, o) => ({
         o: t,
-        t: o ? S(o.slice(0, d(e, o.length)), a(0, e - o.length)) : S([], e),
+        t: o ? w(o.slice(0, u(e, o.length)), d(0, e - o.length)) : w([], e),
         l: e,
         i: -1,
-        u: S([], e + 1)
-    }))(e, n ? n[1] : t, n && n[0]), O = new Set, E = () => f - c, H = () => E() + p + g, W = (e, t) => ((e, t, o, n) => {
-        if (n = d(n, e.l - 1), b(e, n) <= t) {
-            const r = y(e, o, n);
-            return [ y(e, t, n, r), r ];
+        u: w([], e + 1)
+    }))(e, n ? n[1] : t, n && n[0]), M = /* @__PURE__ */ new Set, O = () => f - c, E = () => O() + g + h, H = (e, t) => ((e, t, o, n) => {
+        if (n = u(n, e.l - 1), z(e, n) <= t) {
+            const r = b(e, o, n);
+            return [ b(e, t, n, r), r ];
         }
         {
-            const r = y(e, t, void 0, n);
-            return [ r, y(e, o, r) ];
+            const r = b(e, t, void 0, n);
+            return [ r, b(e, o, r) ];
         }
-    })(M, e, t, k[0]), B = () => b(M, M.l), J = (e, t) => {
-        const o = b(M, e) - p;
-        return t ? B() - o - A(e) : o;
-    }, A = e => $(M, e), L = (e, t = -1) => M.t[e] === t, N = e => {
-        e && (C() && 0 !== _ || I && 1 === w ? p += e : g += e);
+    })(C, e, t, I[0]), W = () => z(C, C.l), B = (e, t) => {
+        const o = z(C, e) - g;
+        return t ? W() - o - J(e) : o;
+    }, J = e => S(C, e), A = (e, t = -1) => C.t[e] === t, L = e => {
+        e && (T() && 0 !== m || x && 1 === _ ? g += e : h += e);
     };
     return {
         v: () => {
-            O.clear();
+            M.clear();
         },
-        m: () => i,
-        _: () => (e => [ e.t.slice(), e.o ])(M),
+        m: () => s,
+        _: () => (e => [ e.t.slice(), e.o ])(C),
         S: (e = 200) => {
-            if (!T || s) return k;
+            if (!R || i) return I;
             let t, o;
-            if (m) [t, o] = k; else {
-                let n = a(0, H()), s = n + l;
-                r || (e = a(0, e), 1 !== _ && (n -= e), 2 !== _ && (s += e)), [t, o] = k = W(a(0, n), a(0, s)), 
-                I && (t = d(t, I[0]), o = a(o, I[1]));
+            if (v) [t, o] = I; else {
+                let n = d(0, E()), i = n + l;
+                r || (e = d(0, e), 1 !== m && (n -= e), 2 !== m && (i += e)), [t, o] = I = H(d(0, n), d(0, i)), 
+                x && (t = u(t, x[0]), o = d(o, x[1]));
             }
-            return [ a(t, 0), d(o, M.l - 1) ];
+            return [ d(t, 0), u(o, C.l - 1) ];
         },
-        $: e => y(M, e - c),
-        I: L,
-        k: J,
-        R: A,
-        T: () => M.l,
+        $: e => b(C, e - c),
+        I: A,
+        k: B,
+        R: J,
+        T: () => C.l,
         C: () => f,
-        M: () => 0 !== _,
+        M: () => 0 !== m,
         p: () => l,
         O: () => c,
-        h: B,
-        H: () => (m = g, g = 0, [ m, 2 === w ]),
+        h: W,
+        H: () => (v = h, h = 0, [ v, 2 === _ ]),
         W: (e, t) => {
             const o = [ e, t ];
-            return O.add(o), () => {
-                O.delete(o);
+            return M.add(o), () => {
+                M.delete(o);
             };
         },
         B: (e, t) => {
-            let o, n, d = 0;
+            let o, n, u = 0;
             switch (e) {
               case 1:
                 {
-                    if (t === f && 0 === w) break;
-                    const e = m;
-                    m = 0;
-                    const o = t - f, r = h(o);
-                    e && r < h(e) + 1 || 0 !== w || (_ = o < 0 ? 2 : 1), s && (s = !1), f = t, d = 4;
-                    const i = E();
-                    i >= -l && i <= B() && (d += 1, n = r > l);
+                    if (t === f && 0 === _) break;
+                    const e = v;
+                    v = 0;
+                    const o = t - f, r = a(o);
+                    e && r < a(e) + 1 || 0 !== _ || (m = o < 0 ? 2 : 1), i && (i = !1), f = t, u = 4;
+                    const s = O();
+                    s >= -l && s <= W() && (u += 1, n = r > l);
                     break;
                 }
 
               case 2:
-                d = 8, 0 !== _ && (o = !0, d += 1), _ = 0, w = 0, I = u;
+                u = 8, 0 !== m && (o = !0, u += 1), m = 0, _ = 0, x = null;
                 break;
 
               case 3:
                 {
-                    const e = t.filter(([e, t]) => !L(e, t));
+                    const e = t.filter(([e, t]) => !A(e, t));
                     if (!e.length) break;
-                    N(e.reduce((e, [t, o]) => {
+                    L(e.reduce((e, [t, o]) => {
                         let n;
-                        if (2 === w) n = !0; else if (I && 1 === w) n = t < I[0]; else {
-                            const e = E(), o = J(t), r = A(t);
-                            n = 1 !== _ && 0 === w ? o + r <= e : o < e && o + r < e + l;
+                        if (2 === _) n = !0; else if (x && 1 === _) n = t < x[0]; else {
+                            const e = O(), o = B(t), r = J(t);
+                            n = 1 !== m && 0 === _ ? o + r <= e : o < e && o + r < e + l;
                         }
-                        return n && (e += o - A(t)), e;
+                        return n && (e += o - J(t)), e;
                     }, 0));
                     for (const [t, o] of e) {
-                        const e = A(t), n = z(M, t, o);
-                        r && (R += n ? o : o - e);
+                        const e = J(t), n = $(C, t, o);
+                        r && (k += n ? o : o - e);
                     }
-                    r && l && R > l && (N(((e, t) => {
+                    r && l && k > l && (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 = v(n), s = r.length, i = s / 2 | 0, l = s % 2 == 0 ? (r[i - 1] + r[i]) / 2 : r[i], c = e.o;
-                        return ((e.o = l) - c) * a(t - o, 0);
-                    })(M, y(M, H()))), r = !1), d = 3, n = !0;
+                        const r = p(n), i = r.length, s = i / 2 | 0, l = i % 2 == 0 ? (r[s - 1] + r[s]) / 2 : r[s], c = e.o;
+                        return ((e.o = l) - c) * d(t - o, 0);
+                    })(C, b(C, E()))), r = !1), u = 3, n = !0;
                     break;
                 }
 
               case 4:
-                l !== t && (l || (T = n = !0), l = t, d = 3);
+                l !== t && (l || (R = n = !0), l = t, u = 3);
                 break;
 
               case 5:
-                t[1] ? (N(x(M, t[0], !0)), w = 2, d = 1) : (x(M, t[0]), d = 1);
+                t[1] ? (L(y(C, t[0], !0)), _ = 2, u = 1) : (y(C, t[0]), u = 1);
                 break;
 
               case 6:
@@ -159,74 +160,74 @@ const u = null, {min: d, max: a, abs: h, floor: g} = Math, p = (e, t, o) => d(o,
                 break;
 
               case 7:
-                w = 1;
+                _ = 1;
                 break;
 
               case 8:
-                I = W(t, t + l), d = 1;
+                x = H(t, t + l), u = 1;
             }
-            d && (i = 1 + (2147483647 & i), o && p && (g += p, p = 0), O.forEach(([e, t]) => {
-                d & e && t(n);
+            u && (s = 1 + (2147483647 & s), o && g && (h += g, g = 0), M.forEach(([e, t]) => {
+                u & e && t(n);
             }));
         }
     };
-}, H = setTimeout, W = (e, t) => t ? -e : e, B = (e, t, o, n, r, s) => {
-    const i = Date.now;
-    let l = 0, c = !1, f = !1, d = !1, a = !1;
-    const h = (() => {
+}, E = setTimeout, H = (e, t) => t ? -e : e, W = (e, t, o, n, r, i) => {
+    const s = Date.now;
+    let l = 0, c = !1, f = !1, u = !1, d = !1;
+    const a = (() => {
         let t;
         const o = () => {
-            t != u && clearTimeout(t);
+            null != t && clearTimeout(t);
         }, n = () => {
-            o(), t = H(() => {
-                t = u, (() => {
-                    if (c || f) return c = !1, void h();
-                    d = !1, e.B(2);
+            o(), t = E(() => {
+                t = null, (() => {
+                    if (c || f) return c = !1, void a();
+                    u = !1, e.B(2);
                 })();
             }, 150);
         };
         return n.J = o, n;
-    })(), g = () => {
-        l = i(), d && (a = !0), s && e.B(6, s()), e.B(1, n()), h();
-    }, p = t => {
+    })(), h = () => {
+        l = s(), u && (d = !0), i && e.B(6, i()), e.B(1, n()), a();
+    }, g = t => {
         if (c || !e.M() || t.ctrlKey) return;
-        const n = i() - l;
+        const n = s() - l;
         150 > n && 50 < n && (o ? t.deltaX : t.deltaY) && (c = !0);
+    }, p = () => {
+        f = !0, u = d = !1;
     }, v = () => {
-        f = !0, d = a = !1;
-    }, m = () => {
-        f = !1, C() && (d = !0);
+        f = !1, T() && (u = !0);
     };
-    return t.addEventListener("scroll", g), t.addEventListener("wheel", p, {
+    return t.addEventListener("scroll", h), t.addEventListener("wheel", g, {
         passive: !0
-    }), t.addEventListener("touchstart", v, {
+    }), t.addEventListener("touchstart", p, {
         passive: !0
-    }), t.addEventListener("touchend", m, {
+    }), t.addEventListener("touchend", v, {
         passive: !0
     }), {
         A: () => {
-            t.removeEventListener("scroll", g), t.removeEventListener("wheel", p), t.removeEventListener("touchstart", v), 
-            t.removeEventListener("touchend", m), h.J();
+            t.removeEventListener("scroll", h), t.removeEventListener("wheel", g), t.removeEventListener("touchstart", p), 
+            t.removeEventListener("touchend", v), a.J();
         },
         L: () => {
             const [t, o] = e.H();
-            t && (r(t, o, a), a = !1, o && e.p() > e.h() && e.B(1, n()));
+            t && (r(t, o, d), d = !1, o && e.p() > e.h() && e.B(1, n()));
         }
     };
-}, J = (e, t, o) => {
+}, B = (e, t, o) => {
     let n;
-    return [ async (r, s) => {
+    return [ async (r, i) => {
         if (!await t()) return;
         n && n();
-        const i = () => {
-            const [t, o] = _();
+        const s = () => {
+            const [t, o] = m();
             return n = () => {
                 o(!1);
-            }, e.p() && H(n, 150), [ t, e.W(2, () => {
+            }, e.p() && E(n, 150), [ t, e.W(2, () => {
                 o(!0);
             }) ];
         };
-        if (s && M()) e.B(8, r()), m(async () => {
+        if (i && C()) e.B(8, r()), v(async () => {
             for (;;) {
                 let t = !0;
                 for (let [o, n] = e.S(); o <= n; o++) if (e.I(o)) {
@@ -234,16 +235,16 @@ const u = null, {min: d, max: a, abs: h, floor: g} = Math, p = (e, t, o) => d(o,
                     break;
                 }
                 if (t) break;
-                const [o, n] = i();
+                const [o, n] = s();
                 try {
                     if (!await o) return;
                 } finally {
                     n();
                 }
             }
-            e.B(7), o(r(), s);
+            e.B(7), o(r(), i);
         }); else for (;;) {
-            const [t, n] = i();
+            const [t, n] = s();
             try {
                 if (e.B(7), o(r()), !await t) return;
             } finally {
@@ -253,30 +254,30 @@ const u = null, {min: d, max: a, abs: h, floor: g} = Math, p = (e, t, o) => d(o,
     }, () => {
         n && n();
     } ];
-}, A = (e, t) => {
-    let o, n, r = _(), s = !1;
-    const i = t ? "scrollLeft" : "scrollTop", l = t ? "overflowX" : "overflowY", [c, f] = J(e, () => r[0], (e, n) => {
-        e = W(e, s), n ? o.scrollTo({
+}, J = (e, t) => {
+    let o, n, r = m(), i = !1;
+    const s = t ? "scrollLeft" : "scrollTop", l = t ? "overflowX" : "overflowY", [c, f] = B(e, () => r[0], (e, n) => {
+        e = H(e, i), n ? o.scrollTo({
             [t ? "left" : "top"]: e,
             behavior: "smooth"
-        }) : o[i] = e;
+        }) : o[s] = e;
     });
     return {
         N(c, u) {
-            o = u, t && (s = "rtl" === getComputedStyle(u).direction), n = B(e, u, t, () => W(u[i], s), (t, o, n) => {
+            o = u, t && (i = "rtl" === getComputedStyle(u).direction), n = W(e, u, t, () => H(u[s], i), (t, o, n) => {
                 if (n) {
                     const e = u.style, t = e[l];
-                    e[l] = "hidden", H(() => {
+                    e[l] = "hidden", E(() => {
                         e[l] = t;
                     });
                 }
-                u[i] = W(e.C() + t, s), o && f();
+                u[s] = H(e.C() + t, i), o && f();
             }), r[1](!0);
         },
         v() {
-            n && n.A(), r[1](!1), r = _();
+            n && n.A(), r[1](!1), r = m();
         },
-        P: () => s,
+        P: () => i,
         V(e) {
             c(() => e);
         },
@@ -284,7 +285,7 @@ const u = null, {min: d, max: a, abs: h, floor: g} = Math, p = (e, t, o) => d(o,
             t += e.C(), c(() => t);
         },
         Y(t, {align: o, smooth: n, offset: r = 0} = {}) {
-            if (t = p(t, 0, e.T() - 1), "nearest" === o) {
+            if (t = g(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;
@@ -297,55 +298,55 @@ const u = null, {min: d, max: a, abs: h, floor: g} = Math, p = (e, t, o) => d(o,
             n && n.L();
         }
     };
-}, L = (e, t) => {
-    let o, n, r = _(), s = !1;
-    const i = t ? "left" : "top", [l] = J(e, () => r[0], (e, t) => {
-        e = W(e, s);
-        const n = T(R(o));
+}, A = (e, t) => {
+    let o, n, r = m(), i = !1;
+    const s = t ? "left" : "top", [l] = B(e, () => r[0], (e, t) => {
+        e = H(e, i);
+        const n = R(k(o));
         t ? n.scroll({
-            [i]: e,
+            [s]: e,
             behavior: "smooth"
         }) : n.scroll({
-            [i]: e
+            [s]: e
         });
     }), c = (e, t, o, n, r = 0) => {
-        const i = n ? "offsetLeft" : "offsetTop", l = r + (n && s ? o.innerWidth - e[i] - e.offsetWidth : e[i]), f = e.offsetParent;
+        const s = n ? "offsetLeft" : "offsetTop", l = r + (n && i ? o.innerWidth - e[s] - e.offsetWidth : e[s]), f = e.offsetParent;
         return e !== t && f ? c(f, t, o, n, l) : l;
     };
     return {
         N(l) {
             o = l;
-            const f = t ? "scrollX" : "scrollY", u = R(l), d = T(u);
-            t && (s = "rtl" === getComputedStyle(k(u)).direction), n = B(e, d, t, () => W(d[f], s), (t, o) => {
+            const f = t ? "scrollX" : "scrollY", u = k(l), d = R(u);
+            t && (i = "rtl" === getComputedStyle(I(u)).direction), n = W(e, d, t, () => H(d[f], i), (t, o) => {
                 o ? d.scroll({
-                    [i]: W(e.C() + t, s)
+                    [s]: H(e.C() + t, i)
                 }) : d.scrollBy({
-                    [i]: W(t, s)
+                    [s]: H(t, i)
                 });
             }, () => c(l, u.body, d, t)), r[1](!0);
         },
         v() {
-            n && n.A(), o = void 0, r[1](!1), r = _();
+            n && n.A(), o = void 0, r[1](!1), r = m();
         },
-        P: () => s,
+        P: () => i,
         q: () => {
             n && n.L();
         },
-        Y(n, {align: r, smooth: s, offset: i = 0} = {}) {
+        Y(n, {align: r, smooth: i, offset: s = 0} = {}) {
             if (!o) return;
-            if (n = p(n, 0, e.T() - 1), "nearest" === r) {
+            if (n = g(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";
                 }
             }
-            const f = R(o), u = T(f), d = k(f), a = () => e.p() - (t ? d.clientWidth : d.clientHeight);
-            l(() => i + c(o, f.body, u, t) + e.k(n) + ("end" === r ? e.R(n) - (e.p() - a()) : "center" === r ? (e.R(n) - (e.p() - a())) / 2 : 0), s);
+            const f = k(o), u = R(f), d = I(f), a = () => e.p() - (t ? d.clientWidth : d.clientHeight);
+            l(() => s + c(o, f.body, u, t) + e.k(n) + ("end" === r ? e.R(n) - (e.p() - a()) : "center" === r ? (e.R(n) - (e.p() - a())) / 2 : 0), i);
         }
     };
-}, N = (e, t) => {
-    const o = A(e, !1), n = A(t, !0);
+}, L = (e, t) => {
+    const o = J(e, !1), n = J(t, !0);
     return {
         N(e, t) {
             o.N(e, t), n.N(e, t);
@@ -367,11 +368,11 @@ const u = null, {min: d, max: a, abs: h, floor: g} = Math, p = (e, t, o) => d(o,
             o.q(), n.q();
         }
     };
-}, P = e => {
+}, N = e => {
     let t;
     return {
         j(o) {
-            (t || (t = new (T(R(o)).ResizeObserver)(e))).observe(o);
+            (t || (t = new (R(k(o)).ResizeObserver)(e))).observe(o);
         },
         D(e) {
             t.unobserve(e);
@@ -380,73 +381,73 @@ const u = null, {min: d, max: a, abs: h, floor: g} = Math, p = (e, t, o) => d(o,
             t && t.disconnect();
         }
     };
-}, V = (e, t) => {
+}, P = (e, t) => {
     let o;
-    const n = t ? "width" : "height", r = new WeakMap, s = P(t => {
-        const s = [];
-        for (const {target: i, contentRect: l} of t) if (i.offsetParent) if (i === o) e.B(4, l[n]); else {
-            const e = r.get(i);
-            e != u && s.push([ e, l[n] ]);
+    const n = t ? "width" : "height", r = /* @__PURE__ */ new WeakMap, i = N(t => {
+        const i = [];
+        for (const {target: s, contentRect: l} of t) if (s.offsetParent) if (s === o) e.B(4, l[n]); else {
+            const e = r.get(s);
+            null != e && i.push([ e, l[n] ]);
         }
-        s.length && e.B(3, s);
+        i.length && e.B(3, i);
     });
     return {
         G(e) {
-            s.j(o = e);
+            i.j(o = e);
         },
-        U: (e, t) => (r.set(e, t), s.j(e), () => {
-            r.delete(e), s.D(e);
+        U: (e, t) => (r.set(e, t), i.j(e), () => {
+            r.delete(e), i.D(e);
         }),
-        v: s.A
+        v: i.A
     };
-}, X = (e, t) => {
-    const o = t ? "width" : "height", n = t ? "innerWidth" : "innerHeight", r = new WeakMap, s = P(t => {
+}, V = (e, t) => {
+    const o = t ? "width" : "height", n = t ? "innerWidth" : "innerHeight", r = /* @__PURE__ */ new WeakMap, i = N(t => {
         const n = [];
-        for (const {target: e, contentRect: s} of t) {
+        for (const {target: e, contentRect: i} of t) {
             if (!e.offsetParent) continue;
             const t = r.get(e);
-            t != u && n.push([ t, s[o] ]);
+            null != t && n.push([ t, i[o] ]);
         }
         n.length && e.B(3, n);
     });
-    let i;
+    let s;
     return {
         G(t) {
-            const o = T(R(t)), r = () => {
+            const o = R(k(t)), r = () => {
                 e.B(4, o[n]);
             };
-            o.addEventListener("resize", r), m(r), i = () => {
+            o.addEventListener("resize", r), v(r), s = () => {
                 o.removeEventListener("resize", r);
             };
         },
-        U: (e, t) => (r.set(e, t), s.j(e), () => {
-            r.delete(e), s.D(e);
+        U: (e, t) => (r.set(e, t), i.j(e), () => {
+            r.delete(e), i.D(e);
         }),
         v() {
-            i && i(), s.A();
+            s && s(), i.A();
         }
     };
-}, Y = (e, t) => {
+}, X = (e, t) => {
     let o;
-    const n = new WeakMap, r = new Set, s = new Set, i = new Map, l = (e, t) => `${e}-${t}`, c = P(c => {
-        const f = new Set, u = new Set;
-        for (const {target: r, contentRect: {width: s, height: d}} of c) if (r.offsetParent) if (r === o) e.B(4, d), 
-        t.B(4, s); else {
+    const n = /* @__PURE__ */ new WeakMap, r = /* @__PURE__ */ new Set, i = /* @__PURE__ */ new Set, s = /* @__PURE__ */ new Map, l = (e, t) => `${e}-${t}`, c = N(c => {
+        const f = /* @__PURE__ */ new Set, u = /* @__PURE__ */ new Set;
+        for (const {target: r, contentRect: {width: i, height: d}} of c) if (r.offsetParent) if (r === o) e.B(4, d), 
+        t.B(4, i); else {
             const e = n.get(r);
             if (e) {
-                const [t, o] = e, n = l(t, o), r = i.get(n);
+                const [t, o] = e, n = l(t, o), r = s.get(n);
                 let c, a;
-                r ? (r[0] !== d && (c = !0), r[1] !== s && (a = !0)) : c = a = !0, c && f.add(t), 
-                a && u.add(o), (c || a) && i.set(n, [ d, s ]);
+                r ? (r[0] !== d && (c = !0), r[1] !== i && (a = !0)) : c = a = !0, c && f.add(t), 
+                a && u.add(o), (c || a) && s.set(n, [ d, i ]);
             }
         }
         if (f.size) {
             const t = [];
             f.forEach(e => {
                 let o = 0;
-                s.forEach(t => {
-                    const n = i.get(l(e, t));
-                    n && (o = a(o, n[0]));
+                i.forEach(t => {
+                    const n = s.get(l(e, t));
+                    n && (o = d(o, n[0]));
                 }), o && t.push([ e, o ]);
             }), e.B(3, t);
         }
@@ -455,8 +456,8 @@ const u = null, {min: d, max: a, abs: h, floor: g} = Math, p = (e, t, o) => d(o,
             u.forEach(t => {
                 let o = 0;
                 r.forEach(e => {
-                    const n = i.get(l(e, t));
-                    n && (o = a(o, n[1]));
+                    const n = s.get(l(e, t));
+                    n && (o = d(o, n[1]));
                 }), o && e.push([ t, o ]);
             }), t.B(3, e);
         }
@@ -465,101 +466,103 @@ const u = null, {min: d, max: a, abs: h, floor: g} = Math, p = (e, t, o) => d(o,
         G(e) {
             c.j(o = e);
         },
-        U: (e, t, o) => (n.set(e, [ t, o ]), r.add(t), s.add(o), c.j(e), () => {
+        U: (e, t, o) => (n.set(e, [ t, o ]), r.add(t), i.add(o), c.j(e), () => {
             n.delete(e), c.D(e);
         }),
         F(o) {
-            for (const [t] of o) for (let o = 0; o < e.T(); o++) i.delete(l(o, t));
+            for (const [t] of o) for (let o = 0; o < e.T(); o++) s.delete(l(o, t));
             t.B(3, o);
         },
         K(o) {
-            for (const [e] of o) for (let o = 0; o < t.T(); o++) i.delete(l(e, o));
+            for (const [e] of o) for (let o = 0; o < t.T(); o++) s.delete(l(e, o));
             e.B(3, o);
         },
         v: c.A
     };
-}, q = I ? t : o, 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);
-}, G = (e, t) => {
+}, Y = x ? r : o, q = "current", j = (e, t) => {
+    if (Array.isArray(e)) for (const o of e) j(o, t); else null == e || "boolean" == typeof e || t.push(e);
+}, D = (e, t) => {
     const o = e.key;
     return null != o ? o : "_" + t;
+}, G = e => {
+    const t = l(null);
+    return t.current || (t.current = e());
 }, U = e => {
-    const t = n(null);
-    return t[j] || (t[j] = e());
-}, F = e => {
-    const t = n(e);
-    return q(() => {
-        t[j] = e;
+    const t = l(e);
+    return Y(() => {
+        t[q] = e;
     }, [ e ]), t;
-}, K = /*#__PURE__*/ r(({Z: t, ee: o, te: r, oe: i, ne: l, re: c, se: f, ie: u}) => {
-    const d = n(null);
-    q(() => o(d[j], r), [ r ]);
-    const a = s(() => {
+}, F = /*#__PURE__*/ t(({Z: e, ee: t, te: o, oe: n, ne: r, re: s, ie: f, se: u}) => {
+    const d = l(null);
+    Y(() => t(d[q], o), [ o ]);
+    const a = i(() => {
         const e = {
             contain: "layout style",
-            position: l && u ? void 0 : "absolute",
+            position: r && u ? void 0 : "absolute",
             [f ? "height" : "width"]: "100%",
             [f ? "top" : "left"]: 0,
-            [f ? "left" : "top"]: i,
-            visibility: !l || u ? void 0 : "hidden"
+            [f ? "left" : "top"]: n,
+            visibility: !r || u ? void 0 : "hidden"
         };
         return f && (e.display = "inline-flex"), e;
-    }, [ i, l, u, f ]);
-    return e(c, "string" == typeof c ? {
+    }, [ n, r, u, f ]);
+    /* @__PURE__ */
+    return c(s, "string" == typeof s ? {
         ref: d,
         style: a,
-        children: t
+        children: e
     } : {
         ref: d,
         style: a,
-        index: r,
-        children: t
+        index: o,
+        children: e
     });
-}), Q = (e, t) => s(() => {
+}), K = (e, t) => i(() => {
     if ("function" == typeof e) return [ o => e(t[o], o), t.length ];
     const o = (e => {
         const t = [];
-        return D(e, t), t;
+        return j(e, t), t;
     })(e);
     return [ e => o[e], o.length ];
-}, [ e, t ]), Z = /*#__PURE__*/ i(({children: t, data: o, bufferSize: r, itemSize: s, shift: i, horizontal: u, keepMounted: d, cache: a, startMargin: h = 0, ssrCount: g, as: p = "div", item: _ = "div", scrollRef: w, onScroll: S, onScrollEnd: $}, z) => {
-    const [b, y] = Q(t, o), x = n(null), I = n(!!g), k = F(S), R = F($), [T, C, M, H] = U(() => {
-        const e = !!u, t = E(y, s, g, a, !s);
-        return [ t, V(t, e), A(t, e), e ];
+}, [ e, t ]), Q = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: r, shift: i, horizontal: u, keepMounted: d, cache: a, startMargin: h = 0, ssrCount: g, as: m = "div", item: _ = "div", scrollRef: w, onScroll: S, onScrollEnd: $}, z) => {
+    const [b, y] = K(e, t), x = l(null), I = l(!!g), k = U(S), R = U($), [T, C, E, H] = G(() => {
+        const e = !!u, t = O(y, r, g, a, !r);
+        return [ t, P(t, e), J(t, e), e ];
     });
     y !== T.T() && T.B(5, [ y, i ]), h !== T.O() && T.B(6, h);
-    const [W, B] = l(T.m, void 0, T.m), J = T.M(), L = T.h(), N = M.P(), P = [], X = t => {
-        const o = b(t);
-        return e(K, {
+    const [W, B] = s(T.m, void 0, T.m), A = T.M(), L = T.h(), N = E.P(), V = [], X = e => {
+        const t = b(e);
+        /* @__PURE__ */
+        return c(F, {
             ee: C.U,
-            te: t,
-            oe: T.k(t, N),
-            ne: T.I(t),
+            te: e,
+            oe: T.k(e, N),
+            ne: T.I(e),
             re: _,
-            Z: o,
-            se: H,
-            ie: I[j]
-        }, G(o, t));
+            Z: t,
+            ie: H,
+            se: I[q]
+        }, D(t, e));
     };
-    if (q(() => {
-        I[j] = !1, T.W(1, e => {
+    if (Y(() => {
+        I[q] = !1, T.W(1, e => {
             e ? f(B) : B();
         }), T.W(4, () => {
-            k[j] && k[j](T.C());
+            k.current && k.current(T.C());
         }), T.W(8, () => {
-            R[j] && R[j]();
+            R.current && R.current();
         });
-        const e = x[j], t = t => {
-            C.G(t), M.N(e, t);
+        const e = x[q], t = t => {
+            C.G(t), E.N(e, t);
         };
-        return w ? m(() => {
-            w[j] && t(w[j]);
+        return w ? v(() => {
+            w.current && t(w[q]);
         }) : t(e.parentElement), () => {
-            T.v(), C.v(), M.v();
+            T.v(), C.v(), E.v();
         };
-    }, []), q(() => {
-        M.q();
-    }, [ W ]), c(z, () => ({
+    }, []), Y(() => {
+        E.q();
+    }, [ W ]), n(z, () => ({
         get cache() {
             return T._();
         },
@@ -567,7 +570,7 @@ const u = null, {min: d, max: a, abs: h, floor: g} = Math, p = (e, t, o) => d(o,
             return T.C();
         },
         get scrollSize() {
-            return O(T);
+            return M(T);
         },
         get viewportSize() {
             return T.p();
@@ -575,17 +578,18 @@ const u = null, {min: d, max: a, abs: h, floor: g} = Math, p = (e, t, o) => d(o,
         findItemIndex: T.$,
         getItemOffset: T.k,
         getItemSize: T.R,
-        scrollToIndex: M.Y,
-        scrollTo: M.V,
-        scrollBy: M.X
+        scrollToIndex: E.Y,
+        scrollTo: E.V,
+        scrollBy: E.X
     }), []), d) {
         const e = new Set(d);
-        for (let [t, o] = T.S(r); t <= o; t++) e.add(t);
-        v([ ...e ]).forEach(e => {
-            P.push(X(e));
+        for (let [t, n] = T.S(o); t <= n; t++) e.add(t);
+        p([ ...e ]).forEach(e => {
+            V.push(X(e));
         });
-    } else for (let [e, t] = T.S(r); e <= t; e++) P.push(X(e));
-    return e(p, {
+    } else for (let [e, t] = T.S(o); e <= t; e++) V.push(X(e));
+    /* @__PURE__ */
+    return c(m, {
         ref: x,
         style: {
             contain: "size style",
@@ -594,11 +598,11 @@ const u = null, {min: d, max: a, abs: h, floor: g} = Math, p = (e, t, o) => d(o,
             position: "relative",
             width: H ? L : "100%",
             height: H ? "100%" : L,
-            pointerEvents: J ? "none" : void 0
+            pointerEvents: A ? "none" : void 0
         },
-        children: P
+        children: V
     });
-}), ee = /*#__PURE__*/ i(({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("div", {
+}), Z = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: n, shift: r, horizontal: i, keepMounted: s, cache: l, ssrCount: f, item: u, onScroll: d, onScrollEnd: a, style: h, ...g}, p) => /* @__PURE__ */ c("div", {
     ...g,
     style: {
         display: i ? "inline-block" : "block",
@@ -608,43 +612,43 @@ const u = null, {min: d, max: a, abs: h, floor: g} = Math, p = (e, t, o) => d(o,
         height: "100%",
         ...h
     },
-    children: e(Z, {
+    children: /* @__PURE__ */ c(Q, {
         ref: p,
-        data: o,
-        bufferSize: n,
-        itemSize: r,
-        shift: s,
+        data: t,
+        bufferSize: o,
+        itemSize: n,
+        shift: r,
         horizontal: i,
-        keepMounted: l,
-        cache: c,
+        keepMounted: s,
+        cache: l,
         ssrCount: f,
         item: u,
         onScroll: d,
         onScrollEnd: a,
-        children: t
+        children: e
     })
-})), te = /*#__PURE__*/ i(({children: t, data: o, bufferSize: r, itemSize: s, shift: i, horizontal: u, cache: d, ssrCount: a, as: h = "div", item: g = "div", onScroll: p, onScrollEnd: v}, m) => {
-    const [_, w] = Q(t, o), S = n(null), $ = F(p), z = F(v), b = n(!!a), [y, x, I, k] = U(() => {
-        const e = !!u, t = E(w, s, a, d, !s);
-        return [ t, X(t, e), L(t, e), e ];
+})), ee = /*#__PURE__*/ e(({children: e, data: t, bufferSize: o, itemSize: r, shift: i, horizontal: u, cache: d, ssrCount: a, as: h = "div", item: g = "div", onScroll: p, onScrollEnd: v}, m) => {
+    const [_, w] = K(e, t), S = l(null), $ = U(p), z = U(v), b = l(!!a), [y, x, I, k] = G(() => {
+        const e = !!u, t = O(w, r, a, d, !r);
+        return [ t, V(t, e), A(t, e), e ];
     });
     w !== y.T() && y.B(5, [ w, i ]);
-    const [R, T] = l(y.m, void 0, y.m), C = y.M(), M = y.h(), O = I.P(), H = [];
-    q(() => {
-        b[j] = !1, y.W(1, e => {
+    const [R, T] = s(y.m, void 0, y.m), C = y.M(), M = y.h(), E = I.P(), H = [];
+    Y(() => {
+        b[q] = !1, y.W(1, e => {
             e ? f(T) : T();
         }), y.W(4, () => {
-            $[j] && $[j]();
+            $.current && $.current();
         }), y.W(8, () => {
-            z[j] && z[j]();
+            z.current && z.current();
         });
-        const e = S[j];
+        const e = S[q];
         return x.G(e), I.N(e), () => {
             y.v(), x.v(), I.v();
         };
-    }, []), q(() => {
+    }, []), Y(() => {
         I.q();
-    }, [ R ]), c(m, () => ({
+    }, [ R ]), n(m, () => ({
         get cache() {
             return y._();
         },
@@ -659,20 +663,21 @@ const u = null, {min: d, max: a, abs: h, floor: g} = Math, p = (e, t, o) => d(o,
         getItemSize: y.R,
         scrollToIndex: I.Y
     }), []);
-    for (let [t, o] = y.S(r); t <= o; t++) {
-        const o = _(t);
-        H.push(e(K, {
+    for (let [e, t] = y.S(o); e <= t; e++) {
+        const t = _(e);
+        H.push(/* @__PURE__ */ c(F, {
             ee: x.U,
-            te: t,
-            oe: y.k(t, O),
-            ne: y.I(t),
+            te: e,
+            oe: y.k(e, E),
+            ne: y.I(e),
             re: g,
-            Z: o,
-            se: k,
-            ie: b[j]
-        }, G(o, t)));
+            Z: t,
+            ie: k,
+            se: b[q]
+        }, D(t, e)));
     }
-    return e(h, {
+    /* @__PURE__ */
+    return c(h, {
         ref: S,
         style: {
             contain: "size style",
@@ -685,46 +690,46 @@ const u = null, {min: d, max: a, abs: h, floor: g} = Math, p = (e, t, o) => d(o,
         },
         children: H
     });
-}), oe = (e, t) => `${e}-${t}`, ne = /*#__PURE__*/ r(({Z: t, ee: o, le: r, ce: i, fe: l, ue: c, de: f, ae: u, ne: d, he: a}) => {
-    const h = n(null);
-    return q(() => o.U(h[j], r, i), [ i, r ]), e(a, {
+}), te = (e, t) => `${e}-${t}`, oe = /*#__PURE__*/ t(({Z: e, ee: t, le: o, ce: n, fe: r, ue: s, de: f, ae: u, ne: d, he: a}) => {
+    const h = l(null);
+    return Y(() => t.U(h[q], o, n), [ n, o ]), /* @__PURE__ */ c(a, {
         ref: h,
-        style: s(() => ({
+        style: i(() => ({
             contain: "layout style",
             display: "grid",
             position: "absolute",
-            top: l,
-            left: c,
+            top: r,
+            left: s,
             visibility: d ? "hidden" : void 0,
             minHeight: f,
             minWidth: u
-        }), [ l, c, u, f, d ]),
-        children: t
+        }), [ r, s, u, f, d ]),
+        children: e
     });
-}), re = /*#__PURE__*/ i(({children: t, row: o, col: r, cellHeight: i = 40, cellWidth: u = 100, bufferSize: d, ssrRowCount: a, ssrColCount: h, item: g = "div", domRef: p, onScroll: v, onScrollEnd: m, style: _, ...w}, S) => {
-    const [$, z, b, y] = U(() => {
-        const e = E(o, i, a), t = E(r, u, h);
-        return [ e, t, Y(e, t), N(e, t) ];
+}), ne = /*#__PURE__*/ e(({children: e, row: t, col: o, cellHeight: r = 40, cellWidth: u = 100, bufferSize: d, ssrRowCount: a, ssrColCount: h, item: g = "div", domRef: p, onScroll: v, onScrollEnd: m, style: _, ...w}, S) => {
+    const [$, z, b, y] = G(() => {
+        const e = O(t, r, a), n = O(o, u, h);
+        return [ e, n, X(e, n), L(e, n) ];
     });
-    o !== $.T() && $.B(5, [ o ]), r !== z.T() && z.B(5, [ r ]);
-    const [x, I] = l($.m, void 0, $.m), [k, R] = l(z.m, void 0, z.m), T = $.M(), C = z.M(), M = O($), H = O(z), W = n(null), B = F(v), J = F(m);
-    q(() => {
+    t !== $.T() && $.B(5, [ t ]), o !== z.T() && z.B(5, [ o ]);
+    const [x, I] = s($.m, void 0, $.m), [k, R] = s(z.m, void 0, z.m), T = $.M(), C = z.M(), E = M($), H = M(z), W = l(null), B = U(v), J = U(m);
+    Y(() => {
         $.W(1, e => {
             e ? f(I) : I();
         }), z.W(1, e => {
             e ? f(R) : R();
         }), $.W(4, () => {
-            B[j] && B[j]($.C());
+            B.current && B.current($.C());
         }), $.W(8, () => {
-            J[j] && J[j]();
+            J.current && J.current();
         });
-        const e = W[j], t = e.parentElement;
+        const e = W[q], t = e.parentElement;
         return b.G(t), y.N(e, t), () => {
             $.v(), z.v(), b.v(), y.v();
         };
-    }, []), q(() => {
+    }, []), Y(() => {
         y.q();
-    }, [ x, k ]), c(S, () => ({
+    }, [ x, k ]), n(S, () => ({
         get scrollTop() {
             return $.C();
         },
@@ -732,10 +737,10 @@ const u = null, {min: d, max: a, abs: h, floor: g} = Math, p = (e, t, o) => d(o,
             return z.C();
         },
         get scrollHeight() {
-            return O($);
+            return M($);
         },
         get scrollWidth() {
-            return O(z);
+            return M(z);
         },
         get viewportHeight() {
             return $.p();
@@ -759,29 +764,30 @@ const u = null, {min: d, max: a, abs: h, floor: g} = Math, p = (e, t, o) => d(o,
         scrollTo: y.V,
         scrollBy: y.X
     }), []);
-    const A = s(() => {
-        const e = new Map;
+    const A = i(() => {
+        const t = /* @__PURE__ */ new Map;
         return (o, n) => {
-            let r = e.get(oe(o, n));
-            return r || e.set(oe(o, n), r = t({
+            let r = t.get(te(o, n));
+            return r || t.set(te(o, n), r = e({
                 rowIndex: o,
                 colIndex: n
             })), r;
         };
-    }, [ t ]), L = y.P(), [P, V] = $.S(d), [X, D] = z.S(d), G = [];
-    for (let t = P; t <= V; t++) for (let o = X; o <= D; o++) G.push(e(ne, {
+    }, [ e ]), N = y.P(), [P, V] = $.S(d), [j, D] = z.S(d), F = [];
+    for (let e = P; e <= V; e++) for (let t = j; t <= D; t++) F.push(/* @__PURE__ */ c(oe, {
         ee: b,
-        le: t,
-        ce: o,
-        fe: $.k(t),
-        ue: z.k(o, L),
-        de: $.R(t),
-        ae: z.R(o),
-        ne: $.I(t) || z.I(o),
+        le: e,
+        ce: t,
+        fe: $.k(e),
+        ue: z.k(t, N),
+        de: $.R(e),
+        ae: z.R(t),
+        ne: $.I(e) || z.I(t),
         he: g,
-        Z: A(t, o)
-    }, oe(t, o)));
-    return e("div", {
+        Z: A(e, t)
+    }, te(e, t)));
+    /* @__PURE__ */
+    return c("div", {
         ref: p,
         ...w,
         style: {
@@ -791,7 +797,7 @@ const u = null, {min: d, max: a, abs: h, floor: g} = Math, p = (e, t, o) => d(o,
             height: "100%",
             ..._
         },
-        children: e("div", {
+        children: /* @__PURE__ */ c("div", {
             ref: W,
             style: {
                 contain: "size style",
@@ -799,13 +805,13 @@ const u = null, {min: d, max: a, abs: h, floor: g} = Math, p = (e, t, o) => d(o,
                 flex: "none",
                 position: "relative",
                 width: H,
-                height: M,
+                height: E,
                 pointerEvents: T || C ? "none" : void 0
             },
-            children: G
+            children: F
         })
     });
 });
 
-export { ee as VList, Z as Virtualizer, te as WindowVirtualizer, re as experimental_VGrid };
-//# sourceMappingURL=index.js.map
+export { Z as VList, Q as Virtualizer, ee as WindowVirtualizer, ne as experimental_VGrid };
+//# sourceMappingURL=index.js.map